{"version":3,"sources":["webpack:///D:/a/11/s/node_modules/headroom.js/dist/headroom.js","webpack:///D:/a/11/s/node_modules/object-fit-images/dist/ofi.common-js.js","webpack:///D:/a/11/s/node_modules/rellax/rellax.js","webpack:///D:/a/11/s/node_modules/lodash/now.js","webpack:///D:/a/11/s/node_modules/lodash/_baseTrim.js","webpack:///D:/a/11/s/node_modules/lodash/_trimmedEndIndex.js","webpack:///D:/a/11/s/node_modules/lodash/_getRawTag.js","webpack:///D:/a/11/s/node_modules/lodash/_objectToString.js","webpack:///D:/a/11/s/node_modules/lodash/debounce.js","webpack:///(webpack)/buildin/amd-options.js","webpack:///D:/a/11/s/node_modules/lodash/_root.js","webpack:///D:/a/11/s/node_modules/lodash/isObject.js","webpack:///D:/a/11/s/node_modules/lodash/_Symbol.js","webpack:///D:/a/11/s/node_modules/lodash/_baseGetTag.js","webpack:///D:/a/11/s/node_modules/lodash/isObjectLike.js","webpack:///D:/a/11/s/node_modules/selector-set/selector-set.next.js","webpack:///D:/a/11/s/node_modules/delegated-events/dist/index.esm.js","webpack:///D:/a/11/s/node_modules/lodash/isSymbol.js","webpack:///D:/a/11/s/node_modules/lodash/lodash.js","webpack:///D:/a/11/s/node_modules/lodash/_freeGlobal.js","webpack:///D:/a/11/s/node_modules/lodash/toNumber.js","webpack:///D:/a/11/s/node_modules/smartquotes/dist/smartquotes.js","webpack:///D:/a/11/s/node_modules/lazysizes/plugins/attrchange/ls.attrchange.js"],"names":["global","factory","_typeof","exports","module","undefined","__WEBPACK_AMD_DEFINE_RESULT__","define","__WEBPACK_AMD_DEFINE_FACTORY__","call","__webpack_require__","this","isBrowser","window","createScroller","element","obj","document","nodeType","isDocument","isWindow","win","doc","body","html","documentElement","scrollHeight","Math","max","offsetHeight","clientHeight","height","innerHeight","scrollY","pageYOffset","parentNode","scrollTop","windowScroller","elementScroller","trackScroll","options","callback","rafId","isPassiveSupported","supported","passive","addEventListener","removeEventListener","err","passiveEventsSupported","scrolled","scroller","lastScrollY","details","update","round","direction","distance","abs","isOutOfBounds","top","offset","bottom","toleranceExceeded","tolerance","handleScroll","requestAnimationFrame","eventOptions","capture","destroy","cancelAnimationFrame","normalizeUpDown","t","Object","down","up","Headroom","elem","assign","classes","initialised","frozen","prototype","constructor","init","cutsTheMustard","addClass","setTimeout","self","scrollTracker","bind","keys","forEach","removeClass","unpin","hasClass","onUnpin","pin","onPin","freeze","unfreeze","onTop","notTop","onNotTop","onBottom","notBottom","onNotBottom","shouldUnpin","shouldPin","className","classList","add","apply","split","remove","every","cls","contains","pinned","unpinned","initial","OFI","propRegex","testImg","Image","style","object-position","supportsObjectFit","supportsObjectPosition","supportsOFI","supportsCurrentSrc","currentSrc","nativeGetAttribute","getAttribute","nativeSetAttribute","setAttribute","autoModeEnabled","setPlaceholder","img","width","placeholder","w","h","createPlaceholder","onImageReady","naturalWidth","fixOne","el","parsed","getComputedStyle","fontFamily","props","exec","getStyle","ofi","skipTest","srcset","src","naturalHeight","descriptors","get","prop","set","value","defineProperty","ss","keepSrcUsable","console","warn","picturefill","pf","_","ns","evaled","fillImg","reselect","curSrc","polyfillCurrentSrc","backgroundImage","replace","backgroundPosition","backgroundRepeat","backgroundOrigin","test","backgroundSize","fix","imgs","opts","startAutoMode","getElementsByTagName","querySelectorAll","i","length","e","target","tagName","watchMQ","getOfiImageMaybe","name","HTMLImageElement","String","hijackAttributes","Rellax","create","posY","screenY","posX","screenX","blocks","pause","loop","webkitRequestAnimationFrame","mozRequestAnimationFrame","msRequestAnimationFrame","oRequestAnimationFrame","loopId","clearLoop","mozCancelAnimationFrame","clearTimeout","transformProp","testEl","createElement","transform","vendors","vendor","speed","center","wrapper","relativeToWrapper","vertical","horizontal","key","elements","Error","elems","querySelector","cssText","innerWidth","setPosition","block","createBlock","push","cacheBlocks","animate","dataPercentage","dataSpeed","dataZindex","wrapperPosY","scrollPosY","offsetTop","pageXOffset","scrollLeft","blockTop","getBoundingClientRect","blockHeight","blockLeft","left","blockWidth","clientWidth","offsetWidth","scrollWidth","percentageY","percentageX","bases","updatePosition","indexOf","index","trimmedStyle","slice","delimiter","baseX","x","baseY","y","zindex","oldY","oldX","result","valueX","valueY","positions","positionY","positionX","translate","refresh","__WEBPACK_AMD_DEFINE_ARRAY__","root","require","Date","now","trimmedEndIndex","reTrimStart","string","reWhitespace","charAt","Symbol","objectProto","hasOwnProperty","nativeObjectToString","toString","symToStringTag","toStringTag","isOwn","tag","unmasked","isObject","toNumber","FUNC_ERROR_TEXT","nativeMax","nativeMin","min","func","wait","lastArgs","lastThis","maxWait","timerId","lastCallTime","lastInvokeTime","leading","maxing","trailing","TypeError","invokeFunc","time","args","thisArg","shouldInvoke","timeSinceLastCall","timerExpired","trailingEdge","timeWaiting","remainingWait","debounced","isInvoking","arguments","leadingEdge","cancel","flush","__webpack_amd_options__","freeGlobal","freeSelf","Function","type","getRawTag","objectToString","nullTag","undefinedTag","SelectorSet","size","uid","selectors","selectorObjects","indexes","activeIndexes","docElem","matches","webkitMatchesSelector","mozMatchesSelector","oMatchesSelector","msMatchesSelector","matchesSelector","selector","context","idRe","sel","m","match","id","classRe","baseVal","Map","tagRe","toUpperCase","nodeName","map","chunker","parseSelectorIndexes","allIndexes","j","dup","allIndexesLen","concat","rest","findByPrototype","ary","proto","len","item","isPrototypeOf","sortById","a","b","logDefaultIndexUsed","data","indexProto","objs","selectorIndexes","selectorIndex","k","selIndex","removedIds","removeAll","splice","queryAll","len2","results","els","join","sort","len3","matchedIds","d","__webpack_exports__","fire","off","on","bubbleEvents","captureEvents","propagationStopped","WeakMap","immediatePropagationStopped","currentTargets","currentTargetDesc","getOwnPropertyDescriptor","Event","before","subject","verb","fn","source","trackPropagation","trackImmediate","getCurrentTarget","defineCurrentTarget","event","getter","configurable","enumerable","dispatch","eventPhase","queue","reverse","node","_matches","matched","observers","unshift","parentElement","len1","events","detail","dispatchEvent","CustomEvent","bubbles","cancelable","baseGetTag","isObjectLike","symbolTag","LARGE_ARRAY_SIZE","CORE_ERROR_TEXT","INVALID_TEMPL_VAR_ERROR_TEXT","HASH_UNDEFINED","MAX_MEMOIZE_SIZE","PLACEHOLDER","CLONE_DEEP_FLAG","CLONE_FLAT_FLAG","CLONE_SYMBOLS_FLAG","COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","WRAP_BIND_FLAG","WRAP_BIND_KEY_FLAG","WRAP_CURRY_BOUND_FLAG","WRAP_CURRY_FLAG","WRAP_CURRY_RIGHT_FLAG","WRAP_PARTIAL_FLAG","WRAP_PARTIAL_RIGHT_FLAG","WRAP_ARY_FLAG","WRAP_REARG_FLAG","WRAP_FLIP_FLAG","DEFAULT_TRUNC_LENGTH","DEFAULT_TRUNC_OMISSION","HOT_COUNT","HOT_SPAN","LAZY_FILTER_FLAG","LAZY_MAP_FLAG","INFINITY","MAX_SAFE_INTEGER","MAX_INTEGER","NAN","MAX_ARRAY_LENGTH","MAX_ARRAY_INDEX","HALF_MAX_ARRAY_LENGTH","wrapFlags","argsTag","arrayTag","asyncTag","boolTag","dateTag","domExcTag","errorTag","funcTag","genTag","mapTag","numberTag","objectTag","proxyTag","regexpTag","setTag","stringTag","weakMapTag","weakSetTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","reEmptyStringLeading","reEmptyStringMiddle","reEmptyStringTrailing","reEscapedHtml","reUnescapedHtml","reHasEscapedHtml","RegExp","reHasUnescapedHtml","reEscape","reEvaluate","reInterpolate","reIsDeepProp","reIsPlainProp","rePropName","reRegExpChar","reHasRegExpChar","reWrapComment","reWrapDetails","reSplitDetails","reAsciiWord","reForbiddenIdentifierChars","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","rsEmoji","rsSymbol","reApos","reComboMark","reUnicode","reUnicodeWord","reHasUnicode","reHasUnicodeWord","contextProps","templateCounter","typedArrayTags","cloneableTags","stringEscapes","\\","'","\n","\r","
","
","freeParseFloat","parseFloat","freeParseInt","parseInt","freeExports","freeModule","moduleExports","freeProcess","process","nodeUtil","types","binding","nodeIsArrayBuffer","isArrayBuffer","nodeIsDate","isDate","nodeIsMap","isMap","nodeIsRegExp","isRegExp","nodeIsSet","isSet","nodeIsTypedArray","isTypedArray","arrayAggregator","array","setter","iteratee","accumulator","arrayEach","arrayEachRight","arrayEvery","predicate","arrayFilter","resIndex","arrayIncludes","baseIndexOf","arrayIncludesWith","comparator","arrayMap","Array","arrayPush","values","arrayReduce","initAccum","arrayReduceRight","arraySome","asciiSize","baseProperty","baseFindKey","collection","eachFunc","baseFindIndex","fromIndex","fromRight","strictIndexOf","baseIsNaN","baseIndexOfWith","baseMean","baseSum","object","basePropertyOf","baseReduce","current","baseTimes","n","baseTrim","baseUnary","baseValues","cacheHas","cache","has","charsStartIndex","strSymbols","chrSymbols","charsEndIndex","deburrLetter","À","Á","Â","Ã","Ä","Å","à","á","â","ã","ä","å","Ç","ç","Ð","ð","È","É","Ê","Ë","è","é","ê","ë","Ì","Í","Î","Ï","ì","í","î","ï","Ñ","ñ","Ò","Ó","Ô","Õ","Ö","Ø","ò","ó","ô","õ","ö","ø","Ù","Ú","Û","Ü","ù","ú","û","ü","Ý","ý","ÿ","Æ","æ","Þ","þ","ß","Ā","Ă","Ą","ā","ă","ą","Ć","Ĉ","Ċ","Č","ć","ĉ","ċ","č","Ď","Đ","ď","đ","Ē","Ĕ","Ė","Ę","Ě","ē","ĕ","ė","ę","ě","Ĝ","Ğ","Ġ","Ģ","ĝ","ğ","ġ","ģ","Ĥ","Ħ","ĥ","ħ","Ĩ","Ī","Ĭ","Į","İ","ĩ","ī","ĭ","į","ı","Ĵ","ĵ","Ķ","ķ","ĸ","Ĺ","Ļ","Ľ","Ŀ","Ł","ĺ","ļ","ľ","ŀ","ł","Ń","Ņ","Ň","Ŋ","ń","ņ","ň","ŋ","Ō","Ŏ","Ő","ō","ŏ","ő","Ŕ","Ŗ","Ř","ŕ","ŗ","ř","Ś","Ŝ","Ş","Š","ś","ŝ","ş","š","Ţ","Ť","Ŧ","ţ","ť","ŧ","Ũ","Ū","Ŭ","Ů","Ű","Ų","ũ","ū","ŭ","ů","ű","ų","Ŵ","ŵ","Ŷ","ŷ","Ÿ","Ź","Ż","Ž","ź","ż","ž","IJ","ij","Œ","œ","ʼn","ſ","escapeHtmlChar","&","<",">","\"","escapeStringChar","chr","hasUnicode","mapToArray","overArg","arg","replaceHolders","setToArray","setToPairs","stringSize","lastIndex","unicodeSize","stringToArray","unicodeToArray","asciiToArray","unescapeHtmlChar","&","<",">",""","'","runInContext","defaults","pick","arrayProto","funcProto","coreJsData","funcToString","idCounter","maskSrcKey","IE_PROTO","objectCtorString","oldDash","reIsNative","Buffer","Uint8Array","allocUnsafe","getPrototype","getPrototypeOf","objectCreate","propertyIsEnumerable","spreadableSymbol","isConcatSpreadable","symIterator","iterator","getNative","ctxClearTimeout","ctxNow","ctxSetTimeout","nativeCeil","ceil","nativeFloor","floor","nativeGetSymbols","getOwnPropertySymbols","nativeIsBuffer","isBuffer","nativeIsFinite","isFinite","nativeJoin","nativeKeys","nativeNow","nativeParseInt","nativeRandom","random","nativeReverse","DataView","Promise","Set","nativeCreate","metaMap","realNames","dataViewCtorString","toSource","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","symbolProto","symbolValueOf","valueOf","symbolToString","lodash","isArray","LazyWrapper","LodashWrapper","wrapperClone","baseCreate","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","arraySample","baseRandom","arraySampleSize","shuffleSelf","copyArray","baseClamp","arrayShuffle","assignMergeValue","eq","baseAssignValue","assignValue","objValue","assocIndexOf","baseAggregator","baseEach","baseAssign","copyObject","writable","baseAt","paths","skip","number","lower","upper","baseClone","bitmask","customizer","stack","isDeep","isFlat","isFull","input","initCloneArray","getTag","isFunc","cloneBuffer","initCloneObject","getSymbolsIn","copySymbolsIn","keysIn","baseAssignIn","getSymbols","copySymbols","Ctor","cloneArrayBuffer","dataView","buffer","byteOffset","byteLength","cloneDataView","cloneTypedArray","regexp","cloneRegExp","symbol","cloneSymbol","initCloneByTag","stacked","subValue","getAllKeysIn","getAllKeys","baseConformsTo","baseDelay","baseDifference","includes","isCommon","valuesLength","outer","computed","valuesIndex","templateSettings","escape","evaluate","interpolate","variable","imports","pop","hash","getMapData","pairs","createBaseEach","baseForOwn","baseEachRight","baseForOwnRight","baseEvery","baseExtremum","isSymbol","baseFilter","baseFlatten","depth","isStrict","isFlattenable","baseFor","createBaseFor","baseForRight","baseFunctions","isFunction","baseGet","path","castPath","toKey","baseGetAllKeys","keysFunc","symbolsFunc","baseGt","other","baseHas","baseHasIn","baseIntersection","arrays","othLength","othIndex","caches","maxLength","Infinity","seen","baseInvoke","parent","last","baseIsArguments","baseIsEqual","equalFunc","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","equalArrays","message","convert","isPartial","equalByTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","objProps","objLength","objStacked","othStacked","skipCtor","othValue","compared","objCtor","othCtor","equalObjects","baseIsEqualDeep","baseIsMatch","matchData","noCustomizer","srcValue","baseIsNative","isMasked","baseIteratee","identity","baseMatchesProperty","baseMatches","property","baseKeys","isPrototype","baseKeysIn","nativeKeysIn","isProto","baseLt","baseMap","isArrayLike","getMatchData","matchesStrictComparable","isKey","isStrictComparable","hasIn","baseMerge","srcIndex","mergeFunc","safeGet","newValue","isTyped","isArrayLikeObject","isPlainObject","toPlainObject","baseMergeDeep","baseNth","baseOrderBy","iteratees","orders","getIteratee","comparer","baseSortBy","criteria","objCriteria","othCriteria","ordersLength","compareAscending","order","compareMultiple","basePickBy","baseSet","basePullAll","basePullAt","previous","baseUnset","baseRepeat","baseRest","start","setToString","overRest","baseSample","baseSampleSize","nested","baseSetData","baseSetToString","constant","baseShuffle","baseSlice","end","baseSome","baseSortedIndex","retHighest","low","high","mid","baseSortedIndexBy","valIsNaN","valIsNull","valIsSymbol","valIsUndefined","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","setLow","baseSortedUniq","baseToNumber","baseToString","baseUniq","createSet","seenIndex","baseUpdate","updater","baseWhile","isDrop","baseWrapperValue","actions","action","baseXor","baseZipObject","assignFunc","valsLength","castArrayLikeObject","castFunction","stringToPath","castRest","castSlice","copy","arrayBuffer","typedArray","valIsDefined","valIsReflexive","composeArgs","partials","holders","isCurried","argsIndex","argsLength","holdersLength","leftIndex","leftLength","rangeLength","isUncurried","composeArgsRight","holdersIndex","rightIndex","rightLength","isNew","createAggregator","initializer","createAssigner","assigner","sources","guard","isIterateeCall","iterable","createCaseFirst","methodName","createCompounder","words","deburr","createCtor","thisBinding","createFind","findIndexFunc","createFlow","flatRest","funcs","prereq","thru","getFuncName","funcName","getData","isLaziable","plant","createHybrid","partialsRight","holdersRight","argPos","arity","isAry","isBind","isBindKey","isFlip","getHolder","holdersCount","countHolders","newHolders","createRecurry","arrLength","oldArray","reorder","createInverter","toIteratee","baseInverter","createMathOperation","operator","defaultValue","createOver","arrayFunc","createPadding","chars","charsLength","createRange","step","toFinite","baseRange","createRelationalOperation","wrapFunc","isCurry","newData","setData","setWrapToString","createRound","precision","toInteger","pair","noop","createToPairs","baseToPairs","createWrap","srcBitmask","newBitmask","isCombo","mergeData","createCurry","createPartial","createBind","customDefaultsAssignIn","customDefaultsMerge","customOmitClone","arrStacked","arrValue","flatten","otherFunc","isKeyable","getValue","stubArray","hasPath","hasFunc","isLength","ArrayBuffer","resolve","ctorString","isMaskable","stubFalse","otherArgs","shortOut","reference","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","find","findLast","forEachRight","groupBy","invokeMap","keyBy","partition","sortBy","bindKey","debounce","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","assignIn","assignInWith","assignWith","at","propsIndex","propsLength","defaultsDeep","mergeWith","invert","invertBy","invoke","merge","omit","basePick","pickBy","toPairs","toPairsIn","camelCase","word","toLowerCase","capitalize","upperFirst","kebabCase","lowerCase","lowerFirst","snakeCase","startCase","upperCase","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","subtract","minuend","subtrahend","after","castArray","chunk","compact","cond","conforms","baseConforms","properties","curry","curryRight","drop","dropRight","dropRightWhile","dropWhile","fill","baseFill","filter","flatMap","flatMapDeep","flatMapDepth","flattenDeep","flattenDepth","flip","fromPairs","functions","functionsIn","mapKeys","mapValues","matchesProperty","nthArg","omitBy","once","orderBy","propertyOf","pullAllBy","pullAllWith","reject","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","position","escapeRegExp","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","settings","isEscaping","isEvaluating","importsKeys","importsValues","reDelimiters","sourceURL","escapeValue","interpolateValue","esTemplateValue","evaluateValue","times","toLower","toSafeInteger","toUpper","trim","trimEnd","trimStart","truncate","omission","search","substring","newEnd","unescape","uniqueId","prefix","each","eachRight","first","VERSION","isFilter","takeName","dropName","checkIteratee","isTaker","lodashFunc","retUnwrapped","isLazy","useLazy","isHybrid","isUnwrapped","onlyLazy","chainName","dir","isRight","view","getView","iterLength","takeCount","iterIndex","commit","wrapped","toJSON","c","l","o","__esModule","p","s","retainLength","substr","f","g","Element","TEXT_NODE","childNodes","nodeValue","runOnReady","replacements","listen","MutationObserver","addedNodes","return","observe","childList","subtree","readyState","setInterval","clearInterval","globalInstall","lazySizes","rAF","addObserver","connect","disconnect","observer","connected","lsCfg","cfg","attributes","data-bgset","data-include","data-poster","data-bg","data-script","regClassTest","loadedClass","setClass","rC","unloadedClass","aC","lazyClass","display","loader","unveil","onMutation","mutations","mutation","attributeName","localName","loadingClass","srcAttr","srcsetAttr","attributeFilter","runs","modifications","callMutations","attrName"],"mappings":";;;;;;;;;;;CAMC,SAAUA,EAAQC,GACE,WAAnBC,EAAOC,SAA0C,IAAXC,EAAyBA,EAAOD,QAAUF,SAC7BI,KAAAC,EAAA,mBAANC,KAAMC,EAAAC,KAAAN,EAAAO,EAAAP,EAAAC,GAAAI,KAAAJ,EAAAD,QAAAG,GAFpD,CAICK,EAAM,WAAc,aAEpB,SAASC,IACP,MAAyB,oBAAXC,OAwHhB,SAASC,EAAeC,GACtB,OAhFF,SAAkBC,GAGhB,OAAOA,GAAOA,EAAIC,UAPpB,SAAoBD,GAClB,OAAwB,IAAjBA,EAAIE,SAMmBC,CAAWH,EAAIC,UA6EtCG,CAASL,GA1ElB,SAAwBM,GACtB,IAAIC,EAAMD,EAAIJ,SACVM,EAAOD,EAAIC,KACXC,EAAOF,EAAIG,gBAEf,OAKEC,aAAc,WACZ,OAAOC,KAAKC,IACVL,EAAKG,aACLF,EAAKE,aACLH,EAAKM,aACLL,EAAKK,aACLN,EAAKO,aACLN,EAAKM,eAQTC,OAAQ,WACN,OAAOV,EAAIW,aAAeR,EAAKM,cAAgBP,EAAKO,cAOtDG,QAAS,WACP,YAAwB5B,IAApBgB,EAAIa,YACCb,EAAIa,aAGLV,GAAQD,EAAKY,YAAcZ,GAAMa,YAoClBC,CAAetB,GA/B5C,SAAyBA,GACvB,OAIEW,aAAc,WACZ,OAAOC,KAAKC,IACVb,EAAQW,aACRX,EAAQc,aACRd,EAAQe,eAOZC,OAAQ,WACN,OAAOJ,KAAKC,IAAIb,EAAQc,aAAcd,EAAQe,eAOhDG,QAAS,WACP,OAAOlB,EAAQqB,YAMkCE,CAAgBvB,GAMvE,SAASwB,EAAYxB,EAASyB,EAASC,GACrC,IACIC,EADAC,EAzHN,WACE,IAAIC,GAAY,EAEhB,IACE,IAAIJ,GAEFK,cACED,GAAY,IAGhB/B,OAAOiC,iBAAiB,OAAQN,EAASA,GACzC3B,OAAOkC,oBAAoB,OAAQP,EAASA,GAC5C,MAAOQ,GACPJ,GAAY,EAGd,OAAOA,EAyGkBK,GAErBC,GAAW,EACXC,EAAWrC,EAAeC,GAC1BqC,EAAcD,EAASlB,UACvBoB,KAEJ,SAASC,IACP,IAAIrB,EAAUN,KAAK4B,MAAMJ,EAASlB,WAC9BF,EAASoB,EAASpB,SAClBL,EAAeyB,EAASzB,eAG5B2B,EAAQpB,QAAUA,EAClBoB,EAAQD,YAAcA,EACtBC,EAAQG,UAAYvB,EAAUmB,EAAc,OAAS,KACrDC,EAAQI,SAAW9B,KAAK+B,IAAIzB,EAAUmB,GACtCC,EAAQM,cAAgB1B,EAAU,GAAKA,EAAUF,EAASL,EAC1D2B,EAAQO,IAAM3B,GAAWO,EAAQqB,OAAOR,EAAQG,WAChDH,EAAQS,OAAS7B,EAAUF,GAAUL,EACrC2B,EAAQU,kBACNV,EAAQI,SAAWjB,EAAQwB,UAAUX,EAAQG,WAE/Cf,EAASY,GAETD,EAAcnB,EACdiB,GAAW,EAGb,SAASe,IACFf,IACHA,GAAW,EACXR,EAAQwB,sBAAsBZ,IAIlC,IAAIa,IAAexB,IACbE,SAAS,EAAMuB,SAAS,GAM9B,OAHArD,EAAQ+B,iBAAiB,SAAUmB,EAAcE,GACjDb,KAGEe,QAAS,WACPC,qBAAqB5B,GACrB3B,EAAQgC,oBAAoB,SAAUkB,EAAcE,KAK1D,SAASI,EAAgBC,GACvB,OAAOA,IAAMC,OAAOD,GAAKA,GAAME,KAAMF,EAAGG,GAAIH,GAW9C,SAASI,EAASC,EAAMrC,GACtBA,EAAUA,MACViC,OAAOK,OAAOnE,KAAMiE,EAASpC,QAASA,GACtC7B,KAAKoE,QAAUN,OAAOK,UAAWF,EAASpC,QAAQuC,QAASvC,EAAQuC,SAEnEpE,KAAKkE,KAAOA,EACZlE,KAAKqD,UAAYO,EAAgB5D,KAAKqD,WACtCrD,KAAKkD,OAASU,EAAgB5D,KAAKkD,QACnClD,KAAKqE,aAAc,EACnBrE,KAAKsE,QAAS,EA6NhB,OA3NAL,EAASM,WACPC,YAAaP,EAMbQ,KAAM,WAoBJ,OAnBIR,EAASS,iBAAmB1E,KAAKqE,cACnCrE,KAAK2E,SAAS,WACd3E,KAAKqE,aAAc,EAInBO,WACE,SAASC,GACPA,EAAKC,cAAgBlD,EACnBiD,EAAKrC,UACHU,OAAQ2B,EAAK3B,OAAQG,UAAWwB,EAAKxB,WACvCwB,EAAKlC,OAAOoC,KAAKF,KAGrB,IACA7E,OAIGA,MAOT0D,QAAS,WACP1D,KAAKqE,aAAc,EACnBP,OAAOkB,KAAKhF,KAAKoE,SAASa,QAAQjF,KAAKkF,YAAalF,MACpDA,KAAK8E,cAAcpB,WAOrByB,MAAO,YACDnF,KAAKoF,SAAS,WAAcpF,KAAKoF,SAAS,cAC5CpF,KAAK2E,SAAS,YACd3E,KAAKkF,YAAY,UAEblF,KAAKqF,SACPrF,KAAKqF,QAAQvF,KAAKE,QASxBsF,IAAK,WACCtF,KAAKoF,SAAS,cAChBpF,KAAK2E,SAAS,UACd3E,KAAKkF,YAAY,YAEblF,KAAKuF,OACPvF,KAAKuF,MAAMzF,KAAKE,QAStBwF,OAAQ,WACNxF,KAAKsE,QAAS,EACdtE,KAAK2E,SAAS,WAOhBc,SAAU,WACRzF,KAAKsE,QAAS,EACdtE,KAAKkF,YAAY,WAGnBjC,IAAK,WACEjD,KAAKoF,SAAS,SACjBpF,KAAK2E,SAAS,OACd3E,KAAKkF,YAAY,UAEblF,KAAK0F,OACP1F,KAAK0F,MAAM5F,KAAKE,QAKtB2F,OAAQ,WACD3F,KAAKoF,SAAS,YACjBpF,KAAK2E,SAAS,UACd3E,KAAKkF,YAAY,OAEblF,KAAK4F,UACP5F,KAAK4F,SAAS9F,KAAKE,QAKzBmD,OAAQ,WACDnD,KAAKoF,SAAS,YACjBpF,KAAK2E,SAAS,UACd3E,KAAKkF,YAAY,aAEblF,KAAK6F,UACP7F,KAAK6F,SAAS/F,KAAKE,QAKzB8F,UAAW,WACJ9F,KAAKoF,SAAS,eACjBpF,KAAK2E,SAAS,aACd3E,KAAKkF,YAAY,UAEblF,KAAK+F,aACP/F,KAAK+F,YAAYjG,KAAKE,QAK5BgG,YAAa,SAAStD,GAGpB,MAF0C,SAAtBA,EAAQG,YAEHH,EAAQO,KAAOP,EAAQU,mBAGlD6C,UAAW,SAASvD,GAGlB,MAFwC,OAAtBA,EAAQG,WAEHH,EAAQU,mBAAsBV,EAAQO,KAG/D0B,SAAU,SAASuB,GACjBlG,KAAKkE,KAAKiC,UAAUC,IAAIC,MACtBrG,KAAKkE,KAAKiC,UACVnG,KAAKoE,QAAQ8B,GAAWI,MAAM,OAIlCpB,YAAa,SAASgB,GACpBlG,KAAKkE,KAAKiC,UAAUI,OAAOF,MACzBrG,KAAKkE,KAAKiC,UACVnG,KAAKoE,QAAQ8B,GAAWI,MAAM,OAIlClB,SAAU,SAASc,GACjB,OAAOlG,KAAKoE,QAAQ8B,GAAWI,MAAM,KAAKE,MAAM,SAASC,GACvD,OAAOzG,KAAKmG,UAAUO,SAASD,IAC9BzG,KAAKkE,OAGVvB,OAAQ,SAASD,GACXA,EAAQM,gBAKQ,IAAhBhD,KAAKsE,SAIL5B,EAAQO,IACVjD,KAAKiD,MAELjD,KAAK2F,SAGHjD,EAAQS,OACVnD,KAAKmD,SAELnD,KAAK8F,YAGH9F,KAAKgG,YAAYtD,GACnB1C,KAAKmF,QACInF,KAAKiG,UAAUvD,IACxB1C,KAAKsF,SASXrB,EAASpC,SACPwB,WACEW,GAAI,EACJD,KAAM,GAERb,OAAQ,EACRV,SAAUvC,IAAcC,OAAS,KACjCkE,SACEE,OAAQ,mBACRqC,OAAQ,mBACRC,SAAU,qBACV3D,IAAK,gBACL0C,OAAQ,oBACRxC,OAAQ,mBACR2C,UAAW,uBACXe,QAAS,aAIb5C,EAASS,kBAvYLzE,KACA,aAAc8E,MACd,cAAezE,SAASQ,iBACxBgD,OAAOK,QACPL,OAAOkB,MACPzB,uBAoYGU;;AC/aT,IAAI6C,EAAM,6BACNC,EAAY,mDACZC,EAA2B,oBAAVC,OAAyBC,OAAQC,kBAAmB,IAAM,IAAIF,MAC/EG,EAAoB,eAAgBJ,EAAQE,MAC5CG,EAAyB,oBAAqBL,EAAQE,MACtDI,EAAc,oBAAqBN,EAAQE,MAC3CK,EAAmD,iBAAvBP,EAAQQ,WACpCC,EAAqBT,EAAQU,aAC7BC,EAAqBX,EAAQY,aAC7BC,GAAkB,EAoCtB,SAASC,EAAeC,EAAKC,EAAO5G,GAEnC,IAAI6G,EApCL,SAA2BC,EAAGC,GAC7B,MAAQ,uEAAyED,EAAI,aAAeC,EAAI,iBAmCtFC,CAAkBJ,GAAS,EAAG5G,GAAU,GAGtDqG,EAAmB3H,KAAKiI,EAAK,SAAWE,GAC3CN,EAAmB7H,KAAKiI,EAAK,MAAOE,GAItC,SAASI,EAAaN,EAAKjG,GAGtBiG,EAAIO,aACPxG,EAASiG,GAETnD,WAAWyD,EAAc,IAAKN,EAAKjG,GAIrC,SAASyG,EAAOC,GACf,IAAItB,EA/BL,SAAkBsB,GAIjB,IAHA,IACIC,EADAvB,EAAQwB,iBAAiBF,GAAIG,WAE7BC,KACwC,QAApCH,EAAS1B,EAAU8B,KAAK3B,KAC/B0B,EAAMH,EAAO,IAAMA,EAAO,GAE3B,OAAOG,EAwBKE,CAASN,GACjBO,EAAMP,EAAG1B,GAIb,GAHAI,EAAM,cAAgBA,EAAM,eAAiB,QAGxC6B,EAAIhB,IAAK,CAEb,GAA4B,SAAxBb,EAAM,cACT,OAID,IACE6B,EAAIC,UACL5B,IACCF,EAAM,mBAEP,OAKF,IAAK6B,EAAIhB,IAAK,CACbgB,EAAIhB,IAAM,IAAId,MAAMuB,EAAGR,MAAOQ,EAAGpH,QACjC2H,EAAIhB,IAAIkB,OAASxB,EAAmB3H,KAAK0I,EAAI,oBAAsBA,EAAGS,OACtEF,EAAIhB,IAAImB,IAAMzB,EAAmB3H,KAAK0I,EAAI,iBAAmBA,EAAGU,IAIhEvB,EAAmB7H,KAAK0I,EAAI,eAAgBA,EAAGU,KAC3CV,EAAGS,QACNtB,EAAmB7H,KAAK0I,EAAI,kBAAmBA,EAAGS,QAGnDnB,EAAeU,EAAIA,EAAGF,cAAgBE,EAAGR,MAAOQ,EAAGW,eAAiBX,EAAGpH,QAGnEoH,EAAGS,SACNT,EAAGS,OAAS,IAEb,KAiCF,SAAuBT,GACtB,IAAIY,GACHC,IAAK,SAAaC,GACjB,OAAOd,EAAG1B,GAAKiB,IAAIuB,GAAc,QAElCC,IAAK,SAAaC,EAAOF,GAIxB,OAHAd,EAAG1B,GAAKiB,IAAIuB,GAAc,OAASE,EACnC7B,EAAmB7H,KAAK0I,EAAK,YAAcc,EAAOE,GAClDjB,EAAOC,GACAgB,IAGT1F,OAAO2F,eAAejB,EAAI,MAAOY,GACjCtF,OAAO2F,eAAejB,EAAI,cACzBa,IAAK,WAAc,OAAOD,EAAYC,IAAI,iBAE3CvF,OAAO2F,eAAejB,EAAI,UACzBa,IAAK,WAAc,OAAOD,EAAYC,IAAI,WAC1CE,IAAK,SAAUG,GAAM,OAAON,EAAYG,IAAIG,EAAI,aAlD/CC,CAAcnB,GACb,MAAOnG,GACJnC,OAAO0J,SACVA,QAAQC,KAAK,oCA/FjB,SAA4BrB,GAC3B,GAAIA,EAAGS,SAAW1B,GAAsBrH,OAAO4J,YAAa,CAC3D,IAAIC,EAAK7J,OAAO4J,YAAYE,EAEvBxB,EAAGuB,EAAGE,KAAQzB,EAAGuB,EAAGE,IAAIC,QAE5BH,EAAGI,QAAQ3B,GAAK4B,UAAU,IAGtB5B,EAAGuB,EAAGE,IAAII,SAEd7B,EAAGuB,EAAGE,IAAIhI,WAAY,EACtB8H,EAAGI,QAAQ3B,GAAK4B,UAAU,KAI3B5B,EAAGhB,WAAagB,EAAGuB,EAAGE,IAAII,QAAU7B,EAAGU,KAoFxCoB,CAAmBvB,EAAIhB,KAEvBS,EAAGtB,MAAMqD,gBAAkB,SAAaxB,EAAIhB,IAAIP,YAAcuB,EAAIhB,IAAImB,KAAKsB,QAAQ,KAAM,OAAU,KACnGhC,EAAGtB,MAAMuD,mBAAqBvD,EAAM,oBAAsB,SAC1DsB,EAAGtB,MAAMwD,iBAAmB,YAC5BlC,EAAGtB,MAAMyD,iBAAmB,cAExB,aAAaC,KAAK1D,EAAM,eAC3BmB,EAAaU,EAAIhB,IAAK,WACjBgB,EAAIhB,IAAIO,aAAeE,EAAGR,OAASe,EAAIhB,IAAIoB,cAAgBX,EAAGpH,OACjEoH,EAAGtB,MAAM2D,eAAiB,UAE1BrC,EAAGtB,MAAM2D,eAAiB,SAI5BrC,EAAGtB,MAAM2D,eAAiB3D,EAAM,cAAcsD,QAAQ,OAAQ,QAAQA,QAAQ,OAAQ,aAGvFnC,EAAaU,EAAIhB,IAAK,SAAUA,GAC/BD,EAAeU,EAAIT,EAAIO,aAAcP,EAAIoB,iBAyC3C,SAAS2B,EAAIC,EAAMC,GAClB,IAAIC,GAAiBpD,IAAoBkD,EAIzC,GAHAC,EAAOA,MACPD,EAAOA,GAAQ,MAEV1D,IAA2B2D,EAAKhC,WAAc1B,EAClD,OAAO,EAIK,QAATyD,EACHA,EAAOzK,SAAS4K,qBAAqB,OACX,iBAATH,EACjBA,EAAOzK,SAAS6K,iBAAiBJ,GACrB,WAAYA,IACxBA,GAAQA,IAIT,IAAK,IAAIK,EAAI,EAAGA,EAAIL,EAAKM,OAAQD,IAChCL,EAAKK,GAAGtE,GAAOiE,EAAKK,GAAGtE,KACtBkC,SAAUgC,EAAKhC,UAEhBT,EAAOwC,EAAKK,IAGTH,IACH3K,SAASM,KAAKuB,iBAAiB,OAAQ,SAAUmJ,GACvB,QAArBA,EAAEC,OAAOC,SACZV,EAAIQ,EAAEC,QACLvC,SAAUgC,EAAKhC,aAGf,GACHnB,GAAkB,EAClBkD,EAAO,OAIJC,EAAKS,SACRvL,OAAOiC,iBAAiB,SAAU2I,EAAI/F,KAAK,KAAMgG,GAChD/B,SAAUgC,EAAKhC,YAKlB8B,EAAI1D,kBAAoBA,EACxB0D,EAAIzD,uBAAyBA,EA9D7B,WACC,SAASqE,EAAiBlD,EAAImD,GAC7B,OAAOnD,EAAG1B,IAAQ0B,EAAG1B,GAAKiB,MAAiB,QAAT4D,GAA2B,WAATA,GAAqBnD,EAAG1B,GAAKiB,IAAMS,EAEnFnB,IACJuE,iBAAiBrH,UAAUmD,aAAe,SAAUiE,GACnD,OAAOlE,EAAmB3H,KAAK4L,EAAiB1L,KAAM2L,GAAOA,IAG9DC,iBAAiBrH,UAAUqD,aAAe,SAAU+D,EAAMnC,GACzD,OAAO7B,EAAmB7H,KAAK4L,EAAiB1L,KAAM2L,GAAOA,EAAME,OAAOrC,MAsD7EsC,GAEArM,EAAOD,QAAUsL,+CC9MG,oBAAX5K,QAAyBA,OAV9BN,UAAMF,KAAAC,EAAA,mBAAAE,EAUyC,WA8SjD,OA7Sa,SAATkM,EAAkBvD,EAAI3G,GACxB,aAEA,IAAIgD,EAAOf,OAAOkI,OAAOD,EAAOxH,WAE5B0H,EAAO,EACPC,EAAU,EACVC,EAAO,EACPC,EAAU,EACVC,KACAC,GAAQ,EAIRC,EAAOrM,OAAOqD,uBAChBrD,OAAOsM,6BACPtM,OAAOuM,0BACPvM,OAAOwM,yBACPxM,OAAOyM,wBACP,SAAS7K,GAAW,OAAO8C,WAAW9C,EAAU,IAAO,KAGrD8K,EAAS,KAGTC,EAAY3M,OAAOyD,sBAAwBzD,OAAO4M,yBAA2BC,aAG7EC,EAAgB9M,OAAO8M,eAAkB,WACzC,IAAIC,EAAS3M,SAAS4M,cAAc,OACpC,GAA+B,OAA3BD,EAAO/F,MAAMiG,UAAoB,CACnC,IAAIC,GAAW,SAAU,MAAO,MAChC,IAAK,IAAIC,KAAUD,EACjB,QAAsD1N,IAAlDuN,EAAO/F,MAAOkG,EAAQC,GAAU,aAClC,OAAOD,EAAQC,GAAU,YAI/B,MAAO,YAVkC,GAc7CxI,EAAKhD,SACHyL,OAAQ,EACRC,QAAQ,EACRC,QAAS,KACTC,mBAAmB,EACnB7K,OAAO,EACP8K,UAAU,EACVC,YAAY,EACZ7L,SAAU,cAIRD,GACFiC,OAAOkB,KAAKnD,GAASoD,QAAQ,SAAS2I,GACpC/I,EAAKhD,QAAQ+L,GAAO/L,EAAQ+L,KAK3BpF,IACHA,EAAK,WAIP,IAAIqF,EAAyB,iBAAPrF,EAAkBlI,SAAS6K,iBAAiB3C,IAAOA,GAGzE,KAAIqF,EAASxC,OAAS,GAMpB,MAAM,IAAIyC,MAAM,qDAIlB,GATEjJ,EAAKkJ,MAAQF,EASXhJ,EAAKhD,QAAQ2L,UACV3I,EAAKhD,QAAQ2L,QAAQjN,SAAU,CAClC,IAAIiN,EAAUlN,SAAS0N,cAAcnJ,EAAKhD,QAAQ2L,SAElD,IAAIA,EAGF,MAAM,IAAIM,MAAM,iDAFhBjJ,EAAKhD,QAAQ2L,QAAUA,EAS7B,IAUI/I,EAAO,SAAPA,IACF,IAAK,IAAI2G,EAAI,EAAGA,EAAIiB,EAAOhB,OAAQD,IACjCvG,EAAKkJ,MAAM3C,GAAGlE,MAAM+G,QAAU5B,EAAOjB,GAAGlE,MAG1CmF,KAEAH,EAAUhM,OAAOmB,YACjB+K,EAAUlM,OAAOgO,WACjBC,IAnBgB,WAChB,IAAK,IAAI/C,EAAI,EAAGA,EAAIvG,EAAKkJ,MAAM1C,OAAQD,IAAI,CACzC,IAAIgD,EAAQC,EAAYxJ,EAAKkJ,MAAM3C,IACnCiB,EAAOiC,KAAKF,IAkBdG,GAGIjC,IACFpM,OAAOiC,iBAAiB,SAAUsC,GAClC6H,GAAQ,GAEVkC,KAMEH,EAAc,SAAS7F,GACzB,IAAIiG,EAAiBjG,EAAGd,aAAc,0BAClCgH,EAAYlG,EAAGd,aAAc,qBAC7BiH,EAAanG,EAAGd,aAAc,uBAA0B,EAOxDkH,EAAc/J,EAAKhD,QAAQ2L,QAAU3I,EAAKhD,QAAQ2L,QAAQ/L,UAAavB,OAAOqB,aAAejB,SAASQ,gBAAgBW,WAAanB,SAASM,KAAKa,UAErJ,GAAIoD,EAAKhD,QAAQ4L,kBAAmB,CAClC,IAAIoB,EAAc3O,OAAOqB,aAAejB,SAASQ,gBAAgBW,WAAanB,SAASM,KAAKa,UAC5FmN,EAAcC,EAAahK,EAAKhD,QAAQ2L,QAAQsB,UAElD,IAAI7C,EAAOpH,EAAKhD,QAAQ6L,WAAae,GAAkB5J,EAAKhD,QAAQ0L,QAASqB,EAAoB,EAC7FzC,EAAOtH,EAAKhD,QAAQ8L,aAAec,GAAkB5J,EAAKhD,QAAQ0L,QAAUrN,OAAO6O,aAAezO,SAASQ,gBAAgBkO,YAAc1O,SAASM,KAAKoO,WAAoB,EAE3KC,EAAWhD,EAAOzD,EAAG0G,wBAAwBjM,IAC7CkM,EAAc3G,EAAGrH,cAAgBqH,EAAGtH,cAAgBsH,EAAGzH,aAEvDqO,EAAYjD,EAAO3D,EAAG0G,wBAAwBG,KAC9CC,EAAa9G,EAAG+G,aAAe/G,EAAGgH,aAAehH,EAAGiH,YAGpDC,EAAcjB,IAAmCxC,EAAOgD,EAAW/C,IAAYiD,EAAcjD,GAC7FyD,EAAclB,IAAmCtC,EAAOiD,EAAYhD,IAAYkD,EAAalD,GAC9FvH,EAAKhD,QAAQ0L,SAASoC,EAAc,GAAKD,EAAc,IAG1D,IAAIpC,EAAQoB,GAAwB7J,EAAKhD,QAAQyL,MAE7CsC,EAAQC,EAAeF,EAAaD,EAAapC,GAIjDpG,EAAQsB,EAAGtB,MAAM+G,QACjBd,EAAY,GAGhB,GAAIjG,EAAM4I,QAAQ,cAAgB,EAAG,CAEnC,IAAIC,EAAQ7I,EAAM4I,QAAQ,aAGtBE,EAAe9I,EAAM+I,MAAMF,GAC3BG,EAAYF,EAAaF,QAAQ,KAInC3C,EADE+C,EACU,IAAMF,EAAaC,MAAM,GAAIC,GAAW1F,QAAQ,MAAM,IAEtD,IAAMwF,EAAaC,MAAM,IAAIzF,QAAQ,MAAM,IAI3D,OACE2F,MAAOP,EAAMQ,EACbC,MAAOT,EAAMU,EACbrN,IAAKgM,EACLI,KAAMD,EACNhO,OAAQ+N,EACRnH,MAAOsH,EACPhC,MAAOA,EACPpG,MAAOA,EACPiG,UAAWA,EACXoD,OAAQ5B,IAORR,EAAc,WAChB,IAAIqC,EAAOvE,EACPwE,EAAOtE,EAKX,GAHAF,EAAOpH,EAAKhD,QAAQ2L,QAAU3I,EAAKhD,QAAQ2L,QAAQ/L,WAAanB,SAASQ,iBAAmBR,SAASM,KAAKY,YAAclB,SAASM,MAAMa,WAAavB,OAAOqB,YAC3J4K,EAAOtH,EAAKhD,QAAQ2L,QAAU3I,EAAKhD,QAAQ2L,QAAQwB,YAAc1O,SAASQ,iBAAmBR,SAASM,KAAKY,YAAclB,SAASM,MAAMoO,YAAc9O,OAAO6O,YAEzJlK,EAAKhD,QAAQ4L,kBAAmB,CAClC,IAAIoB,GAAcvO,SAASQ,iBAAmBR,SAASM,KAAKY,YAAclB,SAASM,MAAMa,WAAavB,OAAOqB,YAC7G0K,EAAO4C,EAAahK,EAAKhD,QAAQ2L,QAAQsB,UAI3C,QAAI0B,GAAQvE,IAAQpH,EAAKhD,QAAQ6L,aAK7B+C,GAAQtE,IAAQtH,EAAKhD,QAAQ8L,aAY/BkC,EAAiB,SAASF,EAAaD,EAAapC,GACtD,IAAIoD,KACAC,EAAUrD,GAAS,KAAO,EAAIqC,IAC9BiB,EAAUtD,GAAS,KAAO,EAAIoC,IAKlC,OAHAgB,EAAON,EAAIvL,EAAKhD,QAAQe,MAAQ5B,KAAK4B,MAAM+N,GAAU3P,KAAK4B,MAAe,IAAT+N,GAAgB,IAChFD,EAAOJ,EAAIzL,EAAKhD,QAAQe,MAAQ5B,KAAK4B,MAAMgO,GAAU5P,KAAK4B,MAAe,IAATgO,GAAgB,IAEzEF,GAcLlC,EAAU,WAEZ,IADA,IAAIqC,EACKzF,EAAI,EAAGA,EAAIvG,EAAKkJ,MAAM1C,OAAQD,IAAI,CACzC,IAAIsE,GAAgBzD,EAAOI,EAAOjB,GAAGnI,IAAMiJ,IAAYG,EAAOjB,GAAGhK,OAAS8K,GACtEyD,GAAgBxD,EAAOE,EAAOjB,GAAGiE,KAAOjD,IAAYC,EAAOjB,GAAGpD,MAAQoE,GAItE0E,GADJD,EAAYhB,EAAeF,EAAaD,EAAarD,EAAOjB,GAAGkC,QACrCgD,EAAIjE,EAAOjB,GAAGiF,MACpCU,EAAYF,EAAUT,EAAI/D,EAAOjB,GAAG+E,MAEpCI,EAASlE,EAAOjB,GAAGmF,OAInBS,EAAY,gBAAkBnM,EAAKhD,QAAQ8L,WAAaoD,EAAY,KAAO,OAASlM,EAAKhD,QAAQ6L,SAAWoD,EAAY,KAAO,MAAQP,EAAS,OAASlE,EAAOjB,GAAG+B,UACvKtI,EAAKkJ,MAAM3C,GAAGlE,MAAM8F,GAAiBgE,EAEvCnM,EAAKhD,QAAQC,SAAS+O,IA4BxB,OAzBAhM,EAAKnB,QAAU,WACb,IAAK,IAAI0H,EAAI,EAAGA,EAAIvG,EAAKkJ,MAAM1C,OAAQD,IACrCvG,EAAKkJ,MAAM3C,GAAGlE,MAAM+G,QAAU5B,EAAOjB,GAAGlE,MAIrCoF,IACHpM,OAAOkC,oBAAoB,SAAUqC,GACrC6H,GAAQ,GAIVO,EAAUD,GACVA,EAAS,MAIXnI,IAhDa,SAAT9B,IACEwL,MAA2B,IAAV7B,GACnBkC,IAIF5B,EAASL,EAAK5J,GA6ChBA,GAGAkC,EAAKoM,QAAUxM,EAERI,KAtTDhF,EAAAwG,MAAA7G,EAAA0R,GAAArR,KAAAJ,EAAAD,QAAAG,2CCdV,IAAIwR,EAAOC,EAAQ,KAsBnB3R,EAAOD,QAJG,WACR,OAAO2R,EAAKE,KAAKC,6BCnBnB,IAAIC,EAAkBH,EAAQ,MAG1BI,EAAc,OAelB/R,EAAOD,QANP,SAAkBiS,GAChB,OAAOA,EACHA,EAAOxB,MAAM,EAAGsB,EAAgBE,GAAU,GAAGjH,QAAQgH,EAAa,IAClEC,uBCdN,IAAIC,EAAe,KAiBnBjS,EAAOD,QAPP,SAAyBiS,GAGvB,IAFA,IAAI1B,EAAQ0B,EAAOpG,OAEZ0E,KAAW2B,EAAa9G,KAAK6G,EAAOE,OAAO5B,MAClD,OAAOA,yBCfT,IAAI6B,EAASR,EAAQ,KAGjBS,EAAc/N,OAAOS,UAGrBuN,EAAiBD,EAAYC,eAO7BC,EAAuBF,EAAYG,SAGnCC,EAAiBL,EAASA,EAAOM,iBAAcxS,EA6BnDD,EAAOD,QApBP,SAAmBgK,GACjB,IAAI2I,EAAQL,EAAehS,KAAK0J,EAAOyI,GACnCG,EAAM5I,EAAMyI,GAEhB,IACEzI,EAAMyI,QAAkBvS,EACxB,IAAI2S,GAAW,EACf,MAAO/G,IAET,IAAIoF,EAASqB,EAAqBjS,KAAK0J,GAQvC,OAPI6I,IACEF,EACF3I,EAAMyI,GAAkBG,SAEjB5I,EAAMyI,IAGVvB,uBCzCT,IAOIqB,EAPcjO,OAAOS,UAOcyN,SAavCvS,EAAOD,QAJP,SAAwBgK,GACtB,OAAOuI,EAAqBjS,KAAK0J,yBClBnC,IAAI8I,EAAWlB,EAAQ,KACnBE,EAAMF,EAAQ,MACdmB,EAAWnB,EAAQ,KAGnBoB,EAAkB,sBAGlBC,EAAYzR,KAAKC,IACjByR,EAAY1R,KAAK2R,IAqLrBlT,EAAOD,QA7HP,SAAkBoT,EAAMC,EAAMhR,GAC5B,IAAIiR,EACAC,EACAC,EACAtC,EACAuC,EACAC,EACAC,EAAiB,EACjBC,GAAU,EACVC,GAAS,EACTC,GAAW,EAEf,GAAmB,mBAARV,EACT,MAAM,IAAIW,UAAUf,GAUtB,SAASgB,EAAWC,GAClB,IAAIC,EAAOZ,EACPa,EAAUZ,EAKd,OAHAD,EAAWC,OAAWrT,EACtByT,EAAiBM,EACjB/C,EAASkC,EAAKvM,MAAMsN,EAASD,GAuB/B,SAASE,EAAaH,GACpB,IAAII,EAAoBJ,EAAOP,EAM/B,YAAyBxT,IAAjBwT,GAA+BW,GAAqBhB,GACzDgB,EAAoB,GAAOR,GANJI,EAAON,GAM8BH,EAGjE,SAASc,IACP,IAAIL,EAAOnC,IACX,GAAIsC,EAAaH,GACf,OAAOM,EAAaN,GAGtBR,EAAUrO,WAAWkP,EA3BvB,SAAuBL,GACrB,IAEIO,EAAcnB,GAFMY,EAAOP,GAI/B,OAAOG,EACHX,EAAUsB,EAAahB,GAJDS,EAAON,IAK7Ba,EAoB+BC,CAAcR,IAGnD,SAASM,EAAaN,GAKpB,OAJAR,OAAUvT,EAIN4T,GAAYR,EACPU,EAAWC,IAEpBX,EAAWC,OAAWrT,EACfgR,GAeT,SAASwD,IACP,IAAIT,EAAOnC,IACP6C,EAAaP,EAAaH,GAM9B,GAJAX,EAAWsB,UACXrB,EAAW/S,KACXkT,EAAeO,EAEXU,EAAY,CACd,QAAgBzU,IAAZuT,EACF,OAzEN,SAAqBQ,GAMnB,OAJAN,EAAiBM,EAEjBR,EAAUrO,WAAWkP,EAAcjB,GAE5BO,EAAUI,EAAWC,GAAQ/C,EAmEzB2D,CAAYnB,GAErB,GAAIG,EAIF,OAFAtG,aAAakG,GACbA,EAAUrO,WAAWkP,EAAcjB,GAC5BW,EAAWN,GAMtB,YAHgBxT,IAAZuT,IACFA,EAAUrO,WAAWkP,EAAcjB,IAE9BnC,EAIT,OA3GAmC,EAAON,EAASM,IAAS,EACrBP,EAASzQ,KACXuR,IAAYvR,EAAQuR,QAEpBJ,GADAK,EAAS,YAAaxR,GACH4Q,EAAUF,EAAS1Q,EAAQmR,UAAY,EAAGH,GAAQG,EACrEM,EAAW,aAAczR,IAAYA,EAAQyR,SAAWA,GAoG1DY,EAAUI,OApCV,gBACkB5U,IAAZuT,GACFlG,aAAakG,GAEfE,EAAiB,EACjBL,EAAWI,EAAeH,EAAWE,OAAUvT,GAgCjDwU,EAAUK,MA7BV,WACE,YAAmB7U,IAAZuT,EAAwBvC,EAASqD,EAAazC,MA6BhD4C,uBC3LT,SAAAM,GACA/U,EAAAD,QAAAgV,4QCDA,IAAIC,EAAarD,EAAQ,KAGrBsD,EAA0B,WAAf,oBAAO7P,KAAP,YAAAtF,EAAOsF,QAAoBA,MAAQA,KAAKf,SAAWA,QAAUe,KAGxEsM,EAAOsD,GAAcC,GAAYC,SAAS,cAATA,GAErClV,EAAOD,QAAU2R,0PCsBjB1R,EAAOD,QALP,SAAkBgK,GAChB,IAAIoL,EAAIrV,EAAUiK,GAClB,OAAgB,MAATA,IAA0B,UAARoL,GAA4B,YAARA,yBC3B/C,IAGIhD,EAHOR,EAAQ,KAGDQ,OAElBnS,EAAOD,QAAUoS,uBCLjB,IAAIA,EAASR,EAAQ,KACjByD,EAAYzD,EAAQ,MACpB0D,EAAiB1D,EAAQ,MAGzB2D,EAAU,gBACVC,EAAe,qBAGf/C,EAAiBL,EAASA,EAAOM,iBAAcxS,EAkBnDD,EAAOD,QATP,SAAoBgK,GAClB,OAAa,MAATA,OACe9J,IAAV8J,EAAsBwL,EAAeD,EAEtC9C,GAAkBA,KAAkBnO,OAAO0F,GAC/CqL,EAAUrL,GACVsL,EAAetL,4PCIrB/J,EAAOD,QAJP,SAAsBgK,GACpB,OAAgB,MAATA,GAAiC,UAAhBjK,EAAOiK,8PCxBlB,SAASyL,IAEtB,KAAMjV,gBAAgBiV,GACpB,OAAO,IAAIA,EAIbjV,KAAKkV,KAAO,EAGZlV,KAAKmV,IAAM,EAGXnV,KAAKoV,aAGLpV,KAAKqV,mBAGLrV,KAAKsV,QAAUxR,OAAOkI,OAAOhM,KAAKsV,SAGlCtV,KAAKuV,wBAIP,IAAIC,EAAUtV,OAAOI,SAASQ,gBAC1B2U,EACFD,EAAQC,SACRD,EAAQE,uBACRF,EAAQG,oBACRH,EAAQI,kBACRJ,EAAQK,kBAUVZ,EAAY1Q,UAAUuR,gBAAkB,SAAStN,EAAIuN,GACnD,OAAON,EAAQ3V,KAAK0I,EAAIuN,IAW1Bd,EAAY1Q,UAAU4G,iBAAmB,SAASiK,EAAWY,GAC3D,OAAOA,EAAQ7K,iBAAiBiK,IAWlCH,EAAY1Q,UAAU+Q,WAGtB,IAAIW,EAAO,oCACXhB,EAAY1Q,UAAU+Q,QAAQhH,MAC5B3C,KAAM,KACNoK,SAAU,SAAyBG,GACjC,IAAIC,EACJ,GAAKA,EAAID,EAAIE,MAAMH,GACjB,OAAOE,EAAE,GAAGlG,MAAM,IAGtB7P,QAAS,SAAsBoI,GAC7B,GAAIA,EAAG6N,GACL,OAAQ7N,EAAG6N,OAMjB,IAAIC,EAAU,qCACdrB,EAAY1Q,UAAU+Q,QAAQhH,MAC5B3C,KAAM,QACNoK,SAAU,SAA4BG,GACpC,IAAIC,EACJ,GAAKA,EAAID,EAAIE,MAAME,GACjB,OAAOH,EAAE,GAAGlG,MAAM,IAGtB7P,QAAS,SAA8BoI,GACrC,IAAItC,EAAYsC,EAAGtC,UACnB,GAAIA,EAAW,CACb,GAAyB,iBAAdA,EACT,OAAOA,EAAUI,MAAM,MAClB,GAAyB,WAArB/G,EAAO2G,IAA0B,YAAaA,EAGvD,OAAOA,EAAUqQ,QAAQjQ,MAAM,UAOvC,IA0BIkQ,EA1BAC,EAAQ,mCACZxB,EAAY1Q,UAAU+Q,QAAQhH,MAC5B3C,KAAM,MACNoK,SAAU,SAA0BG,GAClC,IAAIC,EACJ,GAAKA,EAAID,EAAIE,MAAMK,GACjB,OAAON,EAAE,GAAGO,eAGhBtW,QAAS,SAA2BoI,GAClC,OAAQA,EAAGmO,SAASD,kBAKxBzB,EAAY1Q,UAAU+Q,QAAtB,SACE3J,KAAM,YACNoK,SAAU,WACR,OAAO,GAET3V,QAAS,WACP,QAAQ,KAOVoW,EADwB,mBAAftW,OAAOsW,IACVtW,OAAOsW,IAEN,WACL,SAASA,IACPxW,KAAK4W,OAQP,OANAJ,EAAIjS,UAAU8E,IAAM,SAASuE,GAC3B,OAAO5N,KAAK4W,IAAIhJ,EAAM,MAExB4I,EAAIjS,UAAUgF,IAAM,SAASqE,EAAKpE,GAChCxJ,KAAK4W,IAAIhJ,EAAM,KAAOpE,GAEjBgN,EAVF,GAiBT,IAAIK,EAAU,sIAOd,SAASC,EAAqBC,EAAYhB,GAGxC,IACE3K,EACA4L,EACAb,EACAc,EAEArJ,EACAmC,EAPEmH,GAFJH,EAAaA,EAAW9G,MAAM,GAAGkH,OAAOJ,EAAU,UAEnB1L,OAK7B+L,EAAOrB,EAGPT,KAEF,GAEE,GADAuB,EAAQhO,KAAK,KACRsN,EAAIU,EAAQhO,KAAKuO,MACpBA,EAAOjB,EAAE,GACLA,EAAE,KAAOiB,GACX,IAAKhM,EAAI,EAAGA,EAAI8L,EAAe9L,IAE7B,GAAKwC,GADLmC,EAAQgH,EAAW3L,IACF2K,SAASI,EAAE,IAAM,CAGhC,IAFAa,EAAI1B,EAAQjK,OACZ4L,GAAM,EACCD,KACL,GAAI1B,EAAQ0B,GAAGjH,QAAUA,GAASuF,EAAQ0B,GAAGpJ,MAAQA,EAAK,CACxDqJ,GAAM,EACN,MAGCA,GACH3B,EAAQhH,MAAOyB,MAAOA,EAAOnC,IAAKA,IAEpC,aAKDuI,GAET,OAAOb,EAST,SAAS+B,EAAgBC,EAAKC,GAC5B,IAAInM,EAAGoM,EAAKC,EACZ,IAAKrM,EAAI,EAAGoM,EAAMF,EAAIjM,OAAQD,EAAIoM,EAAKpM,IAErC,GADAqM,EAAOH,EAAIlM,GACPmM,EAAMG,cAAcD,GACtB,OAAOA,EA8Ib,SAASE,EAASC,EAAGC,GACnB,OAAOD,EAAEvB,GAAKwB,EAAExB,GA9HlBpB,EAAY1Q,UAAUuT,oBAAsB,aAQ5C7C,EAAY1Q,UAAU6B,IAAM,SAAS2P,EAAUgC,GAC7C,IAAI1X,EACF+K,EACA4M,EACApK,EACAmC,EACAkI,EACAC,EACAC,EACA7C,EAAUtV,KAAKuV,cACfH,EAAYpV,KAAKoV,UACjBC,EAAkBrV,KAAKqV,gBAEzB,GAAwB,iBAAbU,EAAX,CAYA,IAHAV,GALAhV,GACEgW,GAAIrW,KAAKmV,MACTY,SAAUA,EACVgC,KAAMA,IAEY1B,IAAMhW,EAE1B6X,EAAkBpB,EAAqB9W,KAAKsV,QAASS,GAChD3K,EAAI,EAAGA,EAAI8M,EAAgB7M,OAAQD,IAEtCwC,GADAuK,EAAgBD,EAAgB9M,IACZwC,KAGpBmC,EAAQsH,EAAgB/B,EAFxB0C,EAAaG,EAAcpI,WAIzBA,EAAQjM,OAAOkI,OAAOgM,IAChBpB,IAAM,IAAIJ,EAChBlB,EAAQhH,KAAKyB,IAGXiI,IAAehY,KAAKsV,QAAL,SACjBtV,KAAK8X,oBAAoBzX,IAE3B4X,EAAOlI,EAAM6G,IAAIvN,IAAIuE,MAEnBqK,KACAlI,EAAM6G,IAAIrN,IAAIqE,EAAKqK,IAErBA,EAAK3J,KAAKjO,GAGZL,KAAKkV,OACLE,EAAU9G,KAAKyH,KASjBd,EAAY1Q,UAAUgC,OAAS,SAASwP,EAAUgC,GAChD,GAAwB,iBAAbhC,EAAX,CAIA,IAAImC,EACFC,EACA/M,EACA4L,EACAoB,EACAC,EACAJ,EACA5X,EACAiV,EAAUtV,KAAKuV,cACfH,EAAapV,KAAKoV,aAClBC,EAAkBrV,KAAKqV,gBACvBiD,KACAC,EAAiC,IAArBnE,UAAU/I,OAGxB,IADA6M,EAAkBpB,EAAqB9W,KAAKsV,QAASS,GAChD3K,EAAI,EAAGA,EAAI8M,EAAgB7M,OAAQD,IAItC,IAHA+M,EAAgBD,EAAgB9M,GAEhC4L,EAAI1B,EAAQjK,OACL2L,KAEL,GADAqB,EAAW/C,EAAQ0B,GACfmB,EAAcpI,MAAM2H,cAAcW,GAAW,CAE/C,GADAJ,EAAOI,EAASzB,IAAIvN,IAAI8O,EAAcvK,KAGpC,IADAwK,EAAIH,EAAK5M,OACF+M,MACL/X,EAAM4X,EAAKG,IACHrC,WAAaA,IAAawC,GAAalY,EAAI0X,OAASA,IAC1DE,EAAKO,OAAOJ,EAAG,GACfE,EAAWjY,EAAIgW,KAAM,GAI3B,MAKN,IAAKjL,KAAKkN,SACDjD,EAAgBjK,GACvBpL,KAAKkV,OAGP,IAAK9J,KAAKiK,EACRD,EAAU9G,KAAK+G,EAAgBjK,GAAG2K,YAmBtCd,EAAY1Q,UAAUkU,SAAW,SAASzC,GACxC,IAAKhW,KAAKoV,UAAU/J,OAClB,SAGF,IAIID,EAAG4L,EAAGQ,EAAKkB,EAAMlQ,EAAI2N,EAAGC,EAAO/V,EAJ/BoV,KACFkD,KACEC,EAAM5Y,KAAKmL,iBAAiBnL,KAAKoV,UAAUyD,KAAK,MAAO7C,GAG3D,IAAK5K,EAAI,EAAGoM,EAAMoB,EAAIvN,OAAQD,EAAIoM,EAAKpM,IAGrC,IAFA5C,EAAKoQ,EAAIxN,GAEJ4L,EAAI,EAAG0B,GADZvC,EAAInW,KAAKyV,QAAQjN,IACI6C,OAAQ2L,EAAI0B,EAAM1B,IAEhCvB,GADLpV,EAAM8V,EAAEa,IACSX,IAUfD,EAAQX,EAAQpV,EAAIgW,KATpBD,GACEC,GAAIhW,EAAIgW,GACRN,SAAU1V,EAAI0V,SACdgC,KAAM1X,EAAI0X,KACVlK,aAEF4H,EAAQpV,EAAIgW,IAAMD,EAClBuC,EAAQrK,KAAK8H,IAIfA,EAAMvI,SAASS,KAAK9F,GAIxB,OAAOmQ,EAAQG,KAAKnB,IAQtB1C,EAAY1Q,UAAUkR,QAAU,SAASjN,GACvC,IAAKA,EACH,SAGF,IAAI4C,EAAG4L,EAAGoB,EAAGZ,EAAKkB,EAAMK,EAAMhJ,EAAO/K,EAAMiT,EAAM5X,EAAKgW,EAClDf,EAAUtV,KAAKuV,cACjByD,KACAvD,KAEF,IAAKrK,EAAI,EAAGoM,EAAMlC,EAAQjK,OAAQD,EAAIoM,EAAKpM,IAGzC,GADApG,GADA+K,EAAQuF,EAAQlK,IACHhL,QAAQoI,GAEnB,IAAKwO,EAAI,EAAG0B,EAAO1T,EAAKqG,OAAQ2L,EAAI0B,EAAM1B,IACxC,GAAKiB,EAAOlI,EAAM6G,IAAIvN,IAAIrE,EAAKgS,IAC7B,IAAKoB,EAAI,EAAGW,EAAOd,EAAK5M,OAAQ+M,EAAIW,EAAMX,KAGnCY,EADL3C,GADAhW,EAAM4X,EAAKG,IACF/B,KACcrW,KAAK8V,gBAAgBtN,EAAInI,EAAI0V,YAClDiD,EAAW3C,IAAM,EACjBZ,EAAQnH,KAAKjO,IAQzB,OAAOoV,EAAQqD,KAAKnB,ICrbtB5X,EAAAkZ,EAAAC,EAAA,yBAAAC,IAAApZ,EAAAkZ,EAAAC,EAAA,wBAAAE,IAAArZ,EAAAkZ,EAAAC,EAAA,uBAAAG,IAEA,IAAIC,KACAC,KACAC,EAAqB,IAAIC,QACzBC,EAA8B,IAAID,QAClCE,EAAiB,IAAIF,QACrBG,EAAoB9V,OAAO+V,yBAAyBC,MAAMvV,UAAW,iBAEzE,SAASwV,EAAOC,EAASC,EAAMC,GAC7B,IAAIC,EAASH,EAAQC,GAOrB,OALAD,EAAQC,GAAQ,WAEd,OADAC,EAAG7T,MAAM2T,EAAS5F,WACX+F,EAAO9T,MAAM2T,EAAS5F,YAGxB4F,EA6BT,SAASI,IACPZ,EAAmBjQ,IAAIvJ,MAAM,GAG/B,SAASqa,IACPb,EAAmBjQ,IAAIvJ,MAAM,GAC7B0Z,EAA4BnQ,IAAIvJ,MAAM,GAGxC,SAASsa,IACP,OAAOX,EAAetQ,IAAIrJ,OAAS,KAGrC,SAASua,EAAoBC,EAAOC,GAC7Bb,GACL9V,OAAO2F,eAAe+Q,EAAO,iBAC3BE,cAAc,EACdC,YAAY,EACZtR,IAAKoR,GAAUb,EAAkBvQ,MAIrC,SAASuR,EAASJ,GAChB,IACIpF,GAD8B,IAArBoF,EAAMK,WAAmBtB,EAAgBD,GAC/BkB,EAAM5F,MAC7B,GAAKQ,EAAL,CACA,IAAI0F,EApDN,SAAiB1F,EAAW7J,EAAQwP,GAClC,IAAID,KACAE,EAAOzP,EAEX,EAAG,CACD,GAAsB,IAAlByP,EAAKza,SAAgB,MAEzB,IAAI0a,EAAW7F,EAAUK,QAAQuF,GAEjC,GAAIC,EAAS5P,OAAQ,CACnB,IAAI6P,GACFF,KAAMA,EACNG,UAAWF,GAGTF,EACFD,EAAMM,QAAQF,GAEdJ,EAAMxM,KAAK4M,UAGRF,EAAOA,EAAKK,eAErB,OAAOP,EA6BKrF,CAAQL,EAAWoF,EAAMjP,OAA6B,IAArBiP,EAAMK,YACnD,GAAKC,EAAMzP,OAAX,CACA0O,EAAOS,EAAO,kBAAmBJ,GACjCL,EAAOS,EAAO,2BAA4BH,GAC1CE,EAAoBC,EAAOF,GAE3B,IAAK,IAAIlP,EAAI,EAAGkQ,EAAOR,EAAMzP,OAAQD,EAAIkQ,IACnC9B,EAAmBnQ,IAAImR,GADkBpP,IAAK,CAElD,IAAI8P,EAAUJ,EAAM1P,GACpBuO,EAAepQ,IAAIiR,EAAOU,EAAQF,MAElC,IAAK,IAAIhE,EAAI,EAAG0B,EAAOwC,EAAQC,UAAU9P,OAAQ2L,EAAI0B,IAC/CgB,EAA4BrQ,IAAImR,GADqBxD,IAEzDkE,EAAQC,UAAUnE,GAAGe,KAAKjY,KAAKob,EAAQF,KAAMR,GAIjDb,EAAc,OAAWa,GACzBD,EAAoBC,KAGtB,SAASnB,EAAG1N,EAAMoK,EAAUmE,GAC1B,IACIzW,KADU2Q,UAAU/I,OAAS,QAAsB3L,IAAjB0U,UAAU,GAAmBA,UAAU,OACvD3Q,QAClB8X,EAAS9X,EAAU8V,EAAgBD,EACnClE,EAAYmG,EAAO5P,GAElByJ,IACHA,EAAY,IAAIH,EAChBsG,EAAO5P,GAAQyJ,EACf9U,SAAS6B,iBAAiBwJ,EAAMiP,EAAUnX,IAG5C2R,EAAUhP,IAAI2P,EAAUmE,GAE1B,SAASd,EAAIzN,EAAMoK,EAAUmE,GAC3B,IACIzW,KADU2Q,UAAU/I,OAAS,QAAsB3L,IAAjB0U,UAAU,GAAmBA,UAAU,OACvD3Q,QAClB8X,EAAS9X,EAAU8V,EAAgBD,EACnClE,EAAYmG,EAAO5P,GAClByJ,IACLA,EAAU7O,OAAOwP,EAAUmE,GACvB9E,EAAUF,cACPqG,EAAO5P,GACdrL,SAAS8B,oBAAoBuJ,EAAMiP,EAAUnX,KAE/C,SAAS0V,EAAK5N,EAAQI,EAAM6P,GAC1B,OAAOjQ,EAAOkQ,cAAc,IAAIC,YAAY/P,GAC1CgQ,SAAS,EACTC,YAAY,EACZJ,OAAQA,gQC1HZ,IAAIK,EAAazK,EAAQ,KACrB0K,EAAe1K,EAAQ,KAGvB2K,EAAY,kBAwBhBtc,EAAOD,QALP,SAAkBgK,GAChB,MAAuB,UAAhBjK,EAAOiK,IACXsS,EAAatS,IAAUqS,EAAWrS,IAAUuS;;;;;;;;ICjB/C,WAGA,IAAIrc,EAMAsc,EAAmB,IAGnBC,EAAkB,kEAClBzJ,EAAkB,sBAClB0J,EAA+B,qDAG/BC,EAAiB,4BAGjBC,EAAmB,IAGnBC,EAAc,yBAGdC,EAAkB,EAClBC,EAAkB,EAClBC,EAAqB,EAGrBC,EAAuB,EACvBC,EAAyB,EAGzBC,EAAiB,EACjBC,EAAqB,EACrBC,EAAwB,EACxBC,EAAkB,EAClBC,EAAwB,GACxBC,EAAoB,GACpBC,EAA0B,GAC1BC,EAAgB,IAChBC,EAAkB,IAClBC,EAAiB,IAGjBC,EAAuB,GACvBC,EAAyB,MAGzBC,EAAY,IACZC,EAAW,GAGXC,EAAmB,EACnBC,EAAgB,EAIhBC,EAAW,IACXC,EAAmB,iBACnBC,EAAc,uBACdC,EAAM,IAGNC,EAAmB,WACnBC,EAAkBD,EAAmB,EACrCE,EAAwBF,IAAqB,EAG7CG,IACD,MAAOhB,IACP,OAAQP,IACR,UAAWC,IACX,QAASE,IACT,aAAcC,IACd,OAAQK,IACR,UAAWJ,IACX,eAAgBC,IAChB,QAASE,IAIRgB,EAAU,qBACVC,EAAW,iBACXC,EAAW,yBACXC,EAAU,mBACVC,EAAU,gBACVC,EAAY,wBACZC,EAAW,iBACXC,EAAU,oBACVC,EAAS,6BACTC,EAAS,eACTC,EAAY,kBACZ9J,GAAU,gBACV+J,GAAY,kBAEZC,GAAW,iBACXC,GAAY,kBACZC,GAAS,eACTC,GAAY,kBACZnD,GAAY,kBACZ/G,GAAe,qBACfmK,GAAa,mBACbC,GAAa,mBAEbC,GAAiB,uBACjBC,GAAc,oBACdC,GAAa,wBACbC,GAAa,wBACbC,GAAU,qBACVC,GAAW,sBACXC,GAAW,sBACXC,GAAW,sBACXC,GAAkB,6BAClBC,GAAY,uBACZC,GAAY,uBAGZC,GAAuB,iBACvBC,GAAsB,qBACtBC,GAAwB,gCAGxBC,GAAgB,4BAChBC,GAAkB,WAClBC,GAAmBC,OAAOH,GAAchG,QACxCoG,GAAqBD,OAAOF,GAAgBjG,QAG5CqG,GAAW,mBACXC,GAAa,kBACbC,GAAgB,mBAGhBC,GAAe,mDACfC,GAAgB,QAChBC,GAAa,mGAMbC,GAAe,sBACfC,GAAkBT,OAAOQ,GAAa3G,QAGtC3I,GAAc,OAGdE,GAAe,KAGfsP,GAAgB,4CAChBC,GAAgB,oCAChBC,GAAiB,QAGjBC,GAAc,4CAYdC,GAA6B,mBAG7BC,GAAe,WAMfC,GAAe,kCAGfC,GAAU,OAGVC,GAAa,qBAGbC,GAAa,aAGbC,GAAe,8BAGfC,GAAY,cAGZC,GAAW,mBAGXC,GAAU,8CAGVC,GAAY,OAGZC,GAAoB,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,GAlB9B,qEAmBjBI,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,iBAAyBN,GAAaC,GAAYC,IAAYjK,KAAK,KAAO,qBAAiBqK,GAAW,MAIlHE,GAAU,OAASZ,GAAWK,GAAYC,IAAYjK,KAAK,KAAO,IAAMsK,GACxEE,GAAW,OAAST,GAAcN,GAAU,IAAKA,GAASO,GAAYC,GAAYV,IAAUvJ,KAAK,KAAO,IAGxGyK,GAAShD,OA/BA,OA+Be,KAMxBiD,GAAcjD,OAAOgC,GAAS,KAG9BkB,GAAYlD,OAAOqC,GAAS,MAAQA,GAAS,KAAOU,GAAWF,GAAO,KAGtEM,GAAgBnD,QAClByC,GAAU,IAAMN,GAAU,qCAAiCJ,GAASU,GAAS,KAAKlK,KAAK,KAAO,IAC9FoK,GAAc,qCAAiCZ,GAASU,GAAUC,GAAa,KAAKnK,KAAK,KAAO,IAChGkK,GAAU,IAAMC,GAAc,iCAC9BD,GAAU,iCAtBK,mDADA,mDA0BfR,GACAa,IACAvK,KAAK,KAAM,KAGT6K,GAAepD,OAAO,0BAA+B0B,GA3DxC,mBA8Db2B,GAAmB,qEAGnBC,IACF,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,MACJA,GAAevE,IAAcuE,GAAetE,IAC5CsE,GAAerE,IAAWqE,GAAepE,IACzCoE,GAAenE,IAAYmE,GAAelE,IAC1CkE,GAAejE,IAAmBiE,GAAehE,IACjDgE,GAAe/D,KAAa,EAC5B+D,GAAe3F,GAAW2F,GAAe1F,GACzC0F,GAAezE,IAAkByE,GAAexF,GAChDwF,GAAexE,IAAewE,GAAevF,GAC7CuF,GAAerF,GAAYqF,GAAepF,GAC1CoF,GAAelF,GAAUkF,GAAejF,GACxCiF,GAAehF,IAAagF,GAAe9E,IAC3C8E,GAAe7E,IAAU6E,GAAe5E,IACxC4E,GAAe3E,KAAc,EAG7B,IAAI4E,MACJA,GAAc5F,GAAW4F,GAAc3F,GACvC2F,GAAc1E,IAAkB0E,GAAczE,IAC9CyE,GAAczF,GAAWyF,GAAcxF,GACvCwF,GAAcxE,IAAcwE,GAAcvE,IAC1CuE,GAActE,IAAWsE,GAAcrE,IACvCqE,GAAcpE,IAAYoE,GAAcnF,GACxCmF,GAAclF,GAAakF,GAAcjF,IACzCiF,GAAc/E,IAAa+E,GAAc9E,IACzC8E,GAAc7E,IAAa6E,GAAchI,IACzCgI,GAAcnE,IAAYmE,GAAclE,IACxCkE,GAAcjE,IAAaiE,GAAchE,KAAa,EACtDgE,GAActF,GAAYsF,GAAcrF,GACxCqF,GAAc5E,KAAc,EAG5B,IA4EI6E,IACFC,KAAM,KACNC,IAAK,IACLC,KAAM,IACNC,KAAM,IACNC,SAAU,QACVC,SAAU,SAIRC,GAAiBC,WACjBC,GAAeC,SAGfjQ,GAA8B,gBAAjB,IAAOpV,EAAP,YAAAE,EAAOF,KAAsBA,GAAUA,EAAOyE,SAAWA,QAAUzE,EAGhFqV,GAA0B,WAAf,oBAAO7P,KAAP,YAAAtF,EAAOsF,QAAoBA,MAAQA,KAAKf,SAAWA,QAAUe,KAGxEsM,GAAOsD,IAAcC,IAAYC,SAAS,cAATA,GAGjCgQ,GAAgC,UAAlBplB,EAAOC,IAAuBA,IAAYA,EAAQe,UAAYf,EAG5EolB,GAAaD,IAAgC,UAAjBplB,EAAOE,IAAsBA,IAAWA,EAAOc,UAAYd,EAGvFolB,GAAgBD,IAAcA,GAAWplB,UAAYmlB,GAGrDG,GAAcD,IAAiBpQ,GAAWsQ,QAG1CC,GAAY,WACd,IAEE,IAAIC,EAAQL,IAAcA,GAAWxT,SAAWwT,GAAWxT,QAAQ,QAAQ6T,MAE3E,OAAIA,GAKGH,IAAeA,GAAYI,SAAWJ,GAAYI,QAAQ,QACjE,MAAO5Z,KAXK,GAeZ6Z,GAAoBH,IAAYA,GAASI,cACzCC,GAAaL,IAAYA,GAASM,OAClCC,GAAYP,IAAYA,GAASQ,MACjCC,GAAeT,IAAYA,GAASU,SACpCC,GAAYX,IAAYA,GAASY,MACjCC,GAAmBb,IAAYA,GAASc,aAc5C,SAASzf,GAAMuM,EAAMe,EAASD,GAC5B,OAAQA,EAAKrI,QACX,KAAK,EAAG,OAAOuH,EAAK9S,KAAK6T,GACzB,KAAK,EAAG,OAAOf,EAAK9S,KAAK6T,EAASD,EAAK,IACvC,KAAK,EAAG,OAAOd,EAAK9S,KAAK6T,EAASD,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAOd,EAAK9S,KAAK6T,EAASD,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAOd,EAAKvM,MAAMsN,EAASD,GAa7B,SAASqS,GAAgBC,EAAOC,EAAQC,EAAUC,GAIhD,IAHA,IAAIpW,GAAS,EACT1E,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,SAE9B0E,EAAQ1E,GAAQ,CACvB,IAAI7B,EAAQwc,EAAMjW,GAClBkW,EAAOE,EAAa3c,EAAO0c,EAAS1c,GAAQwc,GAE9C,OAAOG,EAYT,SAASC,GAAUJ,EAAOE,GAIxB,IAHA,IAAInW,GAAS,EACT1E,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,SAE9B0E,EAAQ1E,IAC8B,IAAzC6a,EAASF,EAAMjW,GAAQA,EAAOiW,KAIpC,OAAOA,EAYT,SAASK,GAAeL,EAAOE,GAG7B,IAFA,IAAI7a,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,OAEhCA,MAC0C,IAA3C6a,EAASF,EAAM3a,GAASA,EAAQ2a,KAItC,OAAOA,EAaT,SAASM,GAAWN,EAAOO,GAIzB,IAHA,IAAIxW,GAAS,EACT1E,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,SAE9B0E,EAAQ1E,GACf,IAAKkb,EAAUP,EAAMjW,GAAQA,EAAOiW,GAClC,OAAO,EAGX,OAAO,EAYT,SAASQ,GAAYR,EAAOO,GAM1B,IALA,IAAIxW,GAAS,EACT1E,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,OACnCob,EAAW,EACX/V,OAEKX,EAAQ1E,GAAQ,CACvB,IAAI7B,EAAQwc,EAAMjW,GACdwW,EAAU/c,EAAOuG,EAAOiW,KAC1BtV,EAAO+V,KAAcjd,GAGzB,OAAOkH,EAYT,SAASgW,GAAcV,EAAOxc,GAE5B,SADsB,MAATwc,EAAgB,EAAIA,EAAM3a,SACpBsb,GAAYX,EAAOxc,EAAO,IAAM,EAYrD,SAASod,GAAkBZ,EAAOxc,EAAOqd,GAIvC,IAHA,IAAI9W,GAAS,EACT1E,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,SAE9B0E,EAAQ1E,GACf,GAAIwb,EAAWrd,EAAOwc,EAAMjW,IAC1B,OAAO,EAGX,OAAO,EAYT,SAAS+W,GAASd,EAAOE,GAKvB,IAJA,IAAInW,GAAS,EACT1E,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,OACnCqF,EAASqW,MAAM1b,KAEV0E,EAAQ1E,GACfqF,EAAOX,GAASmW,EAASF,EAAMjW,GAAQA,EAAOiW,GAEhD,OAAOtV,EAWT,SAASsW,GAAUhB,EAAOiB,GAKxB,IAJA,IAAIlX,GAAS,EACT1E,EAAS4b,EAAO5b,OAChBnI,EAAS8iB,EAAM3a,SAEV0E,EAAQ1E,GACf2a,EAAM9iB,EAAS6M,GAASkX,EAAOlX,GAEjC,OAAOiW,EAeT,SAASkB,GAAYlB,EAAOE,EAAUC,EAAagB,GACjD,IAAIpX,GAAS,EACT1E,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,OAKvC,IAHI8b,GAAa9b,IACf8a,EAAcH,IAAQjW,MAEfA,EAAQ1E,GACf8a,EAAcD,EAASC,EAAaH,EAAMjW,GAAQA,EAAOiW,GAE3D,OAAOG,EAeT,SAASiB,GAAiBpB,EAAOE,EAAUC,EAAagB,GACtD,IAAI9b,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,OAIvC,IAHI8b,GAAa9b,IACf8a,EAAcH,IAAQ3a,IAEjBA,KACL8a,EAAcD,EAASC,EAAaH,EAAM3a,GAASA,EAAQ2a,GAE7D,OAAOG,EAaT,SAASkB,GAAUrB,EAAOO,GAIxB,IAHA,IAAIxW,GAAS,EACT1E,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,SAE9B0E,EAAQ1E,GACf,GAAIkb,EAAUP,EAAMjW,GAAQA,EAAOiW,GACjC,OAAO,EAGX,OAAO,EAUT,IAAIsB,GAAYC,GAAa,UAmC7B,SAASC,GAAYC,EAAYlB,EAAWmB,GAC1C,IAAIhX,EAOJ,OANAgX,EAASD,EAAY,SAASje,EAAOoE,EAAK6Z,GACxC,GAAIlB,EAAU/c,EAAOoE,EAAK6Z,GAExB,OADA/W,EAAS9C,GACF,IAGJ8C,EAcT,SAASiX,GAAc3B,EAAOO,EAAWqB,EAAWC,GAIlD,IAHA,IAAIxc,EAAS2a,EAAM3a,OACf0E,EAAQ6X,GAAaC,EAAY,GAAK,GAElCA,EAAY9X,MAAYA,EAAQ1E,GACtC,GAAIkb,EAAUP,EAAMjW,GAAQA,EAAOiW,GACjC,OAAOjW,EAGX,OAAQ,EAYV,SAAS4W,GAAYX,EAAOxc,EAAOoe,GACjC,OAAOpe,GAAUA,EAidnB,SAAuBwc,EAAOxc,EAAOoe,GACnC,IAAI7X,EAAQ6X,EAAY,EACpBvc,EAAS2a,EAAM3a,OAEnB,OAAS0E,EAAQ1E,GACf,GAAI2a,EAAMjW,KAAWvG,EACnB,OAAOuG,EAGX,OAAQ,EAzdJ+X,CAAc9B,EAAOxc,EAAOoe,GAC5BD,GAAc3B,EAAO+B,GAAWH,GAatC,SAASI,GAAgBhC,EAAOxc,EAAOoe,EAAWf,GAIhD,IAHA,IAAI9W,EAAQ6X,EAAY,EACpBvc,EAAS2a,EAAM3a,SAEV0E,EAAQ1E,GACf,GAAIwb,EAAWb,EAAMjW,GAAQvG,GAC3B,OAAOuG,EAGX,OAAQ,EAUV,SAASgY,GAAUve,GACjB,OAAOA,GAAUA,EAYnB,SAASye,GAASjC,EAAOE,GACvB,IAAI7a,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,OACvC,OAAOA,EAAU6c,GAAQlC,EAAOE,GAAY7a,EAAUyS,EAUxD,SAASyJ,GAAa3Z,GACpB,OAAO,SAASua,GACd,OAAiB,MAAVA,EAAiBzoB,EAAYyoB,EAAOva,IAW/C,SAASwa,GAAeD,GACtB,OAAO,SAASva,GACd,OAAiB,MAAVua,EAAiBzoB,EAAYyoB,EAAOva,IAiB/C,SAASya,GAAWZ,EAAYvB,EAAUC,EAAagB,EAAWO,GAMhE,OALAA,EAASD,EAAY,SAASje,EAAOuG,EAAO0X,GAC1CtB,EAAcgB,GACTA,GAAY,EAAO3d,GACpB0c,EAASC,EAAa3c,EAAOuG,EAAO0X,KAEnCtB,EAgCT,SAAS+B,GAAQlC,EAAOE,GAKtB,IAJA,IAAIxV,EACAX,GAAS,EACT1E,EAAS2a,EAAM3a,SAEV0E,EAAQ1E,GAAQ,CACvB,IAAIid,EAAUpC,EAASF,EAAMjW,IACzBuY,IAAY5oB,IACdgR,EAASA,IAAWhR,EAAY4oB,EAAW5X,EAAS4X,GAGxD,OAAO5X,EAYT,SAAS6X,GAAUC,EAAGtC,GAIpB,IAHA,IAAInW,GAAS,EACTW,EAASqW,MAAMyB,KAEVzY,EAAQyY,GACf9X,EAAOX,GAASmW,EAASnW,GAE3B,OAAOW,EAyBT,SAAS+X,GAAShX,GAChB,OAAOA,EACHA,EAAOxB,MAAM,EAAGsB,GAAgBE,GAAU,GAAGjH,QAAQgH,GAAa,IAClEC,EAUN,SAASiX,GAAU9V,GACjB,OAAO,SAASpJ,GACd,OAAOoJ,EAAKpJ,IAchB,SAASmf,GAAWR,EAAQvf,GAC1B,OAAOke,GAASle,EAAO,SAASgF,GAC9B,OAAOua,EAAOva,KAYlB,SAASgb,GAASC,EAAOjb,GACvB,OAAOib,EAAMC,IAAIlb,GAYnB,SAASmb,GAAgBC,EAAYC,GAInC,IAHA,IAAIlZ,GAAS,EACT1E,EAAS2d,EAAW3d,SAEf0E,EAAQ1E,GAAUsb,GAAYsC,EAAYD,EAAWjZ,GAAQ,IAAM,IAC5E,OAAOA,EAYT,SAASmZ,GAAcF,EAAYC,GAGjC,IAFA,IAAIlZ,EAAQiZ,EAAW3d,OAEhB0E,KAAW4W,GAAYsC,EAAYD,EAAWjZ,GAAQ,IAAM,IACnE,OAAOA,EA+BT,IAAIoZ,GAAef,IA/wBjBgB,IAAQ,IAAMC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAC1EC,IAAQ,IAAMC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAC1EC,IAAQ,IAAMC,IAAQ,IACtBC,IAAQ,IAAMC,IAAQ,IACtBC,IAAQ,IAAMC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAChDC,IAAQ,IAAMC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAChDC,IAAQ,IAAMC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAChDC,IAAQ,IAAMC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAChDC,IAAQ,IAAMC,IAAQ,IACtBC,IAAQ,IAAMC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAC1EC,IAAQ,IAAMC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAC1EC,IAAQ,IAAMC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAChDC,IAAQ,IAAMC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAChDC,IAAQ,IAAMC,IAAQ,IAAKC,IAAQ,IACnCC,IAAQ,KAAMC,IAAQ,KACtBC,IAAQ,KAAMC,IAAQ,KACtBC,IAAQ,KAERC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACxDC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACxDC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACxDC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACvEC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACvEC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACxDC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACxDC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACxDC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACvEC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACvEC,IAAU,IAAMC,IAAU,IAC1BC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACvEC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACvEC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACxDC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACxDC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACxDC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACxDC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACtFC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACtFC,IAAU,IAAMC,IAAU,IAC1BC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,KAAMC,IAAU,KAC1BC,IAAU,KAAMC,IAAU,KAC1BC,IAAU,KAAMC,IAAU,MAouBxBC,GAAiB9M,IA/tBnB+M,IAAK,QACLC,IAAK,OACLC,IAAK,OACLC,IAAK,SACLpR,IAAK,UAouBP,SAASqR,GAAiBC,GACxB,MAAO,KAAOxR,GAAcwR,GAsB9B,SAASC,GAAWhkB,GAClB,OAAOiS,GAAa9Y,KAAK6G,GAsC3B,SAASikB,GAAW9e,GAClB,IAAI7G,GAAS,EACTW,EAASqW,MAAMnQ,EAAI1B,MAKvB,OAHA0B,EAAI3R,QAAQ,SAASuE,EAAOoE,GAC1B8C,IAASX,IAAUnC,EAAKpE,KAEnBkH,EAWT,SAASilB,GAAQ/iB,EAAMzF,GACrB,OAAO,SAASyoB,GACd,OAAOhjB,EAAKzF,EAAUyoB,KAa1B,SAASC,GAAe7P,EAAO/d,GAM7B,IALA,IAAI8H,GAAS,EACT1E,EAAS2a,EAAM3a,OACfob,EAAW,EACX/V,OAEKX,EAAQ1E,GAAQ,CACvB,IAAI7B,EAAQwc,EAAMjW,GACdvG,IAAUvB,GAAeuB,IAAU6S,IACrC2J,EAAMjW,GAASsM,EACf3L,EAAO+V,KAAc1W,GAGzB,OAAOW,EAUT,SAASolB,GAAWvsB,GAClB,IAAIwG,GAAS,EACTW,EAASqW,MAAMxd,EAAI2L,MAKvB,OAHA3L,EAAItE,QAAQ,SAASuE,GACnBkH,IAASX,GAASvG,IAEbkH,EAUT,SAASqlB,GAAWxsB,GAClB,IAAIwG,GAAS,EACTW,EAASqW,MAAMxd,EAAI2L,MAKvB,OAHA3L,EAAItE,QAAQ,SAASuE,GACnBkH,IAASX,IAAUvG,EAAOA,KAErBkH,EAoDT,SAASslB,GAAWvkB,GAClB,OAAOgkB,GAAWhkB,GAiDpB,SAAqBA,GACnB,IAAIf,EAAS8S,GAAUyS,UAAY,EACnC,KAAOzS,GAAU5Y,KAAK6G,MAClBf,EAEJ,OAAOA,EArDHwlB,CAAYzkB,GACZ6V,GAAU7V,GAUhB,SAAS0kB,GAAc1kB,GACrB,OAAOgkB,GAAWhkB,GAmDpB,SAAwBA,GACtB,OAAOA,EAAO2E,MAAMoN,QAnDhB4S,CAAe3kB,GA7kBrB,SAAsBA,GACpB,OAAOA,EAAOnL,MAAM,IA6kBhB+vB,CAAa5kB,GAWnB,SAASF,GAAgBE,GAGvB,IAFA,IAAI1B,EAAQ0B,EAAOpG,OAEZ0E,KAAW2B,GAAa9G,KAAK6G,EAAOE,OAAO5B,MAClD,OAAOA,EAUT,IAAIumB,GAAmBlO,IA18BrBmO,QAAS,IACTC,OAAQ,IACRC,OAAQ,IACRC,SAAU,IACVC,QAAS,MA4gCX,IAs3eI3sB,GAt3egB,SAAS4sB,EAAa5gB,GAIxC,IAAI+Q,GAHJ/Q,EAAqB,MAAXA,EAAkB7E,GAAOnH,GAAE6sB,SAAS1lB,GAAKrN,SAAUkS,EAAShM,GAAE8sB,KAAK3lB,GAAMyS,MAG/DmD,MAChB1V,EAAO2E,EAAQ3E,KACfvD,EAAQkI,EAAQlI,MAChB6G,GAAWqB,EAAQrB,SACnB3T,GAAOgV,EAAQhV,KACf8C,GAASkS,EAAQlS,OACjBwc,GAAStK,EAAQsK,OACjBzU,GAASmK,EAAQnK,OACjB0H,GAAYyC,EAAQzC,UAGpBwjB,GAAahQ,EAAMxiB,UACnByyB,GAAYriB,GAASpQ,UACrBsN,GAAc/N,GAAOS,UAGrB0yB,GAAajhB,EAAQ,sBAGrBkhB,GAAeF,GAAUhlB,SAGzBF,GAAiBD,GAAYC,eAG7BqlB,GAAY,EAGZC,GAAc,WAChB,IAAIjiB,EAAM,SAAStM,KAAKouB,IAAcA,GAAWjyB,MAAQiyB,GAAWjyB,KAAKqyB,UAAY,IACrF,OAAOliB,EAAO,iBAAmBA,EAAO,GAFxB,GAUdpD,GAAuBF,GAAYG,SAGnCslB,GAAmBJ,GAAap3B,KAAKgE,IAGrCyzB,GAAUpmB,GAAKnH,EAGfwtB,GAAalX,GAAO,IACtB4W,GAAap3B,KAAKgS,IAAgBtH,QAAQsW,GAAc,QACvDtW,QAAQ,yDAA0D,SAAW,KAI5EitB,GAAS5S,GAAgB7O,EAAQyhB,OAAS/3B,EAC1CkS,GAASoE,EAAQpE,OACjB8lB,GAAa1hB,EAAQ0hB,WACrBC,GAAcF,GAASA,GAAOE,YAAcj4B,EAC5Ck4B,GAAejC,GAAQ7xB,GAAO+zB,eAAgB/zB,IAC9Cg0B,GAAeh0B,GAAOkI,OACtB+rB,GAAuBlmB,GAAYkmB,qBACnCvf,GAASue,GAAWve,OACpBwf,GAAmBpmB,GAASA,GAAOqmB,mBAAqBv4B,EACxDw4B,GAActmB,GAASA,GAAOumB,SAAWz4B,EACzCuS,GAAiBL,GAASA,GAAOM,YAAcxS,EAE/C+J,GAAkB,WACpB,IACE,IAAImJ,EAAOwlB,GAAUt0B,GAAQ,kBAE7B,OADA8O,KAAS,OACFA,EACP,MAAOtH,KALW,GASlB+sB,GAAkBriB,EAAQjJ,eAAiBoE,GAAKpE,cAAgBiJ,EAAQjJ,aACxEurB,GAASjnB,GAAQA,EAAKC,MAAQH,GAAKE,KAAKC,KAAOD,EAAKC,IACpDinB,GAAgBviB,EAAQpR,aAAeuM,GAAKvM,YAAcoR,EAAQpR,WAGlE4zB,GAAax3B,GAAKy3B,KAClBC,GAAc13B,GAAK23B,MACnBC,GAAmB90B,GAAO+0B,sBAC1BC,GAAiBrB,GAASA,GAAOsB,SAAWr5B,EAC5Cs5B,GAAiBhjB,EAAQijB,SACzBC,GAAanC,GAAWle,KACxBsgB,GAAaxD,GAAQ7xB,GAAOkB,KAAMlB,IAClC2O,GAAYzR,GAAKC,IACjByR,GAAY1R,GAAK2R,IACjBymB,GAAY/nB,EAAKC,IACjB+nB,GAAiBrjB,EAAQ0O,SACzB4U,GAAet4B,GAAKu4B,OACpBC,GAAgBzC,GAAWhc,QAG3B0e,GAAWrB,GAAUpiB,EAAS,YAC9BQ,GAAM4hB,GAAUpiB,EAAS,OACzB0jB,GAAUtB,GAAUpiB,EAAS,WAC7B2jB,GAAMvB,GAAUpiB,EAAS,OACzByD,GAAU2e,GAAUpiB,EAAS,WAC7B4jB,GAAexB,GAAUt0B,GAAQ,UAGjC+1B,GAAUpgB,IAAW,IAAIA,GAGzBqgB,MAGAC,GAAqBC,GAASP,IAC9BQ,GAAgBD,GAASxjB,IACzB0jB,GAAoBF,GAASN,IAC7BS,GAAgBH,GAASL,IACzBS,GAAoBJ,GAASvgB,IAG7B4gB,GAAczoB,GAASA,GAAOrN,UAAY7E,EAC1C46B,GAAgBD,GAAcA,GAAYE,QAAU76B,EACpD86B,GAAiBH,GAAcA,GAAYroB,SAAWtS,EAyH1D,SAAS+6B,GAAOjxB,GACd,GAAIsS,GAAatS,KAAWkxB,GAAQlxB,MAAYA,aAAiBmxB,IAAc,CAC7E,GAAInxB,aAAiBoxB,GACnB,OAAOpxB,EAET,GAAIsI,GAAehS,KAAK0J,EAAO,eAC7B,OAAOqxB,GAAarxB,GAGxB,OAAO,IAAIoxB,GAAcpxB,GAW3B,IAAIsxB,GAAc,WAChB,SAAS3S,KACT,OAAO,SAAS5Q,GACd,IAAKjF,GAASiF,GACZ,SAEF,GAAIugB,GACF,OAAOA,GAAavgB,GAEtB4Q,EAAO5jB,UAAYgT,EACnB,IAAI7G,EAAS,IAAIyX,EAEjB,OADAA,EAAO5jB,UAAY7E,EACZgR,GAZO,GAqBlB,SAASqqB,MAWT,SAASH,GAAcpxB,EAAOwxB,GAC5Bh7B,KAAKi7B,YAAczxB,EACnBxJ,KAAKk7B,eACLl7B,KAAKm7B,YAAcH,EACnBh7B,KAAKo7B,UAAY,EACjBp7B,KAAKq7B,WAAa37B,EAgFpB,SAASi7B,GAAYnxB,GACnBxJ,KAAKi7B,YAAczxB,EACnBxJ,KAAKk7B,eACLl7B,KAAKs7B,QAAU,EACft7B,KAAKu7B,cAAe,EACpBv7B,KAAKw7B,iBACLx7B,KAAKy7B,cAAgB1d,EACrB/d,KAAK07B,aAgHP,SAASC,GAAKC,GACZ,IAAI7rB,GAAS,EACT1E,EAAoB,MAAXuwB,EAAkB,EAAIA,EAAQvwB,OAG3C,IADArL,KAAK67B,UACI9rB,EAAQ1E,GAAQ,CACvB,IAAIywB,EAAQF,EAAQ7rB,GACpB/P,KAAKuJ,IAAIuyB,EAAM,GAAIA,EAAM,KAiG7B,SAASC,GAAUH,GACjB,IAAI7rB,GAAS,EACT1E,EAAoB,MAAXuwB,EAAkB,EAAIA,EAAQvwB,OAG3C,IADArL,KAAK67B,UACI9rB,EAAQ1E,GAAQ,CACvB,IAAIywB,EAAQF,EAAQ7rB,GACpB/P,KAAKuJ,IAAIuyB,EAAM,GAAIA,EAAM,KA8G7B,SAASE,GAASJ,GAChB,IAAI7rB,GAAS,EACT1E,EAAoB,MAAXuwB,EAAkB,EAAIA,EAAQvwB,OAG3C,IADArL,KAAK67B,UACI9rB,EAAQ1E,GAAQ,CACvB,IAAIywB,EAAQF,EAAQ7rB,GACpB/P,KAAKuJ,IAAIuyB,EAAM,GAAIA,EAAM,KAiG7B,SAASG,GAAShV,GAChB,IAAIlX,GAAS,EACT1E,EAAmB,MAAV4b,EAAiB,EAAIA,EAAO5b,OAGzC,IADArL,KAAKk8B,SAAW,IAAIF,KACXjsB,EAAQ1E,GACfrL,KAAKoG,IAAI6gB,EAAOlX,IA6CpB,SAASosB,GAAMP,GACb,IAAI7jB,EAAO/X,KAAKk8B,SAAW,IAAIH,GAAUH,GACzC57B,KAAKkV,KAAO6C,EAAK7C,KAqGnB,SAASknB,GAAc5yB,EAAO6yB,GAC5B,IAAIC,EAAQ5B,GAAQlxB,GAChB+yB,GAASD,GAASE,GAAYhzB,GAC9BizB,GAAUH,IAAUC,GAASxD,GAASvvB,GACtCkzB,GAAUJ,IAAUC,IAAUE,GAAU3W,GAAatc,GACrDmzB,EAAcL,GAASC,GAASE,GAAUC,EAC1ChsB,EAASisB,EAAcpU,GAAU/e,EAAM6B,OAAQQ,OAC/CR,EAASqF,EAAOrF,OAEpB,IAAK,IAAIuC,KAAOpE,GACT6yB,IAAavqB,GAAehS,KAAK0J,EAAOoE,IACvC+uB,IAEQ,UAAP/uB,GAEC6uB,IAAkB,UAAP7uB,GAA0B,UAAPA,IAE9B8uB,IAAkB,UAAP9uB,GAA0B,cAAPA,GAA8B,cAAPA,IAEtDgvB,GAAQhvB,EAAKvC,KAElBqF,EAAOpC,KAAKV,GAGhB,OAAO8C,EAUT,SAASmsB,GAAY7W,GACnB,IAAI3a,EAAS2a,EAAM3a,OACnB,OAAOA,EAAS2a,EAAM8W,GAAW,EAAGzxB,EAAS,IAAM3L,EAWrD,SAASq9B,GAAgB/W,EAAOwC,GAC9B,OAAOwU,GAAYC,GAAUjX,GAAQkX,GAAU1U,EAAG,EAAGxC,EAAM3a,SAU7D,SAAS8xB,GAAanX,GACpB,OAAOgX,GAAYC,GAAUjX,IAY/B,SAASoX,GAAiBjV,EAAQva,EAAKpE,IAChCA,IAAU9J,GAAc29B,GAAGlV,EAAOva,GAAMpE,MACxCA,IAAU9J,GAAekO,KAAOua,IACnCmV,GAAgBnV,EAAQva,EAAKpE,GAcjC,SAAS+zB,GAAYpV,EAAQva,EAAKpE,GAChC,IAAIg0B,EAAWrV,EAAOva,GAChBkE,GAAehS,KAAKqoB,EAAQva,IAAQyvB,GAAGG,EAAUh0B,KAClDA,IAAU9J,GAAekO,KAAOua,IACnCmV,GAAgBnV,EAAQva,EAAKpE,GAYjC,SAASi0B,GAAazX,EAAOpY,GAE3B,IADA,IAAIvC,EAAS2a,EAAM3a,OACZA,KACL,GAAIgyB,GAAGrX,EAAM3a,GAAQ,GAAIuC,GACvB,OAAOvC,EAGX,OAAQ,EAcV,SAASqyB,GAAejW,EAAYxB,EAAQC,EAAUC,GAIpD,OAHAwX,GAASlW,EAAY,SAASje,EAAOoE,EAAK6Z,GACxCxB,EAAOE,EAAa3c,EAAO0c,EAAS1c,GAAQie,KAEvCtB,EAYT,SAASyX,GAAWzV,EAAQhO,GAC1B,OAAOgO,GAAU0V,GAAW1jB,EAAQnV,GAAKmV,GAASgO,GAyBpD,SAASmV,GAAgBnV,EAAQva,EAAKpE,GACzB,aAAPoE,GAAsBnE,GACxBA,GAAe0e,EAAQva,GACrB8M,cAAgB,EAChBC,YAAc,EACdnR,MAASA,EACTs0B,UAAY,IAGd3V,EAAOva,GAAOpE,EAYlB,SAASu0B,GAAO5V,EAAQ6V,GAMtB,IALA,IAAIjuB,GAAS,EACT1E,EAAS2yB,EAAM3yB,OACfqF,EAASqW,EAAM1b,GACf4yB,EAAiB,MAAV9V,IAEFpY,EAAQ1E,GACfqF,EAAOX,GAASkuB,EAAOv+B,EAAY2J,GAAI8e,EAAQ6V,EAAMjuB,IAEvD,OAAOW,EAYT,SAASwsB,GAAUgB,EAAQC,EAAOC,GAShC,OARIF,GAAWA,IACTE,IAAU1+B,IACZw+B,EAASA,GAAUE,EAAQF,EAASE,GAElCD,IAAUz+B,IACZw+B,EAASA,GAAUC,EAAQD,EAASC,IAGjCD,EAmBT,SAASG,GAAU70B,EAAO80B,EAASC,EAAY3wB,EAAKua,EAAQqW,GAC1D,IAAI9tB,EACA+tB,EAASH,EAAUhiB,EACnBoiB,EAASJ,EAAU/hB,EACnBoiB,EAASL,EAAU9hB,EAKvB,GAHI+hB,IACF7tB,EAASyX,EAASoW,EAAW/0B,EAAOoE,EAAKua,EAAQqW,GAASD,EAAW/0B,IAEnEkH,IAAWhR,EACb,OAAOgR,EAET,IAAK4B,GAAS9I,GACZ,OAAOA,EAET,IAAI8yB,EAAQ5B,GAAQlxB,GACpB,GAAI8yB,GAEF,GADA5rB,EA68GJ,SAAwBsV,GACtB,IAAI3a,EAAS2a,EAAM3a,OACfqF,EAAS,IAAIsV,EAAMxhB,YAAY6G,GAOnC,OAJIA,GAA6B,iBAAZ2a,EAAM,IAAkBlU,GAAehS,KAAKkmB,EAAO,WACtEtV,EAAOX,MAAQiW,EAAMjW,MACrBW,EAAOkuB,MAAQ5Y,EAAM4Y,OAEhBluB,EAt9GImuB,CAAer1B,IACnBi1B,EACH,OAAOxB,GAAUzzB,EAAOkH,OAErB,CACL,IAAI0B,EAAM0sB,GAAOt1B,GACbu1B,EAAS3sB,GAAOsM,GAAWtM,GAAOuM,EAEtC,GAAIoa,GAASvvB,GACX,OAAOw1B,GAAYx1B,EAAOi1B,GAE5B,GAAIrsB,GAAO0M,IAAa1M,GAAO+L,GAAY4gB,IAAW5W,GAEpD,GADAzX,EAAUguB,GAAUK,KAAeE,GAAgBz1B,IAC9Ci1B,EACH,OAAOC,EA+nEf,SAAuBvkB,EAAQgO,GAC7B,OAAO0V,GAAW1jB,EAAQ+kB,GAAa/kB,GAASgO,GA/nEtCgX,CAAc31B,EAnH1B,SAAsB2e,EAAQhO,GAC5B,OAAOgO,GAAU0V,GAAW1jB,EAAQilB,GAAOjlB,GAASgO,GAkHrBkX,CAAa3uB,EAAQlH,IAknEtD,SAAqB2Q,EAAQgO,GAC3B,OAAO0V,GAAW1jB,EAAQmlB,GAAWnlB,GAASgO,GAlnEpCoX,CAAY/1B,EAAOo0B,GAAWltB,EAAQlH,QAEvC,CACL,IAAKua,GAAc3R,GACjB,OAAO+V,EAAS3e,KAElBkH,EA49GN,SAAwByX,EAAQ/V,EAAKqsB,GACnC,IAAIe,EAAOrX,EAAO3jB,YAClB,OAAQ4N,GACN,KAAKiN,GACH,OAAOogB,GAAiBtX,GAE1B,KAAK7J,EACL,KAAKC,EACH,OAAO,IAAIihB,GAAMrX,GAEnB,KAAK7I,GACH,OA5nDN,SAAuBogB,EAAUjB,GAC/B,IAAIkB,EAASlB,EAASgB,GAAiBC,EAASC,QAAUD,EAASC,OACnE,OAAO,IAAID,EAASl7B,YAAYm7B,EAAQD,EAASE,WAAYF,EAASG,YA0nD3DC,CAAc3X,EAAQsW,GAE/B,KAAKlf,GAAY,KAAKC,GACtB,KAAKC,GAAS,KAAKC,GAAU,KAAKC,GAClC,KAAKC,GAAU,KAAKC,GAAiB,KAAKC,GAAW,KAAKC,GACxD,OAAOggB,GAAgB5X,EAAQsW,GAEjC,KAAK7f,EACH,OAAO,IAAI4gB,EAEb,KAAK3gB,EACL,KAAKK,GACH,OAAO,IAAIsgB,EAAKrX,GAElB,KAAKnJ,GACH,OA/nDN,SAAqBghB,GACnB,IAAItvB,EAAS,IAAIsvB,EAAOx7B,YAAYw7B,EAAO7lB,OAAQoH,GAAQ1Y,KAAKm3B,IAEhE,OADAtvB,EAAOulB,UAAY+J,EAAO/J,UACnBvlB,EA4nDIuvB,CAAY9X,GAErB,KAAKlJ,GACH,OAAO,IAAIugB,EAEb,KAAKzjB,GACH,OAxnDN,SAAqBmkB,GACnB,OAAO5F,GAAgBx2B,GAAOw2B,GAAcx6B,KAAKogC,OAunDtCC,CAAYhY,IA5/GViY,CAAe52B,EAAO4I,EAAKqsB,IAIxCD,IAAUA,EAAQ,IAAIrC,IACtB,IAAIkE,EAAU7B,EAAMn1B,IAAIG,GACxB,GAAI62B,EACF,OAAOA,EAET7B,EAAMj1B,IAAIC,EAAOkH,GAEbkV,GAAMpc,GACRA,EAAMvE,QAAQ,SAASq7B,GACrB5vB,EAAOtK,IAAIi4B,GAAUiC,EAAUhC,EAASC,EAAY+B,EAAU92B,EAAOg1B,MAE9DhZ,GAAMhc,IACfA,EAAMvE,QAAQ,SAASq7B,EAAU1yB,GAC/B8C,EAAOnH,IAAIqE,EAAKywB,GAAUiC,EAAUhC,EAASC,EAAY3wB,EAAKpE,EAAOg1B,MAIzE,IAII51B,EAAQ0zB,EAAQ58B,GAJLi/B,EACVD,EAAS6B,GAAeC,GACxB9B,EAASU,GAASp6B,IAEkBwE,GASzC,OARA4c,GAAUxd,GAASY,EAAO,SAAS82B,EAAU1yB,GACvChF,IAEF03B,EAAW92B,EADXoE,EAAM0yB,IAIR/C,GAAY7sB,EAAQ9C,EAAKywB,GAAUiC,EAAUhC,EAASC,EAAY3wB,EAAKpE,EAAOg1B,MAEzE9tB,EAyBT,SAAS+vB,GAAetY,EAAQhO,EAAQvR,GACtC,IAAIyC,EAASzC,EAAMyC,OACnB,GAAc,MAAV8c,EACF,OAAQ9c,EAGV,IADA8c,EAASrkB,GAAOqkB,GACT9c,KAAU,CACf,IAAIuC,EAAMhF,EAAMyC,GACZkb,EAAYpM,EAAOvM,GACnBpE,EAAQ2e,EAAOva,GAEnB,GAAKpE,IAAU9J,KAAekO,KAAOua,KAAa5B,EAAU/c,GAC1D,OAAO,EAGX,OAAO,EAaT,SAASk3B,GAAU9tB,EAAMC,EAAMa,GAC7B,GAAmB,mBAARd,EACT,MAAM,IAAIW,GAAUf,GAEtB,OAAO5N,GAAW,WAAagO,EAAKvM,MAAM3G,EAAWgU,IAAUb,GAcjE,SAAS8tB,GAAe3a,EAAOiB,EAAQf,EAAUW,GAC/C,IAAI9W,GAAS,EACT6wB,EAAWla,GACXma,GAAW,EACXx1B,EAAS2a,EAAM3a,OACfqF,KACAowB,EAAe7Z,EAAO5b,OAE1B,IAAKA,EACH,OAAOqF,EAELwV,IACFe,EAASH,GAASG,EAAQyB,GAAUxC,KAElCW,GACF+Z,EAAWha,GACXia,GAAW,GAEJ5Z,EAAO5b,QAAU2Q,IACxB4kB,EAAWhY,GACXiY,GAAW,EACX5Z,EAAS,IAAIgV,GAAShV,IAExB8Z,EACA,OAAShxB,EAAQ1E,GAAQ,CACvB,IAAI7B,EAAQwc,EAAMjW,GACdixB,EAAuB,MAAZ9a,EAAmB1c,EAAQ0c,EAAS1c,GAGnD,GADAA,EAASqd,GAAwB,IAAVrd,EAAeA,EAAQ,EAC1Cq3B,GAAYG,GAAaA,EAAU,CAErC,IADA,IAAIC,EAAcH,EACXG,KACL,GAAIha,EAAOga,KAAiBD,EAC1B,SAASD,EAGbrwB,EAAOpC,KAAK9E,QAEJo3B,EAAS3Z,EAAQ+Z,EAAUna,IACnCnW,EAAOpC,KAAK9E,GAGhB,OAAOkH,EAjkCT+pB,GAAOyG,kBAQLC,OAAU3gB,GAQV4gB,SAAY3gB,GAQZ4gB,YAAe3gB,GAQf4gB,SAAY,GAQZC,SAQEv3B,EAAKywB,KAKTA,GAAOl2B,UAAYw2B,GAAWx2B,UAC9Bk2B,GAAOl2B,UAAUC,YAAci2B,GAE/BG,GAAcr2B,UAAYu2B,GAAWC,GAAWx2B,WAChDq2B,GAAcr2B,UAAUC,YAAco2B,GAsHtCD,GAAYp2B,UAAYu2B,GAAWC,GAAWx2B,WAC9Co2B,GAAYp2B,UAAUC,YAAcm2B,GAoGpCgB,GAAKp3B,UAAUs3B,MAvEf,WACE77B,KAAKk8B,SAAWtC,GAAeA,GAAa,SAC5C55B,KAAKkV,KAAO,GAsEdymB,GAAKp3B,UAAL,OAzDA,SAAoBqJ,GAClB,IAAI8C,EAAS1Q,KAAK8oB,IAAIlb,WAAe5N,KAAKk8B,SAAStuB,GAEnD,OADA5N,KAAKkV,MAAQxE,EAAS,EAAI,EACnBA,GAuDTirB,GAAKp3B,UAAU8E,IA3Cf,SAAiBuE,GACf,IAAImK,EAAO/X,KAAKk8B,SAChB,GAAItC,GAAc,CAChB,IAAIlpB,EAASqH,EAAKnK,GAClB,OAAO8C,IAAWyL,EAAiBzc,EAAYgR,EAEjD,OAAOoB,GAAehS,KAAKiY,EAAMnK,GAAOmK,EAAKnK,GAAOlO,GAsCtDi8B,GAAKp3B,UAAUukB,IA1Bf,SAAiBlb,GACf,IAAImK,EAAO/X,KAAKk8B,SAChB,OAAOtC,GAAgB7hB,EAAKnK,KAASlO,EAAaoS,GAAehS,KAAKiY,EAAMnK,IAyB9E+tB,GAAKp3B,UAAUgF,IAZf,SAAiBqE,EAAKpE,GACpB,IAAIuO,EAAO/X,KAAKk8B,SAGhB,OAFAl8B,KAAKkV,MAAQlV,KAAK8oB,IAAIlb,GAAO,EAAI,EACjCmK,EAAKnK,GAAQgsB,IAAgBpwB,IAAU9J,EAAayc,EAAiB3S,EAC9DxJ,MAyHT+7B,GAAUx3B,UAAUs3B,MApFpB,WACE77B,KAAKk8B,YACLl8B,KAAKkV,KAAO,GAmFd6mB,GAAUx3B,UAAV,OAvEA,SAAyBqJ,GACvB,IAAImK,EAAO/X,KAAKk8B,SACZnsB,EAAQ0tB,GAAa1lB,EAAMnK,GAE/B,QAAImC,EAAQ,IAIRA,GADYgI,EAAK1M,OAAS,EAE5B0M,EAAKypB,MAELhpB,GAAO1Y,KAAKiY,EAAMhI,EAAO,KAEzB/P,KAAKkV,KACA,KA0DT6mB,GAAUx3B,UAAU8E,IA9CpB,SAAsBuE,GACpB,IAAImK,EAAO/X,KAAKk8B,SACZnsB,EAAQ0tB,GAAa1lB,EAAMnK,GAE/B,OAAOmC,EAAQ,EAAIrQ,EAAYqY,EAAKhI,GAAO,IA2C7CgsB,GAAUx3B,UAAUukB,IA/BpB,SAAsBlb,GACpB,OAAO6vB,GAAaz9B,KAAKk8B,SAAUtuB,IAAQ,GA+B7CmuB,GAAUx3B,UAAUgF,IAlBpB,SAAsBqE,EAAKpE,GACzB,IAAIuO,EAAO/X,KAAKk8B,SACZnsB,EAAQ0tB,GAAa1lB,EAAMnK,GAQ/B,OANImC,EAAQ,KACR/P,KAAKkV,KACP6C,EAAKzJ,MAAMV,EAAKpE,KAEhBuO,EAAKhI,GAAO,GAAKvG,EAEZxJ,MA2GTg8B,GAASz3B,UAAUs3B,MAtEnB,WACE77B,KAAKkV,KAAO,EACZlV,KAAKk8B,UACHuF,KAAQ,IAAI9F,GACZ/kB,IAAO,IAAKJ,IAAOulB,IACnBtqB,OAAU,IAAIkqB,KAkElBK,GAASz3B,UAAT,OArDA,SAAwBqJ,GACtB,IAAI8C,EAASgxB,GAAW1hC,KAAM4N,GAAjB,OAAgCA,GAE7C,OADA5N,KAAKkV,MAAQxE,EAAS,EAAI,EACnBA,GAmDTsrB,GAASz3B,UAAU8E,IAvCnB,SAAqBuE,GACnB,OAAO8zB,GAAW1hC,KAAM4N,GAAKvE,IAAIuE,IAuCnCouB,GAASz3B,UAAUukB,IA3BnB,SAAqBlb,GACnB,OAAO8zB,GAAW1hC,KAAM4N,GAAKkb,IAAIlb,IA2BnCouB,GAASz3B,UAAUgF,IAdnB,SAAqBqE,EAAKpE,GACxB,IAAIuO,EAAO2pB,GAAW1hC,KAAM4N,GACxBsH,EAAO6C,EAAK7C,KAIhB,OAFA6C,EAAKxO,IAAIqE,EAAKpE,GACdxJ,KAAKkV,MAAQ6C,EAAK7C,MAAQA,EAAO,EAAI,EAC9BlV,MA2DTi8B,GAAS13B,UAAU6B,IAAM61B,GAAS13B,UAAU+J,KAnB5C,SAAqB9E,GAEnB,OADAxJ,KAAKk8B,SAAS3yB,IAAIC,EAAO2S,GAClBnc,MAkBTi8B,GAAS13B,UAAUukB,IANnB,SAAqBtf,GACnB,OAAOxJ,KAAKk8B,SAASpT,IAAItf,IAuG3B2yB,GAAM53B,UAAUs3B,MA3EhB,WACE77B,KAAKk8B,SAAW,IAAIH,GACpB/7B,KAAKkV,KAAO,GA0EdinB,GAAM53B,UAAN,OA9DA,SAAqBqJ,GACnB,IAAImK,EAAO/X,KAAKk8B,SACZxrB,EAASqH,EAAI,OAAWnK,GAG5B,OADA5N,KAAKkV,KAAO6C,EAAK7C,KACVxE,GA0DTyrB,GAAM53B,UAAU8E,IA9ChB,SAAkBuE,GAChB,OAAO5N,KAAKk8B,SAAS7yB,IAAIuE,IA8C3BuuB,GAAM53B,UAAUukB,IAlChB,SAAkBlb,GAChB,OAAO5N,KAAKk8B,SAASpT,IAAIlb,IAkC3BuuB,GAAM53B,UAAUgF,IArBhB,SAAkBqE,EAAKpE,GACrB,IAAIuO,EAAO/X,KAAKk8B,SAChB,GAAInkB,aAAgBgkB,GAAW,CAC7B,IAAI4F,EAAQ5pB,EAAKmkB,SACjB,IAAK1lB,IAAQmrB,EAAMt2B,OAAS2Q,EAAmB,EAG7C,OAFA2lB,EAAMrzB,MAAMV,EAAKpE,IACjBxJ,KAAKkV,OAAS6C,EAAK7C,KACZlV,KAET+X,EAAO/X,KAAKk8B,SAAW,IAAIF,GAAS2F,GAItC,OAFA5pB,EAAKxO,IAAIqE,EAAKpE,GACdxJ,KAAKkV,KAAO6C,EAAK7C,KACVlV,MAscT,IAAI29B,GAAWiE,GAAeC,IAU1BC,GAAgBF,GAAeG,IAAiB,GAWpD,SAASC,GAAUva,EAAYlB,GAC7B,IAAI7V,GAAS,EAKb,OAJAitB,GAASlW,EAAY,SAASje,EAAOuG,EAAO0X,GAE1C,OADA/W,IAAW6V,EAAU/c,EAAOuG,EAAO0X,KAG9B/W,EAaT,SAASuxB,GAAajc,EAAOE,EAAUW,GAIrC,IAHA,IAAI9W,GAAS,EACT1E,EAAS2a,EAAM3a,SAEV0E,EAAQ1E,GAAQ,CACvB,IAAI7B,EAAQwc,EAAMjW,GACduY,EAAUpC,EAAS1c,GAEvB,GAAe,MAAX8e,IAAoB0Y,IAAathC,EAC5B4oB,GAAYA,IAAY4Z,GAAS5Z,GAClCzB,EAAWyB,EAAS0Y,IAE1B,IAAIA,EAAW1Y,EACX5X,EAASlH,EAGjB,OAAOkH,EAuCT,SAASyxB,GAAW1a,EAAYlB,GAC9B,IAAI7V,KAMJ,OALAitB,GAASlW,EAAY,SAASje,EAAOuG,EAAO0X,GACtClB,EAAU/c,EAAOuG,EAAO0X,IAC1B/W,EAAOpC,KAAK9E,KAGTkH,EAcT,SAAS0xB,GAAYpc,EAAOqc,EAAO9b,EAAW+b,EAAU5xB,GACtD,IAAIX,GAAS,EACT1E,EAAS2a,EAAM3a,OAKnB,IAHAkb,IAAcA,EAAYgc,IAC1B7xB,IAAWA,QAEFX,EAAQ1E,GAAQ,CACvB,IAAI7B,EAAQwc,EAAMjW,GACdsyB,EAAQ,GAAK9b,EAAU/c,GACrB64B,EAAQ,EAEVD,GAAY54B,EAAO64B,EAAQ,EAAG9b,EAAW+b,EAAU5xB,GAEnDsW,GAAUtW,EAAQlH,GAEV84B,IACV5xB,EAAOA,EAAOrF,QAAU7B,GAG5B,OAAOkH,EAcT,IAAI8xB,GAAUC,KAYVC,GAAeD,IAAc,GAUjC,SAASZ,GAAW1Z,EAAQjC,GAC1B,OAAOiC,GAAUqa,GAAQra,EAAQjC,EAAUlhB,IAW7C,SAAS+8B,GAAgB5Z,EAAQjC,GAC/B,OAAOiC,GAAUua,GAAava,EAAQjC,EAAUlhB,IAYlD,SAAS29B,GAAcxa,EAAQvf,GAC7B,OAAO4d,GAAY5d,EAAO,SAASgF,GACjC,OAAOg1B,GAAWza,EAAOva,MAY7B,SAASi1B,GAAQ1a,EAAQ2a,GAMvB,IAHA,IAAI/yB,EAAQ,EACR1E,GAHJy3B,EAAOC,GAASD,EAAM3a,IAGJ9c,OAED,MAAV8c,GAAkBpY,EAAQ1E,GAC/B8c,EAASA,EAAO6a,GAAMF,EAAK/yB,OAE7B,OAAQA,GAASA,GAAS1E,EAAU8c,EAASzoB,EAc/C,SAASujC,GAAe9a,EAAQ+a,EAAUC,GACxC,IAAIzyB,EAASwyB,EAAS/a,GACtB,OAAOuS,GAAQvS,GAAUzX,EAASsW,GAAUtW,EAAQyyB,EAAYhb,IAUlE,SAAStM,GAAWrS,GAClB,OAAa,MAATA,EACKA,IAAU9J,EAAYsV,GAAeD,GAEtC9C,IAAkBA,MAAkBnO,GAAO0F,GA23FrD,SAAmBA,GACjB,IAAI2I,EAAQL,GAAehS,KAAK0J,EAAOyI,IACnCG,EAAM5I,EAAMyI,IAEhB,IACEzI,EAAMyI,IAAkBvS,EACxB,IAAI2S,GAAW,EACf,MAAO/G,IAET,IAAIoF,EAASqB,GAAqBjS,KAAK0J,GAQvC,OAPI6I,IACEF,EACF3I,EAAMyI,IAAkBG,SAEjB5I,EAAMyI,KAGVvB,EA34FHmE,CAAUrL,GA+5GhB,SAAwBA,GACtB,OAAOuI,GAAqBjS,KAAK0J,GA/5G7BsL,CAAetL,GAYrB,SAAS45B,GAAO55B,EAAO65B,GACrB,OAAO75B,EAAQ65B,EAWjB,SAASC,GAAQnb,EAAQva,GACvB,OAAiB,MAAVua,GAAkBrW,GAAehS,KAAKqoB,EAAQva,GAWvD,SAAS21B,GAAUpb,EAAQva,GACzB,OAAiB,MAAVua,GAAkBva,KAAO9J,GAAOqkB,GA0BzC,SAASqb,GAAiBC,EAAQvd,EAAUW,GAS1C,IARA,IAAI+Z,EAAW/Z,EAAaD,GAAoBF,GAC5Crb,EAASo4B,EAAO,GAAGp4B,OACnBq4B,EAAYD,EAAOp4B,OACnBs4B,EAAWD,EACXE,EAAS7c,EAAM2c,GACfG,EAAYC,IACZpzB,KAEGizB,KAAY,CACjB,IAAI3d,EAAQyd,EAAOE,GACfA,GAAYzd,IACdF,EAAQc,GAASd,EAAO0C,GAAUxC,KAEpC2d,EAAYnxB,GAAUsT,EAAM3a,OAAQw4B,GACpCD,EAAOD,IAAa9c,IAAeX,GAAa7a,GAAU,KAAO2a,EAAM3a,QAAU,KAC7E,IAAI4wB,GAAS0H,GAAY3d,GACzBtmB,EAENsmB,EAAQyd,EAAO,GAEf,IAAI1zB,GAAS,EACTg0B,EAAOH,EAAO,GAElB7C,EACA,OAAShxB,EAAQ1E,GAAUqF,EAAOrF,OAASw4B,GAAW,CACpD,IAAIr6B,EAAQwc,EAAMjW,GACdixB,EAAW9a,EAAWA,EAAS1c,GAASA,EAG5C,GADAA,EAASqd,GAAwB,IAAVrd,EAAeA,EAAQ,IACxCu6B,EACEnb,GAASmb,EAAM/C,GACfJ,EAASlwB,EAAQswB,EAAUna,IAC5B,CAEL,IADA8c,EAAWD,IACFC,GAAU,CACjB,IAAI9a,EAAQ+a,EAAOD,GACnB,KAAM9a,EACED,GAASC,EAAOmY,GAChBJ,EAAS6C,EAAOE,GAAW3C,EAAUna,IAE3C,SAASka,EAGTgD,GACFA,EAAKz1B,KAAK0yB,GAEZtwB,EAAOpC,KAAK9E,IAGhB,OAAOkH,EA+BT,SAASszB,GAAW7b,EAAQ2a,EAAMpvB,GAGhC,IAAId,EAAiB,OADrBuV,EAAS8b,GAAO9b,EADhB2a,EAAOC,GAASD,EAAM3a,KAEMA,EAASA,EAAO6a,GAAMkB,GAAKpB,KACvD,OAAe,MAARlwB,EAAelT,EAAY2G,GAAMuM,EAAMuV,EAAQzU,GAUxD,SAASywB,GAAgB36B,GACvB,OAAOsS,GAAatS,IAAUqS,GAAWrS,IAAU2U,EAuCrD,SAASimB,GAAY56B,EAAO65B,EAAO/E,EAASC,EAAYC,GACtD,OAAIh1B,IAAU65B,IAGD,MAAT75B,GAA0B,MAAT65B,IAAmBvnB,GAAatS,KAAWsS,GAAaunB,GACpE75B,GAAUA,GAAS65B,GAAUA,EAmBxC,SAAyBlb,EAAQkb,EAAO/E,EAASC,EAAY8F,EAAW7F,GACtE,IAAI8F,EAAW5J,GAAQvS,GACnBoc,EAAW7J,GAAQ2I,GACnBmB,EAASF,EAAWlmB,EAAW0gB,GAAO3W,GACtCsc,EAASF,EAAWnmB,EAAW0gB,GAAOuE,GAKtCqB,GAHJF,EAASA,GAAUrmB,EAAUW,GAAY0lB,IAGhB1lB,GACrB6lB,GAHJF,EAASA,GAAUtmB,EAAUW,GAAY2lB,IAGhB3lB,GACrB8lB,EAAYJ,GAAUC,EAE1B,GAAIG,GAAa7L,GAAS5Q,GAAS,CACjC,IAAK4Q,GAASsK,GACZ,OAAO,EAETiB,GAAW,EACXI,GAAW,EAEb,GAAIE,IAAcF,EAEhB,OADAlG,IAAUA,EAAQ,IAAIrC,IACdmI,GAAYxe,GAAaqC,GAC7B0c,GAAY1c,EAAQkb,EAAO/E,EAASC,EAAY8F,EAAW7F,GA81EnE,SAAoBrW,EAAQkb,EAAOjxB,EAAKksB,EAASC,EAAY8F,EAAW7F,GACtE,OAAQpsB,GACN,KAAKkN,GACH,GAAK6I,EAAO0X,YAAcwD,EAAMxD,YAC3B1X,EAAOyX,YAAcyD,EAAMzD,WAC9B,OAAO,EAETzX,EAASA,EAAOwX,OAChB0D,EAAQA,EAAM1D,OAEhB,KAAKtgB,GACH,QAAK8I,EAAO0X,YAAcwD,EAAMxD,aAC3BwE,EAAU,IAAI3M,GAAWvP,GAAS,IAAIuP,GAAW2L,KAKxD,KAAK/kB,EACL,KAAKC,EACL,KAAKM,EAGH,OAAOwe,IAAIlV,GAASkb,GAEtB,KAAK5kB,EACH,OAAO0J,EAAOxc,MAAQ03B,EAAM13B,MAAQwc,EAAO2c,SAAWzB,EAAMyB,QAE9D,KAAK9lB,GACL,KAAKE,GAIH,OAAOiJ,GAAWkb,EAAQ,GAE5B,KAAKzkB,EACH,IAAImmB,EAAUrP,GAEhB,KAAKzW,GACH,IAAI+lB,EAAY1G,EAAU7hB,EAG1B,GAFAsoB,IAAYA,EAAUjP,IAElB3N,EAAOjT,MAAQmuB,EAAMnuB,OAAS8vB,EAChC,OAAO,EAGT,IAAI3E,EAAU7B,EAAMn1B,IAAI8e,GACxB,GAAIkY,EACF,OAAOA,GAAWgD,EAEpB/E,GAAW5hB,EAGX8hB,EAAMj1B,IAAI4e,EAAQkb,GAClB,IAAI3yB,EAASm0B,GAAYE,EAAQ5c,GAAS4c,EAAQ1B,GAAQ/E,EAASC,EAAY8F,EAAW7F,GAE1F,OADAA,EAAK,OAAWrW,GACTzX,EAET,KAAKqL,GACH,GAAIue,GACF,OAAOA,GAAcx6B,KAAKqoB,IAAWmS,GAAcx6B,KAAKujC,GAG9D,OAAO,EA35ED4B,CAAW9c,EAAQkb,EAAOmB,EAAQlG,EAASC,EAAY8F,EAAW7F,GAExE,KAAMF,EAAU7hB,GAAuB,CACrC,IAAIyoB,EAAeR,GAAY5yB,GAAehS,KAAKqoB,EAAQ,eACvDgd,EAAeR,GAAY7yB,GAAehS,KAAKujC,EAAO,eAE1D,GAAI6B,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAe/c,EAAO3e,QAAU2e,EAC/Ckd,EAAeF,EAAe9B,EAAM75B,QAAU65B,EAGlD,OADA7E,IAAUA,EAAQ,IAAIrC,IACfkI,EAAUe,EAAcC,EAAc/G,EAASC,EAAYC,IAGtE,QAAKoG,IAGLpG,IAAUA,EAAQ,IAAIrC,IA05ExB,SAAsBhU,EAAQkb,EAAO/E,EAASC,EAAY8F,EAAW7F,GACnE,IAAIwG,EAAY1G,EAAU7hB,EACtB6oB,EAAW9E,GAAWrY,GACtBod,EAAYD,EAASj6B,OAErBq4B,EADWlD,GAAW6C,GACDh4B,OAEzB,GAAIk6B,GAAa7B,IAAcsB,EAC7B,OAAO,EAGT,IADA,IAAIj1B,EAAQw1B,EACLx1B,KAAS,CACd,IAAInC,EAAM03B,EAASv1B,GACnB,KAAMi1B,EAAYp3B,KAAOy1B,EAAQvxB,GAAehS,KAAKujC,EAAOz1B,IAC1D,OAAO,EAIX,IAAI43B,EAAahH,EAAMn1B,IAAI8e,GACvBsd,EAAajH,EAAMn1B,IAAIg6B,GAC3B,GAAImC,GAAcC,EAChB,OAAOD,GAAcnC,GAASoC,GAActd,EAE9C,IAAIzX,GAAS,EACb8tB,EAAMj1B,IAAI4e,EAAQkb,GAClB7E,EAAMj1B,IAAI85B,EAAOlb,GAGjB,IADA,IAAIud,EAAWV,IACNj1B,EAAQw1B,GAAW,CAC1B33B,EAAM03B,EAASv1B,GACf,IAAIytB,EAAWrV,EAAOva,GAClB+3B,EAAWtC,EAAMz1B,GAErB,GAAI2wB,EACF,IAAIqH,EAAWZ,EACXzG,EAAWoH,EAAUnI,EAAU5vB,EAAKy1B,EAAOlb,EAAQqW,GACnDD,EAAWf,EAAUmI,EAAU/3B,EAAKua,EAAQkb,EAAO7E,GAGzD,KAAMoH,IAAalmC,EACV89B,IAAamI,GAAYtB,EAAU7G,EAAUmI,EAAUrH,EAASC,EAAYC,GAC7EoH,GACD,CACLl1B,GAAS,EACT,MAEFg1B,IAAaA,EAAkB,eAAP93B,GAE1B,GAAI8C,IAAWg1B,EAAU,CACvB,IAAIG,EAAU1d,EAAO3jB,YACjBshC,EAAUzC,EAAM7+B,YAGhBqhC,GAAWC,GACV,gBAAiB3d,GAAU,gBAAiBkb,KACzB,mBAAXwC,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,KACvDp1B,GAAS,GAKb,OAFA8tB,EAAK,OAAWrW,GAChBqW,EAAK,OAAW6E,GACT3yB,EAv9EAq1B,CAAa5d,EAAQkb,EAAO/E,EAASC,EAAY8F,EAAW7F,IA3D5DwH,CAAgBx8B,EAAO65B,EAAO/E,EAASC,EAAY6F,GAAa5F,IAmFzE,SAASyH,GAAY9d,EAAQhO,EAAQ+rB,EAAW3H,GAC9C,IAAIxuB,EAAQm2B,EAAU76B,OAClBA,EAAS0E,EACTo2B,GAAgB5H,EAEpB,GAAc,MAAVpW,EACF,OAAQ9c,EAGV,IADA8c,EAASrkB,GAAOqkB,GACTpY,KAAS,CACd,IAAIgI,EAAOmuB,EAAUn2B,GACrB,GAAKo2B,GAAgBpuB,EAAK,GAClBA,EAAK,KAAOoQ,EAAOpQ,EAAK,MACtBA,EAAK,KAAMoQ,GAEnB,OAAO,EAGX,OAASpY,EAAQ1E,GAAQ,CAEvB,IAAIuC,GADJmK,EAAOmuB,EAAUn2B,IACF,GACXytB,EAAWrV,EAAOva,GAClBw4B,EAAWruB,EAAK,GAEpB,GAAIouB,GAAgBpuB,EAAK,IACvB,GAAIylB,IAAa99B,KAAekO,KAAOua,GACrC,OAAO,MAEJ,CACL,IAAIqW,EAAQ,IAAIrC,GAChB,GAAIoC,EACF,IAAI7tB,EAAS6tB,EAAWf,EAAU4I,EAAUx4B,EAAKua,EAAQhO,EAAQqkB,GAEnE,KAAM9tB,IAAWhR,EACT0kC,GAAYgC,EAAU5I,EAAU/gB,EAAuBC,EAAwB6hB,EAAYC,GAC3F9tB,GAEN,OAAO,GAIb,OAAO,EAWT,SAAS21B,GAAa78B,GACpB,SAAK8I,GAAS9I,IA05FhB,SAAkBoJ,GAChB,QAASwkB,IAAeA,MAAcxkB,EA35Fd0zB,CAAS98B,MAGnBo5B,GAAWp5B,GAASguB,GAAa9V,IAChC9W,KAAKovB,GAASxwB,IA4C/B,SAAS+8B,GAAa/8B,GAGpB,MAAoB,mBAATA,EACFA,EAEI,MAATA,EACKg9B,GAEW,UAAhBjnC,EAAOiK,GACFkxB,GAAQlxB,GACXi9B,GAAoBj9B,EAAM,GAAIA,EAAM,IACpCk9B,GAAYl9B,GAEXm9B,GAASn9B,GAUlB,SAASo9B,GAASze,GAChB,IAAK0e,GAAY1e,GACf,OAAOgR,GAAWhR,GAEpB,IAAIzX,KACJ,IAAK,IAAI9C,KAAO9J,GAAOqkB,GACjBrW,GAAehS,KAAKqoB,EAAQva,IAAe,eAAPA,GACtC8C,EAAOpC,KAAKV,GAGhB,OAAO8C,EAUT,SAASo2B,GAAW3e,GAClB,IAAK7V,GAAS6V,GACZ,OA09FJ,SAAsBA,GACpB,IAAIzX,KACJ,GAAc,MAAVyX,EACF,IAAK,IAAIva,KAAO9J,GAAOqkB,GACrBzX,EAAOpC,KAAKV,GAGhB,OAAO8C,EAj+FEq2B,CAAa5e,GAEtB,IAAI6e,EAAUH,GAAY1e,GACtBzX,KAEJ,IAAK,IAAI9C,KAAOua,GACD,eAAPva,IAAyBo5B,GAAYl1B,GAAehS,KAAKqoB,EAAQva,KACrE8C,EAAOpC,KAAKV,GAGhB,OAAO8C,EAYT,SAASu2B,GAAOz9B,EAAO65B,GACrB,OAAO75B,EAAQ65B,EAWjB,SAAS6D,GAAQzf,EAAYvB,GAC3B,IAAInW,GAAS,EACTW,EAASy2B,GAAY1f,GAAcV,EAAMU,EAAWpc,WAKxD,OAHAsyB,GAASlW,EAAY,SAASje,EAAOoE,EAAK6Z,GACxC/W,IAASX,GAASmW,EAAS1c,EAAOoE,EAAK6Z,KAElC/W,EAUT,SAASg2B,GAAYvsB,GACnB,IAAI+rB,EAAYkB,GAAajtB,GAC7B,OAAwB,GAApB+rB,EAAU76B,QAAe66B,EAAU,GAAG,GACjCmB,GAAwBnB,EAAU,GAAG,GAAIA,EAAU,GAAG,IAExD,SAAS/d,GACd,OAAOA,IAAWhO,GAAU8rB,GAAY9d,EAAQhO,EAAQ+rB,IAY5D,SAASO,GAAoB3D,EAAMsD,GACjC,OAAIkB,GAAMxE,IAASyE,GAAmBnB,GAC7BiB,GAAwBrE,GAAMF,GAAOsD,GAEvC,SAASje,GACd,IAAIqV,EAAWn0B,GAAI8e,EAAQ2a,GAC3B,OAAQtF,IAAa99B,GAAa89B,IAAa4I,EAC3CoB,GAAMrf,EAAQ2a,GACdsB,GAAYgC,EAAU5I,EAAU/gB,EAAuBC,IAe/D,SAAS+qB,GAAUtf,EAAQhO,EAAQutB,EAAUnJ,EAAYC,GACnDrW,IAAWhO,GAGfqoB,GAAQroB,EAAQ,SAASisB,EAAUx4B,GAEjC,GADA4wB,IAAUA,EAAQ,IAAIrC,IAClB7pB,GAAS8zB,IA+BjB,SAAuBje,EAAQhO,EAAQvM,EAAK85B,EAAUC,EAAWpJ,EAAYC,GAC3E,IAAIhB,EAAWoK,GAAQzf,EAAQva,GAC3Bw4B,EAAWwB,GAAQztB,EAAQvM,GAC3ByyB,EAAU7B,EAAMn1B,IAAI+8B,GAExB,GAAI/F,EACFjD,GAAiBjV,EAAQva,EAAKyyB,OADhC,CAIA,IAAIwH,EAAWtJ,EACXA,EAAWf,EAAU4I,EAAWx4B,EAAM,GAAKua,EAAQhO,EAAQqkB,GAC3D9+B,EAEAmhC,EAAWgH,IAAanoC,EAE5B,GAAImhC,EAAU,CACZ,IAAIvE,EAAQ5B,GAAQ0L,GAChB3J,GAAUH,GAASvD,GAASqN,GAC5B0B,GAAWxL,IAAUG,GAAU3W,GAAasgB,GAEhDyB,EAAWzB,EACP9J,GAASG,GAAUqL,EACjBpN,GAAQ8C,GACVqK,EAAWrK,EAEJuK,GAAkBvK,GACzBqK,EAAW5K,GAAUO,GAEdf,GACPoE,GAAW,EACXgH,EAAW7I,GAAYoH,GAAU,IAE1B0B,GACPjH,GAAW,EACXgH,EAAW9H,GAAgBqG,GAAU,IAGrCyB,KAGKG,GAAc5B,IAAa5J,GAAY4J,IAC9CyB,EAAWrK,EACPhB,GAAYgB,GACdqK,EAAWI,GAAczK,GAEjBlrB,GAASkrB,KAAaoF,GAAWpF,KACzCqK,EAAW5I,GAAgBmH,KAI7BvF,GAAW,EAGXA,IAEFrC,EAAMj1B,IAAI68B,EAAUyB,GACpBF,EAAUE,EAAUzB,EAAUsB,EAAUnJ,EAAYC,GACpDA,EAAK,OAAW4H,IAElBhJ,GAAiBjV,EAAQva,EAAKi6B,IAzF1BK,CAAc/f,EAAQhO,EAAQvM,EAAK85B,EAAUD,GAAWlJ,EAAYC,OAEjE,CACH,IAAIqJ,EAAWtJ,EACXA,EAAWqJ,GAAQzf,EAAQva,GAAMw4B,EAAWx4B,EAAM,GAAKua,EAAQhO,EAAQqkB,GACvE9+B,EAEAmoC,IAAanoC,IACfmoC,EAAWzB,GAEbhJ,GAAiBjV,EAAQva,EAAKi6B,KAE/BzI,IAwFL,SAAS+I,GAAQniB,EAAOwC,GACtB,IAAInd,EAAS2a,EAAM3a,OACnB,GAAKA,EAIL,OAAOuxB,GADPpU,GAAKA,EAAI,EAAInd,EAAS,EACJA,GAAU2a,EAAMwC,GAAK9oB,EAYzC,SAAS0oC,GAAY3gB,EAAY4gB,EAAWC,GAc1C,IAAIv4B,GAAS,EAUb,OATAs4B,EAAYvhB,GAbVuhB,EADEA,EAAUh9B,OACAyb,GAASuhB,EAAW,SAASniB,GACvC,OAAIwU,GAAQxU,GACH,SAAS1c,GACd,OAAOq5B,GAAQr5B,EAA2B,IAApB0c,EAAS7a,OAAe6a,EAAS,GAAKA,IAGzDA,KAGIsgB,IAIiB9d,GAAU6f,OAnxF9C,SAAoBviB,EAAOwiB,GACzB,IAAIn9B,EAAS2a,EAAM3a,OAGnB,IADA2a,EAAMlN,KAAK0vB,GACJn9B,KACL2a,EAAM3a,GAAU2a,EAAM3a,GAAQ7B,MAEhC,OAAOwc,EAqxFEyiB,CAPMvB,GAAQzf,EAAY,SAASje,EAAOoE,EAAK6Z,GAIpD,OAASihB,SAHM5hB,GAASuhB,EAAW,SAASniB,GAC1C,OAAOA,EAAS1c,KAEauG,QAAWA,EAAOvG,MAASA,KAGlC,SAAS2e,EAAQkb,GACzC,OA04BJ,SAAyBlb,EAAQkb,EAAOiF,GAOtC,IANA,IAAIv4B,GAAS,EACT44B,EAAcxgB,EAAOugB,SACrBE,EAAcvF,EAAMqF,SACpBr9B,EAASs9B,EAAYt9B,OACrBw9B,EAAeP,EAAOj9B,SAEjB0E,EAAQ1E,GAAQ,CACvB,IAAIqF,EAASo4B,GAAiBH,EAAY54B,GAAQ64B,EAAY74B,IAC9D,GAAIW,EAAQ,CACV,GAAIX,GAAS84B,EACX,OAAOn4B,EAET,IAAIq4B,EAAQT,EAAOv4B,GACnB,OAAOW,GAAmB,QAATq4B,GAAmB,EAAI,IAU5C,OAAO5gB,EAAOpY,MAAQszB,EAAMtzB,MAl6BnBi5B,CAAgB7gB,EAAQkb,EAAOiF,KA4B1C,SAASW,GAAW9gB,EAAQ6V,EAAOzX,GAKjC,IAJA,IAAIxW,GAAS,EACT1E,EAAS2yB,EAAM3yB,OACfqF,OAEKX,EAAQ1E,GAAQ,CACvB,IAAIy3B,EAAO9E,EAAMjuB,GACbvG,EAAQq5B,GAAQ1a,EAAQ2a,GAExBvc,EAAU/c,EAAOs5B,IACnBoG,GAAQx4B,EAAQqyB,GAASD,EAAM3a,GAAS3e,GAG5C,OAAOkH,EA2BT,SAASy4B,GAAYnjB,EAAOiB,EAAQf,EAAUW,GAC5C,IAAI/W,EAAU+W,EAAamB,GAAkBrB,GACzC5W,GAAS,EACT1E,EAAS4b,EAAO5b,OAChB04B,EAAO/d,EAQX,IANIA,IAAUiB,IACZA,EAASgW,GAAUhW,IAEjBf,IACF6d,EAAOjd,GAASd,EAAO0C,GAAUxC,OAE1BnW,EAAQ1E,GAKf,IAJA,IAAIuc,EAAY,EACZpe,EAAQyd,EAAOlX,GACfixB,EAAW9a,EAAWA,EAAS1c,GAASA,GAEpCoe,EAAY9X,EAAQi0B,EAAM/C,EAAUpZ,EAAWf,KAAgB,GACjEkd,IAAS/d,GACXxN,GAAO1Y,KAAKikC,EAAMnc,EAAW,GAE/BpP,GAAO1Y,KAAKkmB,EAAO4B,EAAW,GAGlC,OAAO5B,EAYT,SAASojB,GAAWpjB,EAAO1Q,GAIzB,IAHA,IAAIjK,EAAS2a,EAAQ1Q,EAAQjK,OAAS,EAClC4qB,EAAY5qB,EAAS,EAElBA,KAAU,CACf,IAAI0E,EAAQuF,EAAQjK,GACpB,GAAIA,GAAU4qB,GAAalmB,IAAUs5B,EAAU,CAC7C,IAAIA,EAAWt5B,EACX6sB,GAAQ7sB,GACVyI,GAAO1Y,KAAKkmB,EAAOjW,EAAO,GAE1Bu5B,GAAUtjB,EAAOjW,IAIvB,OAAOiW,EAYT,SAAS8W,GAAWqB,EAAOC,GACzB,OAAOD,EAAQzF,GAAYY,MAAkB8E,EAAQD,EAAQ,IAkC/D,SAASoL,GAAW93B,EAAQ+W,GAC1B,IAAI9X,EAAS,GACb,IAAKe,GAAU+W,EAAI,GAAKA,EAAI5K,EAC1B,OAAOlN,EAIT,GACM8X,EAAI,IACN9X,GAAUe,IAEZ+W,EAAIkQ,GAAYlQ,EAAI,MAElB/W,GAAUA,SAEL+W,GAET,OAAO9X,EAWT,SAAS84B,GAAS52B,EAAM62B,GACtB,OAAOC,GAAYC,GAAS/2B,EAAM62B,EAAOjD,IAAW5zB,EAAO,IAU7D,SAASg3B,GAAWniB,GAClB,OAAOoV,GAAY5V,GAAOQ,IAW5B,SAASoiB,GAAepiB,EAAYe,GAClC,IAAIxC,EAAQiB,GAAOQ,GACnB,OAAOuV,GAAYhX,EAAOkX,GAAU1U,EAAG,EAAGxC,EAAM3a,SAalD,SAAS69B,GAAQ/gB,EAAQ2a,EAAMt5B,EAAO+0B,GACpC,IAAKjsB,GAAS6V,GACZ,OAAOA,EAST,IALA,IAAIpY,GAAS,EACT1E,GAHJy3B,EAAOC,GAASD,EAAM3a,IAGJ9c,OACd4qB,EAAY5qB,EAAS,EACrBy+B,EAAS3hB,EAEI,MAAV2hB,KAAoB/5B,EAAQ1E,GAAQ,CACzC,IAAIuC,EAAMo1B,GAAMF,EAAK/yB,IACjB83B,EAAWr+B,EAEf,GAAY,cAARoE,GAA+B,gBAARA,GAAiC,cAARA,EAClD,OAAOua,EAGT,GAAIpY,GAASkmB,EAAW,CACtB,IAAIuH,EAAWsM,EAAOl8B,IACtBi6B,EAAWtJ,EAAaA,EAAWf,EAAU5vB,EAAKk8B,GAAUpqC,KAC3CA,IACfmoC,EAAWv1B,GAASkrB,GAChBA,EACCZ,GAAQkG,EAAK/yB,EAAQ,WAG9BwtB,GAAYuM,EAAQl8B,EAAKi6B,GACzBiC,EAASA,EAAOl8B,GAElB,OAAOua,EAWT,IAAI4hB,GAAelQ,GAAqB,SAASjnB,EAAMmF,GAErD,OADA8hB,GAAQtwB,IAAIqJ,EAAMmF,GACXnF,GAFoB4zB,GAazBwD,GAAmBvgC,GAA4B,SAASmJ,EAAMnB,GAChE,OAAOhI,GAAemJ,EAAM,YAC1B8H,cAAgB,EAChBC,YAAc,EACdnR,MAASygC,GAASx4B,GAClBqsB,UAAY,KALwB0I,GAgBxC,SAAS0D,GAAYziB,GACnB,OAAOuV,GAAY/V,GAAOQ,IAY5B,SAAS0iB,GAAUnkB,EAAOyjB,EAAOW,GAC/B,IAAIr6B,GAAS,EACT1E,EAAS2a,EAAM3a,OAEfo+B,EAAQ,IACVA,GAASA,EAAQp+B,EAAS,EAAKA,EAASo+B,IAE1CW,EAAMA,EAAM/+B,EAASA,EAAS++B,GACpB,IACRA,GAAO/+B,GAETA,EAASo+B,EAAQW,EAAM,EAAMA,EAAMX,IAAW,EAC9CA,KAAW,EAGX,IADA,IAAI/4B,EAASqW,EAAM1b,KACV0E,EAAQ1E,GACfqF,EAAOX,GAASiW,EAAMjW,EAAQ05B,GAEhC,OAAO/4B,EAYT,SAAS25B,GAAS5iB,EAAYlB,GAC5B,IAAI7V,EAMJ,OAJAitB,GAASlW,EAAY,SAASje,EAAOuG,EAAO0X,GAE1C,QADA/W,EAAS6V,EAAU/c,EAAOuG,EAAO0X,QAG1B/W,EAeX,SAAS45B,GAAgBtkB,EAAOxc,EAAO+gC,GACrC,IAAIC,EAAM,EACNC,EAAgB,MAATzkB,EAAgBwkB,EAAMxkB,EAAM3a,OAEvC,GAAoB,iBAAT7B,GAAqBA,GAAUA,GAASihC,GAAQxsB,EAAuB,CAChF,KAAOusB,EAAMC,GAAM,CACjB,IAAIC,EAAOF,EAAMC,IAAU,EACvBzJ,EAAWhb,EAAM0kB,GAEJ,OAAb1J,IAAsBkB,GAASlB,KAC9BuJ,EAAcvJ,GAAYx3B,EAAUw3B,EAAWx3B,GAClDghC,EAAME,EAAM,EAEZD,EAAOC,EAGX,OAAOD,EAET,OAAOE,GAAkB3kB,EAAOxc,EAAOg9B,GAAU+D,GAgBnD,SAASI,GAAkB3kB,EAAOxc,EAAO0c,EAAUqkB,GACjD,IAAIC,EAAM,EACNC,EAAgB,MAATzkB,EAAgB,EAAIA,EAAM3a,OACrC,GAAa,IAATo/B,EACF,OAAO,EAST,IALA,IAAIG,GADJphC,EAAQ0c,EAAS1c,KACQA,EACrBqhC,EAAsB,OAAVrhC,EACZshC,EAAc5I,GAAS14B,GACvBuhC,EAAiBvhC,IAAU9J,EAExB8qC,EAAMC,GAAM,CACjB,IAAIC,EAAMhS,IAAa8R,EAAMC,GAAQ,GACjCzJ,EAAW9a,EAASF,EAAM0kB,IAC1BM,EAAehK,IAAathC,EAC5BurC,EAAyB,OAAbjK,EACZkK,EAAiBlK,GAAaA,EAC9BmK,EAAcjJ,GAASlB,GAE3B,GAAI4J,EACF,IAAIQ,EAASb,GAAcW,OAE3BE,EADSL,EACAG,IAAmBX,GAAcS,GACjCH,EACAK,GAAkBF,IAAiBT,IAAeU,GAClDH,EACAI,GAAkBF,IAAiBC,IAAcV,IAAeY,IAChEF,IAAaE,IAGbZ,EAAcvJ,GAAYx3B,EAAUw3B,EAAWx3B,GAEtD4hC,EACFZ,EAAME,EAAM,EAEZD,EAAOC,EAGX,OAAOh4B,GAAU+3B,EAAMzsB,GAYzB,SAASqtB,GAAerlB,EAAOE,GAM7B,IALA,IAAInW,GAAS,EACT1E,EAAS2a,EAAM3a,OACfob,EAAW,EACX/V,OAEKX,EAAQ1E,GAAQ,CACvB,IAAI7B,EAAQwc,EAAMjW,GACdixB,EAAW9a,EAAWA,EAAS1c,GAASA,EAE5C,IAAKuG,IAAUstB,GAAG2D,EAAU+C,GAAO,CACjC,IAAIA,EAAO/C,EACXtwB,EAAO+V,KAAwB,IAAVjd,EAAc,EAAIA,GAG3C,OAAOkH,EAWT,SAAS46B,GAAa9hC,GACpB,MAAoB,iBAATA,EACFA,EAEL04B,GAAS14B,GACJsU,GAEDtU,EAWV,SAAS+hC,GAAa/hC,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIkxB,GAAQlxB,GAEV,OAAOsd,GAAStd,EAAO+hC,IAAgB,GAEzC,GAAIrJ,GAAS14B,GACX,OAAOgxB,GAAiBA,GAAe16B,KAAK0J,GAAS,GAEvD,IAAIkH,EAAUlH,EAAQ,GACtB,MAAkB,KAAVkH,GAAkB,EAAIlH,IAAWmU,EAAY,KAAOjN,EAY9D,SAAS86B,GAASxlB,EAAOE,EAAUW,GACjC,IAAI9W,GAAS,EACT6wB,EAAWla,GACXrb,EAAS2a,EAAM3a,OACfw1B,GAAW,EACXnwB,KACAqzB,EAAOrzB,EAEX,GAAImW,EACFga,GAAW,EACXD,EAAWha,QAER,GAAIvb,GAAU2Q,EAAkB,CACnC,IAAIzS,EAAM2c,EAAW,KAAOulB,GAAUzlB,GACtC,GAAIzc,EACF,OAAOusB,GAAWvsB,GAEpBs3B,GAAW,EACXD,EAAWhY,GACXmb,EAAO,IAAI9H,QAGX8H,EAAO7d,KAAgBxV,EAEzBqwB,EACA,OAAShxB,EAAQ1E,GAAQ,CACvB,IAAI7B,EAAQwc,EAAMjW,GACdixB,EAAW9a,EAAWA,EAAS1c,GAASA,EAG5C,GADAA,EAASqd,GAAwB,IAAVrd,EAAeA,EAAQ,EAC1Cq3B,GAAYG,GAAaA,EAAU,CAErC,IADA,IAAI0K,EAAY3H,EAAK14B,OACdqgC,KACL,GAAI3H,EAAK2H,KAAe1K,EACtB,SAASD,EAGT7a,GACF6d,EAAKz1B,KAAK0yB,GAEZtwB,EAAOpC,KAAK9E,QAEJo3B,EAASmD,EAAM/C,EAAUna,KAC7Bkd,IAASrzB,GACXqzB,EAAKz1B,KAAK0yB,GAEZtwB,EAAOpC,KAAK9E,IAGhB,OAAOkH,EAWT,SAAS44B,GAAUnhB,EAAQ2a,GAGzB,OAAiB,OADjB3a,EAAS8b,GAAO9b,EADhB2a,EAAOC,GAASD,EAAM3a,aAEUA,EAAO6a,GAAMkB,GAAKpB,KAapD,SAAS6I,GAAWxjB,EAAQ2a,EAAM8I,EAASrN,GACzC,OAAO2K,GAAQ/gB,EAAQ2a,EAAM8I,EAAQ/I,GAAQ1a,EAAQ2a,IAAQvE,GAc/D,SAASsN,GAAU7lB,EAAOO,EAAWulB,EAAQjkB,GAI3C,IAHA,IAAIxc,EAAS2a,EAAM3a,OACf0E,EAAQ8X,EAAYxc,GAAU,GAE1Bwc,EAAY9X,MAAYA,EAAQ1E,IACtCkb,EAAUP,EAAMjW,GAAQA,EAAOiW,KAEjC,OAAO8lB,EACH3B,GAAUnkB,EAAQ6B,EAAY,EAAI9X,EAAS8X,EAAY9X,EAAQ,EAAI1E,GACnE8+B,GAAUnkB,EAAQ6B,EAAY9X,EAAQ,EAAI,EAAK8X,EAAYxc,EAAS0E,GAa1E,SAASg8B,GAAiBviC,EAAOwiC,GAC/B,IAAIt7B,EAASlH,EAIb,OAHIkH,aAAkBiqB,KACpBjqB,EAASA,EAAOlH,SAEX0d,GAAY8kB,EAAS,SAASt7B,EAAQu7B,GAC3C,OAAOA,EAAOr5B,KAAKvM,MAAM4lC,EAAOt4B,QAASqT,IAAWtW,GAASu7B,EAAOv4B,QACnEhD,GAaL,SAASw7B,GAAQzI,EAAQvd,EAAUW,GACjC,IAAIxb,EAASo4B,EAAOp4B,OACpB,GAAIA,EAAS,EACX,OAAOA,EAASmgC,GAAS/H,EAAO,OAKlC,IAHA,IAAI1zB,GAAS,EACTW,EAASqW,EAAM1b,KAEV0E,EAAQ1E,GAIf,IAHA,IAAI2a,EAAQyd,EAAO1zB,GACf4zB,GAAY,IAEPA,EAAWt4B,GACds4B,GAAY5zB,IACdW,EAAOX,GAAS4wB,GAAejwB,EAAOX,IAAUiW,EAAOyd,EAAOE,GAAWzd,EAAUW,IAIzF,OAAO2kB,GAASpJ,GAAY1xB,EAAQ,GAAIwV,EAAUW,GAYpD,SAASslB,GAAcvjC,EAAOqe,EAAQmlB,GAMpC,IALA,IAAIr8B,GAAS,EACT1E,EAASzC,EAAMyC,OACfghC,EAAaplB,EAAO5b,OACpBqF,OAEKX,EAAQ1E,GAAQ,CACvB,IAAI7B,EAAQuG,EAAQs8B,EAAaplB,EAAOlX,GAASrQ,EACjD0sC,EAAW17B,EAAQ9H,EAAMmH,GAAQvG,GAEnC,OAAOkH,EAUT,SAAS47B,GAAoB9iC,GAC3B,OAAOu+B,GAAkBv+B,GAASA,KAUpC,SAAS+iC,GAAa/iC,GACpB,MAAuB,mBAATA,EAAsBA,EAAQg9B,GAW9C,SAASzD,GAASv5B,EAAO2e,GACvB,OAAIuS,GAAQlxB,GACHA,EAEF89B,GAAM99B,EAAO2e,IAAW3e,GAASgjC,GAAax6B,GAASxI,IAYhE,IAAIijC,GAAWjD,GAWf,SAASkD,GAAU1mB,EAAOyjB,EAAOW,GAC/B,IAAI/+B,EAAS2a,EAAM3a,OAEnB,OADA++B,EAAMA,IAAQ1qC,EAAY2L,EAAS++B,GAC1BX,GAASW,GAAO/+B,EAAU2a,EAAQmkB,GAAUnkB,EAAOyjB,EAAOW,GASrE,IAAIr9B,GAAesrB,IAAmB,SAAShiB,GAC7C,OAAOlF,GAAKpE,aAAasJ,IAW3B,SAAS2oB,GAAYW,EAAQlB,GAC3B,GAAIA,EACF,OAAOkB,EAAO1vB,QAEhB,IAAI5E,EAASs0B,EAAOt0B,OAChBqF,EAASinB,GAAcA,GAAYtsB,GAAU,IAAIs0B,EAAOn7B,YAAY6G,GAGxE,OADAs0B,EAAOgN,KAAKj8B,GACLA,EAUT,SAAS+uB,GAAiBmN,GACxB,IAAIl8B,EAAS,IAAIk8B,EAAYpoC,YAAYooC,EAAY/M,YAErD,OADA,IAAInI,GAAWhnB,GAAQnH,IAAI,IAAImuB,GAAWkV,IACnCl8B,EAgDT,SAASqvB,GAAgB8M,EAAYpO,GACnC,IAAIkB,EAASlB,EAASgB,GAAiBoN,EAAWlN,QAAUkN,EAAWlN,OACvE,OAAO,IAAIkN,EAAWroC,YAAYm7B,EAAQkN,EAAWjN,WAAYiN,EAAWxhC,QAW9E,SAASy9B,GAAiBt/B,EAAO65B,GAC/B,GAAI75B,IAAU65B,EAAO,CACnB,IAAIyJ,EAAetjC,IAAU9J,EACzBmrC,EAAsB,OAAVrhC,EACZujC,EAAiBvjC,GAAUA,EAC3BshC,EAAc5I,GAAS14B,GAEvBwhC,EAAe3H,IAAU3jC,EACzBurC,EAAsB,OAAV5H,EACZ6H,EAAiB7H,GAAUA,EAC3B8H,EAAcjJ,GAASmB,GAE3B,IAAM4H,IAAcE,IAAgBL,GAAethC,EAAQ65B,GACtDyH,GAAeE,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5B4B,GAAgB5B,IACjB6B,EACH,OAAO,EAET,IAAMlC,IAAcC,IAAgBK,GAAe3hC,EAAQ65B,GACtD8H,GAAe2B,GAAgBC,IAAmBlC,IAAcC,GAChEG,GAAa6B,GAAgBC,IAC5B/B,GAAgB+B,IACjB7B,EACH,OAAQ,EAGZ,OAAO,EAuDT,SAAS8B,GAAYt5B,EAAMu5B,EAAUC,EAASC,GAU5C,IATA,IAAIC,GAAa,EACbC,EAAa35B,EAAKrI,OAClBiiC,EAAgBJ,EAAQ7hC,OACxBkiC,GAAa,EACbC,EAAaP,EAAS5hC,OACtBoiC,EAAch7B,GAAU46B,EAAaC,EAAe,GACpD58B,EAASqW,EAAMymB,EAAaC,GAC5BC,GAAeP,IAEVI,EAAYC,GACnB98B,EAAO68B,GAAaN,EAASM,GAE/B,OAASH,EAAYE,IACfI,GAAeN,EAAYC,KAC7B38B,EAAOw8B,EAAQE,IAAc15B,EAAK05B,IAGtC,KAAOK,KACL/8B,EAAO68B,KAAe75B,EAAK05B,KAE7B,OAAO18B,EAcT,SAASi9B,GAAiBj6B,EAAMu5B,EAAUC,EAASC,GAWjD,IAVA,IAAIC,GAAa,EACbC,EAAa35B,EAAKrI,OAClBuiC,GAAgB,EAChBN,EAAgBJ,EAAQ7hC,OACxBwiC,GAAc,EACdC,EAAcb,EAAS5hC,OACvBoiC,EAAch7B,GAAU46B,EAAaC,EAAe,GACpD58B,EAASqW,EAAM0mB,EAAcK,GAC7BJ,GAAeP,IAEVC,EAAYK,GACnB/8B,EAAO08B,GAAa15B,EAAK05B,GAG3B,IADA,IAAIlqC,EAASkqC,IACJS,EAAaC,GACpBp9B,EAAOxN,EAAS2qC,GAAcZ,EAASY,GAEzC,OAASD,EAAeN,IAClBI,GAAeN,EAAYC,KAC7B38B,EAAOxN,EAASgqC,EAAQU,IAAiBl6B,EAAK05B,MAGlD,OAAO18B,EAWT,SAASusB,GAAU9iB,EAAQ6L,GACzB,IAAIjW,GAAS,EACT1E,EAAS8O,EAAO9O,OAGpB,IADA2a,IAAUA,EAAQe,EAAM1b,MACf0E,EAAQ1E,GACf2a,EAAMjW,GAASoK,EAAOpK,GAExB,OAAOiW,EAaT,SAAS6X,GAAW1jB,EAAQvR,EAAOuf,EAAQoW,GACzC,IAAIwP,GAAS5lB,EACbA,IAAWA,MAKX,IAHA,IAAIpY,GAAS,EACT1E,EAASzC,EAAMyC,SAEV0E,EAAQ1E,GAAQ,CACvB,IAAIuC,EAAMhF,EAAMmH,GAEZ83B,EAAWtJ,EACXA,EAAWpW,EAAOva,GAAMuM,EAAOvM,GAAMA,EAAKua,EAAQhO,GAClDza,EAEAmoC,IAAanoC,IACfmoC,EAAW1tB,EAAOvM,IAEhBmgC,EACFzQ,GAAgBnV,EAAQva,EAAKi6B,GAE7BtK,GAAYpV,EAAQva,EAAKi6B,GAG7B,OAAO1f,EAmCT,SAAS6lB,GAAiB/nB,EAAQgoB,GAChC,OAAO,SAASxmB,EAAYvB,GAC1B,IAAItT,EAAO8nB,GAAQjT,GAAc1B,GAAkB2X,GAC/CvX,EAAc8nB,EAAcA,OAEhC,OAAOr7B,EAAK6U,EAAYxB,EAAQsiB,GAAYriB,EAAU,GAAIC,IAW9D,SAAS+nB,GAAeC,GACtB,OAAO3E,GAAS,SAASrhB,EAAQimB,GAC/B,IAAIr+B,GAAS,EACT1E,EAAS+iC,EAAQ/iC,OACjBkzB,EAAalzB,EAAS,EAAI+iC,EAAQ/iC,EAAS,GAAK3L,EAChD2uC,EAAQhjC,EAAS,EAAI+iC,EAAQ,GAAK1uC,EAWtC,IATA6+B,EAAc4P,EAAS9iC,OAAS,GAA0B,mBAAdkzB,GACvClzB,IAAUkzB,GACX7+B,EAEA2uC,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClD9P,EAAalzB,EAAS,EAAI3L,EAAY6+B,EACtClzB,EAAS,GAEX8c,EAASrkB,GAAOqkB,KACPpY,EAAQ1E,GAAQ,CACvB,IAAI8O,EAASi0B,EAAQr+B,GACjBoK,GACFg0B,EAAShmB,EAAQhO,EAAQpK,EAAOwuB,GAGpC,OAAOpW,IAYX,SAASyZ,GAAela,EAAUG,GAChC,OAAO,SAASJ,EAAYvB,GAC1B,GAAkB,MAAduB,EACF,OAAOA,EAET,IAAK0f,GAAY1f,GACf,OAAOC,EAASD,EAAYvB,GAM9B,IAJA,IAAI7a,EAASoc,EAAWpc,OACpB0E,EAAQ8X,EAAYxc,GAAU,EAC9BkjC,EAAWzqC,GAAO2jB,IAEdI,EAAY9X,MAAYA,EAAQ1E,KACa,IAA/C6a,EAASqoB,EAASx+B,GAAQA,EAAOw+B,KAIvC,OAAO9mB,GAWX,SAASgb,GAAc5a,GACrB,OAAO,SAASM,EAAQjC,EAAUgd,GAMhC,IALA,IAAInzB,GAAS,EACTw+B,EAAWzqC,GAAOqkB,GAClBvf,EAAQs6B,EAAS/a,GACjB9c,EAASzC,EAAMyC,OAEZA,KAAU,CACf,IAAIuC,EAAMhF,EAAMif,EAAYxc,IAAW0E,GACvC,IAA+C,IAA3CmW,EAASqoB,EAAS3gC,GAAMA,EAAK2gC,GAC/B,MAGJ,OAAOpmB,GAgCX,SAASqmB,GAAgBC,GACvB,OAAO,SAASh9B,GAGd,IAAIuX,EAAayM,GAFjBhkB,EAASO,GAASP,IAGd0kB,GAAc1kB,GACd/R,EAEA81B,EAAMxM,EACNA,EAAW,GACXvX,EAAOE,OAAO,GAEd2B,EAAW0V,EACX0jB,GAAU1jB,EAAY,GAAGnQ,KAAK,IAC9BpH,EAAOxB,MAAM,GAEjB,OAAOulB,EAAIiZ,KAAgBn7B,GAW/B,SAASo7B,GAAiB5sC,GACxB,OAAO,SAAS2P,GACd,OAAOyV,GAAYynB,GAAMC,GAAOn9B,GAAQjH,QAAQ8Y,GAAQ,KAAMxhB,EAAU,KAY5E,SAAS+sC,GAAWrP,GAClB,OAAO,WAIL,IAAI9rB,EAAOU,UACX,OAAQV,EAAKrI,QACX,KAAK,EAAG,OAAO,IAAIm0B,EACnB,KAAK,EAAG,OAAO,IAAIA,EAAK9rB,EAAK,IAC7B,KAAK,EAAG,OAAO,IAAI8rB,EAAK9rB,EAAK,GAAIA,EAAK,IACtC,KAAK,EAAG,OAAO,IAAI8rB,EAAK9rB,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC/C,KAAK,EAAG,OAAO,IAAI8rB,EAAK9rB,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACxD,KAAK,EAAG,OAAO,IAAI8rB,EAAK9rB,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACjE,KAAK,EAAG,OAAO,IAAI8rB,EAAK9rB,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC1E,KAAK,EAAG,OAAO,IAAI8rB,EAAK9rB,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAErF,IAAIo7B,EAAchU,GAAW0E,EAAKj7B,WAC9BmM,EAAS8uB,EAAKn5B,MAAMyoC,EAAap7B,GAIrC,OAAOpB,GAAS5B,GAAUA,EAASo+B,GAgDvC,SAASC,GAAWC,GAClB,OAAO,SAASvnB,EAAYlB,EAAWqB,GACrC,IAAI2mB,EAAWzqC,GAAO2jB,GACtB,IAAK0f,GAAY1f,GAAa,CAC5B,IAAIvB,EAAWqiB,GAAYhiB,EAAW,GACtCkB,EAAaziB,GAAKyiB,GAClBlB,EAAY,SAAS3Y,GAAO,OAAOsY,EAASqoB,EAAS3gC,GAAMA,EAAK2gC,IAElE,IAAIx+B,EAAQi/B,EAAcvnB,EAAYlB,EAAWqB,GACjD,OAAO7X,GAAS,EAAIw+B,EAASroB,EAAWuB,EAAW1X,GAASA,GAASrQ,GAWzE,SAASuvC,GAAWpnB,GAClB,OAAOqnB,GAAS,SAASC,GACvB,IAAI9jC,EAAS8jC,EAAM9jC,OACf0E,EAAQ1E,EACR+jC,EAASxU,GAAcr2B,UAAU8qC,KAKrC,IAHIxnB,GACFsnB,EAAMp0B,UAEDhL,KAAS,CACd,IAAI6C,EAAOu8B,EAAMp/B,GACjB,GAAmB,mBAAR6C,EACT,MAAM,IAAIW,GAAUf,GAEtB,GAAI48B,IAAW5hC,GAAgC,WAArB8hC,GAAY18B,GACpC,IAAIpF,EAAU,IAAIotB,OAAkB,GAIxC,IADA7qB,EAAQvC,EAAUuC,EAAQ1E,IACjB0E,EAAQ1E,GAAQ,CAGvB,IAAIkkC,EAAWD,GAFf18B,EAAOu8B,EAAMp/B,IAGTgI,EAAmB,WAAZw3B,EAAwBC,GAAQ58B,GAAQlT,EAMjD8N,EAJEuK,GAAQ03B,GAAW13B,EAAK,KACtBA,EAAK,KAAOmF,EAAgBJ,EAAkBE,EAAoBG,KACjEpF,EAAK,GAAG1M,QAAqB,GAAX0M,EAAK,GAElBvK,EAAQ8hC,GAAYv3B,EAAK,KAAK1R,MAAMmH,EAASuK,EAAK,IAElC,GAAfnF,EAAKvH,QAAeokC,GAAW78B,GACtCpF,EAAQ+hC,KACR/hC,EAAQ6hC,KAAKz8B,GAGrB,OAAO,WACL,IAAIc,EAAOU,UACP5K,EAAQkK,EAAK,GAEjB,GAAIlG,GAA0B,GAAfkG,EAAKrI,QAAeqvB,GAAQlxB,GACzC,OAAOgE,EAAQkiC,MAAMlmC,GAAOA,QAK9B,IAHA,IAAIuG,EAAQ,EACRW,EAASrF,EAAS8jC,EAAMp/B,GAAO1J,MAAMrG,KAAM0T,GAAQlK,IAE9CuG,EAAQ1E,GACfqF,EAASy+B,EAAMp/B,GAAOjQ,KAAKE,KAAM0Q,GAEnC,OAAOA,KAwBb,SAASi/B,GAAa/8B,EAAM0rB,EAAS3qB,EAASs5B,EAAUC,EAAS0C,EAAeC,EAAcC,EAAQx4B,EAAKy4B,GACzG,IAAIC,EAAQ1R,EAAUphB,EAClB+yB,EAAS3R,EAAU3hB,EACnBuzB,EAAY5R,EAAU1hB,EACtBuwB,EAAY7O,GAAWxhB,EAAkBC,GACzCozB,EAAS7R,EAAUlhB,EACnBoiB,EAAO0Q,EAAYxwC,EAAYmvC,GAAWj8B,GA6C9C,OA3CA,SAASpF,IAKP,IAJA,IAAInC,EAAS+I,UAAU/I,OACnBqI,EAAOqT,EAAM1b,GACb0E,EAAQ1E,EAEL0E,KACL2D,EAAK3D,GAASqE,UAAUrE,GAE1B,GAAIo9B,EACF,IAAIllC,EAAcmoC,GAAU5iC,GACxB6iC,EAvhIZ,SAAsBrqB,EAAO/d,GAI3B,IAHA,IAAIoD,EAAS2a,EAAM3a,OACfqF,EAAS,EAENrF,KACD2a,EAAM3a,KAAYpD,KAClByI,EAGN,OAAOA,EA8gIkB4/B,CAAa58B,EAAMzL,GASxC,GAPIglC,IACFv5B,EAAOs5B,GAAYt5B,EAAMu5B,EAAUC,EAASC,IAE1CyC,IACFl8B,EAAOi6B,GAAiBj6B,EAAMk8B,EAAeC,EAAc1C,IAE7D9hC,GAAUglC,EACNlD,GAAa9hC,EAAS0kC,EAAO,CAC/B,IAAIQ,EAAa1a,GAAeniB,EAAMzL,GACtC,OAAOuoC,GACL59B,EAAM0rB,EAASqR,GAAcniC,EAAQvF,YAAa0L,EAClDD,EAAM68B,EAAYT,EAAQx4B,EAAKy4B,EAAQ1kC,GAG3C,IAAIyjC,EAAcmB,EAASt8B,EAAU3T,KACjCka,EAAKg2B,EAAYpB,EAAYl8B,GAAQA,EAczC,OAZAvH,EAASqI,EAAKrI,OACVykC,EACFp8B,EAg4CN,SAAiBsS,EAAO1Q,GAKtB,IAJA,IAAIm7B,EAAYzqB,EAAM3a,OAClBA,EAASqH,GAAU4C,EAAQjK,OAAQolC,GACnCC,EAAWzT,GAAUjX,GAElB3a,KAAU,CACf,IAAI0E,EAAQuF,EAAQjK,GACpB2a,EAAM3a,GAAUuxB,GAAQ7sB,EAAO0gC,GAAaC,EAAS3gC,GAASrQ,EAEhE,OAAOsmB,EAz4CI2qB,CAAQj9B,EAAMo8B,GACZK,GAAU9kC,EAAS,GAC5BqI,EAAKqH,UAEHi1B,GAAS14B,EAAMjM,IACjBqI,EAAKrI,OAASiM,GAEZtX,MAAQA,OAASmR,IAAQnR,gBAAgBwN,IAC3C0M,EAAKslB,GAAQqP,GAAW30B,IAEnBA,EAAG7T,MAAMyoC,EAAap7B,IAajC,SAASk9B,GAAe3qB,EAAQ4qB,GAC9B,OAAO,SAAS1oB,EAAQjC,GACtB,OAh/DJ,SAAsBiC,EAAQlC,EAAQC,EAAUC,GAI9C,OAHA0b,GAAW1Z,EAAQ,SAAS3e,EAAOoE,EAAKua,GACtClC,EAAOE,EAAaD,EAAS1c,GAAQoE,EAAKua,KAErChC,EA4+DE2qB,CAAa3oB,EAAQlC,EAAQ4qB,EAAW3qB,QAYnD,SAAS6qB,GAAoBC,EAAUC,GACrC,OAAO,SAASznC,EAAO65B,GACrB,IAAI3yB,EACJ,GAAIlH,IAAU9J,GAAa2jC,IAAU3jC,EACnC,OAAOuxC,EAKT,GAHIznC,IAAU9J,IACZgR,EAASlH,GAEP65B,IAAU3jC,EAAW,CACvB,GAAIgR,IAAWhR,EACb,OAAO2jC,EAEW,iBAAT75B,GAAqC,iBAAT65B,GACrC75B,EAAQ+hC,GAAa/hC,GACrB65B,EAAQkI,GAAalI,KAErB75B,EAAQ8hC,GAAa9hC,GACrB65B,EAAQiI,GAAajI,IAEvB3yB,EAASsgC,EAASxnC,EAAO65B,GAE3B,OAAO3yB,GAWX,SAASwgC,GAAWC,GAClB,OAAOjC,GAAS,SAAS7G,GAEvB,OADAA,EAAYvhB,GAASuhB,EAAW3f,GAAU6f,OACnCiB,GAAS,SAAS91B,GACvB,IAAIC,EAAU3T,KACd,OAAOmxC,EAAU9I,EAAW,SAASniB,GACnC,OAAO7f,GAAM6f,EAAUvS,EAASD,SAexC,SAAS09B,GAAc/lC,EAAQgmC,GAG7B,IAAIC,GAFJD,EAAQA,IAAU3xC,EAAY,IAAM6rC,GAAa8F,IAEzBhmC,OACxB,GAAIimC,EAAc,EAChB,OAAOA,EAAc/H,GAAW8H,EAAOhmC,GAAUgmC,EAEnD,IAAI3gC,EAAS64B,GAAW8H,EAAO7Y,GAAWntB,EAAS2qB,GAAWqb,KAC9D,OAAO5b,GAAW4b,GACd3E,GAAUvW,GAAczlB,GAAS,EAAGrF,GAAQwN,KAAK,IACjDnI,EAAOT,MAAM,EAAG5E,GA6CtB,SAASkmC,GAAY1pB,GACnB,OAAO,SAAS4hB,EAAOW,EAAKoH,GAa1B,OAZIA,GAAuB,iBAARA,GAAoBlD,GAAe7E,EAAOW,EAAKoH,KAChEpH,EAAMoH,EAAO9xC,GAGf+pC,EAAQgI,GAAShI,GACbW,IAAQ1qC,GACV0qC,EAAMX,EACNA,EAAQ,GAERW,EAAMqH,GAASrH,GA57CrB,SAAmBX,EAAOW,EAAKoH,EAAM3pB,GAKnC,IAJA,IAAI9X,GAAS,EACT1E,EAASoH,GAAU+lB,IAAY4R,EAAMX,IAAU+H,GAAQ,IAAK,GAC5D9gC,EAASqW,EAAM1b,GAEZA,KACLqF,EAAOmX,EAAYxc,IAAW0E,GAAS05B,EACvCA,GAAS+H,EAEX,OAAO9gC,EAs7CEghC,CAAUjI,EAAOW,EADxBoH,EAAOA,IAAS9xC,EAAa+pC,EAAQW,EAAM,GAAK,EAAKqH,GAASD,GAC3B3pB,IAWvC,SAAS8pB,GAA0BX,GACjC,OAAO,SAASxnC,EAAO65B,GAKrB,MAJsB,iBAAT75B,GAAqC,iBAAT65B,IACvC75B,EAAQ+I,GAAS/I,GACjB65B,EAAQ9wB,GAAS8wB,IAEZ2N,EAASxnC,EAAO65B,IAqB3B,SAASmN,GAAc59B,EAAM0rB,EAASsT,EAAU3pC,EAAa0L,EAASs5B,EAAUC,EAAS4C,EAAQx4B,EAAKy4B,GACpG,IAAI8B,EAAUvT,EAAUxhB,EAMxBwhB,GAAYuT,EAAU70B,EAAoBC,GAC1CqhB,KAAauT,EAAU50B,EAA0BD,IAEjCH,IACdyhB,KAAa3hB,EAAiBC,IAEhC,IAAIk1B,GACFl/B,EAAM0rB,EAAS3qB,EAVCk+B,EAAU5E,EAAWvtC,EAFtBmyC,EAAU3E,EAAUxtC,EAGdmyC,EAAUnyC,EAAYutC,EAFvB4E,EAAUnyC,EAAYwtC,EAYzB4C,EAAQx4B,EAAKy4B,GAG5Br/B,EAASkhC,EAASvrC,MAAM3G,EAAWoyC,GAKvC,OAJIrC,GAAW78B,IACbm/B,GAAQrhC,EAAQohC,GAElBphC,EAAOzI,YAAcA,EACd+pC,GAAgBthC,EAAQkC,EAAM0rB,GAUvC,SAAS2T,GAAYxD,GACnB,IAAI77B,EAAO5R,GAAKytC,GAChB,OAAO,SAASvQ,EAAQgU,GAGtB,GAFAhU,EAAS3rB,GAAS2rB,IAClBgU,EAAyB,MAAbA,EAAoB,EAAIx/B,GAAUy/B,GAAUD,GAAY,OACnDlZ,GAAekF,GAAS,CAGvC,IAAIkU,GAAQpgC,GAASksB,GAAU,KAAK53B,MAAM,KAI1C,SADA8rC,GAAQpgC,GAFIY,EAAKw/B,EAAK,GAAK,MAAQA,EAAK,GAAKF,KAEnB,KAAK5rC,MAAM,MACvB,GAAK,MAAQ8rC,EAAK,GAAKF,IAEvC,OAAOt/B,EAAKsrB,IAWhB,IAAIuN,GAAc9R,IAAQ,EAAI7D,GAAW,IAAI6D,IAAI,EAAG,KAAK,IAAOhc,EAAmB,SAASsJ,GAC1F,OAAO,IAAI0S,GAAI1S,IAD2DorB,GAW5E,SAASC,GAAcpP,GACrB,OAAO,SAAS/a,GACd,IAAI/V,EAAM0sB,GAAO3W,GACjB,OAAI/V,GAAOwM,EACF8W,GAAWvN,GAEhB/V,GAAO6M,GACF8W,GAAW5N,GAn6I1B,SAAqBA,EAAQvf,GAC3B,OAAOke,GAASle,EAAO,SAASgF,GAC9B,OAAQA,EAAKua,EAAOva,MAm6IX2kC,CAAYpqB,EAAQ+a,EAAS/a,KA6BxC,SAASqqB,GAAW5/B,EAAM0rB,EAAS3qB,EAASs5B,EAAUC,EAAS4C,EAAQx4B,EAAKy4B,GAC1E,IAAIG,EAAY5R,EAAU1hB,EAC1B,IAAKszB,GAA4B,mBAARt9B,EACvB,MAAM,IAAIW,GAAUf,GAEtB,IAAInH,EAAS4hC,EAAWA,EAAS5hC,OAAS,EAS1C,GARKA,IACHizB,KAAathB,EAAoBC,GACjCgwB,EAAWC,EAAUxtC,GAEvB4X,EAAMA,IAAQ5X,EAAY4X,EAAM7E,GAAU0/B,GAAU76B,GAAM,GAC1Dy4B,EAAQA,IAAUrwC,EAAYqwC,EAAQoC,GAAUpC,GAChD1kC,GAAU6hC,EAAUA,EAAQ7hC,OAAS,EAEjCizB,EAAUrhB,EAAyB,CACrC,IAAI2yB,EAAgB3C,EAChB4C,EAAe3C,EAEnBD,EAAWC,EAAUxtC,EAEvB,IAAIqY,EAAOm4B,EAAYxwC,EAAY8vC,GAAQ58B,GAEvCk/B,GACFl/B,EAAM0rB,EAAS3qB,EAASs5B,EAAUC,EAAS0C,EAAeC,EAC1DC,EAAQx4B,EAAKy4B,GAkBf,GAfIh4B,GA26BN,SAAmBA,EAAMoC,GACvB,IAAImkB,EAAUvmB,EAAK,GACf06B,EAAat4B,EAAO,GACpBu4B,EAAapU,EAAUmU,EACvB5R,EAAW6R,GAAc/1B,EAAiBC,EAAqBM,GAE/Dy1B,EACAF,GAAcv1B,GAAmBohB,GAAWxhB,GAC5C21B,GAAcv1B,GAAmBohB,GAAWnhB,GAAqBpF,EAAK,GAAG1M,QAAU8O,EAAO,IAC1Fs4B,IAAev1B,EAAgBC,IAAsBhD,EAAO,GAAG9O,QAAU8O,EAAO,IAAQmkB,GAAWxhB,EAGvG,IAAM+jB,IAAY8R,EAChB,OAAO56B,EAGL06B,EAAa91B,IACf5E,EAAK,GAAKoC,EAAO,GAEjBu4B,GAAcpU,EAAU3hB,EAAiB,EAAIE,GAG/C,IAAIrT,EAAQ2Q,EAAO,GACnB,GAAI3Q,EAAO,CACT,IAAIyjC,EAAWl1B,EAAK,GACpBA,EAAK,GAAKk1B,EAAWD,GAAYC,EAAUzjC,EAAO2Q,EAAO,IAAM3Q,EAC/DuO,EAAK,GAAKk1B,EAAWpX,GAAe9d,EAAK,GAAIsE,GAAelC,EAAO,IAGrE3Q,EAAQ2Q,EAAO,MAEb8yB,EAAWl1B,EAAK,GAChBA,EAAK,GAAKk1B,EAAWU,GAAiBV,EAAUzjC,EAAO2Q,EAAO,IAAM3Q,EACpEuO,EAAK,GAAKk1B,EAAWpX,GAAe9d,EAAK,GAAIsE,GAAelC,EAAO,KAGrE3Q,EAAQ2Q,EAAO,MAEbpC,EAAK,GAAKvO,GAGRipC,EAAav1B,IACfnF,EAAK,GAAgB,MAAXA,EAAK,GAAaoC,EAAO,GAAKzH,GAAUqF,EAAK,GAAIoC,EAAO,KAGrD,MAAXpC,EAAK,KACPA,EAAK,GAAKoC,EAAO,IAGnBpC,EAAK,GAAKoC,EAAO,GACjBpC,EAAK,GAAK26B,EA59BRE,CAAUd,EAAS/5B,GAErBnF,EAAOk/B,EAAQ,GACfxT,EAAUwT,EAAQ,GAClBn+B,EAAUm+B,EAAQ,GAClB7E,EAAW6E,EAAQ,GACnB5E,EAAU4E,EAAQ,KAClB/B,EAAQ+B,EAAQ,GAAKA,EAAQ,KAAOpyC,EAC/BwwC,EAAY,EAAIt9B,EAAKvH,OACtBoH,GAAUq/B,EAAQ,GAAKzmC,EAAQ,KAErBizB,GAAWxhB,EAAkBC,KACzCuhB,KAAaxhB,EAAkBC,IAE5BuhB,GAAWA,GAAW3hB,EAGzBjM,EADS4tB,GAAWxhB,GAAmBwhB,GAAWvhB,EApgBtD,SAAqBnK,EAAM0rB,EAASyR,GAClC,IAAIvQ,EAAOqP,GAAWj8B,GAwBtB,OAtBA,SAASpF,IAMP,IALA,IAAInC,EAAS+I,UAAU/I,OACnBqI,EAAOqT,EAAM1b,GACb0E,EAAQ1E,EACRpD,EAAcmoC,GAAU5iC,GAErBuC,KACL2D,EAAK3D,GAASqE,UAAUrE,GAE1B,IAAIm9B,EAAW7hC,EAAS,GAAKqI,EAAK,KAAOzL,GAAeyL,EAAKrI,EAAS,KAAOpD,KAEzE4tB,GAAeniB,EAAMzL,GAGzB,OADAoD,GAAU6hC,EAAQ7hC,QACL0kC,EACJS,GACL59B,EAAM0rB,EAASqR,GAAcniC,EAAQvF,YAAavI,EAClDgU,EAAMw5B,EAASxtC,EAAWA,EAAWqwC,EAAQ1kC,GAG1ChF,GADGrG,MAAQA,OAASmR,IAAQnR,gBAAgBwN,EAAWgyB,EAAO5sB,EACpD5S,KAAM0T,IA8edm/B,CAAYjgC,EAAM0rB,EAASyR,GAC1BzR,GAAWthB,GAAqBshB,IAAY3hB,EAAiBK,IAAwBkwB,EAAQ7hC,OAG9FskC,GAAatpC,MAAM3G,EAAWoyC,GA9O3C,SAAuBl/B,EAAM0rB,EAAS3qB,EAASs5B,GAC7C,IAAIgD,EAAS3R,EAAU3hB,EACnB6iB,EAAOqP,GAAWj8B,GAkBtB,OAhBA,SAASpF,IAQP,IAPA,IAAI4/B,GAAa,EACbC,EAAaj5B,UAAU/I,OACvBkiC,GAAa,EACbC,EAAaP,EAAS5hC,OACtBqI,EAAOqT,EAAMymB,EAAaH,GAC1BnzB,EAAMla,MAAQA,OAASmR,IAAQnR,gBAAgBwN,EAAWgyB,EAAO5sB,IAE5D26B,EAAYC,GACnB95B,EAAK65B,GAAaN,EAASM,GAE7B,KAAOF,KACL35B,EAAK65B,KAAen5B,YAAYg5B,GAElC,OAAO/mC,GAAM6T,EAAI+1B,EAASt8B,EAAU3T,KAAM0T,IA0NjCo/B,CAAclgC,EAAM0rB,EAAS3qB,EAASs5B,QAJ/C,IAAIv8B,EAhmBR,SAAoBkC,EAAM0rB,EAAS3qB,GACjC,IAAIs8B,EAAS3R,EAAU3hB,EACnB6iB,EAAOqP,GAAWj8B,GAMtB,OAJA,SAASpF,IAEP,OADUxN,MAAQA,OAASmR,IAAQnR,gBAAgBwN,EAAWgyB,EAAO5sB,GAC3DvM,MAAM4pC,EAASt8B,EAAU3T,KAAMoU,YA0lB5B2+B,CAAWngC,EAAM0rB,EAAS3qB,GASzC,OAAOq+B,IADMj6B,EAAOgyB,GAAcgI,IACJrhC,EAAQohC,GAAUl/B,EAAM0rB,GAexD,SAAS0U,GAAuBxV,EAAU4I,EAAUx4B,EAAKua,GACvD,OAAIqV,IAAa99B,GACZ29B,GAAGG,EAAU3rB,GAAYjE,MAAUkE,GAAehS,KAAKqoB,EAAQva,GAC3Dw4B,EAEF5I,EAiBT,SAASyV,GAAoBzV,EAAU4I,EAAUx4B,EAAKua,EAAQhO,EAAQqkB,GAOpE,OANIlsB,GAASkrB,IAAalrB,GAAS8zB,KAEjC5H,EAAMj1B,IAAI68B,EAAU5I,GACpBiK,GAAUjK,EAAU4I,EAAU1mC,EAAWuzC,GAAqBzU,GAC9DA,EAAK,OAAW4H,IAEX5I,EAYT,SAAS0V,GAAgB1pC,GACvB,OAAOw+B,GAAcx+B,GAAS9J,EAAY8J,EAgB5C,SAASq7B,GAAY7e,EAAOqd,EAAO/E,EAASC,EAAY8F,EAAW7F,GACjE,IAAIwG,EAAY1G,EAAU7hB,EACtBg0B,EAAYzqB,EAAM3a,OAClBq4B,EAAYL,EAAMh4B,OAEtB,GAAIolC,GAAa/M,KAAesB,GAAatB,EAAY+M,GACvD,OAAO,EAGT,IAAI0C,EAAa3U,EAAMn1B,IAAI2c,GACvByf,EAAajH,EAAMn1B,IAAIg6B,GAC3B,GAAI8P,GAAc1N,EAChB,OAAO0N,GAAc9P,GAASoC,GAAczf,EAE9C,IAAIjW,GAAS,EACTW,GAAS,EACTqzB,EAAQzF,EAAU5hB,EAA0B,IAAIuf,GAAWv8B,EAM/D,IAJA8+B,EAAMj1B,IAAIyc,EAAOqd,GACjB7E,EAAMj1B,IAAI85B,EAAOrd,KAGRjW,EAAQ0gC,GAAW,CAC1B,IAAI2C,EAAWptB,EAAMjW,GACjB41B,EAAWtC,EAAMtzB,GAErB,GAAIwuB,EACF,IAAIqH,EAAWZ,EACXzG,EAAWoH,EAAUyN,EAAUrjC,EAAOszB,EAAOrd,EAAOwY,GACpDD,EAAW6U,EAAUzN,EAAU51B,EAAOiW,EAAOqd,EAAO7E,GAE1D,GAAIoH,IAAalmC,EAAW,CAC1B,GAAIkmC,EACF,SAEFl1B,GAAS,EACT,MAGF,GAAIqzB,GACF,IAAK1c,GAAUgc,EAAO,SAASsC,EAAUhC,GACnC,IAAK/a,GAASmb,EAAMJ,KACfyP,IAAazN,GAAYtB,EAAU+O,EAAUzN,EAAUrH,EAASC,EAAYC,IAC/E,OAAOuF,EAAKz1B,KAAKq1B,KAEjB,CACNjzB,GAAS,EACT,YAEG,GACD0iC,IAAazN,IACXtB,EAAU+O,EAAUzN,EAAUrH,EAASC,EAAYC,GACpD,CACL9tB,GAAS,EACT,OAKJ,OAFA8tB,EAAK,OAAWxY,GAChBwY,EAAK,OAAW6E,GACT3yB,EA0KT,SAASw+B,GAASt8B,GAChB,OAAO82B,GAAYC,GAAS/2B,EAAMlT,EAAW2zC,IAAUzgC,EAAO,IAUhE,SAAS4tB,GAAWrY,GAClB,OAAO8a,GAAe9a,EAAQnjB,GAAMs6B,IAWtC,SAASiB,GAAapY,GACpB,OAAO8a,GAAe9a,EAAQiX,GAAQF,IAUxC,IAAIsQ,GAAW3V,GAAiB,SAASjnB,GACvC,OAAOinB,GAAQxwB,IAAIuJ,IADIy/B,GAWzB,SAAS/C,GAAY18B,GAKnB,IAJA,IAAIlC,EAAUkC,EAAKjH,KAAO,GACtBqa,EAAQ8T,GAAUppB,GAClBrF,EAASyG,GAAehS,KAAKg6B,GAAWppB,GAAUsV,EAAM3a,OAAS,EAE9DA,KAAU,CACf,IAAI0M,EAAOiO,EAAM3a,GACbioC,EAAYv7B,EAAKnF,KACrB,GAAiB,MAAb0gC,GAAqBA,GAAa1gC,EACpC,OAAOmF,EAAKpM,KAGhB,OAAO+E,EAUT,SAAS0/B,GAAUx9B,GAEjB,OADad,GAAehS,KAAK26B,GAAQ,eAAiBA,GAAS7nB,GACrD3K,YAchB,SAASsgC,KACP,IAAI73B,EAAS+pB,GAAOvU,UAAYA,GAEhC,OADAxV,EAASA,IAAWwV,GAAWqgB,GAAe71B,EACvC0D,UAAU/I,OAASqF,EAAO0D,UAAU,GAAIA,UAAU,IAAM1D,EAWjE,SAASgxB,GAAW9qB,EAAKhJ,GACvB,IAAImK,EAAOnB,EAAIslB,SACf,OA+XF,SAAmB1yB,GACjB,IAAIoL,EAAIrV,EAAUiK,GAClB,MAAgB,UAARoL,GAA4B,UAARA,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAVpL,EACU,OAAVA,EAnYE+pC,CAAU3lC,GACbmK,EAAmB,iBAAPnK,EAAkB,SAAW,QACzCmK,EAAKnB,IAUX,SAASwwB,GAAajf,GAIpB,IAHA,IAAIzX,EAAS1L,GAAKmjB,GACd9c,EAASqF,EAAOrF,OAEbA,KAAU,CACf,IAAIuC,EAAM8C,EAAOrF,GACb7B,EAAQ2e,EAAOva,GAEnB8C,EAAOrF,IAAWuC,EAAKpE,EAAO+9B,GAAmB/9B,IAEnD,OAAOkH,EAWT,SAAS0nB,GAAUjQ,EAAQva,GACzB,IAAIpE,EAlxJR,SAAkB2e,EAAQva,GACxB,OAAiB,MAAVua,EAAiBzoB,EAAYyoB,EAAOva,GAixJ7B4lC,CAASrrB,EAAQva,GAC7B,OAAOy4B,GAAa78B,GAASA,EAAQ9J,EAqCvC,IAAI4/B,GAAc1G,GAA+B,SAASzQ,GACxD,OAAc,MAAVA,MAGJA,EAASrkB,GAAOqkB,GACT3B,GAAYoS,GAAiBzQ,GAAS,SAAS+X,GACpD,OAAOnI,GAAqBj4B,KAAKqoB,EAAQ+X,OANRuT,GAiBjCvU,GAAgBtG,GAA+B,SAASzQ,GAE1D,IADA,IAAIzX,KACGyX,GACLnB,GAAUtW,EAAQ4uB,GAAWnX,IAC7BA,EAASyP,GAAazP,GAExB,OAAOzX,GAN8B+iC,GAgBnC3U,GAASjjB,GA2Eb,SAAS63B,GAAQvrB,EAAQ2a,EAAM6Q,GAO7B,IAJA,IAAI5jC,GAAS,EACT1E,GAHJy3B,EAAOC,GAASD,EAAM3a,IAGJ9c,OACdqF,GAAS,IAEJX,EAAQ1E,GAAQ,CACvB,IAAIuC,EAAMo1B,GAAMF,EAAK/yB,IACrB,KAAMW,EAAmB,MAAVyX,GAAkBwrB,EAAQxrB,EAAQva,IAC/C,MAEFua,EAASA,EAAOva,GAElB,OAAI8C,KAAYX,GAAS1E,EAChBqF,KAETrF,EAAmB,MAAV8c,EAAiB,EAAIA,EAAO9c,SAClBuoC,GAASvoC,IAAWuxB,GAAQhvB,EAAKvC,KACjDqvB,GAAQvS,IAAWqU,GAAYrU,IA6BpC,SAAS8W,GAAgB9W,GACvB,MAAqC,mBAAtBA,EAAO3jB,aAA8BqiC,GAAY1e,MAC5D2S,GAAWlD,GAAazP,IA8E9B,SAASoa,GAAc/4B,GACrB,OAAOkxB,GAAQlxB,IAAUgzB,GAAYhzB,OAChCwuB,IAAoBxuB,GAASA,EAAMwuB,KAW1C,SAAS4E,GAAQpzB,EAAO6B,GACtB,IAAIuJ,EAAIrV,EAAUiK,GAGlB,SAFA6B,EAAmB,MAAVA,EAAiBuS,EAAmBvS,KAGlC,UAARuJ,GACU,UAARA,GAAoBgN,GAAShX,KAAKpB,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQ6B,EAajD,SAASijC,GAAe9kC,EAAOuG,EAAOoY,GACpC,IAAK7V,GAAS6V,GACZ,OAAO,EAET,IAAIvT,EAAIrV,EAAUwQ,GAClB,SAAY,UAAR6E,EACKuyB,GAAYhf,IAAWyU,GAAQ7sB,EAAOoY,EAAO9c,QACrC,UAARuJ,GAAoB7E,KAASoY,IAE7BkV,GAAGlV,EAAOpY,GAAQvG,GAa7B,SAAS89B,GAAM99B,EAAO2e,GACpB,GAAIuS,GAAQlxB,GACV,OAAO,EAET,IAAIoL,EAAIrV,EAAUiK,GAClB,QAAY,UAARoL,GAA4B,UAARA,GAA4B,WAARA,GAC/B,MAATpL,IAAiB04B,GAAS14B,KAGvBoX,GAAchW,KAAKpB,KAAWmX,GAAa/V,KAAKpB,IAC1C,MAAV2e,GAAkB3e,KAAS1F,GAAOqkB,GAyBvC,SAASsnB,GAAW78B,GAClB,IAAI28B,EAAWD,GAAY18B,GACvBywB,EAAQ5I,GAAO8U,GAEnB,GAAoB,mBAATlM,KAAyBkM,KAAY5U,GAAYp2B,WAC1D,OAAO,EAET,GAAIqO,IAASywB,EACX,OAAO,EAET,IAAItrB,EAAOy3B,GAAQnM,GACnB,QAAStrB,GAAQnF,IAASmF,EAAK,IA7S5B0hB,IAAYqF,GAAO,IAAIrF,GAAS,IAAIoa,YAAY,MAAQv0B,IACxD9I,IAAOsoB,GAAO,IAAItoB,KAAQoI,GAC1B8a,IAv3LU,oBAu3LCoF,GAAOpF,GAAQoa,YAC1Bna,IAAOmF,GAAO,IAAInF,KAAQ1a,IAC1BxF,IAAWqlB,GAAO,IAAIrlB,KAAY0F,MACrC2f,GAAS,SAASt1B,GAChB,IAAIkH,EAASmL,GAAWrS,GACpBg2B,EAAO9uB,GAAUoO,GAAYtV,EAAMhF,YAAc9E,EACjDq0C,EAAavU,EAAOxF,GAASwF,GAAQ,GAEzC,GAAIuU,EACF,OAAQA,GACN,KAAKha,GAAoB,OAAOza,GAChC,KAAK2a,GAAe,OAAOrb,EAC3B,KAAKsb,GAAmB,MAn4LjB,mBAo4LP,KAAKC,GAAe,OAAOlb,GAC3B,KAAKmb,GAAmB,OAAOjb,GAGnC,OAAOzO,IA+SX,IAAIsjC,GAAa/c,GAAa2L,GAAaqR,GAS3C,SAASpN,GAAYr9B,GACnB,IAAIg2B,EAAOh2B,GAASA,EAAMhF,YAG1B,OAAOgF,KAFqB,mBAARg2B,GAAsBA,EAAKj7B,WAAcsN,IAa/D,SAAS01B,GAAmB/9B,GAC1B,OAAOA,GAAUA,IAAU8I,GAAS9I,GAYtC,SAAS69B,GAAwBz5B,EAAKw4B,GACpC,OAAO,SAASje,GACd,OAAc,MAAVA,GAGGA,EAAOva,KAASw4B,IACpBA,IAAa1mC,GAAckO,KAAO9J,GAAOqkB,KAsIhD,SAASwhB,GAAS/2B,EAAM62B,EAAOt8B,GAE7B,OADAs8B,EAAQh3B,GAAUg3B,IAAU/pC,EAAakT,EAAKvH,OAAS,EAAKo+B,EAAO,GAC5D,WAML,IALA,IAAI/1B,EAAOU,UACPrE,GAAS,EACT1E,EAASoH,GAAUiB,EAAKrI,OAASo+B,EAAO,GACxCzjB,EAAQe,EAAM1b,KAET0E,EAAQ1E,GACf2a,EAAMjW,GAAS2D,EAAK+1B,EAAQ15B,GAE9BA,GAAS,EAET,IADA,IAAImkC,EAAYntB,EAAM0iB,EAAQ,KACrB15B,EAAQ05B,GACfyK,EAAUnkC,GAAS2D,EAAK3D,GAG1B,OADAmkC,EAAUzK,GAASt8B,EAAU6Y,GACtB3f,GAAMuM,EAAM5S,KAAMk0C,IAY7B,SAASjQ,GAAO9b,EAAQ2a,GACtB,OAAOA,EAAKz3B,OAAS,EAAI8c,EAAS0a,GAAQ1a,EAAQgiB,GAAUrH,EAAM,GAAI,IAiCxE,SAAS8E,GAAQzf,EAAQva,GACvB,IAAY,gBAARA,GAAgD,mBAAhBua,EAAOva,KAIhC,aAAPA,EAIJ,OAAOua,EAAOva,GAiBhB,IAAImkC,GAAUoC,GAASpK,IAUnBnlC,GAAa2zB,IAAiB,SAAS3lB,EAAMC,GAC/C,OAAO1B,GAAKvM,WAAWgO,EAAMC,IAW3B62B,GAAcyK,GAASnK,IAY3B,SAASgI,GAAgBxkC,EAAS4mC,EAAW9V,GAC3C,IAAInkB,EAAUi6B,EAAY,GAC1B,OAAO1K,GAAYl8B,EA1brB,SAA2B2M,EAAQzX,GACjC,IAAI2I,EAAS3I,EAAQ2I,OACrB,IAAKA,EACH,OAAO8O,EAET,IAAI8b,EAAY5qB,EAAS,EAGzB,OAFA3I,EAAQuzB,IAAc5qB,EAAS,EAAI,KAAO,IAAM3I,EAAQuzB,GACxDvzB,EAAUA,EAAQmW,KAAKxN,EAAS,EAAI,KAAO,KACpC8O,EAAO3P,QAAQwW,GAAe,uBAAyBte,EAAU,UAkb5C2xC,CAAkBl6B,EAqHhD,SAA2BzX,EAAS47B,GAOlC,OANAlY,GAAUlI,EAAW,SAASk0B,GAC5B,IAAI5oC,EAAQ,KAAO4oC,EAAK,GACnB9T,EAAU8T,EAAK,KAAQ1rB,GAAchkB,EAAS8G,IACjD9G,EAAQ4L,KAAK9E,KAGV9G,EAAQoW,OA5HuCw7B,CAtjBxD,SAAwBn6B,GACtB,IAAI/D,EAAQ+D,EAAO/D,MAAM6K,IACzB,OAAO7K,EAAQA,EAAM,GAAG9P,MAAM4a,OAojB0CqzB,CAAep6B,GAASmkB,KAYlG,SAAS6V,GAASvhC,GAChB,IAAI4hC,EAAQ,EACRC,EAAa,EAEjB,OAAO,WACL,IAAIC,EAAQtb,KACRub,EAAYn3B,GAAYk3B,EAAQD,GAGpC,GADAA,EAAaC,EACTC,EAAY,GACd,KAAMH,GAASj3B,EACb,OAAOnJ,UAAU,QAGnBogC,EAAQ,EAEV,OAAO5hC,EAAKvM,MAAM3G,EAAW0U,YAYjC,SAAS4oB,GAAYhX,EAAO9Q,GAC1B,IAAInF,GAAS,EACT1E,EAAS2a,EAAM3a,OACf4qB,EAAY5qB,EAAS,EAGzB,IADA6J,EAAOA,IAASxV,EAAY2L,EAAS6J,IAC5BnF,EAAQmF,GAAM,CACrB,IAAI0/B,EAAO9X,GAAW/sB,EAAOkmB,GACzBzsB,EAAQwc,EAAM4uB,GAElB5uB,EAAM4uB,GAAQ5uB,EAAMjW,GACpBiW,EAAMjW,GAASvG,EAGjB,OADAwc,EAAM3a,OAAS6J,EACR8Q,EAUT,IAAIwmB,GAvTJ,SAAuB55B,GACrB,IAAIlC,EAASmkC,GAAQjiC,EAAM,SAAShF,GAIlC,OAHIib,EAAM3T,OAASkH,GACjByM,EAAMgT,QAEDjuB,IAGLib,EAAQnY,EAAOmY,MACnB,OAAOnY,EA8SUokC,CAAc,SAASrjC,GACxC,IAAIf,KAOJ,OAN6B,KAAzBe,EAAOsjC,WAAW,IACpBrkC,EAAOpC,KAAK,IAEdmD,EAAOjH,QAAQqW,GAAY,SAASzK,EAAO8nB,EAAQ8W,EAAOC,GACxDvkC,EAAOpC,KAAK0mC,EAAQC,EAAUzqC,QAAQ6W,GAAc,MAAS6c,GAAU9nB,KAElE1F,IAUT,SAASsyB,GAAMx5B,GACb,GAAoB,iBAATA,GAAqB04B,GAAS14B,GACvC,OAAOA,EAET,IAAIkH,EAAUlH,EAAQ,GACtB,MAAkB,KAAVkH,GAAkB,EAAIlH,IAAWmU,EAAY,KAAOjN,EAU9D,SAASspB,GAASpnB,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAOskB,GAAap3B,KAAK8S,GACzB,MAAOtH,IACT,IACE,OAAQsH,EAAO,GACf,MAAOtH,KAEX,MAAO,GA4BT,SAASuvB,GAAartB,GACpB,GAAIA,aAAmBmtB,GACrB,OAAOntB,EAAQ0nC,QAEjB,IAAIxkC,EAAS,IAAIkqB,GAAcptB,EAAQytB,YAAaztB,EAAQ2tB,WAI5D,OAHAzqB,EAAOwqB,YAAc+B,GAAUzvB,EAAQ0tB,aACvCxqB,EAAO0qB,UAAa5tB,EAAQ4tB,UAC5B1qB,EAAO2qB,WAAa7tB,EAAQ6tB,WACrB3qB,EAsIT,IAAIykC,GAAa3L,GAAS,SAASxjB,EAAOiB,GACxC,OAAO8gB,GAAkB/hB,GACrB2a,GAAe3a,EAAOoc,GAAYnb,EAAQ,EAAG8gB,IAAmB,SA8BlEqN,GAAe5L,GAAS,SAASxjB,EAAOiB,GAC1C,IAAIf,EAAWge,GAAKjd,GAIpB,OAHI8gB,GAAkB7hB,KACpBA,EAAWxmB,GAENqoC,GAAkB/hB,GACrB2a,GAAe3a,EAAOoc,GAAYnb,EAAQ,EAAG8gB,IAAmB,GAAOQ,GAAYriB,EAAU,SA2B/FmvB,GAAiB7L,GAAS,SAASxjB,EAAOiB,GAC5C,IAAIJ,EAAaqd,GAAKjd,GAItB,OAHI8gB,GAAkBlhB,KACpBA,EAAannB,GAERqoC,GAAkB/hB,GACrB2a,GAAe3a,EAAOoc,GAAYnb,EAAQ,EAAG8gB,IAAmB,GAAOroC,EAAWmnB,QAuOxF,SAASyuB,GAAUtvB,EAAOO,EAAWqB,GACnC,IAAIvc,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAI0E,EAAqB,MAAb6X,EAAoB,EAAIuqB,GAAUvqB,GAI9C,OAHI7X,EAAQ,IACVA,EAAQ0C,GAAUpH,EAAS0E,EAAO,IAE7B4X,GAAc3B,EAAOuiB,GAAYhiB,EAAW,GAAIxW,GAsCzD,SAASwlC,GAAcvvB,EAAOO,EAAWqB,GACvC,IAAIvc,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAI0E,EAAQ1E,EAAS,EAOrB,OANIuc,IAAcloB,IAChBqQ,EAAQoiC,GAAUvqB,GAClB7X,EAAQ6X,EAAY,EAChBnV,GAAUpH,EAAS0E,EAAO,GAC1B2C,GAAU3C,EAAO1E,EAAS,IAEzBsc,GAAc3B,EAAOuiB,GAAYhiB,EAAW,GAAIxW,GAAO,GAiBhE,SAASsjC,GAAQrtB,GAEf,OADsB,MAATA,GAAoBA,EAAM3a,OACvB+2B,GAAYpc,EAAO,MAgGrC,SAASwvB,GAAKxvB,GACZ,OAAQA,GAASA,EAAM3a,OAAU2a,EAAM,GAAKtmB,EA0E9C,IAAI+1C,GAAejM,GAAS,SAAS/F,GACnC,IAAIiS,EAAS5uB,GAAS2c,EAAQ6I,IAC9B,OAAQoJ,EAAOrqC,QAAUqqC,EAAO,KAAOjS,EAAO,GAC1CD,GAAiBkS,QA2BnBC,GAAiBnM,GAAS,SAAS/F,GACrC,IAAIvd,EAAWge,GAAKT,GAChBiS,EAAS5uB,GAAS2c,EAAQ6I,IAO9B,OALIpmB,IAAage,GAAKwR,GACpBxvB,EAAWxmB,EAEXg2C,EAAOlU,MAEDkU,EAAOrqC,QAAUqqC,EAAO,KAAOjS,EAAO,GAC1CD,GAAiBkS,EAAQnN,GAAYriB,EAAU,SAyBjD0vB,GAAmBpM,GAAS,SAAS/F,GACvC,IAAI5c,EAAaqd,GAAKT,GAClBiS,EAAS5uB,GAAS2c,EAAQ6I,IAM9B,OAJAzlB,EAAkC,mBAAdA,EAA2BA,EAAannB,IAE1Dg2C,EAAOlU,MAEDkU,EAAOrqC,QAAUqqC,EAAO,KAAOjS,EAAO,GAC1CD,GAAiBkS,EAAQh2C,EAAWmnB,QAqC1C,SAASqd,GAAKle,GACZ,IAAI3a,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,OACvC,OAAOA,EAAS2a,EAAM3a,EAAS,GAAK3L,EAuFtC,IAAIm2C,GAAOrM,GAASsM,IAsBpB,SAASA,GAAQ9vB,EAAOiB,GACtB,OAAQjB,GAASA,EAAM3a,QAAU4b,GAAUA,EAAO5b,OAC9C89B,GAAYnjB,EAAOiB,GACnBjB,EAqFN,IAAI+vB,GAAS7G,GAAS,SAASlpB,EAAO1Q,GACpC,IAAIjK,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,OACnCqF,EAASqtB,GAAO/X,EAAO1Q,GAM3B,OAJA8zB,GAAWpjB,EAAOc,GAASxR,EAAS,SAASvF,GAC3C,OAAO6sB,GAAQ7sB,EAAO1E,IAAW0E,EAAQA,IACxC+I,KAAKgwB,KAEDp4B,IA2ET,SAASqK,GAAQiL,GACf,OAAgB,MAATA,EAAgBA,EAAQwT,GAAc15B,KAAKkmB,GAkapD,IAAIgwB,GAAQxM,GAAS,SAAS/F,GAC5B,OAAO+H,GAASpJ,GAAYqB,EAAQ,EAAGsE,IAAmB,MA0BxDkO,GAAUzM,GAAS,SAAS/F,GAC9B,IAAIvd,EAAWge,GAAKT,GAIpB,OAHIsE,GAAkB7hB,KACpBA,EAAWxmB,GAEN8rC,GAASpJ,GAAYqB,EAAQ,EAAGsE,IAAmB,GAAOQ,GAAYriB,EAAU,MAwBrFgwB,GAAY1M,GAAS,SAAS/F,GAChC,IAAI5c,EAAaqd,GAAKT,GAEtB,OADA5c,EAAkC,mBAAdA,EAA2BA,EAAannB,EACrD8rC,GAASpJ,GAAYqB,EAAQ,EAAGsE,IAAmB,GAAOroC,EAAWmnB,KAgG9E,SAASsvB,GAAMnwB,GACb,IAAMA,IAASA,EAAM3a,OACnB,SAEF,IAAIA,EAAS,EAOb,OANA2a,EAAQQ,GAAYR,EAAO,SAASowB,GAClC,GAAIrO,GAAkBqO,GAEpB,OADA/qC,EAASoH,GAAU2jC,EAAM/qC,OAAQA,IAC1B,IAGJkd,GAAUld,EAAQ,SAAS0E,GAChC,OAAO+W,GAASd,EAAOuB,GAAaxX,MAyBxC,SAASsmC,GAAUrwB,EAAOE,GACxB,IAAMF,IAASA,EAAM3a,OACnB,SAEF,IAAIqF,EAASylC,GAAMnwB,GACnB,OAAgB,MAAZE,EACKxV,EAEFoW,GAASpW,EAAQ,SAAS0lC,GAC/B,OAAO/vC,GAAM6f,EAAUxmB,EAAW02C,KAwBtC,IAAIE,GAAU9M,GAAS,SAASxjB,EAAOiB,GACrC,OAAO8gB,GAAkB/hB,GACrB2a,GAAe3a,EAAOiB,QAsBxBsvB,GAAM/M,GAAS,SAAS/F,GAC1B,OAAOyI,GAAQ1lB,GAAYid,EAAQsE,OA0BjCyO,GAAQhN,GAAS,SAAS/F,GAC5B,IAAIvd,EAAWge,GAAKT,GAIpB,OAHIsE,GAAkB7hB,KACpBA,EAAWxmB,GAENwsC,GAAQ1lB,GAAYid,EAAQsE,IAAoBQ,GAAYriB,EAAU,MAwB3EuwB,GAAUjN,GAAS,SAAS/F,GAC9B,IAAI5c,EAAaqd,GAAKT,GAEtB,OADA5c,EAAkC,mBAAdA,EAA2BA,EAAannB,EACrDwsC,GAAQ1lB,GAAYid,EAAQsE,IAAoBroC,EAAWmnB,KAmBhE6vB,GAAMlN,GAAS2M,IA6DnB,IAAIQ,GAAUnN,GAAS,SAAS/F,GAC9B,IAAIp4B,EAASo4B,EAAOp4B,OAChB6a,EAAW7a,EAAS,EAAIo4B,EAAOp4B,EAAS,GAAK3L,EAGjD,OAAO22C,GAAU5S,EADjBvd,EAA8B,mBAAZA,GAA0Bud,EAAOjC,MAAOtb,GAAYxmB,KAmCxE,SAASk3C,GAAMptC,GACb,IAAIkH,EAAS+pB,GAAOjxB,GAEpB,OADAkH,EAAOyqB,WAAY,EACZzqB,EAsDT,SAAS2+B,GAAK7lC,EAAOqtC,GACnB,OAAOA,EAAYrtC,GAmBrB,IAAIstC,GAAY5H,GAAS,SAASlR,GAChC,IAAI3yB,EAAS2yB,EAAM3yB,OACfo+B,EAAQp+B,EAAS2yB,EAAM,GAAK,EAC5Bx0B,EAAQxJ,KAAKi7B,YACb4b,EAAc,SAAS1uB,GAAU,OAAO4V,GAAO5V,EAAQ6V,IAE3D,QAAI3yB,EAAS,GAAKrL,KAAKk7B,YAAY7vB,SAC7B7B,aAAiBmxB,IAAiBiC,GAAQ6M,KAGhDjgC,EAAQA,EAAMyG,MAAMw5B,GAAQA,GAASp+B,EAAS,EAAI,KAC5C6vB,YAAY5sB,MAChBsE,KAAQy8B,GACR37B,MAASmjC,GACTljC,QAAWjU,IAEN,IAAIk7B,GAAcpxB,EAAOxJ,KAAKm7B,WAAWkU,KAAK,SAASrpB,GAI5D,OAHI3a,IAAW2a,EAAM3a,QACnB2a,EAAM1X,KAAK5O,GAENsmB,KAZAhmB,KAAKqvC,KAAKwH,KA+PrB,IAAIE,GAAU/I,GAAiB,SAASt9B,EAAQlH,EAAOoE,GACjDkE,GAAehS,KAAK4Q,EAAQ9C,KAC5B8C,EAAO9C,GAET0vB,GAAgB5sB,EAAQ9C,EAAK,KAuIjC,IAAIopC,GAAOjI,GAAWuG,IAqBlB2B,GAAWlI,GAAWwG,IA2G1B,SAAStwC,GAAQwiB,EAAYvB,GAE3B,OADWwU,GAAQjT,GAAcrB,GAAYuX,IACjClW,EAAY8gB,GAAYriB,EAAU,IAuBhD,SAASgxB,GAAazvB,EAAYvB,GAEhC,OADWwU,GAAQjT,GAAcpB,GAAiByb,IACtCra,EAAY8gB,GAAYriB,EAAU,IA0BhD,IAAIixB,GAAUnJ,GAAiB,SAASt9B,EAAQlH,EAAOoE,GACjDkE,GAAehS,KAAK4Q,EAAQ9C,GAC9B8C,EAAO9C,GAAKU,KAAK9E,GAEjB8zB,GAAgB5sB,EAAQ9C,GAAMpE,MAsElC,IAAI4tC,GAAY5N,GAAS,SAAS/hB,EAAYqb,EAAMpvB,GAClD,IAAI3D,GAAS,EACTgvB,EAAwB,mBAAR+D,EAChBpyB,EAASy2B,GAAY1f,GAAcV,EAAMU,EAAWpc,WAKxD,OAHAsyB,GAASlW,EAAY,SAASje,GAC5BkH,IAASX,GAASgvB,EAAS14B,GAAMy8B,EAAMt5B,EAAOkK,GAAQswB,GAAWx6B,EAAOs5B,EAAMpvB,KAEzEhD,IA+BL2mC,GAAQrJ,GAAiB,SAASt9B,EAAQlH,EAAOoE,GACnD0vB,GAAgB5sB,EAAQ9C,EAAKpE,KA6C/B,SAASoN,GAAI6Q,EAAYvB,GAEvB,OADWwU,GAAQjT,GAAcX,GAAWogB,IAChCzf,EAAY8gB,GAAYriB,EAAU,IAkFhD,IAAIoxB,GAAYtJ,GAAiB,SAASt9B,EAAQlH,EAAOoE,GACvD8C,EAAO9C,EAAM,EAAI,GAAGU,KAAK9E,IACxB,WAAa,gBAmShB,IAAI+tC,GAAS/N,GAAS,SAAS/hB,EAAY4gB,GACzC,GAAkB,MAAd5gB,EACF,SAEF,IAAIpc,EAASg9B,EAAUh9B,OAMvB,OALIA,EAAS,GAAKijC,GAAe7mB,EAAY4gB,EAAU,GAAIA,EAAU,IACnEA,KACSh9B,EAAS,GAAKijC,GAAejG,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,GAAaA,EAAU,KAElBD,GAAY3gB,EAAY2a,GAAYiG,EAAW,SAqBpD/2B,GAAMgnB,IAAU,WAClB,OAAOnnB,GAAKE,KAAKC,OA0DnB,SAASgG,GAAI1E,EAAM4V,EAAG6lB,GAGpB,OAFA7lB,EAAI6lB,EAAQ3uC,EAAY8oB,EACxBA,EAAK5V,GAAa,MAAL4V,EAAa5V,EAAKvH,OAASmd,EACjCgqB,GAAW5/B,EAAMsK,EAAexd,EAAWA,EAAWA,EAAWA,EAAW8oB,GAoBrF,SAASzO,GAAOyO,EAAG5V,GACjB,IAAIlC,EACJ,GAAmB,mBAARkC,EACT,MAAM,IAAIW,GAAUf,GAGtB,OADAgW,EAAI2pB,GAAU3pB,GACP,WAOL,QANMA,EAAI,IACR9X,EAASkC,EAAKvM,MAAMrG,KAAMoU,YAExBoU,GAAK,IACP5V,EAAOlT,GAEFgR,GAuCX,IAAI3L,GAAOykC,GAAS,SAAS52B,EAAMe,EAASs5B,GAC1C,IAAI3O,EAAU3hB,EACd,GAAIswB,EAAS5hC,OAAQ,CACnB,IAAI6hC,EAAUrX,GAAeoX,EAAUmD,GAAUrrC,KACjDu5B,GAAWthB,EAEb,OAAOw1B,GAAW5/B,EAAM0rB,EAAS3qB,EAASs5B,EAAUC,KAgDlDsK,GAAUhO,GAAS,SAASrhB,EAAQva,EAAKq/B,GAC3C,IAAI3O,EAAU3hB,EAAiBC,EAC/B,GAAIqwB,EAAS5hC,OAAQ,CACnB,IAAI6hC,EAAUrX,GAAeoX,EAAUmD,GAAUoH,KACjDlZ,GAAWthB,EAEb,OAAOw1B,GAAW5kC,EAAK0wB,EAASnW,EAAQ8kB,EAAUC,KAsJpD,SAASuK,GAAS7kC,EAAMC,EAAMhR,GAC5B,IAAIiR,EACAC,EACAC,EACAtC,EACAuC,EACAC,EACAC,EAAiB,EACjBC,GAAU,EACVC,GAAS,EACTC,GAAW,EAEf,GAAmB,mBAARV,EACT,MAAM,IAAIW,GAAUf,GAUtB,SAASgB,EAAWC,GAClB,IAAIC,EAAOZ,EACPa,EAAUZ,EAKd,OAHAD,EAAWC,EAAWrT,EACtByT,EAAiBM,EACjB/C,EAASkC,EAAKvM,MAAMsN,EAASD,GAuB/B,SAASE,EAAaH,GACpB,IAAII,EAAoBJ,EAAOP,EAM/B,OAAQA,IAAiBxT,GAAcmU,GAAqBhB,GACzDgB,EAAoB,GAAOR,GANJI,EAAON,GAM8BH,EAGjE,SAASc,IACP,IAAIL,EAAOnC,KACX,GAAIsC,EAAaH,GACf,OAAOM,EAAaN,GAGtBR,EAAUrO,GAAWkP,EA3BvB,SAAuBL,GACrB,IAEIO,EAAcnB,GAFMY,EAAOP,GAI/B,OAAOG,EACHX,GAAUsB,EAAahB,GAJDS,EAAON,IAK7Ba,EAoB+BC,CAAcR,IAGnD,SAASM,EAAaN,GAKpB,OAJAR,EAAUvT,EAIN4T,GAAYR,EACPU,EAAWC,IAEpBX,EAAWC,EAAWrT,EACfgR,GAeT,SAASwD,IACP,IAAIT,EAAOnC,KACP6C,EAAaP,EAAaH,GAM9B,GAJAX,EAAWsB,UACXrB,EAAW/S,KACXkT,EAAeO,EAEXU,EAAY,CACd,GAAIlB,IAAYvT,EACd,OAzEN,SAAqB+T,GAMnB,OAJAN,EAAiBM,EAEjBR,EAAUrO,GAAWkP,EAAcjB,GAE5BO,EAAUI,EAAWC,GAAQ/C,EAmEzB2D,CAAYnB,GAErB,GAAIG,EAIF,OAFAtG,GAAakG,GACbA,EAAUrO,GAAWkP,EAAcjB,GAC5BW,EAAWN,GAMtB,OAHID,IAAYvT,IACduT,EAAUrO,GAAWkP,EAAcjB,IAE9BnC,EAIT,OA3GAmC,EAAON,GAASM,IAAS,EACrBP,GAASzQ,KACXuR,IAAYvR,EAAQuR,QAEpBJ,GADAK,EAAS,YAAaxR,GACH4Q,GAAUF,GAAS1Q,EAAQmR,UAAY,EAAGH,GAAQG,EACrEM,EAAW,aAAczR,IAAYA,EAAQyR,SAAWA,GAoG1DY,EAAUI,OApCV,WACMrB,IAAYvT,GACdqN,GAAakG,GAEfE,EAAiB,EACjBL,EAAWI,EAAeH,EAAWE,EAAUvT,GAgCjDwU,EAAUK,MA7BV,WACE,OAAOtB,IAAYvT,EAAYgR,EAASqD,EAAazC,OA6BhD4C,EAqBT,IAAIwjC,GAAQlO,GAAS,SAAS52B,EAAMc,GAClC,OAAOgtB,GAAU9tB,EAAM,EAAGc,KAsBxBikC,GAAQnO,GAAS,SAAS52B,EAAMC,EAAMa,GACxC,OAAOgtB,GAAU9tB,EAAML,GAASM,IAAS,EAAGa,KAqE9C,SAASmhC,GAAQjiC,EAAMglC,GACrB,GAAmB,mBAARhlC,GAAmC,MAAZglC,GAAuC,mBAAZA,EAC3D,MAAM,IAAIrkC,GAAUf,GAEtB,IAAIqlC,EAAW,SAAXA,IACF,IAAInkC,EAAOU,UACPxG,EAAMgqC,EAAWA,EAASvxC,MAAMrG,KAAM0T,GAAQA,EAAK,GACnDmV,EAAQgvB,EAAShvB,MAErB,GAAIA,EAAMC,IAAIlb,GACZ,OAAOib,EAAMxf,IAAIuE,GAEnB,IAAI8C,EAASkC,EAAKvM,MAAMrG,KAAM0T,GAE9B,OADAmkC,EAAShvB,MAAQA,EAAMtf,IAAIqE,EAAK8C,IAAWmY,EACpCnY,GAGT,OADAmnC,EAAShvB,MAAQ,IAAKgsB,GAAQiD,OAAS9b,IAChC6b,EA0BT,SAASE,GAAOxxB,GACd,GAAwB,mBAAbA,EACT,MAAM,IAAIhT,GAAUf,GAEtB,OAAO,WACL,IAAIkB,EAAOU,UACX,OAAQV,EAAKrI,QACX,KAAK,EAAG,OAAQkb,EAAUzmB,KAAKE,MAC/B,KAAK,EAAG,OAAQumB,EAAUzmB,KAAKE,KAAM0T,EAAK,IAC1C,KAAK,EAAG,OAAQ6S,EAAUzmB,KAAKE,KAAM0T,EAAK,GAAIA,EAAK,IACnD,KAAK,EAAG,OAAQ6S,EAAUzmB,KAAKE,KAAM0T,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE9D,OAAQ6S,EAAUlgB,MAAMrG,KAAM0T,IAlClCmhC,GAAQiD,MAAQ9b,GA2FhB,IAAIgc,GAAWvL,GAAS,SAAS75B,EAAMqlC,GAKrC,IAAIC,GAJJD,EAAmC,GAArBA,EAAW5sC,QAAeqvB,GAAQud,EAAW,IACvDnxB,GAASmxB,EAAW,GAAIvvB,GAAU6f,OAClCzhB,GAASsb,GAAY6V,EAAY,GAAIvvB,GAAU6f,QAEtBl9B,OAC7B,OAAOm+B,GAAS,SAAS91B,GAIvB,IAHA,IAAI3D,GAAS,EACT1E,EAASqH,GAAUgB,EAAKrI,OAAQ6sC,KAE3BnoC,EAAQ1E,GACfqI,EAAK3D,GAASkoC,EAAWloC,GAAOjQ,KAAKE,KAAM0T,EAAK3D,IAElD,OAAO1J,GAAMuM,EAAM5S,KAAM0T,OAqCzBykC,GAAU3O,GAAS,SAAS52B,EAAMq6B,GACpC,IAAIC,EAAUrX,GAAeoX,EAAUmD,GAAU+H,KACjD,OAAO3F,GAAW5/B,EAAMoK,EAAmBtd,EAAWutC,EAAUC,KAmC9DkL,GAAe5O,GAAS,SAAS52B,EAAMq6B,GACzC,IAAIC,EAAUrX,GAAeoX,EAAUmD,GAAUgI,KACjD,OAAO5F,GAAW5/B,EAAMqK,EAAyBvd,EAAWutC,EAAUC,KAyBpEmL,GAAQnJ,GAAS,SAASt8B,EAAM0C,GAClC,OAAOk9B,GAAW5/B,EAAMuK,EAAiBzd,EAAWA,EAAWA,EAAW4V,KAia5E,SAAS+nB,GAAG7zB,EAAO65B,GACjB,OAAO75B,IAAU65B,GAAU75B,GAAUA,GAAS65B,GAAUA,EA0B1D,IAAIiV,GAAK3G,GAA0BvO,IAyB/BmV,GAAM5G,GAA0B,SAASnoC,EAAO65B,GAClD,OAAO75B,GAAS65B,IAqBd7G,GAAc2H,GAAgB,WAAa,OAAO/vB,UAApB,IAAsC+vB,GAAkB,SAAS36B,GACjG,OAAOsS,GAAatS,IAAUsI,GAAehS,KAAK0J,EAAO,YACtDuuB,GAAqBj4B,KAAK0J,EAAO,WA0BlCkxB,GAAU3T,EAAM2T,QAmBhBtV,GAAgBD,GAAoBuD,GAAUvD,IA75PlD,SAA2B3b,GACzB,OAAOsS,GAAatS,IAAUqS,GAAWrS,IAAU6V,IAu7PrD,SAAS8nB,GAAY39B,GACnB,OAAgB,MAATA,GAAiBoqC,GAASpqC,EAAM6B,UAAYu3B,GAAWp5B,GA4BhE,SAASu+B,GAAkBv+B,GACzB,OAAOsS,GAAatS,IAAU29B,GAAY39B,GA0C5C,IAAIuvB,GAAWD,IAAkBmb,GAmB7B3uB,GAASD,GAAaqD,GAAUrD,IAxgQpC,SAAoB7b,GAClB,OAAOsS,GAAatS,IAAUqS,GAAWrS,IAAU+U,GA+qQrD,SAASi6B,GAAQhvC,GACf,IAAKsS,GAAatS,GAChB,OAAO,EAET,IAAI4I,EAAMyJ,GAAWrS,GACrB,OAAO4I,GAAOqM,GAAYrM,GAAOoM,GACN,iBAAjBhV,EAAMs7B,SAA4C,iBAAdt7B,EAAMmC,OAAqBq8B,GAAcx+B,GAkDzF,SAASo5B,GAAWp5B,GAClB,IAAK8I,GAAS9I,GACZ,OAAO,EAIT,IAAI4I,EAAMyJ,GAAWrS,GACrB,OAAO4I,GAAOsM,GAAWtM,GAAOuM,GAAUvM,GAAOiM,GAAYjM,GAAO2M,GA6BtE,SAAS05B,GAAUjvC,GACjB,MAAuB,iBAATA,GAAqBA,GAAS2oC,GAAU3oC,GA6BxD,SAASoqC,GAASpqC,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAASoU,EA4B7C,SAAStL,GAAS9I,GAChB,IAAIoL,EAAIrV,EAAUiK,GAClB,OAAgB,MAATA,IAA0B,UAARoL,GAA4B,YAARA,GA2B/C,SAASkH,GAAatS,GACpB,OAAgB,MAATA,GAAiC,UAAhBjK,EAAOiK,GAoBjC,IAAIgc,GAAQD,GAAYmD,GAAUnD,IA5xQlC,SAAmB/b,GACjB,OAAOsS,GAAatS,IAAUs1B,GAAOt1B,IAAUoV,GA6+QjD,SAAS85B,GAASlvC,GAChB,MAAuB,iBAATA,GACXsS,GAAatS,IAAUqS,GAAWrS,IAAUqV,EA+BjD,SAASmpB,GAAcx+B,GACrB,IAAKsS,GAAatS,IAAUqS,GAAWrS,IAAUsV,GAC/C,OAAO,EAET,IAAIvH,EAAQqgB,GAAapuB,GACzB,GAAc,OAAV+N,EACF,OAAO,EAET,IAAIioB,EAAO1tB,GAAehS,KAAKyX,EAAO,gBAAkBA,EAAM/S,YAC9D,MAAsB,mBAARg7B,GAAsBA,aAAgBA,GAClDtI,GAAap3B,KAAK0/B,IAASlI,GAoB/B,IAAI5R,GAAWD,GAAeiD,GAAUjD,IA59QxC,SAAsBjc,GACpB,OAAOsS,GAAatS,IAAUqS,GAAWrS,IAAUwV,IA6gRrD,IAAI4G,GAAQD,GAAY+C,GAAU/C,IAngRlC,SAAmBnc,GACjB,OAAOsS,GAAatS,IAAUs1B,GAAOt1B,IAAUyV,IAqhRjD,SAAS05B,GAASnvC,GAChB,MAAuB,iBAATA,IACVkxB,GAAQlxB,IAAUsS,GAAatS,IAAUqS,GAAWrS,IAAU0V,GAoBpE,SAASgjB,GAAS14B,GAChB,MAAuB,UAAhBjK,EAAOiK,IACXsS,GAAatS,IAAUqS,GAAWrS,IAAUuS,GAoBjD,IAAI+J,GAAeD,GAAmB6C,GAAU7C,IAvjRhD,SAA0Brc,GACxB,OAAOsS,GAAatS,IAClBoqC,GAASpqC,EAAM6B,WAAayY,GAAejI,GAAWrS,KA6oR1D,IAAIovC,GAAKjH,GAA0B1K,IAyB/B4R,GAAMlH,GAA0B,SAASnoC,EAAO65B,GAClD,OAAO75B,GAAS65B,IA0BlB,SAASyV,GAAQtvC,GACf,IAAKA,EACH,SAEF,GAAI29B,GAAY39B,GACd,OAAOmvC,GAASnvC,GAAS2sB,GAAc3sB,GAASyzB,GAAUzzB,GAE5D,GAAI0uB,IAAe1uB,EAAM0uB,IACvB,OAv8VN,SAAyBC,GAIvB,IAHA,IAAIpgB,EACArH,OAEKqH,EAAOogB,EAAS4gB,QAAQC,MAC/BtoC,EAAOpC,KAAKyJ,EAAKvO,OAEnB,OAAOkH,EAg8VIuoC,CAAgBzvC,EAAM0uB,OAE/B,IAAI9lB,EAAM0sB,GAAOt1B,GAGjB,OAFW4I,GAAOwM,EAAS8W,GAActjB,GAAO6M,GAAS6W,GAAa7O,IAE1Dzd,GA0Bd,SAASioC,GAASjoC,GAChB,OAAKA,GAGLA,EAAQ+I,GAAS/I,MACHmU,GAAYnU,KAAWmU,GACvBnU,EAAQ,GAAK,EAAI,GACfqU,EAETrU,GAAUA,EAAQA,EAAQ,EAPd,IAAVA,EAAcA,EAAQ,EAoCjC,SAAS2oC,GAAU3oC,GACjB,IAAIkH,EAAS+gC,GAASjoC,GAClB0vC,EAAYxoC,EAAS,EAEzB,OAAOA,GAAWA,EAAUwoC,EAAYxoC,EAASwoC,EAAYxoC,EAAU,EA8BzE,SAASyoC,GAAS3vC,GAChB,OAAOA,EAAQ0zB,GAAUiV,GAAU3oC,GAAQ,EAAGuU,GAAoB,EA0BpE,SAASxL,GAAS/I,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAI04B,GAAS14B,GACX,OAAOsU,EAET,GAAIxL,GAAS9I,GAAQ,CACnB,IAAI65B,EAAgC,mBAAjB75B,EAAM+wB,QAAwB/wB,EAAM+wB,UAAY/wB,EACnEA,EAAQ8I,GAAS+wB,GAAUA,EAAQ,GAAMA,EAE3C,GAAoB,iBAAT75B,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQif,GAASjf,GACjB,IAAI4vC,EAAW33B,GAAW7W,KAAKpB,GAC/B,OAAQ4vC,GAAYz3B,GAAU/W,KAAKpB,GAC/Bib,GAAajb,EAAMyG,MAAM,GAAImpC,EAAW,EAAI,GAC3C53B,GAAW5W,KAAKpB,GAASsU,GAAOtU,EA2BvC,SAASy+B,GAAcz+B,GACrB,OAAOq0B,GAAWr0B,EAAO41B,GAAO51B,IAsDlC,SAASwI,GAASxI,GAChB,OAAgB,MAATA,EAAgB,GAAK+hC,GAAa/hC,GAqC3C,IAAIrF,GAAS+pC,GAAe,SAAS/lB,EAAQhO,GAC3C,GAAI0sB,GAAY1sB,IAAWgtB,GAAYhtB,GACrC0jB,GAAW1jB,EAAQnV,GAAKmV,GAASgO,QAGnC,IAAK,IAAIva,KAAOuM,EACVrI,GAAehS,KAAKqa,EAAQvM,IAC9B2vB,GAAYpV,EAAQva,EAAKuM,EAAOvM,MAoClCyrC,GAAWnL,GAAe,SAAS/lB,EAAQhO,GAC7C0jB,GAAW1jB,EAAQilB,GAAOjlB,GAASgO,KAgCjCmxB,GAAepL,GAAe,SAAS/lB,EAAQhO,EAAQutB,EAAUnJ,GACnEV,GAAW1jB,EAAQilB,GAAOjlB,GAASgO,EAAQoW,KA+BzCgb,GAAarL,GAAe,SAAS/lB,EAAQhO,EAAQutB,EAAUnJ,GACjEV,GAAW1jB,EAAQnV,GAAKmV,GAASgO,EAAQoW,KAoBvCib,GAAKtK,GAASnR,IA8DlB,IAAIlH,GAAW2S,GAAS,SAASrhB,EAAQimB,GACvCjmB,EAASrkB,GAAOqkB,GAEhB,IAAIpY,GAAS,EACT1E,EAAS+iC,EAAQ/iC,OACjBgjC,EAAQhjC,EAAS,EAAI+iC,EAAQ,GAAK1uC,EAMtC,IAJI2uC,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClDhjC,EAAS,KAGF0E,EAAQ1E,GAMf,IALA,IAAI8O,EAASi0B,EAAQr+B,GACjBnH,EAAQw2B,GAAOjlB,GACfs/B,GAAc,EACdC,EAAc9wC,EAAMyC,SAEfouC,EAAaC,GAAa,CACjC,IAAI9rC,EAAMhF,EAAM6wC,GACZjwC,EAAQ2e,EAAOva,IAEfpE,IAAU9J,GACT29B,GAAG7zB,EAAOqI,GAAYjE,MAAUkE,GAAehS,KAAKqoB,EAAQva,MAC/Dua,EAAOva,GAAOuM,EAAOvM,IAK3B,OAAOua,IAsBLwxB,GAAenQ,GAAS,SAAS91B,GAEnC,OADAA,EAAKpF,KAAK5O,EAAWuzC,IACd5sC,GAAMuzC,GAAWl6C,EAAWgU,KAgSrC,SAASrK,GAAI8e,EAAQ2a,EAAMmO,GACzB,IAAIvgC,EAAmB,MAAVyX,EAAiBzoB,EAAYmjC,GAAQ1a,EAAQ2a,GAC1D,OAAOpyB,IAAWhR,EAAYuxC,EAAevgC,EA4D/C,SAAS82B,GAAMrf,EAAQ2a,GACrB,OAAiB,MAAV3a,GAAkBurB,GAAQvrB,EAAQ2a,EAAMS,IAqBjD,IAAIsW,GAASjJ,GAAe,SAASlgC,EAAQlH,EAAOoE,GACrC,MAATpE,GACyB,mBAAlBA,EAAMwI,WACfxI,EAAQuI,GAAqBjS,KAAK0J,IAGpCkH,EAAOlH,GAASoE,GACfq8B,GAASzD,KA4BRsT,GAAWlJ,GAAe,SAASlgC,EAAQlH,EAAOoE,GACvC,MAATpE,GACyB,mBAAlBA,EAAMwI,WACfxI,EAAQuI,GAAqBjS,KAAK0J,IAGhCsI,GAAehS,KAAK4Q,EAAQlH,GAC9BkH,EAAOlH,GAAO8E,KAAKV,GAEnB8C,EAAOlH,IAAUoE,IAElB26B,IAoBCwR,GAASvQ,GAASxF,IA8BtB,SAASh/B,GAAKmjB,GACZ,OAAOgf,GAAYhf,GAAUiU,GAAcjU,GAAUye,GAASze,GA0BhE,SAASiX,GAAOjX,GACd,OAAOgf,GAAYhf,GAAUiU,GAAcjU,GAAQ,GAAQ2e,GAAW3e,GAuGxE,IAAI6xB,GAAQ9L,GAAe,SAAS/lB,EAAQhO,EAAQutB,GAClDD,GAAUtf,EAAQhO,EAAQutB,KAkCxBkS,GAAY1L,GAAe,SAAS/lB,EAAQhO,EAAQutB,EAAUnJ,GAChEkJ,GAAUtf,EAAQhO,EAAQutB,EAAUnJ,KAuBlC0b,GAAO/K,GAAS,SAAS/mB,EAAQ6V,GACnC,IAAIttB,KACJ,GAAc,MAAVyX,EACF,OAAOzX,EAET,IAAI+tB,GAAS,EACbT,EAAQlX,GAASkX,EAAO,SAAS8E,GAG/B,OAFAA,EAAOC,GAASD,EAAM3a,GACtBsW,IAAWA,EAASqE,EAAKz3B,OAAS,GAC3By3B,IAETjF,GAAW1V,EAAQoY,GAAapY,GAASzX,GACrC+tB,IACF/tB,EAAS2tB,GAAU3tB,EAAQ4L,EAAkBC,EAAkBC,EAAoB02B,KAGrF,IADA,IAAI7nC,EAAS2yB,EAAM3yB,OACZA,KACLi+B,GAAU54B,EAAQstB,EAAM3yB,IAE1B,OAAOqF,IA4CT,IAAIomB,GAAOoY,GAAS,SAAS/mB,EAAQ6V,GACnC,OAAiB,MAAV7V,KAnmTT,SAAkBA,EAAQ6V,GACxB,OAAOiL,GAAW9gB,EAAQ6V,EAAO,SAASx0B,EAAOs5B,GAC/C,OAAO0E,GAAMrf,EAAQ2a,KAimTMoX,CAAS/xB,EAAQ6V,KAqBhD,SAASmc,GAAOhyB,EAAQ5B,GACtB,GAAc,MAAV4B,EACF,SAEF,IAAIvf,EAAQke,GAASyZ,GAAapY,GAAS,SAAS7e,GAClD,OAAQA,KAGV,OADAid,EAAYgiB,GAAYhiB,GACjB0iB,GAAW9gB,EAAQvf,EAAO,SAASY,EAAOs5B,GAC/C,OAAOvc,EAAU/c,EAAOs5B,EAAK,MA4IjC,IAAIsX,GAAU9H,GAActtC,IA0BxBq1C,GAAY/H,GAAclT,IA4K9B,SAASnY,GAAOkB,GACd,OAAiB,MAAVA,KAAsBQ,GAAWR,EAAQnjB,GAAKmjB,IAkNvD,IAAImyB,GAAY5L,GAAiB,SAASh+B,EAAQ6pC,EAAMxqC,GAEtD,OADAwqC,EAAOA,EAAKC,cACL9pC,GAAUX,EAAQ0qC,GAAWF,GAAQA,KAkB9C,SAASE,GAAWhpC,GAClB,OAAOipC,GAAW1oC,GAASP,GAAQ+oC,eAqBrC,SAAS5L,GAAOn9B,GAEd,OADAA,EAASO,GAASP,KACDA,EAAOjH,QAAQqX,GAASsH,IAAc3e,QAAQ+Y,GAAa,IAsH9E,IAAIo3B,GAAYjM,GAAiB,SAASh+B,EAAQ6pC,EAAMxqC,GACtD,OAAOW,GAAUX,EAAQ,IAAM,IAAMwqC,EAAKC,gBAuBxCI,GAAYlM,GAAiB,SAASh+B,EAAQ6pC,EAAMxqC,GACtD,OAAOW,GAAUX,EAAQ,IAAM,IAAMwqC,EAAKC,gBAoBxCK,GAAarM,GAAgB,eA0NjC,IAAIsM,GAAYpM,GAAiB,SAASh+B,EAAQ6pC,EAAMxqC,GACtD,OAAOW,GAAUX,EAAQ,IAAM,IAAMwqC,EAAKC,gBAgE5C,IAAIO,GAAYrM,GAAiB,SAASh+B,EAAQ6pC,EAAMxqC,GACtD,OAAOW,GAAUX,EAAQ,IAAM,IAAM2qC,GAAWH,KAsiBlD,IAAIS,GAAYtM,GAAiB,SAASh+B,EAAQ6pC,EAAMxqC,GACtD,OAAOW,GAAUX,EAAQ,IAAM,IAAMwqC,EAAK7jC,gBAoBxCgkC,GAAalM,GAAgB,eAqBjC,SAASG,GAAMl9B,EAAQwpC,EAAS5M,GAI9B,OAHA58B,EAASO,GAASP,IAClBwpC,EAAU5M,EAAQ3uC,EAAYu7C,KAEdv7C,EArybpB,SAAwB+R,GACtB,OAAOkS,GAAiB/Y,KAAK6G,GAqyblBypC,CAAezpC,GA1jb5B,SAAsBA,GACpB,OAAOA,EAAO2E,MAAMqN,QAyjbgB03B,CAAa1pC,GAzrcnD,SAAoBA,GAClB,OAAOA,EAAO2E,MAAM+K,QAwrcuCi6B,CAAW3pC,GAE7DA,EAAO2E,MAAM6kC,OA2BtB,IAAII,GAAU7R,GAAS,SAAS52B,EAAMc,GACpC,IACE,OAAOrN,GAAMuM,EAAMlT,EAAWgU,GAC9B,MAAOpI,GACP,OAAOktC,GAAQltC,GAAKA,EAAI,IAAIwC,EAAMxC,MA8BlCgwC,GAAUpM,GAAS,SAAS/mB,EAAQozB,GAKtC,OAJAn1B,GAAUm1B,EAAa,SAAS3tC,GAC9BA,EAAMo1B,GAAMp1B,GACZ0vB,GAAgBnV,EAAQva,EAAK7I,GAAKojB,EAAOva,GAAMua,MAE1CA,IAqGT,SAAS8hB,GAASzgC,GAChB,OAAO,WACL,OAAOA,GAkDX,IAAIgyC,GAAOvM,KAuBPwM,GAAYxM,IAAW,GAkB3B,SAASzI,GAASh9B,GAChB,OAAOA,EA6CT,SAAS0c,GAAStT,GAChB,OAAO2zB,GAA4B,mBAAR3zB,EAAqBA,EAAOyrB,GAAUzrB,EAAM0J,IAuGzE,IAAIo/B,GAASlS,GAAS,SAAS1G,EAAMpvB,GACnC,OAAO,SAASyU,GACd,OAAO6b,GAAW7b,EAAQ2a,EAAMpvB,MA2BhCioC,GAAWnS,GAAS,SAASrhB,EAAQzU,GACvC,OAAO,SAASovB,GACd,OAAOkB,GAAW7b,EAAQ2a,EAAMpvB,MAwCpC,SAASkoC,GAAMzzB,EAAQhO,EAAQtY,GAC7B,IAAI+G,EAAQ5D,GAAKmV,GACbohC,EAAc5Y,GAAcxoB,EAAQvR,GAEzB,MAAX/G,GACEyQ,GAAS6H,KAAYohC,EAAYlwC,SAAWzC,EAAMyC,UACtDxJ,EAAUsY,EACVA,EAASgO,EACTA,EAASnoB,KACTu7C,EAAc5Y,GAAcxoB,EAAQnV,GAAKmV,KAE3C,IAAIy8B,IAAUtkC,GAASzQ,IAAY,UAAWA,IAAcA,EAAQ+0C,OAChE7X,EAAS6D,GAAWza,GAqBxB,OAnBA/B,GAAUm1B,EAAa,SAAS9M,GAC9B,IAAI77B,EAAOuH,EAAOs0B,GAClBtmB,EAAOsmB,GAAc77B,EACjBmsB,IACF5W,EAAO5jB,UAAUkqC,GAAc,WAC7B,IAAIzT,EAAWh7B,KAAKm7B,UACpB,GAAIyb,GAAS5b,EAAU,CACrB,IAAItqB,EAASyX,EAAOnoB,KAAKi7B,aAKzB,OAJcvqB,EAAOwqB,YAAc+B,GAAUj9B,KAAKk7B,cAE1C5sB,MAAOsE,KAAQA,EAAMc,KAAQU,UAAWT,QAAWwU,IAC3DzX,EAAOyqB,UAAYH,EACZtqB,EAET,OAAOkC,EAAKvM,MAAM8hB,EAAQnB,IAAWhnB,KAAKwJ,SAAU4K,gBAKnD+T,EAmCT,SAASkqB,MAiDT,IAAIwJ,GAAO3K,GAAWpqB,IA8BlBg1B,GAAY5K,GAAW5qB,IAiCvBy1B,GAAW7K,GAAW7pB,IAwB1B,SAASsf,GAAS7D,GAChB,OAAOwE,GAAMxE,GAAQvb,GAAayb,GAAMF,IAh3X1C,SAA0BA,GACxB,OAAO,SAAS3a,GACd,OAAO0a,GAAQ1a,EAAQ2a,IA82XwBkZ,CAAiBlZ,GAuEpE,IAAImZ,GAAQ1K,KAsCR2K,GAAa3K,IAAY,GAoB7B,SAASkC,KACP,SAgBF,SAASQ,KACP,OAAO,EA+JT,IAAI7tC,GAAM2qC,GAAoB,SAASoL,EAAQC,GAC7C,OAAOD,EAASC,GACf,GAuBC3jB,GAAOwZ,GAAY,QAiBnBoK,GAAStL,GAAoB,SAASuL,EAAUC,GAClD,OAAOD,EAAWC,GACjB,GAuBC5jB,GAAQsZ,GAAY,SAwKxB,IAAIuK,GAAWzL,GAAoB,SAAS0L,EAAYC,GACtD,OAAOD,EAAaC,GACnB,GAuBC95C,GAAQqvC,GAAY,SAiBpB0K,GAAW5L,GAAoB,SAAS6L,EAASC,GACnD,OAAOD,EAAUC,GAChB,GAgmBH,OA1iBApiB,GAAOqiB,MAp6MP,SAAet0B,EAAG5V,GAChB,GAAmB,mBAARA,EACT,MAAM,IAAIW,GAAUf,GAGtB,OADAgW,EAAI2pB,GAAU3pB,GACP,WACL,KAAMA,EAAI,EACR,OAAO5V,EAAKvM,MAAMrG,KAAMoU,aA85M9BqmB,GAAOnjB,IAAMA,GACbmjB,GAAOt2B,OAASA,GAChBs2B,GAAO4e,SAAWA,GAClB5e,GAAO6e,aAAeA,GACtB7e,GAAO8e,WAAaA,GACpB9e,GAAO+e,GAAKA,GACZ/e,GAAO1gB,OAASA,GAChB0gB,GAAO11B,KAAOA,GACd01B,GAAO6gB,QAAUA,GACjB7gB,GAAO+c,QAAUA,GACjB/c,GAAOsiB,UAl8KP,WACE,IAAK3oC,UAAU/I,OACb,SAEF,IAAI7B,EAAQ4K,UAAU,GACtB,OAAOsmB,GAAQlxB,GAASA,GAASA,IA87KnCixB,GAAOmc,MAAQA,GACfnc,GAAOuiB,MApgTP,SAAeh3B,EAAO9Q,EAAMm5B,GAExBn5B,GADGm5B,EAAQC,GAAetoB,EAAO9Q,EAAMm5B,GAASn5B,IAASxV,GAClD,EAEA+S,GAAU0/B,GAAUj9B,GAAO,GAEpC,IAAI7J,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,OACvC,IAAKA,GAAU6J,EAAO,EACpB,SAMF,IAJA,IAAInF,EAAQ,EACR0W,EAAW,EACX/V,EAASqW,EAAMyR,GAAWntB,EAAS6J,IAEhCnF,EAAQ1E,GACbqF,EAAO+V,KAAc0jB,GAAUnkB,EAAOjW,EAAQA,GAASmF,GAEzD,OAAOxE,GAo/ST+pB,GAAOwiB,QAl+SP,SAAiBj3B,GAMf,IALA,IAAIjW,GAAS,EACT1E,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,OACnCob,EAAW,EACX/V,OAEKX,EAAQ1E,GAAQ,CACvB,IAAI7B,EAAQwc,EAAMjW,GACdvG,IACFkH,EAAO+V,KAAcjd,GAGzB,OAAOkH,GAu9ST+pB,GAAOtjB,OA97SP,WACE,IAAI9L,EAAS+I,UAAU/I,OACvB,IAAKA,EACH,SAMF,IAJA,IAAIqI,EAAOqT,EAAM1b,EAAS,GACtB2a,EAAQ5R,UAAU,GAClBrE,EAAQ1E,EAEL0E,KACL2D,EAAK3D,EAAQ,GAAKqE,UAAUrE,GAE9B,OAAOiX,GAAU0T,GAAQ1U,GAASiX,GAAUjX,IAAUA,GAAQoc,GAAY1uB,EAAM,KAm7SlF+mB,GAAOyiB,KA3tCP,SAAcvb,GACZ,IAAIt2B,EAAkB,MAATs2B,EAAgB,EAAIA,EAAMt2B,OACnCwlC,EAAatI,KASjB,OAPA5G,EAASt2B,EAAcyb,GAAS6a,EAAO,SAASyQ,GAC9C,GAAsB,mBAAXA,EAAK,GACd,MAAM,IAAI7+B,GAAUf,GAEtB,OAAQq+B,EAAWuB,EAAK,IAAKA,EAAK,SAG7B5I,GAAS,SAAS91B,GAEvB,IADA,IAAI3D,GAAS,IACJA,EAAQ1E,GAAQ,CACvB,IAAI+mC,EAAOzQ,EAAM5xB,GACjB,GAAI1J,GAAM+rC,EAAK,GAAIpyC,KAAM0T,GACvB,OAAOrN,GAAM+rC,EAAK,GAAIpyC,KAAM0T,OA4sCpC+mB,GAAO0iB,SA9qCP,SAAkBhjC,GAChB,OAz5YF,SAAsBA,GACpB,IAAIvR,EAAQ5D,GAAKmV,GACjB,OAAO,SAASgO,GACd,OAAOsY,GAAetY,EAAQhO,EAAQvR,IAs5YjCw0C,CAAa/e,GAAUlkB,EAAQmC,KA8qCxCme,GAAOwP,SAAWA,GAClBxP,GAAOsc,QAAUA,GACjBtc,GAAOzuB,OAtuHP,SAAgBzH,EAAW84C,GACzB,IAAI3sC,EAASoqB,GAAWv2B,GACxB,OAAqB,MAAd84C,EAAqB3sC,EAASktB,GAAWltB,EAAQ2sC,IAquH1D5iB,GAAO6iB,MAzuMP,SAASA,EAAM1qC,EAAMm9B,EAAO1B,GAE1B,IAAI39B,EAAS8hC,GAAW5/B,EAAMkK,EAAiBpd,EAAWA,EAAWA,EAAWA,EAAWA,EAD3FqwC,EAAQ1B,EAAQ3uC,EAAYqwC,GAG5B,OADAr/B,EAAOzI,YAAcq1C,EAAMr1C,YACpByI,GAsuMT+pB,GAAO8iB,WA7rMP,SAASA,EAAW3qC,EAAMm9B,EAAO1B,GAE/B,IAAI39B,EAAS8hC,GAAW5/B,EAAMmK,EAAuBrd,EAAWA,EAAWA,EAAWA,EAAWA,EADjGqwC,EAAQ1B,EAAQ3uC,EAAYqwC,GAG5B,OADAr/B,EAAOzI,YAAcs1C,EAAWt1C,YACzByI,GA0rMT+pB,GAAOgd,SAAWA,GAClBhd,GAAO5D,SAAWA,GAClB4D,GAAOkf,aAAeA,GACtBlf,GAAOid,MAAQA,GACfjd,GAAOkd,MAAQA,GACfld,GAAO0a,WAAaA,GACpB1a,GAAO2a,aAAeA,GACtB3a,GAAO4a,eAAiBA,GACxB5a,GAAO+iB,KAt0SP,SAAcx3B,EAAOwC,EAAG6lB,GACtB,IAAIhjC,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,OACvC,OAAKA,EAIE8+B,GAAUnkB,GADjBwC,EAAK6lB,GAAS7lB,IAAM9oB,EAAa,EAAIyyC,GAAU3pB,IACnB,EAAI,EAAIA,EAAGnd,OAi0SzCovB,GAAOgjB,UArySP,SAAmBz3B,EAAOwC,EAAG6lB,GAC3B,IAAIhjC,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,OACvC,OAAKA,EAKE8+B,GAAUnkB,EAAO,GADxBwC,EAAInd,GADJmd,EAAK6lB,GAAS7lB,IAAM9oB,EAAa,EAAIyyC,GAAU3pB,KAEhB,EAAI,EAAIA,OA+xSzCiS,GAAOijB,eAzvSP,SAAwB13B,EAAOO,GAC7B,OAAQP,GAASA,EAAM3a,OACnBwgC,GAAU7lB,EAAOuiB,GAAYhiB,EAAW,IAAI,GAAM,OAwvSxDkU,GAAOkjB,UAjtSP,SAAmB33B,EAAOO,GACxB,OAAQP,GAASA,EAAM3a,OACnBwgC,GAAU7lB,EAAOuiB,GAAYhiB,EAAW,IAAI,OAgtSlDkU,GAAOmjB,KA/qSP,SAAc53B,EAAOxc,EAAOigC,EAAOW,GACjC,IAAI/+B,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,OACvC,OAAKA,GAGDo+B,GAAyB,iBAATA,GAAqB6E,GAAetoB,EAAOxc,EAAOigC,KACpEA,EAAQ,EACRW,EAAM/+B,GAzvIV,SAAkB2a,EAAOxc,EAAOigC,EAAOW,GACrC,IAAI/+B,EAAS2a,EAAM3a,OAWnB,KATAo+B,EAAQ0I,GAAU1I,IACN,IACVA,GAASA,EAAQp+B,EAAS,EAAKA,EAASo+B,IAE1CW,EAAOA,IAAQ1qC,GAAa0qC,EAAM/+B,EAAUA,EAAS8mC,GAAU/H,IACrD,IACRA,GAAO/+B,GAET++B,EAAMX,EAAQW,EAAM,EAAI+O,GAAS/O,GAC1BX,EAAQW,GACbpkB,EAAMyjB,KAAWjgC,EAEnB,OAAOwc,EA4uIA63B,CAAS73B,EAAOxc,EAAOigC,EAAOW,QAuqSvC3P,GAAOqjB,OA3vOP,SAAgBr2B,EAAYlB,GAE1B,OADWmU,GAAQjT,GAAcjB,GAAc2b,IACnC1a,EAAY8gB,GAAYhiB,EAAW,KA0vOjDkU,GAAOsjB,QAvqOP,SAAiBt2B,EAAYvB,GAC3B,OAAOkc,GAAYxrB,GAAI6Q,EAAYvB,GAAW,IAuqOhDuU,GAAOujB,YAhpOP,SAAqBv2B,EAAYvB,GAC/B,OAAOkc,GAAYxrB,GAAI6Q,EAAYvB,GAAWvI,IAgpOhD8c,GAAOwjB,aAxnOP,SAAsBx2B,EAAYvB,EAAUmc,GAE1C,OADAA,EAAQA,IAAU3iC,EAAY,EAAIyyC,GAAU9P,GACrCD,GAAYxrB,GAAI6Q,EAAYvB,GAAWmc,IAunOhD5H,GAAO4Y,QAAUA,GACjB5Y,GAAOyjB,YAviSP,SAAqBl4B,GAEnB,OADsB,MAATA,GAAoBA,EAAM3a,OACvB+2B,GAAYpc,EAAOrI,OAsiSrC8c,GAAO0jB,aA/gSP,SAAsBn4B,EAAOqc,GAE3B,OADsB,MAATrc,GAAoBA,EAAM3a,OAKhC+2B,GAAYpc,EADnBqc,EAAQA,IAAU3iC,EAAY,EAAIyyC,GAAU9P,QA2gS9C5H,GAAO2jB,KAz9LP,SAAcxrC,GACZ,OAAO4/B,GAAW5/B,EAAMwK,IAy9L1Bqd,GAAO+gB,KAAOA,GACd/gB,GAAOghB,UAAYA,GACnBhhB,GAAO4jB,UA3/RP,SAAmB1c,GAKjB,IAJA,IAAI5xB,GAAS,EACT1E,EAAkB,MAATs2B,EAAgB,EAAIA,EAAMt2B,OACnCqF,OAEKX,EAAQ1E,GAAQ,CACvB,IAAI+mC,EAAOzQ,EAAM5xB,GACjBW,EAAO0hC,EAAK,IAAMA,EAAK,GAEzB,OAAO1hC,GAm/RT+pB,GAAO6jB,UA38GP,SAAmBn2B,GACjB,OAAiB,MAAVA,KAAsBwa,GAAcxa,EAAQnjB,GAAKmjB,KA28G1DsS,GAAO8jB,YAj7GP,SAAqBp2B,GACnB,OAAiB,MAAVA,KAAsBwa,GAAcxa,EAAQiX,GAAOjX,KAi7G5DsS,GAAO0c,QAAUA,GACjB1c,GAAO5zB,QA56RP,SAAiBmf,GAEf,OADsB,MAATA,GAAoBA,EAAM3a,OACvB8+B,GAAUnkB,EAAO,GAAI,OA26RvCyU,GAAOgb,aAAeA,GACtBhb,GAAOkb,eAAiBA,GACxBlb,GAAOmb,iBAAmBA,GAC1Bnb,GAAOof,OAASA,GAChBpf,GAAOqf,SAAWA,GAClBrf,GAAO2c,UAAYA,GACnB3c,GAAOvU,SAAWA,GAClBuU,GAAO4c,MAAQA,GACf5c,GAAOz1B,KAAOA,GACdy1B,GAAO2E,OAASA,GAChB3E,GAAO7jB,IAAMA,GACb6jB,GAAO+jB,QA1rGP,SAAiBr2B,EAAQjC,GACvB,IAAIxV,KAMJ,OALAwV,EAAWqiB,GAAYriB,EAAU,GAEjC2b,GAAW1Z,EAAQ,SAAS3e,EAAOoE,EAAKua,GACtCmV,GAAgB5sB,EAAQwV,EAAS1c,EAAOoE,EAAKua,GAAS3e,KAEjDkH,GAorGT+pB,GAAOgkB,UArpGP,SAAmBt2B,EAAQjC,GACzB,IAAIxV,KAMJ,OALAwV,EAAWqiB,GAAYriB,EAAU,GAEjC2b,GAAW1Z,EAAQ,SAAS3e,EAAOoE,EAAKua,GACtCmV,GAAgB5sB,EAAQ9C,EAAKsY,EAAS1c,EAAOoE,EAAKua,MAE7CzX,GA+oGT+pB,GAAOhlB,QAphCP,SAAiB0E,GACf,OAAOusB,GAAYrI,GAAUlkB,EAAQmC,KAohCvCme,GAAOikB,gBAh/BP,SAAyB5b,EAAMsD,GAC7B,OAAOK,GAAoB3D,EAAMzE,GAAU+H,EAAU9pB,KAg/BvDme,GAAOoa,QAAUA,GACjBpa,GAAOuf,MAAQA,GACfvf,GAAOmf,UAAYA,GACnBnf,GAAOihB,OAASA,GAChBjhB,GAAOkhB,SAAWA,GAClBlhB,GAAOmhB,MAAQA,GACfnhB,GAAOsd,OAASA,GAChBtd,GAAOkkB,OAzzBP,SAAgBn2B,GAEd,OADAA,EAAI2pB,GAAU3pB,GACPghB,GAAS,SAAS91B,GACvB,OAAOy0B,GAAQz0B,EAAM8U,MAuzBzBiS,GAAOwf,KAAOA,GACdxf,GAAOmkB,OAnhGP,SAAgBz2B,EAAQ5B,GACtB,OAAO4zB,GAAOhyB,EAAQ4vB,GAAOxP,GAAYhiB,MAmhG3CkU,GAAOokB,KA73LP,SAAcjsC,GACZ,OAAOmH,GAAO,EAAGnH,IA63LnB6nB,GAAOqkB,QAr4NP,SAAiBr3B,EAAY4gB,EAAWC,EAAQ+F,GAC9C,OAAkB,MAAd5mB,MAGCiT,GAAQ2N,KACXA,EAAyB,MAAbA,MAA0BA,IAGnC3N,GADL4N,EAAS+F,EAAQ3uC,EAAY4oC,KAE3BA,EAAmB,MAAVA,MAAuBA,IAE3BF,GAAY3gB,EAAY4gB,EAAWC,KA23N5C7N,GAAOohB,KAAOA,GACdphB,GAAOud,SAAWA,GAClBvd,GAAOqhB,UAAYA,GACnBrhB,GAAOshB,SAAWA,GAClBthB,GAAO0d,QAAUA,GACjB1d,GAAO2d,aAAeA,GACtB3d,GAAO6c,UAAYA,GACnB7c,GAAO3D,KAAOA,GACd2D,GAAO0f,OAASA,GAChB1f,GAAOkM,SAAWA,GAClBlM,GAAOskB,WA/rBP,SAAoB52B,GAClB,OAAO,SAAS2a,GACd,OAAiB,MAAV3a,EAAiBzoB,EAAYmjC,GAAQ1a,EAAQ2a,KA8rBxDrI,GAAOob,KAAOA,GACdpb,GAAOqb,QAAUA,GACjBrb,GAAOukB,UApsRP,SAAmBh5B,EAAOiB,EAAQf,GAChC,OAAQF,GAASA,EAAM3a,QAAU4b,GAAUA,EAAO5b,OAC9C89B,GAAYnjB,EAAOiB,EAAQshB,GAAYriB,EAAU,IACjDF,GAksRNyU,GAAOwkB,YAxqRP,SAAqBj5B,EAAOiB,EAAQJ,GAClC,OAAQb,GAASA,EAAM3a,QAAU4b,GAAUA,EAAO5b,OAC9C89B,GAAYnjB,EAAOiB,EAAQvnB,EAAWmnB,GACtCb,GAsqRNyU,GAAOsb,OAASA,GAChBtb,GAAOwhB,MAAQA,GACfxhB,GAAOyhB,WAAaA,GACpBzhB,GAAO4d,MAAQA,GACf5d,GAAOykB,OAxvNP,SAAgBz3B,EAAYlB,GAE1B,OADWmU,GAAQjT,GAAcjB,GAAc2b,IACnC1a,EAAYswB,GAAOxP,GAAYhiB,EAAW,MAuvNxDkU,GAAOl0B,OAzmRP,SAAgByf,EAAOO,GACrB,IAAI7V,KACJ,IAAMsV,IAASA,EAAM3a,OACnB,OAAOqF,EAET,IAAIX,GAAS,EACTuF,KACAjK,EAAS2a,EAAM3a,OAGnB,IADAkb,EAAYgiB,GAAYhiB,EAAW,KAC1BxW,EAAQ1E,GAAQ,CACvB,IAAI7B,EAAQwc,EAAMjW,GACdwW,EAAU/c,EAAOuG,EAAOiW,KAC1BtV,EAAOpC,KAAK9E,GACZ8L,EAAQhH,KAAKyB,IAIjB,OADAq5B,GAAWpjB,EAAO1Q,GACX5E,GAwlRT+pB,GAAOrjB,KAluLP,SAAcxE,EAAM62B,GAClB,GAAmB,mBAAR72B,EACT,MAAM,IAAIW,GAAUf,GAGtB,OAAOg3B,GAAS52B,EADhB62B,EAAQA,IAAU/pC,EAAY+pC,EAAQ0I,GAAU1I,KA+tLlDhP,GAAO1f,QAAUA,GACjB0f,GAAO0kB,WAhtNP,SAAoB13B,EAAYe,EAAG6lB,GAOjC,OALE7lB,GADG6lB,EAAQC,GAAe7mB,EAAYe,EAAG6lB,GAAS7lB,IAAM9oB,GACpD,EAEAyyC,GAAU3pB,IAELkS,GAAQjT,GAAcsV,GAAkB8M,IACvCpiB,EAAYe,IA0sN1BiS,GAAOlxB,IAv6FP,SAAa4e,EAAQ2a,EAAMt5B,GACzB,OAAiB,MAAV2e,EAAiBA,EAAS+gB,GAAQ/gB,EAAQ2a,EAAMt5B,IAu6FzDixB,GAAO2kB,QA54FP,SAAiBj3B,EAAQ2a,EAAMt5B,EAAO+0B,GAEpC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAa7+B,EAC3C,MAAVyoB,EAAiBA,EAAS+gB,GAAQ/gB,EAAQ2a,EAAMt5B,EAAO+0B,IA24FhE9D,GAAO4kB,QA1rNP,SAAiB53B,GAEf,OADWiT,GAAQjT,GAAc0V,GAAe+M,IACpCziB,IAyrNdgT,GAAOxqB,MAhjRP,SAAe+V,EAAOyjB,EAAOW,GAC3B,IAAI/+B,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,OACvC,OAAKA,GAGD++B,GAAqB,iBAAPA,GAAmBkE,GAAetoB,EAAOyjB,EAAOW,IAChEX,EAAQ,EACRW,EAAM/+B,IAGNo+B,EAAiB,MAATA,EAAgB,EAAI0I,GAAU1I,GACtCW,EAAMA,IAAQ1qC,EAAY2L,EAAS8mC,GAAU/H,IAExCD,GAAUnkB,EAAOyjB,EAAOW,QAoiRjC3P,GAAO8c,OAASA,GAChB9c,GAAO6kB,WAx3QP,SAAoBt5B,GAClB,OAAQA,GAASA,EAAM3a,OACnBggC,GAAerlB,OAu3QrByU,GAAO8kB,aAn2QP,SAAsBv5B,EAAOE,GAC3B,OAAQF,GAASA,EAAM3a,OACnBggC,GAAerlB,EAAOuiB,GAAYriB,EAAU,QAk2QlDuU,GAAOn0B,MA5hEP,SAAemL,EAAQ+tC,EAAWC,GAKhC,OAJIA,GAAyB,iBAATA,GAAqBnR,GAAe78B,EAAQ+tC,EAAWC,KACzED,EAAYC,EAAQ//C,IAEtB+/C,EAAQA,IAAU//C,EAAYqe,EAAmB0hC,IAAU,IAI3DhuC,EAASO,GAASP,MAEQ,iBAAb+tC,GACO,MAAbA,IAAsB95B,GAAS85B,OAEpCA,EAAYjU,GAAaiU,KACP/pB,GAAWhkB,GACpBi7B,GAAUvW,GAAc1kB,GAAS,EAAGguC,GAGxChuC,EAAOnL,MAAMk5C,EAAWC,OA2gEjChlB,GAAOilB,OAnsLP,SAAgB9sC,EAAM62B,GACpB,GAAmB,mBAAR72B,EACT,MAAM,IAAIW,GAAUf,GAGtB,OADAi3B,EAAiB,MAATA,EAAgB,EAAIh3B,GAAU0/B,GAAU1I,GAAQ,GACjDD,GAAS,SAAS91B,GACvB,IAAIsS,EAAQtS,EAAK+1B,GACbyK,EAAYxH,GAAUh5B,EAAM,EAAG+1B,GAKnC,OAHIzjB,GACFgB,GAAUktB,EAAWluB,GAEhB3f,GAAMuM,EAAM5S,KAAMk0C,MAwrL7BzZ,GAAOklB,KAl1QP,SAAc35B,GACZ,IAAI3a,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,OACvC,OAAOA,EAAS8+B,GAAUnkB,EAAO,EAAG3a,OAi1QtCovB,GAAOmlB,KArzQP,SAAc55B,EAAOwC,EAAG6lB,GACtB,OAAMroB,GAASA,EAAM3a,OAId8+B,GAAUnkB,EAAO,GADxBwC,EAAK6lB,GAAS7lB,IAAM9oB,EAAa,EAAIyyC,GAAU3pB,IAChB,EAAI,EAAIA,OAizQzCiS,GAAOolB,UArxQP,SAAmB75B,EAAOwC,EAAG6lB,GAC3B,IAAIhjC,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,OACvC,OAAKA,EAKE8+B,GAAUnkB,GADjBwC,EAAInd,GADJmd,EAAK6lB,GAAS7lB,IAAM9oB,EAAa,EAAIyyC,GAAU3pB,KAEnB,EAAI,EAAIA,EAAGnd,OA+wQzCovB,GAAOqlB,eAzuQP,SAAwB95B,EAAOO,GAC7B,OAAQP,GAASA,EAAM3a,OACnBwgC,GAAU7lB,EAAOuiB,GAAYhiB,EAAW,IAAI,GAAO,OAwuQzDkU,GAAOslB,UAjsQP,SAAmB/5B,EAAOO,GACxB,OAAQP,GAASA,EAAM3a,OACnBwgC,GAAU7lB,EAAOuiB,GAAYhiB,EAAW,QAgsQ9CkU,GAAOulB,IApuPP,SAAax2C,EAAOqtC,GAElB,OADAA,EAAYrtC,GACLA,GAmuPTixB,GAAOwlB,SA9oLP,SAAkBrtC,EAAMC,EAAMhR,GAC5B,IAAIuR,GAAU,EACVE,GAAW,EAEf,GAAmB,mBAARV,EACT,MAAM,IAAIW,GAAUf,GAMtB,OAJIF,GAASzQ,KACXuR,EAAU,YAAavR,IAAYA,EAAQuR,QAAUA,EACrDE,EAAW,aAAczR,IAAYA,EAAQyR,SAAWA,GAEnDmkC,GAAS7kC,EAAMC,GACpBO,QAAWA,EACXJ,QAAWH,EACXS,SAAYA,KAioLhBmnB,GAAO4U,KAAOA,GACd5U,GAAOqe,QAAUA,GACjBre,GAAO2f,QAAUA,GACjB3f,GAAO4f,UAAYA,GACnB5f,GAAOylB,OArfP,SAAgB12C,GACd,OAAIkxB,GAAQlxB,GACHsd,GAAStd,EAAOw5B,IAElBd,GAAS14B,IAAUA,GAASyzB,GAAUuP,GAAax6B,GAASxI,MAkfrEixB,GAAOwN,cAAgBA,GACvBxN,GAAOttB,UA10FP,SAAmBgb,EAAQjC,EAAUC,GACnC,IAAImW,EAAQ5B,GAAQvS,GAChBg4B,EAAY7jB,GAASvD,GAAS5Q,IAAWrC,GAAaqC,GAG1D,GADAjC,EAAWqiB,GAAYriB,EAAU,GACd,MAAfC,EAAqB,CACvB,IAAIqZ,EAAOrX,GAAUA,EAAO3jB,YAE1B2hB,EADEg6B,EACY7jB,EAAQ,IAAIkD,KAEnBltB,GAAS6V,IACFya,GAAWpD,GAAQ1E,GAAWlD,GAAazP,OAS7D,OAHCg4B,EAAY/5B,GAAYyb,IAAY1Z,EAAQ,SAAS3e,EAAOuG,EAAOoY,GAClE,OAAOjC,EAASC,EAAa3c,EAAOuG,EAAOoY,KAEtChC,GAuzFTsU,GAAO2lB,MArnLP,SAAextC,GACb,OAAO0E,GAAI1E,EAAM,IAqnLnB6nB,GAAOub,MAAQA,GACfvb,GAAOwb,QAAUA,GACjBxb,GAAOyb,UAAYA,GACnBzb,GAAO4lB,KAzmQP,SAAcr6B,GACZ,OAAQA,GAASA,EAAM3a,OAAUmgC,GAASxlB,OAymQ5CyU,GAAO6lB,OA/kQP,SAAgBt6B,EAAOE,GACrB,OAAQF,GAASA,EAAM3a,OAAUmgC,GAASxlB,EAAOuiB,GAAYriB,EAAU,QA+kQzEuU,GAAO8lB,SAxjQP,SAAkBv6B,EAAOa,GAEvB,OADAA,EAAkC,mBAAdA,EAA2BA,EAAannB,EACpDsmB,GAASA,EAAM3a,OAAUmgC,GAASxlB,EAAOtmB,EAAWmnB,OAujQ9D4T,GAAO+lB,MAhyFP,SAAer4B,EAAQ2a,GACrB,OAAiB,MAAV3a,GAAwBmhB,GAAUnhB,EAAQ2a,IAgyFnDrI,GAAO0b,MAAQA,GACf1b,GAAO4b,UAAYA,GACnB5b,GAAO93B,OApwFP,SAAgBwlB,EAAQ2a,EAAM8I,GAC5B,OAAiB,MAAVzjB,EAAiBA,EAASwjB,GAAWxjB,EAAQ2a,EAAMyJ,GAAaX,KAowFzEnR,GAAOgmB,WAzuFP,SAAoBt4B,EAAQ2a,EAAM8I,EAASrN,GAEzC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAa7+B,EAC3C,MAAVyoB,EAAiBA,EAASwjB,GAAWxjB,EAAQ2a,EAAMyJ,GAAaX,GAAUrN,IAwuFnF9D,GAAOxT,OAASA,GAChBwT,GAAOimB,SAhrFP,SAAkBv4B,GAChB,OAAiB,MAAVA,KAAsBQ,GAAWR,EAAQiX,GAAOjX,KAgrFzDsS,GAAO6b,QAAUA,GACjB7b,GAAOkU,MAAQA,GACflU,GAAOkmB,KA3mLP,SAAcn3C,EAAOgE,GACnB,OAAO2qC,GAAQ5L,GAAa/+B,GAAUhE,IA2mLxCixB,GAAO8b,IAAMA,GACb9b,GAAO+b,MAAQA,GACf/b,GAAOgc,QAAUA,GACjBhc,GAAOic,IAAMA,GACbjc,GAAOmmB,UAj3PP,SAAmBh4C,EAAOqe,GACxB,OAAOklB,GAAcvjC,MAAaqe,MAAcsW,KAi3PlD9C,GAAOomB,cA/1PP,SAAuBj4C,EAAOqe,GAC5B,OAAOklB,GAAcvjC,MAAaqe,MAAciiB,KA+1PlDzO,GAAOkc,QAAUA,GAGjBlc,GAAOmB,QAAUwe,GACjB3f,GAAOqmB,UAAYzG,GACnB5f,GAAOsmB,OAAS1H,GAChB5e,GAAOumB,WAAa1H,GAGpBsC,GAAMnhB,GAAQA,IAKdA,GAAOr0B,IAAMA,GACbq0B,GAAO4gB,QAAUA,GACjB5gB,GAAO6f,UAAYA,GACnB7f,GAAOggB,WAAaA,GACpBhgB,GAAOhC,KAAOA,GACdgC,GAAOwmB,MAprFP,SAAe/iB,EAAQC,EAAOC,GAa5B,OAZIA,IAAU1+B,IACZ0+B,EAAQD,EACRA,EAAQz+B,GAEN0+B,IAAU1+B,IAEZ0+B,GADAA,EAAQ7rB,GAAS6rB,KACCA,EAAQA,EAAQ,GAEhCD,IAAUz+B,IAEZy+B,GADAA,EAAQ5rB,GAAS4rB,KACCA,EAAQA,EAAQ,GAE7BjB,GAAU3qB,GAAS2rB,GAASC,EAAOC,IAwqF5C3D,GAAOya,MA7jLP,SAAe1rC,GACb,OAAO60B,GAAU70B,EAAOgT,IA6jL1Bie,GAAOymB,UApgLP,SAAmB13C,GACjB,OAAO60B,GAAU70B,EAAO8S,EAAkBE,IAogL5Cie,GAAO0mB,cAr+KP,SAAuB33C,EAAO+0B,GAE5B,OAAOF,GAAU70B,EAAO8S,EAAkBE,EAD1C+hB,EAAkC,mBAAdA,EAA2BA,EAAa7+B,IAq+K9D+6B,GAAO2mB,UA7hLP,SAAmB53C,EAAO+0B,GAExB,OAAOF,GAAU70B,EAAOgT,EADxB+hB,EAAkC,mBAAdA,EAA2BA,EAAa7+B,IA6hL9D+6B,GAAO4mB,WA18KP,SAAoBl5B,EAAQhO,GAC1B,OAAiB,MAAVA,GAAkBsmB,GAAetY,EAAQhO,EAAQnV,GAAKmV,KA08K/DsgB,GAAOmU,OAASA,GAChBnU,GAAO6mB,UA1xCP,SAAmB93C,EAAOynC,GACxB,OAAiB,MAATznC,GAAiBA,GAAUA,EAASynC,EAAeznC,GA0xC7DixB,GAAO4hB,OAASA,GAChB5hB,GAAO8mB,SAz9EP,SAAkB9vC,EAAQlG,EAAQi2C,GAChC/vC,EAASO,GAASP,GAClBlG,EAASggC,GAAahgC,GAEtB,IAAIF,EAASoG,EAAOpG,OAKhB++B,EAJJoX,EAAWA,IAAa9hD,EACpB2L,EACA6xB,GAAUiV,GAAUqP,GAAW,EAAGn2C,GAItC,OADAm2C,GAAYj2C,EAAOF,SACA,GAAKoG,EAAOxB,MAAMuxC,EAAUpX,IAAQ7+B,GA+8EzDkvB,GAAO4C,GAAKA,GACZ5C,GAAO0G,OAj7EP,SAAgB1vB,GAEd,OADAA,EAASO,GAASP,KACA8O,GAAmB3V,KAAK6G,GACtCA,EAAOjH,QAAQ4V,GAAiB8U,IAChCzjB,GA86ENgpB,GAAOgnB,aA55EP,SAAsBhwC,GAEpB,OADAA,EAASO,GAASP,KACAsP,GAAgBnW,KAAK6G,GACnCA,EAAOjH,QAAQsW,GAAc,QAC7BrP,GAy5ENgpB,GAAOj0B,MA57OP,SAAeihB,EAAYlB,EAAW8nB,GACpC,IAAIz7B,EAAO8nB,GAAQjT,GAAcnB,GAAa0b,GAI9C,OAHIqM,GAASC,GAAe7mB,EAAYlB,EAAW8nB,KACjD9nB,EAAY7mB,GAEPkT,EAAK6U,EAAY8gB,GAAYhiB,EAAW,KAw7OjDkU,GAAOuc,KAAOA,GACdvc,GAAO6a,UAAYA,GACnB7a,GAAOinB,QArxHP,SAAiBv5B,EAAQ5B,GACvB,OAAOiB,GAAYW,EAAQogB,GAAYhiB,EAAW,GAAIsb,KAqxHxDpH,GAAOwc,SAAWA,GAClBxc,GAAO8a,cAAgBA,GACvB9a,GAAOknB,YAjvHP,SAAqBx5B,EAAQ5B,GAC3B,OAAOiB,GAAYW,EAAQogB,GAAYhiB,EAAW,GAAIwb,KAivHxDtH,GAAO9B,MAAQA,GACf8B,GAAOx1B,QAAUA,GACjBw1B,GAAOyc,aAAeA,GACtBzc,GAAOmnB,MArtHP,SAAez5B,EAAQjC,GACrB,OAAiB,MAAViC,EACHA,EACAqa,GAAQra,EAAQogB,GAAYriB,EAAU,GAAIkZ,KAmtHhD3E,GAAOonB,WAtrHP,SAAoB15B,EAAQjC,GAC1B,OAAiB,MAAViC,EACHA,EACAua,GAAava,EAAQogB,GAAYriB,EAAU,GAAIkZ,KAorHrD3E,GAAOqnB,OArpHP,SAAgB35B,EAAQjC,GACtB,OAAOiC,GAAU0Z,GAAW1Z,EAAQogB,GAAYriB,EAAU,KAqpH5DuU,GAAOsnB,YAxnHP,SAAqB55B,EAAQjC,GAC3B,OAAOiC,GAAU4Z,GAAgB5Z,EAAQogB,GAAYriB,EAAU,KAwnHjEuU,GAAOpxB,IAAMA,GACboxB,GAAO6d,GAAKA,GACZ7d,GAAO8d,IAAMA,GACb9d,GAAO3R,IAzgHP,SAAaX,EAAQ2a,GACnB,OAAiB,MAAV3a,GAAkBurB,GAAQvrB,EAAQ2a,EAAMQ,KAygHjD7I,GAAO+M,MAAQA,GACf/M,GAAO+a,KAAOA,GACd/a,GAAO+L,SAAWA,GAClB/L,GAAOmG,SA5pOP,SAAkBnZ,EAAYje,EAAOoe,EAAWymB,GAC9C5mB,EAAa0f,GAAY1f,GAAcA,EAAaR,GAAOQ,GAC3DG,EAAaA,IAAcymB,EAAS8D,GAAUvqB,GAAa,EAE3D,IAAIvc,EAASoc,EAAWpc,OAIxB,OAHIuc,EAAY,IACdA,EAAYnV,GAAUpH,EAASuc,EAAW,IAErC+wB,GAASlxB,GACXG,GAAavc,GAAUoc,EAAW3X,QAAQtG,EAAOoe,IAAc,IAC7Dvc,GAAUsb,GAAYc,EAAYje,EAAOoe,IAAc,GAmpOhE6S,GAAO3qB,QA9lSP,SAAiBkW,EAAOxc,EAAOoe,GAC7B,IAAIvc,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAI0E,EAAqB,MAAb6X,EAAoB,EAAIuqB,GAAUvqB,GAI9C,OAHI7X,EAAQ,IACVA,EAAQ0C,GAAUpH,EAAS0E,EAAO,IAE7B4W,GAAYX,EAAOxc,EAAOuG,IAslSnC0qB,GAAOunB,QAlqFP,SAAiB9jB,EAAQuL,EAAOW,GAS9B,OARAX,EAAQgI,GAAShI,GACbW,IAAQ1qC,GACV0qC,EAAMX,EACNA,EAAQ,GAERW,EAAMqH,GAASrH,GArsVnB,SAAqBlM,EAAQuL,EAAOW,GAClC,OAAOlM,GAAUxrB,GAAU+2B,EAAOW,IAAQlM,EAASzrB,GAAUg3B,EAAOW,GAusV7D6X,CADP/jB,EAAS3rB,GAAS2rB,GACSuL,EAAOW,IA0pFpC3P,GAAOsf,OAASA,GAChBtf,GAAO+B,YAAcA,GACrB/B,GAAOC,QAAUA,GACjBD,GAAOrV,cAAgBA,GACvBqV,GAAO0M,YAAcA,GACrB1M,GAAOsN,kBAAoBA,GAC3BtN,GAAOynB,UAtwKP,SAAmB14C,GACjB,OAAiB,IAAVA,IAA4B,IAAVA,GACtBsS,GAAatS,IAAUqS,GAAWrS,IAAU8U,GAqwKjDmc,GAAO1B,SAAWA,GAClB0B,GAAOnV,OAASA,GAChBmV,GAAO0nB,UA7sKP,SAAmB34C,GACjB,OAAOsS,GAAatS,IAA6B,IAAnBA,EAAMjJ,WAAmBynC,GAAcx+B,IA6sKvEixB,GAAO2nB,QAzqKP,SAAiB54C,GACf,GAAa,MAATA,EACF,OAAO,EAET,GAAI29B,GAAY39B,KACXkxB,GAAQlxB,IAA0B,iBAATA,GAA4C,mBAAhBA,EAAMgP,QAC1DugB,GAASvvB,IAAUsc,GAAatc,IAAUgzB,GAAYhzB,IAC1D,OAAQA,EAAM6B,OAEhB,IAAI+G,EAAM0sB,GAAOt1B,GACjB,GAAI4I,GAAOwM,GAAUxM,GAAO6M,GAC1B,OAAQzV,EAAM0L,KAEhB,GAAI2xB,GAAYr9B,GACd,OAAQo9B,GAASp9B,GAAO6B,OAE1B,IAAK,IAAIuC,KAAOpE,EACd,GAAIsI,GAAehS,KAAK0J,EAAOoE,GAC7B,OAAO,EAGX,OAAO,GAqpKT6sB,GAAO4nB,QAtnKP,SAAiB74C,EAAO65B,GACtB,OAAOe,GAAY56B,EAAO65B,IAsnK5B5I,GAAO6nB,YAnlKP,SAAqB94C,EAAO65B,EAAO9E,GAEjC,IAAI7tB,GADJ6tB,EAAkC,mBAAdA,EAA2BA,EAAa7+B,GAClC6+B,EAAW/0B,EAAO65B,GAAS3jC,EACrD,OAAOgR,IAAWhR,EAAY0kC,GAAY56B,EAAO65B,EAAO3jC,EAAW6+B,KAAgB7tB,GAilKrF+pB,GAAO+d,QAAUA,GACjB/d,GAAOxB,SA1hKP,SAAkBzvB,GAChB,MAAuB,iBAATA,GAAqBwvB,GAAexvB,IA0hKpDixB,GAAOmI,WAAaA,GACpBnI,GAAOge,UAAYA,GACnBhe,GAAOmZ,SAAWA,GAClBnZ,GAAOjV,MAAQA,GACfiV,GAAO8nB,QA11JP,SAAiBp6B,EAAQhO,GACvB,OAAOgO,IAAWhO,GAAU8rB,GAAY9d,EAAQhO,EAAQitB,GAAajtB,KA01JvEsgB,GAAO+nB,YAvzJP,SAAqBr6B,EAAQhO,EAAQokB,GAEnC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAa7+B,EACrDumC,GAAY9d,EAAQhO,EAAQitB,GAAajtB,GAASokB,IAszJ3D9D,GAAOgoB,MAvxJP,SAAej5C,GAIb,OAAOkvC,GAASlvC,IAAUA,IAAUA,GAoxJtCixB,GAAOioB,SAvvJP,SAAkBl5C,GAChB,GAAIwqC,GAAWxqC,GACb,MAAM,IAAIsE,EAAMmO,GAElB,OAAOoqB,GAAa78B,IAovJtBixB,GAAOkoB,MAxsJP,SAAen5C,GACb,OAAgB,MAATA,GAwsJTixB,GAAOmoB,OAjuJP,SAAgBp5C,GACd,OAAiB,OAAVA,GAiuJTixB,GAAOie,SAAWA,GAClBje,GAAOnoB,SAAWA,GAClBmoB,GAAO3e,aAAeA,GACtB2e,GAAOuN,cAAgBA,GACvBvN,GAAO/U,SAAWA,GAClB+U,GAAOooB,cArlJP,SAAuBr5C,GACrB,OAAOivC,GAAUjvC,IAAUA,IAAUoU,GAAoBpU,GAASoU,GAqlJpE6c,GAAO7U,MAAQA,GACf6U,GAAOke,SAAWA,GAClBle,GAAOyH,SAAWA,GAClBzH,GAAO3U,aAAeA,GACtB2U,GAAOqoB,YAn/IP,SAAqBt5C,GACnB,OAAOA,IAAU9J,GAm/InB+6B,GAAOsoB,UA/9IP,SAAmBv5C,GACjB,OAAOsS,GAAatS,IAAUs1B,GAAOt1B,IAAU2V,IA+9IjDsb,GAAOuoB,UA38IP,SAAmBx5C,GACjB,OAAOsS,GAAatS,IAAUqS,GAAWrS,IAAU4V,IA28IrDqb,GAAO5hB,KAz/RP,SAAcmN,EAAOw5B,GACnB,OAAgB,MAATx5B,EAAgB,GAAKkT,GAAWp5B,KAAKkmB,EAAOw5B,IAy/RrD/kB,GAAOkgB,UAAYA,GACnBlgB,GAAOyJ,KAAOA,GACdzJ,GAAOwoB,YAh9RP,SAAqBj9B,EAAOxc,EAAOoe,GACjC,IAAIvc,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAI0E,EAAQ1E,EAKZ,OAJIuc,IAAcloB,IAEhBqQ,GADAA,EAAQoiC,GAAUvqB,IACF,EAAInV,GAAUpH,EAAS0E,EAAO,GAAK2C,GAAU3C,EAAO1E,EAAS,IAExE7B,GAAUA,EArvMrB,SAA2Bwc,EAAOxc,EAAOoe,GAEvC,IADA,IAAI7X,EAAQ6X,EAAY,EACjB7X,KACL,GAAIiW,EAAMjW,KAAWvG,EACnB,OAAOuG,EAGX,OAAOA,EA+uMDmzC,CAAkBl9B,EAAOxc,EAAOuG,GAChC4X,GAAc3B,EAAO+B,GAAWhY,GAAO,IAq8R7C0qB,GAAOmgB,UAAYA,GACnBngB,GAAOogB,WAAaA,GACpBpgB,GAAOme,GAAKA,GACZne,GAAOoe,IAAMA,GACbpe,GAAOx5B,IAhfP,SAAa+kB,GACX,OAAQA,GAASA,EAAM3a,OACnB42B,GAAajc,EAAOwgB,GAAUpD,IAC9B1jC,GA8eN+6B,GAAO0oB,MApdP,SAAen9B,EAAOE,GACpB,OAAQF,GAASA,EAAM3a,OACnB42B,GAAajc,EAAOuiB,GAAYriB,EAAU,GAAIkd,IAC9C1jC,GAkdN+6B,GAAO2oB,KAjcP,SAAcp9B,GACZ,OAAOiC,GAASjC,EAAOwgB,KAiczB/L,GAAO4oB,OAvaP,SAAgBr9B,EAAOE,GACrB,OAAO+B,GAASjC,EAAOuiB,GAAYriB,EAAU,KAua/CuU,GAAO9nB,IAlZP,SAAaqT,GACX,OAAQA,GAASA,EAAM3a,OACnB42B,GAAajc,EAAOwgB,GAAUS,IAC9BvnC,GAgZN+6B,GAAO6oB,MAtXP,SAAet9B,EAAOE,GACpB,OAAQF,GAASA,EAAM3a,OACnB42B,GAAajc,EAAOuiB,GAAYriB,EAAU,GAAI+gB,IAC9CvnC,GAoXN+6B,GAAOgZ,UAAYA,GACnBhZ,GAAOwZ,UAAYA,GACnBxZ,GAAO8oB,WAztBP,WACE,UAytBF9oB,GAAO+oB,WAzsBP,WACE,MAAO,IAysBT/oB,GAAOgpB,SAzrBP,WACE,OAAO,GAyrBThpB,GAAO+hB,SAAWA,GAClB/hB,GAAOipB,IA77RP,SAAa19B,EAAOwC,GAClB,OAAQxC,GAASA,EAAM3a,OAAU88B,GAAQniB,EAAOmsB,GAAU3pB,IAAM9oB,GA67RlE+6B,GAAOkpB,WAliCP,WAIE,OAHIxyC,GAAKnH,IAAMhK,OACbmR,GAAKnH,EAAIutB,IAEJv3B,MA+hCTy6B,GAAO4X,KAAOA,GACd5X,GAAOnpB,IAAMA,GACbmpB,GAAOmpB,IAj5EP,SAAanyC,EAAQpG,EAAQgmC,GAC3B5/B,EAASO,GAASP,GAGlB,IAAIoyC,GAFJx4C,EAAS8mC,GAAU9mC,IAEM2qB,GAAWvkB,GAAU,EAC9C,IAAKpG,GAAUw4C,GAAax4C,EAC1B,OAAOoG,EAET,IAAIi5B,GAAOr/B,EAASw4C,GAAa,EACjC,OACEzS,GAAc1Y,GAAYgS,GAAM2G,GAChC5/B,EACA2/B,GAAc5Y,GAAWkS,GAAM2G,IAs4EnC5W,GAAOqpB,OA32EP,SAAgBryC,EAAQpG,EAAQgmC,GAC9B5/B,EAASO,GAASP,GAGlB,IAAIoyC,GAFJx4C,EAAS8mC,GAAU9mC,IAEM2qB,GAAWvkB,GAAU,EAC9C,OAAQpG,GAAUw4C,EAAYx4C,EACzBoG,EAAS2/B,GAAc/lC,EAASw4C,EAAWxS,GAC5C5/B,GAq2ENgpB,GAAOspB,SA30EP,SAAkBtyC,EAAQpG,EAAQgmC,GAChC5/B,EAASO,GAASP,GAGlB,IAAIoyC,GAFJx4C,EAAS8mC,GAAU9mC,IAEM2qB,GAAWvkB,GAAU,EAC9C,OAAQpG,GAAUw4C,EAAYx4C,EACzB+lC,GAAc/lC,EAASw4C,EAAWxS,GAAS5/B,EAC5CA,GAq0ENgpB,GAAO/V,SA1yEP,SAAkBjT,EAAQuyC,EAAO3V,GAM/B,OALIA,GAAkB,MAAT2V,EACXA,EAAQ,EACCA,IACTA,GAASA,GAEJ3qB,GAAernB,GAASP,GAAQjH,QAAQgH,GAAa,IAAKwyC,GAAS,IAqyE5EvpB,GAAOlB,OA1rFP,SAAgB4E,EAAOC,EAAO6lB,GA2B5B,GA1BIA,GAA+B,kBAAZA,GAAyB3V,GAAenQ,EAAOC,EAAO6lB,KAC3E7lB,EAAQ6lB,EAAWvkD,GAEjBukD,IAAavkD,IACK,kBAAT0+B,GACT6lB,EAAW7lB,EACXA,EAAQ1+B,GAEe,kBAATy+B,IACd8lB,EAAW9lB,EACXA,EAAQz+B,IAGRy+B,IAAUz+B,GAAa0+B,IAAU1+B,GACnCy+B,EAAQ,EACRC,EAAQ,IAGRD,EAAQsT,GAAStT,GACbC,IAAU1+B,GACZ0+B,EAAQD,EACRA,EAAQ,GAERC,EAAQqT,GAASrT,IAGjBD,EAAQC,EAAO,CACjB,IAAI8lB,EAAO/lB,EACXA,EAAQC,EACRA,EAAQ8lB,EAEV,GAAID,GAAY9lB,EAAQ,GAAKC,EAAQ,EAAG,CACtC,IAAIwW,EAAOtb,KACX,OAAO5mB,GAAUyrB,EAASyW,GAAQxW,EAAQD,EAAQ5Z,GAAe,QAAUqwB,EAAO,IAAIvpC,OAAS,KAAO+yB,GAExG,OAAOtB,GAAWqB,EAAOC,IAupF3B3D,GAAO0pB,OA5+NP,SAAgB18B,EAAYvB,EAAUC,GACpC,IAAIvT,EAAO8nB,GAAQjT,GAAcP,GAAcmB,GAC3ClB,EAAY/S,UAAU/I,OAAS,EAEnC,OAAOuH,EAAK6U,EAAY8gB,GAAYriB,EAAU,GAAIC,EAAagB,EAAWwW,KAy+N5ElD,GAAO2pB,YAh9NP,SAAqB38B,EAAYvB,EAAUC,GACzC,IAAIvT,EAAO8nB,GAAQjT,GAAcL,GAAmBiB,GAChDlB,EAAY/S,UAAU/I,OAAS,EAEnC,OAAOuH,EAAK6U,EAAY8gB,GAAYriB,EAAU,GAAIC,EAAagB,EAAW2a,KA68N5ErH,GAAO4pB,OA/wEP,SAAgB5yC,EAAQ+W,EAAG6lB,GAMzB,OAJE7lB,GADG6lB,EAAQC,GAAe78B,EAAQ+W,EAAG6lB,GAAS7lB,IAAM9oB,GAChD,EAEAyyC,GAAU3pB,GAET+gB,GAAWv3B,GAASP,GAAS+W,IA0wEtCiS,GAAOjwB,QApvEP,WACE,IAAIkJ,EAAOU,UACP3C,EAASO,GAAS0B,EAAK,IAE3B,OAAOA,EAAKrI,OAAS,EAAIoG,EAASA,EAAOjH,QAAQkJ,EAAK,GAAIA,EAAK,KAivEjE+mB,GAAO/pB,OAtoGP,SAAgByX,EAAQ2a,EAAMmO,GAG5B,IAAIlhC,GAAS,EACT1E,GAHJy3B,EAAOC,GAASD,EAAM3a,IAGJ9c,OAOlB,IAJKA,IACHA,EAAS,EACT8c,EAASzoB,KAEFqQ,EAAQ1E,GAAQ,CACvB,IAAI7B,EAAkB,MAAV2e,EAAiBzoB,EAAYyoB,EAAO6a,GAAMF,EAAK/yB,KACvDvG,IAAU9J,IACZqQ,EAAQ1E,EACR7B,EAAQynC,GAEV9oB,EAASya,GAAWp5B,GAASA,EAAM1J,KAAKqoB,GAAU3e,EAEpD,OAAO2e,GAonGTsS,GAAO73B,MAAQA,GACf63B,GAAO7D,aAAeA,EACtB6D,GAAO6pB,OA15NP,SAAgB78B,GAEd,OADWiT,GAAQjT,GAAcoV,GAAc+M,IACnCniB,IAy5NdgT,GAAOvlB,KA/0NP,SAAcuS,GACZ,GAAkB,MAAdA,EACF,OAAO,EAET,GAAI0f,GAAY1f,GACd,OAAOkxB,GAASlxB,GAAcuO,GAAWvO,GAAcA,EAAWpc,OAEpE,IAAI+G,EAAM0sB,GAAOrX,GACjB,OAAIrV,GAAOwM,GAAUxM,GAAO6M,GACnBwI,EAAWvS,KAEb0xB,GAASnf,GAAYpc,QAq0N9BovB,GAAOqgB,UAAYA,GACnBrgB,GAAO8pB,KA/xNP,SAAc98B,EAAYlB,EAAW8nB,GACnC,IAAIz7B,EAAO8nB,GAAQjT,GAAcJ,GAAYgjB,GAI7C,OAHIgE,GAASC,GAAe7mB,EAAYlB,EAAW8nB,KACjD9nB,EAAY7mB,GAEPkT,EAAK6U,EAAY8gB,GAAYhiB,EAAW,KA2xNjDkU,GAAO+pB,YAhsRP,SAAqBx+B,EAAOxc,GAC1B,OAAO8gC,GAAgBtkB,EAAOxc,IAgsRhCixB,GAAOgqB,cApqRP,SAAuBz+B,EAAOxc,EAAO0c,GACnC,OAAOykB,GAAkB3kB,EAAOxc,EAAO++B,GAAYriB,EAAU,KAoqR/DuU,GAAOiqB,cAjpRP,SAAuB1+B,EAAOxc,GAC5B,IAAI6B,EAAkB,MAAT2a,EAAgB,EAAIA,EAAM3a,OACvC,GAAIA,EAAQ,CACV,IAAI0E,EAAQu6B,GAAgBtkB,EAAOxc,GACnC,GAAIuG,EAAQ1E,GAAUgyB,GAAGrX,EAAMjW,GAAQvG,GACrC,OAAOuG,EAGX,OAAQ,GA0oRV0qB,GAAOkqB,gBArnRP,SAAyB3+B,EAAOxc,GAC9B,OAAO8gC,GAAgBtkB,EAAOxc,GAAO,IAqnRvCixB,GAAOmqB,kBAzlRP,SAA2B5+B,EAAOxc,EAAO0c,GACvC,OAAOykB,GAAkB3kB,EAAOxc,EAAO++B,GAAYriB,EAAU,IAAI,IAylRnEuU,GAAOoqB,kBAtkRP,SAA2B7+B,EAAOxc,GAEhC,GADsB,MAATwc,GAAoBA,EAAM3a,OAC3B,CACV,IAAI0E,EAAQu6B,GAAgBtkB,EAAOxc,GAAO,GAAQ,EAClD,GAAI6zB,GAAGrX,EAAMjW,GAAQvG,GACnB,OAAOuG,EAGX,OAAQ,GA+jRV0qB,GAAOsgB,UAAYA,GACnBtgB,GAAOqqB,WA3oEP,SAAoBrzC,EAAQlG,EAAQi2C,GAOlC,OANA/vC,EAASO,GAASP,GAClB+vC,EAAuB,MAAZA,EACP,EACAtkB,GAAUiV,GAAUqP,GAAW,EAAG/vC,EAAOpG,QAE7CE,EAASggC,GAAahgC,GACfkG,EAAOxB,MAAMuxC,EAAUA,EAAWj2C,EAAOF,SAAWE,GAqoE7DkvB,GAAOkiB,SAAWA,GAClBliB,GAAOsqB,IAzUP,SAAa/+B,GACX,OAAQA,GAASA,EAAM3a,OACnB6c,GAAQlC,EAAOwgB,IACf,GAuUN/L,GAAOuqB,MA7SP,SAAeh/B,EAAOE,GACpB,OAAQF,GAASA,EAAM3a,OACnB6c,GAAQlC,EAAOuiB,GAAYriB,EAAU,IACrC,GA2SNuU,GAAOwqB,SA7hEP,SAAkBxzC,EAAQ5P,EAASwsC,GAIjC,IAAI6W,EAAWzqB,GAAOyG,iBAElBmN,GAASC,GAAe78B,EAAQ5P,EAASwsC,KAC3CxsC,EAAUnC,GAEZ+R,EAASO,GAASP,GAClB5P,EAAUy3C,MAAiBz3C,EAASqjD,EAAUlS,IAE9C,IAIImS,EACAC,EALA7jB,EAAU+X,MAAiBz3C,EAAQ0/B,QAAS2jB,EAAS3jB,QAASyR,IAC9DqS,EAAcrgD,GAAKu8B,GACnB+jB,EAAgB38B,GAAW4Y,EAAS8jB,GAIpCt1C,EAAQ,EACRsxB,EAAcx/B,EAAQw/B,aAAevf,GACrC3H,EAAS,WAGTorC,EAAejlC,IAChBze,EAAQs/B,QAAUrf,IAAW3H,OAAS,IACvCknB,EAAYlnB,OAAS,KACpBknB,IAAgB3gB,GAAgBY,GAAeQ,IAAW3H,OAAS,KACnEtY,EAAQu/B,UAAYtf,IAAW3H,OAAS,KACzC,KAMEqrC,EAAY,kBACb1zC,GAAehS,KAAK+B,EAAS,cACzBA,EAAQ2jD,UAAY,IAAIh7C,QAAQ,MAAO,KACvC,6BAA+BqZ,GAAmB,KACnD,KAENpS,EAAOjH,QAAQ+6C,EAAc,SAASnvC,EAAOqvC,EAAaC,EAAkBC,EAAiBC,EAAe1iD,GAsB1G,OArBAwiD,IAAqBA,EAAmBC,GAGxCxrC,GAAU1I,EAAOxB,MAAMF,EAAO7M,GAAQsH,QAAQuX,GAAmBwT,IAG7DkwB,IACFN,GAAa,EACbhrC,GAAU,YAAcsrC,EAAc,UAEpCG,IACFR,GAAe,EACfjrC,GAAU,OAASyrC,EAAgB,eAEjCF,IACFvrC,GAAU,iBAAmBurC,EAAmB,+BAElD31C,EAAQ7M,EAASkT,EAAM/K,OAIhB+K,IAGT+D,GAAU,OAIV,IAAImnB,EAAWxvB,GAAehS,KAAK+B,EAAS,aAAeA,EAAQy/B,SACnE,GAAKA,GAKA,GAAIlgB,GAA2BxW,KAAK02B,GACvC,MAAM,IAAIxzB,EAAMoO,QALhB/B,EAAS,iBAAmBA,EAAS,QASvCA,GAAUirC,EAAejrC,EAAO3P,QAAQwV,GAAsB,IAAM7F,GACjE3P,QAAQyV,GAAqB,MAC7BzV,QAAQ0V,GAAuB,OAGlC/F,EAAS,aAAemnB,GAAY,OAAS,SAC1CA,EACG,GACA,wBAEJ,qBACC6jB,EACI,mBACA,KAEJC,EACG,uFAEA,OAEJjrC,EACA,gBAEF,IAAIzJ,EAAS2qC,GAAQ,WACnB,OAAO1mC,GAAS0wC,EAAaG,EAAY,UAAYrrC,GAClD9T,MAAM3G,EAAW4lD,KAMtB,GADA50C,EAAOyJ,OAASA,EACZq+B,GAAQ9nC,GACV,MAAMA,EAER,OAAOA,GA46DT+pB,GAAOorB,MApsBP,SAAer9B,EAAGtC,GAEhB,IADAsC,EAAI2pB,GAAU3pB,IACN,GAAKA,EAAI5K,EACf,SAEF,IAAI7N,EAAQgO,EACR1S,EAASqH,GAAU8V,EAAGzK,GAE1BmI,EAAWqiB,GAAYriB,GACvBsC,GAAKzK,EAGL,IADA,IAAIrN,EAAS6X,GAAUld,EAAQ6a,KACtBnW,EAAQyY,GACftC,EAASnW,GAEX,OAAOW,GAsrBT+pB,GAAOgX,SAAWA,GAClBhX,GAAO0X,UAAYA,GACnB1X,GAAO0e,SAAWA,GAClB1e,GAAOqrB,QAx5DP,SAAiBt8C,GACf,OAAOwI,GAASxI,GAAOgxC,eAw5DzB/f,GAAOloB,SAAWA,GAClBkoB,GAAOsrB,cApuIP,SAAuBv8C,GACrB,OAAOA,EACH0zB,GAAUiV,GAAU3oC,IAASoU,EAAkBA,GACpC,IAAVpU,EAAcA,EAAQ,GAkuI7BixB,GAAOzoB,SAAWA,GAClByoB,GAAOurB,QAn4DP,SAAiBx8C,GACf,OAAOwI,GAASxI,GAAOkN,eAm4DzB+jB,GAAOwrB,KA12DP,SAAcx0C,EAAQ4/B,EAAOhD,GAE3B,IADA58B,EAASO,GAASP,MACH48B,GAASgD,IAAU3xC,GAChC,OAAO+oB,GAAShX,GAElB,IAAKA,KAAY4/B,EAAQ9F,GAAa8F,IACpC,OAAO5/B,EAET,IAAIuX,EAAamN,GAAc1kB,GAC3BwX,EAAakN,GAAckb,GAI/B,OAAO3E,GAAU1jB,EAHLD,GAAgBC,EAAYC,GAC9BC,GAAcF,EAAYC,GAAc,GAETpQ,KAAK,KA81DhD4hB,GAAOyrB,QAx0DP,SAAiBz0C,EAAQ4/B,EAAOhD,GAE9B,IADA58B,EAASO,GAASP,MACH48B,GAASgD,IAAU3xC,GAChC,OAAO+R,EAAOxB,MAAM,EAAGsB,GAAgBE,GAAU,GAEnD,IAAKA,KAAY4/B,EAAQ9F,GAAa8F,IACpC,OAAO5/B,EAET,IAAIuX,EAAamN,GAAc1kB,GAG/B,OAAOi7B,GAAU1jB,EAAY,EAFnBE,GAAcF,EAAYmN,GAAckb,IAAU,GAEvBx4B,KAAK,KA8zD5C4hB,GAAO0rB,UAxyDP,SAAmB10C,EAAQ4/B,EAAOhD,GAEhC,IADA58B,EAASO,GAASP,MACH48B,GAASgD,IAAU3xC,GAChC,OAAO+R,EAAOjH,QAAQgH,GAAa,IAErC,IAAKC,KAAY4/B,EAAQ9F,GAAa8F,IACpC,OAAO5/B,EAET,IAAIuX,EAAamN,GAAc1kB,GAG/B,OAAOi7B,GAAU1jB,EAFLD,GAAgBC,EAAYmN,GAAckb,KAElBx4B,KAAK,KA8xD3C4hB,GAAO2rB,SAtvDP,SAAkB30C,EAAQ5P,GACxB,IAAIwJ,EAASgS,EACTgpC,EAAW/oC,EAEf,GAAIhL,GAASzQ,GAAU,CACrB,IAAI29C,EAAY,cAAe39C,EAAUA,EAAQ29C,UAAYA,EAC7Dn0C,EAAS,WAAYxJ,EAAUswC,GAAUtwC,EAAQwJ,QAAUA,EAC3Dg7C,EAAW,aAAcxkD,EAAU0pC,GAAa1pC,EAAQwkD,UAAYA,EAItE,IAAIxC,GAFJpyC,EAASO,GAASP,IAEKpG,OACvB,GAAIoqB,GAAWhkB,GAAS,CACtB,IAAIuX,EAAamN,GAAc1kB,GAC/BoyC,EAAY76B,EAAW3d,OAEzB,GAAIA,GAAUw4C,EACZ,OAAOpyC,EAET,IAAI24B,EAAM/+B,EAAS2qB,GAAWqwB,GAC9B,GAAIjc,EAAM,EACR,OAAOic,EAET,IAAI31C,EAASsY,EACT0jB,GAAU1jB,EAAY,EAAGohB,GAAKvxB,KAAK,IACnCpH,EAAOxB,MAAM,EAAGm6B,GAEpB,GAAIoV,IAAc9/C,EAChB,OAAOgR,EAAS21C,EAKlB,GAHIr9B,IACFohB,GAAQ15B,EAAOrF,OAAS++B,GAEtB1kB,GAAS85B,IACX,GAAI/tC,EAAOxB,MAAMm6B,GAAKkc,OAAO9G,GAAY,CACvC,IAAIppC,EACAmwC,EAAY71C,EAMhB,IAJK8uC,EAAUngD,SACbmgD,EAAYl/B,GAAOk/B,EAAUrlC,OAAQnI,GAASuP,GAAQ1Y,KAAK22C,IAAc,MAE3EA,EAAUvpB,UAAY,EACd7f,EAAQopC,EAAU32C,KAAK09C,IAC7B,IAAIC,EAASpwC,EAAMrG,MAErBW,EAASA,EAAOT,MAAM,EAAGu2C,IAAW9mD,EAAY0qC,EAAMoc,SAEnD,GAAI/0C,EAAO3B,QAAQy7B,GAAaiU,GAAYpV,IAAQA,EAAK,CAC9D,IAAIr6B,EAAQW,EAAOuyC,YAAYzD,GAC3BzvC,GAAS,IACXW,EAASA,EAAOT,MAAM,EAAGF,IAG7B,OAAOW,EAAS21C,GAksDlB5rB,GAAOgsB,SA5qDP,SAAkBh1C,GAEhB,OADAA,EAASO,GAASP,KACA4O,GAAiBzV,KAAK6G,GACpCA,EAAOjH,QAAQ2V,GAAemW,IAC9B7kB,GAyqDNgpB,GAAOisB,SAvpBP,SAAkBC,GAChB,IAAItwC,IAAO8gB,GACX,OAAOnlB,GAAS20C,GAAUtwC,GAspB5BokB,GAAOugB,UAAYA,GACnBvgB,GAAOigB,WAAaA,GAGpBjgB,GAAOmsB,KAAO3hD,GACdw1B,GAAOosB,UAAY3P,GACnBzc,GAAOqsB,MAAQtR,GAEfoG,GAAMnhB,GAAS,WACb,IAAItgB,KAMJ,OALA0nB,GAAWpH,GAAQ,SAAS7nB,EAAM67B,GAC3B38B,GAAehS,KAAK26B,GAAOl2B,UAAWkqC,KACzCt0B,EAAOs0B,GAAc77B,KAGlBuH,EAPM,IAQPy8B,OAAS,IAWjBnc,GAAOssB,QA/ihBK,UAkjhBZ3gC,IAAW,OAAQ,UAAW,QAAS,aAAc,UAAW,gBAAiB,SAASqoB,GACxFhU,GAAOgU,GAAYxmC,YAAcwyB,KAInCrU,IAAW,OAAQ,QAAS,SAASqoB,EAAY1+B,GAC/C4qB,GAAYp2B,UAAUkqC,GAAc,SAASjmB,GAC3CA,EAAIA,IAAM9oB,EAAY,EAAI+S,GAAU0/B,GAAU3pB,GAAI,GAElD,IAAI9X,EAAU1Q,KAAKu7B,eAAiBxrB,EAChC,IAAI4qB,GAAY36B,MAChBA,KAAKk1C,QAUT,OARIxkC,EAAO6qB,aACT7qB,EAAO+qB,cAAgB/oB,GAAU8V,EAAG9X,EAAO+qB,eAE3C/qB,EAAOgrB,UAAUptB,MACf4G,KAAQxC,GAAU8V,EAAGzK,GACrBnJ,KAAQ65B,GAAc/9B,EAAO4qB,QAAU,EAAI,QAAU,MAGlD5qB,GAGTiqB,GAAYp2B,UAAUkqC,EAAa,SAAW,SAASjmB,GACrD,OAAOxoB,KAAK+a,UAAU0zB,GAAYjmB,GAAGzN,aAKzCqL,IAAW,SAAU,MAAO,aAAc,SAASqoB,EAAY1+B,GAC7D,IAAI6E,EAAO7E,EAAQ,EACfi3C,EAAWpyC,GAAQ6I,GA/hhBL,GA+hhByB7I,EAE3C+lB,GAAYp2B,UAAUkqC,GAAc,SAASvoB,GAC3C,IAAIxV,EAAS1Q,KAAKk1C,QAMlB,OALAxkC,EAAO8qB,cAAcltB,MACnB4X,SAAYqiB,GAAYriB,EAAU,GAClCtR,KAAQA,IAEVlE,EAAO6qB,aAAe7qB,EAAO6qB,cAAgByrB,EACtCt2C,KAKX0V,IAAW,OAAQ,QAAS,SAASqoB,EAAY1+B,GAC/C,IAAIk3C,EAAW,QAAUl3C,EAAQ,QAAU,IAE3C4qB,GAAYp2B,UAAUkqC,GAAc,WAClC,OAAOzuC,KAAKinD,GAAU,GAAGz9C,QAAQ,MAKrC4c,IAAW,UAAW,QAAS,SAASqoB,EAAY1+B,GAClD,IAAIm3C,EAAW,QAAUn3C,EAAQ,GAAK,SAEtC4qB,GAAYp2B,UAAUkqC,GAAc,WAClC,OAAOzuC,KAAKu7B,aAAe,IAAIZ,GAAY36B,MAAQA,KAAKknD,GAAU,MAItEvsB,GAAYp2B,UAAU04C,QAAU,WAC9B,OAAOj9C,KAAK89C,OAAOtX,KAGrB7L,GAAYp2B,UAAUyyC,KAAO,SAASzwB,GACpC,OAAOvmB,KAAK89C,OAAOv3B,GAAWivB,QAGhC7a,GAAYp2B,UAAU0yC,SAAW,SAAS1wB,GACxC,OAAOvmB,KAAK+a,UAAUi8B,KAAKzwB,IAG7BoU,GAAYp2B,UAAU6yC,UAAY5N,GAAS,SAAS1G,EAAMpvB,GACxD,MAAmB,mBAARovB,EACF,IAAInI,GAAY36B,MAElBA,KAAK4W,IAAI,SAASpN,GACvB,OAAOw6B,GAAWx6B,EAAOs5B,EAAMpvB,OAInCinB,GAAYp2B,UAAU26C,OAAS,SAAS34B,GACtC,OAAOvmB,KAAK89C,OAAO/F,GAAOxP,GAAYhiB,MAGxCoU,GAAYp2B,UAAU0L,MAAQ,SAASw5B,EAAOW,GAC5CX,EAAQ0I,GAAU1I,GAElB,IAAI/4B,EAAS1Q,KACb,OAAI0Q,EAAO6qB,eAAiBkO,EAAQ,GAAKW,EAAM,GACtC,IAAIzP,GAAYjqB,IAErB+4B,EAAQ,EACV/4B,EAASA,EAAOmvC,WAAWpW,GAClBA,IACT/4B,EAASA,EAAO8sC,KAAK/T,IAEnBW,IAAQ1qC,IAEVgR,GADA05B,EAAM+H,GAAU/H,IACD,EAAI15B,EAAO+sC,WAAWrT,GAAO15B,EAAOkvC,KAAKxV,EAAMX,IAEzD/4B,IAGTiqB,GAAYp2B,UAAUu7C,eAAiB,SAASv5B,GAC9C,OAAOvmB,KAAK+a,UAAUglC,UAAUx5B,GAAWxL,WAG7C4f,GAAYp2B,UAAUu0C,QAAU,WAC9B,OAAO94C,KAAK4/C,KAAK7hC,IAInB8jB,GAAWlH,GAAYp2B,UAAW,SAASqO,EAAM67B,GAC/C,IAAI0Y,EAAgB,qCAAqCv8C,KAAK6jC,GAC1D2Y,EAAU,kBAAkBx8C,KAAK6jC,GACjC4Y,EAAa5sB,GAAO2sB,EAAW,QAAwB,QAAd3Y,EAAuB,QAAU,IAAOA,GACjF6Y,EAAeF,GAAW,QAAQx8C,KAAK6jC,GAEtC4Y,IAGL5sB,GAAOl2B,UAAUkqC,GAAc,WAC7B,IAAIjlC,EAAQxJ,KAAKi7B,YACbvnB,EAAO0zC,GAAW,GAAKhzC,UACvBmzC,EAAS/9C,aAAiBmxB,GAC1BzU,EAAWxS,EAAK,GAChB8zC,EAAUD,GAAU7sB,GAAQlxB,GAE5BqtC,EAAc,SAASrtC,GACzB,IAAIkH,EAAS22C,EAAWhhD,MAAMo0B,GAAQzT,IAAWxd,GAAQkK,IACzD,OAAQ0zC,GAAWpsB,EAAYtqB,EAAO,GAAKA,GAGzC82C,GAAWL,GAAoC,mBAAZjhC,GAA6C,GAAnBA,EAAS7a,SAExEk8C,EAASC,GAAU,GAErB,IAAIxsB,EAAWh7B,KAAKm7B,UAChBssB,IAAaznD,KAAKk7B,YAAY7vB,OAC9Bq8C,EAAcJ,IAAiBtsB,EAC/B2sB,EAAWJ,IAAWE,EAE1B,IAAKH,GAAgBE,EAAS,CAC5Bh+C,EAAQm+C,EAAWn+C,EAAQ,IAAImxB,GAAY36B,MAC3C,IAAI0Q,EAASkC,EAAKvM,MAAMmD,EAAOkK,GAE/B,OADAhD,EAAOwqB,YAAY5sB,MAAOsE,KAAQy8B,GAAM37B,MAASmjC,GAAcljC,QAAWjU,IACnE,IAAIk7B,GAAclqB,EAAQsqB,GAEnC,OAAI0sB,GAAeC,EACV/0C,EAAKvM,MAAMrG,KAAM0T,IAE1BhD,EAAS1Q,KAAKqvC,KAAKwH,GACZ6Q,EAAeN,EAAU12C,EAAOlH,QAAQ,GAAKkH,EAAOlH,QAAWkH,OAK1E0V,IAAW,MAAO,OAAQ,QAAS,OAAQ,SAAU,WAAY,SAASqoB,GACxE,IAAI77B,EAAOmkB,GAAW0X,GAClBmZ,EAAY,0BAA0Bh9C,KAAK6jC,GAAc,MAAQ,OACjE6Y,EAAe,kBAAkB18C,KAAK6jC,GAE1ChU,GAAOl2B,UAAUkqC,GAAc,WAC7B,IAAI/6B,EAAOU,UACX,GAAIkzC,IAAiBtnD,KAAKm7B,UAAW,CACnC,IAAI3xB,EAAQxJ,KAAKwJ,QACjB,OAAOoJ,EAAKvM,MAAMq0B,GAAQlxB,GAASA,KAAYkK,GAEjD,OAAO1T,KAAK4nD,GAAW,SAASp+C,GAC9B,OAAOoJ,EAAKvM,MAAMq0B,GAAQlxB,GAASA,KAAYkK,QAMrDmuB,GAAWlH,GAAYp2B,UAAW,SAASqO,EAAM67B,GAC/C,IAAI4Y,EAAa5sB,GAAOgU,GACxB,GAAI4Y,EAAY,CACd,IAAIz5C,EAAMy5C,EAAW17C,KAAO,GACvBmG,GAAehS,KAAKg6B,GAAWlsB,KAClCksB,GAAUlsB,OAEZksB,GAAUlsB,GAAKU,MAAO3C,KAAQ8iC,EAAY77B,KAAQy0C,OAItDvtB,GAAU6V,GAAajwC,EAAWkd,GAAoBjR,QACpDA,KAAQ,UACRiH,KAAQlT,IAIVi7B,GAAYp2B,UAAU2wC,MAh9dtB,WACE,IAAIxkC,EAAS,IAAIiqB,GAAY36B,KAAKi7B,aAOlC,OANAvqB,EAAOwqB,YAAc+B,GAAUj9B,KAAKk7B,aACpCxqB,EAAO4qB,QAAUt7B,KAAKs7B,QACtB5qB,EAAO6qB,aAAev7B,KAAKu7B,aAC3B7qB,EAAO8qB,cAAgByB,GAAUj9B,KAAKw7B,eACtC9qB,EAAO+qB,cAAgBz7B,KAAKy7B,cAC5B/qB,EAAOgrB,UAAYuB,GAAUj9B,KAAK07B,WAC3BhrB,GAy8dTiqB,GAAYp2B,UAAUwW,QA97dtB,WACE,GAAI/a,KAAKu7B,aAAc,CACrB,IAAI7qB,EAAS,IAAIiqB,GAAY36B,MAC7B0Q,EAAO4qB,SAAW,EAClB5qB,EAAO6qB,cAAe,OAEtB7qB,EAAS1Q,KAAKk1C,SACP5Z,UAAY,EAErB,OAAO5qB,GAs7dTiqB,GAAYp2B,UAAUiF,MA36dtB,WACE,IAAIwc,EAAQhmB,KAAKi7B,YAAYzxB,QACzBq+C,EAAM7nD,KAAKs7B,QACXgB,EAAQ5B,GAAQ1U,GAChB8hC,EAAUD,EAAM,EAChBpX,EAAYnU,EAAQtW,EAAM3a,OAAS,EACnC08C,EA8pIN,SAAiBte,EAAOW,EAAK6N,GAI3B,IAHA,IAAIloC,GAAS,EACT1E,EAAS4sC,EAAW5sC,SAEf0E,EAAQ1E,GAAQ,CACvB,IAAI0M,EAAOkgC,EAAWloC,GAClBmF,EAAO6C,EAAK7C,KAEhB,OAAQ6C,EAAKnD,MACX,IAAK,OAAa60B,GAASv0B,EAAM,MACjC,IAAK,YAAak1B,GAAOl1B,EAAM,MAC/B,IAAK,OAAak1B,EAAM13B,GAAU03B,EAAKX,EAAQv0B,GAAO,MACtD,IAAK,YAAau0B,EAAQh3B,GAAUg3B,EAAOW,EAAMl1B,IAGrD,OAASu0B,MAASA,EAAOW,IAAOA,GA7qIrB4d,CAAQ,EAAGvX,EAAWzwC,KAAK07B,WAClC+N,EAAQse,EAAKte,MACbW,EAAM2d,EAAK3d,IACX/+B,EAAS++B,EAAMX,EACf15B,EAAQ+3C,EAAU1d,EAAOX,EAAQ,EACjCpB,EAAYroC,KAAKw7B,cACjBysB,EAAa5f,EAAUh9B,OACvBob,EAAW,EACXyhC,EAAYx1C,GAAUrH,EAAQrL,KAAKy7B,eAEvC,IAAKa,IAAWwrB,GAAWrX,GAAaplC,GAAU68C,GAAa78C,EAC7D,OAAO0gC,GAAiB/lB,EAAOhmB,KAAKk7B,aAEtC,IAAIxqB,KAEJqwB,EACA,KAAO11B,KAAYob,EAAWyhC,GAAW,CAMvC,IAHA,IAAIC,GAAa,EACb3+C,EAAQwc,EAHZjW,GAAS83C,KAKAM,EAAYF,GAAY,CAC/B,IAAIlwC,EAAOswB,EAAU8f,GACjBjiC,EAAWnO,EAAKmO,SAChBtR,EAAOmD,EAAKnD,KACZosB,EAAW9a,EAAS1c,GAExB,GAAIoL,GAAQ8I,EACVlU,EAAQw3B,OACH,IAAKA,EAAU,CACpB,GAAIpsB,GAAQ6I,EACV,SAASsjB,EAET,MAAMA,GAIZrwB,EAAO+V,KAAcjd,EAEvB,OAAOkH,GAg4dT+pB,GAAOl2B,UAAUi1C,GAAK1C,GACtBrc,GAAOl2B,UAAUqyC,MA1iQjB,WACE,OAAOA,GAAM52C,OA0iQfy6B,GAAOl2B,UAAU6jD,OA7gQjB,WACE,OAAO,IAAIxtB,GAAc56B,KAAKwJ,QAASxJ,KAAKm7B,YA6gQ9CV,GAAOl2B,UAAUw0C,KAp/PjB,WACM/4C,KAAKq7B,aAAe37B,IACtBM,KAAKq7B,WAAayd,GAAQ94C,KAAKwJ,UAEjC,IAAIwvC,EAAOh5C,KAAKo7B,WAAap7B,KAAKq7B,WAAWhwB,OAG7C,OAAS2tC,KAAQA,EAAMxvC,MAFXwvC,EAAOt5C,EAAYM,KAAKq7B,WAAWr7B,KAAKo7B,eAg/PtDX,GAAOl2B,UAAUmrC,MA77PjB,SAAsBlmC,GAIpB,IAHA,IAAIkH,EACAuzB,EAASjkC,KAENikC,aAAkBlJ,IAAY,CACnC,IAAIma,EAAQra,GAAaoJ,GACzBiR,EAAM9Z,UAAY,EAClB8Z,EAAM7Z,WAAa37B,EACfgR,EACF24B,EAASpO,YAAcia,EAEvBxkC,EAASwkC,EAEX,IAAI7L,EAAW6L,EACfjR,EAASA,EAAOhJ,YAGlB,OADAoO,EAASpO,YAAczxB,EAChBkH,GA66PT+pB,GAAOl2B,UAAUwW,QAt5PjB,WACE,IAAIvR,EAAQxJ,KAAKi7B,YACjB,GAAIzxB,aAAiBmxB,GAAa,CAChC,IAAI0tB,EAAU7+C,EAUd,OATIxJ,KAAKk7B,YAAY7vB,SACnBg9C,EAAU,IAAI1tB,GAAY36B,QAE5BqoD,EAAUA,EAAQttC,WACVmgB,YAAY5sB,MAClBsE,KAAQy8B,GACR37B,MAASqH,IACTpH,QAAWjU,IAEN,IAAIk7B,GAAcytB,EAASroD,KAAKm7B,WAEzC,OAAOn7B,KAAKqvC,KAAKt0B,KAw4PnB0f,GAAOl2B,UAAU+jD,OAAS7tB,GAAOl2B,UAAUg2B,QAAUE,GAAOl2B,UAAUiF,MAv3PtE,WACE,OAAOuiC,GAAiB/rC,KAAKi7B,YAAaj7B,KAAKk7B,cAy3PjDT,GAAOl2B,UAAUuiD,MAAQrsB,GAAOl2B,UAAUixC,KAEtCtd,KACFuC,GAAOl2B,UAAU2zB,IAj+PnB,WACE,OAAOl4B,OAk+PFy6B,GAMD7D,GAGgD,UAArBr3B,EAAOK,SAA0BA,QAKlEuR,GAAKnH,EAAIA,IAITpK,aACE,OAAOoK,IADHlK,KAAAN,EAAAO,EAAAP,EAAAC,MAAAC,IAAAD,EAAAD,QAAAG,IAKCilB,KAENA,GAAWplB,QAAUwK,IAAGA,EAAIA,GAE7B2a,GAAY3a,EAAIA,IAIhBmH,GAAKnH,EAAIA,KAEXlK,KAAKE,wSCvzhBP,IAAIyU,EAA8B,gBAAjB,IAAOpV,EAAP,YAAAE,EAAOF,KAAsBA,GAAUA,EAAOyE,SAAWA,QAAUzE,EAEpFI,EAAOD,QAAUiV,yCCHjB,IAAIgU,EAAWrX,EAAQ,MACnBkB,EAAWlB,EAAQ,KACnB8wB,EAAW9wB,EAAQ,KAGnB0M,EAAM,IAGN0D,EAAa,qBAGbC,EAAa,aAGbE,EAAY,cAGZ8C,EAAeC,SA8CnBjlB,EAAOD,QArBP,SAAkBgK,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAI04B,EAAS14B,GACX,OAAOsU,EAET,GAAIxL,EAAS9I,GAAQ,CACnB,IAAI65B,EAAgC,mBAAjB75B,EAAM+wB,QAAwB/wB,EAAM+wB,UAAY/wB,EACnEA,EAAQ8I,EAAS+wB,GAAUA,EAAQ,GAAMA,EAE3C,GAAoB,iBAAT75B,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQif,EAASjf,GACjB,IAAI4vC,EAAW33B,EAAW7W,KAAKpB,GAC/B,OAAQ4vC,GAAYz3B,EAAU/W,KAAKpB,GAC/Bib,EAAajb,EAAMyG,MAAM,GAAImpC,EAAW,EAAI,GAC3C53B,EAAW5W,KAAKpB,GAASsU,GAAOtU,qRC5DvC,SAAUoO,EAAEC,GAAG,UAAAtY,EAAiBC,IAAS,UAAAD,EAAiBE,GAAOA,EAAOD,QAAQqY,KAA0CjY,UAAMF,KAAAC,EAAA,mBAAAE,EAAA,GAAAA,EAAAwG,MAAA7G,EAAA0R,GAAArR,KAAAJ,EAAAD,QAAAG,IAAhI,CAA4MK,EAAK,WAAW,OAAO,SAAS4X,GAAG,SAASC,EAAEoB,GAAG,GAAGsvC,EAAEtvC,GAAG,OAAOsvC,EAAEtvC,GAAGzZ,QAAQ,IAAI8L,EAAEi9C,EAAEtvC,IAAI7N,EAAE6N,EAAEuvC,GAAE,EAAGhpD,YAAY,OAAOoY,EAAEqB,GAAGnZ,KAAKwL,EAAE9L,QAAQ8L,EAAEA,EAAE9L,QAAQqY,GAAGvM,EAAEk9C,GAAE,EAAGl9C,EAAE9L,QAAQ,IAAI+oD,KAAK,OAAO1wC,EAAE1B,EAAEyB,EAAEC,EAAE0wC,EAAEA,EAAE1wC,EAAEoB,EAAE,SAASrB,EAAE2wC,EAAEtvC,GAAGpB,EAAE4wC,EAAE7wC,EAAE2wC,IAAIzkD,OAAO2F,eAAemO,EAAE2wC,GAAG7tC,cAAa,EAAGC,YAAW,EAAGtR,IAAI4P,KAAKpB,EAAE2Q,EAAE,SAAS5Q,GAAG,IAAI2wC,EAAE3wC,GAAGA,EAAE8wC,WAAW,WAAW,OAAO9wC,EAAC,SAAa,WAAW,OAAOA,GAAG,OAAOC,EAAEoB,EAAEsvC,EAAE,IAAIA,GAAGA,GAAG1wC,EAAE4wC,EAAE,SAAS7wC,EAAEC,GAAG,OAAO/T,OAAOS,UAAUuN,eAAehS,KAAK8X,EAAEC,IAAIA,EAAE8wC,EAAE,GAAG9wC,EAAEA,EAAE+wC,EAAE,GAAjd,EAAsd,SAAShxC,EAAEC,EAAE0wC,GAAG,aAAa,IAAItvC,EAAEsvC,EAAE,GAAG3wC,EAAEpY,QAAQ,SAASoY,EAAEC,GAAG,OAAOA,EAAEA,MAAMoB,EAAEhU,QAAQ,SAASsjD,GAAG,IAAItvC,EAAE,mBAAmBsvC,EAAE,GAAGA,EAAE,GAAG1wC,EAAEgxC,cAAcN,EAAE,GAAG3wC,EAAEA,EAAEpN,QAAQ+9C,EAAE,GAAGtvC,KAAKrB,IAAI,SAASA,GAAG,aAAaA,EAAEpY,UAAU,OAAO,SAASoY,GAAG,MAAM,KAAUA,EAAE,KAAe,OAAO,eAAe,UAAe,4CAA4C,UAAe,aAAa,QAAa,MAAM,SAASA,GAAG,MAAM,KAAUA,EAAE,IAAS,OAAO,eAAe,UAAe,uBAAuB,UAAe,iEAAiE,UAAe,qCAAqC,UAAe,wGAAwG,QAAa,KAAK,MAAW,KAAK,OAAY,SAASA,EAAEC,EAAE0wC,GAAG,aAA6c,SAASj9C,EAAEsM,EAAEC,EAAE0wC,GAAG,OAAO3wC,EAAEkxC,OAAOP,EAAE1wC,EAAExM,QAAQb,QAAQ,IAAS,IAAI,IAAIu+C,EAAER,EAAE,GAAGS,EAAE,oBAAoBC,SAASA,QAAQC,WAAW,EAAEtxC,EAAEpY,QAAQ,SAASoY,GAAG,OAAxlB,SAASqB,EAAErB,GAAG,IAAI,KAAK,OAAO,MAAM,SAAS,QAAQ,YAAY9H,QAAQ8H,EAAEjB,SAASD,eAAe,CAAC,IAAImB,EAAE0wC,EAAEpgD,EAAEiD,EAAE,GAAG4L,EAAEY,EAAEuxC,WAAW/wC,KAAK,IAAIP,EAAE,EAAEA,EAAEb,EAAE3L,OAAOwM,KAAI0wC,EAAEvxC,EAAEa,IAAKtX,WAAWyoD,GAAG,UAAUT,EAAE5xC,UAAUyB,EAAE9J,MAAMi6C,EAAEn9C,EAAEC,SAASD,GAAGm9C,EAAEa,WAAWb,EAAE/+C,OAAO++C,EAAEY,YAAYZ,EAAEY,WAAW99C,SAASD,GAAG6N,EAAEsvC,IAAI,IAAI1wC,KAAKzM,EAAE29C,EAAE39C,GAAGy9C,cAAa,IAAKzwC,GAAEjQ,EAAEiQ,EAAEP,IAAK,GAAGuxC,UAAUjhD,EAAE,GAAGihD,UAAU99C,EAAEF,EAAEjD,EAAE,GAAGihD,UAAUjhD,EAAE,IAAIA,EAAE,GAAGqB,QAAQrB,EAAE,GAAGqB,MAAM8B,EAAEF,EAAEjD,EAAE,GAAGqB,MAAMrB,EAAE,KAAK,OAAOiD,GAAkK6N,CAAErB,GAAGA,IAAI,SAASA,EAAEC,EAAE0wC,GAAG,aAAwK,IAAIj9C,EAAEi9C,EAAE,GAAGQ,EAAER,EAAE,GAAGS,EAAET,EAAE,GAAGpgD,EAAEogD,EAAE,GAAG3wC,EAAEpY,QAA7L,SAASyZ,EAAErB,GAAG,MAAM,oBAAoBtX,eAAU,IAAoBsX,GAAGoxC,EAAEK,WAAW,WAAW,OAAON,EAAEzoD,SAASM,QAAQqY,GAAG,iBAAiBrB,EAAEzP,EAAEyP,GAAGmxC,EAAEnxC,IAA+CA,EAAEpY,QAAQiS,OAAOtJ,EAAEyP,EAAEpY,QAAQY,QAAQ2oD,EAAEnxC,EAAEpY,QAAQ8pD,aAAah+C,EAAEsM,EAAEpY,QAAQ+pD,OAAOP,GAAG,SAASpxC,EAAEC,EAAE0wC,GAAG,aAAa,SAAStvC,EAAErB,GAAG,IAAIC,EAAE,IAAI2xC,iBAAiB,SAAS5xC,GAAGA,EAAE3S,QAAQ,SAAS2S,GAAG,IAAIC,EAAE0wC,GAAE,EAAGtvC,GAAE,EAAG,IAAI,IAAI,IAAI8vC,EAAEC,EAAE7gD,EAAEyP,EAAE6xC,WAAW73C,OAAOumB,cAAcowB,GAAGQ,EAAE5gD,EAAE4wC,QAAQC,MAAMuP,GAAE,EAAGS,EAAED,EAAEv/C,MAAM8B,EAAE09C,GAAG,MAAMpxC,GAAGqB,GAAE,EAAGpB,EAAED,EAA7G,QAAuH,KAAK2wC,GAAGpgD,EAAEuhD,QAAQvhD,EAAEuhD,SAApB,QAAqC,GAAGzwC,EAAE,MAAMpB,QAAQ,OAAOoB,EAAEowC,WAAW,WAAWxxC,EAAE8xC,QAAQ/xC,GAAGtX,SAASM,MAAMgpD,WAAU,EAAGC,SAAQ,MAAOhyC,EAAE,IAAIvM,EAAEi9C,EAAE,GAAKA,EAAE,GAAGtvC,EAAEowC,WAAW,SAASzxC,GAAG,GAAG,YAAYtX,SAASwpD,WAAWlyC,SAAS,GAAGtX,SAAS6B,iBAAiB7B,SAAS6B,iBAAiB,mBAAmByV,GAAE,QAAS,IAAIC,EAAEkyC,YAAY,WAAW,YAAYzpD,SAASwpD,aAAaE,cAAcnyC,GAAGD,MAAM,KAAKA,EAAEpY,QAAQyZ,qSCAliG,SAAS/Y,EAAQZ,GACjB,IAAI2qD,EAAgB,SAAhBA,IACH3qD,EAAQY,EAAOgqD,WACfhqD,EAAOkC,oBAAoB,iBAAkB6nD,GAAe,IAG7D3qD,EAAUA,EAAQyF,KAAK,KAAM7E,EAAQA,EAAOI,UAExB,UAAjBf,EAAOE,IAAsBA,EAAOD,QACtCF,EAAQ8R,EAAQ,KACPlR,EAAOgqD,UAChBD,IAEA/pD,EAAOiC,iBAAiB,iBAAkB8nD,GAAe,GAb1D,CAeC/pD,OAAQ,SAASA,EAAQI,EAAU4pD,GACpC,aACA,GAAIhqD,EAAOiC,iBAAX,CAEA,IAAIgoD,EAAMjqD,EAAOqD,uBAAyBqB,WA4G1CzC,iBAAiB,mBA1GC,SAAdioD,IACH,IAAIC,EAASC,EAAYC,EAAUC,EAC/BC,EAAQP,EAAUQ,IAClBC,GAAcC,aAAc,EAAGC,eAAgB,EAAGC,cAAe,EAAGC,UAAW,EAAGC,cAAe,GACjGC,EAAe,WAAaR,EAAMS,YAClC11C,EAAUlV,EAASQ,gBAEnBqqD,EAAW,SAAS5/C,GACvB4+C,EAAI,WACHD,EAAUkB,GAAG7/C,EAAQk/C,EAAMS,aACxBT,EAAMY,eACRnB,EAAUkB,GAAG7/C,EAAQk/C,EAAMY,eAE5BnB,EAAUoB,GAAG//C,EAAQk/C,EAAMc,YAEA,QAAxBhgD,EAAOrE,MAAMskD,SAAsBjgD,EAAO/J,YAAiD,QAAnC+J,EAAO/J,WAAW0F,MAAMskD,UAClF5mD,WAAW,WACVslD,EAAUuB,OAAOC,OAAOngD,IACtB,MAKFogD,EAAa,SAASC,GACzB,IAAIxgD,EAAGoM,EAAKq0C,EAAUtgD,EACtB,IAAIH,EAAI,EAAGoM,EAAMo0C,EAAUvgD,OAAQD,EAAIoM,EAAKpM,KAE3CG,GADAsgD,EAAWD,EAAUxgD,IACHG,QAEP7D,aAAamkD,EAASC,iBAEV,UAApBvgD,EAAOwgD,WAAyBxgD,EAAO/J,aACzC+J,EAASA,EAAO/J,WAAWwM,cAAc,QAGvCzC,GAAU0/C,EAAargD,KAAKW,EAAOrF,YACrCilD,EAAS5/C,KAKTk/C,EAAMY,gBACRJ,GAAgB,IAAMR,EAAMY,eAG7BJ,GAAgB,IAAMR,EAAMuB,aAAe,WAE3Cf,EAAe,IAAI3qC,OAAO2qC,GAE1BN,EAAWF,EAAMwB,SAAW,EAC5BtB,EAAWF,EAAMyB,YAAc,EAE5BhsD,EAAOspD,kBACTe,EAAW,IAAIf,iBAAiBmC,GAEhCtB,EAAU,WACLG,IACHA,GAAY,EACZD,EAASZ,QAASn0C,GAAWq0C,SAAS,EAAMc,YAAY,EAAMwB,gBAAiBroD,OAAOkB,KAAK2lD,OAG7FL,EAAa,WACTE,IACFA,GAAY,EACZD,EAASD,iBAIX90C,EAAQrT,iBAAiB,kBAAoB,WAC5C,IAAIiqD,EACAC,KACAC,EAAgB,WACnBX,EAAWU,GACXA,KACAD,GAAO,GAER,OAAO,SAAS9gD,GACZk/C,GAAaG,EAAWr/C,EAAEihD,WAAajhD,EAAEu8B,WAC3CwkB,EAAc/9C,MAAM/C,OAAQD,EAAEC,OAAQugD,cAAexgD,EAAEihD,WACnDH,IACHxnD,WAAW0nD,GACXF,GAAO,KAbkC,IAiBvC,GAEN/B,EAAU,WACTG,GAAY,GAEbF,EAAa,WACZE,GAAY,IAIdroD,iBAAiB,mBAAoBmoD,GAAY,GACjDnoD,iBAAiB,mBAAoBkoD,GAErCloD,iBAAiB,kBAAmBmoD,GAAY,GAChDnoD,iBAAiB,kBAAmBkoD,GACpCA,IAEAjoD,oBAAoB,mBAAoBgoD","file":"vendors~kioskmain~main.eceb5bef74cfd6d43ce9.chunk.gen.js","sourcesContent":["/*!\n * headroom.js v0.12.0 - Give your page some headroom. Hide your header until you need it\n * Copyright (c) 2020 Nick Williams - http://wicky.nillia.ms/headroom.js\n * License: MIT\n */\n\n(function (global, factory) {\n typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :\n typeof define === 'function' && define.amd ? define(factory) :\n (global = global || self, global.Headroom = factory());\n}(this, function () { 'use strict';\n\n function isBrowser() {\n return typeof window !== \"undefined\";\n }\n\n /**\n * Used to detect browser support for adding an event listener with options\n * Credit: https://developer.mozilla.org/en-US/docs/Web/API/EventTarget/addEventListener\n */\n function passiveEventsSupported() {\n var supported = false;\n\n try {\n var options = {\n // eslint-disable-next-line getter-return\n get passive() {\n supported = true;\n }\n };\n window.addEventListener(\"test\", options, options);\n window.removeEventListener(\"test\", options, options);\n } catch (err) {\n supported = false;\n }\n\n return supported;\n }\n\n function isSupported() {\n return !!(\n isBrowser() &&\n function() {}.bind &&\n \"classList\" in document.documentElement &&\n Object.assign &&\n Object.keys &&\n requestAnimationFrame\n );\n }\n\n function isDocument(obj) {\n return obj.nodeType === 9; // Node.DOCUMENT_NODE === 9\n }\n\n function isWindow(obj) {\n // `obj === window` or `obj instanceof Window` is not sufficient,\n // as the obj may be the window of an iframe.\n return obj && obj.document && isDocument(obj.document);\n }\n\n function windowScroller(win) {\n var doc = win.document;\n var body = doc.body;\n var html = doc.documentElement;\n\n return {\n /**\n * @see http://james.padolsey.com/javascript/get-document-height-cross-browser/\n * @return {Number} the scroll height of the document in pixels\n */\n scrollHeight: function() {\n return Math.max(\n body.scrollHeight,\n html.scrollHeight,\n body.offsetHeight,\n html.offsetHeight,\n body.clientHeight,\n html.clientHeight\n );\n },\n\n /**\n * @see http://andylangton.co.uk/blog/development/get-viewport-size-width-and-height-javascript\n * @return {Number} the height of the viewport in pixels\n */\n height: function() {\n return win.innerHeight || html.clientHeight || body.clientHeight;\n },\n\n /**\n * Gets the Y scroll position\n * @return {Number} pixels the page has scrolled along the Y-axis\n */\n scrollY: function() {\n if (win.pageYOffset !== undefined) {\n return win.pageYOffset;\n }\n\n return (html || body.parentNode || body).scrollTop;\n }\n };\n }\n\n function elementScroller(element) {\n return {\n /**\n * @return {Number} the scroll height of the element in pixels\n */\n scrollHeight: function() {\n return Math.max(\n element.scrollHeight,\n element.offsetHeight,\n element.clientHeight\n );\n },\n\n /**\n * @return {Number} the height of the element in pixels\n */\n height: function() {\n return Math.max(element.offsetHeight, element.clientHeight);\n },\n\n /**\n * Gets the Y scroll position\n * @return {Number} pixels the element has scrolled along the Y-axis\n */\n scrollY: function() {\n return element.scrollTop;\n }\n };\n }\n\n function createScroller(element) {\n return isWindow(element) ? windowScroller(element) : elementScroller(element);\n }\n\n /**\n * @param element EventTarget\n */\n function trackScroll(element, options, callback) {\n var isPassiveSupported = passiveEventsSupported();\n var rafId;\n var scrolled = false;\n var scroller = createScroller(element);\n var lastScrollY = scroller.scrollY();\n var details = {};\n\n function update() {\n var scrollY = Math.round(scroller.scrollY());\n var height = scroller.height();\n var scrollHeight = scroller.scrollHeight();\n\n // reuse object for less memory churn\n details.scrollY = scrollY;\n details.lastScrollY = lastScrollY;\n details.direction = scrollY > lastScrollY ? \"down\" : \"up\";\n details.distance = Math.abs(scrollY - lastScrollY);\n details.isOutOfBounds = scrollY < 0 || scrollY + height > scrollHeight;\n details.top = scrollY <= options.offset[details.direction];\n details.bottom = scrollY + height >= scrollHeight;\n details.toleranceExceeded =\n details.distance > options.tolerance[details.direction];\n\n callback(details);\n\n lastScrollY = scrollY;\n scrolled = false;\n }\n\n function handleScroll() {\n if (!scrolled) {\n scrolled = true;\n rafId = requestAnimationFrame(update);\n }\n }\n\n var eventOptions = isPassiveSupported\n ? { passive: true, capture: false }\n : false;\n\n element.addEventListener(\"scroll\", handleScroll, eventOptions);\n update();\n\n return {\n destroy: function() {\n cancelAnimationFrame(rafId);\n element.removeEventListener(\"scroll\", handleScroll, eventOptions);\n }\n };\n }\n\n function normalizeUpDown(t) {\n return t === Object(t) ? t : { down: t, up: t };\n }\n\n /**\n * UI enhancement for fixed headers.\n * Hides header when scrolling down\n * Shows header when scrolling up\n * @constructor\n * @param {DOMElement} elem the header element\n * @param {Object} options options for the widget\n */\n function Headroom(elem, options) {\n options = options || {};\n Object.assign(this, Headroom.options, options);\n this.classes = Object.assign({}, Headroom.options.classes, options.classes);\n\n this.elem = elem;\n this.tolerance = normalizeUpDown(this.tolerance);\n this.offset = normalizeUpDown(this.offset);\n this.initialised = false;\n this.frozen = false;\n }\n Headroom.prototype = {\n constructor: Headroom,\n\n /**\n * Start listening to scrolling\n * @public\n */\n init: function() {\n if (Headroom.cutsTheMustard && !this.initialised) {\n this.addClass(\"initial\");\n this.initialised = true;\n\n // defer event registration to handle browser\n // potentially restoring previous scroll position\n setTimeout(\n function(self) {\n self.scrollTracker = trackScroll(\n self.scroller,\n { offset: self.offset, tolerance: self.tolerance },\n self.update.bind(self)\n );\n },\n 100,\n this\n );\n }\n\n return this;\n },\n\n /**\n * Destroy the widget, clearing up after itself\n * @public\n */\n destroy: function() {\n this.initialised = false;\n Object.keys(this.classes).forEach(this.removeClass, this);\n this.scrollTracker.destroy();\n },\n\n /**\n * Unpin the element\n * @public\n */\n unpin: function() {\n if (this.hasClass(\"pinned\") || !this.hasClass(\"unpinned\")) {\n this.addClass(\"unpinned\");\n this.removeClass(\"pinned\");\n\n if (this.onUnpin) {\n this.onUnpin.call(this);\n }\n }\n },\n\n /**\n * Pin the element\n * @public\n */\n pin: function() {\n if (this.hasClass(\"unpinned\")) {\n this.addClass(\"pinned\");\n this.removeClass(\"unpinned\");\n\n if (this.onPin) {\n this.onPin.call(this);\n }\n }\n },\n\n /**\n * Freezes the current state of the widget\n * @public\n */\n freeze: function() {\n this.frozen = true;\n this.addClass(\"frozen\");\n },\n\n /**\n * Re-enables the default behaviour of the widget\n * @public\n */\n unfreeze: function() {\n this.frozen = false;\n this.removeClass(\"frozen\");\n },\n\n top: function() {\n if (!this.hasClass(\"top\")) {\n this.addClass(\"top\");\n this.removeClass(\"notTop\");\n\n if (this.onTop) {\n this.onTop.call(this);\n }\n }\n },\n\n notTop: function() {\n if (!this.hasClass(\"notTop\")) {\n this.addClass(\"notTop\");\n this.removeClass(\"top\");\n\n if (this.onNotTop) {\n this.onNotTop.call(this);\n }\n }\n },\n\n bottom: function() {\n if (!this.hasClass(\"bottom\")) {\n this.addClass(\"bottom\");\n this.removeClass(\"notBottom\");\n\n if (this.onBottom) {\n this.onBottom.call(this);\n }\n }\n },\n\n notBottom: function() {\n if (!this.hasClass(\"notBottom\")) {\n this.addClass(\"notBottom\");\n this.removeClass(\"bottom\");\n\n if (this.onNotBottom) {\n this.onNotBottom.call(this);\n }\n }\n },\n\n shouldUnpin: function(details) {\n var scrollingDown = details.direction === \"down\";\n\n return scrollingDown && !details.top && details.toleranceExceeded;\n },\n\n shouldPin: function(details) {\n var scrollingUp = details.direction === \"up\";\n\n return (scrollingUp && details.toleranceExceeded) || details.top;\n },\n\n addClass: function(className) {\n this.elem.classList.add.apply(\n this.elem.classList,\n this.classes[className].split(\" \")\n );\n },\n\n removeClass: function(className) {\n this.elem.classList.remove.apply(\n this.elem.classList,\n this.classes[className].split(\" \")\n );\n },\n\n hasClass: function(className) {\n return this.classes[className].split(\" \").every(function(cls) {\n return this.classList.contains(cls);\n }, this.elem);\n },\n\n update: function(details) {\n if (details.isOutOfBounds) {\n // Ignore bouncy scrolling in OSX\n return;\n }\n\n if (this.frozen === true) {\n return;\n }\n\n if (details.top) {\n this.top();\n } else {\n this.notTop();\n }\n\n if (details.bottom) {\n this.bottom();\n } else {\n this.notBottom();\n }\n\n if (this.shouldUnpin(details)) {\n this.unpin();\n } else if (this.shouldPin(details)) {\n this.pin();\n }\n }\n };\n\n /**\n * Default options\n * @type {Object}\n */\n Headroom.options = {\n tolerance: {\n up: 0,\n down: 0\n },\n offset: 0,\n scroller: isBrowser() ? window : null,\n classes: {\n frozen: \"headroom--frozen\",\n pinned: \"headroom--pinned\",\n unpinned: \"headroom--unpinned\",\n top: \"headroom--top\",\n notTop: \"headroom--not-top\",\n bottom: \"headroom--bottom\",\n notBottom: \"headroom--not-bottom\",\n initial: \"headroom\"\n }\n };\n\n Headroom.cutsTheMustard = isSupported();\n\n return Headroom;\n\n}));\n","/*! npm.im/object-fit-images 3.2.4 */\n'use strict';\n\nvar OFI = 'bfred-it:object-fit-images';\nvar propRegex = /(object-fit|object-position)\\s*:\\s*([-.\\w\\s%]+)/g;\nvar testImg = typeof Image === 'undefined' ? {style: {'object-position': 1}} : new Image();\nvar supportsObjectFit = 'object-fit' in testImg.style;\nvar supportsObjectPosition = 'object-position' in testImg.style;\nvar supportsOFI = 'background-size' in testImg.style;\nvar supportsCurrentSrc = typeof testImg.currentSrc === 'string';\nvar nativeGetAttribute = testImg.getAttribute;\nvar nativeSetAttribute = testImg.setAttribute;\nvar autoModeEnabled = false;\n\nfunction createPlaceholder(w, h) {\n\treturn (\"data:image/svg+xml,%3Csvg xmlns='http://www.w3.org/2000/svg' width='\" + w + \"' height='\" + h + \"'%3E%3C/svg%3E\");\n}\n\nfunction polyfillCurrentSrc(el) {\n\tif (el.srcset && !supportsCurrentSrc && window.picturefill) {\n\t\tvar pf = window.picturefill._;\n\t\t// parse srcset with picturefill where currentSrc isn't available\n\t\tif (!el[pf.ns] || !el[pf.ns].evaled) {\n\t\t\t// force synchronous srcset parsing\n\t\t\tpf.fillImg(el, {reselect: true});\n\t\t}\n\n\t\tif (!el[pf.ns].curSrc) {\n\t\t\t// force picturefill to parse srcset\n\t\t\tel[pf.ns].supported = false;\n\t\t\tpf.fillImg(el, {reselect: true});\n\t\t}\n\n\t\t// retrieve parsed currentSrc, if any\n\t\tel.currentSrc = el[pf.ns].curSrc || el.src;\n\t}\n}\n\nfunction getStyle(el) {\n\tvar style = getComputedStyle(el).fontFamily;\n\tvar parsed;\n\tvar props = {};\n\twhile ((parsed = propRegex.exec(style)) !== null) {\n\t\tprops[parsed[1]] = parsed[2];\n\t}\n\treturn props;\n}\n\nfunction setPlaceholder(img, width, height) {\n\t// Default: fill width, no height\n\tvar placeholder = createPlaceholder(width || 1, height || 0);\n\n\t// Only set placeholder if it's different\n\tif (nativeGetAttribute.call(img, 'src') !== placeholder) {\n\t\tnativeSetAttribute.call(img, 'src', placeholder);\n\t}\n}\n\nfunction onImageReady(img, callback) {\n\t// naturalWidth is only available when the image headers are loaded,\n\t// this loop will poll it every 100ms.\n\tif (img.naturalWidth) {\n\t\tcallback(img);\n\t} else {\n\t\tsetTimeout(onImageReady, 100, img, callback);\n\t}\n}\n\nfunction fixOne(el) {\n\tvar style = getStyle(el);\n\tvar ofi = el[OFI];\n\tstyle['object-fit'] = style['object-fit'] || 'fill'; // default value\n\n\t// Avoid running where unnecessary, unless OFI had already done its deed\n\tif (!ofi.img) {\n\t\t// fill is the default behavior so no action is necessary\n\t\tif (style['object-fit'] === 'fill') {\n\t\t\treturn;\n\t\t}\n\n\t\t// Where object-fit is supported and object-position isn't (Safari < 10)\n\t\tif (\n\t\t\t!ofi.skipTest && // unless user wants to apply regardless of browser support\n\t\t\tsupportsObjectFit && // if browser already supports object-fit\n\t\t\t!style['object-position'] // unless object-position is used\n\t\t) {\n\t\t\treturn;\n\t\t}\n\t}\n\n\t// keep a clone in memory while resetting the original to a blank\n\tif (!ofi.img) {\n\t\tofi.img = new Image(el.width, el.height);\n\t\tofi.img.srcset = nativeGetAttribute.call(el, \"data-ofi-srcset\") || el.srcset;\n\t\tofi.img.src = nativeGetAttribute.call(el, \"data-ofi-src\") || el.src;\n\n\t\t// preserve for any future cloneNode calls\n\t\t// https://github.com/bfred-it/object-fit-images/issues/53\n\t\tnativeSetAttribute.call(el, \"data-ofi-src\", el.src);\n\t\tif (el.srcset) {\n\t\t\tnativeSetAttribute.call(el, \"data-ofi-srcset\", el.srcset);\n\t\t}\n\n\t\tsetPlaceholder(el, el.naturalWidth || el.width, el.naturalHeight || el.height);\n\n\t\t// remove srcset because it overrides src\n\t\tif (el.srcset) {\n\t\t\tel.srcset = '';\n\t\t}\n\t\ttry {\n\t\t\tkeepSrcUsable(el);\n\t\t} catch (err) {\n\t\t\tif (window.console) {\n\t\t\t\tconsole.warn('https://bit.ly/ofi-old-browser');\n\t\t\t}\n\t\t}\n\t}\n\n\tpolyfillCurrentSrc(ofi.img);\n\n\tel.style.backgroundImage = \"url(\\\"\" + ((ofi.img.currentSrc || ofi.img.src).replace(/\"/g, '\\\\\"')) + \"\\\")\";\n\tel.style.backgroundPosition = style['object-position'] || 'center';\n\tel.style.backgroundRepeat = 'no-repeat';\n\tel.style.backgroundOrigin = 'content-box';\n\n\tif (/scale-down/.test(style['object-fit'])) {\n\t\tonImageReady(ofi.img, function () {\n\t\t\tif (ofi.img.naturalWidth > el.width || ofi.img.naturalHeight > el.height) {\n\t\t\t\tel.style.backgroundSize = 'contain';\n\t\t\t} else {\n\t\t\t\tel.style.backgroundSize = 'auto';\n\t\t\t}\n\t\t});\n\t} else {\n\t\tel.style.backgroundSize = style['object-fit'].replace('none', 'auto').replace('fill', '100% 100%');\n\t}\n\n\tonImageReady(ofi.img, function (img) {\n\t\tsetPlaceholder(el, img.naturalWidth, img.naturalHeight);\n\t});\n}\n\nfunction keepSrcUsable(el) {\n\tvar descriptors = {\n\t\tget: function get(prop) {\n\t\t\treturn el[OFI].img[prop ? prop : 'src'];\n\t\t},\n\t\tset: function set(value, prop) {\n\t\t\tel[OFI].img[prop ? prop : 'src'] = value;\n\t\t\tnativeSetAttribute.call(el, (\"data-ofi-\" + prop), value); // preserve for any future cloneNode\n\t\t\tfixOne(el);\n\t\t\treturn value;\n\t\t}\n\t};\n\tObject.defineProperty(el, 'src', descriptors);\n\tObject.defineProperty(el, 'currentSrc', {\n\t\tget: function () { return descriptors.get('currentSrc'); }\n\t});\n\tObject.defineProperty(el, 'srcset', {\n\t\tget: function () { return descriptors.get('srcset'); },\n\t\tset: function (ss) { return descriptors.set(ss, 'srcset'); }\n\t});\n}\n\nfunction hijackAttributes() {\n\tfunction getOfiImageMaybe(el, name) {\n\t\treturn el[OFI] && el[OFI].img && (name === 'src' || name === 'srcset') ? el[OFI].img : el;\n\t}\n\tif (!supportsObjectPosition) {\n\t\tHTMLImageElement.prototype.getAttribute = function (name) {\n\t\t\treturn nativeGetAttribute.call(getOfiImageMaybe(this, name), name);\n\t\t};\n\n\t\tHTMLImageElement.prototype.setAttribute = function (name, value) {\n\t\t\treturn nativeSetAttribute.call(getOfiImageMaybe(this, name), name, String(value));\n\t\t};\n\t}\n}\n\nfunction fix(imgs, opts) {\n\tvar startAutoMode = !autoModeEnabled && !imgs;\n\topts = opts || {};\n\timgs = imgs || 'img';\n\n\tif ((supportsObjectPosition && !opts.skipTest) || !supportsOFI) {\n\t\treturn false;\n\t}\n\n\t// use imgs as a selector or just select all images\n\tif (imgs === 'img') {\n\t\timgs = document.getElementsByTagName('img');\n\t} else if (typeof imgs === 'string') {\n\t\timgs = document.querySelectorAll(imgs);\n\t} else if (!('length' in imgs)) {\n\t\timgs = [imgs];\n\t}\n\n\t// apply fix to all\n\tfor (var i = 0; i < imgs.length; i++) {\n\t\timgs[i][OFI] = imgs[i][OFI] || {\n\t\t\tskipTest: opts.skipTest\n\t\t};\n\t\tfixOne(imgs[i]);\n\t}\n\n\tif (startAutoMode) {\n\t\tdocument.body.addEventListener('load', function (e) {\n\t\t\tif (e.target.tagName === 'IMG') {\n\t\t\t\tfix(e.target, {\n\t\t\t\t\tskipTest: opts.skipTest\n\t\t\t\t});\n\t\t\t}\n\t\t}, true);\n\t\tautoModeEnabled = true;\n\t\timgs = 'img'; // reset to a generic selector for watchMQ\n\t}\n\n\t// if requested, watch media queries for object-fit change\n\tif (opts.watchMQ) {\n\t\twindow.addEventListener('resize', fix.bind(null, imgs, {\n\t\t\tskipTest: opts.skipTest\n\t\t}));\n\t}\n}\n\nfix.supportsObjectFit = supportsObjectFit;\nfix.supportsObjectPosition = supportsObjectPosition;\n\nhijackAttributes();\n\nmodule.exports = fix;\n","\n// ------------------------------------------\n// Rellax.js\n// Buttery smooth parallax library\n// Copyright (c) 2016 Moe Amaya (@moeamaya)\n// MIT license\n//\n// Thanks to Paraxify.js and Jaime Cabllero\n// for parallax concepts\n// ------------------------------------------\n\n(function (root, factory) {\n if (typeof define === 'function' && define.amd) {\n // AMD. Register as an anonymous module.\n define([], factory);\n } else if (typeof module === 'object' && module.exports) {\n // Node. Does not work with strict CommonJS, but\n // only CommonJS-like environments that support module.exports,\n // like Node.\n module.exports = factory();\n } else {\n // Browser globals (root is window)\n root.Rellax = factory();\n }\n}(typeof window !== \"undefined\" ? window : global, function () {\n var Rellax = function(el, options){\n \"use strict\";\n\n var self = Object.create(Rellax.prototype);\n\n var posY = 0;\n var screenY = 0;\n var posX = 0;\n var screenX = 0;\n var blocks = [];\n var pause = true;\n\n // check what requestAnimationFrame to use, and if\n // it's not supported, use the onscroll event\n var loop = window.requestAnimationFrame ||\n window.webkitRequestAnimationFrame ||\n window.mozRequestAnimationFrame ||\n window.msRequestAnimationFrame ||\n window.oRequestAnimationFrame ||\n function(callback){ return setTimeout(callback, 1000 / 60); };\n\n // store the id for later use\n var loopId = null;\n\n // check what cancelAnimation method to use\n var clearLoop = window.cancelAnimationFrame || window.mozCancelAnimationFrame || clearTimeout;\n\n // check which transform property to use\n var transformProp = window.transformProp || (function(){\n var testEl = document.createElement('div');\n if (testEl.style.transform === null) {\n var vendors = ['Webkit', 'Moz', 'ms'];\n for (var vendor in vendors) {\n if (testEl.style[ vendors[vendor] + 'Transform' ] !== undefined) {\n return vendors[vendor] + 'Transform';\n }\n }\n }\n return 'transform';\n })();\n\n // Default Settings\n self.options = {\n speed: -2,\n center: false,\n wrapper: null,\n relativeToWrapper: false,\n round: true,\n vertical: true,\n horizontal: false,\n callback: function() {},\n };\n\n // User defined options (might have more in the future)\n if (options){\n Object.keys(options).forEach(function(key){\n self.options[key] = options[key];\n });\n }\n\n // By default, rellax class\n if (!el) {\n el = '.rellax';\n }\n\n // check if el is a className or a node\n var elements = typeof el === 'string' ? document.querySelectorAll(el) : [el];\n\n // Now query selector\n if (elements.length > 0) {\n self.elems = elements;\n }\n\n // The elements don't exist\n else {\n throw new Error(\"The elements you're trying to select don't exist.\");\n }\n\n // Has a wrapper and it exists\n if (self.options.wrapper) {\n if (!self.options.wrapper.nodeType) {\n var wrapper = document.querySelector(self.options.wrapper);\n\n if (wrapper) {\n self.options.wrapper = wrapper;\n } else {\n throw new Error(\"The wrapper you're trying to use don't exist.\");\n }\n }\n }\n\n\n // Get and cache initial position of all elements\n var cacheBlocks = function() {\n for (var i = 0; i < self.elems.length; i++){\n var block = createBlock(self.elems[i]);\n blocks.push(block);\n }\n };\n\n\n // Let's kick this script off\n // Build array for cached element values\n var init = function() {\n for (var i = 0; i < blocks.length; i++){\n self.elems[i].style.cssText = blocks[i].style;\n }\n\n blocks = [];\n\n screenY = window.innerHeight;\n screenX = window.innerWidth;\n setPosition();\n\n cacheBlocks();\n\n // If paused, unpause and set listener for window resizing events\n if (pause) {\n window.addEventListener('resize', init);\n pause = false;\n }\n animate();\n };\n\n // We want to cache the parallax blocks'\n // values: base, top, height, speed\n // el: is dom object, return: el cache values\n var createBlock = function(el) {\n var dataPercentage = el.getAttribute( 'data-rellax-percentage' );\n var dataSpeed = el.getAttribute( 'data-rellax-speed' );\n var dataZindex = el.getAttribute( 'data-rellax-zindex' ) || 0;\n\n // initializing at scrollY = 0 (top of browser), scrollX = 0 (left of browser)\n // ensures elements are positioned based on HTML layout.\n //\n // If the element has the percentage attribute, the posY and posX needs to be\n // the current scroll position's value, so that the elements are still positioned based on HTML layout\n var wrapperPosY = self.options.wrapper ? self.options.wrapper.scrollTop : (window.pageYOffset || document.documentElement.scrollTop || document.body.scrollTop);\n // If the option relativeToWrapper is true, use the wrappers offset to top, subtracted from the current page scroll.\n if (self.options.relativeToWrapper) {\n var scrollPosY = (window.pageYOffset || document.documentElement.scrollTop || document.body.scrollTop);\n wrapperPosY = scrollPosY - self.options.wrapper.offsetTop;\n }\n var posY = self.options.vertical ? ( dataPercentage || self.options.center ? wrapperPosY : 0 ) : 0;\n var posX = self.options.horizontal ? ( dataPercentage || self.options.center ? (window.pageXOffset || document.documentElement.scrollLeft || document.body.scrollLeft) : 0 ) : 0;\n\n var blockTop = posY + el.getBoundingClientRect().top;\n var blockHeight = el.clientHeight || el.offsetHeight || el.scrollHeight;\n\n var blockLeft = posX + el.getBoundingClientRect().left;\n var blockWidth = el.clientWidth || el.offsetWidth || el.scrollWidth;\n\n // apparently parallax equation everyone uses\n var percentageY = dataPercentage ? dataPercentage : (posY - blockTop + screenY) / (blockHeight + screenY);\n var percentageX = dataPercentage ? dataPercentage : (posX - blockLeft + screenX) / (blockWidth + screenX);\n if(self.options.center){ percentageX = 0.5; percentageY = 0.5; }\n\n // Optional individual block speed as data attr, otherwise global speed\n var speed = dataSpeed ? dataSpeed : self.options.speed;\n\n var bases = updatePosition(percentageX, percentageY, speed);\n\n // ~~Store non-translate3d transforms~~\n // Store inline styles and extract transforms\n var style = el.style.cssText;\n var transform = '';\n\n // Check if there's an inline styled transform\n if (style.indexOf('transform') >= 0) {\n // Get the index of the transform\n var index = style.indexOf('transform');\n\n // Trim the style to the transform point and get the following semi-colon index\n var trimmedStyle = style.slice(index);\n var delimiter = trimmedStyle.indexOf(';');\n\n // Remove \"transform\" string and save the attribute\n if (delimiter) {\n transform = \" \" + trimmedStyle.slice(11, delimiter).replace(/\\s/g,'');\n } else {\n transform = \" \" + trimmedStyle.slice(11).replace(/\\s/g,'');\n }\n }\n\n return {\n baseX: bases.x,\n baseY: bases.y,\n top: blockTop,\n left: blockLeft,\n height: blockHeight,\n width: blockWidth,\n speed: speed,\n style: style,\n transform: transform,\n zindex: dataZindex\n };\n };\n\n // set scroll position (posY, posX)\n // side effect method is not ideal, but okay for now\n // returns true if the scroll changed, false if nothing happened\n var setPosition = function() {\n var oldY = posY;\n var oldX = posX;\n\n posY = self.options.wrapper ? self.options.wrapper.scrollTop : (document.documentElement || document.body.parentNode || document.body).scrollTop || window.pageYOffset;\n posX = self.options.wrapper ? self.options.wrapper.scrollLeft : (document.documentElement || document.body.parentNode || document.body).scrollLeft || window.pageXOffset;\n // If option relativeToWrapper is true, use relative wrapper value instead.\n if (self.options.relativeToWrapper) {\n var scrollPosY = (document.documentElement || document.body.parentNode || document.body).scrollTop || window.pageYOffset;\n posY = scrollPosY - self.options.wrapper.offsetTop;\n }\n\n\n if (oldY != posY && self.options.vertical) {\n // scroll changed, return true\n return true;\n }\n\n if (oldX != posX && self.options.horizontal) {\n // scroll changed, return true\n return true;\n }\n\n // scroll did not change\n return false;\n };\n\n // Ahh a pure function, gets new transform value\n // based on scrollPosition and speed\n // Allow for decimal pixel values\n var updatePosition = function(percentageX, percentageY, speed) {\n var result = {};\n var valueX = (speed * (100 * (1 - percentageX)));\n var valueY = (speed * (100 * (1 - percentageY)));\n\n result.x = self.options.round ? Math.round(valueX) : Math.round(valueX * 100) / 100;\n result.y = self.options.round ? Math.round(valueY) : Math.round(valueY * 100) / 100;\n\n return result;\n };\n\n // Loop\n var update = function() {\n if (setPosition() && pause === false) {\n animate();\n }\n\n // loop again\n loopId = loop(update);\n };\n\n // Transform3d on parallax element\n var animate = function() {\n var positions;\n for (var i = 0; i < self.elems.length; i++){\n var percentageY = ((posY - blocks[i].top + screenY) / (blocks[i].height + screenY));\n var percentageX = ((posX - blocks[i].left + screenX) / (blocks[i].width + screenX));\n\n // Subtracting initialize value, so element stays in same spot as HTML\n positions = updatePosition(percentageX, percentageY, blocks[i].speed);// - blocks[i].baseX;\n var positionY = positions.y - blocks[i].baseY;\n var positionX = positions.x - blocks[i].baseX;\n\n var zindex = blocks[i].zindex;\n\n // Move that element\n // (Set the new translation and append initial inline transforms.)\n var translate = 'translate3d(' + (self.options.horizontal ? positionX : '0') + 'px,' + (self.options.vertical ? positionY : '0') + 'px,' + zindex + 'px) ' + blocks[i].transform;\n self.elems[i].style[transformProp] = translate;\n }\n self.options.callback(positions);\n };\n\n self.destroy = function() {\n for (var i = 0; i < self.elems.length; i++){\n self.elems[i].style.cssText = blocks[i].style;\n }\n\n // Remove resize event listener if not pause, and pause\n if (!pause) {\n window.removeEventListener('resize', init);\n pause = true;\n }\n\n // Clear the animation loop to prevent possible memory leak\n clearLoop(loopId);\n loopId = null;\n };\n\n // Init\n init();\n\n // Start the loop\n update();\n\n // Allow to recalculate the initial values whenever we want\n self.refresh = init;\n\n return self;\n };\n return Rellax;\n}));\n","var root = require('./_root');\n\n/**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n * console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\nvar now = function() {\n return root.Date.now();\n};\n\nmodule.exports = now;\n","var trimmedEndIndex = require('./_trimmedEndIndex');\n\n/** Used to match leading whitespace. */\nvar reTrimStart = /^\\s+/;\n\n/**\n * The base implementation of `_.trim`.\n *\n * @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n */\nfunction baseTrim(string) {\n return string\n ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n : string;\n}\n\nmodule.exports = baseTrim;\n","/** Used to match a single whitespace character. */\nvar reWhitespace = /\\s/;\n\n/**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n */\nfunction trimmedEndIndex(string) {\n var index = string.length;\n\n while (index-- && reWhitespace.test(string.charAt(index))) {}\n return index;\n}\n\nmodule.exports = trimmedEndIndex;\n","var Symbol = require('./_Symbol');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\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 */\nfunction 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\nmodule.exports = getRawTag;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\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 */\nfunction objectToString(value) {\n return nativeObjectToString.call(value);\n}\n\nmodule.exports = objectToString;\n","var isObject = require('./isObject'),\n now = require('./now'),\n toNumber = require('./toNumber');\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max,\n nativeMin = Math.min;\n\n/**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n * Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n * The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n * Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n * 'leading': true,\n * 'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\nfunction debounce(func, wait, options) {\n var lastArgs,\n lastThis,\n maxWait,\n result,\n timerId,\n lastCallTime,\n lastInvokeTime = 0,\n leading = false,\n maxing = false,\n trailing = true;\n\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n wait = toNumber(wait) || 0;\n if (isObject(options)) {\n leading = !!options.leading;\n maxing = 'maxWait' in options;\n maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n trailing = 'trailing' in options ? !!options.trailing : trailing;\n }\n\n function invokeFunc(time) {\n var args = lastArgs,\n thisArg = lastThis;\n\n lastArgs = lastThis = undefined;\n lastInvokeTime = time;\n result = func.apply(thisArg, args);\n return result;\n }\n\n function leadingEdge(time) {\n // Reset any `maxWait` timer.\n lastInvokeTime = time;\n // Start the timer for the trailing edge.\n timerId = setTimeout(timerExpired, wait);\n // Invoke the leading edge.\n return leading ? invokeFunc(time) : result;\n }\n\n function remainingWait(time) {\n var timeSinceLastCall = time - lastCallTime,\n timeSinceLastInvoke = time - lastInvokeTime,\n 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\nmodule.exports = debounce;\n","/* globals __webpack_amd_options__ */\r\nmodule.exports = __webpack_amd_options__;\r\n","var freeGlobal = require('./_freeGlobal');\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\nmodule.exports = root;\n","/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n var type = typeof value;\n return value != null && (type == 'object' || type == 'function');\n}\n\nmodule.exports = isObject;\n","var root = require('./_root');\n\n/** Built-in value references. */\nvar Symbol = root.Symbol;\n\nmodule.exports = Symbol;\n","var Symbol = require('./_Symbol'),\n getRawTag = require('./_getRawTag'),\n objectToString = require('./_objectToString');\n\n/** `Object#toString` result references. */\nvar nullTag = '[object Null]',\n undefinedTag = '[object Undefined]';\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\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 */\nfunction 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\nmodule.exports = baseGetTag;\n","/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n return value != null && typeof value == 'object';\n}\n\nmodule.exports = isObjectLike;\n","// Public: Create a new SelectorSet.\nexport default function SelectorSet() {\n // Construct new SelectorSet if called as a function.\n if (!(this instanceof SelectorSet)) {\n return new SelectorSet();\n }\n\n // Public: Number of selectors added to the set\n this.size = 0;\n\n // Internal: Incrementing ID counter\n this.uid = 0;\n\n // Internal: Array of String selectors in the set\n this.selectors = [];\n\n // Internal: Map of selector ids to objects\n this.selectorObjects = {};\n\n // Internal: All Object index String names mapping to Index objects.\n this.indexes = Object.create(this.indexes);\n\n // Internal: Used Object index String names mapping to Index objects.\n this.activeIndexes = [];\n}\n\n// Detect prefixed Element#matches function.\nvar docElem = window.document.documentElement;\nvar matches =\n docElem.matches ||\n docElem.webkitMatchesSelector ||\n docElem.mozMatchesSelector ||\n docElem.oMatchesSelector ||\n docElem.msMatchesSelector;\n\n// Public: Check if element matches selector.\n//\n// Maybe overridden with custom Element.matches function.\n//\n// el - An Element\n// selector - String CSS selector\n//\n// Returns true or false.\nSelectorSet.prototype.matchesSelector = function(el, selector) {\n return matches.call(el, selector);\n};\n\n// Public: Find all elements in the context that match the selector.\n//\n// Maybe overridden with custom querySelectorAll function.\n//\n// selectors - String CSS selectors.\n// context - Element context\n//\n// Returns non-live list of Elements.\nSelectorSet.prototype.querySelectorAll = function(selectors, context) {\n return context.querySelectorAll(selectors);\n};\n\n// Public: Array of indexes.\n//\n// name - Unique String name\n// selector - Function that takes a String selector and returns a String key\n// or undefined if it can't be used by the index.\n// element - Function that takes an Element and returns an Array of String\n// keys that point to indexed values.\n//\nSelectorSet.prototype.indexes = [];\n\n// Index by element id\nvar idRe = /^#((?:[\\w\\u00c0-\\uFFFF\\-]|\\\\.)+)/g;\nSelectorSet.prototype.indexes.push({\n name: 'ID',\n selector: function matchIdSelector(sel) {\n var m;\n if ((m = sel.match(idRe))) {\n return m[0].slice(1);\n }\n },\n element: function getElementId(el) {\n if (el.id) {\n return [el.id];\n }\n }\n});\n\n// Index by all of its class names\nvar classRe = /^\\.((?:[\\w\\u00c0-\\uFFFF\\-]|\\\\.)+)/g;\nSelectorSet.prototype.indexes.push({\n name: 'CLASS',\n selector: function matchClassSelector(sel) {\n var m;\n if ((m = sel.match(classRe))) {\n return m[0].slice(1);\n }\n },\n element: function getElementClassNames(el) {\n var className = el.className;\n if (className) {\n if (typeof className === 'string') {\n return className.split(/\\s/);\n } else if (typeof className === 'object' && 'baseVal' in className) {\n // className is a SVGAnimatedString\n // global SVGAnimatedString is not an exposed global in Opera 12\n return className.baseVal.split(/\\s/);\n }\n }\n }\n});\n\n// Index by tag/node name: `DIV`, `FORM`, `A`\nvar tagRe = /^((?:[\\w\\u00c0-\\uFFFF\\-]|\\\\.)+)/g;\nSelectorSet.prototype.indexes.push({\n name: 'TAG',\n selector: function matchTagSelector(sel) {\n var m;\n if ((m = sel.match(tagRe))) {\n return m[0].toUpperCase();\n }\n },\n element: function getElementTagName(el) {\n return [el.nodeName.toUpperCase()];\n }\n});\n\n// Default index just contains a single array of elements.\nSelectorSet.prototype.indexes['default'] = {\n name: 'UNIVERSAL',\n selector: function() {\n return true;\n },\n element: function() {\n return [true];\n }\n};\n\n// Use ES Maps when supported\nvar Map;\nif (typeof window.Map === 'function') {\n Map = window.Map;\n} else {\n Map = (function() {\n function Map() {\n this.map = {};\n }\n Map.prototype.get = function(key) {\n return this.map[key + ' '];\n };\n Map.prototype.set = function(key, value) {\n this.map[key + ' '] = value;\n };\n return Map;\n })();\n}\n\n// Regexps adopted from Sizzle\n// https://github.com/jquery/sizzle/blob/1.7/sizzle.js\n//\nvar chunker = /((?:\\((?:\\([^()]+\\)|[^()]+)+\\)|\\[(?:\\[[^\\[\\]]*\\]|['\"][^'\"]*['\"]|[^\\[\\]'\"]+)+\\]|\\\\.|[^ >+~,(\\[\\\\]+)+|[>+~])(\\s*,\\s*)?((?:.|\\r|\\n)*)/g;\n\n// Internal: Get indexes for selector.\n//\n// selector - String CSS selector\n//\n// Returns Array of {index, key}.\nfunction parseSelectorIndexes(allIndexes, selector) {\n allIndexes = allIndexes.slice(0).concat(allIndexes['default']);\n\n var allIndexesLen = allIndexes.length,\n i,\n j,\n m,\n dup,\n rest = selector,\n key,\n index,\n indexes = [];\n\n do {\n chunker.exec('');\n if ((m = chunker.exec(rest))) {\n rest = m[3];\n if (m[2] || !rest) {\n for (i = 0; i < allIndexesLen; i++) {\n index = allIndexes[i];\n if ((key = index.selector(m[1]))) {\n j = indexes.length;\n dup = false;\n while (j--) {\n if (indexes[j].index === index && indexes[j].key === key) {\n dup = true;\n break;\n }\n }\n if (!dup) {\n indexes.push({ index: index, key: key });\n }\n break;\n }\n }\n }\n }\n } while (m);\n\n return indexes;\n}\n\n// Internal: Find first item in Array that is a prototype of `proto`.\n//\n// ary - Array of objects\n// proto - Prototype of expected item in `ary`\n//\n// Returns object from `ary` if found. Otherwise returns undefined.\nfunction findByPrototype(ary, proto) {\n var i, len, item;\n for (i = 0, len = ary.length; i < len; i++) {\n item = ary[i];\n if (proto.isPrototypeOf(item)) {\n return item;\n }\n }\n}\n\n// Public: Log when added selector falls under the default index.\n//\n// This API should not be considered stable. May change between\n// minor versions.\n//\n// obj - {selector, data} Object\n//\n// SelectorSet.prototype.logDefaultIndexUsed = function(obj) {\n// console.warn(obj.selector, \"could not be indexed\");\n// };\n//\n// Returns nothing.\nSelectorSet.prototype.logDefaultIndexUsed = function() {};\n\n// Public: Add selector to set.\n//\n// selector - String CSS selector\n// data - Optional data Object (default: undefined)\n//\n// Returns nothing.\nSelectorSet.prototype.add = function(selector, data) {\n var obj,\n i,\n indexProto,\n key,\n index,\n objs,\n selectorIndexes,\n selectorIndex,\n indexes = this.activeIndexes,\n selectors = this.selectors,\n selectorObjects = this.selectorObjects;\n\n if (typeof selector !== 'string') {\n return;\n }\n\n obj = {\n id: this.uid++,\n selector: selector,\n data: data\n };\n selectorObjects[obj.id] = obj;\n\n selectorIndexes = parseSelectorIndexes(this.indexes, selector);\n for (i = 0; i < selectorIndexes.length; i++) {\n selectorIndex = selectorIndexes[i];\n key = selectorIndex.key;\n indexProto = selectorIndex.index;\n\n index = findByPrototype(indexes, indexProto);\n if (!index) {\n index = Object.create(indexProto);\n index.map = new Map();\n indexes.push(index);\n }\n\n if (indexProto === this.indexes['default']) {\n this.logDefaultIndexUsed(obj);\n }\n objs = index.map.get(key);\n if (!objs) {\n objs = [];\n index.map.set(key, objs);\n }\n objs.push(obj);\n }\n\n this.size++;\n selectors.push(selector);\n};\n\n// Public: Remove selector from set.\n//\n// selector - String CSS selector\n// data - Optional data Object (default: undefined)\n//\n// Returns nothing.\nSelectorSet.prototype.remove = function(selector, data) {\n if (typeof selector !== 'string') {\n return;\n }\n\n var selectorIndexes,\n selectorIndex,\n i,\n j,\n k,\n selIndex,\n objs,\n obj,\n indexes = this.activeIndexes,\n selectors = (this.selectors = []),\n selectorObjects = this.selectorObjects,\n removedIds = {},\n removeAll = arguments.length === 1;\n\n selectorIndexes = parseSelectorIndexes(this.indexes, selector);\n for (i = 0; i < selectorIndexes.length; i++) {\n selectorIndex = selectorIndexes[i];\n\n j = indexes.length;\n while (j--) {\n selIndex = indexes[j];\n if (selectorIndex.index.isPrototypeOf(selIndex)) {\n objs = selIndex.map.get(selectorIndex.key);\n if (objs) {\n k = objs.length;\n while (k--) {\n obj = objs[k];\n if (obj.selector === selector && (removeAll || obj.data === data)) {\n objs.splice(k, 1);\n removedIds[obj.id] = true;\n }\n }\n }\n break;\n }\n }\n }\n\n for (i in removedIds) {\n delete selectorObjects[i];\n this.size--;\n }\n\n for (i in selectorObjects) {\n selectors.push(selectorObjects[i].selector);\n }\n};\n\n// Sort by id property handler.\n//\n// a - Selector obj.\n// b - Selector obj.\n//\n// Returns Number.\nfunction sortById(a, b) {\n return a.id - b.id;\n}\n\n// Public: Find all matching decendants of the context element.\n//\n// context - An Element\n//\n// Returns Array of {selector, data, elements} matches.\nSelectorSet.prototype.queryAll = function(context) {\n if (!this.selectors.length) {\n return [];\n }\n\n var matches = {},\n results = [];\n var els = this.querySelectorAll(this.selectors.join(', '), context);\n\n var i, j, len, len2, el, m, match, obj;\n for (i = 0, len = els.length; i < len; i++) {\n el = els[i];\n m = this.matches(el);\n for (j = 0, len2 = m.length; j < len2; j++) {\n obj = m[j];\n if (!matches[obj.id]) {\n match = {\n id: obj.id,\n selector: obj.selector,\n data: obj.data,\n elements: []\n };\n matches[obj.id] = match;\n results.push(match);\n } else {\n match = matches[obj.id];\n }\n match.elements.push(el);\n }\n }\n\n return results.sort(sortById);\n};\n\n// Public: Match element against all selectors in set.\n//\n// el - An Element\n//\n// Returns Array of {selector, data} matches.\nSelectorSet.prototype.matches = function(el) {\n if (!el) {\n return [];\n }\n\n var i, j, k, len, len2, len3, index, keys, objs, obj, id;\n var indexes = this.activeIndexes,\n matchedIds = {},\n matches = [];\n\n for (i = 0, len = indexes.length; i < len; i++) {\n index = indexes[i];\n keys = index.element(el);\n if (keys) {\n for (j = 0, len2 = keys.length; j < len2; j++) {\n if ((objs = index.map.get(keys[j]))) {\n for (k = 0, len3 = objs.length; k < len3; k++) {\n obj = objs[k];\n id = obj.id;\n if (!matchedIds[id] && this.matchesSelector(el, obj.selector)) {\n matchedIds[id] = true;\n matches.push(obj);\n }\n }\n }\n }\n }\n }\n\n return matches.sort(sortById);\n};\n","import SelectorSet from 'selector-set';\n\nvar bubbleEvents = {};\nvar captureEvents = {};\nvar propagationStopped = new WeakMap();\nvar immediatePropagationStopped = new WeakMap();\nvar currentTargets = new WeakMap();\nvar currentTargetDesc = Object.getOwnPropertyDescriptor(Event.prototype, 'currentTarget');\n\nfunction before(subject, verb, fn) {\n var source = subject[verb];\n\n subject[verb] = function () {\n fn.apply(subject, arguments);\n return source.apply(subject, arguments);\n };\n\n return subject;\n}\n\nfunction matches(selectors, target, reverse) {\n var queue = [];\n var node = target;\n\n do {\n if (node.nodeType !== 1) break;\n\n var _matches = selectors.matches(node);\n\n if (_matches.length) {\n var matched = {\n node: node,\n observers: _matches\n };\n\n if (reverse) {\n queue.unshift(matched);\n } else {\n queue.push(matched);\n }\n }\n } while (node = node.parentElement);\n\n return queue;\n}\n\nfunction trackPropagation() {\n propagationStopped.set(this, true);\n}\n\nfunction trackImmediate() {\n propagationStopped.set(this, true);\n immediatePropagationStopped.set(this, true);\n}\n\nfunction getCurrentTarget() {\n return currentTargets.get(this) || null;\n}\n\nfunction defineCurrentTarget(event, getter) {\n if (!currentTargetDesc) return;\n Object.defineProperty(event, 'currentTarget', {\n configurable: true,\n enumerable: true,\n get: getter || currentTargetDesc.get\n });\n}\n\nfunction dispatch(event) {\n var events = event.eventPhase === 1 ? captureEvents : bubbleEvents;\n var selectors = events[event.type];\n if (!selectors) return;\n var queue = matches(selectors, event.target, event.eventPhase === 1);\n if (!queue.length) return;\n before(event, 'stopPropagation', trackPropagation);\n before(event, 'stopImmediatePropagation', trackImmediate);\n defineCurrentTarget(event, getCurrentTarget);\n\n for (var i = 0, len1 = queue.length; i < len1; i++) {\n if (propagationStopped.get(event)) break;\n var matched = queue[i];\n currentTargets.set(event, matched.node);\n\n for (var j = 0, len2 = matched.observers.length; j < len2; j++) {\n if (immediatePropagationStopped.get(event)) break;\n matched.observers[j].data.call(matched.node, event);\n }\n }\n\n currentTargets[\"delete\"](event);\n defineCurrentTarget(event);\n}\n\nfunction on(name, selector, fn) {\n var options = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {};\n var capture = options.capture ? true : false;\n var events = capture ? captureEvents : bubbleEvents;\n var selectors = events[name];\n\n if (!selectors) {\n selectors = new SelectorSet();\n events[name] = selectors;\n document.addEventListener(name, dispatch, capture);\n }\n\n selectors.add(selector, fn);\n}\nfunction off(name, selector, fn) {\n var options = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {};\n var capture = options.capture ? true : false;\n var events = capture ? captureEvents : bubbleEvents;\n var selectors = events[name];\n if (!selectors) return;\n selectors.remove(selector, fn);\n if (selectors.size) return;\n delete events[name];\n document.removeEventListener(name, dispatch, capture);\n}\nfunction fire(target, name, detail) {\n return target.dispatchEvent(new CustomEvent(name, {\n bubbles: true,\n cancelable: true,\n detail: detail\n }));\n}\n\nexport { fire, off, on };\n","var baseGetTag = require('./_baseGetTag'),\n isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n return typeof value == 'symbol' ||\n (isObjectLike(value) && baseGetTag(value) == symbolTag);\n}\n\nmodule.exports = isSymbol;\n","/**\n * @license\n * Lodash \n * Copyright OpenJS Foundation and other contributors \n * Released under MIT license \n * Based on Underscore.js 1.8.3 \n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n;(function() {\n\n /** Used as a safe reference for `undefined` in pre-ES5 environments. */\n var undefined;\n\n /** Used as the semantic version number. */\n var VERSION = '4.17.21';\n\n /** Used as the size to enable large array optimizations. */\n var LARGE_ARRAY_SIZE = 200;\n\n /** Error message constants. */\n var CORE_ERROR_TEXT = 'Unsupported core-js use. Try https://npms.io/search?q=ponyfill.',\n FUNC_ERROR_TEXT = 'Expected a function',\n INVALID_TEMPL_VAR_ERROR_TEXT = 'Invalid `variable` option passed into `_.template`';\n\n /** Used to stand-in for `undefined` hash values. */\n var HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n /** Used as the maximum memoize cache size. */\n var MAX_MEMOIZE_SIZE = 500;\n\n /** Used as the internal argument placeholder. */\n var PLACEHOLDER = '__lodash_placeholder__';\n\n /** Used to compose bitmasks for cloning. */\n var CLONE_DEEP_FLAG = 1,\n CLONE_FLAT_FLAG = 2,\n CLONE_SYMBOLS_FLAG = 4;\n\n /** Used to compose bitmasks for value comparisons. */\n var COMPARE_PARTIAL_FLAG = 1,\n COMPARE_UNORDERED_FLAG = 2;\n\n /** Used to compose bitmasks for function metadata. */\n var WRAP_BIND_FLAG = 1,\n WRAP_BIND_KEY_FLAG = 2,\n WRAP_CURRY_BOUND_FLAG = 4,\n WRAP_CURRY_FLAG = 8,\n WRAP_CURRY_RIGHT_FLAG = 16,\n WRAP_PARTIAL_FLAG = 32,\n WRAP_PARTIAL_RIGHT_FLAG = 64,\n WRAP_ARY_FLAG = 128,\n WRAP_REARG_FLAG = 256,\n WRAP_FLIP_FLAG = 512;\n\n /** Used as default options for `_.truncate`. */\n var DEFAULT_TRUNC_LENGTH = 30,\n DEFAULT_TRUNC_OMISSION = '...';\n\n /** Used to detect hot functions by number of calls within a span of milliseconds. */\n var HOT_COUNT = 800,\n HOT_SPAN = 16;\n\n /** Used to indicate the type of lazy iteratees. */\n var LAZY_FILTER_FLAG = 1,\n LAZY_MAP_FLAG = 2,\n LAZY_WHILE_FLAG = 3;\n\n /** Used as references for various `Number` constants. */\n var INFINITY = 1 / 0,\n MAX_SAFE_INTEGER = 9007199254740991,\n MAX_INTEGER = 1.7976931348623157e+308,\n NAN = 0 / 0;\n\n /** Used as references for the maximum length and index of an array. */\n var MAX_ARRAY_LENGTH = 4294967295,\n MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1,\n HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;\n\n /** Used to associate wrap methods with their bit flags. */\n var wrapFlags = [\n ['ary', WRAP_ARY_FLAG],\n ['bind', WRAP_BIND_FLAG],\n ['bindKey', WRAP_BIND_KEY_FLAG],\n ['curry', WRAP_CURRY_FLAG],\n ['curryRight', WRAP_CURRY_RIGHT_FLAG],\n ['flip', WRAP_FLIP_FLAG],\n ['partial', WRAP_PARTIAL_FLAG],\n ['partialRight', WRAP_PARTIAL_RIGHT_FLAG],\n ['rearg', WRAP_REARG_FLAG]\n ];\n\n /** `Object#toString` result references. */\n var argsTag = '[object Arguments]',\n arrayTag = '[object Array]',\n asyncTag = '[object AsyncFunction]',\n boolTag = '[object Boolean]',\n dateTag = '[object Date]',\n domExcTag = '[object DOMException]',\n errorTag = '[object Error]',\n funcTag = '[object Function]',\n genTag = '[object GeneratorFunction]',\n mapTag = '[object Map]',\n numberTag = '[object Number]',\n nullTag = '[object Null]',\n objectTag = '[object Object]',\n promiseTag = '[object Promise]',\n proxyTag = '[object Proxy]',\n regexpTag = '[object RegExp]',\n setTag = '[object Set]',\n stringTag = '[object String]',\n symbolTag = '[object Symbol]',\n undefinedTag = '[object Undefined]',\n weakMapTag = '[object WeakMap]',\n weakSetTag = '[object WeakSet]';\n\n var arrayBufferTag = '[object ArrayBuffer]',\n dataViewTag = '[object DataView]',\n float32Tag = '[object Float32Array]',\n float64Tag = '[object Float64Array]',\n int8Tag = '[object Int8Array]',\n int16Tag = '[object Int16Array]',\n int32Tag = '[object Int32Array]',\n uint8Tag = '[object Uint8Array]',\n uint8ClampedTag = '[object Uint8ClampedArray]',\n uint16Tag = '[object Uint16Array]',\n uint32Tag = '[object Uint32Array]';\n\n /** Used to match empty string literals in compiled template source. */\n var reEmptyStringLeading = /\\b__p \\+= '';/g,\n reEmptyStringMiddle = /\\b(__p \\+=) '' \\+/g,\n reEmptyStringTrailing = /(__e\\(.*?\\)|\\b__t\\)) \\+\\n'';/g;\n\n /** Used to match HTML entities and HTML characters. */\n var reEscapedHtml = /&(?:amp|lt|gt|quot|#39);/g,\n reUnescapedHtml = /[&<>\"']/g,\n reHasEscapedHtml = RegExp(reEscapedHtml.source),\n reHasUnescapedHtml = RegExp(reUnescapedHtml.source);\n\n /** Used to match template delimiters. */\n var reEscape = /<%-([\\s\\S]+?)%>/g,\n reEvaluate = /<%([\\s\\S]+?)%>/g,\n reInterpolate = /<%=([\\s\\S]+?)%>/g;\n\n /** Used to match property names within property paths. */\n var reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n reIsPlainProp = /^\\w*$/,\n rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n /**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\n var reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g,\n reHasRegExpChar = RegExp(reRegExpChar.source);\n\n /** Used to match leading whitespace. */\n var reTrimStart = /^\\s+/;\n\n /** Used to match a single whitespace character. */\n var reWhitespace = /\\s/;\n\n /** Used to match wrap detail comments. */\n var reWrapComment = /\\{(?:\\n\\/\\* \\[wrapped with .+\\] \\*\\/)?\\n?/,\n reWrapDetails = /\\{\\n\\/\\* \\[wrapped with (.+)\\] \\*/,\n reSplitDetails = /,? & /;\n\n /** Used to match words composed of alphanumeric characters. */\n var reAsciiWord = /[^\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\x7f]+/g;\n\n /**\n * Used to validate the `validate` option in `_.template` variable.\n *\n * Forbids characters which could potentially change the meaning of the function argument definition:\n * - \"(),\" (modification of function parameters)\n * - \"=\" (default value)\n * - \"[]{}\" (destructuring of function parameters)\n * - \"/\" (beginning of a comment)\n * - whitespace\n */\n var reForbiddenIdentifierChars = /[()=,{}\\[\\]\\/\\s]/;\n\n /** Used to match backslashes in property paths. */\n var reEscapeChar = /\\\\(\\\\)?/g;\n\n /**\n * Used to match\n * [ES template delimiters](http://ecma-international.org/ecma-262/7.0/#sec-template-literal-lexical-components).\n */\n var reEsTemplate = /\\$\\{([^\\\\}]*(?:\\\\.[^\\\\}]*)*)\\}/g;\n\n /** Used to match `RegExp` flags from their coerced string values. */\n var reFlags = /\\w*$/;\n\n /** Used to detect bad signed hexadecimal string values. */\n var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n /** Used to detect binary string values. */\n var reIsBinary = /^0b[01]+$/i;\n\n /** Used to detect host constructors (Safari). */\n var reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n /** Used to detect octal string values. */\n var reIsOctal = /^0o[0-7]+$/i;\n\n /** Used to detect unsigned integer values. */\n var reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n /** Used to match Latin Unicode letters (excluding mathematical operators). */\n var reLatin = /[\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\xff\\u0100-\\u017f]/g;\n\n /** Used to ensure capturing order of template delimiters. */\n var reNoMatch = /($^)/;\n\n /** Used to match unescaped characters in compiled string literals. */\n var reUnescapedString = /['\\n\\r\\u2028\\u2029\\\\]/g;\n\n /** Used to compose unicode character classes. */\n var rsAstralRange = '\\\\ud800-\\\\udfff',\n rsComboMarksRange = '\\\\u0300-\\\\u036f',\n reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n rsDingbatRange = '\\\\u2700-\\\\u27bf',\n rsLowerRange = 'a-z\\\\xdf-\\\\xf6\\\\xf8-\\\\xff',\n rsMathOpRange = '\\\\xac\\\\xb1\\\\xd7\\\\xf7',\n rsNonCharRange = '\\\\x00-\\\\x2f\\\\x3a-\\\\x40\\\\x5b-\\\\x60\\\\x7b-\\\\xbf',\n rsPunctuationRange = '\\\\u2000-\\\\u206f',\n rsSpaceRange = ' \\\\t\\\\x0b\\\\f\\\\xa0\\\\ufeff\\\\n\\\\r\\\\u2028\\\\u2029\\\\u1680\\\\u180e\\\\u2000\\\\u2001\\\\u2002\\\\u2003\\\\u2004\\\\u2005\\\\u2006\\\\u2007\\\\u2008\\\\u2009\\\\u200a\\\\u202f\\\\u205f\\\\u3000',\n rsUpperRange = 'A-Z\\\\xc0-\\\\xd6\\\\xd8-\\\\xde',\n rsVarRange = '\\\\ufe0e\\\\ufe0f',\n rsBreakRange = rsMathOpRange + rsNonCharRange + rsPunctuationRange + rsSpaceRange;\n\n /** Used to compose unicode capture groups. */\n var rsApos = \"['\\u2019]\",\n rsAstral = '[' + rsAstralRange + ']',\n rsBreak = '[' + rsBreakRange + ']',\n rsCombo = '[' + rsComboRange + ']',\n rsDigits = '\\\\d+',\n rsDingbat = '[' + rsDingbatRange + ']',\n rsLower = '[' + rsLowerRange + ']',\n rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']',\n rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n rsNonAstral = '[^' + rsAstralRange + ']',\n rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n rsUpper = '[' + rsUpperRange + ']',\n rsZWJ = '\\\\u200d';\n\n /** Used to compose unicode regexes. */\n var rsMiscLower = '(?:' + rsLower + '|' + rsMisc + ')',\n rsMiscUpper = '(?:' + rsUpper + '|' + rsMisc + ')',\n rsOptContrLower = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',\n rsOptContrUpper = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',\n reOptMod = rsModifier + '?',\n rsOptVar = '[' + rsVarRange + ']?',\n rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n rsOrdLower = '\\\\d*(?:1st|2nd|3rd|(?![123])\\\\dth)(?=\\\\b|[A-Z_])',\n rsOrdUpper = '\\\\d*(?:1ST|2ND|3RD|(?![123])\\\\dTH)(?=\\\\b|[a-z_])',\n rsSeq = rsOptVar + reOptMod + rsOptJoin,\n rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq,\n rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n /** Used to match apostrophes. */\n var reApos = RegExp(rsApos, 'g');\n\n /**\n * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and\n * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).\n */\n var reComboMark = RegExp(rsCombo, 'g');\n\n /** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\n var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n /** Used to match complex or compound words. */\n var reUnicodeWord = RegExp([\n rsUpper + '?' + rsLower + '+' + rsOptContrLower + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',\n rsMiscUpper + '+' + rsOptContrUpper + '(?=' + [rsBreak, rsUpper + rsMiscLower, '$'].join('|') + ')',\n rsUpper + '?' + rsMiscLower + '+' + rsOptContrLower,\n rsUpper + '+' + rsOptContrUpper,\n rsOrdUpper,\n rsOrdLower,\n rsDigits,\n rsEmoji\n ].join('|'), 'g');\n\n /** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\n var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange + rsComboRange + rsVarRange + ']');\n\n /** Used to detect strings that need a more robust regexp to match words. */\n var reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;\n\n /** Used to assign default `context` object properties. */\n var contextProps = [\n 'Array', 'Buffer', 'DataView', 'Date', 'Error', 'Float32Array', 'Float64Array',\n 'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Map', 'Math', 'Object',\n 'Promise', 'RegExp', 'Set', 'String', 'Symbol', 'TypeError', 'Uint8Array',\n 'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap',\n '_', 'clearTimeout', 'isFinite', 'parseInt', 'setTimeout'\n ];\n\n /** Used to make template sourceURLs easier to identify. */\n var templateCounter = -1;\n\n /** Used to identify `toStringTag` values of typed arrays. */\n var typedArrayTags = {};\n typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\n typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\n typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\n typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\n typedArrayTags[uint32Tag] = true;\n typedArrayTags[argsTag] = typedArrayTags[arrayTag] =\n typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\n typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\n typedArrayTags[errorTag] = typedArrayTags[funcTag] =\n typedArrayTags[mapTag] = typedArrayTags[numberTag] =\n typedArrayTags[objectTag] = typedArrayTags[regexpTag] =\n typedArrayTags[setTag] = typedArrayTags[stringTag] =\n typedArrayTags[weakMapTag] = false;\n\n /** Used to identify `toStringTag` values supported by `_.clone`. */\n var cloneableTags = {};\n cloneableTags[argsTag] = cloneableTags[arrayTag] =\n cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\n cloneableTags[boolTag] = cloneableTags[dateTag] =\n cloneableTags[float32Tag] = cloneableTags[float64Tag] =\n cloneableTags[int8Tag] = cloneableTags[int16Tag] =\n cloneableTags[int32Tag] = cloneableTags[mapTag] =\n cloneableTags[numberTag] = cloneableTags[objectTag] =\n cloneableTags[regexpTag] = cloneableTags[setTag] =\n cloneableTags[stringTag] = cloneableTags[symbolTag] =\n cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\n cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\n cloneableTags[errorTag] = cloneableTags[funcTag] =\n cloneableTags[weakMapTag] = false;\n\n /** Used to map Latin Unicode letters to basic Latin letters. */\n var deburredLetters = {\n // Latin-1 Supplement block.\n '\\xc0': 'A', '\\xc1': 'A', '\\xc2': 'A', '\\xc3': 'A', '\\xc4': 'A', '\\xc5': 'A',\n '\\xe0': 'a', '\\xe1': 'a', '\\xe2': 'a', '\\xe3': 'a', '\\xe4': 'a', '\\xe5': 'a',\n '\\xc7': 'C', '\\xe7': 'c',\n '\\xd0': 'D', '\\xf0': 'd',\n '\\xc8': 'E', '\\xc9': 'E', '\\xca': 'E', '\\xcb': 'E',\n '\\xe8': 'e', '\\xe9': 'e', '\\xea': 'e', '\\xeb': 'e',\n '\\xcc': 'I', '\\xcd': 'I', '\\xce': 'I', '\\xcf': 'I',\n '\\xec': 'i', '\\xed': 'i', '\\xee': 'i', '\\xef': 'i',\n '\\xd1': 'N', '\\xf1': 'n',\n '\\xd2': 'O', '\\xd3': 'O', '\\xd4': 'O', '\\xd5': 'O', '\\xd6': 'O', '\\xd8': 'O',\n '\\xf2': 'o', '\\xf3': 'o', '\\xf4': 'o', '\\xf5': 'o', '\\xf6': 'o', '\\xf8': 'o',\n '\\xd9': 'U', '\\xda': 'U', '\\xdb': 'U', '\\xdc': 'U',\n '\\xf9': 'u', '\\xfa': 'u', '\\xfb': 'u', '\\xfc': 'u',\n '\\xdd': 'Y', '\\xfd': 'y', '\\xff': 'y',\n '\\xc6': 'Ae', '\\xe6': 'ae',\n '\\xde': 'Th', '\\xfe': 'th',\n '\\xdf': 'ss',\n // Latin Extended-A block.\n '\\u0100': 'A', '\\u0102': 'A', '\\u0104': 'A',\n '\\u0101': 'a', '\\u0103': 'a', '\\u0105': 'a',\n '\\u0106': 'C', '\\u0108': 'C', '\\u010a': 'C', '\\u010c': 'C',\n '\\u0107': 'c', '\\u0109': 'c', '\\u010b': 'c', '\\u010d': 'c',\n '\\u010e': 'D', '\\u0110': 'D', '\\u010f': 'd', '\\u0111': 'd',\n '\\u0112': 'E', '\\u0114': 'E', '\\u0116': 'E', '\\u0118': 'E', '\\u011a': 'E',\n '\\u0113': 'e', '\\u0115': 'e', '\\u0117': 'e', '\\u0119': 'e', '\\u011b': 'e',\n '\\u011c': 'G', '\\u011e': 'G', '\\u0120': 'G', '\\u0122': 'G',\n '\\u011d': 'g', '\\u011f': 'g', '\\u0121': 'g', '\\u0123': 'g',\n '\\u0124': 'H', '\\u0126': 'H', '\\u0125': 'h', '\\u0127': 'h',\n '\\u0128': 'I', '\\u012a': 'I', '\\u012c': 'I', '\\u012e': 'I', '\\u0130': 'I',\n '\\u0129': 'i', '\\u012b': 'i', '\\u012d': 'i', '\\u012f': 'i', '\\u0131': 'i',\n '\\u0134': 'J', '\\u0135': 'j',\n '\\u0136': 'K', '\\u0137': 'k', '\\u0138': 'k',\n '\\u0139': 'L', '\\u013b': 'L', '\\u013d': 'L', '\\u013f': 'L', '\\u0141': 'L',\n '\\u013a': 'l', '\\u013c': 'l', '\\u013e': 'l', '\\u0140': 'l', '\\u0142': 'l',\n '\\u0143': 'N', '\\u0145': 'N', '\\u0147': 'N', '\\u014a': 'N',\n '\\u0144': 'n', '\\u0146': 'n', '\\u0148': 'n', '\\u014b': 'n',\n '\\u014c': 'O', '\\u014e': 'O', '\\u0150': 'O',\n '\\u014d': 'o', '\\u014f': 'o', '\\u0151': 'o',\n '\\u0154': 'R', '\\u0156': 'R', '\\u0158': 'R',\n '\\u0155': 'r', '\\u0157': 'r', '\\u0159': 'r',\n '\\u015a': 'S', '\\u015c': 'S', '\\u015e': 'S', '\\u0160': 'S',\n '\\u015b': 's', '\\u015d': 's', '\\u015f': 's', '\\u0161': 's',\n '\\u0162': 'T', '\\u0164': 'T', '\\u0166': 'T',\n '\\u0163': 't', '\\u0165': 't', '\\u0167': 't',\n '\\u0168': 'U', '\\u016a': 'U', '\\u016c': 'U', '\\u016e': 'U', '\\u0170': 'U', '\\u0172': 'U',\n '\\u0169': 'u', '\\u016b': 'u', '\\u016d': 'u', '\\u016f': 'u', '\\u0171': 'u', '\\u0173': 'u',\n '\\u0174': 'W', '\\u0175': 'w',\n '\\u0176': 'Y', '\\u0177': 'y', '\\u0178': 'Y',\n '\\u0179': 'Z', '\\u017b': 'Z', '\\u017d': 'Z',\n '\\u017a': 'z', '\\u017c': 'z', '\\u017e': 'z',\n '\\u0132': 'IJ', '\\u0133': 'ij',\n '\\u0152': 'Oe', '\\u0153': 'oe',\n '\\u0149': \"'n\", '\\u017f': 's'\n };\n\n /** Used to map characters to HTML entities. */\n var htmlEscapes = {\n '&': '&',\n '<': '<',\n '>': '>',\n '\"': '"',\n \"'\": '''\n };\n\n /** Used to map HTML entities to characters. */\n var htmlUnescapes = {\n '&': '&',\n '<': '<',\n '>': '>',\n '"': '\"',\n ''': \"'\"\n };\n\n /** Used to escape characters for inclusion in compiled string literals. */\n var stringEscapes = {\n '\\\\': '\\\\',\n \"'\": \"'\",\n '\\n': 'n',\n '\\r': 'r',\n '\\u2028': 'u2028',\n '\\u2029': 'u2029'\n };\n\n /** Built-in method references without a dependency on `root`. */\n var freeParseFloat = parseFloat,\n freeParseInt = parseInt;\n\n /** Detect free variable `global` from Node.js. */\n var freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n /** Detect free variable `self`. */\n var freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n /** Used as a reference to the global object. */\n var root = freeGlobal || freeSelf || Function('return this')();\n\n /** Detect free variable `exports`. */\n var freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n /** Detect free variable `module`. */\n var freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n /** Detect the popular CommonJS extension `module.exports`. */\n var moduleExports = freeModule && freeModule.exports === freeExports;\n\n /** Detect free variable `process` from Node.js. */\n var freeProcess = moduleExports && freeGlobal.process;\n\n /** Used to access faster Node.js helpers. */\n var nodeUtil = (function() {\n try {\n // Use `util.types` for Node.js 10+.\n var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n if (types) {\n return types;\n }\n\n // Legacy `process.binding('util')` for Node.js < 10.\n return freeProcess && freeProcess.binding && freeProcess.binding('util');\n } catch (e) {}\n }());\n\n /* Node.js helper references. */\n var nodeIsArrayBuffer = nodeUtil && nodeUtil.isArrayBuffer,\n nodeIsDate = nodeUtil && nodeUtil.isDate,\n nodeIsMap = nodeUtil && nodeUtil.isMap,\n nodeIsRegExp = nodeUtil && nodeUtil.isRegExp,\n nodeIsSet = nodeUtil && nodeUtil.isSet,\n nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n /*--------------------------------------------------------------------------*/\n\n /**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\n function apply(func, thisArg, args) {\n switch (args.length) {\n case 0: return func.call(thisArg);\n case 1: return func.call(thisArg, args[0]);\n case 2: return func.call(thisArg, args[0], args[1]);\n case 3: return func.call(thisArg, args[0], args[1], args[2]);\n }\n return func.apply(thisArg, args);\n }\n\n /**\n * A specialized version of `baseAggregator` for arrays.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform keys.\n * @param {Object} accumulator The initial aggregated object.\n * @returns {Function} Returns `accumulator`.\n */\n function arrayAggregator(array, setter, iteratee, accumulator) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n var value = array[index];\n setter(accumulator, value, iteratee(value), array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\n function arrayEach(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (iteratee(array[index], index, array) === false) {\n break;\n }\n }\n return array;\n }\n\n /**\n * A specialized version of `_.forEachRight` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\n function arrayEachRight(array, iteratee) {\n var length = array == null ? 0 : array.length;\n\n while (length--) {\n if (iteratee(array[length], length, array) === false) {\n break;\n }\n }\n return array;\n }\n\n /**\n * A specialized version of `_.every` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`.\n */\n function arrayEvery(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (!predicate(array[index], index, array)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * A specialized version of `_.filter` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\n function arrayFilter(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (predicate(value, index, array)) {\n result[resIndex++] = value;\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\n function arrayIncludes(array, value) {\n var length = array == null ? 0 : array.length;\n return !!length && baseIndexOf(array, value, 0) > -1;\n }\n\n /**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\n function arrayIncludesWith(array, value, comparator) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (comparator(value, array[index])) {\n return true;\n }\n }\n return false;\n }\n\n /**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\n function arrayMap(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length,\n result = Array(length);\n\n while (++index < length) {\n result[index] = iteratee(array[index], index, array);\n }\n return result;\n }\n\n /**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\n function arrayPush(array, values) {\n var index = -1,\n length = values.length,\n offset = array.length;\n\n while (++index < length) {\n array[offset + index] = values[index];\n }\n return array;\n }\n\n /**\n * A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the first element of `array` as\n * the initial value.\n * @returns {*} Returns the accumulated value.\n */\n function arrayReduce(array, iteratee, accumulator, initAccum) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n if (initAccum && length) {\n accumulator = array[++index];\n }\n while (++index < length) {\n accumulator = iteratee(accumulator, array[index], index, array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.reduceRight` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the last element of `array` as\n * the initial value.\n * @returns {*} Returns the accumulated value.\n */\n function arrayReduceRight(array, iteratee, accumulator, initAccum) {\n var length = array == null ? 0 : array.length;\n if (initAccum && length) {\n accumulator = array[--length];\n }\n while (length--) {\n accumulator = iteratee(accumulator, array[length], length, array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.some` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n */\n function arraySome(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (predicate(array[index], index, array)) {\n return true;\n }\n }\n return false;\n }\n\n /**\n * Gets the size of an ASCII `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\n var asciiSize = baseProperty('length');\n\n /**\n * Converts an ASCII `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function asciiToArray(string) {\n return string.split('');\n }\n\n /**\n * Splits an ASCII `string` into an array of its words.\n *\n * @private\n * @param {string} The string to inspect.\n * @returns {Array} Returns the words of `string`.\n */\n function asciiWords(string) {\n return string.match(reAsciiWord) || [];\n }\n\n /**\n * The base implementation of methods like `_.findKey` and `_.findLastKey`,\n * without support for iteratee shorthands, which iterates over `collection`\n * using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the found element or its key, else `undefined`.\n */\n function baseFindKey(collection, predicate, eachFunc) {\n var result;\n eachFunc(collection, function(value, key, collection) {\n if (predicate(value, key, collection)) {\n result = key;\n return false;\n }\n });\n return result;\n }\n\n /**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseFindIndex(array, predicate, fromIndex, fromRight) {\n var length = array.length,\n index = fromIndex + (fromRight ? 1 : -1);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (predicate(array[index], index, array)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseIndexOf(array, value, fromIndex) {\n return value === value\n ? strictIndexOf(array, value, fromIndex)\n : baseFindIndex(array, baseIsNaN, fromIndex);\n }\n\n /**\n * This function is like `baseIndexOf` except that it accepts a comparator.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseIndexOfWith(array, value, fromIndex, comparator) {\n var index = fromIndex - 1,\n length = array.length;\n\n while (++index < length) {\n if (comparator(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\n function baseIsNaN(value) {\n return value !== value;\n }\n\n /**\n * The base implementation of `_.mean` and `_.meanBy` without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {number} Returns the mean.\n */\n function baseMean(array, iteratee) {\n var length = array == null ? 0 : array.length;\n return length ? (baseSum(array, iteratee) / length) : NAN;\n }\n\n /**\n * The base implementation of `_.property` without support for deep paths.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\n function baseProperty(key) {\n return function(object) {\n return object == null ? undefined : object[key];\n };\n }\n\n /**\n * The base implementation of `_.propertyOf` without support for deep paths.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Function} Returns the new accessor function.\n */\n function basePropertyOf(object) {\n return function(key) {\n return object == null ? undefined : object[key];\n };\n }\n\n /**\n * The base implementation of `_.reduce` and `_.reduceRight`, without support\n * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} accumulator The initial value.\n * @param {boolean} initAccum Specify using the first or last element of\n * `collection` as the initial value.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the accumulated value.\n */\n function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n eachFunc(collection, function(value, index, collection) {\n accumulator = initAccum\n ? (initAccum = false, value)\n : iteratee(accumulator, value, index, collection);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.sortBy` which uses `comparer` to define the\n * sort order of `array` and replaces criteria objects with their corresponding\n * values.\n *\n * @private\n * @param {Array} array The array to sort.\n * @param {Function} comparer The function to define sort order.\n * @returns {Array} Returns `array`.\n */\n function baseSortBy(array, comparer) {\n var length = array.length;\n\n array.sort(comparer);\n while (length--) {\n array[length] = array[length].value;\n }\n return array;\n }\n\n /**\n * The base implementation of `_.sum` and `_.sumBy` without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {number} Returns the sum.\n */\n function baseSum(array, iteratee) {\n var result,\n index = -1,\n length = array.length;\n\n while (++index < length) {\n var current = iteratee(array[index]);\n if (current !== undefined) {\n result = result === undefined ? current : (result + current);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\n function baseTimes(n, iteratee) {\n var index = -1,\n result = Array(n);\n\n while (++index < n) {\n result[index] = iteratee(index);\n }\n return result;\n }\n\n /**\n * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array\n * of key-value pairs for `object` corresponding to the property names of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the key-value pairs.\n */\n function baseToPairs(object, props) {\n return arrayMap(props, function(key) {\n return [key, object[key]];\n });\n }\n\n /**\n * The base implementation of `_.trim`.\n *\n * @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n */\n function baseTrim(string) {\n return string\n ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n : string;\n }\n\n /**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\n function baseUnary(func) {\n return function(value) {\n return func(value);\n };\n }\n\n /**\n * The base implementation of `_.values` and `_.valuesIn` which creates an\n * array of `object` property values corresponding to the property names\n * of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the array of property values.\n */\n function baseValues(object, props) {\n return arrayMap(props, function(key) {\n return object[key];\n });\n }\n\n /**\n * Checks if a `cache` value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function cacheHas(cache, key) {\n return cache.has(key);\n }\n\n /**\n * Used by `_.trim` and `_.trimStart` to get the index of the first string symbol\n * that is not found in the character symbols.\n *\n * @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the first unmatched string symbol.\n */\n function charsStartIndex(strSymbols, chrSymbols) {\n var index = -1,\n length = strSymbols.length;\n\n while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n return index;\n }\n\n /**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol\n * that is not found in the character symbols.\n *\n * @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the last unmatched string symbol.\n */\n function charsEndIndex(strSymbols, chrSymbols) {\n var index = strSymbols.length;\n\n while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n return index;\n }\n\n /**\n * Gets the number of `placeholder` occurrences in `array`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} placeholder The placeholder to search for.\n * @returns {number} Returns the placeholder count.\n */\n function countHolders(array, placeholder) {\n var length = array.length,\n result = 0;\n\n while (length--) {\n if (array[length] === placeholder) {\n ++result;\n }\n }\n return result;\n }\n\n /**\n * Used by `_.deburr` to convert Latin-1 Supplement and Latin Extended-A\n * letters to basic Latin letters.\n *\n * @private\n * @param {string} letter The matched letter to deburr.\n * @returns {string} Returns the deburred letter.\n */\n var deburrLetter = basePropertyOf(deburredLetters);\n\n /**\n * Used by `_.escape` to convert characters to HTML entities.\n *\n * @private\n * @param {string} chr The matched character to escape.\n * @returns {string} Returns the escaped character.\n */\n var escapeHtmlChar = basePropertyOf(htmlEscapes);\n\n /**\n * Used by `_.template` to escape characters for inclusion in compiled string literals.\n *\n * @private\n * @param {string} chr The matched character to escape.\n * @returns {string} Returns the escaped character.\n */\n function escapeStringChar(chr) {\n return '\\\\' + stringEscapes[chr];\n }\n\n /**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\n function getValue(object, key) {\n return object == null ? undefined : object[key];\n }\n\n /**\n * Checks if `string` contains Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n */\n function hasUnicode(string) {\n return reHasUnicode.test(string);\n }\n\n /**\n * Checks if `string` contains a word composed of Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a word is found, else `false`.\n */\n function hasUnicodeWord(string) {\n return reHasUnicodeWord.test(string);\n }\n\n /**\n * Converts `iterator` to an array.\n *\n * @private\n * @param {Object} iterator The iterator to convert.\n * @returns {Array} Returns the converted array.\n */\n function iteratorToArray(iterator) {\n var data,\n result = [];\n\n while (!(data = iterator.next()).done) {\n result.push(data.value);\n }\n return result;\n }\n\n /**\n * Converts `map` to its key-value pairs.\n *\n * @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n */\n function mapToArray(map) {\n var index = -1,\n result = Array(map.size);\n\n map.forEach(function(value, key) {\n result[++index] = [key, value];\n });\n return result;\n }\n\n /**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\n function overArg(func, transform) {\n return function(arg) {\n return func(transform(arg));\n };\n }\n\n /**\n * Replaces all `placeholder` elements in `array` with an internal placeholder\n * and returns an array of their indexes.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {*} placeholder The placeholder to replace.\n * @returns {Array} Returns the new array of placeholder indexes.\n */\n function replaceHolders(array, placeholder) {\n var index = -1,\n length = array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (value === placeholder || value === PLACEHOLDER) {\n array[index] = PLACEHOLDER;\n result[resIndex++] = index;\n }\n }\n return result;\n }\n\n /**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\n function setToArray(set) {\n var index = -1,\n result = Array(set.size);\n\n set.forEach(function(value) {\n result[++index] = value;\n });\n return result;\n }\n\n /**\n * Converts `set` to its value-value pairs.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the value-value pairs.\n */\n function setToPairs(set) {\n var index = -1,\n result = Array(set.size);\n\n set.forEach(function(value) {\n result[++index] = [value, value];\n });\n return result;\n }\n\n /**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function strictIndexOf(array, value, fromIndex) {\n var index = fromIndex - 1,\n length = array.length;\n\n while (++index < length) {\n if (array[index] === value) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * A specialized version of `_.lastIndexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function strictLastIndexOf(array, value, fromIndex) {\n var index = fromIndex + 1;\n while (index--) {\n if (array[index] === value) {\n return index;\n }\n }\n return index;\n }\n\n /**\n * Gets the number of symbols in `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the string size.\n */\n function stringSize(string) {\n return hasUnicode(string)\n ? unicodeSize(string)\n : asciiSize(string);\n }\n\n /**\n * Converts `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function stringToArray(string) {\n return hasUnicode(string)\n ? unicodeToArray(string)\n : asciiToArray(string);\n }\n\n /**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n */\n function trimmedEndIndex(string) {\n var index = string.length;\n\n while (index-- && reWhitespace.test(string.charAt(index))) {}\n return index;\n }\n\n /**\n * Used by `_.unescape` to convert HTML entities to characters.\n *\n * @private\n * @param {string} chr The matched character to unescape.\n * @returns {string} Returns the unescaped character.\n */\n var unescapeHtmlChar = basePropertyOf(htmlUnescapes);\n\n /**\n * Gets the size of a Unicode `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\n function unicodeSize(string) {\n var result = reUnicode.lastIndex = 0;\n while (reUnicode.test(string)) {\n ++result;\n }\n return result;\n }\n\n /**\n * Converts a Unicode `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function unicodeToArray(string) {\n return string.match(reUnicode) || [];\n }\n\n /**\n * Splits a Unicode `string` into an array of its words.\n *\n * @private\n * @param {string} The string to inspect.\n * @returns {Array} Returns the words of `string`.\n */\n function unicodeWords(string) {\n return string.match(reUnicodeWord) || [];\n }\n\n /*--------------------------------------------------------------------------*/\n\n /**\n * Create a new pristine `lodash` function using the `context` object.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Util\n * @param {Object} [context=root] The context object.\n * @returns {Function} Returns a new `lodash` function.\n * @example\n *\n * _.mixin({ 'foo': _.constant('foo') });\n *\n * var lodash = _.runInContext();\n * lodash.mixin({ 'bar': lodash.constant('bar') });\n *\n * _.isFunction(_.foo);\n * // => true\n * _.isFunction(_.bar);\n * // => false\n *\n * lodash.isFunction(lodash.foo);\n * // => false\n * lodash.isFunction(lodash.bar);\n * // => true\n *\n * // Create a suped-up `defer` in Node.js.\n * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;\n */\n var runInContext = (function runInContext(context) {\n context = context == null ? root : _.defaults(root.Object(), context, _.pick(root, contextProps));\n\n /** Built-in constructor references. */\n var Array = context.Array,\n Date = context.Date,\n Error = context.Error,\n Function = context.Function,\n Math = context.Math,\n Object = context.Object,\n RegExp = context.RegExp,\n String = context.String,\n TypeError = context.TypeError;\n\n /** Used for built-in method references. */\n var arrayProto = Array.prototype,\n funcProto = Function.prototype,\n objectProto = Object.prototype;\n\n /** Used to detect overreaching core-js shims. */\n var coreJsData = context['__core-js_shared__'];\n\n /** Used to resolve the decompiled source of functions. */\n var funcToString = funcProto.toString;\n\n /** Used to check objects for own properties. */\n var hasOwnProperty = objectProto.hasOwnProperty;\n\n /** Used to generate unique IDs. */\n var idCounter = 0;\n\n /** Used to detect methods masquerading as native. */\n var maskSrcKey = (function() {\n var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n return uid ? ('Symbol(src)_1.' + uid) : '';\n }());\n\n /**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\n var nativeObjectToString = objectProto.toString;\n\n /** Used to infer the `Object` constructor. */\n var objectCtorString = funcToString.call(Object);\n\n /** Used to restore the original `_` reference in `_.noConflict`. */\n var oldDash = root._;\n\n /** Used to detect if a method is native. */\n var reIsNative = RegExp('^' +\n funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n );\n\n /** Built-in value references. */\n var Buffer = moduleExports ? context.Buffer : undefined,\n Symbol = context.Symbol,\n Uint8Array = context.Uint8Array,\n allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined,\n getPrototype = overArg(Object.getPrototypeOf, Object),\n objectCreate = Object.create,\n propertyIsEnumerable = objectProto.propertyIsEnumerable,\n splice = arrayProto.splice,\n spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined,\n symIterator = Symbol ? Symbol.iterator : undefined,\n symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n var defineProperty = (function() {\n try {\n var func = getNative(Object, 'defineProperty');\n func({}, '', {});\n return func;\n } catch (e) {}\n }());\n\n /** Mocked built-ins. */\n var ctxClearTimeout = context.clearTimeout !== root.clearTimeout && context.clearTimeout,\n ctxNow = Date && Date.now !== root.Date.now && Date.now,\n ctxSetTimeout = context.setTimeout !== root.setTimeout && context.setTimeout;\n\n /* Built-in method references for those with the same name as other `lodash` methods. */\n var nativeCeil = Math.ceil,\n nativeFloor = Math.floor,\n nativeGetSymbols = Object.getOwnPropertySymbols,\n nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n nativeIsFinite = context.isFinite,\n nativeJoin = arrayProto.join,\n nativeKeys = overArg(Object.keys, Object),\n nativeMax = Math.max,\n nativeMin = Math.min,\n nativeNow = Date.now,\n nativeParseInt = context.parseInt,\n nativeRandom = Math.random,\n nativeReverse = arrayProto.reverse;\n\n /* Built-in method references that are verified to be native. */\n var DataView = getNative(context, 'DataView'),\n Map = getNative(context, 'Map'),\n Promise = getNative(context, 'Promise'),\n Set = getNative(context, 'Set'),\n WeakMap = getNative(context, 'WeakMap'),\n nativeCreate = getNative(Object, 'create');\n\n /** Used to store function metadata. */\n var metaMap = WeakMap && new WeakMap;\n\n /** Used to lookup unminified function names. */\n var realNames = {};\n\n /** Used to detect maps, sets, and weakmaps. */\n var dataViewCtorString = toSource(DataView),\n mapCtorString = toSource(Map),\n promiseCtorString = toSource(Promise),\n setCtorString = toSource(Set),\n weakMapCtorString = toSource(WeakMap);\n\n /** Used to convert symbols to primitives and strings. */\n var symbolProto = Symbol ? Symbol.prototype : undefined,\n symbolValueOf = symbolProto ? symbolProto.valueOf : undefined,\n symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a `lodash` object which wraps `value` to enable implicit method\n * chain sequences. Methods that operate on and return arrays, collections,\n * and functions can be chained together. Methods that retrieve a single value\n * or may return a primitive value will automatically end the chain sequence\n * and return the unwrapped value. Otherwise, the value must be unwrapped\n * with `_#value`.\n *\n * Explicit chain sequences, which must be unwrapped with `_#value`, may be\n * enabled using `_.chain`.\n *\n * The execution of chained methods is lazy, that is, it's deferred until\n * `_#value` is implicitly or explicitly called.\n *\n * Lazy evaluation allows several methods to support shortcut fusion.\n * Shortcut fusion is an optimization to merge iteratee calls; this avoids\n * the creation of intermediate arrays and can greatly reduce the number of\n * iteratee executions. Sections of a chain sequence qualify for shortcut\n * fusion if the section is applied to an array and iteratees accept only\n * one argument. The heuristic for whether a section qualifies for shortcut\n * fusion is subject to change.\n *\n * Chaining is supported in custom builds as long as the `_#value` method is\n * directly or indirectly included in the build.\n *\n * In addition to lodash methods, wrappers have `Array` and `String` methods.\n *\n * The wrapper `Array` methods are:\n * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift`\n *\n * The wrapper `String` methods are:\n * `replace` and `split`\n *\n * The wrapper methods that support shortcut fusion are:\n * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`,\n * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`,\n * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray`\n *\n * The chainable wrapper methods are:\n * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`,\n * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`,\n * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`,\n * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`,\n * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`,\n * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`,\n * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`,\n * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`,\n * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`,\n * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`,\n * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`,\n * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`,\n * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`,\n * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`,\n * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`,\n * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`,\n * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`,\n * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`,\n * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`,\n * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`,\n * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`,\n * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`,\n * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`,\n * `zipObject`, `zipObjectDeep`, and `zipWith`\n *\n * The wrapper methods that are **not** chainable by default are:\n * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`,\n * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `conformsTo`, `deburr`,\n * `defaultTo`, `divide`, `each`, `eachRight`, `endsWith`, `eq`, `escape`,\n * `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, `findLast`,\n * `findLastIndex`, `findLastKey`, `first`, `floor`, `forEach`, `forEachRight`,\n * `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `get`, `gt`, `gte`, `has`,\n * `hasIn`, `head`, `identity`, `includes`, `indexOf`, `inRange`, `invoke`,\n * `isArguments`, `isArray`, `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`,\n * `isBoolean`, `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`,\n * `isEqualWith`, `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`,\n * `isMap`, `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`,\n * `isNumber`, `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`,\n * `isSafeInteger`, `isSet`, `isString`, `isUndefined`, `isTypedArray`,\n * `isWeakMap`, `isWeakSet`, `join`, `kebabCase`, `last`, `lastIndexOf`,\n * `lowerCase`, `lowerFirst`, `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`,\n * `min`, `minBy`, `multiply`, `noConflict`, `noop`, `now`, `nth`, `pad`,\n * `padEnd`, `padStart`, `parseInt`, `pop`, `random`, `reduce`, `reduceRight`,\n * `repeat`, `result`, `round`, `runInContext`, `sample`, `shift`, `size`,\n * `snakeCase`, `some`, `sortedIndex`, `sortedIndexBy`, `sortedLastIndex`,\n * `sortedLastIndexBy`, `startCase`, `startsWith`, `stubArray`, `stubFalse`,\n * `stubObject`, `stubString`, `stubTrue`, `subtract`, `sum`, `sumBy`,\n * `template`, `times`, `toFinite`, `toInteger`, `toJSON`, `toLength`,\n * `toLower`, `toNumber`, `toSafeInteger`, `toString`, `toUpper`, `trim`,\n * `trimEnd`, `trimStart`, `truncate`, `unescape`, `uniqueId`, `upperCase`,\n * `upperFirst`, `value`, and `words`\n *\n * @name _\n * @constructor\n * @category Seq\n * @param {*} value The value to wrap in a `lodash` instance.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var wrapped = _([1, 2, 3]);\n *\n * // Returns an unwrapped value.\n * wrapped.reduce(_.add);\n * // => 6\n *\n * // Returns a wrapped value.\n * var squares = wrapped.map(square);\n *\n * _.isArray(squares);\n * // => false\n *\n * _.isArray(squares.value());\n * // => true\n */\n function lodash(value) {\n if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {\n if (value instanceof LodashWrapper) {\n return value;\n }\n if (hasOwnProperty.call(value, '__wrapped__')) {\n return wrapperClone(value);\n }\n }\n return new LodashWrapper(value);\n }\n\n /**\n * The base implementation of `_.create` without support for assigning\n * properties to the created object.\n *\n * @private\n * @param {Object} proto The object to inherit from.\n * @returns {Object} Returns the new object.\n */\n var baseCreate = (function() {\n function object() {}\n return function(proto) {\n if (!isObject(proto)) {\n return {};\n }\n if (objectCreate) {\n return objectCreate(proto);\n }\n object.prototype = proto;\n var result = new object;\n object.prototype = undefined;\n return result;\n };\n }());\n\n /**\n * The function whose prototype chain sequence wrappers inherit from.\n *\n * @private\n */\n function baseLodash() {\n // No operation performed.\n }\n\n /**\n * The base constructor for creating `lodash` wrapper objects.\n *\n * @private\n * @param {*} value The value to wrap.\n * @param {boolean} [chainAll] Enable explicit method chain sequences.\n */\n function LodashWrapper(value, chainAll) {\n this.__wrapped__ = value;\n this.__actions__ = [];\n this.__chain__ = !!chainAll;\n this.__index__ = 0;\n this.__values__ = undefined;\n }\n\n /**\n * By default, the template delimiters used by lodash are like those in\n * embedded Ruby (ERB) as well as ES2015 template strings. Change the\n * following template settings to use alternative delimiters.\n *\n * @static\n * @memberOf _\n * @type {Object}\n */\n lodash.templateSettings = {\n\n /**\n * Used to detect `data` property values to be HTML-escaped.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'escape': reEscape,\n\n /**\n * Used to detect code to be evaluated.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'evaluate': reEvaluate,\n\n /**\n * Used to detect `data` property values to inject.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'interpolate': reInterpolate,\n\n /**\n * Used to reference the data object in the template text.\n *\n * @memberOf _.templateSettings\n * @type {string}\n */\n 'variable': '',\n\n /**\n * Used to import variables into the compiled template.\n *\n * @memberOf _.templateSettings\n * @type {Object}\n */\n 'imports': {\n\n /**\n * A reference to the `lodash` function.\n *\n * @memberOf _.templateSettings.imports\n * @type {Function}\n */\n '_': lodash\n }\n };\n\n // Ensure wrappers are instances of `baseLodash`.\n lodash.prototype = baseLodash.prototype;\n lodash.prototype.constructor = lodash;\n\n LodashWrapper.prototype = baseCreate(baseLodash.prototype);\n LodashWrapper.prototype.constructor = LodashWrapper;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.\n *\n * @private\n * @constructor\n * @param {*} value The value to wrap.\n */\n function LazyWrapper(value) {\n this.__wrapped__ = value;\n this.__actions__ = [];\n this.__dir__ = 1;\n this.__filtered__ = false;\n this.__iteratees__ = [];\n this.__takeCount__ = MAX_ARRAY_LENGTH;\n this.__views__ = [];\n }\n\n /**\n * Creates a clone of the lazy wrapper object.\n *\n * @private\n * @name clone\n * @memberOf LazyWrapper\n * @returns {Object} Returns the cloned `LazyWrapper` object.\n */\n function lazyClone() {\n var result = new LazyWrapper(this.__wrapped__);\n result.__actions__ = copyArray(this.__actions__);\n result.__dir__ = this.__dir__;\n result.__filtered__ = this.__filtered__;\n result.__iteratees__ = copyArray(this.__iteratees__);\n result.__takeCount__ = this.__takeCount__;\n result.__views__ = copyArray(this.__views__);\n return result;\n }\n\n /**\n * Reverses the direction of lazy iteration.\n *\n * @private\n * @name reverse\n * @memberOf LazyWrapper\n * @returns {Object} Returns the new reversed `LazyWrapper` object.\n */\n function lazyReverse() {\n if (this.__filtered__) {\n var result = new LazyWrapper(this);\n result.__dir__ = -1;\n result.__filtered__ = true;\n } else {\n result = this.clone();\n result.__dir__ *= -1;\n }\n return result;\n }\n\n /**\n * Extracts the unwrapped value from its lazy wrapper.\n *\n * @private\n * @name value\n * @memberOf LazyWrapper\n * @returns {*} Returns the unwrapped value.\n */\n function lazyValue() {\n var array = this.__wrapped__.value(),\n dir = this.__dir__,\n isArr = isArray(array),\n isRight = dir < 0,\n arrLength = isArr ? array.length : 0,\n view = getView(0, arrLength, this.__views__),\n start = view.start,\n end = view.end,\n length = end - start,\n index = isRight ? end : (start - 1),\n iteratees = this.__iteratees__,\n iterLength = iteratees.length,\n resIndex = 0,\n takeCount = nativeMin(length, this.__takeCount__);\n\n if (!isArr || (!isRight && arrLength == length && takeCount == length)) {\n return baseWrapperValue(array, this.__actions__);\n }\n var result = [];\n\n outer:\n while (length-- && resIndex < takeCount) {\n index += dir;\n\n var iterIndex = -1,\n value = array[index];\n\n while (++iterIndex < iterLength) {\n var data = iteratees[iterIndex],\n iteratee = data.iteratee,\n type = data.type,\n computed = iteratee(value);\n\n if (type == LAZY_MAP_FLAG) {\n value = computed;\n } else if (!computed) {\n if (type == LAZY_FILTER_FLAG) {\n continue outer;\n } else {\n break outer;\n }\n }\n }\n result[resIndex++] = value;\n }\n return result;\n }\n\n // Ensure `LazyWrapper` is an instance of `baseLodash`.\n LazyWrapper.prototype = baseCreate(baseLodash.prototype);\n LazyWrapper.prototype.constructor = LazyWrapper;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function Hash(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\n function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function hashDelete(key) {\n var result = this.has(key) && delete this.__data__[key];\n this.size -= result ? 1 : 0;\n return result;\n }\n\n /**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function hashGet(key) {\n var data = this.__data__;\n if (nativeCreate) {\n var result = data[key];\n return result === HASH_UNDEFINED ? undefined : result;\n }\n return hasOwnProperty.call(data, key) ? data[key] : undefined;\n }\n\n /**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function hashHas(key) {\n var data = this.__data__;\n return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n }\n\n /**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\n function hashSet(key, value) {\n var data = this.__data__;\n this.size += this.has(key) ? 0 : 1;\n data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n return this;\n }\n\n // Add methods to `Hash`.\n Hash.prototype.clear = hashClear;\n Hash.prototype['delete'] = hashDelete;\n Hash.prototype.get = hashGet;\n Hash.prototype.has = hashHas;\n Hash.prototype.set = hashSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function ListCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\n function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function listCacheDelete(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n return false;\n }\n var lastIndex = data.length - 1;\n if (index == lastIndex) {\n data.pop();\n } else {\n splice.call(data, index, 1);\n }\n --this.size;\n return true;\n }\n\n /**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function listCacheGet(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n return index < 0 ? undefined : data[index][1];\n }\n\n /**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function listCacheHas(key) {\n return assocIndexOf(this.__data__, key) > -1;\n }\n\n /**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\n function listCacheSet(key, value) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n ++this.size;\n data.push([key, value]);\n } else {\n data[index][1] = value;\n }\n return this;\n }\n\n // Add methods to `ListCache`.\n ListCache.prototype.clear = listCacheClear;\n ListCache.prototype['delete'] = listCacheDelete;\n ListCache.prototype.get = listCacheGet;\n ListCache.prototype.has = listCacheHas;\n ListCache.prototype.set = listCacheSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function MapCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\n function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map || ListCache),\n 'string': new Hash\n };\n }\n\n /**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function mapCacheDelete(key) {\n var result = getMapData(this, key)['delete'](key);\n this.size -= result ? 1 : 0;\n return result;\n }\n\n /**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function mapCacheGet(key) {\n return getMapData(this, key).get(key);\n }\n\n /**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function mapCacheHas(key) {\n return getMapData(this, key).has(key);\n }\n\n /**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\n function mapCacheSet(key, value) {\n var data = getMapData(this, key),\n size = data.size;\n\n data.set(key, value);\n this.size += data.size == size ? 0 : 1;\n return this;\n }\n\n // Add methods to `MapCache`.\n MapCache.prototype.clear = mapCacheClear;\n MapCache.prototype['delete'] = mapCacheDelete;\n MapCache.prototype.get = mapCacheGet;\n MapCache.prototype.has = mapCacheHas;\n MapCache.prototype.set = mapCacheSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\n function SetCache(values) {\n var index = -1,\n length = values == null ? 0 : values.length;\n\n this.__data__ = new MapCache;\n while (++index < length) {\n this.add(values[index]);\n }\n }\n\n /**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\n function setCacheAdd(value) {\n this.__data__.set(value, HASH_UNDEFINED);\n return this;\n }\n\n /**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\n function setCacheHas(value) {\n return this.__data__.has(value);\n }\n\n // Add methods to `SetCache`.\n SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\n SetCache.prototype.has = setCacheHas;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function Stack(entries) {\n var data = this.__data__ = new ListCache(entries);\n this.size = data.size;\n }\n\n /**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\n function stackClear() {\n this.__data__ = new ListCache;\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function stackDelete(key) {\n var data = this.__data__,\n result = data['delete'](key);\n\n this.size = data.size;\n return result;\n }\n\n /**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function stackGet(key) {\n return this.__data__.get(key);\n }\n\n /**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function stackHas(key) {\n return this.__data__.has(key);\n }\n\n /**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\n function stackSet(key, value) {\n var data = this.__data__;\n if (data instanceof ListCache) {\n var pairs = data.__data__;\n if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n pairs.push([key, value]);\n this.size = ++data.size;\n return this;\n }\n data = this.__data__ = new MapCache(pairs);\n }\n data.set(key, value);\n this.size = data.size;\n return this;\n }\n\n // Add methods to `Stack`.\n Stack.prototype.clear = stackClear;\n Stack.prototype['delete'] = stackDelete;\n Stack.prototype.get = stackGet;\n Stack.prototype.has = stackHas;\n Stack.prototype.set = stackSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\n function arrayLikeKeys(value, inherited) {\n var isArr = isArray(value),\n isArg = !isArr && isArguments(value),\n isBuff = !isArr && !isArg && isBuffer(value),\n isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n skipIndexes = isArr || isArg || isBuff || isType,\n result = skipIndexes ? baseTimes(value.length, String) : [],\n length = result.length;\n\n for (var key in value) {\n if ((inherited || hasOwnProperty.call(value, key)) &&\n !(skipIndexes && (\n // Safari 9 has enumerable `arguments.length` in strict mode.\n key == 'length' ||\n // Node.js 0.10 has enumerable non-index properties on buffers.\n (isBuff && (key == 'offset' || key == 'parent')) ||\n // PhantomJS 2 has enumerable non-index properties on typed arrays.\n (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n // Skip index properties.\n isIndex(key, length)\n ))) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `_.sample` for arrays.\n *\n * @private\n * @param {Array} array The array to sample.\n * @returns {*} Returns the random element.\n */\n function arraySample(array) {\n var length = array.length;\n return length ? array[baseRandom(0, length - 1)] : undefined;\n }\n\n /**\n * A specialized version of `_.sampleSize` for arrays.\n *\n * @private\n * @param {Array} array The array to sample.\n * @param {number} n The number of elements to sample.\n * @returns {Array} Returns the random elements.\n */\n function arraySampleSize(array, n) {\n return shuffleSelf(copyArray(array), baseClamp(n, 0, array.length));\n }\n\n /**\n * A specialized version of `_.shuffle` for arrays.\n *\n * @private\n * @param {Array} array The array to shuffle.\n * @returns {Array} Returns the new shuffled array.\n */\n function arrayShuffle(array) {\n return shuffleSelf(copyArray(array));\n }\n\n /**\n * This function is like `assignValue` except that it doesn't assign\n * `undefined` values.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function assignMergeValue(object, key, value) {\n if ((value !== undefined && !eq(object[key], value)) ||\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n }\n\n /**\n * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function assignValue(object, key, value) {\n var objValue = object[key];\n if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n }\n\n /**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function assocIndexOf(array, key) {\n var length = array.length;\n while (length--) {\n if (eq(array[length][0], key)) {\n return length;\n }\n }\n return -1;\n }\n\n /**\n * Aggregates elements of `collection` on `accumulator` with keys transformed\n * by `iteratee` and values set by `setter`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform keys.\n * @param {Object} accumulator The initial aggregated object.\n * @returns {Function} Returns `accumulator`.\n */\n function baseAggregator(collection, setter, iteratee, accumulator) {\n baseEach(collection, function(value, key, collection) {\n setter(accumulator, value, iteratee(value), collection);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.assign` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\n function baseAssign(object, source) {\n return object && copyObject(source, keys(source), object);\n }\n\n /**\n * The base implementation of `_.assignIn` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\n function baseAssignIn(object, source) {\n return object && copyObject(source, keysIn(source), object);\n }\n\n /**\n * The base implementation of `assignValue` and `assignMergeValue` without\n * value checks.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function baseAssignValue(object, key, value) {\n if (key == '__proto__' && defineProperty) {\n defineProperty(object, key, {\n 'configurable': true,\n 'enumerable': true,\n 'value': value,\n 'writable': true\n });\n } else {\n object[key] = value;\n }\n }\n\n /**\n * The base implementation of `_.at` without support for individual paths.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {string[]} paths The property paths to pick.\n * @returns {Array} Returns the picked elements.\n */\n function baseAt(object, paths) {\n var index = -1,\n length = paths.length,\n result = Array(length),\n skip = object == null;\n\n while (++index < length) {\n result[index] = skip ? undefined : get(object, paths[index]);\n }\n return result;\n }\n\n /**\n * The base implementation of `_.clamp` which doesn't coerce arguments.\n *\n * @private\n * @param {number} number The number to clamp.\n * @param {number} [lower] The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the clamped number.\n */\n function baseClamp(number, lower, upper) {\n if (number === number) {\n if (upper !== undefined) {\n number = number <= upper ? number : upper;\n }\n if (lower !== undefined) {\n number = number >= lower ? number : lower;\n }\n }\n return number;\n }\n\n /**\n * The base implementation of `_.clone` and `_.cloneDeep` which tracks\n * traversed objects.\n *\n * @private\n * @param {*} value The value to clone.\n * @param {boolean} bitmask The bitmask flags.\n * 1 - Deep clone\n * 2 - Flatten inherited properties\n * 4 - Clone symbols\n * @param {Function} [customizer] The function to customize cloning.\n * @param {string} [key] The key of `value`.\n * @param {Object} [object] The parent object of `value`.\n * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n * @returns {*} Returns the cloned value.\n */\n function baseClone(value, bitmask, customizer, key, object, stack) {\n var result,\n isDeep = bitmask & CLONE_DEEP_FLAG,\n isFlat = bitmask & CLONE_FLAT_FLAG,\n isFull = bitmask & CLONE_SYMBOLS_FLAG;\n\n if (customizer) {\n result = object ? customizer(value, key, object, stack) : customizer(value);\n }\n if (result !== undefined) {\n return result;\n }\n if (!isObject(value)) {\n return value;\n }\n var isArr = isArray(value);\n if (isArr) {\n result = initCloneArray(value);\n if (!isDeep) {\n return copyArray(value, result);\n }\n } else {\n var tag = getTag(value),\n isFunc = tag == funcTag || tag == genTag;\n\n if (isBuffer(value)) {\n return cloneBuffer(value, isDeep);\n }\n if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\n result = (isFlat || isFunc) ? {} : initCloneObject(value);\n if (!isDeep) {\n return isFlat\n ? copySymbolsIn(value, baseAssignIn(result, value))\n : copySymbols(value, baseAssign(result, value));\n }\n } else {\n if (!cloneableTags[tag]) {\n return object ? value : {};\n }\n result = initCloneByTag(value, tag, isDeep);\n }\n }\n // Check for circular references and return its corresponding clone.\n stack || (stack = new Stack);\n var stacked = stack.get(value);\n if (stacked) {\n return stacked;\n }\n stack.set(value, result);\n\n if (isSet(value)) {\n value.forEach(function(subValue) {\n result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));\n });\n } else if (isMap(value)) {\n value.forEach(function(subValue, key) {\n result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\n });\n }\n\n var keysFunc = isFull\n ? (isFlat ? getAllKeysIn : getAllKeys)\n : (isFlat ? keysIn : keys);\n\n var props = isArr ? undefined : keysFunc(value);\n arrayEach(props || value, function(subValue, key) {\n if (props) {\n key = subValue;\n subValue = value[key];\n }\n // Recursively populate clone (susceptible to call stack limits).\n assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));\n });\n return result;\n }\n\n /**\n * The base implementation of `_.conforms` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property predicates to conform to.\n * @returns {Function} Returns the new spec function.\n */\n function baseConforms(source) {\n var props = keys(source);\n return function(object) {\n return baseConformsTo(object, source, props);\n };\n }\n\n /**\n * The base implementation of `_.conformsTo` which accepts `props` to check.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property predicates to conform to.\n * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n */\n function baseConformsTo(object, source, props) {\n var length = props.length;\n if (object == null) {\n return !length;\n }\n object = Object(object);\n while (length--) {\n var key = props[length],\n predicate = source[key],\n value = object[key];\n\n if ((value === undefined && !(key in object)) || !predicate(value)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * The base implementation of `_.delay` and `_.defer` which accepts `args`\n * to provide to `func`.\n *\n * @private\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @param {Array} args The arguments to provide to `func`.\n * @returns {number|Object} Returns the timer id or timeout object.\n */\n function baseDelay(func, wait, args) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n return setTimeout(function() { func.apply(undefined, args); }, wait);\n }\n\n /**\n * The base implementation of methods like `_.difference` without support\n * for excluding multiple arrays or iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Array} values The values to exclude.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n */\n function baseDifference(array, values, iteratee, comparator) {\n var index = -1,\n includes = arrayIncludes,\n isCommon = true,\n length = array.length,\n result = [],\n valuesLength = values.length;\n\n if (!length) {\n return result;\n }\n if (iteratee) {\n values = arrayMap(values, baseUnary(iteratee));\n }\n if (comparator) {\n includes = arrayIncludesWith;\n isCommon = false;\n }\n else if (values.length >= LARGE_ARRAY_SIZE) {\n includes = cacheHas;\n isCommon = false;\n values = new SetCache(values);\n }\n outer:\n while (++index < length) {\n var value = array[index],\n computed = iteratee == null ? value : iteratee(value);\n\n value = (comparator || value !== 0) ? value : 0;\n if (isCommon && computed === computed) {\n var valuesIndex = valuesLength;\n while (valuesIndex--) {\n if (values[valuesIndex] === computed) {\n continue outer;\n }\n }\n result.push(value);\n }\n else if (!includes(values, computed, comparator)) {\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.forEach` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\n var baseEach = createBaseEach(baseForOwn);\n\n /**\n * The base implementation of `_.forEachRight` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\n var baseEachRight = createBaseEach(baseForOwnRight, true);\n\n /**\n * The base implementation of `_.every` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`\n */\n function baseEvery(collection, predicate) {\n var result = true;\n baseEach(collection, function(value, index, collection) {\n result = !!predicate(value, index, collection);\n return result;\n });\n return result;\n }\n\n /**\n * The base implementation of methods like `_.max` and `_.min` which accepts a\n * `comparator` to determine the extremum value.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The iteratee invoked per iteration.\n * @param {Function} comparator The comparator used to compare values.\n * @returns {*} Returns the extremum value.\n */\n function baseExtremum(array, iteratee, comparator) {\n var index = -1,\n length = array.length;\n\n while (++index < length) {\n var value = array[index],\n current = iteratee(value);\n\n if (current != null && (computed === undefined\n ? (current === current && !isSymbol(current))\n : comparator(current, computed)\n )) {\n var computed = current,\n result = value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.fill` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to fill.\n * @param {*} value The value to fill `array` with.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns `array`.\n */\n function baseFill(array, value, start, end) {\n var length = array.length;\n\n start = toInteger(start);\n if (start < 0) {\n start = -start > length ? 0 : (length + start);\n }\n end = (end === undefined || end > length) ? length : toInteger(end);\n if (end < 0) {\n end += length;\n }\n end = start > end ? 0 : toLength(end);\n while (start < end) {\n array[start++] = value;\n }\n return array;\n }\n\n /**\n * The base implementation of `_.filter` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\n function baseFilter(collection, predicate) {\n var result = [];\n baseEach(collection, function(value, index, collection) {\n if (predicate(value, index, collection)) {\n result.push(value);\n }\n });\n return result;\n }\n\n /**\n * The base implementation of `_.flatten` with support for restricting flattening.\n *\n * @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n */\n function baseFlatten(array, depth, predicate, isStrict, result) {\n var index = -1,\n length = array.length;\n\n predicate || (predicate = isFlattenable);\n result || (result = []);\n\n while (++index < length) {\n var value = array[index];\n if (depth > 0 && predicate(value)) {\n if (depth > 1) {\n // Recursively flatten arrays (susceptible to call stack limits).\n baseFlatten(value, depth - 1, predicate, isStrict, result);\n } else {\n arrayPush(result, value);\n }\n } else if (!isStrict) {\n result[result.length] = value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\n var baseFor = createBaseFor();\n\n /**\n * This function is like `baseFor` except that it iterates over properties\n * in the opposite order.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\n var baseForRight = createBaseFor(true);\n\n /**\n * The base implementation of `_.forOwn` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\n function baseForOwn(object, iteratee) {\n return object && baseFor(object, iteratee, keys);\n }\n\n /**\n * The base implementation of `_.forOwnRight` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\n function baseForOwnRight(object, iteratee) {\n return object && baseForRight(object, iteratee, keys);\n }\n\n /**\n * The base implementation of `_.functions` which creates an array of\n * `object` function property names filtered from `props`.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Array} props The property names to filter.\n * @returns {Array} Returns the function names.\n */\n function baseFunctions(object, props) {\n return arrayFilter(props, function(key) {\n return isFunction(object[key]);\n });\n }\n\n /**\n * The base implementation of `_.get` without support for default values.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @returns {*} Returns the resolved value.\n */\n function baseGet(object, path) {\n path = castPath(path, object);\n\n var index = 0,\n length = path.length;\n\n while (object != null && index < length) {\n object = object[toKey(path[index++])];\n }\n return (index && index == length) ? object : undefined;\n }\n\n /**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function baseGetAllKeys(object, keysFunc, symbolsFunc) {\n var result = keysFunc(object);\n return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n }\n\n /**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\n function baseGetTag(value) {\n if (value == null) {\n return value === undefined ? undefinedTag : nullTag;\n }\n return (symToStringTag && symToStringTag in Object(value))\n ? getRawTag(value)\n : objectToString(value);\n }\n\n /**\n * The base implementation of `_.gt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than `other`,\n * else `false`.\n */\n function baseGt(value, other) {\n return value > other;\n }\n\n /**\n * The base implementation of `_.has` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\n function baseHas(object, key) {\n return object != null && hasOwnProperty.call(object, key);\n }\n\n /**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\n function baseHasIn(object, key) {\n return object != null && key in Object(object);\n }\n\n /**\n * The base implementation of `_.inRange` which doesn't coerce arguments.\n *\n * @private\n * @param {number} number The number to check.\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n */\n function baseInRange(number, start, end) {\n return number >= nativeMin(start, end) && number < nativeMax(start, end);\n }\n\n /**\n * The base implementation of methods like `_.intersection`, without support\n * for iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of shared values.\n */\n function baseIntersection(arrays, iteratee, comparator) {\n var includes = comparator ? arrayIncludesWith : arrayIncludes,\n length = arrays[0].length,\n othLength = arrays.length,\n othIndex = othLength,\n caches = Array(othLength),\n maxLength = Infinity,\n result = [];\n\n while (othIndex--) {\n var array = arrays[othIndex];\n if (othIndex && iteratee) {\n array = arrayMap(array, baseUnary(iteratee));\n }\n maxLength = nativeMin(array.length, maxLength);\n caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))\n ? new SetCache(othIndex && array)\n : undefined;\n }\n array = arrays[0];\n\n var index = -1,\n seen = caches[0];\n\n outer:\n while (++index < length && result.length < maxLength) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n value = (comparator || value !== 0) ? value : 0;\n if (!(seen\n ? cacheHas(seen, computed)\n : includes(result, computed, comparator)\n )) {\n othIndex = othLength;\n while (--othIndex) {\n var cache = caches[othIndex];\n if (!(cache\n ? cacheHas(cache, computed)\n : includes(arrays[othIndex], computed, comparator))\n ) {\n continue outer;\n }\n }\n if (seen) {\n seen.push(computed);\n }\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.invert` and `_.invertBy` which inverts\n * `object` with values transformed by `iteratee` and set by `setter`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform values.\n * @param {Object} accumulator The initial inverted object.\n * @returns {Function} Returns `accumulator`.\n */\n function baseInverter(object, setter, iteratee, accumulator) {\n baseForOwn(object, function(value, key, object) {\n setter(accumulator, iteratee(value), key, object);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.invoke` without support for individual\n * method arguments.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the method to invoke.\n * @param {Array} args The arguments to invoke the method with.\n * @returns {*} Returns the result of the invoked method.\n */\n function baseInvoke(object, path, args) {\n path = castPath(path, object);\n object = parent(object, path);\n var func = object == null ? object : object[toKey(last(path))];\n return func == null ? undefined : apply(func, object, args);\n }\n\n /**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\n function baseIsArguments(value) {\n return isObjectLike(value) && baseGetTag(value) == argsTag;\n }\n\n /**\n * The base implementation of `_.isArrayBuffer` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n */\n function baseIsArrayBuffer(value) {\n return isObjectLike(value) && baseGetTag(value) == arrayBufferTag;\n }\n\n /**\n * The base implementation of `_.isDate` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n */\n function baseIsDate(value) {\n return isObjectLike(value) && baseGetTag(value) == dateTag;\n }\n\n /**\n * The base implementation of `_.isEqual` which supports partial comparisons\n * and tracks traversed objects.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {boolean} bitmask The bitmask flags.\n * 1 - Unordered comparison\n * 2 - Partial comparison\n * @param {Function} [customizer] The function to customize comparisons.\n * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n */\n function baseIsEqual(value, other, bitmask, customizer, stack) {\n if (value === other) {\n return true;\n }\n if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n return value !== value && other !== other;\n }\n return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n }\n\n /**\n * A specialized version of `baseIsEqual` for arrays and objects which performs\n * deep comparisons and tracks traversed objects enabling objects with circular\n * references to be compared.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n var objIsArr = isArray(object),\n othIsArr = isArray(other),\n objTag = objIsArr ? arrayTag : getTag(object),\n othTag = othIsArr ? arrayTag : getTag(other);\n\n objTag = objTag == argsTag ? objectTag : objTag;\n othTag = othTag == argsTag ? objectTag : othTag;\n\n var objIsObj = objTag == objectTag,\n othIsObj = othTag == objectTag,\n isSameTag = objTag == othTag;\n\n if (isSameTag && isBuffer(object)) {\n if (!isBuffer(other)) {\n return false;\n }\n objIsArr = true;\n objIsObj = false;\n }\n if (isSameTag && !objIsObj) {\n stack || (stack = new Stack);\n return (objIsArr || isTypedArray(object))\n ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n }\n if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n if (objIsWrapped || othIsWrapped) {\n var objUnwrapped = objIsWrapped ? object.value() : object,\n othUnwrapped = othIsWrapped ? other.value() : other;\n\n stack || (stack = new Stack);\n return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n }\n }\n if (!isSameTag) {\n return false;\n }\n stack || (stack = new Stack);\n return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n }\n\n /**\n * The base implementation of `_.isMap` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n */\n function baseIsMap(value) {\n return isObjectLike(value) && getTag(value) == mapTag;\n }\n\n /**\n * The base implementation of `_.isMatch` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Array} matchData The property names, values, and compare flags to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n */\n function baseIsMatch(object, source, matchData, customizer) {\n var index = matchData.length,\n length = index,\n noCustomizer = !customizer;\n\n if (object == null) {\n return !length;\n }\n object = Object(object);\n while (index--) {\n var data = matchData[index];\n if ((noCustomizer && data[2])\n ? data[1] !== object[data[0]]\n : !(data[0] in object)\n ) {\n return false;\n }\n }\n while (++index < length) {\n data = matchData[index];\n var key = data[0],\n objValue = object[key],\n srcValue = data[1];\n\n if (noCustomizer && data[2]) {\n if (objValue === undefined && !(key in object)) {\n return false;\n }\n } else {\n var stack = new Stack;\n if (customizer) {\n var result = customizer(objValue, srcValue, key, object, source, stack);\n }\n if (!(result === undefined\n ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)\n : result\n )) {\n return false;\n }\n }\n }\n return true;\n }\n\n /**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n * else `false`.\n */\n function baseIsNative(value) {\n if (!isObject(value) || isMasked(value)) {\n return false;\n }\n var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n return pattern.test(toSource(value));\n }\n\n /**\n * The base implementation of `_.isRegExp` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n */\n function baseIsRegExp(value) {\n return isObjectLike(value) && baseGetTag(value) == regexpTag;\n }\n\n /**\n * The base implementation of `_.isSet` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n */\n function baseIsSet(value) {\n return isObjectLike(value) && getTag(value) == setTag;\n }\n\n /**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\n function baseIsTypedArray(value) {\n return isObjectLike(value) &&\n isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n }\n\n /**\n * The base implementation of `_.iteratee`.\n *\n * @private\n * @param {*} [value=_.identity] The value to convert to an iteratee.\n * @returns {Function} Returns the iteratee.\n */\n function baseIteratee(value) {\n // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n if (typeof value == 'function') {\n return value;\n }\n if (value == null) {\n return identity;\n }\n if (typeof value == 'object') {\n return isArray(value)\n ? baseMatchesProperty(value[0], value[1])\n : baseMatches(value);\n }\n return property(value);\n }\n\n /**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function baseKeys(object) {\n if (!isPrototype(object)) {\n return nativeKeys(object);\n }\n var result = [];\n for (var key in Object(object)) {\n if (hasOwnProperty.call(object, key) && key != 'constructor') {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function baseKeysIn(object) {\n if (!isObject(object)) {\n return nativeKeysIn(object);\n }\n var isProto = isPrototype(object),\n result = [];\n\n for (var key in object) {\n if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.lt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than `other`,\n * else `false`.\n */\n function baseLt(value, other) {\n return value < other;\n }\n\n /**\n * The base implementation of `_.map` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\n function baseMap(collection, iteratee) {\n var index = -1,\n result = isArrayLike(collection) ? Array(collection.length) : [];\n\n baseEach(collection, function(value, key, collection) {\n result[++index] = iteratee(value, key, collection);\n });\n return result;\n }\n\n /**\n * The base implementation of `_.matches` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property values to match.\n * @returns {Function} Returns the new spec function.\n */\n function baseMatches(source) {\n var matchData = getMatchData(source);\n if (matchData.length == 1 && matchData[0][2]) {\n return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n }\n return function(object) {\n return object === source || baseIsMatch(object, source, matchData);\n };\n }\n\n /**\n * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n *\n * @private\n * @param {string} path The path of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\n function baseMatchesProperty(path, srcValue) {\n if (isKey(path) && isStrictComparable(srcValue)) {\n return matchesStrictComparable(toKey(path), srcValue);\n }\n return function(object) {\n var objValue = get(object, path);\n return (objValue === undefined && objValue === srcValue)\n ? hasIn(object, path)\n : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);\n };\n }\n\n /**\n * The base implementation of `_.merge` without support for multiple sources.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} [customizer] The function to customize merged values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n */\n function baseMerge(object, source, srcIndex, customizer, stack) {\n if (object === source) {\n return;\n }\n baseFor(source, function(srcValue, key) {\n stack || (stack = new Stack);\n if (isObject(srcValue)) {\n baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n }\n else {\n var newValue = customizer\n ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\n : undefined;\n\n if (newValue === undefined) {\n newValue = srcValue;\n }\n assignMergeValue(object, key, newValue);\n }\n }, keysIn);\n }\n\n /**\n * A specialized version of `baseMerge` for arrays and objects which performs\n * deep merges and tracks traversed objects enabling objects with circular\n * references to be merged.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {string} key The key of the value to merge.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} mergeFunc The function to merge values.\n * @param {Function} [customizer] The function to customize assigned values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n */\n function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n var objValue = safeGet(object, key),\n srcValue = safeGet(source, key),\n stacked = stack.get(srcValue);\n\n if (stacked) {\n assignMergeValue(object, key, stacked);\n return;\n }\n var newValue = customizer\n ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n : undefined;\n\n var isCommon = newValue === undefined;\n\n if (isCommon) {\n var isArr = isArray(srcValue),\n isBuff = !isArr && isBuffer(srcValue),\n isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n newValue = srcValue;\n if (isArr || isBuff || isTyped) {\n if (isArray(objValue)) {\n newValue = objValue;\n }\n else if (isArrayLikeObject(objValue)) {\n newValue = copyArray(objValue);\n }\n else if (isBuff) {\n isCommon = false;\n newValue = cloneBuffer(srcValue, true);\n }\n else if (isTyped) {\n isCommon = false;\n newValue = cloneTypedArray(srcValue, true);\n }\n else {\n newValue = [];\n }\n }\n else if (isPlainObject(srcValue) || isArguments(srcValue)) {\n newValue = objValue;\n if (isArguments(objValue)) {\n newValue = toPlainObject(objValue);\n }\n else if (!isObject(objValue) || isFunction(objValue)) {\n newValue = initCloneObject(srcValue);\n }\n }\n else {\n isCommon = false;\n }\n }\n if (isCommon) {\n // Recursively merge objects and arrays (susceptible to call stack limits).\n stack.set(srcValue, newValue);\n mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n stack['delete'](srcValue);\n }\n assignMergeValue(object, key, newValue);\n }\n\n /**\n * The base implementation of `_.nth` which doesn't coerce arguments.\n *\n * @private\n * @param {Array} array The array to query.\n * @param {number} n The index of the element to return.\n * @returns {*} Returns the nth element of `array`.\n */\n function baseNth(array, n) {\n var length = array.length;\n if (!length) {\n return;\n }\n n += n < 0 ? length : 0;\n return isIndex(n, length) ? array[n] : undefined;\n }\n\n /**\n * The base implementation of `_.orderBy` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.\n * @param {string[]} orders The sort orders of `iteratees`.\n * @returns {Array} Returns the new sorted array.\n */\n function baseOrderBy(collection, iteratees, orders) {\n if (iteratees.length) {\n iteratees = arrayMap(iteratees, function(iteratee) {\n if (isArray(iteratee)) {\n return function(value) {\n return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n }\n }\n return iteratee;\n });\n } else {\n iteratees = [identity];\n }\n\n var index = -1;\n iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n\n var result = baseMap(collection, function(value, key, collection) {\n var criteria = arrayMap(iteratees, function(iteratee) {\n return iteratee(value);\n });\n return { 'criteria': criteria, 'index': ++index, 'value': value };\n });\n\n return baseSortBy(result, function(object, other) {\n return compareMultiple(object, other, orders);\n });\n }\n\n /**\n * The base implementation of `_.pick` without support for individual\n * property identifiers.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @returns {Object} Returns the new object.\n */\n function basePick(object, paths) {\n return basePickBy(object, paths, function(value, path) {\n return hasIn(object, path);\n });\n }\n\n /**\n * The base implementation of `_.pickBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n */\n function basePickBy(object, paths, predicate) {\n var index = -1,\n length = paths.length,\n result = {};\n\n while (++index < length) {\n var path = paths[index],\n value = baseGet(object, path);\n\n if (predicate(value, path)) {\n baseSet(result, castPath(path, object), value);\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `baseProperty` which supports deep paths.\n *\n * @private\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\n function basePropertyDeep(path) {\n return function(object) {\n return baseGet(object, path);\n };\n }\n\n /**\n * The base implementation of `_.pullAllBy` without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns `array`.\n */\n function basePullAll(array, values, iteratee, comparator) {\n var indexOf = comparator ? baseIndexOfWith : baseIndexOf,\n index = -1,\n length = values.length,\n seen = array;\n\n if (array === values) {\n values = copyArray(values);\n }\n if (iteratee) {\n seen = arrayMap(array, baseUnary(iteratee));\n }\n while (++index < length) {\n var fromIndex = 0,\n value = values[index],\n computed = iteratee ? iteratee(value) : value;\n\n while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) {\n if (seen !== array) {\n splice.call(seen, fromIndex, 1);\n }\n splice.call(array, fromIndex, 1);\n }\n }\n return array;\n }\n\n /**\n * The base implementation of `_.pullAt` without support for individual\n * indexes or capturing the removed elements.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {number[]} indexes The indexes of elements to remove.\n * @returns {Array} Returns `array`.\n */\n function basePullAt(array, indexes) {\n var length = array ? indexes.length : 0,\n lastIndex = length - 1;\n\n while (length--) {\n var index = indexes[length];\n if (length == lastIndex || index !== previous) {\n var previous = index;\n if (isIndex(index)) {\n splice.call(array, index, 1);\n } else {\n baseUnset(array, index);\n }\n }\n }\n return array;\n }\n\n /**\n * The base implementation of `_.random` without support for returning\n * floating-point numbers.\n *\n * @private\n * @param {number} lower The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the random number.\n */\n function baseRandom(lower, upper) {\n return lower + nativeFloor(nativeRandom() * (upper - lower + 1));\n }\n\n /**\n * The base implementation of `_.range` and `_.rangeRight` which doesn't\n * coerce arguments.\n *\n * @private\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @param {number} step The value to increment or decrement by.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the range of numbers.\n */\n function baseRange(start, end, step, fromRight) {\n var index = -1,\n length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),\n result = Array(length);\n\n while (length--) {\n result[fromRight ? length : ++index] = start;\n start += step;\n }\n return result;\n }\n\n /**\n * The base implementation of `_.repeat` which doesn't coerce arguments.\n *\n * @private\n * @param {string} string The string to repeat.\n * @param {number} n The number of times to repeat the string.\n * @returns {string} Returns the repeated string.\n */\n function baseRepeat(string, n) {\n var result = '';\n if (!string || n < 1 || n > MAX_SAFE_INTEGER) {\n return result;\n }\n // Leverage the exponentiation by squaring algorithm for a faster repeat.\n // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.\n do {\n if (n % 2) {\n result += string;\n }\n n = nativeFloor(n / 2);\n if (n) {\n string += string;\n }\n } while (n);\n\n return result;\n }\n\n /**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\n function baseRest(func, start) {\n return setToString(overRest(func, start, identity), func + '');\n }\n\n /**\n * The base implementation of `_.sample`.\n *\n * @private\n * @param {Array|Object} collection The collection to sample.\n * @returns {*} Returns the random element.\n */\n function baseSample(collection) {\n return arraySample(values(collection));\n }\n\n /**\n * The base implementation of `_.sampleSize` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to sample.\n * @param {number} n The number of elements to sample.\n * @returns {Array} Returns the random elements.\n */\n function baseSampleSize(collection, n) {\n var array = values(collection);\n return shuffleSelf(array, baseClamp(n, 0, array.length));\n }\n\n /**\n * The base implementation of `_.set`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\n function baseSet(object, path, value, customizer) {\n if (!isObject(object)) {\n return object;\n }\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n lastIndex = length - 1,\n nested = object;\n\n while (nested != null && ++index < length) {\n var key = toKey(path[index]),\n newValue = value;\n\n if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n return object;\n }\n\n if (index != lastIndex) {\n var objValue = nested[key];\n newValue = customizer ? customizer(objValue, key, nested) : undefined;\n if (newValue === undefined) {\n newValue = isObject(objValue)\n ? objValue\n : (isIndex(path[index + 1]) ? [] : {});\n }\n }\n assignValue(nested, key, newValue);\n nested = nested[key];\n }\n return object;\n }\n\n /**\n * The base implementation of `setData` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to associate metadata with.\n * @param {*} data The metadata.\n * @returns {Function} Returns `func`.\n */\n var baseSetData = !metaMap ? identity : function(func, data) {\n metaMap.set(func, data);\n return func;\n };\n\n /**\n * The base implementation of `setToString` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\n var baseSetToString = !defineProperty ? identity : function(func, string) {\n return defineProperty(func, 'toString', {\n 'configurable': true,\n 'enumerable': false,\n 'value': constant(string),\n 'writable': true\n });\n };\n\n /**\n * The base implementation of `_.shuffle`.\n *\n * @private\n * @param {Array|Object} collection The collection to shuffle.\n * @returns {Array} Returns the new shuffled array.\n */\n function baseShuffle(collection) {\n return shuffleSelf(values(collection));\n }\n\n /**\n * The base implementation of `_.slice` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\n function baseSlice(array, start, end) {\n var index = -1,\n length = array.length;\n\n if (start < 0) {\n start = -start > length ? 0 : (length + start);\n }\n end = end > length ? length : end;\n if (end < 0) {\n end += length;\n }\n length = start > end ? 0 : ((end - start) >>> 0);\n start >>>= 0;\n\n var result = Array(length);\n while (++index < length) {\n result[index] = array[index + start];\n }\n return result;\n }\n\n /**\n * The base implementation of `_.some` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n */\n function baseSome(collection, predicate) {\n var result;\n\n baseEach(collection, function(value, index, collection) {\n result = predicate(value, index, collection);\n return !result;\n });\n return !!result;\n }\n\n /**\n * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which\n * performs a binary search of `array` to determine the index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n */\n function baseSortedIndex(array, value, retHighest) {\n var low = 0,\n high = array == null ? low : array.length;\n\n if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {\n while (low < high) {\n var mid = (low + high) >>> 1,\n computed = array[mid];\n\n if (computed !== null && !isSymbol(computed) &&\n (retHighest ? (computed <= value) : (computed < value))) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return high;\n }\n return baseSortedIndexBy(array, value, identity, retHighest);\n }\n\n /**\n * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`\n * which invokes `iteratee` for `value` and each element of `array` to compute\n * their sort ranking. The iteratee is invoked with one argument; (value).\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} iteratee The iteratee invoked per element.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n */\n function baseSortedIndexBy(array, value, iteratee, retHighest) {\n var low = 0,\n high = array == null ? 0 : array.length;\n if (high === 0) {\n return 0;\n }\n\n value = iteratee(value);\n var valIsNaN = value !== value,\n valIsNull = value === null,\n valIsSymbol = isSymbol(value),\n valIsUndefined = value === undefined;\n\n while (low < high) {\n var mid = nativeFloor((low + high) / 2),\n computed = iteratee(array[mid]),\n othIsDefined = computed !== undefined,\n othIsNull = computed === null,\n othIsReflexive = computed === computed,\n othIsSymbol = isSymbol(computed);\n\n if (valIsNaN) {\n var setLow = retHighest || othIsReflexive;\n } else if (valIsUndefined) {\n setLow = othIsReflexive && (retHighest || othIsDefined);\n } else if (valIsNull) {\n setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull);\n } else if (valIsSymbol) {\n setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol);\n } else if (othIsNull || othIsSymbol) {\n setLow = false;\n } else {\n setLow = retHighest ? (computed <= value) : (computed < value);\n }\n if (setLow) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return nativeMin(high, MAX_ARRAY_INDEX);\n }\n\n /**\n * The base implementation of `_.sortedUniq` and `_.sortedUniqBy` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\n function baseSortedUniq(array, iteratee) {\n var index = -1,\n length = array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n if (!index || !eq(computed, seen)) {\n var seen = computed;\n result[resIndex++] = value === 0 ? 0 : value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.toNumber` which doesn't ensure correct\n * conversions of binary, hexadecimal, or octal string values.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n */\n function baseToNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n return +value;\n }\n\n /**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\n function baseToString(value) {\n // Exit early for strings to avoid a performance hit in some environments.\n if (typeof value == 'string') {\n return value;\n }\n if (isArray(value)) {\n // Recursively convert values (susceptible to call stack limits).\n return arrayMap(value, baseToString) + '';\n }\n if (isSymbol(value)) {\n return symbolToString ? symbolToString.call(value) : '';\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n }\n\n /**\n * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\n function baseUniq(array, iteratee, comparator) {\n var index = -1,\n includes = arrayIncludes,\n length = array.length,\n isCommon = true,\n result = [],\n seen = result;\n\n if (comparator) {\n isCommon = false;\n includes = arrayIncludesWith;\n }\n else if (length >= LARGE_ARRAY_SIZE) {\n var set = iteratee ? null : createSet(array);\n if (set) {\n return setToArray(set);\n }\n isCommon = false;\n includes = cacheHas;\n seen = new SetCache;\n }\n else {\n seen = iteratee ? [] : result;\n }\n outer:\n while (++index < length) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n value = (comparator || value !== 0) ? value : 0;\n if (isCommon && computed === computed) {\n var seenIndex = seen.length;\n while (seenIndex--) {\n if (seen[seenIndex] === computed) {\n continue outer;\n }\n }\n if (iteratee) {\n seen.push(computed);\n }\n result.push(value);\n }\n else if (!includes(seen, computed, comparator)) {\n if (seen !== result) {\n seen.push(computed);\n }\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.unset`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The property path to unset.\n * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n */\n function baseUnset(object, path) {\n path = castPath(path, object);\n object = parent(object, path);\n return object == null || delete object[toKey(last(path))];\n }\n\n /**\n * The base implementation of `_.update`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to update.\n * @param {Function} updater The function to produce the updated value.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\n function baseUpdate(object, path, updater, customizer) {\n return baseSet(object, path, updater(baseGet(object, path)), customizer);\n }\n\n /**\n * The base implementation of methods like `_.dropWhile` and `_.takeWhile`\n * without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to query.\n * @param {Function} predicate The function invoked per iteration.\n * @param {boolean} [isDrop] Specify dropping elements instead of taking them.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the slice of `array`.\n */\n function baseWhile(array, predicate, isDrop, fromRight) {\n var length = array.length,\n index = fromRight ? length : -1;\n\n while ((fromRight ? index-- : ++index < length) &&\n predicate(array[index], index, array)) {}\n\n return isDrop\n ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))\n : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));\n }\n\n /**\n * The base implementation of `wrapperValue` which returns the result of\n * performing a sequence of actions on the unwrapped `value`, where each\n * successive action is supplied the return value of the previous.\n *\n * @private\n * @param {*} value The unwrapped value.\n * @param {Array} actions Actions to perform to resolve the unwrapped value.\n * @returns {*} Returns the resolved value.\n */\n function baseWrapperValue(value, actions) {\n var result = value;\n if (result instanceof LazyWrapper) {\n result = result.value();\n }\n return arrayReduce(actions, function(result, action) {\n return action.func.apply(action.thisArg, arrayPush([result], action.args));\n }, result);\n }\n\n /**\n * The base implementation of methods like `_.xor`, without support for\n * iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of values.\n */\n function baseXor(arrays, iteratee, comparator) {\n var length = arrays.length;\n if (length < 2) {\n return length ? baseUniq(arrays[0]) : [];\n }\n var index = -1,\n result = Array(length);\n\n while (++index < length) {\n var array = arrays[index],\n othIndex = -1;\n\n while (++othIndex < length) {\n if (othIndex != index) {\n result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);\n }\n }\n }\n return baseUniq(baseFlatten(result, 1), iteratee, comparator);\n }\n\n /**\n * This base implementation of `_.zipObject` which assigns values using `assignFunc`.\n *\n * @private\n * @param {Array} props The property identifiers.\n * @param {Array} values The property values.\n * @param {Function} assignFunc The function to assign values.\n * @returns {Object} Returns the new object.\n */\n function baseZipObject(props, values, assignFunc) {\n var index = -1,\n length = props.length,\n valsLength = values.length,\n result = {};\n\n while (++index < length) {\n var value = index < valsLength ? values[index] : undefined;\n assignFunc(result, props[index], value);\n }\n return result;\n }\n\n /**\n * Casts `value` to an empty array if it's not an array like object.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Array|Object} Returns the cast array-like object.\n */\n function castArrayLikeObject(value) {\n return isArrayLikeObject(value) ? value : [];\n }\n\n /**\n * Casts `value` to `identity` if it's not a function.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Function} Returns cast function.\n */\n function castFunction(value) {\n return typeof value == 'function' ? value : identity;\n }\n\n /**\n * Casts `value` to a path array if it's not one.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {Object} [object] The object to query keys on.\n * @returns {Array} Returns the cast property path array.\n */\n function castPath(value, object) {\n if (isArray(value)) {\n return value;\n }\n return isKey(value, object) ? [value] : stringToPath(toString(value));\n }\n\n /**\n * A `baseRest` alias which can be replaced with `identity` by module\n * replacement plugins.\n *\n * @private\n * @type {Function}\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\n var castRest = baseRest;\n\n /**\n * Casts `array` to a slice if it's needed.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {number} start The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the cast slice.\n */\n function castSlice(array, start, end) {\n var length = array.length;\n end = end === undefined ? length : end;\n return (!start && end >= length) ? array : baseSlice(array, start, end);\n }\n\n /**\n * A simple wrapper around the global [`clearTimeout`](https://mdn.io/clearTimeout).\n *\n * @private\n * @param {number|Object} id The timer id or timeout object of the timer to clear.\n */\n var clearTimeout = ctxClearTimeout || function(id) {\n return root.clearTimeout(id);\n };\n\n /**\n * Creates a clone of `buffer`.\n *\n * @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n */\n function cloneBuffer(buffer, isDeep) {\n if (isDeep) {\n return buffer.slice();\n }\n var length = buffer.length,\n result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n buffer.copy(result);\n return result;\n }\n\n /**\n * Creates a clone of `arrayBuffer`.\n *\n * @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n */\n function cloneArrayBuffer(arrayBuffer) {\n var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n return result;\n }\n\n /**\n * Creates a clone of `dataView`.\n *\n * @private\n * @param {Object} dataView The data view to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned data view.\n */\n function cloneDataView(dataView, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n }\n\n /**\n * Creates a clone of `regexp`.\n *\n * @private\n * @param {Object} regexp The regexp to clone.\n * @returns {Object} Returns the cloned regexp.\n */\n function cloneRegExp(regexp) {\n var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n result.lastIndex = regexp.lastIndex;\n return result;\n }\n\n /**\n * Creates a clone of the `symbol` object.\n *\n * @private\n * @param {Object} symbol The symbol object to clone.\n * @returns {Object} Returns the cloned symbol object.\n */\n function cloneSymbol(symbol) {\n return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n }\n\n /**\n * Creates a clone of `typedArray`.\n *\n * @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n */\n function cloneTypedArray(typedArray, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n }\n\n /**\n * Compares values to sort them in ascending order.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {number} Returns the sort order indicator for `value`.\n */\n function compareAscending(value, other) {\n if (value !== other) {\n var valIsDefined = value !== undefined,\n valIsNull = value === null,\n valIsReflexive = value === value,\n valIsSymbol = isSymbol(value);\n\n var othIsDefined = other !== undefined,\n othIsNull = other === null,\n othIsReflexive = other === other,\n othIsSymbol = isSymbol(other);\n\n if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||\n (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||\n (valIsNull && othIsDefined && othIsReflexive) ||\n (!valIsDefined && othIsReflexive) ||\n !valIsReflexive) {\n return 1;\n }\n if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||\n (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||\n (othIsNull && valIsDefined && valIsReflexive) ||\n (!othIsDefined && valIsReflexive) ||\n !othIsReflexive) {\n return -1;\n }\n }\n return 0;\n }\n\n /**\n * Used by `_.orderBy` to compare multiple properties of a value to another\n * and stable sort them.\n *\n * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n * of corresponding values.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {boolean[]|string[]} orders The order to sort by for each property.\n * @returns {number} Returns the sort order indicator for `object`.\n */\n function compareMultiple(object, other, orders) {\n var index = -1,\n objCriteria = object.criteria,\n othCriteria = other.criteria,\n length = objCriteria.length,\n ordersLength = orders.length;\n\n while (++index < length) {\n var result = compareAscending(objCriteria[index], othCriteria[index]);\n if (result) {\n if (index >= ordersLength) {\n return result;\n }\n var order = orders[index];\n return result * (order == 'desc' ? -1 : 1);\n }\n }\n // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n // that causes it, under certain circumstances, to provide the same value for\n // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n // for more details.\n //\n // This also ensures a stable sort in V8 and other engines.\n // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n return object.index - other.index;\n }\n\n /**\n * Creates an array that is the composition of partially applied arguments,\n * placeholders, and provided arguments into a single array of arguments.\n *\n * @private\n * @param {Array} args The provided arguments.\n * @param {Array} partials The arguments to prepend to those provided.\n * @param {Array} holders The `partials` placeholder indexes.\n * @params {boolean} [isCurried] Specify composing for a curried function.\n * @returns {Array} Returns the new array of composed arguments.\n */\n function composeArgs(args, partials, holders, isCurried) {\n var argsIndex = -1,\n argsLength = args.length,\n holdersLength = holders.length,\n leftIndex = -1,\n leftLength = partials.length,\n rangeLength = nativeMax(argsLength - holdersLength, 0),\n result = Array(leftLength + rangeLength),\n isUncurried = !isCurried;\n\n while (++leftIndex < leftLength) {\n result[leftIndex] = partials[leftIndex];\n }\n while (++argsIndex < holdersLength) {\n if (isUncurried || argsIndex < argsLength) {\n result[holders[argsIndex]] = args[argsIndex];\n }\n }\n while (rangeLength--) {\n result[leftIndex++] = args[argsIndex++];\n }\n return result;\n }\n\n /**\n * This function is like `composeArgs` except that the arguments composition\n * is tailored for `_.partialRight`.\n *\n * @private\n * @param {Array} args The provided arguments.\n * @param {Array} partials The arguments to append to those provided.\n * @param {Array} holders The `partials` placeholder indexes.\n * @params {boolean} [isCurried] Specify composing for a curried function.\n * @returns {Array} Returns the new array of composed arguments.\n */\n function composeArgsRight(args, partials, holders, isCurried) {\n var argsIndex = -1,\n argsLength = args.length,\n holdersIndex = -1,\n holdersLength = holders.length,\n rightIndex = -1,\n rightLength = partials.length,\n rangeLength = nativeMax(argsLength - holdersLength, 0),\n result = Array(rangeLength + rightLength),\n isUncurried = !isCurried;\n\n while (++argsIndex < rangeLength) {\n result[argsIndex] = args[argsIndex];\n }\n var offset = argsIndex;\n while (++rightIndex < rightLength) {\n result[offset + rightIndex] = partials[rightIndex];\n }\n while (++holdersIndex < holdersLength) {\n if (isUncurried || argsIndex < argsLength) {\n result[offset + holders[holdersIndex]] = args[argsIndex++];\n }\n }\n return result;\n }\n\n /**\n * Copies the values of `source` to `array`.\n *\n * @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n */\n function copyArray(source, array) {\n var index = -1,\n length = source.length;\n\n array || (array = Array(length));\n while (++index < length) {\n array[index] = source[index];\n }\n return array;\n }\n\n /**\n * Copies properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n */\n function copyObject(source, props, object, customizer) {\n var isNew = !object;\n object || (object = {});\n\n var index = -1,\n length = props.length;\n\n while (++index < length) {\n var key = props[index];\n\n var newValue = customizer\n ? customizer(object[key], source[key], key, object, source)\n : undefined;\n\n if (newValue === undefined) {\n newValue = source[key];\n }\n if (isNew) {\n baseAssignValue(object, key, newValue);\n } else {\n assignValue(object, key, newValue);\n }\n }\n return object;\n }\n\n /**\n * Copies own symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\n function copySymbols(source, object) {\n return copyObject(source, getSymbols(source), object);\n }\n\n /**\n * Copies own and inherited symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\n function copySymbolsIn(source, object) {\n return copyObject(source, getSymbolsIn(source), object);\n }\n\n /**\n * Creates a function like `_.groupBy`.\n *\n * @private\n * @param {Function} setter The function to set accumulator values.\n * @param {Function} [initializer] The accumulator object initializer.\n * @returns {Function} Returns the new aggregator function.\n */\n function createAggregator(setter, initializer) {\n return function(collection, iteratee) {\n var func = isArray(collection) ? arrayAggregator : baseAggregator,\n accumulator = initializer ? initializer() : {};\n\n return func(collection, setter, getIteratee(iteratee, 2), accumulator);\n };\n }\n\n /**\n * Creates a function like `_.assign`.\n *\n * @private\n * @param {Function} assigner The function to assign values.\n * @returns {Function} Returns the new assigner function.\n */\n function createAssigner(assigner) {\n return baseRest(function(object, sources) {\n var index = -1,\n length = sources.length,\n customizer = length > 1 ? sources[length - 1] : undefined,\n guard = length > 2 ? sources[2] : undefined;\n\n customizer = (assigner.length > 3 && typeof customizer == 'function')\n ? (length--, customizer)\n : undefined;\n\n if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n customizer = length < 3 ? undefined : customizer;\n length = 1;\n }\n object = Object(object);\n while (++index < length) {\n var source = sources[index];\n if (source) {\n assigner(object, source, index, customizer);\n }\n }\n return object;\n });\n }\n\n /**\n * Creates a `baseEach` or `baseEachRight` function.\n *\n * @private\n * @param {Function} eachFunc The function to iterate over a collection.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\n function createBaseEach(eachFunc, fromRight) {\n return function(collection, iteratee) {\n if (collection == null) {\n return collection;\n }\n if (!isArrayLike(collection)) {\n return eachFunc(collection, iteratee);\n }\n var length = collection.length,\n index = fromRight ? length : -1,\n iterable = Object(collection);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (iteratee(iterable[index], index, iterable) === false) {\n break;\n }\n }\n return collection;\n };\n }\n\n /**\n * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\n function createBaseFor(fromRight) {\n return function(object, iteratee, keysFunc) {\n var index = -1,\n iterable = Object(object),\n props = keysFunc(object),\n length = props.length;\n\n while (length--) {\n var key = props[fromRight ? length : ++index];\n if (iteratee(iterable[key], key, iterable) === false) {\n break;\n }\n }\n return object;\n };\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with the optional `this`\n * binding of `thisArg`.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createBind(func, bitmask, thisArg) {\n var isBind = bitmask & WRAP_BIND_FLAG,\n Ctor = createCtor(func);\n\n function wrapper() {\n var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n return fn.apply(isBind ? thisArg : this, arguments);\n }\n return wrapper;\n }\n\n /**\n * Creates a function like `_.lowerFirst`.\n *\n * @private\n * @param {string} methodName The name of the `String` case method to use.\n * @returns {Function} Returns the new case function.\n */\n function createCaseFirst(methodName) {\n return function(string) {\n string = toString(string);\n\n var strSymbols = hasUnicode(string)\n ? stringToArray(string)\n : undefined;\n\n var chr = strSymbols\n ? strSymbols[0]\n : string.charAt(0);\n\n var trailing = strSymbols\n ? castSlice(strSymbols, 1).join('')\n : string.slice(1);\n\n return chr[methodName]() + trailing;\n };\n }\n\n /**\n * Creates a function like `_.camelCase`.\n *\n * @private\n * @param {Function} callback The function to combine each word.\n * @returns {Function} Returns the new compounder function.\n */\n function createCompounder(callback) {\n return function(string) {\n return arrayReduce(words(deburr(string).replace(reApos, '')), callback, '');\n };\n }\n\n /**\n * Creates a function that produces an instance of `Ctor` regardless of\n * whether it was invoked as part of a `new` expression or by `call` or `apply`.\n *\n * @private\n * @param {Function} Ctor The constructor to wrap.\n * @returns {Function} Returns the new wrapped function.\n */\n function createCtor(Ctor) {\n return function() {\n // Use a `switch` statement to work with class constructors. See\n // http://ecma-international.org/ecma-262/7.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist\n // for more details.\n var args = arguments;\n switch (args.length) {\n case 0: return new Ctor;\n case 1: return new Ctor(args[0]);\n case 2: return new Ctor(args[0], args[1]);\n case 3: return new Ctor(args[0], args[1], args[2]);\n case 4: return new Ctor(args[0], args[1], args[2], args[3]);\n case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]);\n case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]);\n case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]);\n }\n var thisBinding = baseCreate(Ctor.prototype),\n result = Ctor.apply(thisBinding, args);\n\n // Mimic the constructor's `return` behavior.\n // See https://es5.github.io/#x13.2.2 for more details.\n return isObject(result) ? result : thisBinding;\n };\n }\n\n /**\n * Creates a function that wraps `func` to enable currying.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {number} arity The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createCurry(func, bitmask, arity) {\n var Ctor = createCtor(func);\n\n function wrapper() {\n var length = arguments.length,\n args = Array(length),\n index = length,\n placeholder = getHolder(wrapper);\n\n while (index--) {\n args[index] = arguments[index];\n }\n var holders = (length < 3 && args[0] !== placeholder && args[length - 1] !== placeholder)\n ? []\n : replaceHolders(args, placeholder);\n\n length -= holders.length;\n if (length < arity) {\n return createRecurry(\n func, bitmask, createHybrid, wrapper.placeholder, undefined,\n args, holders, undefined, undefined, arity - length);\n }\n var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n return apply(fn, this, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a `_.find` or `_.findLast` function.\n *\n * @private\n * @param {Function} findIndexFunc The function to find the collection index.\n * @returns {Function} Returns the new find function.\n */\n function createFind(findIndexFunc) {\n return function(collection, predicate, fromIndex) {\n var iterable = Object(collection);\n if (!isArrayLike(collection)) {\n var iteratee = getIteratee(predicate, 3);\n collection = keys(collection);\n predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n }\n var index = findIndexFunc(collection, predicate, fromIndex);\n return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n };\n }\n\n /**\n * Creates a `_.flow` or `_.flowRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new flow function.\n */\n function createFlow(fromRight) {\n return flatRest(function(funcs) {\n var length = funcs.length,\n index = length,\n prereq = LodashWrapper.prototype.thru;\n\n if (fromRight) {\n funcs.reverse();\n }\n while (index--) {\n var func = funcs[index];\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n if (prereq && !wrapper && getFuncName(func) == 'wrapper') {\n var wrapper = new LodashWrapper([], true);\n }\n }\n index = wrapper ? index : length;\n while (++index < length) {\n func = funcs[index];\n\n var funcName = getFuncName(func),\n data = funcName == 'wrapper' ? getData(func) : undefined;\n\n if (data && isLaziable(data[0]) &&\n data[1] == (WRAP_ARY_FLAG | WRAP_CURRY_FLAG | WRAP_PARTIAL_FLAG | WRAP_REARG_FLAG) &&\n !data[4].length && data[9] == 1\n ) {\n wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);\n } else {\n wrapper = (func.length == 1 && isLaziable(func))\n ? wrapper[funcName]()\n : wrapper.thru(func);\n }\n }\n return function() {\n var args = arguments,\n value = args[0];\n\n if (wrapper && args.length == 1 && isArray(value)) {\n return wrapper.plant(value).value();\n }\n var index = 0,\n result = length ? funcs[index].apply(this, args) : value;\n\n while (++index < length) {\n result = funcs[index].call(this, result);\n }\n return result;\n };\n });\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with optional `this`\n * binding of `thisArg`, partial application, and currying.\n *\n * @private\n * @param {Function|string} func The function or method name to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to prepend to those provided to\n * the new function.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [partialsRight] The arguments to append to those provided\n * to the new function.\n * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createHybrid(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) {\n var isAry = bitmask & WRAP_ARY_FLAG,\n isBind = bitmask & WRAP_BIND_FLAG,\n isBindKey = bitmask & WRAP_BIND_KEY_FLAG,\n isCurried = bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG),\n isFlip = bitmask & WRAP_FLIP_FLAG,\n Ctor = isBindKey ? undefined : createCtor(func);\n\n function wrapper() {\n var length = arguments.length,\n args = Array(length),\n index = length;\n\n while (index--) {\n args[index] = arguments[index];\n }\n if (isCurried) {\n var placeholder = getHolder(wrapper),\n holdersCount = countHolders(args, placeholder);\n }\n if (partials) {\n args = composeArgs(args, partials, holders, isCurried);\n }\n if (partialsRight) {\n args = composeArgsRight(args, partialsRight, holdersRight, isCurried);\n }\n length -= holdersCount;\n if (isCurried && length < arity) {\n var newHolders = replaceHolders(args, placeholder);\n return createRecurry(\n func, bitmask, createHybrid, wrapper.placeholder, thisArg,\n args, newHolders, argPos, ary, arity - length\n );\n }\n var thisBinding = isBind ? thisArg : this,\n fn = isBindKey ? thisBinding[func] : func;\n\n length = args.length;\n if (argPos) {\n args = reorder(args, argPos);\n } else if (isFlip && length > 1) {\n args.reverse();\n }\n if (isAry && ary < length) {\n args.length = ary;\n }\n if (this && this !== root && this instanceof wrapper) {\n fn = Ctor || createCtor(fn);\n }\n return fn.apply(thisBinding, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a function like `_.invertBy`.\n *\n * @private\n * @param {Function} setter The function to set accumulator values.\n * @param {Function} toIteratee The function to resolve iteratees.\n * @returns {Function} Returns the new inverter function.\n */\n function createInverter(setter, toIteratee) {\n return function(object, iteratee) {\n return baseInverter(object, setter, toIteratee(iteratee), {});\n };\n }\n\n /**\n * Creates a function that performs a mathematical operation on two values.\n *\n * @private\n * @param {Function} operator The function to perform the operation.\n * @param {number} [defaultValue] The value used for `undefined` arguments.\n * @returns {Function} Returns the new mathematical operation function.\n */\n function createMathOperation(operator, defaultValue) {\n return function(value, other) {\n var result;\n if (value === undefined && other === undefined) {\n return defaultValue;\n }\n if (value !== undefined) {\n result = value;\n }\n if (other !== undefined) {\n if (result === undefined) {\n return other;\n }\n if (typeof value == 'string' || typeof other == 'string') {\n value = baseToString(value);\n other = baseToString(other);\n } else {\n value = baseToNumber(value);\n other = baseToNumber(other);\n }\n result = operator(value, other);\n }\n return result;\n };\n }\n\n /**\n * Creates a function like `_.over`.\n *\n * @private\n * @param {Function} arrayFunc The function to iterate over iteratees.\n * @returns {Function} Returns the new over function.\n */\n function createOver(arrayFunc) {\n return flatRest(function(iteratees) {\n iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n return baseRest(function(args) {\n var thisArg = this;\n return arrayFunc(iteratees, function(iteratee) {\n return apply(iteratee, thisArg, args);\n });\n });\n });\n }\n\n /**\n * Creates the padding for `string` based on `length`. The `chars` string\n * is truncated if the number of characters exceeds `length`.\n *\n * @private\n * @param {number} length The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padding for `string`.\n */\n function createPadding(length, chars) {\n chars = chars === undefined ? ' ' : baseToString(chars);\n\n var charsLength = chars.length;\n if (charsLength < 2) {\n return charsLength ? baseRepeat(chars, length) : chars;\n }\n var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));\n return hasUnicode(chars)\n ? castSlice(stringToArray(result), 0, length).join('')\n : result.slice(0, length);\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with the `this` binding\n * of `thisArg` and `partials` prepended to the arguments it receives.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} partials The arguments to prepend to those provided to\n * the new function.\n * @returns {Function} Returns the new wrapped function.\n */\n function createPartial(func, bitmask, thisArg, partials) {\n var isBind = bitmask & WRAP_BIND_FLAG,\n Ctor = createCtor(func);\n\n function wrapper() {\n var argsIndex = -1,\n argsLength = arguments.length,\n leftIndex = -1,\n leftLength = partials.length,\n args = Array(leftLength + argsLength),\n fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n\n while (++leftIndex < leftLength) {\n args[leftIndex] = partials[leftIndex];\n }\n while (argsLength--) {\n args[leftIndex++] = arguments[++argsIndex];\n }\n return apply(fn, isBind ? thisArg : this, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a `_.range` or `_.rangeRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new range function.\n */\n function createRange(fromRight) {\n return function(start, end, step) {\n if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {\n end = step = undefined;\n }\n // Ensure the sign of `-0` is preserved.\n start = toFinite(start);\n if (end === undefined) {\n end = start;\n start = 0;\n } else {\n end = toFinite(end);\n }\n step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);\n return baseRange(start, end, step, fromRight);\n };\n }\n\n /**\n * Creates a function that performs a relational operation on two values.\n *\n * @private\n * @param {Function} operator The function to perform the operation.\n * @returns {Function} Returns the new relational operation function.\n */\n function createRelationalOperation(operator) {\n return function(value, other) {\n if (!(typeof value == 'string' && typeof other == 'string')) {\n value = toNumber(value);\n other = toNumber(other);\n }\n return operator(value, other);\n };\n }\n\n /**\n * Creates a function that wraps `func` to continue currying.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {Function} wrapFunc The function to create the `func` wrapper.\n * @param {*} placeholder The placeholder value.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to prepend to those provided to\n * the new function.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createRecurry(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) {\n var isCurry = bitmask & WRAP_CURRY_FLAG,\n newHolders = isCurry ? holders : undefined,\n newHoldersRight = isCurry ? undefined : holders,\n newPartials = isCurry ? partials : undefined,\n newPartialsRight = isCurry ? undefined : partials;\n\n bitmask |= (isCurry ? WRAP_PARTIAL_FLAG : WRAP_PARTIAL_RIGHT_FLAG);\n bitmask &= ~(isCurry ? WRAP_PARTIAL_RIGHT_FLAG : WRAP_PARTIAL_FLAG);\n\n if (!(bitmask & WRAP_CURRY_BOUND_FLAG)) {\n bitmask &= ~(WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG);\n }\n var newData = [\n func, bitmask, thisArg, newPartials, newHolders, newPartialsRight,\n newHoldersRight, argPos, ary, arity\n ];\n\n var result = wrapFunc.apply(undefined, newData);\n if (isLaziable(func)) {\n setData(result, newData);\n }\n result.placeholder = placeholder;\n return setWrapToString(result, func, bitmask);\n }\n\n /**\n * Creates a function like `_.round`.\n *\n * @private\n * @param {string} methodName The name of the `Math` method to use when rounding.\n * @returns {Function} Returns the new round function.\n */\n function createRound(methodName) {\n var func = Math[methodName];\n return function(number, precision) {\n number = toNumber(number);\n precision = precision == null ? 0 : nativeMin(toInteger(precision), 292);\n if (precision && nativeIsFinite(number)) {\n // Shift with exponential notation to avoid floating-point issues.\n // See [MDN](https://mdn.io/round#Examples) for more details.\n var pair = (toString(number) + 'e').split('e'),\n value = func(pair[0] + 'e' + (+pair[1] + precision));\n\n pair = (toString(value) + 'e').split('e');\n return +(pair[0] + 'e' + (+pair[1] - precision));\n }\n return func(number);\n };\n }\n\n /**\n * Creates a set object of `values`.\n *\n * @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n */\n var createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n return new Set(values);\n };\n\n /**\n * Creates a `_.toPairs` or `_.toPairsIn` function.\n *\n * @private\n * @param {Function} keysFunc The function to get the keys of a given object.\n * @returns {Function} Returns the new pairs function.\n */\n function createToPairs(keysFunc) {\n return function(object) {\n var tag = getTag(object);\n if (tag == mapTag) {\n return mapToArray(object);\n }\n if (tag == setTag) {\n return setToPairs(object);\n }\n return baseToPairs(object, keysFunc(object));\n };\n }\n\n /**\n * Creates a function that either curries or invokes `func` with optional\n * `this` binding and partially applied arguments.\n *\n * @private\n * @param {Function|string} func The function or method name to wrap.\n * @param {number} bitmask The bitmask flags.\n * 1 - `_.bind`\n * 2 - `_.bindKey`\n * 4 - `_.curry` or `_.curryRight` of a bound function\n * 8 - `_.curry`\n * 16 - `_.curryRight`\n * 32 - `_.partial`\n * 64 - `_.partialRight`\n * 128 - `_.rearg`\n * 256 - `_.ary`\n * 512 - `_.flip`\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to be partially applied.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createWrap(func, bitmask, thisArg, partials, holders, argPos, ary, arity) {\n var isBindKey = bitmask & WRAP_BIND_KEY_FLAG;\n if (!isBindKey && typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n var length = partials ? partials.length : 0;\n if (!length) {\n bitmask &= ~(WRAP_PARTIAL_FLAG | WRAP_PARTIAL_RIGHT_FLAG);\n partials = holders = undefined;\n }\n ary = ary === undefined ? ary : nativeMax(toInteger(ary), 0);\n arity = arity === undefined ? arity : toInteger(arity);\n length -= holders ? holders.length : 0;\n\n if (bitmask & WRAP_PARTIAL_RIGHT_FLAG) {\n var partialsRight = partials,\n holdersRight = holders;\n\n partials = holders = undefined;\n }\n var data = isBindKey ? undefined : getData(func);\n\n var newData = [\n func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,\n argPos, ary, arity\n ];\n\n if (data) {\n mergeData(newData, data);\n }\n func = newData[0];\n bitmask = newData[1];\n thisArg = newData[2];\n partials = newData[3];\n holders = newData[4];\n arity = newData[9] = newData[9] === undefined\n ? (isBindKey ? 0 : func.length)\n : nativeMax(newData[9] - length, 0);\n\n if (!arity && bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG)) {\n bitmask &= ~(WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG);\n }\n if (!bitmask || bitmask == WRAP_BIND_FLAG) {\n var result = createBind(func, bitmask, thisArg);\n } else if (bitmask == WRAP_CURRY_FLAG || bitmask == WRAP_CURRY_RIGHT_FLAG) {\n result = createCurry(func, bitmask, arity);\n } else if ((bitmask == WRAP_PARTIAL_FLAG || bitmask == (WRAP_BIND_FLAG | WRAP_PARTIAL_FLAG)) && !holders.length) {\n result = createPartial(func, bitmask, thisArg, partials);\n } else {\n result = createHybrid.apply(undefined, newData);\n }\n var setter = data ? baseSetData : setData;\n return setWrapToString(setter(result, newData), func, bitmask);\n }\n\n /**\n * Used by `_.defaults` to customize its `_.assignIn` use to assign properties\n * of source objects to the destination object for all destination properties\n * that resolve to `undefined`.\n *\n * @private\n * @param {*} objValue The destination value.\n * @param {*} srcValue The source value.\n * @param {string} key The key of the property to assign.\n * @param {Object} object The parent object of `objValue`.\n * @returns {*} Returns the value to assign.\n */\n function customDefaultsAssignIn(objValue, srcValue, key, object) {\n if (objValue === undefined ||\n (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n return srcValue;\n }\n return objValue;\n }\n\n /**\n * Used by `_.defaultsDeep` to customize its `_.merge` use to merge source\n * objects into destination objects that are passed thru.\n *\n * @private\n * @param {*} objValue The destination value.\n * @param {*} srcValue The source value.\n * @param {string} key The key of the property to merge.\n * @param {Object} object The parent object of `objValue`.\n * @param {Object} source The parent object of `srcValue`.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n * @returns {*} Returns the value to assign.\n */\n function customDefaultsMerge(objValue, srcValue, key, object, source, stack) {\n if (isObject(objValue) && isObject(srcValue)) {\n // Recursively merge objects and arrays (susceptible to call stack limits).\n stack.set(srcValue, objValue);\n baseMerge(objValue, srcValue, undefined, customDefaultsMerge, stack);\n stack['delete'](srcValue);\n }\n return objValue;\n }\n\n /**\n * Used by `_.omit` to customize its `_.cloneDeep` use to only clone plain\n * objects.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {string} key The key of the property to inspect.\n * @returns {*} Returns the uncloned value or `undefined` to defer cloning to `_.cloneDeep`.\n */\n function customOmitClone(value) {\n return isPlainObject(value) ? undefined : value;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n */\n function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n arrLength = array.length,\n othLength = other.length;\n\n if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n return false;\n }\n // Check that cyclic values are equal.\n var arrStacked = stack.get(array);\n var othStacked = stack.get(other);\n if (arrStacked && othStacked) {\n return arrStacked == other && othStacked == array;\n }\n var index = -1,\n result = true,\n seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n stack.set(array, other);\n stack.set(other, array);\n\n // Ignore non-index properties.\n while (++index < arrLength) {\n var arrValue = array[index],\n othValue = other[index];\n\n if (customizer) {\n var compared = isPartial\n ? customizer(othValue, arrValue, index, other, array, stack)\n : customizer(arrValue, othValue, index, array, other, stack);\n }\n if (compared !== undefined) {\n if (compared) {\n continue;\n }\n result = false;\n break;\n }\n // Recursively compare arrays (susceptible to call stack limits).\n if (seen) {\n if (!arraySome(other, function(othValue, othIndex) {\n if (!cacheHas(seen, othIndex) &&\n (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n return seen.push(othIndex);\n }\n })) {\n result = false;\n break;\n }\n } else if (!(\n arrValue === othValue ||\n equalFunc(arrValue, othValue, bitmask, customizer, stack)\n )) {\n result = false;\n break;\n }\n }\n stack['delete'](array);\n stack['delete'](other);\n return result;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n *\n * **Note:** This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n switch (tag) {\n case dataViewTag:\n if ((object.byteLength != other.byteLength) ||\n (object.byteOffset != other.byteOffset)) {\n return false;\n }\n object = object.buffer;\n other = other.buffer;\n\n case arrayBufferTag:\n if ((object.byteLength != other.byteLength) ||\n !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n return false;\n }\n return true;\n\n case boolTag:\n case dateTag:\n case numberTag:\n // Coerce booleans to `1` or `0` and dates to milliseconds.\n // Invalid dates are coerced to `NaN`.\n return eq(+object, +other);\n\n case errorTag:\n return object.name == other.name && object.message == other.message;\n\n case regexpTag:\n case stringTag:\n // Coerce regexes to strings and treat strings, primitives and objects,\n // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n // for more details.\n return object == (other + '');\n\n case mapTag:\n var convert = mapToArray;\n\n case setTag:\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n convert || (convert = setToArray);\n\n if (object.size != other.size && !isPartial) {\n return false;\n }\n // Assume cyclic values are equal.\n var stacked = stack.get(object);\n if (stacked) {\n return stacked == other;\n }\n bitmask |= COMPARE_UNORDERED_FLAG;\n\n // Recursively compare objects (susceptible to call stack limits).\n stack.set(object, other);\n var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n stack['delete'](object);\n return result;\n\n case symbolTag:\n if (symbolValueOf) {\n return symbolValueOf.call(object) == symbolValueOf.call(other);\n }\n }\n return false;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n objProps = getAllKeys(object),\n objLength = objProps.length,\n othProps = getAllKeys(other),\n othLength = othProps.length;\n\n if (objLength != othLength && !isPartial) {\n return false;\n }\n var index = objLength;\n while (index--) {\n var key = objProps[index];\n if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n return false;\n }\n }\n // Check that cyclic values are equal.\n var objStacked = stack.get(object);\n var othStacked = stack.get(other);\n if (objStacked && othStacked) {\n return objStacked == other && othStacked == object;\n }\n var result = true;\n stack.set(object, other);\n stack.set(other, object);\n\n var skipCtor = isPartial;\n while (++index < objLength) {\n key = objProps[index];\n var objValue = object[key],\n othValue = other[key];\n\n if (customizer) {\n var compared = isPartial\n ? customizer(othValue, objValue, key, other, object, stack)\n : customizer(objValue, othValue, key, object, other, stack);\n }\n // Recursively compare objects (susceptible to call stack limits).\n if (!(compared === undefined\n ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n : compared\n )) {\n result = false;\n break;\n }\n skipCtor || (skipCtor = key == 'constructor');\n }\n if (result && !skipCtor) {\n var objCtor = object.constructor,\n othCtor = other.constructor;\n\n // Non `Object` object instances with different constructors are not equal.\n if (objCtor != othCtor &&\n ('constructor' in object && 'constructor' in other) &&\n !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n result = false;\n }\n }\n stack['delete'](object);\n stack['delete'](other);\n return result;\n }\n\n /**\n * A specialized version of `baseRest` which flattens the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\n function flatRest(func) {\n return setToString(overRest(func, undefined, flatten), func + '');\n }\n\n /**\n * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function getAllKeys(object) {\n return baseGetAllKeys(object, keys, getSymbols);\n }\n\n /**\n * Creates an array of own and inherited enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function getAllKeysIn(object) {\n return baseGetAllKeys(object, keysIn, getSymbolsIn);\n }\n\n /**\n * Gets metadata for `func`.\n *\n * @private\n * @param {Function} func The function to query.\n * @returns {*} Returns the metadata for `func`.\n */\n var getData = !metaMap ? noop : function(func) {\n return metaMap.get(func);\n };\n\n /**\n * Gets the name of `func`.\n *\n * @private\n * @param {Function} func The function to query.\n * @returns {string} Returns the function name.\n */\n function getFuncName(func) {\n var result = (func.name + ''),\n array = realNames[result],\n length = hasOwnProperty.call(realNames, result) ? array.length : 0;\n\n while (length--) {\n var data = array[length],\n otherFunc = data.func;\n if (otherFunc == null || otherFunc == func) {\n return data.name;\n }\n }\n return result;\n }\n\n /**\n * Gets the argument placeholder value for `func`.\n *\n * @private\n * @param {Function} func The function to inspect.\n * @returns {*} Returns the placeholder value.\n */\n function getHolder(func) {\n var object = hasOwnProperty.call(lodash, 'placeholder') ? lodash : func;\n return object.placeholder;\n }\n\n /**\n * Gets the appropriate \"iteratee\" function. If `_.iteratee` is customized,\n * this function returns the custom method, otherwise it returns `baseIteratee`.\n * If arguments are provided, the chosen function is invoked with them and\n * its result is returned.\n *\n * @private\n * @param {*} [value] The value to convert to an iteratee.\n * @param {number} [arity] The arity of the created iteratee.\n * @returns {Function} Returns the chosen function or its result.\n */\n function getIteratee() {\n var result = lodash.iteratee || iteratee;\n result = result === iteratee ? baseIteratee : result;\n return arguments.length ? result(arguments[0], arguments[1]) : result;\n }\n\n /**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\n function getMapData(map, key) {\n var data = map.__data__;\n return isKeyable(key)\n ? data[typeof key == 'string' ? 'string' : 'hash']\n : data.map;\n }\n\n /**\n * Gets the property names, values, and compare flags of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the match data of `object`.\n */\n function getMatchData(object) {\n var result = keys(object),\n length = result.length;\n\n while (length--) {\n var key = result[length],\n value = object[key];\n\n result[length] = [key, value, isStrictComparable(value)];\n }\n return result;\n }\n\n /**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\n function getNative(object, key) {\n var value = getValue(object, key);\n return baseIsNative(value) ? value : undefined;\n }\n\n /**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\n function getRawTag(value) {\n var isOwn = hasOwnProperty.call(value, symToStringTag),\n tag = value[symToStringTag];\n\n try {\n value[symToStringTag] = undefined;\n var unmasked = true;\n } catch (e) {}\n\n var result = nativeObjectToString.call(value);\n if (unmasked) {\n if (isOwn) {\n value[symToStringTag] = tag;\n } else {\n delete value[symToStringTag];\n }\n }\n return result;\n }\n\n /**\n * Creates an array of the own enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\n var getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n if (object == null) {\n return [];\n }\n object = Object(object);\n return arrayFilter(nativeGetSymbols(object), function(symbol) {\n return propertyIsEnumerable.call(object, symbol);\n });\n };\n\n /**\n * Creates an array of the own and inherited enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\n var getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {\n var result = [];\n while (object) {\n arrayPush(result, getSymbols(object));\n object = getPrototype(object);\n }\n return result;\n };\n\n /**\n * Gets the `toStringTag` of `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\n var getTag = baseGetTag;\n\n // Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\n if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n (Map && getTag(new Map) != mapTag) ||\n (Promise && getTag(Promise.resolve()) != promiseTag) ||\n (Set && getTag(new Set) != setTag) ||\n (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n getTag = function(value) {\n var result = baseGetTag(value),\n Ctor = result == objectTag ? value.constructor : undefined,\n ctorString = Ctor ? toSource(Ctor) : '';\n\n if (ctorString) {\n switch (ctorString) {\n case dataViewCtorString: return dataViewTag;\n case mapCtorString: return mapTag;\n case promiseCtorString: return promiseTag;\n case setCtorString: return setTag;\n case weakMapCtorString: return weakMapTag;\n }\n }\n return result;\n };\n }\n\n /**\n * Gets the view, applying any `transforms` to the `start` and `end` positions.\n *\n * @private\n * @param {number} start The start of the view.\n * @param {number} end The end of the view.\n * @param {Array} transforms The transformations to apply to the view.\n * @returns {Object} Returns an object containing the `start` and `end`\n * positions of the view.\n */\n function getView(start, end, transforms) {\n var index = -1,\n length = transforms.length;\n\n while (++index < length) {\n var data = transforms[index],\n size = data.size;\n\n switch (data.type) {\n case 'drop': start += size; break;\n case 'dropRight': end -= size; break;\n case 'take': end = nativeMin(end, start + size); break;\n case 'takeRight': start = nativeMax(start, end - size); break;\n }\n }\n return { 'start': start, 'end': end };\n }\n\n /**\n * Extracts wrapper details from the `source` body comment.\n *\n * @private\n * @param {string} source The source to inspect.\n * @returns {Array} Returns the wrapper details.\n */\n function getWrapDetails(source) {\n var match = source.match(reWrapDetails);\n return match ? match[1].split(reSplitDetails) : [];\n }\n\n /**\n * Checks if `path` exists on `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n */\n function hasPath(object, path, hasFunc) {\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n result = false;\n\n while (++index < length) {\n var key = toKey(path[index]);\n if (!(result = object != null && hasFunc(object, key))) {\n break;\n }\n object = object[key];\n }\n if (result || ++index != length) {\n return result;\n }\n length = object == null ? 0 : object.length;\n return !!length && isLength(length) && isIndex(key, length) &&\n (isArray(object) || isArguments(object));\n }\n\n /**\n * Initializes an array clone.\n *\n * @private\n * @param {Array} array The array to clone.\n * @returns {Array} Returns the initialized clone.\n */\n function initCloneArray(array) {\n var length = array.length,\n result = new array.constructor(length);\n\n // Add properties assigned by `RegExp#exec`.\n if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n result.index = array.index;\n result.input = array.input;\n }\n return result;\n }\n\n /**\n * Initializes an object clone.\n *\n * @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n */\n function initCloneObject(object) {\n return (typeof object.constructor == 'function' && !isPrototype(object))\n ? baseCreate(getPrototype(object))\n : {};\n }\n\n /**\n * Initializes an object clone based on its `toStringTag`.\n *\n * **Note:** This function only supports cloning values with tags of\n * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.\n *\n * @private\n * @param {Object} object The object to clone.\n * @param {string} tag The `toStringTag` of the object to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the initialized clone.\n */\n function initCloneByTag(object, tag, isDeep) {\n var Ctor = object.constructor;\n switch (tag) {\n case arrayBufferTag:\n return cloneArrayBuffer(object);\n\n case boolTag:\n case dateTag:\n return new Ctor(+object);\n\n case dataViewTag:\n return cloneDataView(object, isDeep);\n\n case float32Tag: case float64Tag:\n case int8Tag: case int16Tag: case int32Tag:\n case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n return cloneTypedArray(object, isDeep);\n\n case mapTag:\n return new Ctor;\n\n case numberTag:\n case stringTag:\n return new Ctor(object);\n\n case regexpTag:\n return cloneRegExp(object);\n\n case setTag:\n return new Ctor;\n\n case symbolTag:\n return cloneSymbol(object);\n }\n }\n\n /**\n * Inserts wrapper `details` in a comment at the top of the `source` body.\n *\n * @private\n * @param {string} source The source to modify.\n * @returns {Array} details The details to insert.\n * @returns {string} Returns the modified source.\n */\n function insertWrapDetails(source, details) {\n var length = details.length;\n if (!length) {\n return source;\n }\n var lastIndex = length - 1;\n details[lastIndex] = (length > 1 ? '& ' : '') + details[lastIndex];\n details = details.join(length > 2 ? ', ' : ' ');\n return source.replace(reWrapComment, '{\\n/* [wrapped with ' + details + '] */\\n');\n }\n\n /**\n * Checks if `value` is a flattenable `arguments` object or array.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n */\n function isFlattenable(value) {\n return isArray(value) || isArguments(value) ||\n !!(spreadableSymbol && value && value[spreadableSymbol]);\n }\n\n /**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\n function isIndex(value, length) {\n var type = typeof value;\n length = length == null ? MAX_SAFE_INTEGER : length;\n\n return !!length &&\n (type == 'number' ||\n (type != 'symbol' && reIsUint.test(value))) &&\n (value > -1 && value % 1 == 0 && value < length);\n }\n\n /**\n * Checks if the given arguments are from an iteratee call.\n *\n * @private\n * @param {*} value The potential iteratee value argument.\n * @param {*} index The potential iteratee index or key argument.\n * @param {*} object The potential iteratee object argument.\n * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n * else `false`.\n */\n function isIterateeCall(value, index, object) {\n if (!isObject(object)) {\n return false;\n }\n var type = typeof index;\n if (type == 'number'\n ? (isArrayLike(object) && isIndex(index, object.length))\n : (type == 'string' && index in object)\n ) {\n return eq(object[index], value);\n }\n return false;\n }\n\n /**\n * Checks if `value` is a property name and not a property path.\n *\n * @private\n * @param {*} value The value to check.\n * @param {Object} [object] The object to query keys on.\n * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n */\n function isKey(value, object) {\n if (isArray(value)) {\n return false;\n }\n var type = typeof value;\n if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n value == null || isSymbol(value)) {\n return true;\n }\n return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n (object != null && value in Object(object));\n }\n\n /**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\n function isKeyable(value) {\n var type = typeof value;\n return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n ? (value !== '__proto__')\n : (value === null);\n }\n\n /**\n * Checks if `func` has a lazy counterpart.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` has a lazy counterpart,\n * else `false`.\n */\n function isLaziable(func) {\n var funcName = getFuncName(func),\n other = lodash[funcName];\n\n if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) {\n return false;\n }\n if (func === other) {\n return true;\n }\n var data = getData(other);\n return !!data && func === data[0];\n }\n\n /**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\n function isMasked(func) {\n return !!maskSrcKey && (maskSrcKey in func);\n }\n\n /**\n * Checks if `func` is capable of being masked.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `func` is maskable, else `false`.\n */\n var isMaskable = coreJsData ? isFunction : stubFalse;\n\n /**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\n function isPrototype(value) {\n var Ctor = value && value.constructor,\n proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n return value === proto;\n }\n\n /**\n * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` if suitable for strict\n * equality comparisons, else `false`.\n */\n function isStrictComparable(value) {\n return value === value && !isObject(value);\n }\n\n /**\n * A specialized version of `matchesProperty` for source values suitable\n * for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\n function matchesStrictComparable(key, srcValue) {\n return function(object) {\n if (object == null) {\n return false;\n }\n return object[key] === srcValue &&\n (srcValue !== undefined || (key in Object(object)));\n };\n }\n\n /**\n * A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n *\n * @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n */\n function memoizeCapped(func) {\n var result = memoize(func, function(key) {\n if (cache.size === MAX_MEMOIZE_SIZE) {\n cache.clear();\n }\n return key;\n });\n\n var cache = result.cache;\n return result;\n }\n\n /**\n * Merges the function metadata of `source` into `data`.\n *\n * Merging metadata reduces the number of wrappers used to invoke a function.\n * This is possible because methods like `_.bind`, `_.curry`, and `_.partial`\n * may be applied regardless of execution order. Methods like `_.ary` and\n * `_.rearg` modify function arguments, making the order in which they are\n * executed important, preventing the merging of metadata. However, we make\n * an exception for a safe combined case where curried functions have `_.ary`\n * and or `_.rearg` applied.\n *\n * @private\n * @param {Array} data The destination metadata.\n * @param {Array} source The source metadata.\n * @returns {Array} Returns `data`.\n */\n function mergeData(data, source) {\n var bitmask = data[1],\n srcBitmask = source[1],\n newBitmask = bitmask | srcBitmask,\n isCommon = newBitmask < (WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG | WRAP_ARY_FLAG);\n\n var isCombo =\n ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_CURRY_FLAG)) ||\n ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_REARG_FLAG) && (data[7].length <= source[8])) ||\n ((srcBitmask == (WRAP_ARY_FLAG | WRAP_REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == WRAP_CURRY_FLAG));\n\n // Exit early if metadata can't be merged.\n if (!(isCommon || isCombo)) {\n return data;\n }\n // Use source `thisArg` if available.\n if (srcBitmask & WRAP_BIND_FLAG) {\n data[2] = source[2];\n // Set when currying a bound function.\n newBitmask |= bitmask & WRAP_BIND_FLAG ? 0 : WRAP_CURRY_BOUND_FLAG;\n }\n // Compose partial arguments.\n var value = source[3];\n if (value) {\n var partials = data[3];\n data[3] = partials ? composeArgs(partials, value, source[4]) : value;\n data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : source[4];\n }\n // Compose partial right arguments.\n value = source[5];\n if (value) {\n partials = data[5];\n data[5] = partials ? composeArgsRight(partials, value, source[6]) : value;\n data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : source[6];\n }\n // Use source `argPos` if available.\n value = source[7];\n if (value) {\n data[7] = value;\n }\n // Use source `ary` if it's smaller.\n if (srcBitmask & WRAP_ARY_FLAG) {\n data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]);\n }\n // Use source `arity` if one is not provided.\n if (data[9] == null) {\n data[9] = source[9];\n }\n // Use source `func` and merge bitmasks.\n data[0] = source[0];\n data[1] = newBitmask;\n\n return data;\n }\n\n /**\n * This function is like\n * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * except that it includes inherited enumerable properties.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function nativeKeysIn(object) {\n var result = [];\n if (object != null) {\n for (var key in Object(object)) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\n function objectToString(value) {\n return nativeObjectToString.call(value);\n }\n\n /**\n * A specialized version of `baseRest` which transforms the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @param {Function} transform The rest array transform.\n * @returns {Function} Returns the new function.\n */\n function overRest(func, start, transform) {\n start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n return function() {\n var args = arguments,\n index = -1,\n length = nativeMax(args.length - start, 0),\n array = Array(length);\n\n while (++index < length) {\n array[index] = args[start + index];\n }\n index = -1;\n var otherArgs = Array(start + 1);\n while (++index < start) {\n otherArgs[index] = args[index];\n }\n otherArgs[start] = transform(array);\n return apply(func, this, otherArgs);\n };\n }\n\n /**\n * Gets the parent value at `path` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} path The path to get the parent value of.\n * @returns {*} Returns the parent value.\n */\n function parent(object, path) {\n return path.length < 2 ? object : baseGet(object, baseSlice(path, 0, -1));\n }\n\n /**\n * Reorder `array` according to the specified indexes where the element at\n * the first index is assigned as the first element, the element at\n * the second index is assigned as the second element, and so on.\n *\n * @private\n * @param {Array} array The array to reorder.\n * @param {Array} indexes The arranged array indexes.\n * @returns {Array} Returns `array`.\n */\n function reorder(array, indexes) {\n var arrLength = array.length,\n length = nativeMin(indexes.length, arrLength),\n oldArray = copyArray(array);\n\n while (length--) {\n var index = indexes[length];\n array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined;\n }\n return array;\n }\n\n /**\n * Gets the value at `key`, unless `key` is \"__proto__\" or \"constructor\".\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\n function safeGet(object, key) {\n if (key === 'constructor' && typeof object[key] === 'function') {\n return;\n }\n\n if (key == '__proto__') {\n return;\n }\n\n return object[key];\n }\n\n /**\n * Sets metadata for `func`.\n *\n * **Note:** If this function becomes hot, i.e. is invoked a lot in a short\n * period of time, it will trip its breaker and transition to an identity\n * function to avoid garbage collection pauses in V8. See\n * [V8 issue 2070](https://bugs.chromium.org/p/v8/issues/detail?id=2070)\n * for more details.\n *\n * @private\n * @param {Function} func The function to associate metadata with.\n * @param {*} data The metadata.\n * @returns {Function} Returns `func`.\n */\n var setData = shortOut(baseSetData);\n\n /**\n * A simple wrapper around the global [`setTimeout`](https://mdn.io/setTimeout).\n *\n * @private\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @returns {number|Object} Returns the timer id or timeout object.\n */\n var setTimeout = ctxSetTimeout || function(func, wait) {\n return root.setTimeout(func, wait);\n };\n\n /**\n * Sets the `toString` method of `func` to return `string`.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\n var setToString = shortOut(baseSetToString);\n\n /**\n * Sets the `toString` method of `wrapper` to mimic the source of `reference`\n * with wrapper details in a comment at the top of the source body.\n *\n * @private\n * @param {Function} wrapper The function to modify.\n * @param {Function} reference The reference function.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @returns {Function} Returns `wrapper`.\n */\n function setWrapToString(wrapper, reference, bitmask) {\n var source = (reference + '');\n return setToString(wrapper, insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)));\n }\n\n /**\n * Creates a function that'll short out and invoke `identity` instead\n * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n * milliseconds.\n *\n * @private\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new shortable function.\n */\n function shortOut(func) {\n var count = 0,\n lastCalled = 0;\n\n return function() {\n var stamp = nativeNow(),\n remaining = HOT_SPAN - (stamp - lastCalled);\n\n lastCalled = stamp;\n if (remaining > 0) {\n if (++count >= HOT_COUNT) {\n return arguments[0];\n }\n } else {\n count = 0;\n }\n return func.apply(undefined, arguments);\n };\n }\n\n /**\n * A specialized version of `_.shuffle` which mutates and sets the size of `array`.\n *\n * @private\n * @param {Array} array The array to shuffle.\n * @param {number} [size=array.length] The size of `array`.\n * @returns {Array} Returns `array`.\n */\n function shuffleSelf(array, size) {\n var index = -1,\n length = array.length,\n lastIndex = length - 1;\n\n size = size === undefined ? length : size;\n while (++index < size) {\n var rand = baseRandom(index, lastIndex),\n value = array[rand];\n\n array[rand] = array[index];\n array[index] = value;\n }\n array.length = size;\n return array;\n }\n\n /**\n * Converts `string` to a property path array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the property path array.\n */\n var stringToPath = memoizeCapped(function(string) {\n var result = [];\n if (string.charCodeAt(0) === 46 /* . */) {\n result.push('');\n }\n string.replace(rePropName, function(match, number, quote, subString) {\n result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n });\n return result;\n });\n\n /**\n * Converts `value` to a string key if it's not a string or symbol.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {string|symbol} Returns the key.\n */\n function toKey(value) {\n if (typeof value == 'string' || isSymbol(value)) {\n return value;\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n }\n\n /**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\n function toSource(func) {\n if (func != null) {\n try {\n return funcToString.call(func);\n } catch (e) {}\n try {\n return (func + '');\n } catch (e) {}\n }\n return '';\n }\n\n /**\n * Updates wrapper `details` based on `bitmask` flags.\n *\n * @private\n * @returns {Array} details The details to modify.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @returns {Array} Returns `details`.\n */\n function updateWrapDetails(details, bitmask) {\n arrayEach(wrapFlags, function(pair) {\n var value = '_.' + pair[0];\n if ((bitmask & pair[1]) && !arrayIncludes(details, value)) {\n details.push(value);\n }\n });\n return details.sort();\n }\n\n /**\n * Creates a clone of `wrapper`.\n *\n * @private\n * @param {Object} wrapper The wrapper to clone.\n * @returns {Object} Returns the cloned wrapper.\n */\n function wrapperClone(wrapper) {\n if (wrapper instanceof LazyWrapper) {\n return wrapper.clone();\n }\n var result = new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__);\n result.__actions__ = copyArray(wrapper.__actions__);\n result.__index__ = wrapper.__index__;\n result.__values__ = wrapper.__values__;\n return result;\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an array of elements split into groups the length of `size`.\n * If `array` can't be split evenly, the final chunk will be the remaining\n * elements.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to process.\n * @param {number} [size=1] The length of each chunk\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the new array of chunks.\n * @example\n *\n * _.chunk(['a', 'b', 'c', 'd'], 2);\n * // => [['a', 'b'], ['c', 'd']]\n *\n * _.chunk(['a', 'b', 'c', 'd'], 3);\n * // => [['a', 'b', 'c'], ['d']]\n */\n function chunk(array, size, guard) {\n if ((guard ? isIterateeCall(array, size, guard) : size === undefined)) {\n size = 1;\n } else {\n size = nativeMax(toInteger(size), 0);\n }\n var length = array == null ? 0 : array.length;\n if (!length || size < 1) {\n return [];\n }\n var index = 0,\n resIndex = 0,\n result = Array(nativeCeil(length / size));\n\n while (index < length) {\n result[resIndex++] = baseSlice(array, index, (index += size));\n }\n return result;\n }\n\n /**\n * Creates an array with all falsey values removed. The values `false`, `null`,\n * `0`, `\"\"`, `undefined`, and `NaN` are falsey.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to compact.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.compact([0, 1, false, 2, '', 3]);\n * // => [1, 2, 3]\n */\n function compact(array) {\n var index = -1,\n length = array == null ? 0 : array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (value) {\n result[resIndex++] = value;\n }\n }\n return result;\n }\n\n /**\n * Creates a new array concatenating `array` with any additional arrays\n * and/or values.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to concatenate.\n * @param {...*} [values] The values to concatenate.\n * @returns {Array} Returns the new concatenated array.\n * @example\n *\n * var array = [1];\n * var other = _.concat(array, 2, [3], [[4]]);\n *\n * console.log(other);\n * // => [1, 2, 3, [4]]\n *\n * console.log(array);\n * // => [1]\n */\n function concat() {\n var length = arguments.length;\n if (!length) {\n return [];\n }\n var args = Array(length - 1),\n array = arguments[0],\n index = length;\n\n while (index--) {\n args[index - 1] = arguments[index];\n }\n return arrayPush(isArray(array) ? copyArray(array) : [array], baseFlatten(args, 1));\n }\n\n /**\n * Creates an array of `array` values not included in the other given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * **Note:** Unlike `_.pullAll`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.without, _.xor\n * @example\n *\n * _.difference([2, 1], [2, 3]);\n * // => [1]\n */\n var difference = baseRest(function(array, values) {\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n : [];\n });\n\n /**\n * This method is like `_.difference` except that it accepts `iteratee` which\n * is invoked for each element of `array` and `values` to generate the criterion\n * by which they're compared. The order and references of result values are\n * determined by the first array. The iteratee is invoked with one argument:\n * (value).\n *\n * **Note:** Unlike `_.pullAllBy`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x');\n * // => [{ 'x': 2 }]\n */\n var differenceBy = baseRest(function(array, values) {\n var iteratee = last(values);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), getIteratee(iteratee, 2))\n : [];\n });\n\n /**\n * This method is like `_.difference` except that it accepts `comparator`\n * which is invoked to compare elements of `array` to `values`. The order and\n * references of result values are determined by the first array. The comparator\n * is invoked with two arguments: (arrVal, othVal).\n *\n * **Note:** Unlike `_.pullAllWith`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n *\n * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }]\n */\n var differenceWith = baseRest(function(array, values) {\n var comparator = last(values);\n if (isArrayLikeObject(comparator)) {\n comparator = undefined;\n }\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined, comparator)\n : [];\n });\n\n /**\n * Creates a slice of `array` with `n` elements dropped from the beginning.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.drop([1, 2, 3]);\n * // => [2, 3]\n *\n * _.drop([1, 2, 3], 2);\n * // => [3]\n *\n * _.drop([1, 2, 3], 5);\n * // => []\n *\n * _.drop([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\n function drop(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n return baseSlice(array, n < 0 ? 0 : n, length);\n }\n\n /**\n * Creates a slice of `array` with `n` elements dropped from the end.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.dropRight([1, 2, 3]);\n * // => [1, 2]\n *\n * _.dropRight([1, 2, 3], 2);\n * // => [1]\n *\n * _.dropRight([1, 2, 3], 5);\n * // => []\n *\n * _.dropRight([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\n function dropRight(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n n = length - n;\n return baseSlice(array, 0, n < 0 ? 0 : n);\n }\n\n /**\n * Creates a slice of `array` excluding elements dropped from the end.\n * Elements are dropped until `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.dropRightWhile(users, function(o) { return !o.active; });\n * // => objects for ['barney']\n *\n * // The `_.matches` iteratee shorthand.\n * _.dropRightWhile(users, { 'user': 'pebbles', 'active': false });\n * // => objects for ['barney', 'fred']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.dropRightWhile(users, ['active', false]);\n * // => objects for ['barney']\n *\n * // The `_.property` iteratee shorthand.\n * _.dropRightWhile(users, 'active');\n * // => objects for ['barney', 'fred', 'pebbles']\n */\n function dropRightWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), true, true)\n : [];\n }\n\n /**\n * Creates a slice of `array` excluding elements dropped from the beginning.\n * Elements are dropped until `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.dropWhile(users, function(o) { return !o.active; });\n * // => objects for ['pebbles']\n *\n * // The `_.matches` iteratee shorthand.\n * _.dropWhile(users, { 'user': 'barney', 'active': false });\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.dropWhile(users, ['active', false]);\n * // => objects for ['pebbles']\n *\n * // The `_.property` iteratee shorthand.\n * _.dropWhile(users, 'active');\n * // => objects for ['barney', 'fred', 'pebbles']\n */\n function dropWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), true)\n : [];\n }\n\n /**\n * Fills elements of `array` with `value` from `start` up to, but not\n * including, `end`.\n *\n * **Note:** This method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Array\n * @param {Array} array The array to fill.\n * @param {*} value The value to fill `array` with.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _.fill(array, 'a');\n * console.log(array);\n * // => ['a', 'a', 'a']\n *\n * _.fill(Array(3), 2);\n * // => [2, 2, 2]\n *\n * _.fill([4, 6, 8, 10], '*', 1, 3);\n * // => [4, '*', '*', 10]\n */\n function fill(array, value, start, end) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n if (start && typeof start != 'number' && isIterateeCall(array, value, start)) {\n start = 0;\n end = length;\n }\n return baseFill(array, value, start, end);\n }\n\n /**\n * This method is like `_.find` except that it returns the index of the first\n * element `predicate` returns truthy for instead of the element itself.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.findIndex(users, function(o) { return o.user == 'barney'; });\n * // => 0\n *\n * // The `_.matches` iteratee shorthand.\n * _.findIndex(users, { 'user': 'fred', 'active': false });\n * // => 1\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findIndex(users, ['active', false]);\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.findIndex(users, 'active');\n * // => 2\n */\n function findIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = fromIndex == null ? 0 : toInteger(fromIndex);\n if (index < 0) {\n index = nativeMax(length + index, 0);\n }\n return baseFindIndex(array, getIteratee(predicate, 3), index);\n }\n\n /**\n * This method is like `_.findIndex` except that it iterates over elements\n * of `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=array.length-1] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.findLastIndex(users, function(o) { return o.user == 'pebbles'; });\n * // => 2\n *\n * // The `_.matches` iteratee shorthand.\n * _.findLastIndex(users, { 'user': 'barney', 'active': true });\n * // => 0\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findLastIndex(users, ['active', false]);\n * // => 2\n *\n * // The `_.property` iteratee shorthand.\n * _.findLastIndex(users, 'active');\n * // => 0\n */\n function findLastIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = length - 1;\n if (fromIndex !== undefined) {\n index = toInteger(fromIndex);\n index = fromIndex < 0\n ? nativeMax(length + index, 0)\n : nativeMin(index, length - 1);\n }\n return baseFindIndex(array, getIteratee(predicate, 3), index, true);\n }\n\n /**\n * Flattens `array` a single level deep.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n */\n function flatten(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, 1) : [];\n }\n\n /**\n * Recursively flattens `array`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flattenDeep([1, [2, [3, [4]], 5]]);\n * // => [1, 2, 3, 4, 5]\n */\n function flattenDeep(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, INFINITY) : [];\n }\n\n /**\n * Recursively flatten `array` up to `depth` times.\n *\n * @static\n * @memberOf _\n * @since 4.4.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @param {number} [depth=1] The maximum recursion depth.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * var array = [1, [2, [3, [4]], 5]];\n *\n * _.flattenDepth(array, 1);\n * // => [1, 2, [3, [4]], 5]\n *\n * _.flattenDepth(array, 2);\n * // => [1, 2, 3, [4], 5]\n */\n function flattenDepth(array, depth) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n depth = depth === undefined ? 1 : toInteger(depth);\n return baseFlatten(array, depth);\n }\n\n /**\n * The inverse of `_.toPairs`; this method returns an object composed\n * from key-value `pairs`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} pairs The key-value pairs.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.fromPairs([['a', 1], ['b', 2]]);\n * // => { 'a': 1, 'b': 2 }\n */\n function fromPairs(pairs) {\n var index = -1,\n length = pairs == null ? 0 : pairs.length,\n result = {};\n\n while (++index < length) {\n var pair = pairs[index];\n result[pair[0]] = pair[1];\n }\n return result;\n }\n\n /**\n * Gets the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias first\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the first element of `array`.\n * @example\n *\n * _.head([1, 2, 3]);\n * // => 1\n *\n * _.head([]);\n * // => undefined\n */\n function head(array) {\n return (array && array.length) ? array[0] : undefined;\n }\n\n /**\n * Gets the index at which the first occurrence of `value` is found in `array`\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. If `fromIndex` is negative, it's used as the\n * offset from the end of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.indexOf([1, 2, 1, 2], 2);\n * // => 1\n *\n * // Search from the `fromIndex`.\n * _.indexOf([1, 2, 1, 2], 2, 2);\n * // => 3\n */\n function indexOf(array, value, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = fromIndex == null ? 0 : toInteger(fromIndex);\n if (index < 0) {\n index = nativeMax(length + index, 0);\n }\n return baseIndexOf(array, value, index);\n }\n\n /**\n * Gets all but the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.initial([1, 2, 3]);\n * // => [1, 2]\n */\n function initial(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseSlice(array, 0, -1) : [];\n }\n\n /**\n * Creates an array of unique values that are included in all given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersection([2, 1], [2, 3]);\n * // => [2]\n */\n var intersection = baseRest(function(arrays) {\n var mapped = arrayMap(arrays, castArrayLikeObject);\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped)\n : [];\n });\n\n /**\n * This method is like `_.intersection` except that it accepts `iteratee`\n * which is invoked for each element of each `arrays` to generate the criterion\n * by which they're compared. The order and references of result values are\n * determined by the first array. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [2.1]\n *\n * // The `_.property` iteratee shorthand.\n * _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }]\n */\n var intersectionBy = baseRest(function(arrays) {\n var iteratee = last(arrays),\n mapped = arrayMap(arrays, castArrayLikeObject);\n\n if (iteratee === last(mapped)) {\n iteratee = undefined;\n } else {\n mapped.pop();\n }\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped, getIteratee(iteratee, 2))\n : [];\n });\n\n /**\n * This method is like `_.intersection` except that it accepts `comparator`\n * which is invoked to compare elements of `arrays`. The order and references\n * of result values are determined by the first array. The comparator is\n * invoked with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.intersectionWith(objects, others, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }]\n */\n var intersectionWith = baseRest(function(arrays) {\n var comparator = last(arrays),\n mapped = arrayMap(arrays, castArrayLikeObject);\n\n comparator = typeof comparator == 'function' ? comparator : undefined;\n if (comparator) {\n mapped.pop();\n }\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped, undefined, comparator)\n : [];\n });\n\n /**\n * Converts all elements in `array` into a string separated by `separator`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to convert.\n * @param {string} [separator=','] The element separator.\n * @returns {string} Returns the joined string.\n * @example\n *\n * _.join(['a', 'b', 'c'], '~');\n * // => 'a~b~c'\n */\n function join(array, separator) {\n return array == null ? '' : nativeJoin.call(array, separator);\n }\n\n /**\n * Gets the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the last element of `array`.\n * @example\n *\n * _.last([1, 2, 3]);\n * // => 3\n */\n function last(array) {\n var length = array == null ? 0 : array.length;\n return length ? array[length - 1] : undefined;\n }\n\n /**\n * This method is like `_.indexOf` except that it iterates over elements of\n * `array` from right to left.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=array.length-1] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.lastIndexOf([1, 2, 1, 2], 2);\n * // => 3\n *\n * // Search from the `fromIndex`.\n * _.lastIndexOf([1, 2, 1, 2], 2, 2);\n * // => 1\n */\n function lastIndexOf(array, value, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = length;\n if (fromIndex !== undefined) {\n index = toInteger(fromIndex);\n index = index < 0 ? nativeMax(length + index, 0) : nativeMin(index, length - 1);\n }\n return value === value\n ? strictLastIndexOf(array, value, index)\n : baseFindIndex(array, baseIsNaN, index, true);\n }\n\n /**\n * Gets the element at index `n` of `array`. If `n` is negative, the nth\n * element from the end is returned.\n *\n * @static\n * @memberOf _\n * @since 4.11.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=0] The index of the element to return.\n * @returns {*} Returns the nth element of `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'd'];\n *\n * _.nth(array, 1);\n * // => 'b'\n *\n * _.nth(array, -2);\n * // => 'c';\n */\n function nth(array, n) {\n return (array && array.length) ? baseNth(array, toInteger(n)) : undefined;\n }\n\n /**\n * Removes all given values from `array` using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove`\n * to remove elements from an array by predicate.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {...*} [values] The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pull(array, 'a', 'c');\n * console.log(array);\n * // => ['b', 'b']\n */\n var pull = baseRest(pullAll);\n\n /**\n * This method is like `_.pull` except that it accepts an array of values to remove.\n *\n * **Note:** Unlike `_.difference`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pullAll(array, ['a', 'c']);\n * console.log(array);\n * // => ['b', 'b']\n */\n function pullAll(array, values) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values)\n : array;\n }\n\n /**\n * This method is like `_.pullAll` except that it accepts `iteratee` which is\n * invoked for each element of `array` and `values` to generate the criterion\n * by which they're compared. The iteratee is invoked with one argument: (value).\n *\n * **Note:** Unlike `_.differenceBy`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }];\n *\n * _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x');\n * console.log(array);\n * // => [{ 'x': 2 }]\n */\n function pullAllBy(array, values, iteratee) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values, getIteratee(iteratee, 2))\n : array;\n }\n\n /**\n * This method is like `_.pullAll` except that it accepts `comparator` which\n * is invoked to compare elements of `array` to `values`. The comparator is\n * invoked with two arguments: (arrVal, othVal).\n *\n * **Note:** Unlike `_.differenceWith`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }];\n *\n * _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual);\n * console.log(array);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }]\n */\n function pullAllWith(array, values, comparator) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values, undefined, comparator)\n : array;\n }\n\n /**\n * Removes elements from `array` corresponding to `indexes` and returns an\n * array of removed elements.\n *\n * **Note:** Unlike `_.at`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {...(number|number[])} [indexes] The indexes of elements to remove.\n * @returns {Array} Returns the new array of removed elements.\n * @example\n *\n * var array = ['a', 'b', 'c', 'd'];\n * var pulled = _.pullAt(array, [1, 3]);\n *\n * console.log(array);\n * // => ['a', 'c']\n *\n * console.log(pulled);\n * // => ['b', 'd']\n */\n var pullAt = flatRest(function(array, indexes) {\n var length = array == null ? 0 : array.length,\n result = baseAt(array, indexes);\n\n basePullAt(array, arrayMap(indexes, function(index) {\n return isIndex(index, length) ? +index : index;\n }).sort(compareAscending));\n\n return result;\n });\n\n /**\n * Removes all elements from `array` that `predicate` returns truthy for\n * and returns an array of the removed elements. The predicate is invoked\n * with three arguments: (value, index, array).\n *\n * **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull`\n * to pull elements from an array by value.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new array of removed elements.\n * @example\n *\n * var array = [1, 2, 3, 4];\n * var evens = _.remove(array, function(n) {\n * return n % 2 == 0;\n * });\n *\n * console.log(array);\n * // => [1, 3]\n *\n * console.log(evens);\n * // => [2, 4]\n */\n function remove(array, predicate) {\n var result = [];\n if (!(array && array.length)) {\n return result;\n }\n var index = -1,\n indexes = [],\n length = array.length;\n\n predicate = getIteratee(predicate, 3);\n while (++index < length) {\n var value = array[index];\n if (predicate(value, index, array)) {\n result.push(value);\n indexes.push(index);\n }\n }\n basePullAt(array, indexes);\n return result;\n }\n\n /**\n * Reverses `array` so that the first element becomes the last, the second\n * element becomes the second to last, and so on.\n *\n * **Note:** This method mutates `array` and is based on\n * [`Array#reverse`](https://mdn.io/Array/reverse).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _.reverse(array);\n * // => [3, 2, 1]\n *\n * console.log(array);\n * // => [3, 2, 1]\n */\n function reverse(array) {\n return array == null ? array : nativeReverse.call(array);\n }\n\n /**\n * Creates a slice of `array` from `start` up to, but not including, `end`.\n *\n * **Note:** This method is used instead of\n * [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are\n * returned.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\n function slice(array, start, end) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n if (end && typeof end != 'number' && isIterateeCall(array, start, end)) {\n start = 0;\n end = length;\n }\n else {\n start = start == null ? 0 : toInteger(start);\n end = end === undefined ? length : toInteger(end);\n }\n return baseSlice(array, start, end);\n }\n\n /**\n * Uses a binary search to determine the lowest index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * _.sortedIndex([30, 50], 40);\n * // => 1\n */\n function sortedIndex(array, value) {\n return baseSortedIndex(array, value);\n }\n\n /**\n * This method is like `_.sortedIndex` except that it accepts `iteratee`\n * which is invoked for `value` and each element of `array` to compute their\n * sort ranking. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * var objects = [{ 'x': 4 }, { 'x': 5 }];\n *\n * _.sortedIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.sortedIndexBy(objects, { 'x': 4 }, 'x');\n * // => 0\n */\n function sortedIndexBy(array, value, iteratee) {\n return baseSortedIndexBy(array, value, getIteratee(iteratee, 2));\n }\n\n /**\n * This method is like `_.indexOf` except that it performs a binary\n * search on a sorted `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.sortedIndexOf([4, 5, 5, 5, 6], 5);\n * // => 1\n */\n function sortedIndexOf(array, value) {\n var length = array == null ? 0 : array.length;\n if (length) {\n var index = baseSortedIndex(array, value);\n if (index < length && eq(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * This method is like `_.sortedIndex` except that it returns the highest\n * index at which `value` should be inserted into `array` in order to\n * maintain its sort order.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * _.sortedLastIndex([4, 5, 5, 5, 6], 5);\n * // => 4\n */\n function sortedLastIndex(array, value) {\n return baseSortedIndex(array, value, true);\n }\n\n /**\n * This method is like `_.sortedLastIndex` except that it accepts `iteratee`\n * which is invoked for `value` and each element of `array` to compute their\n * sort ranking. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * var objects = [{ 'x': 4 }, { 'x': 5 }];\n *\n * _.sortedLastIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n * // => 1\n *\n * // The `_.property` iteratee shorthand.\n * _.sortedLastIndexBy(objects, { 'x': 4 }, 'x');\n * // => 1\n */\n function sortedLastIndexBy(array, value, iteratee) {\n return baseSortedIndexBy(array, value, getIteratee(iteratee, 2), true);\n }\n\n /**\n * This method is like `_.lastIndexOf` except that it performs a binary\n * search on a sorted `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.sortedLastIndexOf([4, 5, 5, 5, 6], 5);\n * // => 3\n */\n function sortedLastIndexOf(array, value) {\n var length = array == null ? 0 : array.length;\n if (length) {\n var index = baseSortedIndex(array, value, true) - 1;\n if (eq(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * This method is like `_.uniq` except that it's designed and optimized\n * for sorted arrays.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.sortedUniq([1, 1, 2]);\n * // => [1, 2]\n */\n function sortedUniq(array) {\n return (array && array.length)\n ? baseSortedUniq(array)\n : [];\n }\n\n /**\n * This method is like `_.uniqBy` except that it's designed and optimized\n * for sorted arrays.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor);\n * // => [1.1, 2.3]\n */\n function sortedUniqBy(array, iteratee) {\n return (array && array.length)\n ? baseSortedUniq(array, getIteratee(iteratee, 2))\n : [];\n }\n\n /**\n * Gets all but the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.tail([1, 2, 3]);\n * // => [2, 3]\n */\n function tail(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseSlice(array, 1, length) : [];\n }\n\n /**\n * Creates a slice of `array` with `n` elements taken from the beginning.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to take.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.take([1, 2, 3]);\n * // => [1]\n *\n * _.take([1, 2, 3], 2);\n * // => [1, 2]\n *\n * _.take([1, 2, 3], 5);\n * // => [1, 2, 3]\n *\n * _.take([1, 2, 3], 0);\n * // => []\n */\n function take(array, n, guard) {\n if (!(array && array.length)) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n return baseSlice(array, 0, n < 0 ? 0 : n);\n }\n\n /**\n * Creates a slice of `array` with `n` elements taken from the end.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to take.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.takeRight([1, 2, 3]);\n * // => [3]\n *\n * _.takeRight([1, 2, 3], 2);\n * // => [2, 3]\n *\n * _.takeRight([1, 2, 3], 5);\n * // => [1, 2, 3]\n *\n * _.takeRight([1, 2, 3], 0);\n * // => []\n */\n function takeRight(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n n = length - n;\n return baseSlice(array, n < 0 ? 0 : n, length);\n }\n\n /**\n * Creates a slice of `array` with elements taken from the end. Elements are\n * taken until `predicate` returns falsey. The predicate is invoked with\n * three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.takeRightWhile(users, function(o) { return !o.active; });\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.matches` iteratee shorthand.\n * _.takeRightWhile(users, { 'user': 'pebbles', 'active': false });\n * // => objects for ['pebbles']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.takeRightWhile(users, ['active', false]);\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.property` iteratee shorthand.\n * _.takeRightWhile(users, 'active');\n * // => []\n */\n function takeRightWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), false, true)\n : [];\n }\n\n /**\n * Creates a slice of `array` with elements taken from the beginning. Elements\n * are taken until `predicate` returns falsey. The predicate is invoked with\n * three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.takeWhile(users, function(o) { return !o.active; });\n * // => objects for ['barney', 'fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.takeWhile(users, { 'user': 'barney', 'active': false });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.takeWhile(users, ['active', false]);\n * // => objects for ['barney', 'fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.takeWhile(users, 'active');\n * // => []\n */\n function takeWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3))\n : [];\n }\n\n /**\n * Creates an array of unique values, in order, from all given arrays using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.union([2], [1, 2]);\n * // => [2, 1]\n */\n var union = baseRest(function(arrays) {\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n });\n\n /**\n * This method is like `_.union` except that it accepts `iteratee` which is\n * invoked for each element of each `arrays` to generate the criterion by\n * which uniqueness is computed. Result values are chosen from the first\n * array in which the value occurs. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.unionBy([2.1], [1.2, 2.3], Math.floor);\n * // => [2.1, 1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }, { 'x': 2 }]\n */\n var unionBy = baseRest(function(arrays) {\n var iteratee = last(arrays);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), getIteratee(iteratee, 2));\n });\n\n /**\n * This method is like `_.union` except that it accepts `comparator` which\n * is invoked to compare elements of `arrays`. Result values are chosen from\n * the first array in which the value occurs. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.unionWith(objects, others, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\n var unionWith = baseRest(function(arrays) {\n var comparator = last(arrays);\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), undefined, comparator);\n });\n\n /**\n * Creates a duplicate-free version of an array, using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons, in which only the first occurrence of each element\n * is kept. The order of result values is determined by the order they occur\n * in the array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniq([2, 1, 2]);\n * // => [2, 1]\n */\n function uniq(array) {\n return (array && array.length) ? baseUniq(array) : [];\n }\n\n /**\n * This method is like `_.uniq` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * uniqueness is computed. The order of result values is determined by the\n * order they occur in the array. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniqBy([2.1, 1.2, 2.3], Math.floor);\n * // => [2.1, 1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }, { 'x': 2 }]\n */\n function uniqBy(array, iteratee) {\n return (array && array.length) ? baseUniq(array, getIteratee(iteratee, 2)) : [];\n }\n\n /**\n * This method is like `_.uniq` except that it accepts `comparator` which\n * is invoked to compare elements of `array`. The order of result values is\n * determined by the order they occur in the array.The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.uniqWith(objects, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]\n */\n function uniqWith(array, comparator) {\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return (array && array.length) ? baseUniq(array, undefined, comparator) : [];\n }\n\n /**\n * This method is like `_.zip` except that it accepts an array of grouped\n * elements and creates an array regrouping the elements to their pre-zip\n * configuration.\n *\n * @static\n * @memberOf _\n * @since 1.2.0\n * @category Array\n * @param {Array} array The array of grouped elements to process.\n * @returns {Array} Returns the new array of regrouped elements.\n * @example\n *\n * var zipped = _.zip(['a', 'b'], [1, 2], [true, false]);\n * // => [['a', 1, true], ['b', 2, false]]\n *\n * _.unzip(zipped);\n * // => [['a', 'b'], [1, 2], [true, false]]\n */\n function unzip(array) {\n if (!(array && array.length)) {\n return [];\n }\n var length = 0;\n array = arrayFilter(array, function(group) {\n if (isArrayLikeObject(group)) {\n length = nativeMax(group.length, length);\n return true;\n }\n });\n return baseTimes(length, function(index) {\n return arrayMap(array, baseProperty(index));\n });\n }\n\n /**\n * This method is like `_.unzip` except that it accepts `iteratee` to specify\n * how regrouped values should be combined. The iteratee is invoked with the\n * elements of each group: (...group).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Array\n * @param {Array} array The array of grouped elements to process.\n * @param {Function} [iteratee=_.identity] The function to combine\n * regrouped values.\n * @returns {Array} Returns the new array of regrouped elements.\n * @example\n *\n * var zipped = _.zip([1, 2], [10, 20], [100, 200]);\n * // => [[1, 10, 100], [2, 20, 200]]\n *\n * _.unzipWith(zipped, _.add);\n * // => [3, 30, 300]\n */\n function unzipWith(array, iteratee) {\n if (!(array && array.length)) {\n return [];\n }\n var result = unzip(array);\n if (iteratee == null) {\n return result;\n }\n return arrayMap(result, function(group) {\n return apply(iteratee, undefined, group);\n });\n }\n\n /**\n * Creates an array excluding all given values using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * **Note:** Unlike `_.pull`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...*} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.difference, _.xor\n * @example\n *\n * _.without([2, 1, 2, 3], 1, 2);\n * // => [3]\n */\n var without = baseRest(function(array, values) {\n return isArrayLikeObject(array)\n ? baseDifference(array, values)\n : [];\n });\n\n /**\n * Creates an array of unique values that is the\n * [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)\n * of the given arrays. The order of result values is determined by the order\n * they occur in the arrays.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.difference, _.without\n * @example\n *\n * _.xor([2, 1], [2, 3]);\n * // => [1, 3]\n */\n var xor = baseRest(function(arrays) {\n return baseXor(arrayFilter(arrays, isArrayLikeObject));\n });\n\n /**\n * This method is like `_.xor` except that it accepts `iteratee` which is\n * invoked for each element of each `arrays` to generate the criterion by\n * which by which they're compared. The order of result values is determined\n * by the order they occur in the arrays. The iteratee is invoked with one\n * argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.xorBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [1.2, 3.4]\n *\n * // The `_.property` iteratee shorthand.\n * _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 2 }]\n */\n var xorBy = baseRest(function(arrays) {\n var iteratee = last(arrays);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return baseXor(arrayFilter(arrays, isArrayLikeObject), getIteratee(iteratee, 2));\n });\n\n /**\n * This method is like `_.xor` except that it accepts `comparator` which is\n * invoked to compare elements of `arrays`. The order of result values is\n * determined by the order they occur in the arrays. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.xorWith(objects, others, _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\n var xorWith = baseRest(function(arrays) {\n var comparator = last(arrays);\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);\n });\n\n /**\n * Creates an array of grouped elements, the first of which contains the\n * first elements of the given arrays, the second of which contains the\n * second elements of the given arrays, and so on.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to process.\n * @returns {Array} Returns the new array of grouped elements.\n * @example\n *\n * _.zip(['a', 'b'], [1, 2], [true, false]);\n * // => [['a', 1, true], ['b', 2, false]]\n */\n var zip = baseRest(unzip);\n\n /**\n * This method is like `_.fromPairs` except that it accepts two arrays,\n * one of property identifiers and one of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 0.4.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObject(['a', 'b'], [1, 2]);\n * // => { 'a': 1, 'b': 2 }\n */\n function zipObject(props, values) {\n return baseZipObject(props || [], values || [], assignValue);\n }\n\n /**\n * This method is like `_.zipObject` except that it supports property paths.\n *\n * @static\n * @memberOf _\n * @since 4.1.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]);\n * // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } }\n */\n function zipObjectDeep(props, values) {\n return baseZipObject(props || [], values || [], baseSet);\n }\n\n /**\n * This method is like `_.zip` except that it accepts `iteratee` to specify\n * how grouped values should be combined. The iteratee is invoked with the\n * elements of each group: (...group).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Array\n * @param {...Array} [arrays] The arrays to process.\n * @param {Function} [iteratee=_.identity] The function to combine\n * grouped values.\n * @returns {Array} Returns the new array of grouped elements.\n * @example\n *\n * _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) {\n * return a + b + c;\n * });\n * // => [111, 222]\n */\n var zipWith = baseRest(function(arrays) {\n var length = arrays.length,\n iteratee = length > 1 ? arrays[length - 1] : undefined;\n\n iteratee = typeof iteratee == 'function' ? (arrays.pop(), iteratee) : undefined;\n return unzipWith(arrays, iteratee);\n });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a `lodash` wrapper instance that wraps `value` with explicit method\n * chain sequences enabled. The result of such sequences must be unwrapped\n * with `_#value`.\n *\n * @static\n * @memberOf _\n * @since 1.3.0\n * @category Seq\n * @param {*} value The value to wrap.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 40 },\n * { 'user': 'pebbles', 'age': 1 }\n * ];\n *\n * var youngest = _\n * .chain(users)\n * .sortBy('age')\n * .map(function(o) {\n * return o.user + ' is ' + o.age;\n * })\n * .head()\n * .value();\n * // => 'pebbles is 1'\n */\n function chain(value) {\n var result = lodash(value);\n result.__chain__ = true;\n return result;\n }\n\n /**\n * This method invokes `interceptor` and returns `value`. The interceptor\n * is invoked with one argument; (value). The purpose of this method is to\n * \"tap into\" a method chain sequence in order to modify intermediate results.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @param {*} value The value to provide to `interceptor`.\n * @param {Function} interceptor The function to invoke.\n * @returns {*} Returns `value`.\n * @example\n *\n * _([1, 2, 3])\n * .tap(function(array) {\n * // Mutate input array.\n * array.pop();\n * })\n * .reverse()\n * .value();\n * // => [2, 1]\n */\n function tap(value, interceptor) {\n interceptor(value);\n return value;\n }\n\n /**\n * This method is like `_.tap` except that it returns the result of `interceptor`.\n * The purpose of this method is to \"pass thru\" values replacing intermediate\n * results in a method chain sequence.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Seq\n * @param {*} value The value to provide to `interceptor`.\n * @param {Function} interceptor The function to invoke.\n * @returns {*} Returns the result of `interceptor`.\n * @example\n *\n * _(' abc ')\n * .chain()\n * .trim()\n * .thru(function(value) {\n * return [value];\n * })\n * .value();\n * // => ['abc']\n */\n function thru(value, interceptor) {\n return interceptor(value);\n }\n\n /**\n * This method is the wrapper version of `_.at`.\n *\n * @name at\n * @memberOf _\n * @since 1.0.0\n * @category Seq\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n *\n * _(object).at(['a[0].b.c', 'a[1]']).value();\n * // => [3, 4]\n */\n var wrapperAt = flatRest(function(paths) {\n var length = paths.length,\n start = length ? paths[0] : 0,\n value = this.__wrapped__,\n interceptor = function(object) { return baseAt(object, paths); };\n\n if (length > 1 || this.__actions__.length ||\n !(value instanceof LazyWrapper) || !isIndex(start)) {\n return this.thru(interceptor);\n }\n value = value.slice(start, +start + (length ? 1 : 0));\n value.__actions__.push({\n 'func': thru,\n 'args': [interceptor],\n 'thisArg': undefined\n });\n return new LodashWrapper(value, this.__chain__).thru(function(array) {\n if (length && !array.length) {\n array.push(undefined);\n }\n return array;\n });\n });\n\n /**\n * Creates a `lodash` wrapper instance with explicit method chain sequences enabled.\n *\n * @name chain\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 40 }\n * ];\n *\n * // A sequence without explicit chaining.\n * _(users).head();\n * // => { 'user': 'barney', 'age': 36 }\n *\n * // A sequence with explicit chaining.\n * _(users)\n * .chain()\n * .head()\n * .pick('user')\n * .value();\n * // => { 'user': 'barney' }\n */\n function wrapperChain() {\n return chain(this);\n }\n\n /**\n * Executes the chain sequence and returns the wrapped result.\n *\n * @name commit\n * @memberOf _\n * @since 3.2.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var array = [1, 2];\n * var wrapped = _(array).push(3);\n *\n * console.log(array);\n * // => [1, 2]\n *\n * wrapped = wrapped.commit();\n * console.log(array);\n * // => [1, 2, 3]\n *\n * wrapped.last();\n * // => 3\n *\n * console.log(array);\n * // => [1, 2, 3]\n */\n function wrapperCommit() {\n return new LodashWrapper(this.value(), this.__chain__);\n }\n\n /**\n * Gets the next value on a wrapped object following the\n * [iterator protocol](https://mdn.io/iteration_protocols#iterator).\n *\n * @name next\n * @memberOf _\n * @since 4.0.0\n * @category Seq\n * @returns {Object} Returns the next iterator value.\n * @example\n *\n * var wrapped = _([1, 2]);\n *\n * wrapped.next();\n * // => { 'done': false, 'value': 1 }\n *\n * wrapped.next();\n * // => { 'done': false, 'value': 2 }\n *\n * wrapped.next();\n * // => { 'done': true, 'value': undefined }\n */\n function wrapperNext() {\n if (this.__values__ === undefined) {\n this.__values__ = toArray(this.value());\n }\n var done = this.__index__ >= this.__values__.length,\n value = done ? undefined : this.__values__[this.__index__++];\n\n return { 'done': done, 'value': value };\n }\n\n /**\n * Enables the wrapper to be iterable.\n *\n * @name Symbol.iterator\n * @memberOf _\n * @since 4.0.0\n * @category Seq\n * @returns {Object} Returns the wrapper object.\n * @example\n *\n * var wrapped = _([1, 2]);\n *\n * wrapped[Symbol.iterator]() === wrapped;\n * // => true\n *\n * Array.from(wrapped);\n * // => [1, 2]\n */\n function wrapperToIterator() {\n return this;\n }\n\n /**\n * Creates a clone of the chain sequence planting `value` as the wrapped value.\n *\n * @name plant\n * @memberOf _\n * @since 3.2.0\n * @category Seq\n * @param {*} value The value to plant.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var wrapped = _([1, 2]).map(square);\n * var other = wrapped.plant([3, 4]);\n *\n * other.value();\n * // => [9, 16]\n *\n * wrapped.value();\n * // => [1, 4]\n */\n function wrapperPlant(value) {\n var result,\n parent = this;\n\n while (parent instanceof baseLodash) {\n var clone = wrapperClone(parent);\n clone.__index__ = 0;\n clone.__values__ = undefined;\n if (result) {\n previous.__wrapped__ = clone;\n } else {\n result = clone;\n }\n var previous = clone;\n parent = parent.__wrapped__;\n }\n previous.__wrapped__ = value;\n return result;\n }\n\n /**\n * This method is the wrapper version of `_.reverse`.\n *\n * **Note:** This method mutates the wrapped array.\n *\n * @name reverse\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _(array).reverse().value()\n * // => [3, 2, 1]\n *\n * console.log(array);\n * // => [3, 2, 1]\n */\n function wrapperReverse() {\n var value = this.__wrapped__;\n if (value instanceof LazyWrapper) {\n var wrapped = value;\n if (this.__actions__.length) {\n wrapped = new LazyWrapper(this);\n }\n wrapped = wrapped.reverse();\n wrapped.__actions__.push({\n 'func': thru,\n 'args': [reverse],\n 'thisArg': undefined\n });\n return new LodashWrapper(wrapped, this.__chain__);\n }\n return this.thru(reverse);\n }\n\n /**\n * Executes the chain sequence to resolve the unwrapped value.\n *\n * @name value\n * @memberOf _\n * @since 0.1.0\n * @alias toJSON, valueOf\n * @category Seq\n * @returns {*} Returns the resolved unwrapped value.\n * @example\n *\n * _([1, 2, 3]).value();\n * // => [1, 2, 3]\n */\n function wrapperValue() {\n return baseWrapperValue(this.__wrapped__, this.__actions__);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The corresponding value of\n * each key is the number of times the key was returned by `iteratee`. The\n * iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * _.countBy([6.1, 4.2, 6.3], Math.floor);\n * // => { '4': 1, '6': 2 }\n *\n * // The `_.property` iteratee shorthand.\n * _.countBy(['one', 'two', 'three'], 'length');\n * // => { '3': 2, '5': 1 }\n */\n var countBy = createAggregator(function(result, value, key) {\n if (hasOwnProperty.call(result, key)) {\n ++result[key];\n } else {\n baseAssignValue(result, key, 1);\n }\n });\n\n /**\n * Checks if `predicate` returns truthy for **all** elements of `collection`.\n * Iteration is stopped once `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index|key, collection).\n *\n * **Note:** This method returns `true` for\n * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because\n * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of\n * elements of empty collections.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`.\n * @example\n *\n * _.every([true, 1, null, 'yes'], Boolean);\n * // => false\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.every(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.every(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.every(users, 'active');\n * // => false\n */\n function every(collection, predicate, guard) {\n var func = isArray(collection) ? arrayEvery : baseEvery;\n if (guard && isIterateeCall(collection, predicate, guard)) {\n predicate = undefined;\n }\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Iterates over elements of `collection`, returning an array of all elements\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * **Note:** Unlike `_.remove`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.reject\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n *\n * _.filter(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.filter(users, { 'age': 36, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.filter(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.filter(users, 'active');\n * // => objects for ['barney']\n *\n * // Combining several predicates using `_.overEvery` or `_.overSome`.\n * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));\n * // => objects for ['fred', 'barney']\n */\n function filter(collection, predicate) {\n var func = isArray(collection) ? arrayFilter : baseFilter;\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Iterates over elements of `collection`, returning the first element\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false },\n * { 'user': 'pebbles', 'age': 1, 'active': true }\n * ];\n *\n * _.find(users, function(o) { return o.age < 40; });\n * // => object for 'barney'\n *\n * // The `_.matches` iteratee shorthand.\n * _.find(users, { 'age': 1, 'active': true });\n * // => object for 'pebbles'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.find(users, ['active', false]);\n * // => object for 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.find(users, 'active');\n * // => object for 'barney'\n */\n var find = createFind(findIndex);\n\n /**\n * This method is like `_.find` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=collection.length-1] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * _.findLast([1, 2, 3, 4], function(n) {\n * return n % 2 == 1;\n * });\n * // => 3\n */\n var findLast = createFind(findLastIndex);\n\n /**\n * Creates a flattened array of values by running each element in `collection`\n * thru `iteratee` and flattening the mapped results. The iteratee is invoked\n * with three arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [n, n];\n * }\n *\n * _.flatMap([1, 2], duplicate);\n * // => [1, 1, 2, 2]\n */\n function flatMap(collection, iteratee) {\n return baseFlatten(map(collection, iteratee), 1);\n }\n\n /**\n * This method is like `_.flatMap` except that it recursively flattens the\n * mapped results.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [[[n, n]]];\n * }\n *\n * _.flatMapDeep([1, 2], duplicate);\n * // => [1, 1, 2, 2]\n */\n function flatMapDeep(collection, iteratee) {\n return baseFlatten(map(collection, iteratee), INFINITY);\n }\n\n /**\n * This method is like `_.flatMap` except that it recursively flattens the\n * mapped results up to `depth` times.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {number} [depth=1] The maximum recursion depth.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [[[n, n]]];\n * }\n *\n * _.flatMapDepth([1, 2], duplicate, 2);\n * // => [[1, 1], [2, 2]]\n */\n function flatMapDepth(collection, iteratee, depth) {\n depth = depth === undefined ? 1 : toInteger(depth);\n return baseFlatten(map(collection, iteratee), depth);\n }\n\n /**\n * Iterates over elements of `collection` and invokes `iteratee` for each element.\n * The iteratee is invoked with three arguments: (value, index|key, collection).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * **Note:** As with other \"Collections\" methods, objects with a \"length\"\n * property are iterated like arrays. To avoid this behavior use `_.forIn`\n * or `_.forOwn` for object iteration.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias each\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEachRight\n * @example\n *\n * _.forEach([1, 2], function(value) {\n * console.log(value);\n * });\n * // => Logs `1` then `2`.\n *\n * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\n function forEach(collection, iteratee) {\n var func = isArray(collection) ? arrayEach : baseEach;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.forEach` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @alias eachRight\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEach\n * @example\n *\n * _.forEachRight([1, 2], function(value) {\n * console.log(value);\n * });\n * // => Logs `2` then `1`.\n */\n function forEachRight(collection, iteratee) {\n var func = isArray(collection) ? arrayEachRight : baseEachRight;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The order of grouped values\n * is determined by the order they occur in `collection`. The corresponding\n * value of each key is an array of elements responsible for generating the\n * key. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * _.groupBy([6.1, 4.2, 6.3], Math.floor);\n * // => { '4': [4.2], '6': [6.1, 6.3] }\n *\n * // The `_.property` iteratee shorthand.\n * _.groupBy(['one', 'two', 'three'], 'length');\n * // => { '3': ['one', 'two'], '5': ['three'] }\n */\n var groupBy = createAggregator(function(result, value, key) {\n if (hasOwnProperty.call(result, key)) {\n result[key].push(value);\n } else {\n baseAssignValue(result, key, [value]);\n }\n });\n\n /**\n * Checks if `value` is in `collection`. If `collection` is a string, it's\n * checked for a substring of `value`, otherwise\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * is used for equality comparisons. If `fromIndex` is negative, it's used as\n * the offset from the end of `collection`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {boolean} Returns `true` if `value` is found, else `false`.\n * @example\n *\n * _.includes([1, 2, 3], 1);\n * // => true\n *\n * _.includes([1, 2, 3], 1, 2);\n * // => false\n *\n * _.includes({ 'a': 1, 'b': 2 }, 1);\n * // => true\n *\n * _.includes('abcd', 'bc');\n * // => true\n */\n function includes(collection, value, fromIndex, guard) {\n collection = isArrayLike(collection) ? collection : values(collection);\n fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;\n\n var length = collection.length;\n if (fromIndex < 0) {\n fromIndex = nativeMax(length + fromIndex, 0);\n }\n return isString(collection)\n ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)\n : (!!length && baseIndexOf(collection, value, fromIndex) > -1);\n }\n\n /**\n * Invokes the method at `path` of each element in `collection`, returning\n * an array of the results of each invoked method. Any additional arguments\n * are provided to each invoked method. If `path` is a function, it's invoked\n * for, and `this` bound to, each element in `collection`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Array|Function|string} path The path of the method to invoke or\n * the function invoked per iteration.\n * @param {...*} [args] The arguments to invoke each method with.\n * @returns {Array} Returns the array of results.\n * @example\n *\n * _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort');\n * // => [[1, 5, 7], [1, 2, 3]]\n *\n * _.invokeMap([123, 456], String.prototype.split, '');\n * // => [['1', '2', '3'], ['4', '5', '6']]\n */\n var invokeMap = baseRest(function(collection, path, args) {\n var index = -1,\n isFunc = typeof path == 'function',\n result = isArrayLike(collection) ? Array(collection.length) : [];\n\n baseEach(collection, function(value) {\n result[++index] = isFunc ? apply(path, value, args) : baseInvoke(value, path, args);\n });\n return result;\n });\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The corresponding value of\n * each key is the last element responsible for generating the key. The\n * iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * var array = [\n * { 'dir': 'left', 'code': 97 },\n * { 'dir': 'right', 'code': 100 }\n * ];\n *\n * _.keyBy(array, function(o) {\n * return String.fromCharCode(o.code);\n * });\n * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }\n *\n * _.keyBy(array, 'dir');\n * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }\n */\n var keyBy = createAggregator(function(result, value, key) {\n baseAssignValue(result, key, value);\n });\n\n /**\n * Creates an array of values by running each element in `collection` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n *\n * The guarded methods are:\n * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * _.map([4, 8], square);\n * // => [16, 64]\n *\n * _.map({ 'a': 4, 'b': 8 }, square);\n * // => [16, 64] (iteration order is not guaranteed)\n *\n * var users = [\n * { 'user': 'barney' },\n * { 'user': 'fred' }\n * ];\n *\n * // The `_.property` iteratee shorthand.\n * _.map(users, 'user');\n * // => ['barney', 'fred']\n */\n function map(collection, iteratee) {\n var func = isArray(collection) ? arrayMap : baseMap;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.sortBy` except that it allows specifying the sort\n * orders of the iteratees to sort by. If `orders` is unspecified, all values\n * are sorted in ascending order. Otherwise, specify an order of \"desc\" for\n * descending or \"asc\" for ascending sort order of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]]\n * The iteratees to sort by.\n * @param {string[]} [orders] The sort orders of `iteratees`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n * { 'user': 'fred', 'age': 48 },\n * { 'user': 'barney', 'age': 34 },\n * { 'user': 'fred', 'age': 40 },\n * { 'user': 'barney', 'age': 36 }\n * ];\n *\n * // Sort by `user` in ascending order and by `age` in descending order.\n * _.orderBy(users, ['user', 'age'], ['asc', 'desc']);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]\n */\n function orderBy(collection, iteratees, orders, guard) {\n if (collection == null) {\n return [];\n }\n if (!isArray(iteratees)) {\n iteratees = iteratees == null ? [] : [iteratees];\n }\n orders = guard ? undefined : orders;\n if (!isArray(orders)) {\n orders = orders == null ? [] : [orders];\n }\n return baseOrderBy(collection, iteratees, orders);\n }\n\n /**\n * Creates an array of elements split into two groups, the first of which\n * contains elements `predicate` returns truthy for, the second of which\n * contains elements `predicate` returns falsey for. The predicate is\n * invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the array of grouped elements.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': true },\n * { 'user': 'pebbles', 'age': 1, 'active': false }\n * ];\n *\n * _.partition(users, function(o) { return o.active; });\n * // => objects for [['fred'], ['barney', 'pebbles']]\n *\n * // The `_.matches` iteratee shorthand.\n * _.partition(users, { 'age': 1, 'active': false });\n * // => objects for [['pebbles'], ['barney', 'fred']]\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.partition(users, ['active', false]);\n * // => objects for [['barney', 'pebbles'], ['fred']]\n *\n * // The `_.property` iteratee shorthand.\n * _.partition(users, 'active');\n * // => objects for [['fred'], ['barney', 'pebbles']]\n */\n var partition = createAggregator(function(result, value, key) {\n result[key ? 0 : 1].push(value);\n }, function() { return [[], []]; });\n\n /**\n * Reduces `collection` to a value which is the accumulated result of running\n * each element in `collection` thru `iteratee`, where each successive\n * invocation is supplied the return value of the previous. If `accumulator`\n * is not given, the first element of `collection` is used as the initial\n * value. The iteratee is invoked with four arguments:\n * (accumulator, value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.reduce`, `_.reduceRight`, and `_.transform`.\n *\n * The guarded methods are:\n * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n * and `sortBy`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduceRight\n * @example\n *\n * _.reduce([1, 2], function(sum, n) {\n * return sum + n;\n * }, 0);\n * // => 3\n *\n * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n * (result[value] || (result[value] = [])).push(key);\n * return result;\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n */\n function reduce(collection, iteratee, accumulator) {\n var func = isArray(collection) ? arrayReduce : baseReduce,\n initAccum = arguments.length < 3;\n\n return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n }\n\n /**\n * This method is like `_.reduce` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduce\n * @example\n *\n * var array = [[0, 1], [2, 3], [4, 5]];\n *\n * _.reduceRight(array, function(flattened, other) {\n * return flattened.concat(other);\n * }, []);\n * // => [4, 5, 2, 3, 0, 1]\n */\n function reduceRight(collection, iteratee, accumulator) {\n var func = isArray(collection) ? arrayReduceRight : baseReduce,\n initAccum = arguments.length < 3;\n\n return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEachRight);\n }\n\n /**\n * The opposite of `_.filter`; this method returns the elements of `collection`\n * that `predicate` does **not** return truthy for.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.filter\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': true }\n * ];\n *\n * _.reject(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.reject(users, { 'age': 40, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.reject(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.reject(users, 'active');\n * // => objects for ['barney']\n */\n function reject(collection, predicate) {\n var func = isArray(collection) ? arrayFilter : baseFilter;\n return func(collection, negate(getIteratee(predicate, 3)));\n }\n\n /**\n * Gets a random element from `collection`.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to sample.\n * @returns {*} Returns the random element.\n * @example\n *\n * _.sample([1, 2, 3, 4]);\n * // => 2\n */\n function sample(collection) {\n var func = isArray(collection) ? arraySample : baseSample;\n return func(collection);\n }\n\n /**\n * Gets `n` random elements at unique keys from `collection` up to the\n * size of `collection`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to sample.\n * @param {number} [n=1] The number of elements to sample.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the random elements.\n * @example\n *\n * _.sampleSize([1, 2, 3], 2);\n * // => [3, 1]\n *\n * _.sampleSize([1, 2, 3], 4);\n * // => [2, 3, 1]\n */\n function sampleSize(collection, n, guard) {\n if ((guard ? isIterateeCall(collection, n, guard) : n === undefined)) {\n n = 1;\n } else {\n n = toInteger(n);\n }\n var func = isArray(collection) ? arraySampleSize : baseSampleSize;\n return func(collection, n);\n }\n\n /**\n * Creates an array of shuffled values, using a version of the\n * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to shuffle.\n * @returns {Array} Returns the new shuffled array.\n * @example\n *\n * _.shuffle([1, 2, 3, 4]);\n * // => [4, 1, 3, 2]\n */\n function shuffle(collection) {\n var func = isArray(collection) ? arrayShuffle : baseShuffle;\n return func(collection);\n }\n\n /**\n * Gets the size of `collection` by returning its length for array-like\n * values or the number of own enumerable string keyed properties for objects.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @returns {number} Returns the collection size.\n * @example\n *\n * _.size([1, 2, 3]);\n * // => 3\n *\n * _.size({ 'a': 1, 'b': 2 });\n * // => 2\n *\n * _.size('pebbles');\n * // => 7\n */\n function size(collection) {\n if (collection == null) {\n return 0;\n }\n if (isArrayLike(collection)) {\n return isString(collection) ? stringSize(collection) : collection.length;\n }\n var tag = getTag(collection);\n if (tag == mapTag || tag == setTag) {\n return collection.size;\n }\n return baseKeys(collection).length;\n }\n\n /**\n * Checks if `predicate` returns truthy for **any** element of `collection`.\n * Iteration is stopped once `predicate` returns truthy. The predicate is\n * invoked with three arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n * @example\n *\n * _.some([null, 0, 'yes', false], Boolean);\n * // => true\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.some(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.some(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.some(users, 'active');\n * // => true\n */\n function some(collection, predicate, guard) {\n var func = isArray(collection) ? arraySome : baseSome;\n if (guard && isIterateeCall(collection, predicate, guard)) {\n predicate = undefined;\n }\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Creates an array of elements, sorted in ascending order by the results of\n * running each element in a collection thru each iteratee. This method\n * performs a stable sort, that is, it preserves the original sort order of\n * equal elements. The iteratees are invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {...(Function|Function[])} [iteratees=[_.identity]]\n * The iteratees to sort by.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n * { 'user': 'fred', 'age': 48 },\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 30 },\n * { 'user': 'barney', 'age': 34 }\n * ];\n *\n * _.sortBy(users, [function(o) { return o.user; }]);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]\n *\n * _.sortBy(users, ['user', 'age']);\n * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]\n */\n var sortBy = baseRest(function(collection, iteratees) {\n if (collection == null) {\n return [];\n }\n var length = iteratees.length;\n if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {\n iteratees = [];\n } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {\n iteratees = [iteratees[0]];\n }\n return baseOrderBy(collection, baseFlatten(iteratees, 1), []);\n });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n * console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\n var now = ctxNow || function() {\n return root.Date.now();\n };\n\n /*------------------------------------------------------------------------*/\n\n /**\n * The opposite of `_.before`; this method creates a function that invokes\n * `func` once it's called `n` or more times.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {number} n The number of calls before `func` is invoked.\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * var saves = ['profile', 'settings'];\n *\n * var done = _.after(saves.length, function() {\n * console.log('done saving!');\n * });\n *\n * _.forEach(saves, function(type) {\n * asyncSave({ 'type': type, 'complete': done });\n * });\n * // => Logs 'done saving!' after the two async saves have completed.\n */\n function after(n, func) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n n = toInteger(n);\n return function() {\n if (--n < 1) {\n return func.apply(this, arguments);\n }\n };\n }\n\n /**\n * Creates a function that invokes `func`, with up to `n` arguments,\n * ignoring any additional arguments.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to cap arguments for.\n * @param {number} [n=func.length] The arity cap.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new capped function.\n * @example\n *\n * _.map(['6', '8', '10'], _.ary(parseInt, 1));\n * // => [6, 8, 10]\n */\n function ary(func, n, guard) {\n n = guard ? undefined : n;\n n = (func && n == null) ? func.length : n;\n return createWrap(func, WRAP_ARY_FLAG, undefined, undefined, undefined, undefined, n);\n }\n\n /**\n * Creates a function that invokes `func`, with the `this` binding and arguments\n * of the created function, while it's called less than `n` times. Subsequent\n * calls to the created function return the result of the last `func` invocation.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {number} n The number of calls at which `func` is no longer invoked.\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * jQuery(element).on('click', _.before(5, addContactToList));\n * // => Allows adding up to 4 contacts to the list.\n */\n function before(n, func) {\n var result;\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n n = toInteger(n);\n return function() {\n if (--n > 0) {\n result = func.apply(this, arguments);\n }\n if (n <= 1) {\n func = undefined;\n }\n return result;\n };\n }\n\n /**\n * Creates a function that invokes `func` with the `this` binding of `thisArg`\n * and `partials` prepended to the arguments it receives.\n *\n * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds,\n * may be used as a placeholder for partially applied arguments.\n *\n * **Note:** Unlike native `Function#bind`, this method doesn't set the \"length\"\n * property of bound functions.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to bind.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new bound function.\n * @example\n *\n * function greet(greeting, punctuation) {\n * return greeting + ' ' + this.user + punctuation;\n * }\n *\n * var object = { 'user': 'fred' };\n *\n * var bound = _.bind(greet, object, 'hi');\n * bound('!');\n * // => 'hi fred!'\n *\n * // Bound with placeholders.\n * var bound = _.bind(greet, object, _, '!');\n * bound('hi');\n * // => 'hi fred!'\n */\n var bind = baseRest(function(func, thisArg, partials) {\n var bitmask = WRAP_BIND_FLAG;\n if (partials.length) {\n var holders = replaceHolders(partials, getHolder(bind));\n bitmask |= WRAP_PARTIAL_FLAG;\n }\n return createWrap(func, bitmask, thisArg, partials, holders);\n });\n\n /**\n * Creates a function that invokes the method at `object[key]` with `partials`\n * prepended to the arguments it receives.\n *\n * This method differs from `_.bind` by allowing bound functions to reference\n * methods that may be redefined or don't yet exist. See\n * [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)\n * for more details.\n *\n * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * @static\n * @memberOf _\n * @since 0.10.0\n * @category Function\n * @param {Object} object The object to invoke the method on.\n * @param {string} key The key of the method.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new bound function.\n * @example\n *\n * var object = {\n * 'user': 'fred',\n * 'greet': function(greeting, punctuation) {\n * return greeting + ' ' + this.user + punctuation;\n * }\n * };\n *\n * var bound = _.bindKey(object, 'greet', 'hi');\n * bound('!');\n * // => 'hi fred!'\n *\n * object.greet = function(greeting, punctuation) {\n * return greeting + 'ya ' + this.user + punctuation;\n * };\n *\n * bound('!');\n * // => 'hiya fred!'\n *\n * // Bound with placeholders.\n * var bound = _.bindKey(object, 'greet', _, '!');\n * bound('hi');\n * // => 'hiya fred!'\n */\n var bindKey = baseRest(function(object, key, partials) {\n var bitmask = WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG;\n if (partials.length) {\n var holders = replaceHolders(partials, getHolder(bindKey));\n bitmask |= WRAP_PARTIAL_FLAG;\n }\n return createWrap(key, bitmask, object, partials, holders);\n });\n\n /**\n * Creates a function that accepts arguments of `func` and either invokes\n * `func` returning its result, if at least `arity` number of arguments have\n * been provided, or returns a function that accepts the remaining `func`\n * arguments, and so on. The arity of `func` may be specified if `func.length`\n * is not sufficient.\n *\n * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds,\n * may be used as a placeholder for provided arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of curried functions.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Function\n * @param {Function} func The function to curry.\n * @param {number} [arity=func.length] The arity of `func`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new curried function.\n * @example\n *\n * var abc = function(a, b, c) {\n * return [a, b, c];\n * };\n *\n * var curried = _.curry(abc);\n *\n * curried(1)(2)(3);\n * // => [1, 2, 3]\n *\n * curried(1, 2)(3);\n * // => [1, 2, 3]\n *\n * curried(1, 2, 3);\n * // => [1, 2, 3]\n *\n * // Curried with placeholders.\n * curried(1)(_, 3)(2);\n * // => [1, 2, 3]\n */\n function curry(func, arity, guard) {\n arity = guard ? undefined : arity;\n var result = createWrap(func, WRAP_CURRY_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n result.placeholder = curry.placeholder;\n return result;\n }\n\n /**\n * This method is like `_.curry` except that arguments are applied to `func`\n * in the manner of `_.partialRight` instead of `_.partial`.\n *\n * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for provided arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of curried functions.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to curry.\n * @param {number} [arity=func.length] The arity of `func`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new curried function.\n * @example\n *\n * var abc = function(a, b, c) {\n * return [a, b, c];\n * };\n *\n * var curried = _.curryRight(abc);\n *\n * curried(3)(2)(1);\n * // => [1, 2, 3]\n *\n * curried(2, 3)(1);\n * // => [1, 2, 3]\n *\n * curried(1, 2, 3);\n * // => [1, 2, 3]\n *\n * // Curried with placeholders.\n * curried(3)(1, _)(2);\n * // => [1, 2, 3]\n */\n function curryRight(func, arity, guard) {\n arity = guard ? undefined : arity;\n var result = createWrap(func, WRAP_CURRY_RIGHT_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n result.placeholder = curryRight.placeholder;\n return result;\n }\n\n /**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n * Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n * The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n * Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n * 'leading': true,\n * 'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\n function debounce(func, wait, options) {\n var lastArgs,\n lastThis,\n maxWait,\n result,\n timerId,\n lastCallTime,\n lastInvokeTime = 0,\n leading = false,\n maxing = false,\n trailing = true;\n\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n wait = toNumber(wait) || 0;\n if (isObject(options)) {\n leading = !!options.leading;\n maxing = 'maxWait' in options;\n maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n trailing = 'trailing' in options ? !!options.trailing : trailing;\n }\n\n function invokeFunc(time) {\n var args = lastArgs,\n thisArg = lastThis;\n\n lastArgs = lastThis = undefined;\n lastInvokeTime = time;\n result = func.apply(thisArg, args);\n return result;\n }\n\n function leadingEdge(time) {\n // Reset any `maxWait` timer.\n lastInvokeTime = time;\n // Start the timer for the trailing edge.\n timerId = setTimeout(timerExpired, wait);\n // Invoke the leading edge.\n return leading ? invokeFunc(time) : result;\n }\n\n function remainingWait(time) {\n var timeSinceLastCall = time - lastCallTime,\n timeSinceLastInvoke = time - lastInvokeTime,\n timeWaiting = wait - timeSinceLastCall;\n\n return maxing\n ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n : timeWaiting;\n }\n\n function shouldInvoke(time) {\n var timeSinceLastCall = time - lastCallTime,\n timeSinceLastInvoke = time - lastInvokeTime;\n\n // Either this is the first call, activity has stopped and we're at the\n // trailing edge, the system time has gone backwards and we're treating\n // it as the trailing edge, or we've hit the `maxWait` limit.\n return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n }\n\n function timerExpired() {\n var time = now();\n if (shouldInvoke(time)) {\n return trailingEdge(time);\n }\n // Restart the timer.\n timerId = setTimeout(timerExpired, remainingWait(time));\n }\n\n function trailingEdge(time) {\n timerId = undefined;\n\n // Only invoke if we have `lastArgs` which means `func` has been\n // debounced at least once.\n if (trailing && lastArgs) {\n return invokeFunc(time);\n }\n lastArgs = lastThis = undefined;\n return result;\n }\n\n function cancel() {\n if (timerId !== undefined) {\n clearTimeout(timerId);\n }\n lastInvokeTime = 0;\n lastArgs = lastCallTime = lastThis = timerId = undefined;\n }\n\n function flush() {\n return timerId === undefined ? result : trailingEdge(now());\n }\n\n function debounced() {\n var time = now(),\n isInvoking = shouldInvoke(time);\n\n lastArgs = arguments;\n lastThis = this;\n lastCallTime = time;\n\n if (isInvoking) {\n if (timerId === undefined) {\n return leadingEdge(lastCallTime);\n }\n if (maxing) {\n // Handle invocations in a tight loop.\n clearTimeout(timerId);\n timerId = setTimeout(timerExpired, wait);\n return invokeFunc(lastCallTime);\n }\n }\n if (timerId === undefined) {\n timerId = setTimeout(timerExpired, wait);\n }\n return result;\n }\n debounced.cancel = cancel;\n debounced.flush = flush;\n return debounced;\n }\n\n /**\n * Defers invoking the `func` until the current call stack has cleared. Any\n * additional arguments are provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to defer.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {number} Returns the timer id.\n * @example\n *\n * _.defer(function(text) {\n * console.log(text);\n * }, 'deferred');\n * // => Logs 'deferred' after one millisecond.\n */\n var defer = baseRest(function(func, args) {\n return baseDelay(func, 1, args);\n });\n\n /**\n * Invokes `func` after `wait` milliseconds. Any additional arguments are\n * provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {number} Returns the timer id.\n * @example\n *\n * _.delay(function(text) {\n * console.log(text);\n * }, 1000, 'later');\n * // => Logs 'later' after one second.\n */\n var delay = baseRest(function(func, wait, args) {\n return baseDelay(func, toNumber(wait) || 0, args);\n });\n\n /**\n * Creates a function that invokes `func` with arguments reversed.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to flip arguments for.\n * @returns {Function} Returns the new flipped function.\n * @example\n *\n * var flipped = _.flip(function() {\n * return _.toArray(arguments);\n * });\n *\n * flipped('a', 'b', 'c', 'd');\n * // => ['d', 'c', 'b', 'a']\n */\n function flip(func) {\n return createWrap(func, WRAP_FLIP_FLAG);\n }\n\n /**\n * Creates a function that memoizes the result of `func`. If `resolver` is\n * provided, it determines the cache key for storing the result based on the\n * arguments provided to the memoized function. By default, the first argument\n * provided to the memoized function is used as the map cache key. The `func`\n * is invoked with the `this` binding of the memoized function.\n *\n * **Note:** The cache is exposed as the `cache` property on the memoized\n * function. Its creation may be customized by replacing the `_.memoize.Cache`\n * constructor with one whose instances implement the\n * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to have its output memoized.\n * @param {Function} [resolver] The function to resolve the cache key.\n * @returns {Function} Returns the new memoized function.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n * var other = { 'c': 3, 'd': 4 };\n *\n * var values = _.memoize(_.values);\n * values(object);\n * // => [1, 2]\n *\n * values(other);\n * // => [3, 4]\n *\n * object.a = 2;\n * values(object);\n * // => [1, 2]\n *\n * // Modify the result cache.\n * values.cache.set(object, ['a', 'b']);\n * values(object);\n * // => ['a', 'b']\n *\n * // Replace `_.memoize.Cache`.\n * _.memoize.Cache = WeakMap;\n */\n function memoize(func, resolver) {\n if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n var memoized = function() {\n var args = arguments,\n key = resolver ? resolver.apply(this, args) : args[0],\n cache = memoized.cache;\n\n if (cache.has(key)) {\n return cache.get(key);\n }\n var result = func.apply(this, args);\n memoized.cache = cache.set(key, result) || cache;\n return result;\n };\n memoized.cache = new (memoize.Cache || MapCache);\n return memoized;\n }\n\n // Expose `MapCache`.\n memoize.Cache = MapCache;\n\n /**\n * Creates a function that negates the result of the predicate `func`. The\n * `func` predicate is invoked with the `this` binding and arguments of the\n * created function.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} predicate The predicate to negate.\n * @returns {Function} Returns the new negated function.\n * @example\n *\n * function isEven(n) {\n * return n % 2 == 0;\n * }\n *\n * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));\n * // => [1, 3, 5]\n */\n function negate(predicate) {\n if (typeof predicate != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n return function() {\n var args = arguments;\n switch (args.length) {\n case 0: return !predicate.call(this);\n case 1: return !predicate.call(this, args[0]);\n case 2: return !predicate.call(this, args[0], args[1]);\n case 3: return !predicate.call(this, args[0], args[1], args[2]);\n }\n return !predicate.apply(this, args);\n };\n }\n\n /**\n * Creates a function that is restricted to invoking `func` once. Repeat calls\n * to the function return the value of the first invocation. The `func` is\n * invoked with the `this` binding and arguments of the created function.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * var initialize = _.once(createApplication);\n * initialize();\n * initialize();\n * // => `createApplication` is invoked once\n */\n function once(func) {\n return before(2, func);\n }\n\n /**\n * Creates a function that invokes `func` with its arguments transformed.\n *\n * @static\n * @since 4.0.0\n * @memberOf _\n * @category Function\n * @param {Function} func The function to wrap.\n * @param {...(Function|Function[])} [transforms=[_.identity]]\n * The argument transforms.\n * @returns {Function} Returns the new function.\n * @example\n *\n * function doubled(n) {\n * return n * 2;\n * }\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var func = _.overArgs(function(x, y) {\n * return [x, y];\n * }, [square, doubled]);\n *\n * func(9, 3);\n * // => [81, 6]\n *\n * func(10, 5);\n * // => [100, 10]\n */\n var overArgs = castRest(function(func, transforms) {\n transforms = (transforms.length == 1 && isArray(transforms[0]))\n ? arrayMap(transforms[0], baseUnary(getIteratee()))\n : arrayMap(baseFlatten(transforms, 1), baseUnary(getIteratee()));\n\n var funcsLength = transforms.length;\n return baseRest(function(args) {\n var index = -1,\n length = nativeMin(args.length, funcsLength);\n\n while (++index < length) {\n args[index] = transforms[index].call(this, args[index]);\n }\n return apply(func, this, args);\n });\n });\n\n /**\n * Creates a function that invokes `func` with `partials` prepended to the\n * arguments it receives. This method is like `_.bind` except it does **not**\n * alter the `this` binding.\n *\n * The `_.partial.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of partially\n * applied functions.\n *\n * @static\n * @memberOf _\n * @since 0.2.0\n * @category Function\n * @param {Function} func The function to partially apply arguments to.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new partially applied function.\n * @example\n *\n * function greet(greeting, name) {\n * return greeting + ' ' + name;\n * }\n *\n * var sayHelloTo = _.partial(greet, 'hello');\n * sayHelloTo('fred');\n * // => 'hello fred'\n *\n * // Partially applied with placeholders.\n * var greetFred = _.partial(greet, _, 'fred');\n * greetFred('hi');\n * // => 'hi fred'\n */\n var partial = baseRest(function(func, partials) {\n var holders = replaceHolders(partials, getHolder(partial));\n return createWrap(func, WRAP_PARTIAL_FLAG, undefined, partials, holders);\n });\n\n /**\n * This method is like `_.partial` except that partially applied arguments\n * are appended to the arguments it receives.\n *\n * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of partially\n * applied functions.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Function\n * @param {Function} func The function to partially apply arguments to.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new partially applied function.\n * @example\n *\n * function greet(greeting, name) {\n * return greeting + ' ' + name;\n * }\n *\n * var greetFred = _.partialRight(greet, 'fred');\n * greetFred('hi');\n * // => 'hi fred'\n *\n * // Partially applied with placeholders.\n * var sayHelloTo = _.partialRight(greet, 'hello', _);\n * sayHelloTo('fred');\n * // => 'hello fred'\n */\n var partialRight = baseRest(function(func, partials) {\n var holders = replaceHolders(partials, getHolder(partialRight));\n return createWrap(func, WRAP_PARTIAL_RIGHT_FLAG, undefined, partials, holders);\n });\n\n /**\n * Creates a function that invokes `func` with arguments arranged according\n * to the specified `indexes` where the argument value at the first index is\n * provided as the first argument, the argument value at the second index is\n * provided as the second argument, and so on.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to rearrange arguments for.\n * @param {...(number|number[])} indexes The arranged argument indexes.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var rearged = _.rearg(function(a, b, c) {\n * return [a, b, c];\n * }, [2, 0, 1]);\n *\n * rearged('b', 'c', 'a')\n * // => ['a', 'b', 'c']\n */\n var rearg = flatRest(function(func, indexes) {\n return createWrap(func, WRAP_REARG_FLAG, undefined, undefined, undefined, indexes);\n });\n\n /**\n * Creates a function that invokes `func` with the `this` binding of the\n * created function and arguments from `start` and beyond provided as\n * an array.\n *\n * **Note:** This method is based on the\n * [rest parameter](https://mdn.io/rest_parameters).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var say = _.rest(function(what, names) {\n * return what + ' ' + _.initial(names).join(', ') +\n * (_.size(names) > 1 ? ', & ' : '') + _.last(names);\n * });\n *\n * say('hello', 'fred', 'barney', 'pebbles');\n * // => 'hello fred, barney, & pebbles'\n */\n function rest(func, start) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n start = start === undefined ? start : toInteger(start);\n return baseRest(func, start);\n }\n\n /**\n * Creates a function that invokes `func` with the `this` binding of the\n * create function and an array of arguments much like\n * [`Function#apply`](http://www.ecma-international.org/ecma-262/7.0/#sec-function.prototype.apply).\n *\n * **Note:** This method is based on the\n * [spread operator](https://mdn.io/spread_operator).\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Function\n * @param {Function} func The function to spread arguments over.\n * @param {number} [start=0] The start position of the spread.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var say = _.spread(function(who, what) {\n * return who + ' says ' + what;\n * });\n *\n * say(['fred', 'hello']);\n * // => 'fred says hello'\n *\n * var numbers = Promise.all([\n * Promise.resolve(40),\n * Promise.resolve(36)\n * ]);\n *\n * numbers.then(_.spread(function(x, y) {\n * return x + y;\n * }));\n * // => a Promise of 76\n */\n function spread(func, start) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n start = start == null ? 0 : nativeMax(toInteger(start), 0);\n return baseRest(function(args) {\n var array = args[start],\n otherArgs = castSlice(args, 0, start);\n\n if (array) {\n arrayPush(otherArgs, array);\n }\n return apply(func, this, otherArgs);\n });\n }\n\n /**\n * Creates a throttled function that only invokes `func` at most once per\n * every `wait` milliseconds. The throttled function comes with a `cancel`\n * method to cancel delayed `func` invocations and a `flush` method to\n * immediately invoke them. Provide `options` to indicate whether `func`\n * should be invoked on the leading and/or trailing edge of the `wait`\n * timeout. The `func` is invoked with the last arguments provided to the\n * throttled function. Subsequent calls to the throttled function return the\n * result of the last `func` invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the throttled function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.throttle` and `_.debounce`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to throttle.\n * @param {number} [wait=0] The number of milliseconds to throttle invocations to.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=true]\n * Specify invoking on the leading edge of the timeout.\n * @param {boolean} [options.trailing=true]\n * Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new throttled function.\n * @example\n *\n * // Avoid excessively updating the position while scrolling.\n * jQuery(window).on('scroll', _.throttle(updatePosition, 100));\n *\n * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.\n * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });\n * jQuery(element).on('click', throttled);\n *\n * // Cancel the trailing throttled invocation.\n * jQuery(window).on('popstate', throttled.cancel);\n */\n function throttle(func, wait, options) {\n var leading = true,\n trailing = true;\n\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n if (isObject(options)) {\n leading = 'leading' in options ? !!options.leading : leading;\n trailing = 'trailing' in options ? !!options.trailing : trailing;\n }\n return debounce(func, wait, {\n 'leading': leading,\n 'maxWait': wait,\n 'trailing': trailing\n });\n }\n\n /**\n * Creates a function that accepts up to one argument, ignoring any\n * additional arguments.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n * @example\n *\n * _.map(['6', '8', '10'], _.unary(parseInt));\n * // => [6, 8, 10]\n */\n function unary(func) {\n return ary(func, 1);\n }\n\n /**\n * Creates a function that provides `value` to `wrapper` as its first\n * argument. Any additional arguments provided to the function are appended\n * to those provided to the `wrapper`. The wrapper is invoked with the `this`\n * binding of the created function.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {*} value The value to wrap.\n * @param {Function} [wrapper=identity] The wrapper function.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var p = _.wrap(_.escape, function(func, text) {\n * return '

' + func(text) + '

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

fred, barney, & pebbles

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