{"version":3,"sources":["webpack://musicWidgetsBrowser/webpack/universalModuleDefinition","webpack://musicWidgetsBrowser/webpack/bootstrap","webpack://musicWidgetsBrowser/./source/inc/Matcher/index.js","webpack://musicWidgetsBrowser/./source/inc/MidiPlayer.js","webpack://musicWidgetsBrowser/./node_modules/lodash/lodash.js","webpack://musicWidgetsBrowser/./source/inc/Matcher/navigator.js","webpack://musicWidgetsBrowser/./source/inc/MIDI/streamEx.js","webpack://musicWidgetsBrowser/./source/inc/MidiSequence.js","webpack://musicWidgetsBrowser/./source/inc/Matcher/config.js","webpack://musicWidgetsBrowser/./source/inc/MIDI/midifileEx.js","webpack://musicWidgetsBrowser/./source/inc/MIDI/stream.js","webpack://musicWidgetsBrowser/(webpack)/buildin/module.js","webpack://musicWidgetsBrowser/./node_modules/@soda/get-current-script/index.js","webpack://musicWidgetsBrowser/./source/inc/MIDI/midifile.js","webpack://musicWidgetsBrowser/./source/inc/Matcher/node.js","webpack://musicWidgetsBrowser/(webpack)/buildin/global.js","webpack://musicWidgetsBrowser/./source/inc/MidiUtils.js","webpack://musicWidgetsBrowser/./source/inc/MusicNotation.js","webpack://musicWidgetsBrowser/./source/inc/MIDI/index.js","webpack://musicWidgetsBrowser/./node_modules/@vue/cli-service/lib/commands/build/setPublicPath.js","webpack://musicWidgetsBrowser/./source/MidiAudio/base64binary.js","webpack://musicWidgetsBrowser/./source/MidiAudio/Plugin.js","webpack://musicWidgetsBrowser/./source/MidiAudio/AudioDetect.js","webpack://musicWidgetsBrowser/./source/MidiAudio/Window/DOMLoader.script.js","webpack://musicWidgetsBrowser/./source/MidiAudio/Window/DOMLoader.XMLHttp.js","webpack://musicWidgetsBrowser/./source/MidiAudio/LoadPlugin.js","webpack://musicWidgetsBrowser/./source/MidiAudio/index.js"],"names":["root","factory","exports","module","define","amd","self","this","installedModules","__webpack_require__","moduleId","i","l","modules","call","m","c","d","name","getter","o","Object","defineProperty","enumerable","get","r","Symbol","toStringTag","value","t","mode","__esModule","ns","create","key","bind","n","object","property","prototype","hasOwnProperty","p","s","Node","require","Navigator","HEART_BEAT","SIMULTANEOUS_INTERVAL","normalizeInterval","interval","Math","tanh","makeNoteSoftIndex","notes","index","softIndexFactor","Number","note","lastNote","console","assert","start","deltaSi","softIndex","isNaN","makeMatchNodes","criterion","zeroNode","zero","matches","targetList","pitchMap","pitch","targetNote","node","evaluatePrev","push","genNotationContext","notation","length","runNavigation","async","sample","onStep","navigator","resetCursor","step","next","for","log","Notation","animationDelay","Promise","resolve","requestAnimationFrame","MidiPlayer","constructor","midiData","cacheSpan","onMidi","onPlayFinish","onTurnCursor","isFinite","endTime","parseMidi","events","isPlaying","progressTime","startTime","performance","now","duration","cursorTurnDelta","tempos","dispose","timeToTicks","ticksToTime","nextFrame","currentEventIndex","findIndex","event","time","data","type","backturn","eventTime","pause","turnCursor","undefined","VERSION","LARGE_ARRAY_SIZE","CORE_ERROR_TEXT","FUNC_ERROR_TEXT","INVALID_TEMPL_VAR_ERROR_TEXT","HASH_UNDEFINED","MAX_MEMOIZE_SIZE","PLACEHOLDER","CLONE_DEEP_FLAG","CLONE_FLAT_FLAG","CLONE_SYMBOLS_FLAG","COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","WRAP_BIND_FLAG","WRAP_BIND_KEY_FLAG","WRAP_CURRY_BOUND_FLAG","WRAP_CURRY_FLAG","WRAP_CURRY_RIGHT_FLAG","WRAP_PARTIAL_FLAG","WRAP_PARTIAL_RIGHT_FLAG","WRAP_ARY_FLAG","WRAP_REARG_FLAG","WRAP_FLIP_FLAG","DEFAULT_TRUNC_LENGTH","DEFAULT_TRUNC_OMISSION","HOT_COUNT","HOT_SPAN","LAZY_FILTER_FLAG","LAZY_MAP_FLAG","LAZY_WHILE_FLAG","INFINITY","MAX_SAFE_INTEGER","MAX_INTEGER","NAN","MAX_ARRAY_LENGTH","MAX_ARRAY_INDEX","HALF_MAX_ARRAY_LENGTH","wrapFlags","argsTag","arrayTag","asyncTag","boolTag","dateTag","domExcTag","errorTag","funcTag","genTag","mapTag","numberTag","nullTag","objectTag","promiseTag","proxyTag","regexpTag","setTag","stringTag","symbolTag","undefinedTag","weakMapTag","weakSetTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","reEmptyStringLeading","reEmptyStringMiddle","reEmptyStringTrailing","reEscapedHtml","reUnescapedHtml","reHasEscapedHtml","RegExp","source","reHasUnescapedHtml","reEscape","reEvaluate","reInterpolate","reIsDeepProp","reIsPlainProp","rePropName","reRegExpChar","reHasRegExpChar","reTrimStart","reWhitespace","reWrapComment","reWrapDetails","reSplitDetails","reAsciiWord","reForbiddenIdentifierChars","reEscapeChar","reEsTemplate","reFlags","reIsBadHex","reIsBinary","reIsHostCtor","reIsOctal","reIsUint","reLatin","reNoMatch","reUnescapedString","rsAstralRange","rsComboMarksRange","reComboHalfMarksRange","rsComboSymbolsRange","rsComboRange","rsDingbatRange","rsLowerRange","rsMathOpRange","rsNonCharRange","rsPunctuationRange","rsSpaceRange","rsUpperRange","rsVarRange","rsBreakRange","rsApos","rsAstral","rsBreak","rsCombo","rsDigits","rsDingbat","rsLower","rsMisc","rsFitz","rsModifier","rsNonAstral","rsRegional","rsSurrPair","rsUpper","rsZWJ","rsMiscLower","rsMiscUpper","rsOptContrLower","rsOptContrUpper","reOptMod","rsOptVar","rsOptJoin","join","rsOrdLower","rsOrdUpper","rsSeq","rsEmoji","rsSymbol","reApos","reComboMark","reUnicode","reUnicodeWord","reHasUnicode","reHasUnicodeWord","contextProps","templateCounter","typedArrayTags","cloneableTags","deburredLetters","htmlEscapes","htmlUnescapes","stringEscapes","freeParseFloat","parseFloat","freeParseInt","parseInt","freeGlobal","global","freeSelf","Function","freeExports","nodeType","freeModule","moduleExports","freeProcess","process","nodeUtil","types","binding","e","nodeIsArrayBuffer","isArrayBuffer","nodeIsDate","isDate","nodeIsMap","isMap","nodeIsRegExp","isRegExp","nodeIsSet","isSet","nodeIsTypedArray","isTypedArray","apply","func","thisArg","args","arrayAggregator","array","setter","iteratee","accumulator","arrayEach","arrayEachRight","arrayEvery","predicate","arrayFilter","resIndex","result","arrayIncludes","baseIndexOf","arrayIncludesWith","comparator","arrayMap","Array","arrayPush","values","offset","arrayReduce","initAccum","arrayReduceRight","arraySome","asciiSize","baseProperty","asciiToArray","string","split","asciiWords","match","baseFindKey","collection","eachFunc","baseFindIndex","fromIndex","fromRight","strictIndexOf","baseIsNaN","baseIndexOfWith","baseMean","baseSum","basePropertyOf","baseReduce","baseSortBy","comparer","sort","current","baseTimes","baseToPairs","props","baseTrim","slice","trimmedEndIndex","replace","baseUnary","baseValues","cacheHas","cache","has","charsStartIndex","strSymbols","chrSymbols","charsEndIndex","countHolders","placeholder","deburrLetter","escapeHtmlChar","escapeStringChar","chr","getValue","hasUnicode","test","hasUnicodeWord","iteratorToArray","iterator","done","mapToArray","map","size","forEach","overArg","transform","arg","replaceHolders","setToArray","set","setToPairs","strictLastIndexOf","stringSize","unicodeSize","stringToArray","unicodeToArray","charAt","unescapeHtmlChar","lastIndex","unicodeWords","runInContext","context","_","defaults","pick","Date","Error","String","TypeError","arrayProto","funcProto","objectProto","coreJsData","funcToString","toString","idCounter","maskSrcKey","uid","exec","keys","IE_PROTO","nativeObjectToString","objectCtorString","oldDash","reIsNative","Buffer","Uint8Array","allocUnsafe","getPrototype","getPrototypeOf","objectCreate","propertyIsEnumerable","splice","spreadableSymbol","isConcatSpreadable","symIterator","symToStringTag","getNative","ctxClearTimeout","clearTimeout","ctxNow","ctxSetTimeout","setTimeout","nativeCeil","ceil","nativeFloor","floor","nativeGetSymbols","getOwnPropertySymbols","nativeIsBuffer","isBuffer","nativeIsFinite","nativeJoin","nativeKeys","nativeMax","max","nativeMin","min","nativeNow","nativeParseInt","nativeRandom","random","nativeReverse","reverse","DataView","Map","Set","WeakMap","nativeCreate","metaMap","realNames","dataViewCtorString","toSource","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","symbolProto","symbolValueOf","valueOf","symbolToString","lodash","isObjectLike","isArray","LazyWrapper","LodashWrapper","wrapperClone","baseCreate","proto","isObject","baseLodash","chainAll","__wrapped__","__actions__","__chain__","__index__","__values__","__dir__","__filtered__","__iteratees__","__takeCount__","__views__","lazyClone","copyArray","lazyReverse","clone","lazyValue","dir","isArr","isRight","arrLength","view","getView","end","iteratees","iterLength","takeCount","baseWrapperValue","outer","iterIndex","computed","Hash","entries","clear","entry","hashClear","__data__","hashDelete","hashGet","hashHas","hashSet","ListCache","listCacheClear","listCacheDelete","assocIndexOf","pop","listCacheGet","listCacheHas","listCacheSet","MapCache","mapCacheClear","mapCacheDelete","getMapData","mapCacheGet","mapCacheHas","mapCacheSet","SetCache","add","setCacheAdd","setCacheHas","Stack","stackClear","stackDelete","stackGet","stackHas","stackSet","pairs","arrayLikeKeys","inherited","isArg","isArguments","isBuff","isType","skipIndexes","isIndex","arraySample","baseRandom","arraySampleSize","shuffleSelf","baseClamp","arrayShuffle","assignMergeValue","eq","baseAssignValue","assignValue","objValue","baseAggregator","baseEach","baseAssign","copyObject","baseAssignIn","keysIn","baseAt","paths","skip","number","lower","upper","baseClone","bitmask","customizer","stack","isDeep","isFlat","isFull","initCloneArray","tag","getTag","isFunc","cloneBuffer","initCloneObject","copySymbolsIn","copySymbols","initCloneByTag","stacked","subValue","keysFunc","getAllKeysIn","getAllKeys","baseConforms","baseConformsTo","baseDelay","wait","baseDifference","includes","isCommon","valuesLength","valuesIndex","templateSettings","createBaseEach","baseForOwn","baseEachRight","baseForOwnRight","baseEvery","baseExtremum","isSymbol","baseFill","toInteger","toLength","baseFilter","baseFlatten","depth","isStrict","isFlattenable","baseFor","createBaseFor","baseForRight","baseFunctions","isFunction","baseGet","path","castPath","toKey","baseGetAllKeys","symbolsFunc","baseGetTag","getRawTag","objectToString","baseGt","other","baseHas","baseHasIn","baseInRange","baseIntersection","arrays","othLength","othIndex","caches","maxLength","Infinity","seen","baseInverter","baseInvoke","parent","last","baseIsArguments","baseIsArrayBuffer","baseIsDate","baseIsEqual","baseIsEqualDeep","equalFunc","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","equalArrays","equalByTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","equalObjects","baseIsMap","baseIsMatch","matchData","noCustomizer","srcValue","baseIsNative","isMasked","pattern","baseIsRegExp","baseIsSet","baseIsTypedArray","isLength","baseIteratee","identity","baseMatchesProperty","baseMatches","baseKeys","isPrototype","baseKeysIn","nativeKeysIn","isProto","baseLt","baseMap","isArrayLike","getMatchData","matchesStrictComparable","isKey","isStrictComparable","hasIn","baseMerge","srcIndex","baseMergeDeep","newValue","safeGet","mergeFunc","isTyped","isArrayLikeObject","cloneTypedArray","isPlainObject","toPlainObject","baseNth","baseOrderBy","orders","getIteratee","criteria","compareMultiple","basePick","basePickBy","baseSet","basePropertyDeep","basePullAll","indexOf","basePullAt","indexes","previous","baseUnset","baseRange","baseRepeat","baseRest","setToString","overRest","baseSample","baseSampleSize","nested","baseSetData","baseSetToString","constant","baseShuffle","baseSlice","baseSome","baseSortedIndex","retHighest","low","high","mid","baseSortedIndexBy","valIsNaN","valIsNull","valIsSymbol","valIsUndefined","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","setLow","baseSortedUniq","baseToNumber","baseToString","baseUniq","createSet","seenIndex","baseUpdate","updater","baseWhile","isDrop","actions","action","baseXor","baseZipObject","assignFunc","valsLength","castArrayLikeObject","castFunction","stringToPath","castRest","castSlice","id","buffer","copy","cloneArrayBuffer","arrayBuffer","byteLength","cloneDataView","dataView","byteOffset","cloneRegExp","regexp","cloneSymbol","symbol","typedArray","compareAscending","valIsDefined","valIsReflexive","objCriteria","othCriteria","ordersLength","order","composeArgs","partials","holders","isCurried","argsIndex","argsLength","holdersLength","leftIndex","leftLength","rangeLength","isUncurried","composeArgsRight","holdersIndex","rightIndex","rightLength","isNew","getSymbols","getSymbolsIn","createAggregator","initializer","createAssigner","assigner","sources","guard","isIterateeCall","iterable","createBind","isBind","Ctor","createCtor","wrapper","fn","arguments","createCaseFirst","methodName","trailing","createCompounder","callback","words","deburr","thisBinding","createCurry","arity","getHolder","createRecurry","createHybrid","createFind","findIndexFunc","createFlow","flatRest","funcs","prereq","thru","getFuncName","funcName","getData","isLaziable","plant","partialsRight","holdersRight","argPos","ary","isAry","isBindKey","isFlip","holdersCount","newHolders","reorder","createInverter","toIteratee","createMathOperation","operator","defaultValue","createOver","arrayFunc","createPadding","chars","charsLength","createPartial","createRange","toFinite","createRelationalOperation","toNumber","wrapFunc","isCurry","newHoldersRight","newPartials","newPartialsRight","newData","setData","setWrapToString","createRound","precision","pair","noop","createToPairs","createWrap","mergeData","customDefaultsAssignIn","customDefaultsMerge","customOmitClone","isPartial","arrStacked","othStacked","arrValue","othValue","compared","message","convert","objProps","objLength","othProps","objStacked","skipCtor","objCtor","othCtor","flatten","otherFunc","isKeyable","isOwn","unmasked","stubArray","transforms","getWrapDetails","hasPath","hasFunc","input","insertWrapDetails","details","ArrayBuffer","ctorString","isMaskable","stubFalse","memoizeCapped","memoize","srcBitmask","newBitmask","isCombo","otherArgs","oldArray","shortOut","reference","updateWrapDetails","count","lastCalled","stamp","remaining","rand","charCodeAt","quote","subString","chunk","compact","concat","difference","differenceBy","differenceWith","drop","dropRight","dropRightWhile","dropWhile","fill","findLastIndex","flattenDeep","flattenDepth","fromPairs","head","initial","intersection","mapped","intersectionBy","intersectionWith","separator","lastIndexOf","nth","pull","pullAll","pullAllBy","pullAllWith","pullAt","remove","sortedIndex","sortedIndexBy","sortedIndexOf","sortedLastIndex","sortedLastIndexBy","sortedLastIndexOf","sortedUniq","sortedUniqBy","tail","take","takeRight","takeRightWhile","takeWhile","union","unionBy","unionWith","uniq","uniqBy","uniqWith","unzip","group","unzipWith","without","xor","xorBy","xorWith","zip","zipObject","zipObjectDeep","zipWith","chain","tap","interceptor","wrapperAt","wrapperChain","wrapperCommit","wrapperNext","toArray","wrapperToIterator","wrapperPlant","wrapperReverse","wrapped","wrapperValue","countBy","every","filter","find","findLast","flatMap","flatMapDeep","flatMapDepth","forEachRight","groupBy","isString","invokeMap","keyBy","orderBy","partition","reduce","reduceRight","reject","negate","sampleSize","shuffle","some","sortBy","after","before","bindKey","curry","curryRight","debounce","options","lastArgs","lastThis","maxWait","timerId","lastCallTime","lastInvokeTime","leading","maxing","invokeFunc","leadingEdge","timerExpired","remainingWait","timeSinceLastCall","timeSinceLastInvoke","timeWaiting","shouldInvoke","trailingEdge","cancel","flush","debounced","isInvoking","defer","delay","flip","resolver","memoized","Cache","once","overArgs","funcsLength","partial","partialRight","rearg","rest","spread","throttle","unary","wrap","castArray","cloneWith","cloneDeep","cloneDeepWith","conformsTo","gt","gte","isBoolean","isElement","isEmpty","isEqual","isEqualWith","isError","isInteger","isMatch","isMatchWith","isNumber","isNative","isNull","isNil","isSafeInteger","isUndefined","isWeakMap","isWeakSet","lt","lte","sign","remainder","isBinary","toSafeInteger","assign","assignIn","assignInWith","assignWith","at","properties","propsIndex","propsLength","defaultsDeep","mergeWith","findKey","findLastKey","forIn","forInRight","forOwn","forOwnRight","functions","functionsIn","invert","invertBy","invoke","mapKeys","mapValues","merge","omit","omitBy","pickBy","prop","setWith","toPairs","toPairsIn","isArrLike","unset","update","updateWith","valuesIn","clamp","inRange","floating","temp","camelCase","word","toLowerCase","capitalize","upperFirst","endsWith","target","position","escape","escapeRegExp","kebabCase","lowerCase","lowerFirst","pad","strLength","padEnd","padStart","radix","repeat","snakeCase","limit","startCase","startsWith","template","settings","isEscaping","isEvaluating","imports","importsKeys","importsValues","interpolate","reDelimiters","evaluate","sourceURL","escapeValue","interpolateValue","esTemplateValue","evaluateValue","variable","attempt","toLower","toUpper","toUpperCase","trim","trimEnd","trimStart","truncate","omission","search","substring","newEnd","unescape","upperCase","bindAll","methodNames","cond","conforms","defaultTo","flow","flowRight","matchesProperty","method","methodOf","mixin","noConflict","nthArg","over","overEvery","overSome","propertyOf","range","rangeRight","stubObject","stubString","stubTrue","times","toPath","uniqueId","prefix","augend","addend","divide","dividend","divisor","maxBy","mean","meanBy","minBy","multiply","multiplier","multiplicand","round","subtract","minuend","subtrahend","sum","sumBy","entriesIn","extend","extendWith","each","eachRight","first","isFilter","takeName","dropName","checkIteratee","isTaker","lodashFunc","retUnwrapped","isLazy","useLazy","isHybrid","isUnwrapped","onlyLazy","chainName","commit","toJSON","Config","getCursorOffset","outOfPage","bestNode","fineCursor","breakingSI","relocationThreshold","RelocationThreshold","si","SkipDeep","prevNote","prevNode","bias","LagOffsetCost","LeadOffsetCost","prior","totalCost","priorByOffset","tick","ci","startTick","c1","c2","cursors","nullLength","nullSteps","cursor","breaking","toIndex","backPrior","n1","n2","rootSi","cursorOffset","write","str","writeInt32","fromCharCode","writeInt16","writeInt8","writeVarInt","b","getBuffer","getArrayBuffer","from","midiToSequence","midiFile","timeWarp","trackStates","beatsPerMinute","ticksPerBeat","header","tracks","nextEventIndex","ticksToNextEvent","deltaTime","getNextEvent","nextEventTrack","nextEvent","ticksToEvent","track","midiEvent","processEvents","processNext","secondsToGenerate","beatsToGenerate","subtype","microsecondsPerBeat","trimSequence","seq","status","channel","noteNumber","fixOverlapNotes","noteMap","overlapMap","swaps","leapIndex","delete","swap","ii","pre","front","back","offEvent","leapEvent","warn","tempo","CostStepAttenuation","PriorDistanceSigmoidFactor","PriorValueSigmoidFactor","SkipCost","ZeroOffsetCost","OStream","writeChunk","stream","writeEvent","text","frameByte","24","25","29","30","frameRate","hour","sec","frame","subframe","numerator","log2","denominator","metronome","thirtyseconds","scale","velocity","amount","controllerType","programNumber","headerChunk","formatType","trackChunk","ei","eof","read","readString","readInt32","readInt16","readInt8","signed","readVarInt","webpackPolyfill","deprecate","children","getCurrentScript","document","currentScript","err","pageSource","inlineScriptSourceRegExp","inlineScriptSource","ieStackRegExp","ffStackRegExp","stackDetails","scriptLocation","line","currentLocation","location","href","hash","scripts","getElementsByTagName","documentElement","outerHTML","readyState","src","innerHTML","Stream","readChunk","lastEventTypeByte","readEvent","eventTypeByte","subtypeByte","hourByte","0","pow","param1","eventType","headerStream","trackCount","timeDivision","trackStream","s_note","c_note","_prev","_totalCost","_value","cacheDirty","prev","updateCache","cost","selfCost","deep","dump","evaluatePrevCost","costCoeff","distance","abs","g","window","MIDI","trackDeltaToAbs","trackAbsToDelta","lastTick","e1","e2","sliceTrack","endTick","sliceMidi","midi","TICKS_PER_BEATS","EXCLUDE_MIDI_EVENT_SUBTYPES","encodeToMIDIData","unclosedNoteDuration","msToTicks","toDateString","containsTempo","finger","ticks","encodeToMIDI","encodeMidiFile","MidiSequence","PedalControllerTypes","64","65","66","67","fixOverlap","channelStatus","pedalStatus","pedals","channels","bars","millisecondsPerBeat","beats","barIndex","keyRange","correspondences","rawTicks","rawEvents","deltaTicks","ticksNormal","ev","deltaBeats","statusIndex","debug","pedalType","captures","fingers","meta","fields","beatInfos","info","lastInfo","beatIndex","findChordBySoftindex","radius","averageTempo","tickRange","to","endtick","span","tempo_sum","average","next_tempo_index","tempo_index","tickRangeToTimeRange","scaleTempo","factor","headTempo","parseMidiData","Base64Binary","_keyStr","decodeArrayBuffer","bytes","ab","decode","lkey1","lkey2","uarray","chr1","chr2","chr3","enc1","enc2","enc3","enc4","j","setPlugin","api","setVolume","programChange","noteOn","noteOff","chordOn","chordOff","stopAllNotes","getInput","getOutputs","plugin","output","WebMIDI","volume","send","program","chord","getInputs","connect","conf","requestMIDIAccess","then","access","outputs","outputDeviceIndex","AudioContext","webkitAudioContext","Audio","loadPlugin","WebAudio","pendingInstruments","ctx","masterVolume","audioBuffers","audioLoader","instrument","urlList","bufferList","synth","GeneralMIDI","byName","instrumentId","url","Soundfont","base64","decodeAudioData","msg","loader","nodeId","keyToNote","performanceTimeToCtx","timestamp","currentTime","empty","hasPending","when","createBufferSource","destination","createGain","gainNode","createGainNode","gain","setTargetAtTime","linearRampToValueAtTime","stop","ret","pending","oncomplete","AudioTag","note2id","channel_nid","channelInstrumentNoteIds","nid","playChannel","ni","byId","instrumentNoteId","audio","play","stopChannel","cId","idx","arr","clean","v","byCategory","list","num","substr","category","Piano","Organ","Guitar","Bass","Strings","Ensemble","Brass","Reed","Pipe","Ethnic","Percussive","mute","mono","omni","solo","pianoKeyOffset","noteToKey","A0","C8","number2key","octave","supports","canPlayThrough","mime","setAttribute","addEventListener","body","appendChild","audioDetect","canPlayType","vorbis","mpeg","getTime","setInterval","maxExecution","clearInterval","Script","loaded","loading","config","that","srcs","verify","doc","testElement","element","getNext","batchTest","addElement","script","createElement","onreadystatechange","onload","onerror","onLoad","istrue","level0","strictOrder","ID","sendRequest","fetch","res","responseText","catch","DOMLoader","USE_JAZZMIDI","instruments","soundfontUrl","apis","filetype","targetFormat","lang","webmidi","flash","soundManagerUrl","Flash","audiotag","queue","createQueue","items","onprogress","getPercent","response","addSoundfont","onComplete","webaudio","language","totalSize","getResponseHeader","total","percent","shift"],"mappings":"CAAA,SAA2CA,EAAMC,GAC1B,kBAAZC,SAA0C,kBAAXC,OACxCA,OAAOD,QAAUD,IACQ,oBAAXG,QAAyBA,OAAOC,IAC9CD,OAAO,GAAIH,GACe,kBAAZC,QACdA,QAAQ,uBAAyBD,IAEjCD,EAAK,uBAAyBC,KARhC,CASoB,qBAATK,KAAuBA,KAAOC,MAAO,WAChD,O,YCTE,IAAIC,EAAmB,GAGvB,SAASC,EAAoBC,GAG5B,GAAGF,EAAiBE,GACnB,OAAOF,EAAiBE,GAAUR,QAGnC,IAAIC,EAASK,EAAiBE,GAAY,CACzCC,EAAGD,EACHE,GAAG,EACHV,QAAS,IAUV,OANAW,EAAQH,GAAUI,KAAKX,EAAOD,QAASC,EAAQA,EAAOD,QAASO,GAG/DN,EAAOS,GAAI,EAGJT,EAAOD,QA0Df,OArDAO,EAAoBM,EAAIF,EAGxBJ,EAAoBO,EAAIR,EAGxBC,EAAoBQ,EAAI,SAASf,EAASgB,EAAMC,GAC3CV,EAAoBW,EAAElB,EAASgB,IAClCG,OAAOC,eAAepB,EAASgB,EAAM,CAAEK,YAAY,EAAMC,IAAKL,KAKhEV,EAAoBgB,EAAI,SAASvB,GACX,qBAAXwB,QAA0BA,OAAOC,aAC1CN,OAAOC,eAAepB,EAASwB,OAAOC,YAAa,CAAEC,MAAO,WAE7DP,OAAOC,eAAepB,EAAS,aAAc,CAAE0B,OAAO,KAQvDnB,EAAoBoB,EAAI,SAASD,EAAOE,GAEvC,GADU,EAAPA,IAAUF,EAAQnB,EAAoBmB,IAC/B,EAAPE,EAAU,OAAOF,EACpB,GAAW,EAAPE,GAA8B,kBAAVF,GAAsBA,GAASA,EAAMG,WAAY,OAAOH,EAChF,IAAII,EAAKX,OAAOY,OAAO,MAGvB,GAFAxB,EAAoBgB,EAAEO,GACtBX,OAAOC,eAAeU,EAAI,UAAW,CAAET,YAAY,EAAMK,MAAOA,IACtD,EAAPE,GAA4B,iBAATF,EAAmB,IAAI,IAAIM,KAAON,EAAOnB,EAAoBQ,EAAEe,EAAIE,EAAK,SAASA,GAAO,OAAON,EAAMM,IAAQC,KAAK,KAAMD,IAC9I,OAAOF,GAIRvB,EAAoB2B,EAAI,SAASjC,GAChC,IAAIgB,EAAShB,GAAUA,EAAO4B,WAC7B,WAAwB,OAAO5B,EAAO,YACtC,WAA8B,OAAOA,GAEtC,OADAM,EAAoBQ,EAAEE,EAAQ,IAAKA,GAC5BA,GAIRV,EAAoBW,EAAI,SAASiB,EAAQC,GAAY,OAAOjB,OAAOkB,UAAUC,eAAe1B,KAAKuB,EAAQC,IAGzG7B,EAAoBgC,EAAI,GAIjBhC,EAAoBA,EAAoBiC,EAAI,Q,yBCjFrD,MAAMC,EAAOC,EAAQ,QACfC,EAAYD,EAAQ,QAIpBE,EAAa,IACbC,EAAqC,IAAbD,EAGxBE,EAAoBC,GAAYC,KAAKC,KAAKF,EAAWF,GAIrDK,EAAoB,SAAUC,EAAOC,GAAO,gBAACC,EAAkB,GAAK,IACzED,EAAQE,OAAOF,GAEf,MAAMG,EAAOJ,EAAMC,GAGnB,GAAIA,EAAQ,EAAG,CACd,MAAMI,EAAWL,EAAMC,EAAQ,GAE/BK,QAAQC,OAAqB,MAAdH,EAAKI,MAAe,qBAAsBJ,GACzDE,QAAQC,OAAyB,MAAlBF,EAASG,MAAe,yBAA0BH,GAEjED,EAAKK,QAAUd,GAAmBS,EAAKI,MAAQH,EAASG,OAASN,GACjEE,EAAKM,UAAYL,EAASK,UAAYN,EAAKK,QAE3CH,QAAQC,QAAQJ,OAAOQ,MAAMP,EAAKK,SAAU,uBAAwBL,EAAKI,MAAOH,EAASG,YAGzFJ,EAAKM,UAAY,EACjBN,EAAKK,QAAU,GAKXG,EAAiB,SAAUR,EAAMS,EAAWC,EAAWxB,EAAKyB,QACjEX,EAAKY,QAAU,GAEf,MAAMC,EAAaJ,EAAUK,SAASd,EAAKe,OAC3C,GAAIF,EACH,IAAK,MAAMG,KAAcH,EAAY,CACpC,MAAMI,EAAO,IAAI/B,EAAKc,EAAMgB,GACxBN,GACHO,EAAKC,aAAaR,GAEnBV,EAAKY,QAAQO,KAAKF,KAMfG,EAAqB,SAAUC,GAAU,gBAACvB,EAAkB,GAAK,IACtE,IAAK,IAAI5C,EAAI,EAAGA,EAAImE,EAASzB,MAAM0B,SAAUpE,EAC5CyC,EAAkB0B,EAASzB,MAAO1C,EAAG,CAAC4C,qBAIlCyB,EAAgBC,eAAef,EAAWgB,EAAQC,GACvD,MAAMC,EAAY,IAAIvC,EAAUqB,EAAWgB,GAC3CE,EAAUC,aAAa,GAEvB,IAAK,IAAI1E,EAAI,EAAGA,EAAIuE,EAAO7B,MAAM0B,SAAUpE,EAAG,CAC7CyE,EAAUE,KAAK3E,GAEf,MAAM4E,QAAcJ,GAAUA,EAAOxE,EAAGyE,IACxC,GAAIG,IAAS7D,OAAO8D,IAAI,OAGvB,YAFA7B,QAAQ8B,IAAI,2BAQd,OAAOL,GAKRjF,EAAOD,QAAU,CAChB8C,oBACAI,oBACAa,iBACAY,qBACAG,gBACAnC,YACAF,S,uBCxFD,MAAM,SAAE+C,GAAa9C,EAAQ,QAKvB+C,EAAiB,IAAM,IAAIC,QAAQC,GAAWC,sBAAsBD,IAG1E,MAAME,EACLC,YAAaC,GAAU,UAACC,EAAY,IAAb,OAAkBC,EAAlB,aAA0BC,EAA1B,aAAwCC,GAAgB,IAM9E,IAAIvB,EALJvE,KAAK2F,UAAYA,EACjB3F,KAAK4F,OAASA,EACd5F,KAAK6F,aAAeA,EACpB7F,KAAK8F,aAAeA,EAInBvB,EADGmB,EAAS5C,OAASG,OAAO8C,SAASL,EAASM,SACnCN,EAEAP,EAASc,UAAUP,GAE/B1F,KAAKuE,SAAWA,EAChBvE,KAAKkG,OAAS3B,EAAS2B,OAGvBlG,KAAKmG,WAAY,EACjBnG,KAAKoG,aAAe,EACpBpG,KAAKqG,UAAYC,YAAYC,MAC7BvG,KAAKwG,SAAWjC,EAASyB,QACzBhG,KAAKyG,gBAAkB,EAEvBrD,QAAQC,OAAOkB,EAASmC,QAAUnC,EAASmC,OAAOlC,OAAQ,mDAI3DmC,UACC3G,KAAKmG,WAAY,EACjBnG,KAAKoG,aAAe,EAIrB,oBACC,OAAOpG,KAAKuE,SAASqC,YAAY5G,KAAKoG,cAIvC,kBAAmB/E,GAClBrB,KAAKoG,aAAepG,KAAKuE,SAASsC,YAAYxF,GAE1CrB,KAAK8F,cACR9F,KAAK8F,aAAa9F,KAAKoG,cAIzB,YAAY,UAACU,EAAY1B,GAAkB,IACtCpF,KAAKoG,cAAgBpG,KAAKwG,WAC7BxG,KAAKoG,aAAe,GAErB,IAAIG,EAAMD,YAAYC,MACtBvG,KAAKqG,UAAYE,EAAMvG,KAAKoG,aAE5BpG,KAAKmG,WAAY,EAEjB,IAAIY,EAAoB/G,KAAKkG,OAAOc,UAAUC,GAASA,EAAMC,MAAQX,EAAMvG,KAAKqG,WAEhF,MAAOrG,KAAKmG,UAAW,CACtB,KAAOY,EAAoB/G,KAAKkG,OAAO1B,SAAUuC,EAAmB,CACnE,MAAME,EAAQjH,KAAKkG,OAAOa,GAE1B,IAAKE,GAASA,EAAMC,KAAOlH,KAAKoG,aAAepG,KAAK2F,UACnD,MAEuB,YAApBsB,EAAME,KAAKC,MAAsBpH,KAAKqG,UAAYY,EAAMC,MAAQX,GAC/DvG,KAAK4F,QACR5F,KAAK4F,OAAOqB,EAAME,KAAMnH,KAAKqG,UAAYY,EAAMC,MAKlD,SAFMJ,KAED9G,KAAKmG,UACT,MAED,GAA6B,IAAzBnG,KAAKyG,gBAAuB,CAC/B,MAAMY,EAAWrH,KAAKyG,gBAAkB,EAKxC,GAHAzG,KAAKqG,WAAarG,KAAKyG,gBACvBzG,KAAKyG,gBAAkB,EAEnBY,EACH,KAAON,EAAoB,IAAKA,EAAmB,CAClD,MAAMO,EAAYtH,KAAKkG,OAAOa,GAAmBG,KACjD,GAAIlH,KAAKqG,UAAYiB,EAAYf,EAChC,OAKJA,EAAMD,YAAYC,MAElBvG,KAAKoG,aAAeG,EAAMvG,KAAKqG,UAE3BrG,KAAKoG,aAAepG,KAAKwG,WAC5BxG,KAAKmG,WAAY,EAEbnG,KAAK6F,cACR7F,KAAK6F,iBAMT0B,QACCvH,KAAKmG,WAAY,EAIlBqB,WAAYN,GAEPlH,KAAKmG,UACRnG,KAAKyG,iBAAmBS,EAAOlH,KAAKoG,aAEpCpG,KAAKoG,aAAec,EAEjBlH,KAAK8F,cACR9F,KAAK8F,aAAaoB,IAMrBtH,EAAOD,QAAU6F,G,wBCnIjB;;;;;;;;IAQE,WAGA,IAAIiC,EAGAC,EAAU,UAGVC,EAAmB,IAGnBC,EAAkB,kEAClBC,EAAkB,sBAClBC,EAA+B,qDAG/BC,EAAiB,4BAGjBC,EAAmB,IAGnBC,EAAc,yBAGdC,EAAkB,EAClBC,EAAkB,EAClBC,EAAqB,EAGrBC,EAAuB,EACvBC,EAAyB,EAGzBC,EAAiB,EACjBC,EAAqB,EACrBC,EAAwB,EACxBC,EAAkB,EAClBC,EAAwB,GACxBC,EAAoB,GACpBC,EAA0B,GAC1BC,EAAgB,IAChBC,EAAkB,IAClBC,EAAiB,IAGjBC,EAAuB,GACvBC,EAAyB,MAGzBC,EAAY,IACZC,EAAW,GAGXC,EAAmB,EACnBC,EAAgB,EAChBC,EAAkB,EAGlBC,EAAW,IACXC,EAAmB,iBACnBC,EAAc,sBACdC,EAAM,IAGNC,EAAmB,WACnBC,EAAkBD,EAAmB,EACrCE,EAAwBF,IAAqB,EAG7CG,EAAY,CACd,CAAC,MAAOjB,GACR,CAAC,OAAQP,GACT,CAAC,UAAWC,GACZ,CAAC,QAASE,GACV,CAAC,aAAcC,GACf,CAAC,OAAQK,GACT,CAAC,UAAWJ,GACZ,CAAC,eAAgBC,GACjB,CAAC,QAASE,IAIRiB,EAAU,qBACVC,EAAW,iBACXC,EAAW,yBACXC,EAAU,mBACVC,EAAU,gBACVC,EAAY,wBACZC,EAAW,iBACXC,EAAU,oBACVC,EAAS,6BACTC,EAAS,eACTC,GAAY,kBACZC,GAAU,gBACVC,GAAY,kBACZC,GAAa,mBACbC,GAAW,iBACXC,GAAY,kBACZC,GAAS,eACTC,GAAY,kBACZC,GAAY,kBACZC,GAAe,qBACfC,GAAa,mBACbC,GAAa,mBAEbC,GAAiB,uBACjBC,GAAc,oBACdC,GAAa,wBACbC,GAAa,wBACbC,GAAU,qBACVC,GAAW,sBACXC,GAAW,sBACXC,GAAW,sBACXC,GAAkB,6BAClBC,GAAY,uBACZC,GAAY,uBAGZC,GAAuB,iBACvBC,GAAsB,qBACtBC,GAAwB,gCAGxBC,GAAgB,4BAChBC,GAAkB,WAClBC,GAAmBC,OAAOH,GAAcI,QACxCC,GAAqBF,OAAOF,GAAgBG,QAG5CE,GAAW,mBACXC,GAAa,kBACbC,GAAgB,mBAGhBC,GAAe,mDACfC,GAAgB,QAChBC,GAAa,mGAMbC,GAAe,sBACfC,GAAkBV,OAAOS,GAAaR,QAGtCU,GAAc,OAGdC,GAAe,KAGfC,GAAgB,4CAChBC,GAAgB,oCAChBC,GAAiB,QAGjBC,GAAc,4CAYdC,GAA6B,mBAG7BC,GAAe,WAMfC,GAAe,kCAGfC,GAAU,OAGVC,GAAa,qBAGbC,GAAa,aAGbC,GAAe,8BAGfC,GAAY,cAGZC,GAAW,mBAGXC,GAAU,8CAGVC,GAAY,OAGZC,GAAoB,yBAGpBC,GAAgB,kBAChBC,GAAoB,kBACpBC,GAAwB,kBACxBC,GAAsB,kBACtBC,GAAeH,GAAoBC,GAAwBC,GAC3DE,GAAiB,kBACjBC,GAAe,4BACfC,GAAgB,uBAChBC,GAAiB,+CACjBC,GAAqB,kBACrBC,GAAe,+JACfC,GAAe,4BACfC,GAAa,iBACbC,GAAeN,GAAgBC,GAAiBC,GAAqBC,GAGrEI,GAAS,OACTC,GAAW,IAAMf,GAAgB,IACjCgB,GAAU,IAAMH,GAAe,IAC/BI,GAAU,IAAMb,GAAe,IAC/Bc,GAAW,OACXC,GAAY,IAAMd,GAAiB,IACnCe,GAAU,IAAMd,GAAe,IAC/Be,GAAS,KAAOrB,GAAgBa,GAAeK,GAAWb,GAAiBC,GAAeK,GAAe,IACzGW,GAAS,2BACTC,GAAa,MAAQN,GAAU,IAAMK,GAAS,IAC9CE,GAAc,KAAOxB,GAAgB,IACrCyB,GAAa,kCACbC,GAAa,qCACbC,GAAU,IAAMhB,GAAe,IAC/BiB,GAAQ,UAGRC,GAAc,MAAQT,GAAU,IAAMC,GAAS,IAC/CS,GAAc,MAAQH,GAAU,IAAMN,GAAS,IAC/CU,GAAkB,MAAQjB,GAAS,yBACnCkB,GAAkB,MAAQlB,GAAS,yBACnCmB,GAAWV,GAAa,IACxBW,GAAW,IAAMtB,GAAa,KAC9BuB,GAAY,MAAQP,GAAQ,MAAQ,CAACJ,GAAaC,GAAYC,IAAYU,KAAK,KAAO,IAAMF,GAAWD,GAAW,KAClHI,GAAa,mDACbC,GAAa,mDACbC,GAAQL,GAAWD,GAAWE,GAC9BK,GAAU,MAAQ,CAACrB,GAAWM,GAAYC,IAAYU,KAAK,KAAO,IAAMG,GACxEE,GAAW,MAAQ,CAACjB,GAAcP,GAAU,IAAKA,GAASQ,GAAYC,GAAYX,IAAUqB,KAAK,KAAO,IAGxGM,GAASvE,OAAO2C,GAAQ,KAMxB6B,GAAcxE,OAAO8C,GAAS,KAG9B2B,GAAYzE,OAAOmD,GAAS,MAAQA,GAAS,KAAOmB,GAAWF,GAAO,KAGtEM,GAAgB1E,OAAO,CACzBwD,GAAU,IAAMP,GAAU,IAAMW,GAAkB,MAAQ,CAACf,GAASW,GAAS,KAAKS,KAAK,KAAO,IAC9FN,GAAc,IAAME,GAAkB,MAAQ,CAAChB,GAASW,GAAUE,GAAa,KAAKO,KAAK,KAAO,IAChGT,GAAU,IAAME,GAAc,IAAME,GACpCJ,GAAU,IAAMK,GAChBM,GACAD,GACAnB,GACAsB,IACAJ,KAAK,KAAM,KAGTU,GAAe3E,OAAO,IAAMyD,GAAQ5B,GAAiBI,GAAeQ,GAAa,KAGjFmC,GAAmB,qEAGnBC,GAAe,CACjB,QAAS,SAAU,WAAY,OAAQ,QAAS,eAAgB,eAChE,WAAY,YAAa,aAAc,aAAc,MAAO,OAAQ,SACpE,UAAW,SAAU,MAAO,SAAU,SAAU,YAAa,aAC7D,oBAAqB,cAAe,cAAe,UACnD,IAAK,eAAgB,WAAY,WAAY,cAI3CC,IAAmB,EAGnBC,GAAiB,GACrBA,GAAe9F,IAAc8F,GAAe7F,IAC5C6F,GAAe5F,IAAW4F,GAAe3F,IACzC2F,GAAe1F,IAAY0F,GAAezF,IAC1CyF,GAAexF,IAAmBwF,GAAevF,IACjDuF,GAAetF,KAAa,EAC5BsF,GAAetH,GAAWsH,GAAerH,GACzCqH,GAAehG,IAAkBgG,GAAenH,GAChDmH,GAAe/F,IAAe+F,GAAelH,GAC7CkH,GAAehH,GAAYgH,GAAe/G,GAC1C+G,GAAe7G,GAAU6G,GAAe5G,IACxC4G,GAAe1G,IAAa0G,GAAevG,IAC3CuG,GAAetG,IAAUsG,GAAerG,IACxCqG,GAAelG,KAAc,EAG7B,IAAImG,GAAgB,GACpBA,GAAcvH,GAAWuH,GAActH,GACvCsH,GAAcjG,IAAkBiG,GAAchG,IAC9CgG,GAAcpH,GAAWoH,GAAcnH,GACvCmH,GAAc/F,IAAc+F,GAAc9F,IAC1C8F,GAAc7F,IAAW6F,GAAc5F,IACvC4F,GAAc3F,IAAY2F,GAAc9G,GACxC8G,GAAc7G,IAAa6G,GAAc3G,IACzC2G,GAAcxG,IAAawG,GAAcvG,IACzCuG,GAActG,IAAasG,GAAcrG,IACzCqG,GAAc1F,IAAY0F,GAAczF,IACxCyF,GAAcxF,IAAawF,GAAcvF,KAAa,EACtDuF,GAAcjH,GAAYiH,GAAchH,GACxCgH,GAAcnG,KAAc,EAG5B,IAAIoG,GAAkB,CAEpB,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IACtB,IAAQ,IAAM,IAAQ,IACtB,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IACtB,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IACnC,IAAQ,KAAM,IAAQ,KACtB,IAAQ,KAAM,IAAQ,KACtB,IAAQ,KAER,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAC1B,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACtF,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACtF,IAAU,IAAM,IAAU,IAC1B,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,KAAM,IAAU,KAC1B,IAAU,KAAM,IAAU,KAC1B,IAAU,KAAM,IAAU,KAIxBC,GAAc,CAChB,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,SACL,IAAK,SAIHC,GAAgB,CAClB,QAAS,IACT,OAAQ,IACR,OAAQ,IACR,SAAU,IACV,QAAS,KAIPC,GAAgB,CAClB,KAAM,KACN,IAAK,IACL,KAAM,IACN,KAAM,IACN,SAAU,QACV,SAAU,SAIRC,GAAiBC,WACjBC,GAAeC,SAGfC,GAA8B,iBAAVC,GAAsBA,GAAUA,EAAOnR,SAAWA,QAAUmR,EAGhFC,GAA0B,iBAARnS,MAAoBA,MAAQA,KAAKe,SAAWA,QAAUf,KAGxEN,GAAOuS,IAAcE,IAAYC,SAAS,cAATA,GAGjCC,GAA4CzS,IAAYA,EAAQ0S,UAAY1S,EAG5E2S,GAAaF,IAAgC,iBAAVxS,GAAsBA,IAAWA,EAAOyS,UAAYzS,EAGvF2S,GAAgBD,IAAcA,GAAW3S,UAAYyS,GAGrDI,GAAcD,IAAiBP,GAAWS,QAG1CC,GAAY,WACd,IAEE,IAAIC,EAAQL,IAAcA,GAAWjQ,SAAWiQ,GAAWjQ,QAAQ,QAAQsQ,MAE3E,OAAIA,GAKGH,IAAeA,GAAYI,SAAWJ,GAAYI,QAAQ,QACjE,MAAOC,KAXI,GAeXC,GAAoBJ,IAAYA,GAASK,cACzCC,GAAaN,IAAYA,GAASO,OAClCC,GAAYR,IAAYA,GAASS,MACjCC,GAAeV,IAAYA,GAASW,SACpCC,GAAYZ,IAAYA,GAASa,MACjCC,GAAmBd,IAAYA,GAASe,aAc5C,SAASC,GAAMC,EAAMC,EAASC,GAC5B,OAAQA,EAAKrP,QACX,KAAK,EAAG,OAAOmP,EAAKpT,KAAKqT,GACzB,KAAK,EAAG,OAAOD,EAAKpT,KAAKqT,EAASC,EAAK,IACvC,KAAK,EAAG,OAAOF,EAAKpT,KAAKqT,EAASC,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAOF,EAAKpT,KAAKqT,EAASC,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAOF,EAAKD,MAAME,EAASC,GAa7B,SAASC,GAAgBC,EAAOC,EAAQC,EAAUC,GAChD,IAAInR,GAAS,EACTyB,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OAEvC,QAASzB,EAAQyB,EAAQ,CACvB,IAAInD,EAAQ0S,EAAMhR,GAClBiR,EAAOE,EAAa7S,EAAO4S,EAAS5S,GAAQ0S,GAE9C,OAAOG,EAYT,SAASC,GAAUJ,EAAOE,GACxB,IAAIlR,GAAS,EACTyB,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OAEvC,QAASzB,EAAQyB,EACf,IAA6C,IAAzCyP,EAASF,EAAMhR,GAAQA,EAAOgR,GAChC,MAGJ,OAAOA,EAYT,SAASK,GAAeL,EAAOE,GAC7B,IAAIzP,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OAEvC,MAAOA,IACL,IAA+C,IAA3CyP,EAASF,EAAMvP,GAASA,EAAQuP,GAClC,MAGJ,OAAOA,EAaT,SAASM,GAAWN,EAAOO,GACzB,IAAIvR,GAAS,EACTyB,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OAEvC,QAASzB,EAAQyB,EACf,IAAK8P,EAAUP,EAAMhR,GAAQA,EAAOgR,GAClC,OAAO,EAGX,OAAO,EAYT,SAASQ,GAAYR,EAAOO,GAC1B,IAAIvR,GAAS,EACTyB,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACnCgQ,EAAW,EACXC,EAAS,GAEb,QAAS1R,EAAQyB,EAAQ,CACvB,IAAInD,EAAQ0S,EAAMhR,GACduR,EAAUjT,EAAO0B,EAAOgR,KAC1BU,EAAOD,KAAcnT,GAGzB,OAAOoT,EAYT,SAASC,GAAcX,EAAO1S,GAC5B,IAAImD,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACvC,QAASA,GAAUmQ,GAAYZ,EAAO1S,EAAO,IAAM,EAYrD,SAASuT,GAAkBb,EAAO1S,EAAOwT,GACvC,IAAI9R,GAAS,EACTyB,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OAEvC,QAASzB,EAAQyB,EACf,GAAIqQ,EAAWxT,EAAO0S,EAAMhR,IAC1B,OAAO,EAGX,OAAO,EAYT,SAAS+R,GAASf,EAAOE,GACvB,IAAIlR,GAAS,EACTyB,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACnCiQ,EAASM,MAAMvQ,GAEnB,QAASzB,EAAQyB,EACfiQ,EAAO1R,GAASkR,EAASF,EAAMhR,GAAQA,EAAOgR,GAEhD,OAAOU,EAWT,SAASO,GAAUjB,EAAOkB,GACxB,IAAIlS,GAAS,EACTyB,EAASyQ,EAAOzQ,OAChB0Q,EAASnB,EAAMvP,OAEnB,QAASzB,EAAQyB,EACfuP,EAAMmB,EAASnS,GAASkS,EAAOlS,GAEjC,OAAOgR,EAeT,SAASoB,GAAYpB,EAAOE,EAAUC,EAAakB,GACjD,IAAIrS,GAAS,EACTyB,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OAEnC4Q,GAAa5Q,IACf0P,EAAcH,IAAQhR,IAExB,QAASA,EAAQyB,EACf0P,EAAcD,EAASC,EAAaH,EAAMhR,GAAQA,EAAOgR,GAE3D,OAAOG,EAeT,SAASmB,GAAiBtB,EAAOE,EAAUC,EAAakB,GACtD,IAAI5Q,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACnC4Q,GAAa5Q,IACf0P,EAAcH,IAAQvP,IAExB,MAAOA,IACL0P,EAAcD,EAASC,EAAaH,EAAMvP,GAASA,EAAQuP,GAE7D,OAAOG,EAaT,SAASoB,GAAUvB,EAAOO,GACxB,IAAIvR,GAAS,EACTyB,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OAEvC,QAASzB,EAAQyB,EACf,GAAI8P,EAAUP,EAAMhR,GAAQA,EAAOgR,GACjC,OAAO,EAGX,OAAO,EAUT,IAAIwB,GAAYC,GAAa,UAS7B,SAASC,GAAaC,GACpB,OAAOA,EAAOC,MAAM,IAUtB,SAASC,GAAWF,GAClB,OAAOA,EAAOG,MAAMtI,KAAgB,GActC,SAASuI,GAAYC,EAAYzB,EAAW0B,GAC1C,IAAIvB,EAOJ,OANAuB,EAASD,GAAY,SAAS1U,EAAOM,EAAKoU,GACxC,GAAIzB,EAAUjT,EAAOM,EAAKoU,GAExB,OADAtB,EAAS9S,GACF,KAGJ8S,EAcT,SAASwB,GAAclC,EAAOO,EAAW4B,EAAWC,GAClD,IAAI3R,EAASuP,EAAMvP,OACfzB,EAAQmT,GAAaC,EAAY,GAAK,GAE1C,MAAQA,EAAYpT,MAAYA,EAAQyB,EACtC,GAAI8P,EAAUP,EAAMhR,GAAQA,EAAOgR,GACjC,OAAOhR,EAGX,OAAQ,EAYV,SAAS4R,GAAYZ,EAAO1S,EAAO6U,GACjC,OAAO7U,IAAUA,EACb+U,GAAcrC,EAAO1S,EAAO6U,GAC5BD,GAAclC,EAAOsC,GAAWH,GAatC,SAASI,GAAgBvC,EAAO1S,EAAO6U,EAAWrB,GAChD,IAAI9R,EAAQmT,EAAY,EACpB1R,EAASuP,EAAMvP,OAEnB,QAASzB,EAAQyB,EACf,GAAIqQ,EAAWd,EAAMhR,GAAQ1B,GAC3B,OAAO0B,EAGX,OAAQ,EAUV,SAASsT,GAAUhV,GACjB,OAAOA,IAAUA,EAYnB,SAASkV,GAASxC,EAAOE,GACvB,IAAIzP,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACvC,OAAOA,EAAUgS,GAAQzC,EAAOE,GAAYzP,EAAUmF,EAUxD,SAAS6L,GAAa7T,GACpB,OAAO,SAASG,GACd,OAAiB,MAAVA,EAAiB2F,EAAY3F,EAAOH,IAW/C,SAAS8U,GAAe3U,GACtB,OAAO,SAASH,GACd,OAAiB,MAAVG,EAAiB2F,EAAY3F,EAAOH,IAiB/C,SAAS+U,GAAWX,EAAY9B,EAAUC,EAAakB,EAAWY,GAMhE,OALAA,EAASD,GAAY,SAAS1U,EAAO0B,EAAOgT,GAC1C7B,EAAckB,GACTA,GAAY,EAAO/T,GACpB4S,EAASC,EAAa7S,EAAO0B,EAAOgT,MAEnC7B,EAaT,SAASyC,GAAW5C,EAAO6C,GACzB,IAAIpS,EAASuP,EAAMvP,OAEnBuP,EAAM8C,KAAKD,GACX,MAAOpS,IACLuP,EAAMvP,GAAUuP,EAAMvP,GAAQnD,MAEhC,OAAO0S,EAYT,SAASyC,GAAQzC,EAAOE,GACtB,IAAIQ,EACA1R,GAAS,EACTyB,EAASuP,EAAMvP,OAEnB,QAASzB,EAAQyB,EAAQ,CACvB,IAAIsS,EAAU7C,EAASF,EAAMhR,IACzB+T,IAAYrP,IACdgN,EAASA,IAAWhN,EAAYqP,EAAWrC,EAASqC,GAGxD,OAAOrC,EAYT,SAASsC,GAAUlV,EAAGoS,GACpB,IAAIlR,GAAS,EACT0R,EAASM,MAAMlT,GAEnB,QAASkB,EAAQlB,EACf4S,EAAO1R,GAASkR,EAASlR,GAE3B,OAAO0R,EAYT,SAASuC,GAAYlV,EAAQmV,GAC3B,OAAOnC,GAASmC,GAAO,SAAStV,GAC9B,MAAO,CAACA,EAAKG,EAAOH,OAWxB,SAASuV,GAASxB,GAChB,OAAOA,EACHA,EAAOyB,MAAM,EAAGC,GAAgB1B,GAAU,GAAG2B,QAAQnK,GAAa,IAClEwI,EAUN,SAAS4B,GAAU3D,GACjB,OAAO,SAAStS,GACd,OAAOsS,EAAKtS,IAchB,SAASkW,GAAWzV,EAAQmV,GAC1B,OAAOnC,GAASmC,GAAO,SAAStV,GAC9B,OAAOG,EAAOH,MAYlB,SAAS6V,GAASC,EAAO9V,GACvB,OAAO8V,EAAMC,IAAI/V,GAYnB,SAASgW,GAAgBC,EAAYC,GACnC,IAAI9U,GAAS,EACTyB,EAASoT,EAAWpT,OAExB,QAASzB,EAAQyB,GAAUmQ,GAAYkD,EAAYD,EAAW7U,GAAQ,IAAM,GAC5E,OAAOA,EAYT,SAAS+U,GAAcF,EAAYC,GACjC,IAAI9U,EAAQ6U,EAAWpT,OAEvB,MAAOzB,KAAW4R,GAAYkD,EAAYD,EAAW7U,GAAQ,IAAM,GACnE,OAAOA,EAWT,SAASgV,GAAahE,EAAOiE,GAC3B,IAAIxT,EAASuP,EAAMvP,OACfiQ,EAAS,EAEb,MAAOjQ,IACDuP,EAAMvP,KAAYwT,KAClBvD,EAGN,OAAOA,EAWT,IAAIwD,GAAexB,GAAejF,IAS9B0G,GAAiBzB,GAAehF,IASpC,SAAS0G,GAAiBC,GACxB,MAAO,KAAOzG,GAAcyG,GAW9B,SAASC,GAASvW,EAAQH,GACxB,OAAiB,MAAVG,EAAiB2F,EAAY3F,EAAOH,GAU7C,SAAS2W,GAAW5C,GAClB,OAAOxE,GAAaqH,KAAK7C,GAU3B,SAAS8C,GAAe9C,GACtB,OAAOvE,GAAiBoH,KAAK7C,GAU/B,SAAS+C,GAAgBC,GACvB,IAAIvR,EACAsN,EAAS,GAEb,QAAStN,EAAOuR,EAAS1T,QAAQ2T,KAC/BlE,EAAOpQ,KAAK8C,EAAK9F,OAEnB,OAAOoT,EAUT,SAASmE,GAAWC,GAClB,IAAI9V,GAAS,EACT0R,EAASM,MAAM8D,EAAIC,MAKvB,OAHAD,EAAIE,SAAQ,SAAS1X,EAAOM,GAC1B8S,IAAS1R,GAAS,CAACpB,EAAKN,MAEnBoT,EAWT,SAASuE,GAAQrF,EAAMsF,GACrB,OAAO,SAASC,GACd,OAAOvF,EAAKsF,EAAUC,KAa1B,SAASC,GAAepF,EAAOiE,GAC7B,IAAIjV,GAAS,EACTyB,EAASuP,EAAMvP,OACfgQ,EAAW,EACXC,EAAS,GAEb,QAAS1R,EAAQyB,EAAQ,CACvB,IAAInD,EAAQ0S,EAAMhR,GACd1B,IAAU2W,GAAe3W,IAAU4G,IACrC8L,EAAMhR,GAASkF,EACfwM,EAAOD,KAAczR,GAGzB,OAAO0R,EAUT,SAAS2E,GAAWC,GAClB,IAAItW,GAAS,EACT0R,EAASM,MAAMsE,EAAIP,MAKvB,OAHAO,EAAIN,SAAQ,SAAS1X,GACnBoT,IAAS1R,GAAS1B,KAEboT,EAUT,SAAS6E,GAAWD,GAClB,IAAItW,GAAS,EACT0R,EAASM,MAAMsE,EAAIP,MAKvB,OAHAO,EAAIN,SAAQ,SAAS1X,GACnBoT,IAAS1R,GAAS,CAAC1B,EAAOA,MAErBoT,EAaT,SAAS2B,GAAcrC,EAAO1S,EAAO6U,GACnC,IAAInT,EAAQmT,EAAY,EACpB1R,EAASuP,EAAMvP,OAEnB,QAASzB,EAAQyB,EACf,GAAIuP,EAAMhR,KAAW1B,EACnB,OAAO0B,EAGX,OAAQ,EAaV,SAASwW,GAAkBxF,EAAO1S,EAAO6U,GACvC,IAAInT,EAAQmT,EAAY,EACxB,MAAOnT,IACL,GAAIgR,EAAMhR,KAAW1B,EACnB,OAAO0B,EAGX,OAAOA,EAUT,SAASyW,GAAW9D,GAClB,OAAO4C,GAAW5C,GACd+D,GAAY/D,GACZH,GAAUG,GAUhB,SAASgE,GAAchE,GACrB,OAAO4C,GAAW5C,GACdiE,GAAejE,GACfD,GAAaC,GAWnB,SAAS0B,GAAgB1B,GACvB,IAAI3S,EAAQ2S,EAAOlR,OAEnB,MAAOzB,KAAWoK,GAAaoL,KAAK7C,EAAOkE,OAAO7W,KAClD,OAAOA,EAUT,IAAI8W,GAAmBpD,GAAe/E,IAStC,SAAS+H,GAAY/D,GACnB,IAAIjB,EAASzD,GAAU8I,UAAY,EACnC,MAAO9I,GAAUuH,KAAK7C,KAClBjB,EAEJ,OAAOA,EAUT,SAASkF,GAAejE,GACtB,OAAOA,EAAOG,MAAM7E,KAAc,GAUpC,SAAS+I,GAAarE,GACpB,OAAOA,EAAOG,MAAM5E,KAAkB,GAkCxC,IAAI+I,GAAe,SAAUA,EAAaC,GACxCA,EAAqB,MAAXA,EAAkBxa,GAAOya,GAAEC,SAAS1a,GAAKqB,SAAUmZ,EAASC,GAAEE,KAAK3a,GAAM2R,KAGnF,IAAI2D,EAAQkF,EAAQlF,MAChBsF,EAAOJ,EAAQI,KACfC,EAAQL,EAAQK,MAChBnI,GAAW8H,EAAQ9H,SACnBxP,GAAOsX,EAAQtX,KACf7B,GAASmZ,EAAQnZ,OACjByL,GAAS0N,EAAQ1N,OACjBgO,GAASN,EAAQM,OACjBC,GAAYP,EAAQO,UAGpBC,GAAa1F,EAAM/S,UACnB0Y,GAAYvI,GAASnQ,UACrB2Y,GAAc7Z,GAAOkB,UAGrB4Y,GAAaX,EAAQ,sBAGrBY,GAAeH,GAAUI,SAGzB7Y,GAAiB0Y,GAAY1Y,eAG7B8Y,GAAY,EAGZC,GAAc,WAChB,IAAIC,EAAM,SAASC,KAAKN,IAAcA,GAAWO,MAAQP,GAAWO,KAAKC,UAAY,IACrF,OAAOH,EAAO,iBAAmBA,EAAO,GAFzB,GAUbI,GAAuBV,GAAYG,SAGnCQ,GAAmBT,GAAata,KAAKO,IAGrCya,GAAU9b,GAAKya,EAGfsB,GAAajP,GAAO,IACtBsO,GAAata,KAAK0B,IAAgBoV,QAAQrK,GAAc,QACvDqK,QAAQ,yDAA0D,SAAW,KAI5EoE,GAASlJ,GAAgB0H,EAAQwB,OAAShU,EAC1CtG,GAAS8Y,EAAQ9Y,OACjBua,GAAazB,EAAQyB,WACrBC,GAAcF,GAASA,GAAOE,YAAclU,EAC5CmU,GAAe5C,GAAQlY,GAAO+a,eAAgB/a,IAC9Cgb,GAAehb,GAAOY,OACtBqa,GAAuBpB,GAAYoB,qBACnCC,GAASvB,GAAWuB,OACpBC,GAAmB9a,GAASA,GAAO+a,mBAAqBzU,EACxD0U,GAAchb,GAASA,GAAOuX,SAAWjR,EACzC2U,GAAiBjb,GAASA,GAAOC,YAAcqG,EAE/C1G,GAAkB,WACpB,IACE,IAAI4S,EAAO0I,GAAUvb,GAAQ,kBAE7B,OADA6S,EAAK,GAAI,GAAI,IACNA,EACP,MAAOd,KALU,GASjByJ,GAAkBrC,EAAQsC,eAAiB9c,GAAK8c,cAAgBtC,EAAQsC,aACxEC,GAASnC,GAAQA,EAAK9T,MAAQ9G,GAAK4a,KAAK9T,KAAO8T,EAAK9T,IACpDkW,GAAgBxC,EAAQyC,aAAejd,GAAKid,YAAczC,EAAQyC,WAGlEC,GAAaha,GAAKia,KAClBC,GAAcla,GAAKma,MACnBC,GAAmBjc,GAAOkc,sBAC1BC,GAAiBxB,GAASA,GAAOyB,SAAWzV,EAC5C0V,GAAiBlD,EAAQlU,SACzBqX,GAAa3C,GAAWjK,KACxB6M,GAAarE,GAAQlY,GAAOqa,KAAMra,IAClCwc,GAAY3a,GAAK4a,IACjBC,GAAY7a,GAAK8a,IACjBC,GAAYrD,EAAK9T,IACjBoX,GAAiB1D,EAAQlI,SACzB6L,GAAejb,GAAKkb,OACpBC,GAAgBrD,GAAWsD,QAG3BC,GAAW3B,GAAUpC,EAAS,YAC9BgE,GAAM5B,GAAUpC,EAAS,OACzB5U,GAAUgX,GAAUpC,EAAS,WAC7BiE,GAAM7B,GAAUpC,EAAS,OACzBkE,GAAU9B,GAAUpC,EAAS,WAC7BmE,GAAe/B,GAAUvb,GAAQ,UAGjCud,GAAUF,IAAW,IAAIA,GAGzBG,GAAY,GAGZC,GAAqBC,GAASR,IAC9BS,GAAgBD,GAASP,IACzBS,GAAoBF,GAASnZ,IAC7BsZ,GAAgBH,GAASN,IACzBU,GAAoBJ,GAASL,IAG7BU,GAAc1d,GAASA,GAAOa,UAAYyF,EAC1CqX,GAAgBD,GAAcA,GAAYE,QAAUtX,EACpDuX,GAAiBH,GAAcA,GAAY/D,SAAWrT,EAyH1D,SAASwX,GAAO5d,GACd,GAAI6d,GAAa7d,KAAW8d,GAAQ9d,MAAYA,aAAiB+d,IAAc,CAC7E,GAAI/d,aAAiBge,GACnB,OAAOhe,EAET,GAAIY,GAAe1B,KAAKc,EAAO,eAC7B,OAAOie,GAAaje,GAGxB,OAAO,IAAIge,GAAche,GAW3B,IAAIke,GAAc,WAChB,SAASzd,KACT,OAAO,SAAS0d,GACd,IAAKC,GAASD,GACZ,MAAO,GAET,GAAI1D,GACF,OAAOA,GAAa0D,GAEtB1d,EAAOE,UAAYwd,EACnB,IAAI/K,EAAS,IAAI3S,EAEjB,OADAA,EAAOE,UAAYyF,EACZgN,GAZM,GAqBjB,SAASiL,MAWT,SAASL,GAAche,EAAOse,GAC5B3f,KAAK4f,YAAcve,EACnBrB,KAAK6f,YAAc,GACnB7f,KAAK8f,YAAcH,EACnB3f,KAAK+f,UAAY,EACjB/f,KAAKggB,WAAavY,EAgFpB,SAAS2X,GAAY/d,GACnBrB,KAAK4f,YAAcve,EACnBrB,KAAK6f,YAAc,GACnB7f,KAAKigB,QAAU,EACfjgB,KAAKkgB,cAAe,EACpBlgB,KAAKmgB,cAAgB,GACrBngB,KAAKogB,cAAgBxW,EACrB5J,KAAKqgB,UAAY,GAWnB,SAASC,KACP,IAAI7L,EAAS,IAAI2K,GAAYpf,KAAK4f,aAOlC,OANAnL,EAAOoL,YAAcU,GAAUvgB,KAAK6f,aACpCpL,EAAOwL,QAAUjgB,KAAKigB,QACtBxL,EAAOyL,aAAelgB,KAAKkgB,aAC3BzL,EAAO0L,cAAgBI,GAAUvgB,KAAKmgB,eACtC1L,EAAO2L,cAAgBpgB,KAAKogB,cAC5B3L,EAAO4L,UAAYE,GAAUvgB,KAAKqgB,WAC3B5L,EAWT,SAAS+L,KACP,GAAIxgB,KAAKkgB,aAAc,CACrB,IAAIzL,EAAS,IAAI2K,GAAYpf,MAC7ByU,EAAOwL,SAAW,EAClBxL,EAAOyL,cAAe,OAEtBzL,EAASzU,KAAKygB,QACdhM,EAAOwL,UAAY,EAErB,OAAOxL,EAWT,SAASiM,KACP,IAAI3M,EAAQ/T,KAAK4f,YAAYve,QACzBsf,EAAM3gB,KAAKigB,QACXW,EAAQzB,GAAQpL,GAChB8M,EAAUF,EAAM,EAChBG,EAAYF,EAAQ7M,EAAMvP,OAAS,EACnCuc,EAAOC,GAAQ,EAAGF,EAAW9gB,KAAKqgB,WAClC/c,EAAQyd,EAAKzd,MACb2d,EAAMF,EAAKE,IACXzc,EAASyc,EAAM3d,EACfP,EAAQ8d,EAAUI,EAAO3d,EAAQ,EACjC4d,EAAYlhB,KAAKmgB,cACjBgB,EAAaD,EAAU1c,OACvBgQ,EAAW,EACX4M,EAAY5D,GAAUhZ,EAAQxE,KAAKogB,eAEvC,IAAKQ,IAAWC,GAAWC,GAAatc,GAAU4c,GAAa5c,EAC7D,OAAO6c,GAAiBtN,EAAO/T,KAAK6f,aAEtC,IAAIpL,EAAS,GAEb6M,EACA,MAAO9c,KAAYgQ,EAAW4M,EAAW,CACvCre,GAAS4d,EAET,IAAIY,GAAa,EACblgB,EAAQ0S,EAAMhR,GAElB,QAASwe,EAAYJ,EAAY,CAC/B,IAAIha,EAAO+Z,EAAUK,GACjBtN,EAAW9M,EAAK8M,SAChB7M,EAAOD,EAAKC,KACZoa,EAAWvN,EAAS5S,GAExB,GAAI+F,GAAQkC,EACVjI,EAAQmgB,OACH,IAAKA,EAAU,CACpB,GAAIpa,GAAQiC,EACV,SAASiY,EAET,MAAMA,GAIZ7M,EAAOD,KAAcnT,EAEvB,OAAOoT,EAgBT,SAASgN,GAAKC,GACZ,IAAI3e,GAAS,EACTyB,EAAoB,MAAXkd,EAAkB,EAAIA,EAAQld,OAE3CxE,KAAK2hB,QACL,QAAS5e,EAAQyB,EAAQ,CACvB,IAAIod,EAAQF,EAAQ3e,GACpB/C,KAAKqZ,IAAIuI,EAAM,GAAIA,EAAM,KAW7B,SAASC,KACP7hB,KAAK8hB,SAAW1D,GAAeA,GAAa,MAAQ,GACpDpe,KAAK8Y,KAAO,EAad,SAASiJ,GAAWpgB,GAClB,IAAI8S,EAASzU,KAAK0X,IAAI/V,WAAe3B,KAAK8hB,SAASngB,GAEnD,OADA3B,KAAK8Y,MAAQrE,EAAS,EAAI,EACnBA,EAYT,SAASuN,GAAQrgB,GACf,IAAIwF,EAAOnH,KAAK8hB,SAChB,GAAI1D,GAAc,CAChB,IAAI3J,EAAStN,EAAKxF,GAClB,OAAO8S,IAAW1M,EAAiBN,EAAYgN,EAEjD,OAAOxS,GAAe1B,KAAK4G,EAAMxF,GAAOwF,EAAKxF,GAAO8F,EAYtD,SAASwa,GAAQtgB,GACf,IAAIwF,EAAOnH,KAAK8hB,SAChB,OAAO1D,GAAgBjX,EAAKxF,KAAS8F,EAAaxF,GAAe1B,KAAK4G,EAAMxF,GAa9E,SAASugB,GAAQvgB,EAAKN,GACpB,IAAI8F,EAAOnH,KAAK8hB,SAGhB,OAFA9hB,KAAK8Y,MAAQ9Y,KAAK0X,IAAI/V,GAAO,EAAI,EACjCwF,EAAKxF,GAAQyc,IAAgB/c,IAAUoG,EAAaM,EAAiB1G,EAC9DrB,KAmBT,SAASmiB,GAAUT,GACjB,IAAI3e,GAAS,EACTyB,EAAoB,MAAXkd,EAAkB,EAAIA,EAAQld,OAE3CxE,KAAK2hB,QACL,QAAS5e,EAAQyB,EAAQ,CACvB,IAAIod,EAAQF,EAAQ3e,GACpB/C,KAAKqZ,IAAIuI,EAAM,GAAIA,EAAM,KAW7B,SAASQ,KACPpiB,KAAK8hB,SAAW,GAChB9hB,KAAK8Y,KAAO,EAYd,SAASuJ,GAAgB1gB,GACvB,IAAIwF,EAAOnH,KAAK8hB,SACZ/e,EAAQuf,GAAanb,EAAMxF,GAE/B,GAAIoB,EAAQ,EACV,OAAO,EAET,IAAI+W,EAAY3S,EAAK3C,OAAS,EAO9B,OANIzB,GAAS+W,EACX3S,EAAKob,MAELvG,GAAOzb,KAAK4G,EAAMpE,EAAO,KAEzB/C,KAAK8Y,MACA,EAYT,SAAS0J,GAAa7gB,GACpB,IAAIwF,EAAOnH,KAAK8hB,SACZ/e,EAAQuf,GAAanb,EAAMxF,GAE/B,OAAOoB,EAAQ,EAAI0E,EAAYN,EAAKpE,GAAO,GAY7C,SAAS0f,GAAa9gB,GACpB,OAAO2gB,GAAatiB,KAAK8hB,SAAUngB,IAAQ,EAa7C,SAAS+gB,GAAa/gB,EAAKN,GACzB,IAAI8F,EAAOnH,KAAK8hB,SACZ/e,EAAQuf,GAAanb,EAAMxF,GAQ/B,OANIoB,EAAQ,KACR/C,KAAK8Y,KACP3R,EAAK9C,KAAK,CAAC1C,EAAKN,KAEhB8F,EAAKpE,GAAO,GAAK1B,EAEZrB,KAmBT,SAAS2iB,GAASjB,GAChB,IAAI3e,GAAS,EACTyB,EAAoB,MAAXkd,EAAkB,EAAIA,EAAQld,OAE3CxE,KAAK2hB,QACL,QAAS5e,EAAQyB,EAAQ,CACvB,IAAIod,EAAQF,EAAQ3e,GACpB/C,KAAKqZ,IAAIuI,EAAM,GAAIA,EAAM,KAW7B,SAASgB,KACP5iB,KAAK8Y,KAAO,EACZ9Y,KAAK8hB,SAAW,CACd,KAAQ,IAAIL,GACZ,IAAO,IAAKxD,IAAOkE,IACnB,OAAU,IAAIV,IAalB,SAASoB,GAAelhB,GACtB,IAAI8S,EAASqO,GAAW9iB,KAAM2B,GAAK,UAAUA,GAE7C,OADA3B,KAAK8Y,MAAQrE,EAAS,EAAI,EACnBA,EAYT,SAASsO,GAAYphB,GACnB,OAAOmhB,GAAW9iB,KAAM2B,GAAKV,IAAIU,GAYnC,SAASqhB,GAAYrhB,GACnB,OAAOmhB,GAAW9iB,KAAM2B,GAAK+V,IAAI/V,GAanC,SAASshB,GAAYthB,EAAKN,GACxB,IAAI8F,EAAO2b,GAAW9iB,KAAM2B,GACxBmX,EAAO3R,EAAK2R,KAIhB,OAFA3R,EAAKkS,IAAI1X,EAAKN,GACdrB,KAAK8Y,MAAQ3R,EAAK2R,MAAQA,EAAO,EAAI,EAC9B9Y,KAoBT,SAASkjB,GAASjO,GAChB,IAAIlS,GAAS,EACTyB,EAAmB,MAAVyQ,EAAiB,EAAIA,EAAOzQ,OAEzCxE,KAAK8hB,SAAW,IAAIa,GACpB,QAAS5f,EAAQyB,EACfxE,KAAKmjB,IAAIlO,EAAOlS,IAcpB,SAASqgB,GAAY/hB,GAEnB,OADArB,KAAK8hB,SAASzI,IAAIhY,EAAO0G,GAClB/H,KAYT,SAASqjB,GAAYhiB,GACnB,OAAOrB,KAAK8hB,SAASpK,IAAIrW,GAgB3B,SAASiiB,GAAM5B,GACb,IAAIva,EAAOnH,KAAK8hB,SAAW,IAAIK,GAAUT,GACzC1hB,KAAK8Y,KAAO3R,EAAK2R,KAUnB,SAASyK,KACPvjB,KAAK8hB,SAAW,IAAIK,GACpBniB,KAAK8Y,KAAO,EAYd,SAAS0K,GAAY7hB,GACnB,IAAIwF,EAAOnH,KAAK8hB,SACZrN,EAAStN,EAAK,UAAUxF,GAG5B,OADA3B,KAAK8Y,KAAO3R,EAAK2R,KACVrE,EAYT,SAASgP,GAAS9hB,GAChB,OAAO3B,KAAK8hB,SAAS7gB,IAAIU,GAY3B,SAAS+hB,GAAS/hB,GAChB,OAAO3B,KAAK8hB,SAASpK,IAAI/V,GAa3B,SAASgiB,GAAShiB,EAAKN,GACrB,IAAI8F,EAAOnH,KAAK8hB,SAChB,GAAI3a,aAAgBgb,GAAW,CAC7B,IAAIyB,EAAQzc,EAAK2a,SACjB,IAAK7D,IAAQ2F,EAAMpf,OAASmD,EAAmB,EAG7C,OAFAic,EAAMvf,KAAK,CAAC1C,EAAKN,IACjBrB,KAAK8Y,OAAS3R,EAAK2R,KACZ9Y,KAETmH,EAAOnH,KAAK8hB,SAAW,IAAIa,GAASiB,GAItC,OAFAzc,EAAKkS,IAAI1X,EAAKN,GACdrB,KAAK8Y,KAAO3R,EAAK2R,KACV9Y,KAoBT,SAAS6jB,GAAcxiB,EAAOyiB,GAC5B,IAAIlD,EAAQzB,GAAQ9d,GAChB0iB,GAASnD,GAASoD,GAAY3iB,GAC9B4iB,GAAUrD,IAAUmD,GAAS7G,GAAS7b,GACtC6iB,GAAUtD,IAAUmD,IAAUE,GAAUxQ,GAAapS,GACrD8iB,EAAcvD,GAASmD,GAASE,GAAUC,EAC1CzP,EAAS0P,EAAcpN,GAAU1V,EAAMmD,OAAQ+V,IAAU,GACzD/V,EAASiQ,EAAOjQ,OAEpB,IAAK,IAAI7C,KAAON,GACTyiB,IAAa7hB,GAAe1B,KAAKc,EAAOM,IACvCwiB,IAEQ,UAAPxiB,GAECsiB,IAAkB,UAAPtiB,GAA0B,UAAPA,IAE9BuiB,IAAkB,UAAPviB,GAA0B,cAAPA,GAA8B,cAAPA,IAEtDyiB,GAAQziB,EAAK6C,KAElBiQ,EAAOpQ,KAAK1C,GAGhB,OAAO8S,EAUT,SAAS4P,GAAYtQ,GACnB,IAAIvP,EAASuP,EAAMvP,OACnB,OAAOA,EAASuP,EAAMuQ,GAAW,EAAG9f,EAAS,IAAMiD,EAWrD,SAAS8c,GAAgBxQ,EAAOlS,GAC9B,OAAO2iB,GAAYjE,GAAUxM,GAAQ0Q,GAAU5iB,EAAG,EAAGkS,EAAMvP,SAU7D,SAASkgB,GAAa3Q,GACpB,OAAOyQ,GAAYjE,GAAUxM,IAY/B,SAAS4Q,GAAiB7iB,EAAQH,EAAKN,IAChCA,IAAUoG,IAAcmd,GAAG9iB,EAAOH,GAAMN,IACxCA,IAAUoG,KAAe9F,KAAOG,KACnC+iB,GAAgB/iB,EAAQH,EAAKN,GAcjC,SAASyjB,GAAYhjB,EAAQH,EAAKN,GAChC,IAAI0jB,EAAWjjB,EAAOH,GAChBM,GAAe1B,KAAKuB,EAAQH,IAAQijB,GAAGG,EAAU1jB,KAClDA,IAAUoG,GAAe9F,KAAOG,IACnC+iB,GAAgB/iB,EAAQH,EAAKN,GAYjC,SAASihB,GAAavO,EAAOpS,GAC3B,IAAI6C,EAASuP,EAAMvP,OACnB,MAAOA,IACL,GAAIogB,GAAG7Q,EAAMvP,GAAQ,GAAI7C,GACvB,OAAO6C,EAGX,OAAQ,EAcV,SAASwgB,GAAejP,EAAY/B,EAAQC,EAAUC,GAIpD,OAHA+Q,GAASlP,GAAY,SAAS1U,EAAOM,EAAKoU,GACxC/B,EAAOE,EAAa7S,EAAO4S,EAAS5S,GAAQ0U,MAEvC7B,EAYT,SAASgR,GAAWpjB,EAAQ0K,GAC1B,OAAO1K,GAAUqjB,GAAW3Y,EAAQ2O,GAAK3O,GAAS1K,GAYpD,SAASsjB,GAAatjB,EAAQ0K,GAC5B,OAAO1K,GAAUqjB,GAAW3Y,EAAQ6Y,GAAO7Y,GAAS1K,GAYtD,SAAS+iB,GAAgB/iB,EAAQH,EAAKN,GACzB,aAAPM,GAAsBZ,GACxBA,GAAee,EAAQH,EAAK,CAC1B,cAAgB,EAChB,YAAc,EACd,MAASN,EACT,UAAY,IAGdS,EAAOH,GAAON,EAYlB,SAASikB,GAAOxjB,EAAQyjB,GACtB,IAAIxiB,GAAS,EACTyB,EAAS+gB,EAAM/gB,OACfiQ,EAASM,EAAMvQ,GACfghB,EAAiB,MAAV1jB,EAEX,QAASiB,EAAQyB,EACfiQ,EAAO1R,GAASyiB,EAAO/d,EAAYxG,GAAIa,EAAQyjB,EAAMxiB,IAEvD,OAAO0R,EAYT,SAASgQ,GAAUgB,EAAQC,EAAOC,GAShC,OARIF,IAAWA,IACTE,IAAUle,IACZge,EAASA,GAAUE,EAAQF,EAASE,GAElCD,IAAUje,IACZge,EAASA,GAAUC,EAAQD,EAASC,IAGjCD,EAmBT,SAASG,GAAUvkB,EAAOwkB,EAASC,EAAYnkB,EAAKG,EAAQikB,GAC1D,IAAItR,EACAuR,EAASH,EAAU3d,EACnB+d,EAASJ,EAAU1d,EACnB+d,EAASL,EAAUzd,EAKvB,GAHI0d,IACFrR,EAAS3S,EAASgkB,EAAWzkB,EAAOM,EAAKG,EAAQikB,GAASD,EAAWzkB,IAEnEoT,IAAWhN,EACb,OAAOgN,EAET,IAAKgL,GAASpe,GACZ,OAAOA,EAET,IAAIuf,EAAQzB,GAAQ9d,GACpB,GAAIuf,GAEF,GADAnM,EAAS0R,GAAe9kB,IACnB2kB,EACH,OAAOzF,GAAUlf,EAAOoT,OAErB,CACL,IAAI2R,EAAMC,GAAOhlB,GACbilB,EAASF,GAAO7b,GAAW6b,GAAO5b,EAEtC,GAAI0S,GAAS7b,GACX,OAAOklB,GAAYllB,EAAO2kB,GAE5B,GAAII,GAAOxb,IAAawb,GAAOpc,GAAYsc,IAAWxkB,GAEpD,GADA2S,EAAUwR,GAAUK,EAAU,GAAKE,GAAgBnlB,IAC9C2kB,EACH,OAAOC,EACHQ,GAAcplB,EAAO+jB,GAAa3Q,EAAQpT,IAC1CqlB,GAAYrlB,EAAO6jB,GAAWzQ,EAAQpT,QAEvC,CACL,IAAKkQ,GAAc6U,GACjB,OAAOtkB,EAAST,EAAQ,GAE1BoT,EAASkS,GAAetlB,EAAO+kB,EAAKJ,IAIxCD,IAAUA,EAAQ,IAAIzC,IACtB,IAAIsD,EAAUb,EAAM9kB,IAAII,GACxB,GAAIulB,EACF,OAAOA,EAETb,EAAM1M,IAAIhY,EAAOoT,GAEblB,GAAMlS,GACRA,EAAM0X,SAAQ,SAAS8N,GACrBpS,EAAO0O,IAAIyC,GAAUiB,EAAUhB,EAASC,EAAYe,EAAUxlB,EAAO0kB,OAE9D5S,GAAM9R,IACfA,EAAM0X,SAAQ,SAAS8N,EAAUllB,GAC/B8S,EAAO4E,IAAI1X,EAAKikB,GAAUiB,EAAUhB,EAASC,EAAYnkB,EAAKN,EAAO0kB,OAIzE,IAAIe,EAAWZ,EACVD,EAASc,GAAeC,GACxBf,EAASZ,GAASlK,GAEnBlE,EAAQ2J,EAAQnZ,EAAYqf,EAASzlB,GASzC,OARA8S,GAAU8C,GAAS5V,GAAO,SAASwlB,EAAUllB,GACvCsV,IACFtV,EAAMklB,EACNA,EAAWxlB,EAAMM,IAGnBmjB,GAAYrQ,EAAQ9S,EAAKikB,GAAUiB,EAAUhB,EAASC,EAAYnkB,EAAKN,EAAO0kB,OAEzEtR,EAUT,SAASwS,GAAaza,GACpB,IAAIyK,EAAQkE,GAAK3O,GACjB,OAAO,SAAS1K,GACd,OAAOolB,GAAeplB,EAAQ0K,EAAQyK,IAY1C,SAASiQ,GAAeplB,EAAQ0K,EAAQyK,GACtC,IAAIzS,EAASyS,EAAMzS,OACnB,GAAc,MAAV1C,EACF,OAAQ0C,EAEV1C,EAAShB,GAAOgB,GAChB,MAAO0C,IAAU,CACf,IAAI7C,EAAMsV,EAAMzS,GACZ8P,EAAY9H,EAAO7K,GACnBN,EAAQS,EAAOH,GAEnB,GAAKN,IAAUoG,KAAe9F,KAAOG,KAAawS,EAAUjT,GAC1D,OAAO,EAGX,OAAO,EAaT,SAAS8lB,GAAUxT,EAAMyT,EAAMvT,GAC7B,GAAmB,mBAARF,EACT,MAAM,IAAI6G,GAAU3S,GAEtB,OAAO6U,IAAW,WAAa/I,EAAKD,MAAMjM,EAAWoM,KAAUuT,GAcjE,SAASC,GAAetT,EAAOkB,EAAQhB,EAAUY,GAC/C,IAAI9R,GAAS,EACTukB,EAAW5S,GACX6S,GAAW,EACX/iB,EAASuP,EAAMvP,OACfiQ,EAAS,GACT+S,EAAevS,EAAOzQ,OAE1B,IAAKA,EACH,OAAOiQ,EAELR,IACFgB,EAASH,GAASG,EAAQqC,GAAUrD,KAElCY,GACFyS,EAAW1S,GACX2S,GAAW,GAEJtS,EAAOzQ,QAAUmD,IACxB2f,EAAW9P,GACX+P,GAAW,EACXtS,EAAS,IAAIiO,GAASjO,IAExBqM,EACA,QAASve,EAAQyB,EAAQ,CACvB,IAAInD,EAAQ0S,EAAMhR,GACdye,EAAuB,MAAZvN,EAAmB5S,EAAQ4S,EAAS5S,GAGnD,GADAA,EAASwT,GAAwB,IAAVxT,EAAeA,EAAQ,EAC1CkmB,GAAY/F,IAAaA,EAAU,CACrC,IAAIiG,EAAcD,EAClB,MAAOC,IACL,GAAIxS,EAAOwS,KAAiBjG,EAC1B,SAASF,EAGb7M,EAAOpQ,KAAKhD,QAEJimB,EAASrS,EAAQuM,EAAU3M,IACnCJ,EAAOpQ,KAAKhD,GAGhB,OAAOoT,EAjkCTwK,GAAOyI,iBAAmB,CAQxB,OAAUhb,GAQV,SAAYC,GAQZ,YAAeC,GAQf,SAAY,GAQZ,QAAW,CAQT,EAAKqS,KAKTA,GAAOjd,UAAY0d,GAAW1d,UAC9Bid,GAAOjd,UAAUyD,YAAcwZ,GAE/BI,GAAcrd,UAAYud,GAAWG,GAAW1d,WAChDqd,GAAcrd,UAAUyD,YAAc4Z,GAsHtCD,GAAYpd,UAAYud,GAAWG,GAAW1d,WAC9Cod,GAAYpd,UAAUyD,YAAc2Z,GAoGpCqC,GAAKzf,UAAU2f,MAAQE,GACvBJ,GAAKzf,UAAU,UAAY+f,GAC3BN,GAAKzf,UAAUf,IAAM+gB,GACrBP,GAAKzf,UAAU0V,IAAMuK,GACrBR,GAAKzf,UAAUqX,IAAM6I,GAiHrBC,GAAUngB,UAAU2f,MAAQS,GAC5BD,GAAUngB,UAAU,UAAYqgB,GAChCF,GAAUngB,UAAUf,IAAMuhB,GAC1BL,GAAUngB,UAAU0V,IAAM+K,GAC1BN,GAAUngB,UAAUqX,IAAMqJ,GAmG1BC,GAAS3gB,UAAU2f,MAAQiB,GAC3BD,GAAS3gB,UAAU,UAAY6gB,GAC/BF,GAAS3gB,UAAUf,IAAM8hB,GACzBJ,GAAS3gB,UAAU0V,IAAMsL,GACzBL,GAAS3gB,UAAUqX,IAAM4J,GAmDzBC,GAASlhB,UAAUmhB,IAAMD,GAASlhB,UAAUqC,KAAO+e,GACnDF,GAASlhB,UAAU0V,IAAM2L,GAkGzBC,GAAMthB,UAAU2f,MAAQ4B,GACxBD,GAAMthB,UAAU,UAAYwhB,GAC5BF,GAAMthB,UAAUf,IAAMwiB,GACtBH,GAAMthB,UAAU0V,IAAMgM,GACtBJ,GAAMthB,UAAUqX,IAAMsK,GA8btB,IAAIsB,GAAW0C,GAAeC,IAU1BC,GAAgBF,GAAeG,IAAiB,GAWpD,SAASC,GAAUhS,EAAYzB,GAC7B,IAAIG,GAAS,EAKb,OAJAwQ,GAASlP,GAAY,SAAS1U,EAAO0B,EAAOgT,GAE1C,OADAtB,IAAWH,EAAUjT,EAAO0B,EAAOgT,GAC5BtB,KAEFA,EAaT,SAASuT,GAAajU,EAAOE,EAAUY,GACrC,IAAI9R,GAAS,EACTyB,EAASuP,EAAMvP,OAEnB,QAASzB,EAAQyB,EAAQ,CACvB,IAAInD,EAAQ0S,EAAMhR,GACd+T,EAAU7C,EAAS5S,GAEvB,GAAe,MAAXyV,IAAoB0K,IAAa/Z,EAC5BqP,IAAYA,IAAYmR,GAASnR,GAClCjC,EAAWiC,EAAS0K,IAE1B,IAAIA,EAAW1K,EACXrC,EAASpT,EAGjB,OAAOoT,EAaT,SAASyT,GAASnU,EAAO1S,EAAOiC,EAAO2d,GACrC,IAAIzc,EAASuP,EAAMvP,OAEnBlB,EAAQ6kB,GAAU7kB,GACdA,EAAQ,IACVA,GAASA,EAAQkB,EAAS,EAAKA,EAASlB,GAE1C2d,EAAOA,IAAQxZ,GAAawZ,EAAMzc,EAAUA,EAAS2jB,GAAUlH,GAC3DA,EAAM,IACRA,GAAOzc,GAETyc,EAAM3d,EAAQ2d,EAAM,EAAImH,GAASnH,GACjC,MAAO3d,EAAQ2d,EACblN,EAAMzQ,KAAWjC,EAEnB,OAAO0S,EAWT,SAASsU,GAAWtS,EAAYzB,GAC9B,IAAIG,EAAS,GAMb,OALAwQ,GAASlP,GAAY,SAAS1U,EAAO0B,EAAOgT,GACtCzB,EAAUjT,EAAO0B,EAAOgT,IAC1BtB,EAAOpQ,KAAKhD,MAGToT,EAcT,SAAS6T,GAAYvU,EAAOwU,EAAOjU,EAAWkU,EAAU/T,GACtD,IAAI1R,GAAS,EACTyB,EAASuP,EAAMvP,OAEnB8P,IAAcA,EAAYmU,IAC1BhU,IAAWA,EAAS,IAEpB,QAAS1R,EAAQyB,EAAQ,CACvB,IAAInD,EAAQ0S,EAAMhR,GACdwlB,EAAQ,GAAKjU,EAAUjT,GACrBknB,EAAQ,EAEVD,GAAYjnB,EAAOknB,EAAQ,EAAGjU,EAAWkU,EAAU/T,GAEnDO,GAAUP,EAAQpT,GAEVmnB,IACV/T,EAAOA,EAAOjQ,QAAUnD,GAG5B,OAAOoT,EAcT,IAAIiU,GAAUC,KAYVC,GAAeD,IAAc,GAUjC,SAASf,GAAW9lB,EAAQmS,GAC1B,OAAOnS,GAAU4mB,GAAQ5mB,EAAQmS,EAAUkH,IAW7C,SAAS2M,GAAgBhmB,EAAQmS,GAC/B,OAAOnS,GAAU8mB,GAAa9mB,EAAQmS,EAAUkH,IAYlD,SAAS0N,GAAc/mB,EAAQmV,GAC7B,OAAO1C,GAAY0C,GAAO,SAAStV,GACjC,OAAOmnB,GAAWhnB,EAAOH,OAY7B,SAASonB,GAAQjnB,EAAQknB,GACvBA,EAAOC,GAASD,EAAMlnB,GAEtB,IAAIiB,EAAQ,EACRyB,EAASwkB,EAAKxkB,OAElB,MAAiB,MAAV1C,GAAkBiB,EAAQyB,EAC/B1C,EAASA,EAAOonB,GAAMF,EAAKjmB,OAE7B,OAAQA,GAASA,GAASyB,EAAU1C,EAAS2F,EAc/C,SAAS0hB,GAAernB,EAAQglB,EAAUsC,GACxC,IAAI3U,EAASqS,EAAShlB,GACtB,OAAOqd,GAAQrd,GAAU2S,EAASO,GAAUP,EAAQ2U,EAAYtnB,IAUlE,SAASunB,GAAWhoB,GAClB,OAAa,MAATA,EACKA,IAAUoG,EAAY0D,GAAeR,GAEtCyR,IAAkBA,MAAkBtb,GAAOO,GAC/CioB,GAAUjoB,GACVkoB,GAAeloB,GAYrB,SAASmoB,GAAOnoB,EAAOooB,GACrB,OAAOpoB,EAAQooB,EAWjB,SAASC,GAAQ5nB,EAAQH,GACvB,OAAiB,MAAVG,GAAkBG,GAAe1B,KAAKuB,EAAQH,GAWvD,SAASgoB,GAAU7nB,EAAQH,GACzB,OAAiB,MAAVG,GAAkBH,KAAOb,GAAOgB,GAYzC,SAAS8nB,GAAYnE,EAAQniB,EAAO2d,GAClC,OAAOwE,GAAUjI,GAAUla,EAAO2d,IAAQwE,EAASnI,GAAUha,EAAO2d,GAatE,SAAS4I,GAAiBC,EAAQ7V,EAAUY,GAC1C,IAAIyS,EAAWzS,EAAaD,GAAoBF,GAC5ClQ,EAASslB,EAAO,GAAGtlB,OACnBulB,EAAYD,EAAOtlB,OACnBwlB,EAAWD,EACXE,EAASlV,EAAMgV,GACfG,EAAYC,IACZ1V,EAAS,GAEb,MAAOuV,IAAY,CACjB,IAAIjW,EAAQ+V,EAAOE,GACfA,GAAY/V,IACdF,EAAQe,GAASf,EAAOuD,GAAUrD,KAEpCiW,EAAY1M,GAAUzJ,EAAMvP,OAAQ0lB,GACpCD,EAAOD,IAAanV,IAAeZ,GAAazP,GAAU,KAAOuP,EAAMvP,QAAU,KAC7E,IAAI0e,GAAS8G,GAAYjW,GACzBtM,EAENsM,EAAQ+V,EAAO,GAEf,IAAI/mB,GAAS,EACTqnB,EAAOH,EAAO,GAElB3I,EACA,QAASve,EAAQyB,GAAUiQ,EAAOjQ,OAAS0lB,EAAW,CACpD,IAAI7oB,EAAQ0S,EAAMhR,GACdye,EAAWvN,EAAWA,EAAS5S,GAASA,EAG5C,GADAA,EAASwT,GAAwB,IAAVxT,EAAeA,EAAQ,IACxC+oB,EACE5S,GAAS4S,EAAM5I,GACf8F,EAAS7S,EAAQ+M,EAAU3M,IAC5B,CACLmV,EAAWD,EACX,QAASC,EAAU,CACjB,IAAIvS,EAAQwS,EAAOD,GACnB,KAAMvS,EACED,GAASC,EAAO+J,GAChB8F,EAASwC,EAAOE,GAAWxI,EAAU3M,IAE3C,SAASyM,EAGT8I,GACFA,EAAK/lB,KAAKmd,GAEZ/M,EAAOpQ,KAAKhD,IAGhB,OAAOoT,EAcT,SAAS4V,GAAavoB,EAAQkS,EAAQC,EAAUC,GAI9C,OAHA0T,GAAW9lB,GAAQ,SAAST,EAAOM,EAAKG,GACtCkS,EAAOE,EAAaD,EAAS5S,GAAQM,EAAKG,MAErCoS,EAaT,SAASoW,GAAWxoB,EAAQknB,EAAMnV,GAChCmV,EAAOC,GAASD,EAAMlnB,GACtBA,EAASyoB,GAAOzoB,EAAQknB,GACxB,IAAIrV,EAAiB,MAAV7R,EAAiBA,EAASA,EAAOonB,GAAMsB,GAAKxB,KACvD,OAAe,MAARrV,EAAelM,EAAYiM,GAAMC,EAAM7R,EAAQ+R,GAUxD,SAAS4W,GAAgBppB,GACvB,OAAO6d,GAAa7d,IAAUgoB,GAAWhoB,IAAU2I,EAUrD,SAAS0gB,GAAkBrpB,GACzB,OAAO6d,GAAa7d,IAAUgoB,GAAWhoB,IAAUiK,GAUrD,SAASqf,GAAWtpB,GAClB,OAAO6d,GAAa7d,IAAUgoB,GAAWhoB,IAAU+I,EAiBrD,SAASwgB,GAAYvpB,EAAOooB,EAAO5D,EAASC,EAAYC,GACtD,OAAI1kB,IAAUooB,IAGD,MAATpoB,GAA0B,MAATooB,IAAmBvK,GAAa7d,KAAW6d,GAAauK,GACpEpoB,IAAUA,GAASooB,IAAUA,EAE/BoB,GAAgBxpB,EAAOooB,EAAO5D,EAASC,EAAY8E,GAAa7E,IAiBzE,SAAS8E,GAAgB/oB,EAAQ2nB,EAAO5D,EAASC,EAAYgF,EAAW/E,GACtE,IAAIgF,EAAW5L,GAAQrd,GACnBkpB,EAAW7L,GAAQsK,GACnBwB,EAASF,EAAW9gB,EAAWoc,GAAOvkB,GACtCopB,EAASF,EAAW/gB,EAAWoc,GAAOoD,GAE1CwB,EAASA,GAAUjhB,EAAUY,GAAYqgB,EACzCC,EAASA,GAAUlhB,EAAUY,GAAYsgB,EAEzC,IAAIC,EAAWF,GAAUrgB,GACrBwgB,EAAWF,GAAUtgB,GACrBygB,EAAYJ,GAAUC,EAE1B,GAAIG,GAAanO,GAASpb,GAAS,CACjC,IAAKob,GAASuM,GACZ,OAAO,EAETsB,GAAW,EACXI,GAAW,EAEb,GAAIE,IAAcF,EAEhB,OADApF,IAAUA,EAAQ,IAAIzC,IACdyH,GAAYtX,GAAa3R,GAC7BwpB,GAAYxpB,EAAQ2nB,EAAO5D,EAASC,EAAYgF,EAAW/E,GAC3DwF,GAAWzpB,EAAQ2nB,EAAOwB,EAAQpF,EAASC,EAAYgF,EAAW/E,GAExE,KAAMF,EAAUxd,GAAuB,CACrC,IAAImjB,EAAeL,GAAYlpB,GAAe1B,KAAKuB,EAAQ,eACvD2pB,EAAeL,GAAYnpB,GAAe1B,KAAKkpB,EAAO,eAE1D,GAAI+B,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAe1pB,EAAOT,QAAUS,EAC/C6pB,EAAeF,EAAehC,EAAMpoB,QAAUooB,EAGlD,OADA1D,IAAUA,EAAQ,IAAIzC,IACfwH,EAAUY,EAAcC,EAAc9F,EAASC,EAAYC,IAGtE,QAAKsF,IAGLtF,IAAUA,EAAQ,IAAIzC,IACfsI,GAAa9pB,EAAQ2nB,EAAO5D,EAASC,EAAYgF,EAAW/E,IAUrE,SAAS8F,GAAUxqB,GACjB,OAAO6d,GAAa7d,IAAUglB,GAAOhlB,IAAUoJ,EAajD,SAASqhB,GAAYhqB,EAAQ0K,EAAQuf,EAAWjG,GAC9C,IAAI/iB,EAAQgpB,EAAUvnB,OAClBA,EAASzB,EACTipB,GAAgBlG,EAEpB,GAAc,MAAVhkB,EACF,OAAQ0C,EAEV1C,EAAShB,GAAOgB,GAChB,MAAOiB,IAAS,CACd,IAAIoE,EAAO4kB,EAAUhpB,GACrB,GAAKipB,GAAgB7kB,EAAK,GAClBA,EAAK,KAAOrF,EAAOqF,EAAK,MACtBA,EAAK,KAAMrF,GAEnB,OAAO,EAGX,QAASiB,EAAQyB,EAAQ,CACvB2C,EAAO4kB,EAAUhpB,GACjB,IAAIpB,EAAMwF,EAAK,GACX4d,EAAWjjB,EAAOH,GAClBsqB,EAAW9kB,EAAK,GAEpB,GAAI6kB,GAAgB7kB,EAAK,IACvB,GAAI4d,IAAatd,KAAe9F,KAAOG,GACrC,OAAO,MAEJ,CACL,IAAIikB,EAAQ,IAAIzC,GAChB,GAAIwC,EACF,IAAIrR,EAASqR,EAAWf,EAAUkH,EAAUtqB,EAAKG,EAAQ0K,EAAQuZ,GAEnE,KAAMtR,IAAWhN,EACTmjB,GAAYqB,EAAUlH,EAAU1c,EAAuBC,EAAwBwd,EAAYC,GAC3FtR,GAEN,OAAO,GAIb,OAAO,EAWT,SAASyX,GAAa7qB,GACpB,IAAKoe,GAASpe,IAAU8qB,GAAS9qB,GAC/B,OAAO,EAET,IAAI+qB,EAAUtD,GAAWznB,GAASma,GAAa1N,GAC/C,OAAOse,EAAQ7T,KAAKiG,GAASnd,IAU/B,SAASgrB,GAAahrB,GACpB,OAAO6d,GAAa7d,IAAUgoB,GAAWhoB,IAAU0J,GAUrD,SAASuhB,GAAUjrB,GACjB,OAAO6d,GAAa7d,IAAUglB,GAAOhlB,IAAU2J,GAUjD,SAASuhB,GAAiBlrB,GACxB,OAAO6d,GAAa7d,IAClBmrB,GAASnrB,EAAMmD,WAAa8M,GAAe+X,GAAWhoB,IAU1D,SAASorB,GAAaprB,GAGpB,MAAoB,mBAATA,EACFA,EAEI,MAATA,EACKqrB,GAEW,iBAATrrB,EACF8d,GAAQ9d,GACXsrB,GAAoBtrB,EAAM,GAAIA,EAAM,IACpCurB,GAAYvrB,GAEXU,GAASV,GAUlB,SAASwrB,GAAS/qB,GAChB,IAAKgrB,GAAYhrB,GACf,OAAOub,GAAWvb,GAEpB,IAAI2S,EAAS,GACb,IAAK,IAAI9S,KAAOb,GAAOgB,GACjBG,GAAe1B,KAAKuB,EAAQH,IAAe,eAAPA,GACtC8S,EAAOpQ,KAAK1C,GAGhB,OAAO8S,EAUT,SAASsY,GAAWjrB,GAClB,IAAK2d,GAAS3d,GACZ,OAAOkrB,GAAalrB,GAEtB,IAAImrB,EAAUH,GAAYhrB,GACtB2S,EAAS,GAEb,IAAK,IAAI9S,KAAOG,GACD,eAAPH,IAAyBsrB,GAAYhrB,GAAe1B,KAAKuB,EAAQH,KACrE8S,EAAOpQ,KAAK1C,GAGhB,OAAO8S,EAYT,SAASyY,GAAO7rB,EAAOooB,GACrB,OAAOpoB,EAAQooB,EAWjB,SAAS0D,GAAQpX,EAAY9B,GAC3B,IAAIlR,GAAS,EACT0R,EAAS2Y,GAAYrX,GAAchB,EAAMgB,EAAWvR,QAAU,GAKlE,OAHAygB,GAASlP,GAAY,SAAS1U,EAAOM,EAAKoU,GACxCtB,IAAS1R,GAASkR,EAAS5S,EAAOM,EAAKoU,MAElCtB,EAUT,SAASmY,GAAYpgB,GACnB,IAAIuf,EAAYsB,GAAa7gB,GAC7B,OAAwB,GAApBuf,EAAUvnB,QAAeunB,EAAU,GAAG,GACjCuB,GAAwBvB,EAAU,GAAG,GAAIA,EAAU,GAAG,IAExD,SAASjqB,GACd,OAAOA,IAAW0K,GAAUsf,GAAYhqB,EAAQ0K,EAAQuf,IAY5D,SAASY,GAAoB3D,EAAMiD,GACjC,OAAIsB,GAAMvE,IAASwE,GAAmBvB,GAC7BqB,GAAwBpE,GAAMF,GAAOiD,GAEvC,SAASnqB,GACd,IAAIijB,EAAW9jB,GAAIa,EAAQknB,GAC3B,OAAQjE,IAAatd,GAAasd,IAAakH,EAC3CwB,GAAM3rB,EAAQknB,GACd4B,GAAYqB,EAAUlH,EAAU1c,EAAuBC,IAe/D,SAASolB,GAAU5rB,EAAQ0K,EAAQmhB,EAAU7H,EAAYC,GACnDjkB,IAAW0K,GAGfkc,GAAQlc,GAAQ,SAASyf,EAAUtqB,GAEjC,GADAokB,IAAUA,EAAQ,IAAIzC,IAClB7D,GAASwM,GACX2B,GAAc9rB,EAAQ0K,EAAQ7K,EAAKgsB,EAAUD,GAAW5H,EAAYC,OAEjE,CACH,IAAI8H,EAAW/H,EACXA,EAAWgI,GAAQhsB,EAAQH,GAAMsqB,EAAWtqB,EAAM,GAAKG,EAAQ0K,EAAQuZ,GACvEte,EAEAomB,IAAapmB,IACfomB,EAAW5B,GAEbtH,GAAiB7iB,EAAQH,EAAKksB,MAE/BxI,IAkBL,SAASuI,GAAc9rB,EAAQ0K,EAAQ7K,EAAKgsB,EAAUI,EAAWjI,EAAYC,GAC3E,IAAIhB,EAAW+I,GAAQhsB,EAAQH,GAC3BsqB,EAAW6B,GAAQthB,EAAQ7K,GAC3BilB,EAAUb,EAAM9kB,IAAIgrB,GAExB,GAAIrF,EACFjC,GAAiB7iB,EAAQH,EAAKilB,OADhC,CAIA,IAAIiH,EAAW/H,EACXA,EAAWf,EAAUkH,EAAWtqB,EAAM,GAAKG,EAAQ0K,EAAQuZ,GAC3Dte,EAEA8f,EAAWsG,IAAapmB,EAE5B,GAAI8f,EAAU,CACZ,IAAI3G,EAAQzB,GAAQ8M,GAChBhI,GAAUrD,GAAS1D,GAAS+O,GAC5B+B,GAAWpN,IAAUqD,GAAUxQ,GAAawY,GAEhD4B,EAAW5B,EACPrL,GAASqD,GAAU+J,EACjB7O,GAAQ4F,GACV8I,EAAW9I,EAEJkJ,GAAkBlJ,GACzB8I,EAAWtN,GAAUwE,GAEdd,GACPsD,GAAW,EACXsG,EAAWtH,GAAY0F,GAAU,IAE1B+B,GACPzG,GAAW,EACXsG,EAAWK,GAAgBjC,GAAU,IAGrC4B,EAAW,GAGNM,GAAclC,IAAajI,GAAYiI,IAC9C4B,EAAW9I,EACPf,GAAYe,GACd8I,EAAWO,GAAcrJ,GAEjBtF,GAASsF,KAAa+D,GAAW/D,KACzC8I,EAAWrH,GAAgByF,KAI7B1E,GAAW,EAGXA,IAEFxB,EAAM1M,IAAI4S,EAAU4B,GACpBE,EAAUF,EAAU5B,EAAU0B,EAAU7H,EAAYC,GACpDA,EAAM,UAAUkG,IAElBtH,GAAiB7iB,EAAQH,EAAKksB,IAWhC,SAASQ,GAAQta,EAAOlS,GACtB,IAAI2C,EAASuP,EAAMvP,OACnB,GAAKA,EAIL,OADA3C,GAAKA,EAAI,EAAI2C,EAAS,EACf4f,GAAQviB,EAAG2C,GAAUuP,EAAMlS,GAAK4F,EAYzC,SAAS6mB,GAAYvY,EAAYmL,EAAWqN,GAExCrN,EADEA,EAAU1c,OACAsQ,GAASoM,GAAW,SAASjN,GACvC,OAAIkL,GAAQlL,GACH,SAAS5S,GACd,OAAO0nB,GAAQ1nB,EAA2B,IAApB4S,EAASzP,OAAeyP,EAAS,GAAKA,IAGzDA,KAGG,CAACyY,IAGf,IAAI3pB,GAAS,EACbme,EAAYpM,GAASoM,EAAW5J,GAAUkX,OAE1C,IAAI/Z,EAAS0Y,GAAQpX,GAAY,SAAS1U,EAAOM,EAAKoU,GACpD,IAAI0Y,EAAW3Z,GAASoM,GAAW,SAASjN,GAC1C,OAAOA,EAAS5S,MAElB,MAAO,CAAE,SAAYotB,EAAU,QAAW1rB,EAAO,MAAS1B,MAG5D,OAAOsV,GAAWlC,GAAQ,SAAS3S,EAAQ2nB,GACzC,OAAOiF,GAAgB5sB,EAAQ2nB,EAAO8E,MAa1C,SAASI,GAAS7sB,EAAQyjB,GACxB,OAAOqJ,GAAW9sB,EAAQyjB,GAAO,SAASlkB,EAAO2nB,GAC/C,OAAOyE,GAAM3rB,EAAQknB,MAazB,SAAS4F,GAAW9sB,EAAQyjB,EAAOjR,GACjC,IAAIvR,GAAS,EACTyB,EAAS+gB,EAAM/gB,OACfiQ,EAAS,GAEb,QAAS1R,EAAQyB,EAAQ,CACvB,IAAIwkB,EAAOzD,EAAMxiB,GACb1B,EAAQ0nB,GAAQjnB,EAAQknB,GAExB1U,EAAUjT,EAAO2nB,IACnB6F,GAAQpa,EAAQwU,GAASD,EAAMlnB,GAAST,GAG5C,OAAOoT,EAUT,SAASqa,GAAiB9F,GACxB,OAAO,SAASlnB,GACd,OAAOinB,GAAQjnB,EAAQknB,IAe3B,SAAS+F,GAAYhb,EAAOkB,EAAQhB,EAAUY,GAC5C,IAAIma,EAAUna,EAAayB,GAAkB3B,GACzC5R,GAAS,EACTyB,EAASyQ,EAAOzQ,OAChB4lB,EAAOrW,EAEPA,IAAUkB,IACZA,EAASsL,GAAUtL,IAEjBhB,IACFmW,EAAOtV,GAASf,EAAOuD,GAAUrD,KAEnC,QAASlR,EAAQyB,EAAQ,CACvB,IAAI0R,EAAY,EACZ7U,EAAQ4T,EAAOlS,GACfye,EAAWvN,EAAWA,EAAS5S,GAASA,EAE5C,OAAQ6U,EAAY8Y,EAAQ5E,EAAM5I,EAAUtL,EAAWrB,KAAgB,EACjEuV,IAASrW,GACXiI,GAAOzb,KAAK6pB,EAAMlU,EAAW,GAE/B8F,GAAOzb,KAAKwT,EAAOmC,EAAW,GAGlC,OAAOnC,EAYT,SAASkb,GAAWlb,EAAOmb,GACzB,IAAI1qB,EAASuP,EAAQmb,EAAQ1qB,OAAS,EAClCsV,EAAYtV,EAAS,EAEzB,MAAOA,IAAU,CACf,IAAIzB,EAAQmsB,EAAQ1qB,GACpB,GAAIA,GAAUsV,GAAa/W,IAAUosB,EAAU,CAC7C,IAAIA,EAAWpsB,EACXqhB,GAAQrhB,GACViZ,GAAOzb,KAAKwT,EAAOhR,EAAO,GAE1BqsB,GAAUrb,EAAOhR,IAIvB,OAAOgR,EAYT,SAASuQ,GAAWoB,EAAOC,GACzB,OAAOD,EAAQ7I,GAAYe,MAAkB+H,EAAQD,EAAQ,IAc/D,SAAS2J,GAAU/rB,EAAO2d,EAAKlc,EAAMoR,GACnC,IAAIpT,GAAS,EACTyB,EAAS8Y,GAAUX,IAAYsE,EAAM3d,IAAUyB,GAAQ,IAAK,GAC5D0P,EAASM,EAAMvQ,GAEnB,MAAOA,IACLiQ,EAAO0B,EAAY3R,IAAWzB,GAASO,EACvCA,GAASyB,EAEX,OAAO0P,EAWT,SAAS6a,GAAW5Z,EAAQ7T,GAC1B,IAAI4S,EAAS,GACb,IAAKiB,GAAU7T,EAAI,GAAKA,EAAI4H,EAC1B,OAAOgL,EAIT,GACM5S,EAAI,IACN4S,GAAUiB,GAEZ7T,EAAIgb,GAAYhb,EAAI,GAChBA,IACF6T,GAAUA,SAEL7T,GAET,OAAO4S,EAWT,SAAS8a,GAAS5b,EAAMrQ,GACtB,OAAOksB,GAAYC,GAAS9b,EAAMrQ,EAAOopB,IAAW/Y,EAAO,IAU7D,SAAS+b,GAAW3Z,GAClB,OAAOsO,GAAYpP,GAAOc,IAW5B,SAAS4Z,GAAe5Z,EAAYlU,GAClC,IAAIkS,EAAQkB,GAAOc,GACnB,OAAOyO,GAAYzQ,EAAO0Q,GAAU5iB,EAAG,EAAGkS,EAAMvP,SAalD,SAASqqB,GAAQ/sB,EAAQknB,EAAM3nB,EAAOykB,GACpC,IAAKrG,GAAS3d,GACZ,OAAOA,EAETknB,EAAOC,GAASD,EAAMlnB,GAEtB,IAAIiB,GAAS,EACTyB,EAASwkB,EAAKxkB,OACdsV,EAAYtV,EAAS,EACrBorB,EAAS9tB,EAEb,MAAiB,MAAV8tB,KAAoB7sB,EAAQyB,EAAQ,CACzC,IAAI7C,EAAMunB,GAAMF,EAAKjmB,IACjB8qB,EAAWxsB,EAEf,GAAY,cAARM,GAA+B,gBAARA,GAAiC,cAARA,EAClD,OAAOG,EAGT,GAAIiB,GAAS+W,EAAW,CACtB,IAAIiL,EAAW6K,EAAOjuB,GACtBksB,EAAW/H,EAAaA,EAAWf,EAAUpjB,EAAKiuB,GAAUnoB,EACxDomB,IAAapmB,IACfomB,EAAWpO,GAASsF,GAChBA,EACCX,GAAQ4E,EAAKjmB,EAAQ,IAAM,GAAK,IAGzC+hB,GAAY8K,EAAQjuB,EAAKksB,GACzB+B,EAASA,EAAOjuB,GAElB,OAAOG,EAWT,IAAI+tB,GAAexR,GAAqB,SAAS1K,EAAMxM,GAErD,OADAkX,GAAQhF,IAAI1F,EAAMxM,GACXwM,GAFoB+Y,GAazBoD,GAAmB/uB,GAA4B,SAAS4S,EAAM+B,GAChE,OAAO3U,GAAe4S,EAAM,WAAY,CACtC,cAAgB,EAChB,YAAc,EACd,MAASoc,GAASra,GAClB,UAAY,KALwBgX,GAgBxC,SAASsD,GAAYja,GACnB,OAAOyO,GAAYvP,GAAOc,IAY5B,SAASka,GAAUlc,EAAOzQ,EAAO2d,GAC/B,IAAIle,GAAS,EACTyB,EAASuP,EAAMvP,OAEflB,EAAQ,IACVA,GAASA,EAAQkB,EAAS,EAAKA,EAASlB,GAE1C2d,EAAMA,EAAMzc,EAASA,EAASyc,EAC1BA,EAAM,IACRA,GAAOzc,GAETA,EAASlB,EAAQ2d,EAAM,EAAMA,EAAM3d,IAAW,EAC9CA,KAAW,EAEX,IAAImR,EAASM,EAAMvQ,GACnB,QAASzB,EAAQyB,EACfiQ,EAAO1R,GAASgR,EAAMhR,EAAQO,GAEhC,OAAOmR,EAYT,SAASyb,GAASna,EAAYzB,GAC5B,IAAIG,EAMJ,OAJAwQ,GAASlP,GAAY,SAAS1U,EAAO0B,EAAOgT,GAE1C,OADAtB,EAASH,EAAUjT,EAAO0B,EAAOgT,IACzBtB,OAEDA,EAeX,SAAS0b,GAAgBpc,EAAO1S,EAAO+uB,GACrC,IAAIC,EAAM,EACNC,EAAgB,MAATvc,EAAgBsc,EAAMtc,EAAMvP,OAEvC,GAAoB,iBAATnD,GAAqBA,IAAUA,GAASivB,GAAQxmB,EAAuB,CAChF,MAAOumB,EAAMC,EAAM,CACjB,IAAIC,EAAOF,EAAMC,IAAU,EACvB9O,EAAWzN,EAAMwc,GAEJ,OAAb/O,IAAsByG,GAASzG,KAC9B4O,EAAc5O,GAAYngB,EAAUmgB,EAAWngB,GAClDgvB,EAAME,EAAM,EAEZD,EAAOC,EAGX,OAAOD,EAET,OAAOE,GAAkBzc,EAAO1S,EAAOqrB,GAAU0D,GAgBnD,SAASI,GAAkBzc,EAAO1S,EAAO4S,EAAUmc,GACjD,IAAIC,EAAM,EACNC,EAAgB,MAATvc,EAAgB,EAAIA,EAAMvP,OACrC,GAAa,IAAT8rB,EACF,OAAO,EAGTjvB,EAAQ4S,EAAS5S,GACjB,IAAIovB,EAAWpvB,IAAUA,EACrBqvB,EAAsB,OAAVrvB,EACZsvB,EAAc1I,GAAS5mB,GACvBuvB,EAAiBvvB,IAAUoG,EAE/B,MAAO4oB,EAAMC,EAAM,CACjB,IAAIC,EAAM1T,IAAawT,EAAMC,GAAQ,GACjC9O,EAAWvN,EAASF,EAAMwc,IAC1BM,EAAerP,IAAa/Z,EAC5BqpB,EAAyB,OAAbtP,EACZuP,EAAiBvP,IAAaA,EAC9BwP,EAAc/I,GAASzG,GAE3B,GAAIiP,EACF,IAAIQ,EAASb,GAAcW,OAE3BE,EADSL,EACAG,IAAmBX,GAAcS,GACjCH,EACAK,GAAkBF,IAAiBT,IAAeU,GAClDH,EACAI,GAAkBF,IAAiBC,IAAcV,IAAeY,IAChEF,IAAaE,IAGbZ,EAAc5O,GAAYngB,EAAUmgB,EAAWngB,GAEtD4vB,EACFZ,EAAME,EAAM,EAEZD,EAAOC,EAGX,OAAO/S,GAAU8S,EAAMzmB,GAYzB,SAASqnB,GAAend,EAAOE,GAC7B,IAAIlR,GAAS,EACTyB,EAASuP,EAAMvP,OACfgQ,EAAW,EACXC,EAAS,GAEb,QAAS1R,EAAQyB,EAAQ,CACvB,IAAInD,EAAQ0S,EAAMhR,GACdye,EAAWvN,EAAWA,EAAS5S,GAASA,EAE5C,IAAK0B,IAAU6hB,GAAGpD,EAAU4I,GAAO,CACjC,IAAIA,EAAO5I,EACX/M,EAAOD,KAAwB,IAAVnT,EAAc,EAAIA,GAG3C,OAAOoT,EAWT,SAAS0c,GAAa9vB,GACpB,MAAoB,iBAATA,EACFA,EAEL4mB,GAAS5mB,GACJsI,GAEDtI,EAWV,SAAS+vB,GAAa/vB,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAI8d,GAAQ9d,GAEV,OAAOyT,GAASzT,EAAO+vB,IAAgB,GAEzC,GAAInJ,GAAS5mB,GACX,OAAO2d,GAAiBA,GAAeze,KAAKc,GAAS,GAEvD,IAAIoT,EAAUpT,EAAQ,GACtB,MAAkB,KAAVoT,GAAkB,EAAIpT,IAAWmI,EAAY,KAAOiL,EAY9D,SAAS4c,GAAStd,EAAOE,EAAUY,GACjC,IAAI9R,GAAS,EACTukB,EAAW5S,GACXlQ,EAASuP,EAAMvP,OACf+iB,GAAW,EACX9S,EAAS,GACT2V,EAAO3V,EAEX,GAAII,EACF0S,GAAW,EACXD,EAAW1S,QAER,GAAIpQ,GAAUmD,EAAkB,CACnC,IAAI0R,EAAMpF,EAAW,KAAOqd,GAAUvd,GACtC,GAAIsF,EACF,OAAOD,GAAWC,GAEpBkO,GAAW,EACXD,EAAW9P,GACX4S,EAAO,IAAIlH,QAGXkH,EAAOnW,EAAW,GAAKQ,EAEzB6M,EACA,QAASve,EAAQyB,EAAQ,CACvB,IAAInD,EAAQ0S,EAAMhR,GACdye,EAAWvN,EAAWA,EAAS5S,GAASA,EAG5C,GADAA,EAASwT,GAAwB,IAAVxT,EAAeA,EAAQ,EAC1CkmB,GAAY/F,IAAaA,EAAU,CACrC,IAAI+P,EAAYnH,EAAK5lB,OACrB,MAAO+sB,IACL,GAAInH,EAAKmH,KAAe/P,EACtB,SAASF,EAGTrN,GACFmW,EAAK/lB,KAAKmd,GAEZ/M,EAAOpQ,KAAKhD,QAEJimB,EAAS8C,EAAM5I,EAAU3M,KAC7BuV,IAAS3V,GACX2V,EAAK/lB,KAAKmd,GAEZ/M,EAAOpQ,KAAKhD,IAGhB,OAAOoT,EAWT,SAAS2a,GAAUttB,EAAQknB,GAGzB,OAFAA,EAAOC,GAASD,EAAMlnB,GACtBA,EAASyoB,GAAOzoB,EAAQknB,GACP,MAAVlnB,UAAyBA,EAAOonB,GAAMsB,GAAKxB,KAapD,SAASwI,GAAW1vB,EAAQknB,EAAMyI,EAAS3L,GACzC,OAAO+I,GAAQ/sB,EAAQknB,EAAMyI,EAAQ1I,GAAQjnB,EAAQknB,IAAQlD,GAc/D,SAAS4L,GAAU3d,EAAOO,EAAWqd,EAAQxb,GAC3C,IAAI3R,EAASuP,EAAMvP,OACfzB,EAAQoT,EAAY3R,GAAU,EAElC,OAAQ2R,EAAYpT,MAAYA,EAAQyB,IACtC8P,EAAUP,EAAMhR,GAAQA,EAAOgR,IAEjC,OAAO4d,EACH1B,GAAUlc,EAAQoC,EAAY,EAAIpT,EAASoT,EAAYpT,EAAQ,EAAIyB,GACnEyrB,GAAUlc,EAAQoC,EAAYpT,EAAQ,EAAI,EAAKoT,EAAY3R,EAASzB,GAa1E,SAASse,GAAiBhgB,EAAOuwB,GAC/B,IAAInd,EAASpT,EAIb,OAHIoT,aAAkB2K,KACpB3K,EAASA,EAAOpT,SAEX8T,GAAYyc,GAAS,SAASnd,EAAQod,GAC3C,OAAOA,EAAOle,KAAKD,MAAMme,EAAOje,QAASoB,GAAU,CAACP,GAASod,EAAOhe,SACnEY,GAaL,SAASqd,GAAQhI,EAAQ7V,EAAUY,GACjC,IAAIrQ,EAASslB,EAAOtlB,OACpB,GAAIA,EAAS,EACX,OAAOA,EAAS6sB,GAASvH,EAAO,IAAM,GAExC,IAAI/mB,GAAS,EACT0R,EAASM,EAAMvQ,GAEnB,QAASzB,EAAQyB,EAAQ,CACvB,IAAIuP,EAAQ+V,EAAO/mB,GACfinB,GAAY,EAEhB,QAASA,EAAWxlB,EACdwlB,GAAYjnB,IACd0R,EAAO1R,GAASskB,GAAe5S,EAAO1R,IAAUgR,EAAO+V,EAAOE,GAAW/V,EAAUY,IAIzF,OAAOwc,GAAS/I,GAAY7T,EAAQ,GAAIR,EAAUY,GAYpD,SAASkd,GAAc9a,EAAOhC,EAAQ+c,GACpC,IAAIjvB,GAAS,EACTyB,EAASyS,EAAMzS,OACfytB,EAAahd,EAAOzQ,OACpBiQ,EAAS,GAEb,QAAS1R,EAAQyB,EAAQ,CACvB,IAAInD,EAAQ0B,EAAQkvB,EAAahd,EAAOlS,GAAS0E,EACjDuqB,EAAWvd,EAAQwC,EAAMlU,GAAQ1B,GAEnC,OAAOoT,EAUT,SAASyd,GAAoB7wB,GAC3B,OAAO4sB,GAAkB5sB,GAASA,EAAQ,GAU5C,SAAS8wB,GAAa9wB,GACpB,MAAuB,mBAATA,EAAsBA,EAAQqrB,GAW9C,SAASzD,GAAS5nB,EAAOS,GACvB,OAAIqd,GAAQ9d,GACHA,EAEFksB,GAAMlsB,EAAOS,GAAU,CAACT,GAAS+wB,GAAatX,GAASzZ,IAYhE,IAAIgxB,GAAW9C,GAWf,SAAS+C,GAAUve,EAAOzQ,EAAO2d,GAC/B,IAAIzc,EAASuP,EAAMvP,OAEnB,OADAyc,EAAMA,IAAQxZ,EAAYjD,EAASyc,GAC1B3d,GAAS2d,GAAOzc,EAAUuP,EAAQkc,GAAUlc,EAAOzQ,EAAO2d,GASrE,IAAI1E,GAAeD,IAAmB,SAASiW,GAC7C,OAAO9yB,GAAK8c,aAAagW,IAW3B,SAAShM,GAAYiM,EAAQxM,GAC3B,GAAIA,EACF,OAAOwM,EAAOrb,QAEhB,IAAI3S,EAASguB,EAAOhuB,OAChBiQ,EAASkH,GAAcA,GAAYnX,GAAU,IAAIguB,EAAO/sB,YAAYjB,GAGxE,OADAguB,EAAOC,KAAKhe,GACLA,EAUT,SAASie,GAAiBC,GACxB,IAAIle,EAAS,IAAIke,EAAYltB,YAAYktB,EAAYC,YAErD,OADA,IAAIlX,GAAWjH,GAAQ4E,IAAI,IAAIqC,GAAWiX,IACnCle,EAWT,SAASoe,GAAcC,EAAU9M,GAC/B,IAAIwM,EAASxM,EAAS0M,GAAiBI,EAASN,QAAUM,EAASN,OACnE,OAAO,IAAIM,EAASrtB,YAAY+sB,EAAQM,EAASC,WAAYD,EAASF,YAUxE,SAASI,GAAYC,GACnB,IAAIxe,EAAS,IAAIwe,EAAOxtB,YAAYwtB,EAAOzmB,OAAQmB,GAAQuN,KAAK+X,IAEhE,OADAxe,EAAOqF,UAAYmZ,EAAOnZ,UACnBrF,EAUT,SAASye,GAAYC,GACnB,OAAOrU,GAAgBhe,GAAOge,GAAcve,KAAK4yB,IAAW,GAW9D,SAASjF,GAAgBkF,EAAYpN,GACnC,IAAIwM,EAASxM,EAAS0M,GAAiBU,EAAWZ,QAAUY,EAAWZ,OACvE,OAAO,IAAIY,EAAW3tB,YAAY+sB,EAAQY,EAAWL,WAAYK,EAAW5uB,QAW9E,SAAS6uB,GAAiBhyB,EAAOooB,GAC/B,GAAIpoB,IAAUooB,EAAO,CACnB,IAAI6J,EAAejyB,IAAUoG,EACzBipB,EAAsB,OAAVrvB,EACZkyB,EAAiBlyB,IAAUA,EAC3BsvB,EAAc1I,GAAS5mB,GAEvBwvB,EAAepH,IAAUhiB,EACzBqpB,EAAsB,OAAVrH,EACZsH,EAAiBtH,IAAUA,EAC3BuH,EAAc/I,GAASwB,GAE3B,IAAMqH,IAAcE,IAAgBL,GAAetvB,EAAQooB,GACtDkH,GAAeE,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5BuC,GAAgBvC,IACjBwC,EACH,OAAO,EAET,IAAM7C,IAAcC,IAAgBK,GAAe3vB,EAAQooB,GACtDuH,GAAesC,GAAgBC,IAAmB7C,IAAcC,GAChEG,GAAawC,GAAgBC,IAC5B1C,GAAgB0C,IACjBxC,EACH,OAAQ,EAGZ,OAAO,EAiBT,SAASrC,GAAgB5sB,EAAQ2nB,EAAO8E,GACtC,IAAIxrB,GAAS,EACTywB,EAAc1xB,EAAO2sB,SACrBgF,EAAchK,EAAMgF,SACpBjqB,EAASgvB,EAAYhvB,OACrBkvB,EAAenF,EAAO/pB,OAE1B,QAASzB,EAAQyB,EAAQ,CACvB,IAAIiQ,EAAS4e,GAAiBG,EAAYzwB,GAAQ0wB,EAAY1wB,IAC9D,GAAI0R,EAAQ,CACV,GAAI1R,GAAS2wB,EACX,OAAOjf,EAET,IAAIkf,EAAQpF,EAAOxrB,GACnB,OAAO0R,GAAmB,QAATkf,GAAmB,EAAI,IAU5C,OAAO7xB,EAAOiB,MAAQ0mB,EAAM1mB,MAc9B,SAAS6wB,GAAY/f,EAAMggB,EAAUC,EAASC,GAC5C,IAAIC,GAAa,EACbC,EAAapgB,EAAKrP,OAClB0vB,EAAgBJ,EAAQtvB,OACxB2vB,GAAa,EACbC,EAAaP,EAASrvB,OACtB6vB,EAAc/W,GAAU2W,EAAaC,EAAe,GACpDzf,EAASM,EAAMqf,EAAaC,GAC5BC,GAAeP,EAEnB,QAASI,EAAYC,EACnB3f,EAAO0f,GAAaN,EAASM,GAE/B,QAASH,EAAYE,GACfI,GAAeN,EAAYC,KAC7Bxf,EAAOqf,EAAQE,IAAcngB,EAAKmgB,IAGtC,MAAOK,IACL5f,EAAO0f,KAAetgB,EAAKmgB,KAE7B,OAAOvf,EAcT,SAAS8f,GAAiB1gB,EAAMggB,EAAUC,EAASC,GACjD,IAAIC,GAAa,EACbC,EAAapgB,EAAKrP,OAClBgwB,GAAgB,EAChBN,EAAgBJ,EAAQtvB,OACxBiwB,GAAc,EACdC,EAAcb,EAASrvB,OACvB6vB,EAAc/W,GAAU2W,EAAaC,EAAe,GACpDzf,EAASM,EAAMsf,EAAcK,GAC7BJ,GAAeP,EAEnB,QAASC,EAAYK,EACnB5f,EAAOuf,GAAangB,EAAKmgB,GAE3B,IAAI9e,EAAS8e,EACb,QAASS,EAAaC,EACpBjgB,EAAOS,EAASuf,GAAcZ,EAASY,GAEzC,QAASD,EAAeN,GAClBI,GAAeN,EAAYC,KAC7Bxf,EAAOS,EAAS4e,EAAQU,IAAiB3gB,EAAKmgB,MAGlD,OAAOvf,EAWT,SAAS8L,GAAU/T,EAAQuH,GACzB,IAAIhR,GAAS,EACTyB,EAASgI,EAAOhI,OAEpBuP,IAAUA,EAAQgB,EAAMvQ,IACxB,QAASzB,EAAQyB,EACfuP,EAAMhR,GAASyJ,EAAOzJ,GAExB,OAAOgR,EAaT,SAASoR,GAAW3Y,EAAQyK,EAAOnV,EAAQgkB,GACzC,IAAI6O,GAAS7yB,EACbA,IAAWA,EAAS,IAEpB,IAAIiB,GAAS,EACTyB,EAASyS,EAAMzS,OAEnB,QAASzB,EAAQyB,EAAQ,CACvB,IAAI7C,EAAMsV,EAAMlU,GAEZ8qB,EAAW/H,EACXA,EAAWhkB,EAAOH,GAAM6K,EAAO7K,GAAMA,EAAKG,EAAQ0K,GAClD/E,EAEAomB,IAAapmB,IACfomB,EAAWrhB,EAAO7K,IAEhBgzB,EACF9P,GAAgB/iB,EAAQH,EAAKksB,GAE7B/I,GAAYhjB,EAAQH,EAAKksB,GAG7B,OAAO/rB,EAWT,SAAS4kB,GAAYla,EAAQ1K,GAC3B,OAAOqjB,GAAW3Y,EAAQooB,GAAWpoB,GAAS1K,GAWhD,SAAS2kB,GAAcja,EAAQ1K,GAC7B,OAAOqjB,GAAW3Y,EAAQqoB,GAAaroB,GAAS1K,GAWlD,SAASgzB,GAAiB9gB,EAAQ+gB,GAChC,OAAO,SAAShf,EAAY9B,GAC1B,IAAIN,EAAOwL,GAAQpJ,GAAcjC,GAAkBkR,GAC/C9Q,EAAc6gB,EAAcA,IAAgB,GAEhD,OAAOphB,EAAKoC,EAAY/B,EAAQwa,GAAYva,EAAU,GAAIC,IAW9D,SAAS8gB,GAAeC,GACtB,OAAO1F,IAAS,SAASztB,EAAQozB,GAC/B,IAAInyB,GAAS,EACTyB,EAAS0wB,EAAQ1wB,OACjBshB,EAAathB,EAAS,EAAI0wB,EAAQ1wB,EAAS,GAAKiD,EAChD0tB,EAAQ3wB,EAAS,EAAI0wB,EAAQ,GAAKztB,EAEtCqe,EAAcmP,EAASzwB,OAAS,GAA0B,mBAAdshB,GACvCthB,IAAUshB,GACXre,EAEA0tB,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClDrP,EAAathB,EAAS,EAAIiD,EAAYqe,EACtCthB,EAAS,GAEX1C,EAAShB,GAAOgB,GAChB,QAASiB,EAAQyB,EAAQ,CACvB,IAAIgI,EAAS0oB,EAAQnyB,GACjByJ,GACFyoB,EAASnzB,EAAQ0K,EAAQzJ,EAAO+iB,GAGpC,OAAOhkB,KAYX,SAAS6lB,GAAe3R,EAAUG,GAChC,OAAO,SAASJ,EAAY9B,GAC1B,GAAkB,MAAd8B,EACF,OAAOA,EAET,IAAKqX,GAAYrX,GACf,OAAOC,EAASD,EAAY9B,GAE9B,IAAIzP,EAASuR,EAAWvR,OACpBzB,EAAQoT,EAAY3R,GAAU,EAC9B6wB,EAAWv0B,GAAOiV,GAEtB,MAAQI,EAAYpT,MAAYA,EAAQyB,EACtC,IAAmD,IAA/CyP,EAASohB,EAAStyB,GAAQA,EAAOsyB,GACnC,MAGJ,OAAOtf,GAWX,SAAS4S,GAAcxS,GACrB,OAAO,SAASrU,EAAQmS,EAAU6S,GAChC,IAAI/jB,GAAS,EACTsyB,EAAWv0B,GAAOgB,GAClBmV,EAAQ6P,EAAShlB,GACjB0C,EAASyS,EAAMzS,OAEnB,MAAOA,IAAU,CACf,IAAI7C,EAAMsV,EAAMd,EAAY3R,IAAWzB,GACvC,IAA+C,IAA3CkR,EAASohB,EAAS1zB,GAAMA,EAAK0zB,GAC/B,MAGJ,OAAOvzB,GAcX,SAASwzB,GAAW3hB,EAAMkS,EAASjS,GACjC,IAAI2hB,EAAS1P,EAAUtd,EACnBitB,EAAOC,GAAW9hB,GAEtB,SAAS+hB,IACP,IAAIC,EAAM31B,MAAQA,OAASP,IAAQO,gBAAgB01B,EAAWF,EAAO7hB,EACrE,OAAOgiB,EAAGjiB,MAAM6hB,EAAS3hB,EAAU5T,KAAM41B,WAE3C,OAAOF,EAUT,SAASG,GAAgBC,GACvB,OAAO,SAASpgB,GACdA,EAASoF,GAASpF,GAElB,IAAIkC,EAAaU,GAAW5C,GACxBgE,GAAchE,GACdjO,EAEA2Q,EAAMR,EACNA,EAAW,GACXlC,EAAOkE,OAAO,GAEdmc,EAAWne,EACX0a,GAAU1a,EAAY,GAAGpH,KAAK,IAC9BkF,EAAOyB,MAAM,GAEjB,OAAOiB,EAAI0d,KAAgBC,GAW/B,SAASC,GAAiBC,GACxB,OAAO,SAASvgB,GACd,OAAOP,GAAY+gB,GAAMC,GAAOzgB,GAAQ2B,QAAQvG,GAAQ,KAAMmlB,EAAU,KAY5E,SAASR,GAAWD,GAClB,OAAO,WAIL,IAAI3hB,EAAO+hB,UACX,OAAQ/hB,EAAKrP,QACX,KAAK,EAAG,OAAO,IAAIgxB,EACnB,KAAK,EAAG,OAAO,IAAIA,EAAK3hB,EAAK,IAC7B,KAAK,EAAG,OAAO,IAAI2hB,EAAK3hB,EAAK,GAAIA,EAAK,IACtC,KAAK,EAAG,OAAO,IAAI2hB,EAAK3hB,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC/C,KAAK,EAAG,OAAO,IAAI2hB,EAAK3hB,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACxD,KAAK,EAAG,OAAO,IAAI2hB,EAAK3hB,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACjE,KAAK,EAAG,OAAO,IAAI2hB,EAAK3hB,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC1E,KAAK,EAAG,OAAO,IAAI2hB,EAAK3hB,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAErF,IAAIuiB,EAAc7W,GAAWiW,EAAKxzB,WAC9ByS,EAAS+gB,EAAK9hB,MAAM0iB,EAAaviB,GAIrC,OAAO4L,GAAShL,GAAUA,EAAS2hB,GAavC,SAASC,GAAY1iB,EAAMkS,EAASyQ,GAClC,IAAId,EAAOC,GAAW9hB,GAEtB,SAAS+hB,IACP,IAAIlxB,EAASoxB,UAAUpxB,OACnBqP,EAAOkB,EAAMvQ,GACbzB,EAAQyB,EACRwT,EAAcue,GAAUb,GAE5B,MAAO3yB,IACL8Q,EAAK9Q,GAAS6yB,UAAU7yB,GAE1B,IAAI+wB,EAAWtvB,EAAS,GAAKqP,EAAK,KAAOmE,GAAenE,EAAKrP,EAAS,KAAOwT,EACzE,GACAmB,GAAetF,EAAMmE,GAGzB,GADAxT,GAAUsvB,EAAQtvB,OACdA,EAAS8xB,EACX,OAAOE,GACL7iB,EAAMkS,EAAS4Q,GAAcf,EAAQ1d,YAAavQ,EAClDoM,EAAMigB,EAASrsB,EAAWA,EAAW6uB,EAAQ9xB,GAEjD,IAAImxB,EAAM31B,MAAQA,OAASP,IAAQO,gBAAgB01B,EAAWF,EAAO7hB,EACrE,OAAOD,GAAMiiB,EAAI31B,KAAM6T,GAEzB,OAAO6hB,EAUT,SAASgB,GAAWC,GAClB,OAAO,SAAS5gB,EAAYzB,EAAW4B,GACrC,IAAImf,EAAWv0B,GAAOiV,GACtB,IAAKqX,GAAYrX,GAAa,CAC5B,IAAI9B,EAAWua,GAAYla,EAAW,GACtCyB,EAAaoF,GAAKpF,GAClBzB,EAAY,SAAS3S,GAAO,OAAOsS,EAASohB,EAAS1zB,GAAMA,EAAK0zB,IAElE,IAAItyB,EAAQ4zB,EAAc5gB,EAAYzB,EAAW4B,GACjD,OAAOnT,GAAS,EAAIsyB,EAASphB,EAAW8B,EAAWhT,GAASA,GAAS0E,GAWzE,SAASmvB,GAAWzgB,GAClB,OAAO0gB,IAAS,SAASC,GACvB,IAAItyB,EAASsyB,EAAMtyB,OACfzB,EAAQyB,EACRuyB,EAAS1X,GAAcrd,UAAUg1B,KAEjC7gB,GACF2gB,EAAM/Y,UAER,MAAOhb,IAAS,CACd,IAAI4Q,EAAOmjB,EAAM/zB,GACjB,GAAmB,mBAAR4Q,EACT,MAAM,IAAI6G,GAAU3S,GAEtB,GAAIkvB,IAAWrB,GAAgC,WAArBuB,GAAYtjB,GACpC,IAAI+hB,EAAU,IAAIrW,GAAc,IAAI,GAGxCtc,EAAQ2yB,EAAU3yB,EAAQyB,EAC1B,QAASzB,EAAQyB,EAAQ,CACvBmP,EAAOmjB,EAAM/zB,GAEb,IAAIm0B,EAAWD,GAAYtjB,GACvBxM,EAAmB,WAAZ+vB,EAAwBC,GAAQxjB,GAAQlM,EAMjDiuB,EAJEvuB,GAAQiwB,GAAWjwB,EAAK,KACtBA,EAAK,KAAO2B,EAAgBJ,EAAkBE,EAAoBG,KACjE5B,EAAK,GAAG3C,QAAqB,GAAX2C,EAAK,GAElBuuB,EAAQuB,GAAY9vB,EAAK,KAAKuM,MAAMgiB,EAASvuB,EAAK,IAElC,GAAfwM,EAAKnP,QAAe4yB,GAAWzjB,GACtC+hB,EAAQwB,KACRxB,EAAQsB,KAAKrjB,GAGrB,OAAO,WACL,IAAIE,EAAO+hB,UACPv0B,EAAQwS,EAAK,GAEjB,GAAI6hB,GAA0B,GAAf7hB,EAAKrP,QAAe2a,GAAQ9d,GACzC,OAAOq0B,EAAQ2B,MAAMh2B,GAAOA,QAE9B,IAAI0B,EAAQ,EACR0R,EAASjQ,EAASsyB,EAAM/zB,GAAO2Q,MAAM1T,KAAM6T,GAAQxS,EAEvD,QAAS0B,EAAQyB,EACfiQ,EAASqiB,EAAM/zB,GAAOxC,KAAKP,KAAMyU,GAEnC,OAAOA,MAwBb,SAASgiB,GAAa9iB,EAAMkS,EAASjS,EAASigB,EAAUC,EAASwD,EAAeC,EAAcC,EAAQC,EAAKnB,GACzG,IAAIoB,EAAQ7R,EAAU/c,EAClBysB,EAAS1P,EAAUtd,EACnBovB,EAAY9R,EAAUrd,EACtBurB,EAAYlO,GAAWnd,EAAkBC,GACzCivB,EAAS/R,EAAU7c,EACnBwsB,EAAOmC,EAAYlwB,EAAYguB,GAAW9hB,GAE9C,SAAS+hB,IACP,IAAIlxB,EAASoxB,UAAUpxB,OACnBqP,EAAOkB,EAAMvQ,GACbzB,EAAQyB,EAEZ,MAAOzB,IACL8Q,EAAK9Q,GAAS6yB,UAAU7yB,GAE1B,GAAIgxB,EACF,IAAI/b,EAAcue,GAAUb,GACxBmC,EAAe9f,GAAalE,EAAMmE,GASxC,GAPI6b,IACFhgB,EAAO+f,GAAY/f,EAAMggB,EAAUC,EAASC,IAE1CuD,IACFzjB,EAAO0gB,GAAiB1gB,EAAMyjB,EAAeC,EAAcxD,IAE7DvvB,GAAUqzB,EACN9D,GAAavvB,EAAS8xB,EAAO,CAC/B,IAAIwB,EAAa3e,GAAetF,EAAMmE,GACtC,OAAOwe,GACL7iB,EAAMkS,EAAS4Q,GAAcf,EAAQ1d,YAAapE,EAClDC,EAAMikB,EAAYN,EAAQC,EAAKnB,EAAQ9xB,GAG3C,IAAI4xB,EAAcb,EAAS3hB,EAAU5T,KACjC21B,EAAKgC,EAAYvB,EAAYziB,GAAQA,EAczC,OAZAnP,EAASqP,EAAKrP,OACVgzB,EACF3jB,EAAOkkB,GAAQlkB,EAAM2jB,GACZI,GAAUpzB,EAAS,GAC5BqP,EAAKkK,UAEH2Z,GAASD,EAAMjzB,IACjBqP,EAAKrP,OAASizB,GAEZz3B,MAAQA,OAASP,IAAQO,gBAAgB01B,IAC3CC,EAAKH,GAAQC,GAAWE,IAEnBA,EAAGjiB,MAAM0iB,EAAaviB,GAE/B,OAAO6hB,EAWT,SAASsC,GAAehkB,EAAQikB,GAC9B,OAAO,SAASn2B,EAAQmS,GACtB,OAAOoW,GAAavoB,EAAQkS,EAAQikB,EAAWhkB,GAAW,KAY9D,SAASikB,GAAoBC,EAAUC,GACrC,OAAO,SAAS/2B,EAAOooB,GACrB,IAAIhV,EACJ,GAAIpT,IAAUoG,GAAagiB,IAAUhiB,EACnC,OAAO2wB,EAKT,GAHI/2B,IAAUoG,IACZgN,EAASpT,GAEPooB,IAAUhiB,EAAW,CACvB,GAAIgN,IAAWhN,EACb,OAAOgiB,EAEW,iBAATpoB,GAAqC,iBAATooB,GACrCpoB,EAAQ+vB,GAAa/vB,GACrBooB,EAAQ2H,GAAa3H,KAErBpoB,EAAQ8vB,GAAa9vB,GACrBooB,EAAQ0H,GAAa1H,IAEvBhV,EAAS0jB,EAAS92B,EAAOooB,GAE3B,OAAOhV,GAWX,SAAS4jB,GAAWC,GAClB,OAAOzB,IAAS,SAAS3V,GAEvB,OADAA,EAAYpM,GAASoM,EAAW5J,GAAUkX,OACnCe,IAAS,SAAS1b,GACvB,IAAID,EAAU5T,KACd,OAAOs4B,EAAUpX,GAAW,SAASjN,GACnC,OAAOP,GAAMO,EAAUL,EAASC,YAexC,SAAS0kB,GAAc/zB,EAAQg0B,GAC7BA,EAAQA,IAAU/wB,EAAY,IAAM2pB,GAAaoH,GAEjD,IAAIC,EAAcD,EAAMh0B,OACxB,GAAIi0B,EAAc,EAChB,OAAOA,EAAcnJ,GAAWkJ,EAAOh0B,GAAUg0B,EAEnD,IAAI/jB,EAAS6a,GAAWkJ,EAAO7b,GAAWnY,EAASgV,GAAWgf,KAC9D,OAAOlgB,GAAWkgB,GACdlG,GAAU5Y,GAAcjF,GAAS,EAAGjQ,GAAQgM,KAAK,IACjDiE,EAAO0C,MAAM,EAAG3S,GAetB,SAASk0B,GAAc/kB,EAAMkS,EAASjS,EAASigB,GAC7C,IAAI0B,EAAS1P,EAAUtd,EACnBitB,EAAOC,GAAW9hB,GAEtB,SAAS+hB,IACP,IAAI1B,GAAa,EACbC,EAAa2B,UAAUpxB,OACvB2vB,GAAa,EACbC,EAAaP,EAASrvB,OACtBqP,EAAOkB,EAAMqf,EAAaH,GAC1B0B,EAAM31B,MAAQA,OAASP,IAAQO,gBAAgB01B,EAAWF,EAAO7hB,EAErE,QAASwgB,EAAYC,EACnBvgB,EAAKsgB,GAAaN,EAASM,GAE7B,MAAOF,IACLpgB,EAAKsgB,KAAeyB,YAAY5B,GAElC,OAAOtgB,GAAMiiB,EAAIJ,EAAS3hB,EAAU5T,KAAM6T,GAE5C,OAAO6hB,EAUT,SAASiD,GAAYxiB,GACnB,OAAO,SAAS7S,EAAO2d,EAAKlc,GAa1B,OAZIA,GAAuB,iBAARA,GAAoBqwB,GAAe9xB,EAAO2d,EAAKlc,KAChEkc,EAAMlc,EAAO0C,GAGfnE,EAAQs1B,GAASt1B,GACb2d,IAAQxZ,GACVwZ,EAAM3d,EACNA,EAAQ,GAER2d,EAAM2X,GAAS3X,GAEjBlc,EAAOA,IAAS0C,EAAanE,EAAQ2d,EAAM,GAAK,EAAK2X,GAAS7zB,GACvDsqB,GAAU/rB,EAAO2d,EAAKlc,EAAMoR,IAWvC,SAAS0iB,GAA0BV,GACjC,OAAO,SAAS92B,EAAOooB,GAKrB,MAJsB,iBAATpoB,GAAqC,iBAATooB,IACvCpoB,EAAQy3B,GAASz3B,GACjBooB,EAAQqP,GAASrP,IAEZ0O,EAAS92B,EAAOooB,IAqB3B,SAAS+M,GAAc7iB,EAAMkS,EAASkT,EAAU/gB,EAAapE,EAASigB,EAAUC,EAAS0D,EAAQC,EAAKnB,GACpG,IAAI0C,EAAUnT,EAAUnd,EACpBovB,EAAakB,EAAUlF,EAAUrsB,EACjCwxB,EAAkBD,EAAUvxB,EAAYqsB,EACxCoF,EAAcF,EAAUnF,EAAWpsB,EACnC0xB,EAAmBH,EAAUvxB,EAAYosB,EAE7ChO,GAAYmT,EAAUpwB,EAAoBC,EAC1Cgd,KAAamT,EAAUnwB,EAA0BD,GAE3Cid,EAAUpd,IACdod,KAAatd,EAAiBC,IAEhC,IAAI4wB,EAAU,CACZzlB,EAAMkS,EAASjS,EAASslB,EAAapB,EAAYqB,EACjDF,EAAiBzB,EAAQC,EAAKnB,GAG5B7hB,EAASskB,EAASrlB,MAAMjM,EAAW2xB,GAKvC,OAJIhC,GAAWzjB,IACb0lB,GAAQ5kB,EAAQ2kB,GAElB3kB,EAAOuD,YAAcA,EACdshB,GAAgB7kB,EAAQd,EAAMkS,GAUvC,SAAS0T,GAAYzD,GACnB,IAAIniB,EAAOhR,GAAKmzB,GAChB,OAAO,SAASrQ,EAAQ+T,GAGtB,GAFA/T,EAASqT,GAASrT,GAClB+T,EAAyB,MAAbA,EAAoB,EAAIhc,GAAU2K,GAAUqR,GAAY,KAChEA,GAAarc,GAAesI,GAAS,CAGvC,IAAIgU,GAAQ3e,GAAS2K,GAAU,KAAK9P,MAAM,KACtCtU,EAAQsS,EAAK8lB,EAAK,GAAK,MAAQA,EAAK,GAAKD,IAG7C,OADAC,GAAQ3e,GAASzZ,GAAS,KAAKsU,MAAM,OAC5B8jB,EAAK,GAAK,MAAQA,EAAK,GAAKD,IAEvC,OAAO7lB,EAAK8R,IAWhB,IAAI6L,GAAcpT,IAAQ,EAAI9E,GAAW,IAAI8E,GAAI,CAAC,EAAE,KAAK,IAAO1U,EAAmB,SAASyL,GAC1F,OAAO,IAAIiJ,GAAIjJ,IAD2DykB,GAW5E,SAASC,GAAc7S,GACrB,OAAO,SAAShlB,GACd,IAAIskB,EAAMC,GAAOvkB,GACjB,OAAIskB,GAAO3b,EACFmO,GAAW9W,GAEhBskB,GAAOpb,GACFsO,GAAWxX,GAEbkV,GAAYlV,EAAQglB,EAAShlB,KA6BxC,SAAS83B,GAAWjmB,EAAMkS,EAASjS,EAASigB,EAAUC,EAAS0D,EAAQC,EAAKnB,GAC1E,IAAIqB,EAAY9R,EAAUrd,EAC1B,IAAKmvB,GAA4B,mBAARhkB,EACvB,MAAM,IAAI6G,GAAU3S,GAEtB,IAAIrD,EAASqvB,EAAWA,EAASrvB,OAAS,EAS1C,GARKA,IACHqhB,KAAajd,EAAoBC,GACjCgrB,EAAWC,EAAUrsB,GAEvBgwB,EAAMA,IAAQhwB,EAAYgwB,EAAMna,GAAU6K,GAAUsP,GAAM,GAC1DnB,EAAQA,IAAU7uB,EAAY6uB,EAAQnO,GAAUmO,GAChD9xB,GAAUsvB,EAAUA,EAAQtvB,OAAS,EAEjCqhB,EAAUhd,EAAyB,CACrC,IAAIyuB,EAAgBzD,EAChB0D,EAAezD,EAEnBD,EAAWC,EAAUrsB,EAEvB,IAAIN,EAAOwwB,EAAYlwB,EAAY0vB,GAAQxjB,GAEvCylB,EAAU,CACZzlB,EAAMkS,EAASjS,EAASigB,EAAUC,EAASwD,EAAeC,EAC1DC,EAAQC,EAAKnB,GAkBf,GAfInvB,GACF0yB,GAAUT,EAASjyB,GAErBwM,EAAOylB,EAAQ,GACfvT,EAAUuT,EAAQ,GAClBxlB,EAAUwlB,EAAQ,GAClBvF,EAAWuF,EAAQ,GACnBtF,EAAUsF,EAAQ,GAClB9C,EAAQ8C,EAAQ,GAAKA,EAAQ,KAAO3xB,EAC/BkwB,EAAY,EAAIhkB,EAAKnP,OACtB8Y,GAAU8b,EAAQ,GAAK50B,EAAQ,IAE9B8xB,GAASzQ,GAAWnd,EAAkBC,KACzCkd,KAAand,EAAkBC,IAE5Bkd,GAAWA,GAAWtd,EAGzBkM,EADSoR,GAAWnd,GAAmBmd,GAAWld,EACzC0tB,GAAY1iB,EAAMkS,EAASyQ,GAC1BzQ,GAAWjd,GAAqBid,IAAYtd,EAAiBK,IAAwBkrB,EAAQtvB,OAG9FiyB,GAAa/iB,MAAMjM,EAAW2xB,GAF9BV,GAAc/kB,EAAMkS,EAASjS,EAASigB,QAJ/C,IAAIpf,EAAS6gB,GAAW3hB,EAAMkS,EAASjS,GAQzC,IAAII,EAAS7M,EAAO0oB,GAAcwJ,GAClC,OAAOC,GAAgBtlB,EAAOS,EAAQ2kB,GAAUzlB,EAAMkS,GAexD,SAASiU,GAAuB/U,EAAUkH,EAAUtqB,EAAKG,GACvD,OAAIijB,IAAatd,GACZmd,GAAGG,EAAUpK,GAAYhZ,MAAUM,GAAe1B,KAAKuB,EAAQH,GAC3DsqB,EAEFlH,EAiBT,SAASgV,GAAoBhV,EAAUkH,EAAUtqB,EAAKG,EAAQ0K,EAAQuZ,GAOpE,OANItG,GAASsF,IAAatF,GAASwM,KAEjClG,EAAM1M,IAAI4S,EAAUlH,GACpB2I,GAAU3I,EAAUkH,EAAUxkB,EAAWsyB,GAAqBhU,GAC9DA,EAAM,UAAUkG,IAEXlH,EAYT,SAASiV,GAAgB34B,GACvB,OAAO8sB,GAAc9sB,GAASoG,EAAYpG,EAgB5C,SAASiqB,GAAYvX,EAAO0V,EAAO5D,EAASC,EAAYgF,EAAW/E,GACjE,IAAIkU,EAAYpU,EAAUxd,EACtByY,EAAY/M,EAAMvP,OAClBulB,EAAYN,EAAMjlB,OAEtB,GAAIsc,GAAaiJ,KAAekQ,GAAalQ,EAAYjJ,GACvD,OAAO,EAGT,IAAIoZ,EAAanU,EAAM9kB,IAAI8S,GACvBomB,EAAapU,EAAM9kB,IAAIwoB,GAC3B,GAAIyQ,GAAcC,EAChB,OAAOD,GAAczQ,GAAS0Q,GAAcpmB,EAE9C,IAAIhR,GAAS,EACT0R,GAAS,EACT2V,EAAQvE,EAAUvd,EAA0B,IAAI4a,GAAWzb,EAE/Dse,EAAM1M,IAAItF,EAAO0V,GACjB1D,EAAM1M,IAAIoQ,EAAO1V,GAGjB,QAAShR,EAAQ+d,EAAW,CAC1B,IAAIsZ,EAAWrmB,EAAMhR,GACjBs3B,EAAW5Q,EAAM1mB,GAErB,GAAI+iB,EACF,IAAIwU,EAAWL,EACXnU,EAAWuU,EAAUD,EAAUr3B,EAAO0mB,EAAO1V,EAAOgS,GACpDD,EAAWsU,EAAUC,EAAUt3B,EAAOgR,EAAO0V,EAAO1D,GAE1D,GAAIuU,IAAa7yB,EAAW,CAC1B,GAAI6yB,EACF,SAEF7lB,GAAS,EACT,MAGF,GAAI2V,GACF,IAAK9U,GAAUmU,GAAO,SAAS4Q,EAAUrQ,GACnC,IAAKxS,GAAS4S,EAAMJ,KACfoQ,IAAaC,GAAYvP,EAAUsP,EAAUC,EAAUxU,EAASC,EAAYC,IAC/E,OAAOqE,EAAK/lB,KAAK2lB,MAEjB,CACNvV,GAAS,EACT,YAEG,GACD2lB,IAAaC,IACXvP,EAAUsP,EAAUC,EAAUxU,EAASC,EAAYC,GACpD,CACLtR,GAAS,EACT,OAKJ,OAFAsR,EAAM,UAAUhS,GAChBgS,EAAM,UAAU0D,GACThV,EAoBT,SAAS8W,GAAWzpB,EAAQ2nB,EAAOrD,EAAKP,EAASC,EAAYgF,EAAW/E,GACtE,OAAQK,GACN,KAAK7a,GACH,GAAKzJ,EAAO8wB,YAAcnJ,EAAMmJ,YAC3B9wB,EAAOixB,YAActJ,EAAMsJ,WAC9B,OAAO,EAETjxB,EAASA,EAAO0wB,OAChB/I,EAAQA,EAAM+I,OAEhB,KAAKlnB,GACH,QAAKxJ,EAAO8wB,YAAcnJ,EAAMmJ,aAC3B9H,EAAU,IAAIpP,GAAW5Z,GAAS,IAAI4Z,GAAW+N,KAKxD,KAAKtf,EACL,KAAKC,EACL,KAAKM,GAGH,OAAOka,IAAI9iB,GAAS2nB,GAEtB,KAAKnf,EACH,OAAOxI,EAAOnB,MAAQ8oB,EAAM9oB,MAAQmB,EAAOy4B,SAAW9Q,EAAM8Q,QAE9D,KAAKxvB,GACL,KAAKE,GAIH,OAAOnJ,GAAW2nB,EAAQ,GAE5B,KAAKhf,EACH,IAAI+vB,EAAU5hB,GAEhB,KAAK5N,GACH,IAAIivB,EAAYpU,EAAUxd,EAG1B,GAFAmyB,IAAYA,EAAUphB,IAElBtX,EAAOgX,MAAQ2Q,EAAM3Q,OAASmhB,EAChC,OAAO,EAGT,IAAIrT,EAAUb,EAAM9kB,IAAIa,GACxB,GAAI8kB,EACF,OAAOA,GAAW6C,EAEpB5D,GAAWvd,EAGXyd,EAAM1M,IAAIvX,EAAQ2nB,GAClB,IAAIhV,EAAS6W,GAAYkP,EAAQ14B,GAAS04B,EAAQ/Q,GAAQ5D,EAASC,EAAYgF,EAAW/E,GAE1F,OADAA,EAAM,UAAUjkB,GACT2S,EAET,KAAKvJ,GACH,GAAI4T,GACF,OAAOA,GAAcve,KAAKuB,IAAWgd,GAAcve,KAAKkpB,GAG9D,OAAO,EAgBT,SAASmC,GAAa9pB,EAAQ2nB,EAAO5D,EAASC,EAAYgF,EAAW/E,GACnE,IAAIkU,EAAYpU,EAAUxd,EACtBoyB,EAAWzT,GAAWllB,GACtB44B,EAAYD,EAASj2B,OACrBm2B,EAAW3T,GAAWyC,GACtBM,EAAY4Q,EAASn2B,OAEzB,GAAIk2B,GAAa3Q,IAAckQ,EAC7B,OAAO,EAET,IAAIl3B,EAAQ23B,EACZ,MAAO33B,IAAS,CACd,IAAIpB,EAAM84B,EAAS13B,GACnB,KAAMk3B,EAAYt4B,KAAO8nB,EAAQxnB,GAAe1B,KAAKkpB,EAAO9nB,IAC1D,OAAO,EAIX,IAAIi5B,EAAa7U,EAAM9kB,IAAIa,GACvBq4B,EAAapU,EAAM9kB,IAAIwoB,GAC3B,GAAImR,GAAcT,EAChB,OAAOS,GAAcnR,GAAS0Q,GAAcr4B,EAE9C,IAAI2S,GAAS,EACbsR,EAAM1M,IAAIvX,EAAQ2nB,GAClB1D,EAAM1M,IAAIoQ,EAAO3nB,GAEjB,IAAI+4B,EAAWZ,EACf,QAASl3B,EAAQ23B,EAAW,CAC1B/4B,EAAM84B,EAAS13B,GACf,IAAIgiB,EAAWjjB,EAAOH,GAClB04B,EAAW5Q,EAAM9nB,GAErB,GAAImkB,EACF,IAAIwU,EAAWL,EACXnU,EAAWuU,EAAUtV,EAAUpjB,EAAK8nB,EAAO3nB,EAAQikB,GACnDD,EAAWf,EAAUsV,EAAU14B,EAAKG,EAAQ2nB,EAAO1D,GAGzD,KAAMuU,IAAa7yB,EACVsd,IAAasV,GAAYvP,EAAU/F,EAAUsV,EAAUxU,EAASC,EAAYC,GAC7EuU,GACD,CACL7lB,GAAS,EACT,MAEFomB,IAAaA,EAAkB,eAAPl5B,GAE1B,GAAI8S,IAAWomB,EAAU,CACvB,IAAIC,EAAUh5B,EAAO2D,YACjBs1B,EAAUtR,EAAMhkB,YAGhBq1B,GAAWC,KACV,gBAAiBj5B,MAAU,gBAAiB2nB,IACzB,mBAAXqR,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,IACvDtmB,GAAS,GAKb,OAFAsR,EAAM,UAAUjkB,GAChBikB,EAAM,UAAU0D,GACThV,EAUT,SAASoiB,GAASljB,GAChB,OAAO6b,GAAYC,GAAS9b,EAAMlM,EAAWuzB,IAAUrnB,EAAO,IAUhE,SAASqT,GAAWllB,GAClB,OAAOqnB,GAAernB,EAAQqZ,GAAMyZ,IAWtC,SAAS7N,GAAajlB,GACpB,OAAOqnB,GAAernB,EAAQujB,GAAQwP,IAUxC,IAAIsC,GAAW9Y,GAAiB,SAAS1K,GACvC,OAAO0K,GAAQpd,IAAI0S,IADI+lB,GAWzB,SAASzC,GAAYtjB,GACnB,IAAIc,EAAUd,EAAKhT,KAAO,GACtBoT,EAAQuK,GAAU7J,GAClBjQ,EAASvC,GAAe1B,KAAK+d,GAAW7J,GAAUV,EAAMvP,OAAS,EAErE,MAAOA,IAAU,CACf,IAAI2C,EAAO4M,EAAMvP,GACby2B,EAAY9zB,EAAKwM,KACrB,GAAiB,MAAbsnB,GAAqBA,GAAatnB,EACpC,OAAOxM,EAAKxG,KAGhB,OAAO8T,EAUT,SAAS8hB,GAAU5iB,GACjB,IAAI7R,EAASG,GAAe1B,KAAK0e,GAAQ,eAAiBA,GAAStL,EACnE,OAAO7R,EAAOkW,YAchB,SAASwW,KACP,IAAI/Z,EAASwK,GAAOhL,UAAYA,GAEhC,OADAQ,EAASA,IAAWR,GAAWwY,GAAehY,EACvCmhB,UAAUpxB,OAASiQ,EAAOmhB,UAAU,GAAIA,UAAU,IAAMnhB,EAWjE,SAASqO,GAAWjK,EAAKlX,GACvB,IAAIwF,EAAO0R,EAAIiJ,SACf,OAAOoZ,GAAUv5B,GACbwF,EAAmB,iBAAPxF,EAAkB,SAAW,QACzCwF,EAAK0R,IAUX,SAASwU,GAAavrB,GACpB,IAAI2S,EAAS0G,GAAKrZ,GACd0C,EAASiQ,EAAOjQ,OAEpB,MAAOA,IAAU,CACf,IAAI7C,EAAM8S,EAAOjQ,GACbnD,EAAQS,EAAOH,GAEnB8S,EAAOjQ,GAAU,CAAC7C,EAAKN,EAAOmsB,GAAmBnsB,IAEnD,OAAOoT,EAWT,SAAS4H,GAAUva,EAAQH,GACzB,IAAIN,EAAQgX,GAASvW,EAAQH,GAC7B,OAAOuqB,GAAa7qB,GAASA,EAAQoG,EAUvC,SAAS6hB,GAAUjoB,GACjB,IAAI85B,EAAQl5B,GAAe1B,KAAKc,EAAO+a,IACnCgK,EAAM/kB,EAAM+a,IAEhB,IACE/a,EAAM+a,IAAkB3U,EACxB,IAAI2zB,GAAW,EACf,MAAOvoB,IAET,IAAI4B,EAAS4G,GAAqB9a,KAAKc,GAQvC,OAPI+5B,IACED,EACF95B,EAAM+a,IAAkBgK,SAEjB/kB,EAAM+a,KAGV3H,EAUT,IAAImgB,GAAc7X,GAA+B,SAASjb,GACxD,OAAc,MAAVA,EACK,IAETA,EAAShB,GAAOgB,GACTyS,GAAYwI,GAAiBjb,IAAS,SAASqxB,GACpD,OAAOpX,GAAqBxb,KAAKuB,EAAQqxB,QANRkI,GAiBjCxG,GAAgB9X,GAA+B,SAASjb,GAC1D,IAAI2S,EAAS,GACb,MAAO3S,EACLkT,GAAUP,EAAQmgB,GAAW9yB,IAC7BA,EAAS8Z,GAAa9Z,GAExB,OAAO2S,GAN8B4mB,GAgBnChV,GAASgD,GAoCb,SAASrI,GAAQ1d,EAAO2d,EAAKqa,GAC3B,IAAIv4B,GAAS,EACTyB,EAAS82B,EAAW92B,OAExB,QAASzB,EAAQyB,EAAQ,CACvB,IAAI2C,EAAOm0B,EAAWv4B,GAClB+V,EAAO3R,EAAK2R,KAEhB,OAAQ3R,EAAKC,MACX,IAAK,OAAa9D,GAASwV,EAAM,MACjC,IAAK,YAAamI,GAAOnI,EAAM,MAC/B,IAAK,OAAamI,EAAMzD,GAAUyD,EAAK3d,EAAQwV,GAAO,MACtD,IAAK,YAAaxV,EAAQga,GAAUha,EAAO2d,EAAMnI,GAAO,OAG5D,MAAO,CAAE,MAASxV,EAAO,IAAO2d,GAUlC,SAASsa,GAAe/uB,GACtB,IAAIqJ,EAAQrJ,EAAOqJ,MAAMxI,IACzB,OAAOwI,EAAQA,EAAM,GAAGF,MAAMrI,IAAkB,GAYlD,SAASkuB,GAAQ15B,EAAQknB,EAAMyS,GAC7BzS,EAAOC,GAASD,EAAMlnB,GAEtB,IAAIiB,GAAS,EACTyB,EAASwkB,EAAKxkB,OACdiQ,GAAS,EAEb,QAAS1R,EAAQyB,EAAQ,CACvB,IAAI7C,EAAMunB,GAAMF,EAAKjmB,IACrB,KAAM0R,EAAmB,MAAV3S,GAAkB25B,EAAQ35B,EAAQH,IAC/C,MAEFG,EAASA,EAAOH,GAElB,OAAI8S,KAAY1R,GAASyB,EAChBiQ,GAETjQ,EAAmB,MAAV1C,EAAiB,EAAIA,EAAO0C,SAC5BA,GAAUgoB,GAAShoB,IAAW4f,GAAQziB,EAAK6C,KACjD2a,GAAQrd,IAAWkiB,GAAYliB,KAUpC,SAASqkB,GAAepS,GACtB,IAAIvP,EAASuP,EAAMvP,OACfiQ,EAAS,IAAIV,EAAMtO,YAAYjB,GAOnC,OAJIA,GAA6B,iBAAZuP,EAAM,IAAkB9R,GAAe1B,KAAKwT,EAAO,WACtEU,EAAO1R,MAAQgR,EAAMhR,MACrB0R,EAAOinB,MAAQ3nB,EAAM2nB,OAEhBjnB,EAUT,SAAS+R,GAAgB1kB,GACvB,MAAqC,mBAAtBA,EAAO2D,aAA8BqnB,GAAYhrB,GAE5D,GADAyd,GAAW3D,GAAa9Z,IAgB9B,SAAS6kB,GAAe7kB,EAAQskB,EAAKJ,GACnC,IAAIwP,EAAO1zB,EAAO2D,YAClB,OAAQ2gB,GACN,KAAK9a,GACH,OAAOonB,GAAiB5wB,GAE1B,KAAKqI,EACL,KAAKC,EACH,OAAO,IAAIorB,GAAM1zB,GAEnB,KAAKyJ,GACH,OAAOsnB,GAAc/wB,EAAQkkB,GAE/B,KAAKxa,GAAY,KAAKC,GACtB,KAAKC,GAAS,KAAKC,GAAU,KAAKC,GAClC,KAAKC,GAAU,KAAKC,GAAiB,KAAKC,GAAW,KAAKC,GACxD,OAAOkiB,GAAgBpsB,EAAQkkB,GAEjC,KAAKvb,EACH,OAAO,IAAI+qB,EAEb,KAAK9qB,GACL,KAAKO,GACH,OAAO,IAAIuqB,EAAK1zB,GAElB,KAAKiJ,GACH,OAAOioB,GAAYlxB,GAErB,KAAKkJ,GACH,OAAO,IAAIwqB,EAEb,KAAKtqB,GACH,OAAOgoB,GAAYpxB,IAYzB,SAAS65B,GAAkBnvB,EAAQovB,GACjC,IAAIp3B,EAASo3B,EAAQp3B,OACrB,IAAKA,EACH,OAAOgI,EAET,IAAIsN,EAAYtV,EAAS,EAGzB,OAFAo3B,EAAQ9hB,IAActV,EAAS,EAAI,KAAO,IAAMo3B,EAAQ9hB,GACxD8hB,EAAUA,EAAQprB,KAAKhM,EAAS,EAAI,KAAO,KACpCgI,EAAO6K,QAAQjK,GAAe,uBAAyBwuB,EAAU,UAU1E,SAASnT,GAAcpnB,GACrB,OAAO8d,GAAQ9d,IAAU2iB,GAAY3iB,OAChC4a,IAAoB5a,GAASA,EAAM4a,KAW1C,SAASmI,GAAQ/iB,EAAOmD,GACtB,IAAI4C,SAAc/F,EAGlB,OAFAmD,EAAmB,MAAVA,EAAiBiF,EAAmBjF,IAEpCA,IACE,UAAR4C,GACU,UAARA,GAAoB4G,GAASuK,KAAKlX,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQmD,EAajD,SAAS4wB,GAAe/zB,EAAO0B,EAAOjB,GACpC,IAAK2d,GAAS3d,GACZ,OAAO,EAET,IAAIsF,SAAcrE,EAClB,SAAY,UAARqE,EACKgmB,GAAYtrB,IAAWsiB,GAAQrhB,EAAOjB,EAAO0C,QACrC,UAAR4C,GAAoBrE,KAASjB,IAE7B8iB,GAAG9iB,EAAOiB,GAAQ1B,GAa7B,SAASksB,GAAMlsB,EAAOS,GACpB,GAAIqd,GAAQ9d,GACV,OAAO,EAET,IAAI+F,SAAc/F,EAClB,QAAY,UAAR+F,GAA4B,UAARA,GAA4B,WAARA,GAC/B,MAAT/F,IAAiB4mB,GAAS5mB,MAGvByL,GAAcyL,KAAKlX,KAAWwL,GAAa0L,KAAKlX,IAC1C,MAAVS,GAAkBT,KAASP,GAAOgB,IAUvC,SAASo5B,GAAU75B,GACjB,IAAI+F,SAAc/F,EAClB,MAAgB,UAAR+F,GAA4B,UAARA,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAV/F,EACU,OAAVA,EAWP,SAAS+1B,GAAWzjB,GAClB,IAAIujB,EAAWD,GAAYtjB,GACvB8V,EAAQxK,GAAOiY,GAEnB,GAAoB,mBAATzN,KAAyByN,KAAY9X,GAAYpd,WAC1D,OAAO,EAET,GAAI2R,IAAS8V,EACX,OAAO,EAET,IAAItiB,EAAOgwB,GAAQ1N,GACnB,QAAStiB,GAAQwM,IAASxM,EAAK,GAUjC,SAASglB,GAASxY,GAChB,QAASqH,IAAeA,MAAcrH,GAxTnCqK,IAAYqI,GAAO,IAAIrI,GAAS,IAAI6d,YAAY,MAAQtwB,IACxD0S,IAAOoI,GAAO,IAAIpI,KAAQxT,GAC1BpF,IAAWghB,GAAOhhB,GAAQC,YAAcuF,IACxCqT,IAAOmI,GAAO,IAAInI,KAAQlT,IAC1BmT,IAAWkI,GAAO,IAAIlI,KAAY/S,MACrCib,GAAS,SAAShlB,GAChB,IAAIoT,EAAS4U,GAAWhoB,GACpBm0B,EAAO/gB,GAAU7J,GAAYvJ,EAAMoE,YAAcgC,EACjDq0B,EAAatG,EAAOhX,GAASgX,GAAQ,GAEzC,GAAIsG,EACF,OAAQA,GACN,KAAKvd,GAAoB,OAAOhT,GAChC,KAAKkT,GAAe,OAAOhU,EAC3B,KAAKiU,GAAmB,OAAO7T,GAC/B,KAAK8T,GAAe,OAAO3T,GAC3B,KAAK4T,GAAmB,OAAOxT,GAGnC,OAAOqJ,IA+SX,IAAIsnB,GAAanhB,GAAakO,GAAakT,GAS3C,SAASlP,GAAYzrB,GACnB,IAAIm0B,EAAOn0B,GAASA,EAAMoE,YACtB+Z,EAAwB,mBAARgW,GAAsBA,EAAKxzB,WAAc2Y,GAE7D,OAAOtZ,IAAUme,EAWnB,SAASgO,GAAmBnsB,GAC1B,OAAOA,IAAUA,IAAUoe,GAASpe,GAYtC,SAASisB,GAAwB3rB,EAAKsqB,GACpC,OAAO,SAASnqB,GACd,OAAc,MAAVA,IAGGA,EAAOH,KAASsqB,IACpBA,IAAaxkB,GAAc9F,KAAOb,GAAOgB,MAYhD,SAASm6B,GAActoB,GACrB,IAAIc,EAASynB,GAAQvoB,GAAM,SAAShS,GAIlC,OAHI8V,EAAMqB,OAAS9Q,GACjByP,EAAMkK,QAEDhgB,KAGL8V,EAAQhD,EAAOgD,MACnB,OAAOhD,EAmBT,SAASolB,GAAU1yB,EAAMqF,GACvB,IAAIqZ,EAAU1e,EAAK,GACfg1B,EAAa3vB,EAAO,GACpB4vB,EAAavW,EAAUsW,EACvB5U,EAAW6U,GAAc7zB,EAAiBC,EAAqBM,GAE/DuzB,EACAF,GAAcrzB,GAAmB+c,GAAWnd,GAC5CyzB,GAAcrzB,GAAmB+c,GAAW9c,GAAqB5B,EAAK,GAAG3C,QAAUgI,EAAO,IAC1F2vB,IAAerzB,EAAgBC,IAAsByD,EAAO,GAAGhI,QAAUgI,EAAO,IAAQqZ,GAAWnd,EAGvG,IAAM6e,IAAY8U,EAChB,OAAOl1B,EAGLg1B,EAAa5zB,IACfpB,EAAK,GAAKqF,EAAO,GAEjB4vB,GAAcvW,EAAUtd,EAAiB,EAAIE,GAG/C,IAAIpH,EAAQmL,EAAO,GACnB,GAAInL,EAAO,CACT,IAAIwyB,EAAW1sB,EAAK,GACpBA,EAAK,GAAK0sB,EAAWD,GAAYC,EAAUxyB,EAAOmL,EAAO,IAAMnL,EAC/D8F,EAAK,GAAK0sB,EAAW1a,GAAehS,EAAK,GAAIc,GAAeuE,EAAO,GA0BrE,OAvBAnL,EAAQmL,EAAO,GACXnL,IACFwyB,EAAW1sB,EAAK,GAChBA,EAAK,GAAK0sB,EAAWU,GAAiBV,EAAUxyB,EAAOmL,EAAO,IAAMnL,EACpE8F,EAAK,GAAK0sB,EAAW1a,GAAehS,EAAK,GAAIc,GAAeuE,EAAO,IAGrEnL,EAAQmL,EAAO,GACXnL,IACF8F,EAAK,GAAK9F,GAGR86B,EAAarzB,IACf3B,EAAK,GAAgB,MAAXA,EAAK,GAAaqF,EAAO,GAAKgR,GAAUrW,EAAK,GAAIqF,EAAO,KAGrD,MAAXrF,EAAK,KACPA,EAAK,GAAKqF,EAAO,IAGnBrF,EAAK,GAAKqF,EAAO,GACjBrF,EAAK,GAAKi1B,EAEHj1B,EAYT,SAAS6lB,GAAalrB,GACpB,IAAI2S,EAAS,GACb,GAAc,MAAV3S,EACF,IAAK,IAAIH,KAAOb,GAAOgB,GACrB2S,EAAOpQ,KAAK1C,GAGhB,OAAO8S,EAUT,SAAS8U,GAAeloB,GACtB,OAAOga,GAAqB9a,KAAKc,GAYnC,SAASouB,GAAS9b,EAAMrQ,EAAO2V,GAE7B,OADA3V,EAAQga,GAAUha,IAAUmE,EAAakM,EAAKnP,OAAS,EAAKlB,EAAO,GAC5D,WACL,IAAIuQ,EAAO+hB,UACP7yB,GAAS,EACTyB,EAAS8Y,GAAUzJ,EAAKrP,OAASlB,EAAO,GACxCyQ,EAAQgB,EAAMvQ,GAElB,QAASzB,EAAQyB,EACfuP,EAAMhR,GAAS8Q,EAAKvQ,EAAQP,GAE9BA,GAAS,EACT,IAAIu5B,EAAYvnB,EAAMzR,EAAQ,GAC9B,QAASP,EAAQO,EACfg5B,EAAUv5B,GAAS8Q,EAAK9Q,GAG1B,OADAu5B,EAAUh5B,GAAS2V,EAAUlF,GACtBL,GAAMC,EAAM3T,KAAMs8B,IAY7B,SAAS/R,GAAOzoB,EAAQknB,GACtB,OAAOA,EAAKxkB,OAAS,EAAI1C,EAASinB,GAAQjnB,EAAQmuB,GAAUjH,EAAM,GAAI,IAaxE,SAAS+O,GAAQhkB,EAAOmb,GACtB,IAAIpO,EAAY/M,EAAMvP,OAClBA,EAASgZ,GAAU0R,EAAQ1qB,OAAQsc,GACnCyb,EAAWhc,GAAUxM,GAEzB,MAAOvP,IAAU,CACf,IAAIzB,EAAQmsB,EAAQ1qB,GACpBuP,EAAMvP,GAAU4f,GAAQrhB,EAAO+d,GAAayb,EAASx5B,GAAS0E,EAEhE,OAAOsM,EAWT,SAAS+Z,GAAQhsB,EAAQH,GACvB,IAAY,gBAARA,GAAgD,oBAAhBG,EAAOH,KAIhC,aAAPA,EAIJ,OAAOG,EAAOH,GAiBhB,IAAI03B,GAAUmD,GAAS3M,IAUnBnT,GAAaD,IAAiB,SAAS9I,EAAMyT,GAC/C,OAAO3nB,GAAKid,WAAW/I,EAAMyT,IAW3BoI,GAAcgN,GAAS1M,IAY3B,SAASwJ,GAAgB5D,EAAS+G,EAAW5W,GAC3C,IAAIrZ,EAAUiwB,EAAY,GAC1B,OAAOjN,GAAYkG,EAASiG,GAAkBnvB,EAAQkwB,GAAkBnB,GAAe/uB,GAASqZ,KAYlG,SAAS2W,GAAS7oB,GAChB,IAAIgpB,EAAQ,EACRC,EAAa,EAEjB,OAAO,WACL,IAAIC,EAAQnf,KACRof,EAAY1zB,GAAYyzB,EAAQD,GAGpC,GADAA,EAAaC,EACTC,EAAY,GACd,KAAMH,GAASxzB,EACb,OAAOysB,UAAU,QAGnB+G,EAAQ,EAEV,OAAOhpB,EAAKD,MAAMjM,EAAWmuB,YAYjC,SAASpR,GAAYzQ,EAAO+E,GAC1B,IAAI/V,GAAS,EACTyB,EAASuP,EAAMvP,OACfsV,EAAYtV,EAAS,EAEzBsU,EAAOA,IAASrR,EAAYjD,EAASsU,EACrC,QAAS/V,EAAQ+V,EAAM,CACrB,IAAIikB,EAAOzY,GAAWvhB,EAAO+W,GACzBzY,EAAQ0S,EAAMgpB,GAElBhpB,EAAMgpB,GAAQhpB,EAAMhR,GACpBgR,EAAMhR,GAAS1B,EAGjB,OADA0S,EAAMvP,OAASsU,EACR/E,EAUT,IAAIqe,GAAe6J,IAAc,SAASvmB,GACxC,IAAIjB,EAAS,GAOb,OAN6B,KAAzBiB,EAAOsnB,WAAW,IACpBvoB,EAAOpQ,KAAK,IAEdqR,EAAO2B,QAAQtK,IAAY,SAAS8I,EAAO4P,EAAQwX,EAAOC,GACxDzoB,EAAOpQ,KAAK44B,EAAQC,EAAU7lB,QAAQ5J,GAAc,MAASgY,GAAU5P,MAElEpB,KAUT,SAASyU,GAAM7nB,GACb,GAAoB,iBAATA,GAAqB4mB,GAAS5mB,GACvC,OAAOA,EAET,IAAIoT,EAAUpT,EAAQ,GACtB,MAAkB,KAAVoT,GAAkB,EAAIpT,IAAWmI,EAAY,KAAOiL,EAU9D,SAAS+J,GAAS7K,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAOkH,GAAata,KAAKoT,GACzB,MAAOd,IACT,IACE,OAAQc,EAAO,GACf,MAAOd,KAEX,MAAO,GAWT,SAAS6pB,GAAkBd,EAAS/V,GAOlC,OANA1R,GAAUpK,GAAW,SAAS0vB,GAC5B,IAAIp4B,EAAQ,KAAOo4B,EAAK,GACnB5T,EAAU4T,EAAK,KAAQ/kB,GAAcknB,EAASv6B,IACjDu6B,EAAQv3B,KAAKhD,MAGVu6B,EAAQ/kB,OAUjB,SAASyI,GAAaoW,GACpB,GAAIA,aAAmBtW,GACrB,OAAOsW,EAAQjV,QAEjB,IAAIhM,EAAS,IAAI4K,GAAcqW,EAAQ9V,YAAa8V,EAAQ5V,WAI5D,OAHArL,EAAOoL,YAAcU,GAAUmV,EAAQ7V,aACvCpL,EAAOsL,UAAa2V,EAAQ3V,UAC5BtL,EAAOuL,WAAa0V,EAAQ1V,WACrBvL,EA0BT,SAAS0oB,GAAMppB,EAAO+E,EAAMqc,GAExBrc,GADGqc,EAAQC,GAAerhB,EAAO+E,EAAMqc,GAASrc,IAASrR,GAClD,EAEA6V,GAAU6K,GAAUrP,GAAO,GAEpC,IAAItU,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACvC,IAAKA,GAAUsU,EAAO,EACpB,MAAO,GAET,IAAI/V,EAAQ,EACRyR,EAAW,EACXC,EAASM,EAAM4H,GAAWnY,EAASsU,IAEvC,MAAO/V,EAAQyB,EACbiQ,EAAOD,KAAcyb,GAAUlc,EAAOhR,EAAQA,GAAS+V,GAEzD,OAAOrE,EAkBT,SAAS2oB,GAAQrpB,GACf,IAAIhR,GAAS,EACTyB,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACnCgQ,EAAW,EACXC,EAAS,GAEb,QAAS1R,EAAQyB,EAAQ,CACvB,IAAInD,EAAQ0S,EAAMhR,GACd1B,IACFoT,EAAOD,KAAcnT,GAGzB,OAAOoT,EAyBT,SAAS4oB,KACP,IAAI74B,EAASoxB,UAAUpxB,OACvB,IAAKA,EACH,MAAO,GAET,IAAIqP,EAAOkB,EAAMvQ,EAAS,GACtBuP,EAAQ6hB,UAAU,GAClB7yB,EAAQyB,EAEZ,MAAOzB,IACL8Q,EAAK9Q,EAAQ,GAAK6yB,UAAU7yB,GAE9B,OAAOiS,GAAUmK,GAAQpL,GAASwM,GAAUxM,GAAS,CAACA,GAAQuU,GAAYzU,EAAM,IAwBlF,IAAIypB,GAAa/N,IAAS,SAASxb,EAAOkB,GACxC,OAAOgZ,GAAkBla,GACrBsT,GAAetT,EAAOuU,GAAYrT,EAAQ,EAAGgZ,IAAmB,IAChE,MA6BFsP,GAAehO,IAAS,SAASxb,EAAOkB,GAC1C,IAAIhB,EAAWuW,GAAKvV,GAIpB,OAHIgZ,GAAkBha,KACpBA,EAAWxM,GAENwmB,GAAkBla,GACrBsT,GAAetT,EAAOuU,GAAYrT,EAAQ,EAAGgZ,IAAmB,GAAOO,GAAYva,EAAU,IAC7F,MA0BFupB,GAAiBjO,IAAS,SAASxb,EAAOkB,GAC5C,IAAIJ,EAAa2V,GAAKvV,GAItB,OAHIgZ,GAAkBpZ,KACpBA,EAAapN,GAERwmB,GAAkBla,GACrBsT,GAAetT,EAAOuU,GAAYrT,EAAQ,EAAGgZ,IAAmB,GAAOxmB,EAAWoN,GAClF,MA4BN,SAAS4oB,GAAK1pB,EAAOlS,EAAGszB,GACtB,IAAI3wB,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACvC,OAAKA,GAGL3C,EAAKszB,GAAStzB,IAAM4F,EAAa,EAAI0gB,GAAUtmB,GACxCouB,GAAUlc,EAAOlS,EAAI,EAAI,EAAIA,EAAG2C,IAH9B,GA+BX,SAASk5B,GAAU3pB,EAAOlS,EAAGszB,GAC3B,IAAI3wB,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACvC,OAAKA,GAGL3C,EAAKszB,GAAStzB,IAAM4F,EAAa,EAAI0gB,GAAUtmB,GAC/CA,EAAI2C,EAAS3C,EACNouB,GAAUlc,EAAO,EAAGlS,EAAI,EAAI,EAAIA,IAJ9B,GA0CX,SAAS87B,GAAe5pB,EAAOO,GAC7B,OAAQP,GAASA,EAAMvP,OACnBktB,GAAU3d,EAAOya,GAAYla,EAAW,IAAI,GAAM,GAClD,GAsCN,SAASspB,GAAU7pB,EAAOO,GACxB,OAAQP,GAASA,EAAMvP,OACnBktB,GAAU3d,EAAOya,GAAYla,EAAW,IAAI,GAC5C,GAgCN,SAASupB,GAAK9pB,EAAO1S,EAAOiC,EAAO2d,GACjC,IAAIzc,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACvC,OAAKA,GAGDlB,GAAyB,iBAATA,GAAqB8xB,GAAerhB,EAAO1S,EAAOiC,KACpEA,EAAQ,EACR2d,EAAMzc,GAED0jB,GAASnU,EAAO1S,EAAOiC,EAAO2d,IAN5B,GA4CX,SAASja,GAAU+M,EAAOO,EAAW4B,GACnC,IAAI1R,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIzB,EAAqB,MAAbmT,EAAoB,EAAIiS,GAAUjS,GAI9C,OAHInT,EAAQ,IACVA,EAAQua,GAAU9Y,EAASzB,EAAO,IAE7BkT,GAAclC,EAAOya,GAAYla,EAAW,GAAIvR,GAsCzD,SAAS+6B,GAAc/pB,EAAOO,EAAW4B,GACvC,IAAI1R,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIzB,EAAQyB,EAAS,EAOrB,OANI0R,IAAczO,IAChB1E,EAAQolB,GAAUjS,GAClBnT,EAAQmT,EAAY,EAChBoH,GAAU9Y,EAASzB,EAAO,GAC1Bya,GAAUza,EAAOyB,EAAS,IAEzByR,GAAclC,EAAOya,GAAYla,EAAW,GAAIvR,GAAO,GAiBhE,SAASi4B,GAAQjnB,GACf,IAAIvP,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACvC,OAAOA,EAAS8jB,GAAYvU,EAAO,GAAK,GAiB1C,SAASgqB,GAAYhqB,GACnB,IAAIvP,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACvC,OAAOA,EAAS8jB,GAAYvU,EAAOvK,GAAY,GAuBjD,SAASw0B,GAAajqB,EAAOwU,GAC3B,IAAI/jB,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACvC,OAAKA,GAGL+jB,EAAQA,IAAU9gB,EAAY,EAAI0gB,GAAUI,GACrCD,GAAYvU,EAAOwU,IAHjB,GAqBX,SAAS0V,GAAUra,GACjB,IAAI7gB,GAAS,EACTyB,EAAkB,MAATof,EAAgB,EAAIA,EAAMpf,OACnCiQ,EAAS,GAEb,QAAS1R,EAAQyB,EAAQ,CACvB,IAAIi1B,EAAO7V,EAAM7gB,GACjB0R,EAAOglB,EAAK,IAAMA,EAAK,GAEzB,OAAOhlB,EAqBT,SAASypB,GAAKnqB,GACZ,OAAQA,GAASA,EAAMvP,OAAUuP,EAAM,GAAKtM,EA0B9C,SAASunB,GAAQjb,EAAO1S,EAAO6U,GAC7B,IAAI1R,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIzB,EAAqB,MAAbmT,EAAoB,EAAIiS,GAAUjS,GAI9C,OAHInT,EAAQ,IACVA,EAAQua,GAAU9Y,EAASzB,EAAO,IAE7B4R,GAAYZ,EAAO1S,EAAO0B,GAiBnC,SAASo7B,GAAQpqB,GACf,IAAIvP,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACvC,OAAOA,EAASyrB,GAAUlc,EAAO,GAAI,GAAK,GAoB5C,IAAIqqB,GAAe7O,IAAS,SAASzF,GACnC,IAAIuU,EAASvpB,GAASgV,EAAQoI,IAC9B,OAAQmM,EAAO75B,QAAU65B,EAAO,KAAOvU,EAAO,GAC1CD,GAAiBwU,GACjB,MA0BFC,GAAiB/O,IAAS,SAASzF,GACrC,IAAI7V,EAAWuW,GAAKV,GAChBuU,EAASvpB,GAASgV,EAAQoI,IAO9B,OALIje,IAAauW,GAAK6T,GACpBpqB,EAAWxM,EAEX42B,EAAO9b,MAED8b,EAAO75B,QAAU65B,EAAO,KAAOvU,EAAO,GAC1CD,GAAiBwU,EAAQ7P,GAAYva,EAAU,IAC/C,MAwBFsqB,GAAmBhP,IAAS,SAASzF,GACvC,IAAIjV,EAAa2V,GAAKV,GAClBuU,EAASvpB,GAASgV,EAAQoI,IAM9B,OAJArd,EAAkC,mBAAdA,EAA2BA,EAAapN,EACxDoN,GACFwpB,EAAO9b,MAED8b,EAAO75B,QAAU65B,EAAO,KAAOvU,EAAO,GAC1CD,GAAiBwU,EAAQ52B,EAAWoN,GACpC,MAkBN,SAASrE,GAAKuD,EAAOyqB,GACnB,OAAgB,MAATzqB,EAAgB,GAAKqJ,GAAW7c,KAAKwT,EAAOyqB,GAiBrD,SAAShU,GAAKzW,GACZ,IAAIvP,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACvC,OAAOA,EAASuP,EAAMvP,EAAS,GAAKiD,EAwBtC,SAASg3B,GAAY1qB,EAAO1S,EAAO6U,GACjC,IAAI1R,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIzB,EAAQyB,EAKZ,OAJI0R,IAAczO,IAChB1E,EAAQolB,GAAUjS,GAClBnT,EAAQA,EAAQ,EAAIua,GAAU9Y,EAASzB,EAAO,GAAKya,GAAUza,EAAOyB,EAAS,IAExEnD,IAAUA,EACbkY,GAAkBxF,EAAO1S,EAAO0B,GAChCkT,GAAclC,EAAOsC,GAAWtT,GAAO,GAwB7C,SAAS27B,GAAI3qB,EAAOlS,GAClB,OAAQkS,GAASA,EAAMvP,OAAU6pB,GAAQta,EAAOoU,GAAUtmB,IAAM4F,EA0BlE,IAAIk3B,GAAOpP,GAASqP,IAsBpB,SAASA,GAAQ7qB,EAAOkB,GACtB,OAAQlB,GAASA,EAAMvP,QAAUyQ,GAAUA,EAAOzQ,OAC9CuqB,GAAYhb,EAAOkB,GACnBlB,EA0BN,SAAS8qB,GAAU9qB,EAAOkB,EAAQhB,GAChC,OAAQF,GAASA,EAAMvP,QAAUyQ,GAAUA,EAAOzQ,OAC9CuqB,GAAYhb,EAAOkB,EAAQuZ,GAAYva,EAAU,IACjDF,EA0BN,SAAS+qB,GAAY/qB,EAAOkB,EAAQJ,GAClC,OAAQd,GAASA,EAAMvP,QAAUyQ,GAAUA,EAAOzQ,OAC9CuqB,GAAYhb,EAAOkB,EAAQxN,EAAWoN,GACtCd,EA2BN,IAAIgrB,GAASlI,IAAS,SAAS9iB,EAAOmb,GACpC,IAAI1qB,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACnCiQ,EAAS6Q,GAAOvR,EAAOmb,GAM3B,OAJAD,GAAWlb,EAAOe,GAASoa,GAAS,SAASnsB,GAC3C,OAAOqhB,GAAQrhB,EAAOyB,IAAWzB,EAAQA,KACxC8T,KAAKwc,KAED5e,KA+BT,SAASuqB,GAAOjrB,EAAOO,GACrB,IAAIG,EAAS,GACb,IAAMV,IAASA,EAAMvP,OACnB,OAAOiQ,EAET,IAAI1R,GAAS,EACTmsB,EAAU,GACV1qB,EAASuP,EAAMvP,OAEnB8P,EAAYka,GAAYla,EAAW,GACnC,QAASvR,EAAQyB,EAAQ,CACvB,IAAInD,EAAQ0S,EAAMhR,GACduR,EAAUjT,EAAO0B,EAAOgR,KAC1BU,EAAOpQ,KAAKhD,GACZ6tB,EAAQ7qB,KAAKtB,IAIjB,OADAksB,GAAWlb,EAAOmb,GACXza,EA0BT,SAASsJ,GAAQhK,GACf,OAAgB,MAATA,EAAgBA,EAAQ+J,GAAcvd,KAAKwT,GAmBpD,SAASoD,GAAMpD,EAAOzQ,EAAO2d,GAC3B,IAAIzc,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACvC,OAAKA,GAGDyc,GAAqB,iBAAPA,GAAmBmU,GAAerhB,EAAOzQ,EAAO2d,IAChE3d,EAAQ,EACR2d,EAAMzc,IAGNlB,EAAiB,MAATA,EAAgB,EAAI6kB,GAAU7kB,GACtC2d,EAAMA,IAAQxZ,EAAYjD,EAAS2jB,GAAUlH,IAExCgP,GAAUlc,EAAOzQ,EAAO2d,IAVtB,GA8BX,SAASge,GAAYlrB,EAAO1S,GAC1B,OAAO8uB,GAAgBpc,EAAO1S,GA4BhC,SAAS69B,GAAcnrB,EAAO1S,EAAO4S,GACnC,OAAOuc,GAAkBzc,EAAO1S,EAAOmtB,GAAYva,EAAU,IAmB/D,SAASkrB,GAAcprB,EAAO1S,GAC5B,IAAImD,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACvC,GAAIA,EAAQ,CACV,IAAIzB,EAAQotB,GAAgBpc,EAAO1S,GACnC,GAAI0B,EAAQyB,GAAUogB,GAAG7Q,EAAMhR,GAAQ1B,GACrC,OAAO0B,EAGX,OAAQ,EAqBV,SAASq8B,GAAgBrrB,EAAO1S,GAC9B,OAAO8uB,GAAgBpc,EAAO1S,GAAO,GA4BvC,SAASg+B,GAAkBtrB,EAAO1S,EAAO4S,GACvC,OAAOuc,GAAkBzc,EAAO1S,EAAOmtB,GAAYva,EAAU,IAAI,GAmBnE,SAASqrB,GAAkBvrB,EAAO1S,GAChC,IAAImD,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACvC,GAAIA,EAAQ,CACV,IAAIzB,EAAQotB,GAAgBpc,EAAO1S,GAAO,GAAQ,EAClD,GAAIujB,GAAG7Q,EAAMhR,GAAQ1B,GACnB,OAAO0B,EAGX,OAAQ,EAkBV,SAASw8B,GAAWxrB,GAClB,OAAQA,GAASA,EAAMvP,OACnB0sB,GAAend,GACf,GAmBN,SAASyrB,GAAazrB,EAAOE,GAC3B,OAAQF,GAASA,EAAMvP,OACnB0sB,GAAend,EAAOya,GAAYva,EAAU,IAC5C,GAiBN,SAASwrB,GAAK1rB,GACZ,IAAIvP,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACvC,OAAOA,EAASyrB,GAAUlc,EAAO,EAAGvP,GAAU,GA4BhD,SAASk7B,GAAK3rB,EAAOlS,EAAGszB,GACtB,OAAMphB,GAASA,EAAMvP,QAGrB3C,EAAKszB,GAAStzB,IAAM4F,EAAa,EAAI0gB,GAAUtmB,GACxCouB,GAAUlc,EAAO,EAAGlS,EAAI,EAAI,EAAIA,IAH9B,GA+BX,SAAS89B,GAAU5rB,EAAOlS,EAAGszB,GAC3B,IAAI3wB,EAAkB,MAATuP,EAAgB,EAAIA,EAAMvP,OACvC,OAAKA,GAGL3C,EAAKszB,GAAStzB,IAAM4F,EAAa,EAAI0gB,GAAUtmB,GAC/CA,EAAI2C,EAAS3C,EACNouB,GAAUlc,EAAOlS,EAAI,EAAI,EAAIA,EAAG2C,IAJ9B,GA0CX,SAASo7B,GAAe7rB,EAAOO,GAC7B,OAAQP,GAASA,EAAMvP,OACnBktB,GAAU3d,EAAOya,GAAYla,EAAW,IAAI,GAAO,GACnD,GAsCN,SAASurB,GAAU9rB,EAAOO,GACxB,OAAQP,GAASA,EAAMvP,OACnBktB,GAAU3d,EAAOya,GAAYla,EAAW,IACxC,GAmBN,IAAIwrB,GAAQvQ,IAAS,SAASzF,GAC5B,OAAOuH,GAAS/I,GAAYwB,EAAQ,EAAGmE,IAAmB,OA0BxD8R,GAAUxQ,IAAS,SAASzF,GAC9B,IAAI7V,EAAWuW,GAAKV,GAIpB,OAHImE,GAAkBha,KACpBA,EAAWxM,GAEN4pB,GAAS/I,GAAYwB,EAAQ,EAAGmE,IAAmB,GAAOO,GAAYva,EAAU,OAwBrF+rB,GAAYzQ,IAAS,SAASzF,GAChC,IAAIjV,EAAa2V,GAAKV,GAEtB,OADAjV,EAAkC,mBAAdA,EAA2BA,EAAapN,EACrD4pB,GAAS/I,GAAYwB,EAAQ,EAAGmE,IAAmB,GAAOxmB,EAAWoN,MAqB9E,SAASorB,GAAKlsB,GACZ,OAAQA,GAASA,EAAMvP,OAAU6sB,GAAStd,GAAS,GA0BrD,SAASmsB,GAAOnsB,EAAOE,GACrB,OAAQF,GAASA,EAAMvP,OAAU6sB,GAAStd,EAAOya,GAAYva,EAAU,IAAM,GAuB/E,SAASksB,GAASpsB,EAAOc,GAEvB,OADAA,EAAkC,mBAAdA,EAA2BA,EAAapN,EACpDsM,GAASA,EAAMvP,OAAU6sB,GAAStd,EAAOtM,EAAWoN,GAAc,GAsB5E,SAASurB,GAAMrsB,GACb,IAAMA,IAASA,EAAMvP,OACnB,MAAO,GAET,IAAIA,EAAS,EAOb,OANAuP,EAAQQ,GAAYR,GAAO,SAASssB,GAClC,GAAIpS,GAAkBoS,GAEpB,OADA77B,EAAS8Y,GAAU+iB,EAAM77B,OAAQA,IAC1B,KAGJuS,GAAUvS,GAAQ,SAASzB,GAChC,OAAO+R,GAASf,EAAOyB,GAAazS,OAyBxC,SAASu9B,GAAUvsB,EAAOE,GACxB,IAAMF,IAASA,EAAMvP,OACnB,MAAO,GAET,IAAIiQ,EAAS2rB,GAAMrsB,GACnB,OAAgB,MAAZE,EACKQ,EAEFK,GAASL,GAAQ,SAAS4rB,GAC/B,OAAO3sB,GAAMO,EAAUxM,EAAW44B,MAwBtC,IAAIE,GAAUhR,IAAS,SAASxb,EAAOkB,GACrC,OAAOgZ,GAAkBla,GACrBsT,GAAetT,EAAOkB,GACtB,MAqBFurB,GAAMjR,IAAS,SAASzF,GAC1B,OAAOgI,GAAQvd,GAAYuV,EAAQmE,QA0BjCwS,GAAQlR,IAAS,SAASzF,GAC5B,IAAI7V,EAAWuW,GAAKV,GAIpB,OAHImE,GAAkBha,KACpBA,EAAWxM,GAENqqB,GAAQvd,GAAYuV,EAAQmE,IAAoBO,GAAYva,EAAU,OAwB3EysB,GAAUnR,IAAS,SAASzF,GAC9B,IAAIjV,EAAa2V,GAAKV,GAEtB,OADAjV,EAAkC,mBAAdA,EAA2BA,EAAapN,EACrDqqB,GAAQvd,GAAYuV,EAAQmE,IAAoBxmB,EAAWoN,MAmBhE8rB,GAAMpR,GAAS6Q,IAkBnB,SAASQ,GAAU3pB,EAAOhC,GACxB,OAAO8c,GAAc9a,GAAS,GAAIhC,GAAU,GAAI6P,IAkBlD,SAAS+b,GAAc5pB,EAAOhC,GAC5B,OAAO8c,GAAc9a,GAAS,GAAIhC,GAAU,GAAI4Z,IAuBlD,IAAIiS,GAAUvR,IAAS,SAASzF,GAC9B,IAAItlB,EAASslB,EAAOtlB,OAChByP,EAAWzP,EAAS,EAAIslB,EAAOtlB,EAAS,GAAKiD,EAGjD,OADAwM,EAA8B,mBAAZA,GAA0B6V,EAAOvH,MAAOtO,GAAYxM,EAC/D64B,GAAUxW,EAAQ7V,MAkC3B,SAAS8sB,GAAM1/B,GACb,IAAIoT,EAASwK,GAAO5d,GAEpB,OADAoT,EAAOqL,WAAY,EACZrL,EA0BT,SAASusB,GAAI3/B,EAAO4/B,GAElB,OADAA,EAAY5/B,GACLA,EA0BT,SAAS21B,GAAK31B,EAAO4/B,GACnB,OAAOA,EAAY5/B,GAmBrB,IAAI6/B,GAAYrK,IAAS,SAAStR,GAChC,IAAI/gB,EAAS+gB,EAAM/gB,OACflB,EAAQkB,EAAS+gB,EAAM,GAAK,EAC5BlkB,EAAQrB,KAAK4f,YACbqhB,EAAc,SAASn/B,GAAU,OAAOwjB,GAAOxjB,EAAQyjB,IAE3D,QAAI/gB,EAAS,GAAKxE,KAAK6f,YAAYrb,SAC7BnD,aAAiB+d,IAAiBgF,GAAQ9gB,IAGhDjC,EAAQA,EAAM8V,MAAM7T,GAAQA,GAASkB,EAAS,EAAI,IAClDnD,EAAMwe,YAAYxb,KAAK,CACrB,KAAQ2yB,GACR,KAAQ,CAACiK,GACT,QAAWx5B,IAEN,IAAI4X,GAAche,EAAOrB,KAAK8f,WAAWkX,MAAK,SAASjjB,GAI5D,OAHIvP,IAAWuP,EAAMvP,QACnBuP,EAAM1P,KAAKoD,GAENsM,MAZA/T,KAAKg3B,KAAKiK,MA2CrB,SAASE,KACP,OAAOJ,GAAM/gC,MA6Bf,SAASohC,KACP,OAAO,IAAI/hB,GAAcrf,KAAKqB,QAASrB,KAAK8f,WAyB9C,SAASuhB,KACHrhC,KAAKggB,aAAevY,IACtBzH,KAAKggB,WAAashB,GAAQthC,KAAKqB,UAEjC,IAAIsX,EAAO3Y,KAAK+f,WAAa/f,KAAKggB,WAAWxb,OACzCnD,EAAQsX,EAAOlR,EAAYzH,KAAKggB,WAAWhgB,KAAK+f,aAEpD,MAAO,CAAE,KAAQpH,EAAM,MAAStX,GAqBlC,SAASkgC,KACP,OAAOvhC,KA2BT,SAASwhC,GAAangC,GACpB,IAAIoT,EACA8V,EAASvqB,KAEb,MAAOuqB,aAAkB7K,GAAY,CACnC,IAAIe,EAAQnB,GAAaiL,GACzB9J,EAAMV,UAAY,EAClBU,EAAMT,WAAavY,EACfgN,EACF0a,EAASvP,YAAca,EAEvBhM,EAASgM,EAEX,IAAI0O,EAAW1O,EACf8J,EAASA,EAAO3K,YAGlB,OADAuP,EAASvP,YAAcve,EAChBoT,EAuBT,SAASgtB,KACP,IAAIpgC,EAAQrB,KAAK4f,YACjB,GAAIve,aAAiB+d,GAAa,CAChC,IAAIsiB,EAAUrgC,EAUd,OATIrB,KAAK6f,YAAYrb,SACnBk9B,EAAU,IAAItiB,GAAYpf,OAE5B0hC,EAAUA,EAAQ3jB,UAClB2jB,EAAQ7hB,YAAYxb,KAAK,CACvB,KAAQ2yB,GACR,KAAQ,CAACjZ,IACT,QAAWtW,IAEN,IAAI4X,GAAcqiB,EAAS1hC,KAAK8f,WAEzC,OAAO9f,KAAKg3B,KAAKjZ,IAiBnB,SAAS4jB,KACP,OAAOtgB,GAAiBrhB,KAAK4f,YAAa5f,KAAK6f,aA2BjD,IAAI+hB,GAAU9M,IAAiB,SAASrgB,EAAQpT,EAAOM,GACjDM,GAAe1B,KAAKkU,EAAQ9S,KAC5B8S,EAAO9S,GAETkjB,GAAgBpQ,EAAQ9S,EAAK,MA6CjC,SAASkgC,GAAM9rB,EAAYzB,EAAW6gB,GACpC,IAAIxhB,EAAOwL,GAAQpJ,GAAc1B,GAAa0T,GAI9C,OAHIoN,GAASC,GAAerf,EAAYzB,EAAW6gB,KACjD7gB,EAAY7M,GAEPkM,EAAKoC,EAAYyY,GAAYla,EAAW,IA4CjD,SAASwtB,GAAO/rB,EAAYzB,GAC1B,IAAIX,EAAOwL,GAAQpJ,GAAcxB,GAAc8T,GAC/C,OAAO1U,EAAKoC,EAAYyY,GAAYla,EAAW,IAuCjD,IAAIytB,GAAOrL,GAAW1vB,IAqBlBg7B,GAAWtL,GAAWoH,IAuB1B,SAASmE,GAAQlsB,EAAY9B,GAC3B,OAAOqU,GAAYzP,GAAI9C,EAAY9B,GAAW,GAuBhD,SAASiuB,GAAYnsB,EAAY9B,GAC/B,OAAOqU,GAAYzP,GAAI9C,EAAY9B,GAAWzK,GAwBhD,SAAS24B,GAAapsB,EAAY9B,EAAUsU,GAE1C,OADAA,EAAQA,IAAU9gB,EAAY,EAAI0gB,GAAUI,GACrCD,GAAYzP,GAAI9C,EAAY9B,GAAWsU,GAiChD,SAASxP,GAAQhD,EAAY9B,GAC3B,IAAIN,EAAOwL,GAAQpJ,GAAc5B,GAAY8Q,GAC7C,OAAOtR,EAAKoC,EAAYyY,GAAYva,EAAU,IAuBhD,SAASmuB,GAAarsB,EAAY9B,GAChC,IAAIN,EAAOwL,GAAQpJ,GAAc3B,GAAiByT,GAClD,OAAOlU,EAAKoC,EAAYyY,GAAYva,EAAU,IA0BhD,IAAIouB,GAAUvN,IAAiB,SAASrgB,EAAQpT,EAAOM,GACjDM,GAAe1B,KAAKkU,EAAQ9S,GAC9B8S,EAAO9S,GAAK0C,KAAKhD,GAEjBwjB,GAAgBpQ,EAAQ9S,EAAK,CAACN,OAkClC,SAASimB,GAASvR,EAAY1U,EAAO6U,EAAWif,GAC9Cpf,EAAaqX,GAAYrX,GAAcA,EAAad,GAAOc,GAC3DG,EAAaA,IAAcif,EAAShN,GAAUjS,GAAa,EAE3D,IAAI1R,EAASuR,EAAWvR,OAIxB,OAHI0R,EAAY,IACdA,EAAYoH,GAAU9Y,EAAS0R,EAAW,IAErCosB,GAASvsB,GACXG,GAAa1R,GAAUuR,EAAWiZ,QAAQ3tB,EAAO6U,IAAc,IAC7D1R,GAAUmQ,GAAYoB,EAAY1U,EAAO6U,IAAc,EA0BhE,IAAIqsB,GAAYhT,IAAS,SAASxZ,EAAYiT,EAAMnV,GAClD,IAAI9Q,GAAS,EACTujB,EAAwB,mBAAR0C,EAChBvU,EAAS2Y,GAAYrX,GAAchB,EAAMgB,EAAWvR,QAAU,GAKlE,OAHAygB,GAASlP,GAAY,SAAS1U,GAC5BoT,IAAS1R,GAASujB,EAAS5S,GAAMsV,EAAM3nB,EAAOwS,GAAQyW,GAAWjpB,EAAO2nB,EAAMnV,MAEzEY,KA+BL+tB,GAAQ1N,IAAiB,SAASrgB,EAAQpT,EAAOM,GACnDkjB,GAAgBpQ,EAAQ9S,EAAKN,MA6C/B,SAASwX,GAAI9C,EAAY9B,GACvB,IAAIN,EAAOwL,GAAQpJ,GAAcjB,GAAWqY,GAC5C,OAAOxZ,EAAKoC,EAAYyY,GAAYva,EAAU,IAgChD,SAASwuB,GAAQ1sB,EAAYmL,EAAWqN,EAAQ4G,GAC9C,OAAkB,MAAdpf,EACK,IAEJoJ,GAAQ+B,KACXA,EAAyB,MAAbA,EAAoB,GAAK,CAACA,IAExCqN,EAAS4G,EAAQ1tB,EAAY8mB,EACxBpP,GAAQoP,KACXA,EAAmB,MAAVA,EAAiB,GAAK,CAACA,IAE3BD,GAAYvY,EAAYmL,EAAWqN,IAuC5C,IAAImU,GAAY5N,IAAiB,SAASrgB,EAAQpT,EAAOM,GACvD8S,EAAO9S,EAAM,EAAI,GAAG0C,KAAKhD,MACxB,WAAa,MAAO,CAAC,GAAI,OAuC5B,SAASshC,GAAO5sB,EAAY9B,EAAUC,GACpC,IAAIP,EAAOwL,GAAQpJ,GAAcZ,GAAcuB,GAC3CtB,EAAYwgB,UAAUpxB,OAAS,EAEnC,OAAOmP,EAAKoC,EAAYyY,GAAYva,EAAU,GAAIC,EAAakB,EAAW6P,IAyB5E,SAAS2d,GAAY7sB,EAAY9B,EAAUC,GACzC,IAAIP,EAAOwL,GAAQpJ,GAAcV,GAAmBqB,GAChDtB,EAAYwgB,UAAUpxB,OAAS,EAEnC,OAAOmP,EAAKoC,EAAYyY,GAAYva,EAAU,GAAIC,EAAakB,EAAWyS,IAqC5E,SAASgb,GAAO9sB,EAAYzB,GAC1B,IAAIX,EAAOwL,GAAQpJ,GAAcxB,GAAc8T,GAC/C,OAAO1U,EAAKoC,EAAY+sB,GAAOtU,GAAYla,EAAW,KAiBxD,SAAS3P,GAAOoR,GACd,IAAIpC,EAAOwL,GAAQpJ,GAAcsO,GAAcqL,GAC/C,OAAO/b,EAAKoC,GAuBd,SAASgtB,GAAWhtB,EAAYlU,EAAGszB,GAE/BtzB,GADGszB,EAAQC,GAAerf,EAAYlU,EAAGszB,GAAStzB,IAAM4F,GACpD,EAEA0gB,GAAUtmB,GAEhB,IAAI8R,EAAOwL,GAAQpJ,GAAcwO,GAAkBoL,GACnD,OAAOhc,EAAKoC,EAAYlU,GAkB1B,SAASmhC,GAAQjtB,GACf,IAAIpC,EAAOwL,GAAQpJ,GAAc2O,GAAesL,GAChD,OAAOrc,EAAKoC,GAwBd,SAAS+C,GAAK/C,GACZ,GAAkB,MAAdA,EACF,OAAO,EAET,GAAIqX,GAAYrX,GACd,OAAOusB,GAASvsB,GAAcyD,GAAWzD,GAAcA,EAAWvR,OAEpE,IAAI4hB,EAAMC,GAAOtQ,GACjB,OAAIqQ,GAAO3b,GAAU2b,GAAOpb,GACnB+K,EAAW+C,KAEb+T,GAAS9W,GAAYvR,OAuC9B,SAASy+B,GAAKltB,EAAYzB,EAAW6gB,GACnC,IAAIxhB,EAAOwL,GAAQpJ,GAAcT,GAAY4a,GAI7C,OAHIiF,GAASC,GAAerf,EAAYzB,EAAW6gB,KACjD7gB,EAAY7M,GAEPkM,EAAKoC,EAAYyY,GAAYla,EAAW,IAgCjD,IAAI4uB,GAAS3T,IAAS,SAASxZ,EAAYmL,GACzC,GAAkB,MAAdnL,EACF,MAAO,GAET,IAAIvR,EAAS0c,EAAU1c,OAMvB,OALIA,EAAS,GAAK4wB,GAAerf,EAAYmL,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACH1c,EAAS,GAAK4wB,GAAelU,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElBoN,GAAYvY,EAAYuS,GAAYpH,EAAW,GAAI,OAqBxD3a,GAAMiW,IAAU,WAClB,OAAO/c,GAAK4a,KAAK9T,OA6BnB,SAAS48B,GAAMthC,EAAG8R,GAChB,GAAmB,mBAARA,EACT,MAAM,IAAI6G,GAAU3S,GAGtB,OADAhG,EAAIsmB,GAAUtmB,GACP,WACL,KAAMA,EAAI,EACR,OAAO8R,EAAKD,MAAM1T,KAAM41B,YAsB9B,SAAS6B,GAAI9jB,EAAM9R,EAAGszB,GAGpB,OAFAtzB,EAAIszB,EAAQ1tB,EAAY5F,EACxBA,EAAK8R,GAAa,MAAL9R,EAAa8R,EAAKnP,OAAS3C,EACjC+3B,GAAWjmB,EAAM7K,EAAerB,EAAWA,EAAWA,EAAWA,EAAW5F,GAoBrF,SAASuhC,GAAOvhC,EAAG8R,GACjB,IAAIc,EACJ,GAAmB,mBAARd,EACT,MAAM,IAAI6G,GAAU3S,GAGtB,OADAhG,EAAIsmB,GAAUtmB,GACP,WAOL,QANMA,EAAI,IACR4S,EAASd,EAAKD,MAAM1T,KAAM41B,YAExB/zB,GAAK,IACP8R,EAAOlM,GAEFgN,GAuCX,IAAI7S,GAAO2tB,IAAS,SAAS5b,EAAMC,EAASigB,GAC1C,IAAIhO,EAAUtd,EACd,GAAIsrB,EAASrvB,OAAQ,CACnB,IAAIsvB,EAAU3a,GAAe0a,EAAU0C,GAAU30B,KACjDikB,GAAWjd,EAEb,OAAOgxB,GAAWjmB,EAAMkS,EAASjS,EAASigB,EAAUC,MAgDlDuP,GAAU9T,IAAS,SAASztB,EAAQH,EAAKkyB,GAC3C,IAAIhO,EAAUtd,EAAiBC,EAC/B,GAAIqrB,EAASrvB,OAAQ,CACnB,IAAIsvB,EAAU3a,GAAe0a,EAAU0C,GAAU8M,KACjDxd,GAAWjd,EAEb,OAAOgxB,GAAWj4B,EAAKkkB,EAAS/jB,EAAQ+xB,EAAUC,MA4CpD,SAASwP,GAAM3vB,EAAM2iB,EAAOnB,GAC1BmB,EAAQnB,EAAQ1tB,EAAY6uB,EAC5B,IAAI7hB,EAASmlB,GAAWjmB,EAAMjL,EAAiBjB,EAAWA,EAAWA,EAAWA,EAAWA,EAAW6uB,GAEtG,OADA7hB,EAAOuD,YAAcsrB,GAAMtrB,YACpBvD,EAyCT,SAAS8uB,GAAW5vB,EAAM2iB,EAAOnB,GAC/BmB,EAAQnB,EAAQ1tB,EAAY6uB,EAC5B,IAAI7hB,EAASmlB,GAAWjmB,EAAMhL,EAAuBlB,EAAWA,EAAWA,EAAWA,EAAWA,EAAW6uB,GAE5G,OADA7hB,EAAOuD,YAAcurB,GAAWvrB,YACzBvD,EAyDT,SAAS+uB,GAAS7vB,EAAMyT,EAAMqc,GAC5B,IAAIC,EACAC,EACAC,EACAnvB,EACAovB,EACAC,EACAC,EAAiB,EACjBC,GAAU,EACVC,GAAS,EACTlO,GAAW,EAEf,GAAmB,mBAARpiB,EACT,MAAM,IAAI6G,GAAU3S,GAUtB,SAASq8B,EAAWh9B,GAClB,IAAI2M,EAAO6vB,EACP9vB,EAAU+vB,EAKd,OAHAD,EAAWC,EAAWl8B,EACtBs8B,EAAiB78B,EACjBuN,EAASd,EAAKD,MAAME,EAASC,GACtBY,EAGT,SAAS0vB,EAAYj9B,GAMnB,OAJA68B,EAAiB78B,EAEjB28B,EAAUnnB,GAAW0nB,EAAchd,GAE5B4c,EAAUE,EAAWh9B,GAAQuN,EAGtC,SAAS4vB,EAAcn9B,GACrB,IAAIo9B,EAAoBp9B,EAAO48B,EAC3BS,EAAsBr9B,EAAO68B,EAC7BS,EAAcpd,EAAOkd,EAEzB,OAAOL,EACHzmB,GAAUgnB,EAAaZ,EAAUW,GACjCC,EAGN,SAASC,EAAav9B,GACpB,IAAIo9B,EAAoBp9B,EAAO48B,EAC3BS,EAAsBr9B,EAAO68B,EAKjC,OAAQD,IAAiBr8B,GAAc68B,GAAqBld,GACzDkd,EAAoB,GAAOL,GAAUM,GAAuBX,EAGjE,SAASQ,IACP,IAAIl9B,EAAOX,KACX,GAAIk+B,EAAav9B,GACf,OAAOw9B,EAAax9B,GAGtB28B,EAAUnnB,GAAW0nB,EAAcC,EAAcn9B,IAGnD,SAASw9B,EAAax9B,GAKpB,OAJA28B,EAAUp8B,EAINsuB,GAAY2N,EACPQ,EAAWh9B,IAEpBw8B,EAAWC,EAAWl8B,EACfgN,GAGT,SAASkwB,IACHd,IAAYp8B,GACd8U,GAAasnB,GAEfE,EAAiB,EACjBL,EAAWI,EAAeH,EAAWE,EAAUp8B,EAGjD,SAASm9B,IACP,OAAOf,IAAYp8B,EAAYgN,EAASiwB,EAAan+B,MAGvD,SAASs+B,IACP,IAAI39B,EAAOX,KACPu+B,EAAaL,EAAav9B,GAM9B,GAJAw8B,EAAW9N,UACX+N,EAAW3jC,KACX8jC,EAAe58B,EAEX49B,EAAY,CACd,GAAIjB,IAAYp8B,EACd,OAAO08B,EAAYL,GAErB,GAAIG,EAIF,OAFA1nB,GAAasnB,GACbA,EAAUnnB,GAAW0nB,EAAchd,GAC5B8c,EAAWJ,GAMtB,OAHID,IAAYp8B,IACdo8B,EAAUnnB,GAAW0nB,EAAchd,IAE9B3S,EAIT,OA3GA2S,EAAO0R,GAAS1R,IAAS,EACrB3H,GAASgkB,KACXO,IAAYP,EAAQO,QACpBC,EAAS,YAAaR,EACtBG,EAAUK,EAAS3mB,GAAUwb,GAAS2K,EAAQG,UAAY,EAAGxc,GAAQwc,EACrE7N,EAAW,aAAc0N,IAAYA,EAAQ1N,SAAWA,GAoG1D8O,EAAUF,OAASA,EACnBE,EAAUD,MAAQA,EACXC,EAqBT,IAAIE,GAAQxV,IAAS,SAAS5b,EAAME,GAClC,OAAOsT,GAAUxT,EAAM,EAAGE,MAsBxBmxB,GAAQzV,IAAS,SAAS5b,EAAMyT,EAAMvT,GACxC,OAAOsT,GAAUxT,EAAMmlB,GAAS1R,IAAS,EAAGvT,MAqB9C,SAASoxB,GAAKtxB,GACZ,OAAOimB,GAAWjmB,EAAM3K,GA+C1B,SAASkzB,GAAQvoB,EAAMuxB,GACrB,GAAmB,mBAARvxB,GAAmC,MAAZuxB,GAAuC,mBAAZA,EAC3D,MAAM,IAAI1qB,GAAU3S,GAEtB,IAAIs9B,EAAW,WACb,IAAItxB,EAAO+hB,UACPj0B,EAAMujC,EAAWA,EAASxxB,MAAM1T,KAAM6T,GAAQA,EAAK,GACnD4D,EAAQ0tB,EAAS1tB,MAErB,GAAIA,EAAMC,IAAI/V,GACZ,OAAO8V,EAAMxW,IAAIU,GAEnB,IAAI8S,EAASd,EAAKD,MAAM1T,KAAM6T,GAE9B,OADAsxB,EAAS1tB,MAAQA,EAAM4B,IAAI1X,EAAK8S,IAAWgD,EACpChD,GAGT,OADA0wB,EAAS1tB,MAAQ,IAAKykB,GAAQkJ,OAASziB,IAChCwiB,EA0BT,SAASrC,GAAOxuB,GACd,GAAwB,mBAAbA,EACT,MAAM,IAAIkG,GAAU3S,GAEtB,OAAO,WACL,IAAIgM,EAAO+hB,UACX,OAAQ/hB,EAAKrP,QACX,KAAK,EAAG,OAAQ8P,EAAU/T,KAAKP,MAC/B,KAAK,EAAG,OAAQsU,EAAU/T,KAAKP,KAAM6T,EAAK,IAC1C,KAAK,EAAG,OAAQS,EAAU/T,KAAKP,KAAM6T,EAAK,GAAIA,EAAK,IACnD,KAAK,EAAG,OAAQS,EAAU/T,KAAKP,KAAM6T,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE9D,OAAQS,EAAUZ,MAAM1T,KAAM6T,IAsBlC,SAASwxB,GAAK1xB,GACZ,OAAOyvB,GAAO,EAAGzvB,GAzDnBuoB,GAAQkJ,MAAQziB,GA2FhB,IAAI2iB,GAAWjT,IAAS,SAAS1e,EAAM2nB,GACrCA,EAAmC,GAArBA,EAAW92B,QAAe2a,GAAQmc,EAAW,IACvDxmB,GAASwmB,EAAW,GAAIhkB,GAAUkX,OAClC1Z,GAASwT,GAAYgT,EAAY,GAAIhkB,GAAUkX,OAEnD,IAAI+W,EAAcjK,EAAW92B,OAC7B,OAAO+qB,IAAS,SAAS1b,GACvB,IAAI9Q,GAAS,EACTyB,EAASgZ,GAAU3J,EAAKrP,OAAQ+gC,GAEpC,QAASxiC,EAAQyB,EACfqP,EAAK9Q,GAASu4B,EAAWv4B,GAAOxC,KAAKP,KAAM6T,EAAK9Q,IAElD,OAAO2Q,GAAMC,EAAM3T,KAAM6T,SAqCzB2xB,GAAUjW,IAAS,SAAS5b,EAAMkgB,GACpC,IAAIC,EAAU3a,GAAe0a,EAAU0C,GAAUiP,KACjD,OAAO5L,GAAWjmB,EAAM/K,EAAmBnB,EAAWosB,EAAUC,MAmC9D2R,GAAelW,IAAS,SAAS5b,EAAMkgB,GACzC,IAAIC,EAAU3a,GAAe0a,EAAU0C,GAAUkP,KACjD,OAAO7L,GAAWjmB,EAAM9K,EAAyBpB,EAAWosB,EAAUC,MAyBpE4R,GAAQ7O,IAAS,SAASljB,EAAMub,GAClC,OAAO0K,GAAWjmB,EAAM5K,EAAiBtB,EAAWA,EAAWA,EAAWynB,MA4B5E,SAASyW,GAAKhyB,EAAMrQ,GAClB,GAAmB,mBAARqQ,EACT,MAAM,IAAI6G,GAAU3S,GAGtB,OADAvE,EAAQA,IAAUmE,EAAYnE,EAAQ6kB,GAAU7kB,GACzCisB,GAAS5b,EAAMrQ,GAqCxB,SAASsiC,GAAOjyB,EAAMrQ,GACpB,GAAmB,mBAARqQ,EACT,MAAM,IAAI6G,GAAU3S,GAGtB,OADAvE,EAAiB,MAATA,EAAgB,EAAIga,GAAU6K,GAAU7kB,GAAQ,GACjDisB,IAAS,SAAS1b,GACvB,IAAIE,EAAQF,EAAKvQ,GACbg5B,EAAYhK,GAAUze,EAAM,EAAGvQ,GAKnC,OAHIyQ,GACFiB,GAAUsnB,EAAWvoB,GAEhBL,GAAMC,EAAM3T,KAAMs8B,MAgD7B,SAASuJ,GAASlyB,EAAMyT,EAAMqc,GAC5B,IAAIO,GAAU,EACVjO,GAAW,EAEf,GAAmB,mBAARpiB,EACT,MAAM,IAAI6G,GAAU3S,GAMtB,OAJI4X,GAASgkB,KACXO,EAAU,YAAaP,IAAYA,EAAQO,QAAUA,EACrDjO,EAAW,aAAc0N,IAAYA,EAAQ1N,SAAWA,GAEnDyN,GAAS7vB,EAAMyT,EAAM,CAC1B,QAAW4c,EACX,QAAW5c,EACX,SAAY2O,IAmBhB,SAAS+P,GAAMnyB,GACb,OAAO8jB,GAAI9jB,EAAM,GAyBnB,SAASoyB,GAAK1kC,EAAOq0B,GACnB,OAAO8P,GAAQrT,GAAauD,GAAUr0B,GAsCxC,SAAS2kC,KACP,IAAKpQ,UAAUpxB,OACb,MAAO,GAET,IAAInD,EAAQu0B,UAAU,GACtB,OAAOzW,GAAQ9d,GAASA,EAAQ,CAACA,GA6BnC,SAASof,GAAMpf,GACb,OAAOukB,GAAUvkB,EAAO+G,GAkC1B,SAAS69B,GAAU5kC,EAAOykB,GAExB,OADAA,EAAkC,mBAAdA,EAA2BA,EAAare,EACrDme,GAAUvkB,EAAO+G,EAAoB0d,GAqB9C,SAASogB,GAAU7kC,GACjB,OAAOukB,GAAUvkB,EAAO6G,EAAkBE,GA+B5C,SAAS+9B,GAAc9kC,EAAOykB,GAE5B,OADAA,EAAkC,mBAAdA,EAA2BA,EAAare,EACrDme,GAAUvkB,EAAO6G,EAAkBE,EAAoB0d,GA2BhE,SAASsgB,GAAWtkC,EAAQ0K,GAC1B,OAAiB,MAAVA,GAAkB0a,GAAeplB,EAAQ0K,EAAQ2O,GAAK3O,IAmC/D,SAASoY,GAAGvjB,EAAOooB,GACjB,OAAOpoB,IAAUooB,GAAUpoB,IAAUA,GAASooB,IAAUA,EA0B1D,IAAI4c,GAAKxN,GAA0BrP,IAyB/B8c,GAAMzN,IAA0B,SAASx3B,EAAOooB,GAClD,OAAOpoB,GAASooB,KAqBdzF,GAAcyG,GAAgB,WAAa,OAAOmL,UAApB,IAAsCnL,GAAkB,SAASppB,GACjG,OAAO6d,GAAa7d,IAAUY,GAAe1B,KAAKc,EAAO,YACtD0a,GAAqBxb,KAAKc,EAAO,WA0BlC8d,GAAUpK,EAAMoK,QAmBhBpM,GAAgBD,GAAoBwE,GAAUxE,IAAqB4X,GA2BvE,SAAS0C,GAAY/rB,GACnB,OAAgB,MAATA,GAAiBmrB,GAASnrB,EAAMmD,UAAYskB,GAAWznB,GA4BhE,SAAS4sB,GAAkB5sB,GACzB,OAAO6d,GAAa7d,IAAU+rB,GAAY/rB,GAoB5C,SAASklC,GAAUllC,GACjB,OAAiB,IAAVA,IAA4B,IAAVA,GACtB6d,GAAa7d,IAAUgoB,GAAWhoB,IAAU8I,EAoBjD,IAAI+S,GAAWD,IAAkB+e,GAmB7B/oB,GAASD,GAAasE,GAAUtE,IAAc2X,GAmBlD,SAAS6b,GAAUnlC,GACjB,OAAO6d,GAAa7d,IAA6B,IAAnBA,EAAMgR,WAAmB8b,GAAc9sB,GAoCvE,SAASolC,GAAQplC,GACf,GAAa,MAATA,EACF,OAAO,EAET,GAAI+rB,GAAY/rB,KACX8d,GAAQ9d,IAA0B,iBAATA,GAA4C,mBAAhBA,EAAM2a,QAC1DkB,GAAS7b,IAAUoS,GAAapS,IAAU2iB,GAAY3iB,IAC1D,OAAQA,EAAMmD,OAEhB,IAAI4hB,EAAMC,GAAOhlB,GACjB,GAAI+kB,GAAO3b,GAAU2b,GAAOpb,GAC1B,OAAQ3J,EAAMyX,KAEhB,GAAIgU,GAAYzrB,GACd,OAAQwrB,GAASxrB,GAAOmD,OAE1B,IAAK,IAAI7C,KAAON,EACd,GAAIY,GAAe1B,KAAKc,EAAOM,GAC7B,OAAO,EAGX,OAAO,EA+BT,SAAS+kC,GAAQrlC,EAAOooB,GACtB,OAAOmB,GAAYvpB,EAAOooB,GAmC5B,SAASkd,GAAYtlC,EAAOooB,EAAO3D,GACjCA,EAAkC,mBAAdA,EAA2BA,EAAare,EAC5D,IAAIgN,EAASqR,EAAaA,EAAWzkB,EAAOooB,GAAShiB,EACrD,OAAOgN,IAAWhN,EAAYmjB,GAAYvpB,EAAOooB,EAAOhiB,EAAWqe,KAAgBrR,EAqBrF,SAASmyB,GAAQvlC,GACf,IAAK6d,GAAa7d,GAChB,OAAO,EAET,IAAI+kB,EAAMiD,GAAWhoB,GACrB,OAAO+kB,GAAO9b,GAAY8b,GAAO/b,GACN,iBAAjBhJ,EAAMk5B,SAA4C,iBAAdl5B,EAAMV,OAAqBwtB,GAAc9sB,GA6BzF,SAAS0E,GAAS1E,GAChB,MAAuB,iBAATA,GAAqB8b,GAAe9b,GAoBpD,SAASynB,GAAWznB,GAClB,IAAKoe,GAASpe,GACZ,OAAO,EAIT,IAAI+kB,EAAMiD,GAAWhoB,GACrB,OAAO+kB,GAAO7b,GAAW6b,GAAO5b,GAAU4b,GAAOlc,GAAYkc,GAAOtb,GA6BtE,SAAS+7B,GAAUxlC,GACjB,MAAuB,iBAATA,GAAqBA,GAAS8mB,GAAU9mB,GA6BxD,SAASmrB,GAASnrB,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAASoI,EA4B7C,SAASgW,GAASpe,GAChB,IAAI+F,SAAc/F,EAClB,OAAgB,MAATA,IAA0B,UAAR+F,GAA4B,YAARA,GA2B/C,SAAS8X,GAAa7d,GACpB,OAAgB,MAATA,GAAiC,iBAATA,EAoBjC,IAAI8R,GAAQD,GAAYoE,GAAUpE,IAAa2Y,GA8B/C,SAASib,GAAQhlC,EAAQ0K,GACvB,OAAO1K,IAAW0K,GAAUsf,GAAYhqB,EAAQ0K,EAAQ6gB,GAAa7gB,IAmCvE,SAASu6B,GAAYjlC,EAAQ0K,EAAQsZ,GAEnC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAare,EACrDqkB,GAAYhqB,EAAQ0K,EAAQ6gB,GAAa7gB,GAASsZ,GA+B3D,SAASriB,GAAMpC,GAIb,OAAO2lC,GAAS3lC,IAAUA,IAAUA,EA6BtC,SAAS4lC,GAAS5lC,GAChB,GAAI06B,GAAW16B,GACb,MAAM,IAAIiZ,EAAM1S,GAElB,OAAOskB,GAAa7qB,GAoBtB,SAAS6lC,GAAO7lC,GACd,OAAiB,OAAVA,EAuBT,SAAS8lC,GAAM9lC,GACb,OAAgB,MAATA,EA6BT,SAAS2lC,GAAS3lC,GAChB,MAAuB,iBAATA,GACX6d,GAAa7d,IAAUgoB,GAAWhoB,IAAUqJ,GA+BjD,SAASyjB,GAAc9sB,GACrB,IAAK6d,GAAa7d,IAAUgoB,GAAWhoB,IAAUuJ,GAC/C,OAAO,EAET,IAAI4U,EAAQ5D,GAAava,GACzB,GAAc,OAAVme,EACF,OAAO,EAET,IAAIgW,EAAOvzB,GAAe1B,KAAKif,EAAO,gBAAkBA,EAAM/Z,YAC9D,MAAsB,mBAAR+vB,GAAsBA,aAAgBA,GAClD3a,GAAata,KAAKi1B,IAASla,GAoB/B,IAAIjI,GAAWD,GAAekE,GAAUlE,IAAgBiZ,GA6BxD,SAAS+a,GAAc/lC,GACrB,OAAOwlC,GAAUxlC,IAAUA,IAAUoI,GAAoBpI,GAASoI,EAoBpE,IAAI8J,GAAQD,GAAYgE,GAAUhE,IAAagZ,GAmB/C,SAASgW,GAASjhC,GAChB,MAAuB,iBAATA,IACV8d,GAAQ9d,IAAU6d,GAAa7d,IAAUgoB,GAAWhoB,IAAU4J,GAoBpE,SAASgd,GAAS5mB,GAChB,MAAuB,iBAATA,GACX6d,GAAa7d,IAAUgoB,GAAWhoB,IAAU6J,GAoBjD,IAAIuI,GAAeD,GAAmB8D,GAAU9D,IAAoB+Y,GAmBpE,SAAS8a,GAAYhmC,GACnB,OAAOA,IAAUoG,EAoBnB,SAAS6/B,GAAUjmC,GACjB,OAAO6d,GAAa7d,IAAUglB,GAAOhlB,IAAU+J,GAoBjD,SAASm8B,GAAUlmC,GACjB,OAAO6d,GAAa7d,IAAUgoB,GAAWhoB,IAAUgK,GA0BrD,IAAIm8B,GAAK3O,GAA0B3L,IAyB/Bua,GAAM5O,IAA0B,SAASx3B,EAAOooB,GAClD,OAAOpoB,GAASooB,KA0BlB,SAAS6X,GAAQjgC,GACf,IAAKA,EACH,MAAO,GAET,GAAI+rB,GAAY/rB,GACd,OAAOihC,GAASjhC,GAASqY,GAAcrY,GAASkf,GAAUlf,GAE5D,GAAI8a,IAAe9a,EAAM8a,IACvB,OAAO1D,GAAgBpX,EAAM8a,OAE/B,IAAIiK,EAAMC,GAAOhlB,GACbsS,EAAOyS,GAAO3b,EAASmO,GAAcwN,GAAOpb,GAASoO,GAAanE,GAEtE,OAAOtB,EAAKtS,GA0Bd,SAASu3B,GAASv3B,GAChB,IAAKA,EACH,OAAiB,IAAVA,EAAcA,EAAQ,EAG/B,GADAA,EAAQy3B,GAASz3B,GACbA,IAAUmI,GAAYnI,KAAWmI,EAAU,CAC7C,IAAIk+B,EAAQrmC,EAAQ,GAAK,EAAI,EAC7B,OAAOqmC,EAAOh+B,EAEhB,OAAOrI,IAAUA,EAAQA,EAAQ,EA6BnC,SAAS8mB,GAAU9mB,GACjB,IAAIoT,EAASmkB,GAASv3B,GAClBsmC,EAAYlzB,EAAS,EAEzB,OAAOA,IAAWA,EAAUkzB,EAAYlzB,EAASkzB,EAAYlzB,EAAU,EA8BzE,SAAS2T,GAAS/mB,GAChB,OAAOA,EAAQojB,GAAU0D,GAAU9mB,GAAQ,EAAGuI,GAAoB,EA0BpE,SAASkvB,GAASz3B,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAI4mB,GAAS5mB,GACX,OAAOsI,EAET,GAAI8V,GAASpe,GAAQ,CACnB,IAAIooB,EAAgC,mBAAjBpoB,EAAM0d,QAAwB1d,EAAM0d,UAAY1d,EACnEA,EAAQoe,GAASgK,GAAUA,EAAQ,GAAMA,EAE3C,GAAoB,iBAATpoB,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQ6V,GAAS7V,GACjB,IAAIumC,EAAW/5B,GAAW0K,KAAKlX,GAC/B,OAAQumC,GAAY75B,GAAUwK,KAAKlX,GAC/ByQ,GAAazQ,EAAM8V,MAAM,GAAIywB,EAAW,EAAI,GAC3Ch6B,GAAW2K,KAAKlX,GAASsI,GAAOtI,EA2BvC,SAAS+sB,GAAc/sB,GACrB,OAAO8jB,GAAW9jB,EAAOgkB,GAAOhkB,IA2BlC,SAASwmC,GAAcxmC,GACrB,OAAOA,EACHojB,GAAU0D,GAAU9mB,IAASoI,EAAkBA,GACpC,IAAVpI,EAAcA,EAAQ,EAwB7B,SAASyZ,GAASzZ,GAChB,OAAgB,MAATA,EAAgB,GAAK+vB,GAAa/vB,GAqC3C,IAAIymC,GAAS9S,IAAe,SAASlzB,EAAQ0K,GAC3C,GAAIsgB,GAAYtgB,IAAW4gB,GAAY5gB,GACrC2Y,GAAW3Y,EAAQ2O,GAAK3O,GAAS1K,QAGnC,IAAK,IAAIH,KAAO6K,EACVvK,GAAe1B,KAAKiM,EAAQ7K,IAC9BmjB,GAAYhjB,EAAQH,EAAK6K,EAAO7K,OAoClComC,GAAW/S,IAAe,SAASlzB,EAAQ0K,GAC7C2Y,GAAW3Y,EAAQ6Y,GAAO7Y,GAAS1K,MAgCjCkmC,GAAehT,IAAe,SAASlzB,EAAQ0K,EAAQmhB,EAAU7H,GACnEX,GAAW3Y,EAAQ6Y,GAAO7Y,GAAS1K,EAAQgkB,MA+BzCmiB,GAAajT,IAAe,SAASlzB,EAAQ0K,EAAQmhB,EAAU7H,GACjEX,GAAW3Y,EAAQ2O,GAAK3O,GAAS1K,EAAQgkB,MAoBvCoiB,GAAKrR,GAASvR,IAoClB,SAAS5jB,GAAOM,EAAWmmC,GACzB,IAAI1zB,EAAS8K,GAAWvd,GACxB,OAAqB,MAAdmmC,EAAqB1zB,EAASyQ,GAAWzQ,EAAQ0zB,GAwB1D,IAAIhuB,GAAWoV,IAAS,SAASztB,EAAQozB,GACvCpzB,EAAShB,GAAOgB,GAEhB,IAAIiB,GAAS,EACTyB,EAAS0wB,EAAQ1wB,OACjB2wB,EAAQ3wB,EAAS,EAAI0wB,EAAQ,GAAKztB,EAElC0tB,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClD3wB,EAAS,GAGX,QAASzB,EAAQyB,EAAQ,CACvB,IAAIgI,EAAS0oB,EAAQnyB,GACjBkU,EAAQoO,GAAO7Y,GACf47B,GAAc,EACdC,EAAcpxB,EAAMzS,OAExB,QAAS4jC,EAAaC,EAAa,CACjC,IAAI1mC,EAAMsV,EAAMmxB,GACZ/mC,EAAQS,EAAOH,IAEfN,IAAUoG,GACTmd,GAAGvjB,EAAOsZ,GAAYhZ,MAAUM,GAAe1B,KAAKuB,EAAQH,MAC/DG,EAAOH,GAAO6K,EAAO7K,KAK3B,OAAOG,KAsBLwmC,GAAe/Y,IAAS,SAAS1b,GAEnC,OADAA,EAAKxP,KAAKoD,EAAWsyB,IACdrmB,GAAM60B,GAAW9gC,EAAWoM,MAsCrC,SAAS20B,GAAQ1mC,EAAQwS,GACvB,OAAOwB,GAAYhU,EAAQ0sB,GAAYla,EAAW,GAAIsT,IAsCxD,SAAS6gB,GAAY3mC,EAAQwS,GAC3B,OAAOwB,GAAYhU,EAAQ0sB,GAAYla,EAAW,GAAIwT,IA+BxD,SAAS4gB,GAAM5mC,EAAQmS,GACrB,OAAiB,MAAVnS,EACHA,EACA4mB,GAAQ5mB,EAAQ0sB,GAAYva,EAAU,GAAIoR,IA6BhD,SAASsjB,GAAW7mC,EAAQmS,GAC1B,OAAiB,MAAVnS,EACHA,EACA8mB,GAAa9mB,EAAQ0sB,GAAYva,EAAU,GAAIoR,IA+BrD,SAASujB,GAAO9mC,EAAQmS,GACtB,OAAOnS,GAAU8lB,GAAW9lB,EAAQ0sB,GAAYva,EAAU,IA6B5D,SAAS40B,GAAY/mC,EAAQmS,GAC3B,OAAOnS,GAAUgmB,GAAgBhmB,EAAQ0sB,GAAYva,EAAU,IA0BjE,SAAS60B,GAAUhnC,GACjB,OAAiB,MAAVA,EAAiB,GAAK+mB,GAAc/mB,EAAQqZ,GAAKrZ,IA0B1D,SAASinC,GAAYjnC,GACnB,OAAiB,MAAVA,EAAiB,GAAK+mB,GAAc/mB,EAAQujB,GAAOvjB,IA4B5D,SAASb,GAAIa,EAAQknB,EAAMoP,GACzB,IAAI3jB,EAAmB,MAAV3S,EAAiB2F,EAAYshB,GAAQjnB,EAAQknB,GAC1D,OAAOvU,IAAWhN,EAAY2wB,EAAe3jB,EA8B/C,SAASiD,GAAI5V,EAAQknB,GACnB,OAAiB,MAAVlnB,GAAkB05B,GAAQ15B,EAAQknB,EAAMU,IA6BjD,SAAS+D,GAAM3rB,EAAQknB,GACrB,OAAiB,MAAVlnB,GAAkB05B,GAAQ15B,EAAQknB,EAAMW,IAqBjD,IAAIqf,GAAShR,IAAe,SAASvjB,EAAQpT,EAAOM,GACrC,MAATN,GACyB,mBAAlBA,EAAMyZ,WACfzZ,EAAQga,GAAqB9a,KAAKc,IAGpCoT,EAAOpT,GAASM,IACfouB,GAASrD,KA4BRuc,GAAWjR,IAAe,SAASvjB,EAAQpT,EAAOM,GACvC,MAATN,GACyB,mBAAlBA,EAAMyZ,WACfzZ,EAAQga,GAAqB9a,KAAKc,IAGhCY,GAAe1B,KAAKkU,EAAQpT,GAC9BoT,EAAOpT,GAAOgD,KAAK1C,GAEnB8S,EAAOpT,GAAS,CAACM,KAElB6sB,IAoBC0a,GAAS3Z,GAASjF,IA8BtB,SAASnP,GAAKrZ,GACZ,OAAOsrB,GAAYtrB,GAAU+hB,GAAc/hB,GAAU+qB,GAAS/qB,GA0BhE,SAASujB,GAAOvjB,GACd,OAAOsrB,GAAYtrB,GAAU+hB,GAAc/hB,GAAQ,GAAQirB,GAAWjrB,GAwBxE,SAASqnC,GAAQrnC,EAAQmS,GACvB,IAAIQ,EAAS,GAMb,OALAR,EAAWua,GAAYva,EAAU,GAEjC2T,GAAW9lB,GAAQ,SAAST,EAAOM,EAAKG,GACtC+iB,GAAgBpQ,EAAQR,EAAS5S,EAAOM,EAAKG,GAAST,MAEjDoT,EA+BT,SAAS20B,GAAUtnC,EAAQmS,GACzB,IAAIQ,EAAS,GAMb,OALAR,EAAWua,GAAYva,EAAU,GAEjC2T,GAAW9lB,GAAQ,SAAST,EAAOM,EAAKG,GACtC+iB,GAAgBpQ,EAAQ9S,EAAKsS,EAAS5S,EAAOM,EAAKG,OAE7C2S,EAkCT,IAAI40B,GAAQrU,IAAe,SAASlzB,EAAQ0K,EAAQmhB,GAClDD,GAAU5rB,EAAQ0K,EAAQmhB,MAkCxB4a,GAAYvT,IAAe,SAASlzB,EAAQ0K,EAAQmhB,EAAU7H,GAChE4H,GAAU5rB,EAAQ0K,EAAQmhB,EAAU7H,MAuBlCwjB,GAAOzS,IAAS,SAAS/0B,EAAQyjB,GACnC,IAAI9Q,EAAS,GACb,GAAc,MAAV3S,EACF,OAAO2S,EAET,IAAIuR,GAAS,EACbT,EAAQzQ,GAASyQ,GAAO,SAASyD,GAG/B,OAFAA,EAAOC,GAASD,EAAMlnB,GACtBkkB,IAAWA,EAASgD,EAAKxkB,OAAS,GAC3BwkB,KAET7D,GAAWrjB,EAAQilB,GAAajlB,GAAS2S,GACrCuR,IACFvR,EAASmR,GAAUnR,EAAQvM,EAAkBC,EAAkBC,EAAoB4xB,KAErF,IAAIx1B,EAAS+gB,EAAM/gB,OACnB,MAAOA,IACL4qB,GAAU3a,EAAQ8Q,EAAM/gB,IAE1B,OAAOiQ,KAuBT,SAAS80B,GAAOznC,EAAQwS,GACtB,OAAOk1B,GAAO1nC,EAAQghC,GAAOtU,GAAYla,KAoB3C,IAAI8F,GAAOyc,IAAS,SAAS/0B,EAAQyjB,GACnC,OAAiB,MAAVzjB,EAAiB,GAAK6sB,GAAS7sB,EAAQyjB,MAqBhD,SAASikB,GAAO1nC,EAAQwS,GACtB,GAAc,MAAVxS,EACF,MAAO,GAET,IAAImV,EAAQnC,GAASiS,GAAajlB,IAAS,SAAS2nC,GAClD,MAAO,CAACA,MAGV,OADAn1B,EAAYka,GAAYla,GACjBsa,GAAW9sB,EAAQmV,GAAO,SAAS5V,EAAO2nB,GAC/C,OAAO1U,EAAUjT,EAAO2nB,EAAK,OAiCjC,SAASvU,GAAO3S,EAAQknB,EAAMoP,GAC5BpP,EAAOC,GAASD,EAAMlnB,GAEtB,IAAIiB,GAAS,EACTyB,EAASwkB,EAAKxkB,OAGbA,IACHA,EAAS,EACT1C,EAAS2F,GAEX,QAAS1E,EAAQyB,EAAQ,CACvB,IAAInD,EAAkB,MAAVS,EAAiB2F,EAAY3F,EAAOonB,GAAMF,EAAKjmB,KACvD1B,IAAUoG,IACZ1E,EAAQyB,EACRnD,EAAQ+2B,GAEVt2B,EAASgnB,GAAWznB,GAASA,EAAMd,KAAKuB,GAAUT,EAEpD,OAAOS,EA+BT,SAASuX,GAAIvX,EAAQknB,EAAM3nB,GACzB,OAAiB,MAAVS,EAAiBA,EAAS+sB,GAAQ/sB,EAAQknB,EAAM3nB,GA2BzD,SAASqoC,GAAQ5nC,EAAQknB,EAAM3nB,EAAOykB,GAEpC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAare,EAC3C,MAAV3F,EAAiBA,EAAS+sB,GAAQ/sB,EAAQknB,EAAM3nB,EAAOykB,GA2BhE,IAAI6jB,GAAUhQ,GAAcxe,IA0BxByuB,GAAYjQ,GAActU,IAgC9B,SAASpM,GAAUnX,EAAQmS,EAAUC,GACnC,IAAI0M,EAAQzB,GAAQrd,GAChB+nC,EAAYjpB,GAAS1D,GAASpb,IAAW2R,GAAa3R,GAG1D,GADAmS,EAAWua,GAAYva,EAAU,GACd,MAAfC,EAAqB,CACvB,IAAIshB,EAAO1zB,GAAUA,EAAO2D,YAE1ByO,EADE21B,EACYjpB,EAAQ,IAAI4U,EAAO,GAE1B/V,GAAS3d,IACFgnB,GAAW0M,GAAQjW,GAAW3D,GAAa9Z,IAG3C,GAMlB,OAHC+nC,EAAY11B,GAAYyT,IAAY9lB,GAAQ,SAAST,EAAO0B,EAAOjB,GAClE,OAAOmS,EAASC,EAAa7S,EAAO0B,EAAOjB,MAEtCoS,EA8BT,SAAS41B,GAAMhoC,EAAQknB,GACrB,OAAiB,MAAVlnB,GAAwBstB,GAAUttB,EAAQknB,GA8BnD,SAAS+gB,GAAOjoC,EAAQknB,EAAMyI,GAC5B,OAAiB,MAAV3vB,EAAiBA,EAAS0vB,GAAW1vB,EAAQknB,EAAMmJ,GAAaV,IA2BzE,SAASuY,GAAWloC,EAAQknB,EAAMyI,EAAS3L,GAEzC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAare,EAC3C,MAAV3F,EAAiBA,EAAS0vB,GAAW1vB,EAAQknB,EAAMmJ,GAAaV,GAAU3L,GA6BnF,SAAS7Q,GAAOnT,GACd,OAAiB,MAAVA,EAAiB,GAAKyV,GAAWzV,EAAQqZ,GAAKrZ,IA2BvD,SAASmoC,GAASnoC,GAChB,OAAiB,MAAVA,EAAiB,GAAKyV,GAAWzV,EAAQujB,GAAOvjB,IAwBzD,SAASooC,GAAMzkB,EAAQC,EAAOC,GAa5B,OAZIA,IAAUle,IACZke,EAAQD,EACRA,EAAQje,GAENke,IAAUle,IACZke,EAAQmT,GAASnT,GACjBA,EAAQA,IAAUA,EAAQA,EAAQ,GAEhCD,IAAUje,IACZie,EAAQoT,GAASpT,GACjBA,EAAQA,IAAUA,EAAQA,EAAQ,GAE7BjB,GAAUqU,GAASrT,GAASC,EAAOC,GAyC5C,SAASwkB,GAAQ1kB,EAAQniB,EAAO2d,GAS9B,OARA3d,EAAQs1B,GAASt1B,GACb2d,IAAQxZ,GACVwZ,EAAM3d,EACNA,EAAQ,GAER2d,EAAM2X,GAAS3X,GAEjBwE,EAASqT,GAASrT,GACXmE,GAAYnE,EAAQniB,EAAO2d,GAkCpC,SAASpD,GAAO6H,EAAOC,EAAOykB,GA2B5B,GA1BIA,GAA+B,kBAAZA,GAAyBhV,GAAe1P,EAAOC,EAAOykB,KAC3EzkB,EAAQykB,EAAW3iC,GAEjB2iC,IAAa3iC,IACK,kBAATke,GACTykB,EAAWzkB,EACXA,EAAQle,GAEe,kBAATie,IACd0kB,EAAW1kB,EACXA,EAAQje,IAGRie,IAAUje,GAAake,IAAUle,GACnCie,EAAQ,EACRC,EAAQ,IAGRD,EAAQkT,GAASlT,GACbC,IAAUle,GACZke,EAAQD,EACRA,EAAQ,GAERC,EAAQiT,GAASjT,IAGjBD,EAAQC,EAAO,CACjB,IAAI0kB,EAAO3kB,EACXA,EAAQC,EACRA,EAAQ0kB,EAEV,GAAID,GAAY1kB,EAAQ,GAAKC,EAAQ,EAAG,CACtC,IAAIoX,EAAOnf,KACX,OAAOJ,GAAUkI,EAASqX,GAAQpX,EAAQD,EAAQ9T,GAAe,QAAUmrB,EAAO,IAAIv4B,OAAS,KAAOmhB,GAExG,OAAOrB,GAAWoB,EAAOC,GAyB3B,IAAI2kB,GAAYtU,IAAiB,SAASvhB,EAAQ81B,EAAMxnC,GAEtD,OADAwnC,EAAOA,EAAKC,cACL/1B,GAAU1R,EAAQ0nC,GAAWF,GAAQA,MAkB9C,SAASE,GAAW/0B,GAClB,OAAOg1B,GAAW5vB,GAASpF,GAAQ80B,eAqBrC,SAASrU,GAAOzgB,GAEd,OADAA,EAASoF,GAASpF,GACXA,GAAUA,EAAO2B,QAAQpJ,GAASgK,IAAcZ,QAAQtG,GAAa,IA0B9E,SAAS45B,GAASj1B,EAAQk1B,EAAQC,GAChCn1B,EAASoF,GAASpF,GAClBk1B,EAASxZ,GAAawZ,GAEtB,IAAIpmC,EAASkR,EAAOlR,OACpBqmC,EAAWA,IAAapjC,EACpBjD,EACAigB,GAAU0D,GAAU0iB,GAAW,EAAGrmC,GAEtC,IAAIyc,EAAM4pB,EAEV,OADAA,GAAYD,EAAOpmC,OACZqmC,GAAY,GAAKn1B,EAAOyB,MAAM0zB,EAAU5pB,IAAQ2pB,EA+BzD,SAASE,GAAOp1B,GAEd,OADAA,EAASoF,GAASpF,GACVA,GAAUjJ,GAAmB8L,KAAK7C,GACtCA,EAAO2B,QAAQhL,GAAiB6L,IAChCxC,EAkBN,SAASq1B,GAAar1B,GAEpB,OADAA,EAASoF,GAASpF,GACVA,GAAUzI,GAAgBsL,KAAK7C,GACnCA,EAAO2B,QAAQrK,GAAc,QAC7B0I,EAwBN,IAAIs1B,GAAYhV,IAAiB,SAASvhB,EAAQ81B,EAAMxnC,GACtD,OAAO0R,GAAU1R,EAAQ,IAAM,IAAMwnC,EAAKC,iBAuBxCS,GAAYjV,IAAiB,SAASvhB,EAAQ81B,EAAMxnC,GACtD,OAAO0R,GAAU1R,EAAQ,IAAM,IAAMwnC,EAAKC,iBAoBxCU,GAAarV,GAAgB,eAyBjC,SAASsV,GAAIz1B,EAAQlR,EAAQg0B,GAC3B9iB,EAASoF,GAASpF,GAClBlR,EAAS2jB,GAAU3jB,GAEnB,IAAI4mC,EAAY5mC,EAASgV,GAAW9D,GAAU,EAC9C,IAAKlR,GAAU4mC,GAAa5mC,EAC1B,OAAOkR,EAET,IAAI6a,GAAO/rB,EAAS4mC,GAAa,EACjC,OACE7S,GAAc1b,GAAY0T,GAAMiI,GAChC9iB,EACA6iB,GAAc5b,GAAW4T,GAAMiI,GA2BnC,SAAS6S,GAAO31B,EAAQlR,EAAQg0B,GAC9B9iB,EAASoF,GAASpF,GAClBlR,EAAS2jB,GAAU3jB,GAEnB,IAAI4mC,EAAY5mC,EAASgV,GAAW9D,GAAU,EAC9C,OAAQlR,GAAU4mC,EAAY5mC,EACzBkR,EAAS6iB,GAAc/zB,EAAS4mC,EAAW5S,GAC5C9iB,EA0BN,SAAS41B,GAAS51B,EAAQlR,EAAQg0B,GAChC9iB,EAASoF,GAASpF,GAClBlR,EAAS2jB,GAAU3jB,GAEnB,IAAI4mC,EAAY5mC,EAASgV,GAAW9D,GAAU,EAC9C,OAAQlR,GAAU4mC,EAAY5mC,EACzB+zB,GAAc/zB,EAAS4mC,EAAW5S,GAAS9iB,EAC5CA,EA2BN,SAAS3D,GAAS2D,EAAQ61B,EAAOpW,GAM/B,OALIA,GAAkB,MAAToW,EACXA,EAAQ,EACCA,IACTA,GAASA,GAEJ5tB,GAAe7C,GAASpF,GAAQ2B,QAAQnK,GAAa,IAAKq+B,GAAS,GAyB5E,SAASC,GAAO91B,EAAQ7T,EAAGszB,GAMzB,OAJEtzB,GADGszB,EAAQC,GAAe1f,EAAQ7T,EAAGszB,GAAStzB,IAAM4F,GAChD,EAEA0gB,GAAUtmB,GAETytB,GAAWxU,GAASpF,GAAS7T,GAsBtC,SAASwV,KACP,IAAIxD,EAAO+hB,UACPlgB,EAASoF,GAASjH,EAAK,IAE3B,OAAOA,EAAKrP,OAAS,EAAIkR,EAASA,EAAO2B,QAAQxD,EAAK,GAAIA,EAAK,IAwBjE,IAAI43B,GAAYzV,IAAiB,SAASvhB,EAAQ81B,EAAMxnC,GACtD,OAAO0R,GAAU1R,EAAQ,IAAM,IAAMwnC,EAAKC,iBAsB5C,SAAS70B,GAAMD,EAAQ8oB,EAAWkN,GAKhC,OAJIA,GAAyB,iBAATA,GAAqBtW,GAAe1f,EAAQ8oB,EAAWkN,KACzElN,EAAYkN,EAAQjkC,GAEtBikC,EAAQA,IAAUjkC,EAAYmC,EAAmB8hC,IAAU,EACtDA,GAGLh2B,EAASoF,GAASpF,GACdA,IACsB,iBAAb8oB,GACO,MAAbA,IAAsBnrB,GAASmrB,MAEpCA,EAAYpN,GAAaoN,IACpBA,GAAalmB,GAAW5C,IACpB4c,GAAU5Y,GAAchE,GAAS,EAAGg2B,GAGxCh2B,EAAOC,MAAM6oB,EAAWkN,IAZtB,GAoCX,IAAIC,GAAY3V,IAAiB,SAASvhB,EAAQ81B,EAAMxnC,GACtD,OAAO0R,GAAU1R,EAAQ,IAAM,IAAM2nC,GAAWH,MA0BlD,SAASqB,GAAWl2B,EAAQk1B,EAAQC,GAOlC,OANAn1B,EAASoF,GAASpF,GAClBm1B,EAAuB,MAAZA,EACP,EACApmB,GAAU0D,GAAU0iB,GAAW,EAAGn1B,EAAOlR,QAE7ComC,EAASxZ,GAAawZ,GACfl1B,EAAOyB,MAAM0zB,EAAUA,EAAWD,EAAOpmC,SAAWomC,EA2G7D,SAASiB,GAASn2B,EAAQ+tB,EAAStO,GAIjC,IAAI2W,EAAW7sB,GAAOyI,iBAElByN,GAASC,GAAe1f,EAAQ+tB,EAAStO,KAC3CsO,EAAUh8B,GAEZiO,EAASoF,GAASpF,GAClB+tB,EAAUuE,GAAa,GAAIvE,EAASqI,EAAUhS,IAE9C,IAIIiS,EACAC,EALAC,EAAUjE,GAAa,GAAIvE,EAAQwI,QAASH,EAASG,QAASnS,IAC9DoS,EAAc/wB,GAAK8wB,GACnBE,EAAgB50B,GAAW00B,EAASC,GAIpCnpC,EAAQ,EACRqpC,EAAc3I,EAAQ2I,aAAel+B,GACrC1B,EAAS,WAGT6/B,EAAe9/B,IAChBk3B,EAAQqH,QAAU58B,IAAW1B,OAAS,IACvC4/B,EAAY5/B,OAAS,KACpB4/B,IAAgBx/B,GAAgBc,GAAeQ,IAAW1B,OAAS,KACnEi3B,EAAQ6I,UAAYp+B,IAAW1B,OAAS,KACzC,KAME+/B,EAAY,kBACbtqC,GAAe1B,KAAKkjC,EAAS,cACzBA,EAAQ8I,UAAY,IAAIl1B,QAAQ,MAAO,KACvC,6BAA+BhG,GAAmB,KACnD,KAENqE,EAAO2B,QAAQg1B,GAAc,SAASx2B,EAAO22B,EAAaC,EAAkBC,EAAiBC,EAAez3B,GAsB1G,OArBAu3B,IAAqBA,EAAmBC,GAGxClgC,GAAUkJ,EAAOyB,MAAMpU,EAAOmS,GAAQmC,QAAQlJ,GAAmBgK,IAG7Dq0B,IACFT,GAAa,EACbv/B,GAAU,YAAcggC,EAAc,UAEpCG,IACFX,GAAe,EACfx/B,GAAU,OAASmgC,EAAgB,eAEjCF,IACFjgC,GAAU,iBAAmBigC,EAAmB,+BAElD1pC,EAAQmS,EAASW,EAAMrR,OAIhBqR,KAGTrJ,GAAU,OAIV,IAAIogC,EAAW3qC,GAAe1B,KAAKkjC,EAAS,aAAeA,EAAQmJ,SACnE,GAAKA,GAKA,GAAIp/B,GAA2B+K,KAAKq0B,GACvC,MAAM,IAAItyB,EAAMxS,QALhB0E,EAAS,iBAAmBA,EAAS,QASvCA,GAAUw/B,EAAex/B,EAAO6K,QAAQpL,GAAsB,IAAMO,GACjE6K,QAAQnL,GAAqB,MAC7BmL,QAAQlL,GAAuB,OAGlCK,EAAS,aAAeogC,GAAY,OAAS,SAC1CA,EACG,GACA,wBAEJ,qBACCb,EACI,mBACA,KAEJC,EACG,uFAEA,OAEJx/B,EACA,gBAEF,IAAIiI,EAASo4B,IAAQ,WACnB,OAAO16B,GAAS+5B,EAAaK,EAAY,UAAY//B,GAClDkH,MAAMjM,EAAW0kC,MAMtB,GADA13B,EAAOjI,OAASA,EACZo6B,GAAQnyB,GACV,MAAMA,EAER,OAAOA,EAwBT,SAASq4B,GAAQzrC,GACf,OAAOyZ,GAASzZ,GAAOmpC,cAwBzB,SAASuC,GAAQ1rC,GACf,OAAOyZ,GAASzZ,GAAO2rC,cAyBzB,SAASC,GAAKv3B,EAAQ8iB,EAAOrD,GAE3B,GADAzf,EAASoF,GAASpF,GACdA,IAAWyf,GAASqD,IAAU/wB,GAChC,OAAOyP,GAASxB,GAElB,IAAKA,KAAY8iB,EAAQpH,GAAaoH,IACpC,OAAO9iB,EAET,IAAIkC,EAAa8B,GAAchE,GAC3BmC,EAAa6B,GAAc8e,GAC3Bl1B,EAAQqU,GAAgBC,EAAYC,GACpCoJ,EAAMnJ,GAAcF,EAAYC,GAAc,EAElD,OAAOya,GAAU1a,EAAYtU,EAAO2d,GAAKzQ,KAAK,IAsBhD,SAAS08B,GAAQx3B,EAAQ8iB,EAAOrD,GAE9B,GADAzf,EAASoF,GAASpF,GACdA,IAAWyf,GAASqD,IAAU/wB,GAChC,OAAOiO,EAAOyB,MAAM,EAAGC,GAAgB1B,GAAU,GAEnD,IAAKA,KAAY8iB,EAAQpH,GAAaoH,IACpC,OAAO9iB,EAET,IAAIkC,EAAa8B,GAAchE,GAC3BuL,EAAMnJ,GAAcF,EAAY8B,GAAc8e,IAAU,EAE5D,OAAOlG,GAAU1a,EAAY,EAAGqJ,GAAKzQ,KAAK,IAsB5C,SAAS28B,GAAUz3B,EAAQ8iB,EAAOrD,GAEhC,GADAzf,EAASoF,GAASpF,GACdA,IAAWyf,GAASqD,IAAU/wB,GAChC,OAAOiO,EAAO2B,QAAQnK,GAAa,IAErC,IAAKwI,KAAY8iB,EAAQpH,GAAaoH,IACpC,OAAO9iB,EAET,IAAIkC,EAAa8B,GAAchE,GAC3BpS,EAAQqU,GAAgBC,EAAY8B,GAAc8e,IAEtD,OAAOlG,GAAU1a,EAAYtU,GAAOkN,KAAK,IAwC3C,SAAS48B,GAAS13B,EAAQ+tB,GACxB,IAAIj/B,EAASyE,EACTokC,EAAWnkC,EAEf,GAAIuW,GAASgkB,GAAU,CACrB,IAAIjF,EAAY,cAAeiF,EAAUA,EAAQjF,UAAYA,EAC7Dh6B,EAAS,WAAYi/B,EAAUtb,GAAUsb,EAAQj/B,QAAUA,EAC3D6oC,EAAW,aAAc5J,EAAUrS,GAAaqS,EAAQ4J,UAAYA,EAEtE33B,EAASoF,GAASpF,GAElB,IAAI01B,EAAY11B,EAAOlR,OACvB,GAAI8T,GAAW5C,GAAS,CACtB,IAAIkC,EAAa8B,GAAchE,GAC/B01B,EAAYxzB,EAAWpT,OAEzB,GAAIA,GAAU4mC,EACZ,OAAO11B,EAET,IAAIuL,EAAMzc,EAASgV,GAAW6zB,GAC9B,GAAIpsB,EAAM,EACR,OAAOosB,EAET,IAAI54B,EAASmD,EACT0a,GAAU1a,EAAY,EAAGqJ,GAAKzQ,KAAK,IACnCkF,EAAOyB,MAAM,EAAG8J,GAEpB,GAAIud,IAAc/2B,EAChB,OAAOgN,EAAS44B,EAKlB,GAHIz1B,IACFqJ,GAAQxM,EAAOjQ,OAASyc,GAEtB5N,GAASmrB,IACX,GAAI9oB,EAAOyB,MAAM8J,GAAKqsB,OAAO9O,GAAY,CACvC,IAAI3oB,EACA03B,EAAY94B,EAEX+pB,EAAUvsB,SACbusB,EAAYjyB,GAAOiyB,EAAUhyB,OAAQsO,GAASnN,GAAQuN,KAAKsjB,IAAc,MAE3EA,EAAU1kB,UAAY,EACtB,MAAQjE,EAAQ2oB,EAAUtjB,KAAKqyB,GAC7B,IAAIC,EAAS33B,EAAM9S,MAErB0R,EAASA,EAAO0C,MAAM,EAAGq2B,IAAW/lC,EAAYwZ,EAAMusB,SAEnD,GAAI93B,EAAOsZ,QAAQoC,GAAaoN,GAAYvd,IAAQA,EAAK,CAC9D,IAAIle,EAAQ0R,EAAOgqB,YAAYD,GAC3Bz7B,GAAS,IACX0R,EAASA,EAAO0C,MAAM,EAAGpU,IAG7B,OAAO0R,EAAS44B,EAsBlB,SAASI,GAAS/3B,GAEhB,OADAA,EAASoF,GAASpF,GACVA,GAAUpJ,GAAiBiM,KAAK7C,GACpCA,EAAO2B,QAAQjL,GAAeyN,IAC9BnE,EAuBN,IAAIg4B,GAAY1X,IAAiB,SAASvhB,EAAQ81B,EAAMxnC,GACtD,OAAO0R,GAAU1R,EAAQ,IAAM,IAAMwnC,EAAKyC,iBAoBxCtC,GAAa7U,GAAgB,eAqBjC,SAASK,GAAMxgB,EAAQ0W,EAAS+I,GAI9B,OAHAzf,EAASoF,GAASpF,GAClB0W,EAAU+I,EAAQ1tB,EAAY2kB,EAE1BA,IAAY3kB,EACP+Q,GAAe9C,GAAUqE,GAAarE,GAAUE,GAAWF,GAE7DA,EAAOG,MAAMuW,IAAY,GA2BlC,IAAIygB,GAAUtd,IAAS,SAAS5b,EAAME,GACpC,IACE,OAAOH,GAAMC,EAAMlM,EAAWoM,GAC9B,MAAOhB,GACP,OAAO+zB,GAAQ/zB,GAAKA,EAAI,IAAIyH,EAAMzH,OA8BlC86B,GAAU9W,IAAS,SAAS/0B,EAAQ8rC,GAKtC,OAJAz5B,GAAUy5B,GAAa,SAASjsC,GAC9BA,EAAMunB,GAAMvnB,GACZkjB,GAAgB/iB,EAAQH,EAAKC,GAAKE,EAAOH,GAAMG,OAE1CA,KAgCT,SAAS+rC,GAAKjqB,GACZ,IAAIpf,EAAkB,MAATof,EAAgB,EAAIA,EAAMpf,OACnCyzB,EAAazJ,KASjB,OAPA5K,EAASpf,EAAcsQ,GAAS8O,GAAO,SAAS6V,GAC9C,GAAsB,mBAAXA,EAAK,GACd,MAAM,IAAIjf,GAAU3S,GAEtB,MAAO,CAACowB,EAAWwB,EAAK,IAAKA,EAAK,OAJlB,GAOXlK,IAAS,SAAS1b,GACvB,IAAI9Q,GAAS,EACb,QAASA,EAAQyB,EAAQ,CACvB,IAAIi1B,EAAO7V,EAAM7gB,GACjB,GAAI2Q,GAAM+lB,EAAK,GAAIz5B,KAAM6T,GACvB,OAAOH,GAAM+lB,EAAK,GAAIz5B,KAAM6T,OA8BpC,SAASi6B,GAASthC,GAChB,OAAOya,GAAarB,GAAUpZ,EAAQtE,IAsBxC,SAAS6nB,GAAS1uB,GAChB,OAAO,WACL,OAAOA,GAwBX,SAAS0sC,GAAU1sC,EAAO+2B,GACxB,OAAiB,MAAT/2B,GAAiBA,IAAUA,EAAS+2B,EAAe/2B,EAyB7D,IAAI2sC,GAAOpX,KAuBPqX,GAAYrX,IAAW,GAkB3B,SAASlK,GAASrrB,GAChB,OAAOA,EA6CT,SAAS4S,GAASN,GAChB,OAAO8Y,GAA4B,mBAAR9Y,EAAqBA,EAAOiS,GAAUjS,EAAMzL,IAsCzE,SAASpE,GAAQ0I,GACf,OAAOogB,GAAYhH,GAAUpZ,EAAQtE,IAoCvC,SAASgmC,GAAgBllB,EAAMiD,GAC7B,OAAOU,GAAoB3D,EAAMpD,GAAUqG,EAAU/jB,IA2BvD,IAAIimC,GAAS5e,IAAS,SAASvG,EAAMnV,GACnC,OAAO,SAAS/R,GACd,OAAOwoB,GAAWxoB,EAAQknB,EAAMnV,OA2BhCu6B,GAAW7e,IAAS,SAASztB,EAAQ+R,GACvC,OAAO,SAASmV,GACd,OAAOsB,GAAWxoB,EAAQknB,EAAMnV,OAwCpC,SAASw6B,GAAMvsC,EAAQ0K,EAAQi3B,GAC7B,IAAIxsB,EAAQkE,GAAK3O,GACbohC,EAAc/kB,GAAcrc,EAAQyK,GAEzB,MAAXwsB,GACEhkB,GAASjT,KAAYohC,EAAYppC,SAAWyS,EAAMzS,UACtDi/B,EAAUj3B,EACVA,EAAS1K,EACTA,EAAS9B,KACT4tC,EAAc/kB,GAAcrc,EAAQ2O,GAAK3O,KAE3C,IAAIu0B,IAAUthB,GAASgkB,IAAY,UAAWA,MAAcA,EAAQ1C,MAChEza,EAASwC,GAAWhnB,GAqBxB,OAnBAqS,GAAUy5B,GAAa,SAAS9X,GAC9B,IAAIniB,EAAOnH,EAAOspB,GAClBh0B,EAAOg0B,GAAcniB,EACjB2S,IACFxkB,EAAOE,UAAU8zB,GAAc,WAC7B,IAAInW,EAAW3f,KAAK8f,UACpB,GAAIihB,GAASphB,EAAU,CACrB,IAAIlL,EAAS3S,EAAO9B,KAAK4f,aACrBgS,EAAUnd,EAAOoL,YAAcU,GAAUvgB,KAAK6f,aAIlD,OAFA+R,EAAQvtB,KAAK,CAAE,KAAQsP,EAAM,KAAQiiB,UAAW,QAAW9zB,IAC3D2S,EAAOqL,UAAYH,EACZlL,EAET,OAAOd,EAAKD,MAAM5R,EAAQkT,GAAU,CAAChV,KAAKqB,SAAUu0B,iBAKnD9zB,EAgBT,SAASwsC,KAIP,OAHI7uC,GAAKya,IAAMla,OACbP,GAAKya,EAAIqB,IAEJvb,KAeT,SAAS05B,MAwBT,SAAS6U,GAAO1sC,GAEd,OADAA,EAAIsmB,GAAUtmB,GACP0tB,IAAS,SAAS1b,GACvB,OAAOwa,GAAQxa,EAAMhS,MAsBzB,IAAI2sC,GAAOnW,GAAWvjB,IA8BlB25B,GAAYpW,GAAWhkB,IAiCvBq6B,GAAWrW,GAAW/iB,IAwB1B,SAASvT,GAASinB,GAChB,OAAOuE,GAAMvE,GAAQxT,GAAa0T,GAAMF,IAAS8F,GAAiB9F,GAwBpE,SAAS2lB,GAAW7sC,GAClB,OAAO,SAASknB,GACd,OAAiB,MAAVlnB,EAAiB2F,EAAYshB,GAAQjnB,EAAQknB,IA6CxD,IAAI4lB,GAAQjW,KAsCRkW,GAAalW,IAAY,GAoB7B,SAAS0C,KACP,MAAO,GAgBT,SAASW,KACP,OAAO,EAqBT,SAAS8S,KACP,MAAO,GAgBT,SAASC,KACP,MAAO,GAgBT,SAASC,KACP,OAAO,EAsBT,SAASC,GAAMptC,EAAGoS,GAEhB,GADApS,EAAIsmB,GAAUtmB,GACVA,EAAI,GAAKA,EAAI4H,EACf,MAAO,GAET,IAAI1G,EAAQ6G,EACRpF,EAASgZ,GAAU3b,EAAG+H,GAE1BqK,EAAWua,GAAYva,GACvBpS,GAAK+H,EAEL,IAAI6K,EAASsC,GAAUvS,EAAQyP,GAC/B,QAASlR,EAAQlB,EACfoS,EAASlR,GAEX,OAAO0R,EAoBT,SAASy6B,GAAO7tC,GACd,OAAI8d,GAAQ9d,GACHyT,GAASzT,EAAO6nB,IAElBjB,GAAS5mB,GAAS,CAACA,GAASkf,GAAU6R,GAAatX,GAASzZ,KAoBrE,SAAS8tC,GAASC,GAChB,IAAI7c,IAAOxX,GACX,OAAOD,GAASs0B,GAAU7c,EAoB5B,IAAIpP,GAAM+U,IAAoB,SAASmX,EAAQC,GAC7C,OAAOD,EAASC,IACf,GAuBC1yB,GAAO2c,GAAY,QAiBnBgW,GAASrX,IAAoB,SAASsX,EAAUC,GAClD,OAAOD,EAAWC,IACjB,GAuBC3yB,GAAQyc,GAAY,SAoBxB,SAAShc,GAAIxJ,GACX,OAAQA,GAASA,EAAMvP,OACnBwjB,GAAajU,EAAO2Y,GAAUlD,IAC9B/hB,EA0BN,SAASioC,GAAM37B,EAAOE,GACpB,OAAQF,GAASA,EAAMvP,OACnBwjB,GAAajU,EAAOya,GAAYva,EAAU,GAAIuV,IAC9C/hB,EAiBN,SAASkoC,GAAK57B,GACZ,OAAOwC,GAASxC,EAAO2Y,IA0BzB,SAASkjB,GAAO77B,EAAOE,GACrB,OAAOsC,GAASxC,EAAOya,GAAYva,EAAU,IAqB/C,SAASwJ,GAAI1J,GACX,OAAQA,GAASA,EAAMvP,OACnBwjB,GAAajU,EAAO2Y,GAAUQ,IAC9BzlB,EA0BN,SAASooC,GAAM97B,EAAOE,GACpB,OAAQF,GAASA,EAAMvP,OACnBwjB,GAAajU,EAAOya,GAAYva,EAAU,GAAIiZ,IAC9CzlB,EAkBN,IAAIqoC,GAAW5X,IAAoB,SAAS6X,EAAYC,GACtD,OAAOD,EAAaC,IACnB,GAuBCC,GAAQ1W,GAAY,SAiBpB2W,GAAWhY,IAAoB,SAASiY,EAASC,GACnD,OAAOD,EAAUC,IAChB,GAgBH,SAASC,GAAIt8B,GACX,OAAQA,GAASA,EAAMvP,OACnBgS,GAAQzC,EAAO2Y,IACf,EA0BN,SAAS4jB,GAAMv8B,EAAOE,GACpB,OAAQF,GAASA,EAAMvP,OACnBgS,GAAQzC,EAAOya,GAAYva,EAAU,IACrC,EAgjBN,OA1iBAgL,GAAOkkB,MAAQA,GACflkB,GAAOwY,IAAMA,GACbxY,GAAO6oB,OAASA,GAChB7oB,GAAO8oB,SAAWA,GAClB9oB,GAAO+oB,aAAeA,GACtB/oB,GAAOgpB,WAAaA,GACpBhpB,GAAOipB,GAAKA,GACZjpB,GAAOmkB,OAASA,GAChBnkB,GAAOrd,KAAOA,GACdqd,GAAO0uB,QAAUA,GACjB1uB,GAAOokB,QAAUA,GACjBpkB,GAAO+mB,UAAYA,GACnB/mB,GAAO8hB,MAAQA,GACf9hB,GAAOke,MAAQA,GACfle,GAAOme,QAAUA,GACjBne,GAAOoe,OAASA,GAChBpe,GAAO4uB,KAAOA,GACd5uB,GAAO6uB,SAAWA,GAClB7uB,GAAO8Q,SAAWA,GAClB9Q,GAAO2iB,QAAUA,GACjB3iB,GAAOvd,OAASA,GAChBud,GAAOqkB,MAAQA,GACfrkB,GAAOskB,WAAaA,GACpBtkB,GAAOukB,SAAWA,GAClBvkB,GAAO9E,SAAWA,GAClB8E,GAAOqpB,aAAeA,GACtBrpB,GAAO8lB,MAAQA,GACf9lB,GAAO+lB,MAAQA,GACf/lB,GAAOqe,WAAaA,GACpBre,GAAOse,aAAeA,GACtBte,GAAOue,eAAiBA,GACxBve,GAAOwe,KAAOA,GACdxe,GAAOye,UAAYA,GACnBze,GAAO0e,eAAiBA,GACxB1e,GAAO2e,UAAYA,GACnB3e,GAAO4e,KAAOA,GACd5e,GAAO6iB,OAASA,GAChB7iB,GAAOgjB,QAAUA,GACjBhjB,GAAOijB,YAAcA,GACrBjjB,GAAOkjB,aAAeA,GACtBljB,GAAO+b,QAAUA,GACjB/b,GAAO8e,YAAcA,GACrB9e,GAAO+e,aAAeA,GACtB/e,GAAOgmB,KAAOA,GACdhmB,GAAO+uB,KAAOA,GACd/uB,GAAOgvB,UAAYA,GACnBhvB,GAAOgf,UAAYA,GACnBhf,GAAO6pB,UAAYA,GACnB7pB,GAAO8pB,YAAcA,GACrB9pB,GAAOojB,QAAUA,GACjBpjB,GAAOkf,QAAUA,GACjBlf,GAAOmf,aAAeA,GACtBnf,GAAOqf,eAAiBA,GACxBrf,GAAOsf,iBAAmBA,GAC1Btf,GAAO+pB,OAASA,GAChB/pB,GAAOgqB,SAAWA,GAClBhqB,GAAOsjB,UAAYA,GACnBtjB,GAAOhL,SAAWA,GAClBgL,GAAOujB,MAAQA,GACfvjB,GAAO9D,KAAOA,GACd8D,GAAOoG,OAASA,GAChBpG,GAAOpG,IAAMA,GACboG,GAAOkqB,QAAUA,GACjBlqB,GAAOmqB,UAAYA,GACnBnqB,GAAOnb,QAAUA,GACjBmb,GAAOivB,gBAAkBA,GACzBjvB,GAAOid,QAAUA,GACjBjd,GAAOoqB,MAAQA,GACfpqB,GAAOspB,UAAYA,GACnBtpB,GAAOkvB,OAASA,GAChBlvB,GAAOmvB,SAAWA,GAClBnvB,GAAOovB,MAAQA,GACfpvB,GAAO6jB,OAASA,GAChB7jB,GAAOsvB,OAASA,GAChBtvB,GAAOqqB,KAAOA,GACdrqB,GAAOsqB,OAASA,GAChBtqB,GAAOomB,KAAOA,GACdpmB,GAAOwjB,QAAUA,GACjBxjB,GAAOuvB,KAAOA,GACdvvB,GAAOqmB,SAAWA,GAClBrmB,GAAOwvB,UAAYA,GACnBxvB,GAAOyvB,SAAWA,GAClBzvB,GAAOumB,QAAUA,GACjBvmB,GAAOwmB,aAAeA,GACtBxmB,GAAOyjB,UAAYA,GACnBzjB,GAAO7E,KAAOA,GACd6E,GAAOuqB,OAASA,GAChBvqB,GAAOld,SAAWA,GAClBkd,GAAO0vB,WAAaA,GACpB1vB,GAAO0f,KAAOA,GACd1f,GAAO2f,QAAUA,GACjB3f,GAAO4f,UAAYA,GACnB5f,GAAO6f,YAAcA,GACrB7f,GAAO8f,OAASA,GAChB9f,GAAO2vB,MAAQA,GACf3vB,GAAO4vB,WAAaA,GACpB5vB,GAAOymB,MAAQA,GACfzmB,GAAO4jB,OAASA,GAChB5jB,GAAO+f,OAASA,GAChB/f,GAAO0mB,KAAOA,GACd1mB,GAAOlB,QAAUA,GACjBkB,GAAO8jB,WAAaA,GACpB9jB,GAAO5F,IAAMA,GACb4F,GAAOyqB,QAAUA,GACjBzqB,GAAO+jB,QAAUA,GACjB/jB,GAAO9H,MAAQA,GACf8H,GAAOikB,OAASA,GAChBjkB,GAAOsgB,WAAaA,GACpBtgB,GAAOugB,aAAeA,GACtBvgB,GAAOtJ,MAAQA,GACfsJ,GAAO2mB,OAASA,GAChB3mB,GAAOwgB,KAAOA,GACdxgB,GAAOygB,KAAOA,GACdzgB,GAAO0gB,UAAYA,GACnB1gB,GAAO2gB,eAAiBA,GACxB3gB,GAAO4gB,UAAYA,GACnB5gB,GAAO+hB,IAAMA,GACb/hB,GAAO4mB,SAAWA,GAClB5mB,GAAO+X,KAAOA,GACd/X,GAAOqiB,QAAUA,GACjBriB,GAAO0qB,QAAUA,GACjB1qB,GAAO2qB,UAAYA,GACnB3qB,GAAOiwB,OAASA,GAChBjwB,GAAOmP,cAAgBA,GACvBnP,GAAOhG,UAAYA,GACnBgG,GAAO6mB,MAAQA,GACf7mB,GAAO6gB,MAAQA,GACf7gB,GAAO8gB,QAAUA,GACjB9gB,GAAO+gB,UAAYA,GACnB/gB,GAAOghB,KAAOA,GACdhhB,GAAOihB,OAASA,GAChBjhB,GAAOkhB,SAAWA,GAClBlhB,GAAO6qB,MAAQA,GACf7qB,GAAOmhB,MAAQA,GACfnhB,GAAOqhB,UAAYA,GACnBrhB,GAAO8qB,OAASA,GAChB9qB,GAAO+qB,WAAaA,GACpB/qB,GAAOhK,OAASA,GAChBgK,GAAOgrB,SAAWA,GAClBhrB,GAAOshB,QAAUA,GACjBthB,GAAOiX,MAAQA,GACfjX,GAAO8mB,KAAOA,GACd9mB,GAAOuhB,IAAMA,GACbvhB,GAAOwhB,MAAQA,GACfxhB,GAAOyhB,QAAUA,GACjBzhB,GAAO0hB,IAAMA,GACb1hB,GAAO2hB,UAAYA,GACnB3hB,GAAO4hB,cAAgBA,GACvB5hB,GAAO6hB,QAAUA,GAGjB7hB,GAAOyC,QAAUioB,GACjB1qB,GAAOsxB,UAAY3G,GACnB3qB,GAAOuxB,OAASzI,GAChB9oB,GAAOwxB,WAAazI,GAGpBqG,GAAMpvB,GAAQA,IAKdA,GAAOkE,IAAMA,GACblE,GAAO4tB,QAAUA,GACjB5tB,GAAOqrB,UAAYA,GACnBrrB,GAAOwrB,WAAaA,GACpBxrB,GAAOrC,KAAOA,GACdqC,GAAOirB,MAAQA,GACfjrB,GAAOwB,MAAQA,GACfxB,GAAOinB,UAAYA,GACnBjnB,GAAOknB,cAAgBA,GACvBlnB,GAAOgnB,UAAYA,GACnBhnB,GAAOmnB,WAAaA,GACpBnnB,GAAOkX,OAASA,GAChBlX,GAAO8uB,UAAYA,GACnB9uB,GAAOswB,OAASA,GAChBtwB,GAAO0rB,SAAWA,GAClB1rB,GAAO2F,GAAKA,GACZ3F,GAAO6rB,OAASA,GAChB7rB,GAAO8rB,aAAeA,GACtB9rB,GAAO4iB,MAAQA,GACf5iB,GAAO8iB,KAAOA,GACd9iB,GAAOjY,UAAYA,GACnBiY,GAAOupB,QAAUA,GACjBvpB,GAAO+iB,SAAWA,GAClB/iB,GAAO6e,cAAgBA,GACvB7e,GAAOwpB,YAAcA,GACrBxpB,GAAOnC,MAAQA,GACfmC,GAAOlG,QAAUA,GACjBkG,GAAOmjB,aAAeA,GACtBnjB,GAAOypB,MAAQA,GACfzpB,GAAO0pB,WAAaA,GACpB1pB,GAAO2pB,OAASA,GAChB3pB,GAAO4pB,YAAcA,GACrB5pB,GAAOhe,IAAMA,GACbge,GAAOonB,GAAKA,GACZpnB,GAAOqnB,IAAMA,GACbrnB,GAAOvH,IAAMA,GACbuH,GAAOwO,MAAQA,GACfxO,GAAOif,KAAOA,GACdjf,GAAOyN,SAAWA,GAClBzN,GAAOqI,SAAWA,GAClBrI,GAAO+P,QAAUA,GACjB/P,GAAOkrB,QAAUA,GACjBlrB,GAAOiqB,OAASA,GAChBjqB,GAAO+E,YAAcA,GACrB/E,GAAOE,QAAUA,GACjBF,GAAOlM,cAAgBA,GACvBkM,GAAOmO,YAAcA,GACrBnO,GAAOgP,kBAAoBA,GAC3BhP,GAAOsnB,UAAYA,GACnBtnB,GAAO/B,SAAWA,GAClB+B,GAAOhM,OAASA,GAChBgM,GAAOunB,UAAYA,GACnBvnB,GAAOwnB,QAAUA,GACjBxnB,GAAOynB,QAAUA,GACjBznB,GAAO0nB,YAAcA,GACrB1nB,GAAO2nB,QAAUA,GACjB3nB,GAAOlZ,SAAWA,GAClBkZ,GAAO6J,WAAaA,GACpB7J,GAAO4nB,UAAYA,GACnB5nB,GAAOuN,SAAWA,GAClBvN,GAAO9L,MAAQA,GACf8L,GAAO6nB,QAAUA,GACjB7nB,GAAO8nB,YAAcA,GACrB9nB,GAAOxb,MAAQA,GACfwb,GAAOgoB,SAAWA,GAClBhoB,GAAOkoB,MAAQA,GACfloB,GAAOioB,OAASA,GAChBjoB,GAAO+nB,SAAWA,GAClB/nB,GAAOQ,SAAWA,GAClBR,GAAOC,aAAeA,GACtBD,GAAOkP,cAAgBA,GACvBlP,GAAO5L,SAAWA,GAClB4L,GAAOmoB,cAAgBA,GACvBnoB,GAAO1L,MAAQA,GACf0L,GAAOqjB,SAAWA,GAClBrjB,GAAOgJ,SAAWA,GAClBhJ,GAAOxL,aAAeA,GACtBwL,GAAOooB,YAAcA,GACrBpoB,GAAOqoB,UAAYA,GACnBroB,GAAOsoB,UAAYA,GACnBtoB,GAAOzO,KAAOA,GACdyO,GAAO+rB,UAAYA,GACnB/rB,GAAOuL,KAAOA,GACdvL,GAAOwf,YAAcA,GACrBxf,GAAOgsB,UAAYA,GACnBhsB,GAAOisB,WAAaA,GACpBjsB,GAAOuoB,GAAKA,GACZvoB,GAAOwoB,IAAMA,GACbxoB,GAAO1B,IAAMA,GACb0B,GAAOywB,MAAQA,GACfzwB,GAAO0wB,KAAOA,GACd1wB,GAAO2wB,OAASA,GAChB3wB,GAAOxB,IAAMA,GACbwB,GAAO4wB,MAAQA,GACf5wB,GAAOoc,UAAYA,GACnBpc,GAAO+c,UAAYA,GACnB/c,GAAO6vB,WAAaA,GACpB7vB,GAAO8vB,WAAaA,GACpB9vB,GAAO+vB,SAAWA,GAClB/vB,GAAO6wB,SAAWA,GAClB7wB,GAAOyf,IAAMA,GACbzf,GAAOqvB,WAAaA,GACpBrvB,GAAOya,KAAOA,GACdza,GAAO1Y,IAAMA,GACb0Y,GAAOksB,IAAMA,GACblsB,GAAOosB,OAASA,GAChBpsB,GAAOqsB,SAAWA,GAClBrsB,GAAOlN,SAAWA,GAClBkN,GAAOpB,OAASA,GAChBoB,GAAO0jB,OAASA,GAChB1jB,GAAO2jB,YAAcA,GACrB3jB,GAAOusB,OAASA,GAChBvsB,GAAO5H,QAAUA,GACjB4H,GAAOxK,OAASA,GAChBwK,GAAOgxB,MAAQA,GACfhxB,GAAOjF,aAAeA,EACtBiF,GAAOta,OAASA,GAChBsa,GAAOnG,KAAOA,GACdmG,GAAOwsB,UAAYA,GACnBxsB,GAAOgkB,KAAOA,GACdhkB,GAAOggB,YAAcA,GACrBhgB,GAAOigB,cAAgBA,GACvBjgB,GAAOkgB,cAAgBA,GACvBlgB,GAAOmgB,gBAAkBA,GACzBngB,GAAOogB,kBAAoBA,GAC3BpgB,GAAOqgB,kBAAoBA,GAC3BrgB,GAAO0sB,UAAYA,GACnB1sB,GAAO2sB,WAAaA,GACpB3sB,GAAOixB,SAAWA,GAClBjxB,GAAOoxB,IAAMA,GACbpxB,GAAOqxB,MAAQA,GACfrxB,GAAO4sB,SAAWA,GAClB5sB,GAAOgwB,MAAQA,GACfhwB,GAAO2Z,SAAWA,GAClB3Z,GAAOkJ,UAAYA,GACnBlJ,GAAOmJ,SAAWA,GAClBnJ,GAAO6tB,QAAUA,GACjB7tB,GAAO6Z,SAAWA,GAClB7Z,GAAO4oB,cAAgBA,GACvB5oB,GAAOnE,SAAWA,GAClBmE,GAAO8tB,QAAUA,GACjB9tB,GAAOguB,KAAOA,GACdhuB,GAAOiuB,QAAUA,GACjBjuB,GAAOkuB,UAAYA,GACnBluB,GAAOmuB,SAAWA,GAClBnuB,GAAOwuB,SAAWA,GAClBxuB,GAAOkwB,SAAWA,GAClBlwB,GAAOyuB,UAAYA,GACnBzuB,GAAOyrB,WAAaA,GAGpBzrB,GAAOyxB,KAAO33B,GACdkG,GAAO0xB,UAAYvO,GACnBnjB,GAAO2xB,MAAQ1S,GAEfmQ,GAAMpvB,GAAS,WACb,IAAIzS,EAAS,GAMb,OALAob,GAAW3I,IAAQ,SAAStL,EAAMmiB,GAC3B7zB,GAAe1B,KAAK0e,GAAOjd,UAAW8zB,KACzCtpB,EAAOspB,GAAcniB,MAGlBnH,EAPK,GAQR,CAAE,OAAS,IAWjByS,GAAOvX,QAAUA,EAGjByM,GAAU,CAAC,OAAQ,UAAW,QAAS,aAAc,UAAW,iBAAiB,SAAS2hB,GACxF7W,GAAO6W,GAAY9d,YAAciH,MAInC9K,GAAU,CAAC,OAAQ,SAAS,SAAS2hB,EAAY/yB,GAC/Cqc,GAAYpd,UAAU8zB,GAAc,SAASj0B,GAC3CA,EAAIA,IAAM4F,EAAY,EAAI6V,GAAU6K,GAAUtmB,GAAI,GAElD,IAAI4S,EAAUzU,KAAKkgB,eAAiBnd,EAChC,IAAIqc,GAAYpf,MAChBA,KAAKygB,QAUT,OARIhM,EAAOyL,aACTzL,EAAO2L,cAAgB5C,GAAU3b,EAAG4S,EAAO2L,eAE3C3L,EAAO4L,UAAUhc,KAAK,CACpB,KAAQmZ,GAAU3b,EAAG+H,GACrB,KAAQksB,GAAcrhB,EAAOwL,QAAU,EAAI,QAAU,MAGlDxL,GAGT2K,GAAYpd,UAAU8zB,EAAa,SAAW,SAASj0B,GACrD,OAAO7B,KAAK+d,UAAU+X,GAAYj0B,GAAGkc,cAKzC5J,GAAU,CAAC,SAAU,MAAO,cAAc,SAAS2hB,EAAY/yB,GAC7D,IAAIqE,EAAOrE,EAAQ,EACf8tC,EAAWzpC,GAAQiC,GAAoBjC,GAAQmC,EAEnD6V,GAAYpd,UAAU8zB,GAAc,SAAS7hB,GAC3C,IAAIQ,EAASzU,KAAKygB,QAMlB,OALAhM,EAAO0L,cAAc9b,KAAK,CACxB,SAAYmqB,GAAYva,EAAU,GAClC,KAAQ7M,IAEVqN,EAAOyL,aAAezL,EAAOyL,cAAgB2wB,EACtCp8B,MAKXN,GAAU,CAAC,OAAQ,SAAS,SAAS2hB,EAAY/yB,GAC/C,IAAI+tC,EAAW,QAAU/tC,EAAQ,QAAU,IAE3Cqc,GAAYpd,UAAU8zB,GAAc,WAClC,OAAO91B,KAAK8wC,GAAU,GAAGzvC,QAAQ,OAKrC8S,GAAU,CAAC,UAAW,SAAS,SAAS2hB,EAAY/yB,GAClD,IAAIguC,EAAW,QAAUhuC,EAAQ,GAAK,SAEtCqc,GAAYpd,UAAU8zB,GAAc,WAClC,OAAO91B,KAAKkgB,aAAe,IAAId,GAAYpf,MAAQA,KAAK+wC,GAAU,OAItE3xB,GAAYpd,UAAUo7B,QAAU,WAC9B,OAAOp9B,KAAK8hC,OAAOpV,KAGrBtN,GAAYpd,UAAU+/B,KAAO,SAASztB,GACpC,OAAOtU,KAAK8hC,OAAOxtB,GAAW4pB,QAGhC9e,GAAYpd,UAAUggC,SAAW,SAAS1tB,GACxC,OAAOtU,KAAK+d,UAAUgkB,KAAKztB,IAG7B8K,GAAYpd,UAAUugC,UAAYhT,IAAS,SAASvG,EAAMnV,GACxD,MAAmB,mBAARmV,EACF,IAAI5J,GAAYpf,MAElBA,KAAK6Y,KAAI,SAASxX,GACvB,OAAOipB,GAAWjpB,EAAO2nB,EAAMnV,SAInCuL,GAAYpd,UAAU6gC,OAAS,SAASvuB,GACtC,OAAOtU,KAAK8hC,OAAOgB,GAAOtU,GAAYla,MAGxC8K,GAAYpd,UAAUmV,MAAQ,SAAS7T,EAAO2d,GAC5C3d,EAAQ6kB,GAAU7kB,GAElB,IAAImR,EAASzU,KACb,OAAIyU,EAAOyL,eAAiB5c,EAAQ,GAAK2d,EAAM,GACtC,IAAI7B,GAAY3K,IAErBnR,EAAQ,EACVmR,EAASA,EAAOkrB,WAAWr8B,GAClBA,IACTmR,EAASA,EAAOgpB,KAAKn6B,IAEnB2d,IAAQxZ,IACVwZ,EAAMkH,GAAUlH,GAChBxM,EAASwM,EAAM,EAAIxM,EAAOipB,WAAWzc,GAAOxM,EAAOirB,KAAKze,EAAM3d,IAEzDmR,IAGT2K,GAAYpd,UAAU49B,eAAiB,SAAStrB,GAC9C,OAAOtU,KAAK+d,UAAU8hB,UAAUvrB,GAAWyJ,WAG7CqB,GAAYpd,UAAUs/B,QAAU,WAC9B,OAAOthC,KAAK0/B,KAAK91B,IAInBge,GAAWxI,GAAYpd,WAAW,SAAS2R,EAAMmiB,GAC/C,IAAIkb,EAAgB,qCAAqCz4B,KAAKud,GAC1Dmb,EAAU,kBAAkB14B,KAAKud,GACjCob,EAAajyB,GAAOgyB,EAAW,QAAwB,QAAdnb,EAAuB,QAAU,IAAOA,GACjFqb,EAAeF,GAAW,QAAQ14B,KAAKud,GAEtCob,IAGLjyB,GAAOjd,UAAU8zB,GAAc,WAC7B,IAAIz0B,EAAQrB,KAAK4f,YACb/L,EAAOo9B,EAAU,CAAC,GAAKrb,UACvBwb,EAAS/vC,aAAiB+d,GAC1BnL,EAAWJ,EAAK,GAChBw9B,EAAUD,GAAUjyB,GAAQ9d,GAE5B4/B,EAAc,SAAS5/B,GACzB,IAAIoT,EAASy8B,EAAWx9B,MAAMuL,GAAQjK,GAAU,CAAC3T,GAAQwS,IACzD,OAAQo9B,GAAWtxB,EAAYlL,EAAO,GAAKA,GAGzC48B,GAAWL,GAAoC,mBAAZ/8B,GAA6C,GAAnBA,EAASzP,SAExE4sC,EAASC,GAAU,GAErB,IAAI1xB,EAAW3f,KAAK8f,UAChBwxB,IAAatxC,KAAK6f,YAAYrb,OAC9B+sC,EAAcJ,IAAiBxxB,EAC/B6xB,EAAWJ,IAAWE,EAE1B,IAAKH,GAAgBE,EAAS,CAC5BhwC,EAAQmwC,EAAWnwC,EAAQ,IAAI+d,GAAYpf,MAC3C,IAAIyU,EAASd,EAAKD,MAAMrS,EAAOwS,GAE/B,OADAY,EAAOoL,YAAYxb,KAAK,CAAE,KAAQ2yB,GAAM,KAAQ,CAACiK,GAAc,QAAWx5B,IACnE,IAAI4X,GAAc5K,EAAQkL,GAEnC,OAAI4xB,GAAeC,EACV79B,EAAKD,MAAM1T,KAAM6T,IAE1BY,EAASzU,KAAKg3B,KAAKiK,GACZsQ,EAAeN,EAAUx8B,EAAOpT,QAAQ,GAAKoT,EAAOpT,QAAWoT,QAK1EN,GAAU,CAAC,MAAO,OAAQ,QAAS,OAAQ,SAAU,YAAY,SAAS2hB,GACxE,IAAIniB,EAAO8G,GAAWqb,GAClB2b,EAAY,0BAA0Bl5B,KAAKud,GAAc,MAAQ,OACjEqb,EAAe,kBAAkB54B,KAAKud,GAE1C7W,GAAOjd,UAAU8zB,GAAc,WAC7B,IAAIjiB,EAAO+hB,UACX,GAAIub,IAAiBnxC,KAAK8f,UAAW,CACnC,IAAIze,EAAQrB,KAAKqB,QACjB,OAAOsS,EAAKD,MAAMyL,GAAQ9d,GAASA,EAAQ,GAAIwS,GAEjD,OAAO7T,KAAKyxC,IAAW,SAASpwC,GAC9B,OAAOsS,EAAKD,MAAMyL,GAAQ9d,GAASA,EAAQ,GAAIwS,UAMrD+T,GAAWxI,GAAYpd,WAAW,SAAS2R,EAAMmiB,GAC/C,IAAIob,EAAajyB,GAAO6W,GACxB,GAAIob,EAAY,CACd,IAAIvvC,EAAMuvC,EAAWvwC,KAAO,GACvBsB,GAAe1B,KAAK+d,GAAW3c,KAClC2c,GAAU3c,GAAO,IAEnB2c,GAAU3c,GAAK0C,KAAK,CAAE,KAAQyxB,EAAY,KAAQob,QAItD5yB,GAAUmY,GAAahvB,EAAWe,GAAoB7H,MAAQ,CAAC,CAC7D,KAAQ,UACR,KAAQ8G,IAIV2X,GAAYpd,UAAUye,MAAQH,GAC9BlB,GAAYpd,UAAU+b,QAAUyC,GAChCpB,GAAYpd,UAAUX,MAAQqf,GAG9BzB,GAAOjd,UAAUkmC,GAAKhH,GACtBjiB,GAAOjd,UAAU++B,MAAQI,GACzBliB,GAAOjd,UAAU0vC,OAAStQ,GAC1BniB,GAAOjd,UAAUgD,KAAOq8B,GACxBpiB,GAAOjd,UAAUq1B,MAAQmK,GACzBviB,GAAOjd,UAAU+b,QAAU0jB,GAC3BxiB,GAAOjd,UAAU2vC,OAAS1yB,GAAOjd,UAAU+c,QAAUE,GAAOjd,UAAUX,MAAQsgC,GAG9E1iB,GAAOjd,UAAU4uC,MAAQ3xB,GAAOjd,UAAUk8B,KAEtC/hB,KACF8C,GAAOjd,UAAUma,IAAeolB,IAE3BtiB,IAML/E,GAAIF,KAQNva,GAAKya,EAAIA,GAIT,aACE,OAAOA,IACR,qCAaH3Z,KAAKP,Q,0DCvzhBP,MAAM4xC,EAASvvC,EAAQ,QACjBD,EAAOC,EAAQ,QAIrB,MAAMC,EACLmD,YAAa9B,EAAWgB,EAAQ8+B,EAAU,IACzCzjC,KAAK2D,UAAYA,EACjB3D,KAAK2E,OAASA,EAEd3E,KAAK6xC,gBAAkBpO,EAAQoO,iBAAR,KAAkC,MACzD7xC,KAAK8xC,UAAYrO,EAAQqO,UAEzB9xC,KAAK+xC,SAAW,KAChB/xC,KAAKgyC,WAAa,KAElBhyC,KAAKiyC,WAAattC,EAAO7B,MAAM0B,OAAS,EAExCxE,KAAK4D,SAAWxB,EAAKyB,OACrB7D,KAAK4D,SAASsR,OAASlV,KAAK6xC,mBAAqB,EAEjD7xC,KAAKkyC,oBAAsBzO,EAAQyO,qBAAuBN,EAAOO,oBAIlEptC,KAAMhC,GAEL,MAAMG,EAAOlD,KAAK2E,OAAO7B,MAAMC,GAE/B,GAAIG,EAAKY,QAAQU,OAAS,EAAG,CAE5BtB,EAAKY,QAAQiV,QAAQ5U,IACpBA,EAAKC,aAAapE,KAAK4D,UAGvB,IAAK,IAAIwuC,EAAKrvC,EAAQ,EAAGqvC,GAAMzvC,KAAK4a,IAAIvd,KAAKiyC,WAAa,EAAGlvC,EAAQ6uC,EAAOS,YAAaD,EAAI,CAG5F,MAAME,EAAWtyC,KAAK2E,OAAO7B,MAAMsvC,GACnChvC,QAAQC,OAAOivC,EAAU,oBAAqBF,EAAIrvC,EAAO/C,KAAK2E,OAAO7B,OACrEwvC,EAASxuC,QAAQiV,QAAQw5B,IACxB,MAAMC,EAAOruC,EAAK+Q,OAASq9B,EAASr9B,OAE7Bs9B,EAAO,EAAIZ,EAAOa,eAAiBD,GAAQ,EAAIZ,EAAOc,gBAC5DvuC,EAAKC,aAAamuC,KAMrB,GAFApuC,EAAKwuC,MAAQxuC,EAAKyuC,UAAY,MAAQ,EAAIzuC,EAAK0uC,cAAc7yC,KAAK4D,SAASsR,QAEvE/Q,EAAKwuC,MAAQ,GAAK3yC,KAAK8xC,UAAW,CACrC,MAAMgB,EAAO9yC,KAAK2D,UAAUb,MAAMqB,EAAK4uC,IAAIC,UACvChzC,KAAK8xC,UAAUgB,KAClB3uC,EAAKwuC,OAAS,OAIjBzvC,EAAKY,QAAQ+S,KAAK,CAACo8B,EAAIC,IAAOA,EAAGP,MAAQM,EAAGN,OAC5C3yC,KAAKmzC,QAAUjwC,EAAKY,QAGpB,IAAIkuC,EAAa,KACjB,MAAMoB,EAAapzC,KAAKqzC,UAAUtwC,GAE5BuwC,EAAStzC,KAAKmzC,QAAQ,GACxBG,GAAUA,EAAOV,UAAY,IAE5BU,EAAOX,MAAQ,GAAMW,EAAOV,UAAY,IAAOjwC,KAAKuC,IAAIvC,KAAK4a,IAAI61B,EAAaE,EAAOjyC,MAAO,OAASrB,KAAKkyC,uBAC7GlyC,KAAK4D,SAASsR,OAASo+B,EAAOp+B,OAE9B88B,EAAasB,IAERtzC,KAAK+xC,UAAYuB,EAAOjyC,MAAQrB,KAAK+xC,SAAS1wC,SAClDrB,KAAK+xC,SAAWuB,IAIftB,EACHhyC,KAAKgyC,WAAaA,EAEbhyC,KAAK8E,YAAY/B,EAAO,CAACwwC,UAAU,MACvCvzC,KAAK4D,SAASsR,QAAUhS,EAAKK,QAAUZ,KAAKC,KAAKwwC,GACjDhwC,QAAQC,QAAQJ,OAAOQ,MAAMzD,KAAK4D,SAASsR,QAAS,0BAA2BhS,EAAKK,QAAS6vC,SAK/FpzC,KAAKmzC,QAAU,GAIjBnqB,MAAM,UAAC9S,EAAY,EAAb,QAAgBs9B,EAAUxzC,KAAK2E,OAAO7B,MAAM0B,OAAS,GAAK,IAC/D,MAAMwkB,EAAO,GAEb,IAAI9T,EAAS,KAEb,IAAK,IAAIk9B,EAAKoB,EAASpB,GAAMl8B,GAAY,CACxC,MAAMhT,EAAOlD,KAAK2E,OAAO7B,MAAMsvC,GAE/B,IAAKlvC,EAAKY,QAAQU,QAAUtB,EAAKY,QAAQ,GAAG6uC,OAAS,KAAQzvC,EAAKY,QAAQ,GAAG8uC,WAAa,EAAG,CAG5F5pB,EAAKopB,IAAO,IACVA,EACF,SAIa,MAAVl9B,IACHhS,EAAKY,QAAQiV,QAAQ5U,GAAQA,EAAKsvC,UAAatvC,EAAKyuC,UAAY,KAAOzuC,EAAK0uC,cAAc39B,IAAW,GACrGhS,EAAKY,QAAQ+S,KAAK,CAAC68B,EAAIC,IAAOA,EAAGF,UAAYC,EAAGD,YAGjD,MAAMtvC,EAAOjB,EAAKY,QAAQ,GAC1BK,EAAK6kB,KAAKjQ,QAAQ,CAACg6B,EAAIX,IAAOppB,EAAKopB,GAAMW,GAGzC79B,EAAS/Q,EAAK1E,KAAKyV,OAEnBk9B,EAAKjuC,EAAKyvC,OAAS,EAMpB,OAHAxwC,QAAQC,OAAO2lB,EAAKxkB,QAAUgvC,EAAU,EAAG,qBAAsBxqB,EAAM9S,EAAWs9B,EAAU,EAC3FxzC,KAAK2E,OAAO7B,MAAM0B,OAAQxE,KAAK2E,OAAO7B,MAAM0B,OAASxE,KAAK2E,OAAO7B,MAAM9C,KAAK2E,OAAO7B,MAAM0B,OAAS,GAAGzB,MAAQ,MAEvGimB,EAIRqqB,UAAWtwC,GACV,OAAOA,GAAS/C,KAAKgyC,WAAahyC,KAAKgyC,WAAWI,IAAM,GAAK,EAI9DttC,YAAa/B,GAAO,SAACwwC,GAAW,GAAQ,IACnCA,IACHvzC,KAAKiyC,WAAalvC,GAEnB,MAAM8wC,EAAe7zC,KAAK6xC,kBAC1B,OAAoB,MAAhBgC,IAGH7zC,KAAK4D,SAASsR,OAAS2+B,EAGvB7zC,KAAK4D,SAASwuC,GAAKrvC,EACnB/C,KAAKgyC,WAAa,KAElB5uC,QAAQC,QAAQJ,OAAOQ,MAAMzD,KAAK4D,SAASsR,QAAS,0BAA2B2+B,IAGxE,GAOT,yBACC,MAAMP,EAAStzC,KAAKmzC,SAAWnzC,KAAKmzC,QAAQ,GAC5C,IAAKG,EACJ,OAAO,KAER,MAAMF,EAAapzC,KAAKqzC,UAAUC,EAAOlB,IACzC,OAAIgB,GAAc,EACV,EAEDzwC,KAAKuC,IAAIvC,KAAK4a,IAAI61B,EAAaE,EAAOjyC,MAAO,OAASrB,KAAKkyC,qBAMpEtyC,EAAOD,QAAU2C,G,qBCzKjB1C,EAAOD,QAAU,MAChB8F,cACCzF,KAAKwyB,OAAS,GAGfshB,MAAOC,GACN/zC,KAAKwyB,QAAUuhB,EAIhBC,WAAY5zC,GACXJ,KAAKwyB,QAAUjY,OAAO05B,aAAc7zC,GAAK,GAAM,KAAQma,OAAO05B,aAAc7zC,GAAK,GAAM,KACtFma,OAAO05B,aAAc7zC,GAAK,EAAK,KAAQma,OAAO05B,aAAiB,IAAJ7zC,GAI7D8zC,WAAY9zC,GACXJ,KAAKwyB,QAAUjY,OAAO05B,aAAc7zC,GAAK,EAAK,KAAQma,OAAO05B,aAAiB,IAAJ7zC,GAI3E+zC,UAAW/zC,GACVJ,KAAKwyB,QAAUjY,OAAO05B,aAAiB,IAAJ7zC,GAOpCg0C,YAAah0C,GACZ,GAAIA,EAAI,EACP,MAAM,IAAIka,MAAM,qCAAuCla,GAExD,MAAMi0C,EAAQ,IAAJj0C,EACVA,IAAM,EACN,IAAI2zC,EAAMx5B,OAAO05B,aAAaI,GAE9B,MAAOj0C,EAAG,CACT,MAAMi0C,EAAQ,IAAJj0C,EACVA,IAAM,EACN2zC,EAAMx5B,OAAO05B,aAAiB,IAAJI,GAAYN,EAGvC/zC,KAAKwyB,QAAUuhB,EAGhBO,YACC,OAAOt0C,KAAKwyB,OAGb+hB,iBACC,OAAO74B,WAAW84B,KAAKx0C,KAAKwyB,OAAO7c,MAAM,IAAIkD,IAAIpY,GAAKA,EAAEu8B,WAAW,KAAKxK,U,qBCvD1E,MAAMiiB,EAAiB,CAACC,GAAWC,WAAW,GAAK,MAClD,MAAMC,EAAc,GACpB,IAAIC,EAAiB,IACrB,MAAMC,EAAeJ,EAASK,OAAOD,aAErC,IAAK,IAAI10C,EAAI,EAAGA,EAAIs0C,EAASM,OAAOxwC,OAAQpE,IAC3Cw0C,EAAYx0C,GAAK,CAChB60C,eAAgB,EAChBC,iBACCR,EAASM,OAAO50C,GAAGoE,OAClBkwC,EAASM,OAAO50C,GAAG,GAAG+0C,UACtB,MAKJ,SAASC,IACR,IAAIF,EAAmB,KACnBG,EAAiB,KACjBJ,EAAiB,KAErB,IAAK,IAAI70C,EAAI,EAAGA,EAAIw0C,EAAYpwC,OAAQpE,IAEH,MAAnCw0C,EAAYx0C,GAAG80C,mBACS,MAApBA,GAA4BN,EAAYx0C,GAAG80C,iBAAmBA,KAElEA,EAAmBN,EAAYx0C,GAAG80C,iBAClCG,EAAiBj1C,EACjB60C,EAAiBL,EAAYx0C,GAAG60C,gBAGlC,GAAsB,MAAlBI,EAAwB,CAE3B,MAAMC,EAAYZ,EAASM,OAAOK,GAAgBJ,GAC9CP,EAASM,OAAOK,GAAgBJ,EAAiB,GACpDL,EAAYS,GAAgBH,kBAAoBR,EAASM,OAAOK,GAAgBJ,EAAiB,GAAGE,UAEpGP,EAAYS,GAAgBH,iBAAmB,KAEhDN,EAAYS,GAAgBJ,gBAAkB,EAE9C,IAAK,IAAI70C,EAAI,EAAGA,EAAIw0C,EAAYpwC,OAAQpE,IACA,MAAnCw0C,EAAYx0C,GAAG80C,mBAClBN,EAAYx0C,GAAG80C,kBAAoBA,GAErC,MAAO,CACNK,aAAcL,EACdjuC,MAAOquC,EACPE,MAAOH,GAIR,OAAO,KAIT,IAAII,EACJ,MAAMvvC,EAAS,GAEf,SAASwvC,IACR,SAASC,IACR,IAAIC,EAAoB,EACxB,GAAIH,EAAUF,aAAe,EAAG,CAC/B,MAAMM,EAAkBJ,EAAUF,aAAeT,EACjDc,EAAoBC,GAAmBhB,EAAiB,IAI5B,QAAxBY,EAAUxuC,MAAMG,MAA6C,YAA3BquC,EAAUxuC,MAAM6uC,UAEtDjB,EAAiB,IAAQY,EAAUxuC,MAAM8uC,qBAG1C,MAAM7uC,EAA4B,IAApB0uC,EAA2BjB,GAAa,EACtDzuC,EAAO7B,KAAK,CAAEoxC,EAAWvuC,IACzBuuC,EAAYL,IAGb,GAAIK,EAAYL,IACf,MAAOK,EACNE,IAMH,OAFAD,IAEOxvC,GAIF8vC,EAAeC,IACpB,MAAMC,EAAS,IAAIj4B,IAEnB,OAAOg4B,EAAInU,OAAO,GAAG76B,QAAOsuC,oBAI3B,GAHIA,EAAe,GAClBW,EAAOv0B,QAEW,YAAf1a,EAAMG,KACT,OAAO,EAER,MAAMzF,EAAO,GAAEsF,EAAM6uC,WAAW7uC,EAAMkvC,WAAWlvC,EAAMmvC,aAEvD,OAAIF,EAAOj1C,IAAIU,KAKfu0C,EAAO78B,IAAI1X,EAAKsF,IAET,MAKHovC,EAAkBJ,IACvB,MAAMK,EAAU,IAAIr4B,IACds4B,EAAa,IAAIt4B,IACjBu4B,EAAQ,GAEd,IAAIC,GAAa,EA0EjB,OAxEAR,EAAIl9B,QAAQ,GAAG9R,QAAOsuC,iBAAgBxyC,KAIrC,GAHIwyC,EAAe,IAClBkB,EAAY1zC,GAEM,YAAfkE,EAAMG,KACT,OAED,MAAMzF,EAAO,GAAEsF,EAAMkvC,WAAWlvC,EAAMmvC,aAEtC,OAAQnvC,EAAM6uC,SACd,IAAK,SACAQ,EAAQr1C,IAAIU,GACf40C,EAAWl9B,IAAI1X,EAAK80C,GAEpBH,EAAQj9B,IAAI1X,EAAK80C,GAElB,MACD,IAAK,UACAF,EAAWt1C,IAAIU,IAClB60C,EAAMnyC,KAAK,CAACkyC,EAAWt1C,IAAIU,GAAMoB,IACjCwzC,EAAWG,OAAO/0C,IAGlB20C,EAAQI,OAAO/0C,GAEhB,SAKF60C,EAAMz9B,QAAQ,CAAC49B,EAAMv2C,KACpB,IAAK,IAAIw2C,EAAKx2C,EAAI,EAAGw2C,GAAM,IAAKA,EAAI,CACnC,MAAMC,EAAML,EAAMI,GAClB,GAAIC,EAAI,GAAKF,EAAK,GACjB,MAEGA,EAAK,GAAKE,EAAI,MACfF,EAAK,MAKVH,EAAMz9B,QAAQ,EAAE+9B,EAAOC,MACtB,GAAIA,GAAQd,EAAIzxC,OAAS,GAAKsyC,EAAQ,EACrC,OAED,MAAME,EAAWf,EAAIc,GACfzB,EAAYW,EAAIc,EAAO,GACvBE,EAAYhB,EAAIa,GAEtB,IAAKG,EAAU,GAAG1B,aAEjB,YADAnyC,QAAQ8zC,KAAK,uBAAwBJ,EAAOC,EAAME,GAKnD,MAAME,EAAQF,EAAU,GAAKA,EAAU,GAAG1B,aAE1CD,EAAU,IAAM0B,EAAS,GACzB1B,EAAU,GAAGC,cAAgByB,EAAS,GAAGzB,aAEzCyB,EAAS,GAAGzB,aAAe0B,EAAU,GAAG1B,aAAe,EACvD0B,EAAU,GAAG1B,aAAe,EAE5ByB,EAAS,GAAKA,EAAS,GAAGzB,aAAe4B,EACzCF,EAAU,GAAKA,EAAU,GAAG1B,aAAe4B,EAG3ClB,EAAIj6B,OAAO+6B,EAAM,GACjBd,EAAIj6B,OAAO86B,EAAO,EAAGE,KAGff,GAKRr2C,EAAOD,QAAU,CAChB80C,iBACAuB,eACAK,oB,mBCzMDz2C,EAAOD,QAAU,CAChBy3C,oBAAqB,GACrB/E,SAAU,EACVgF,2BAA4B,GAC5BC,wBAAyB,IAEzBC,SAAU,GACV9E,cAAe,EACfC,eAAgB,IAChB8E,eAAgB,IAEhBrF,oBAAqB,I,uBCPtB,MAAMsF,EAAUp1C,EAAQ,QAIxBzC,EAAOD,QAAU,UAAoB,OAAEo1C,EAAF,OAAUC,IAC9C,SAAS0C,EAAYC,EAAQplB,EAAIprB,GAChC/D,QAAQC,OAAqB,IAAdkvB,EAAG/tB,OAAc,2BAEhCmzC,EAAO7D,MAAMvhB,GACbolB,EAAO3D,WAAW7sC,EAAK3C,QACvBmzC,EAAO7D,MAAM3sC,GAGd,SAASywC,EAAYD,EAAQ1wC,GAC5B,GAAsB,YAAlBA,EAAM6uC,QAKV,OAFA6B,EAAOvD,YAAYntC,EAAMkuC,WAEjBluC,EAAMG,MACd,IAAK,OAGJ,OAFAuwC,EAAOxD,UAAU,KAETltC,EAAM6uC,SACd,IAAK,iBACJ6B,EAAOxD,UAAU,GACjBwD,EAAOvD,YAAY,GAEnBuD,EAAOzD,WAAWjtC,EAAMwe,QAExB,MACD,IAAK,OACJkyB,EAAOxD,UAAU,GACjBwD,EAAOvD,YAAYntC,EAAM4wC,KAAKrzC,QAE9BmzC,EAAO7D,MAAM7sC,EAAM4wC,MAEnB,MACD,IAAK,kBACJF,EAAOxD,UAAU,GACjBwD,EAAOvD,YAAYntC,EAAM4wC,KAAKrzC,QAE9BmzC,EAAO7D,MAAM7sC,EAAM4wC,MAEnB,MACD,IAAK,YACJF,EAAOxD,UAAU,GACjBwD,EAAOvD,YAAYntC,EAAM4wC,KAAKrzC,QAE9BmzC,EAAO7D,MAAM7sC,EAAM4wC,MAEnB,MACD,IAAK,iBACJF,EAAOxD,UAAU,GACjBwD,EAAOvD,YAAYntC,EAAM4wC,KAAKrzC,QAE9BmzC,EAAO7D,MAAM7sC,EAAM4wC,MAEnB,MACD,IAAK,SACJF,EAAOxD,UAAU,GACjBwD,EAAOvD,YAAYntC,EAAM4wC,KAAKrzC,QAE9BmzC,EAAO7D,MAAM7sC,EAAM4wC,MAEnB,MACD,IAAK,SACJF,EAAOxD,UAAU,GACjBwD,EAAOvD,YAAYntC,EAAM4wC,KAAKrzC,QAE9BmzC,EAAO7D,MAAM7sC,EAAM4wC,MAEnB,MACD,IAAK,WACJF,EAAOxD,UAAU,GACjBwD,EAAOvD,YAAYntC,EAAM4wC,KAAKrzC,QAE9BmzC,EAAO7D,MAAM7sC,EAAM4wC,MAEnB,MACD,IAAK,oBACJF,EAAOxD,UAAU,IACjBwD,EAAOvD,YAAY,GAEnBuD,EAAOxD,UAAUltC,EAAMkvC,SAEvB,MACD,IAAK,aACJwB,EAAOxD,UAAU,IACjBwD,EAAOvD,YAAY,GAEnB,MACD,IAAK,WACJuD,EAAOxD,UAAU,IACjBwD,EAAOvD,YAAY,GAEnBuD,EAAOxD,UAAWltC,EAAM8uC,qBAAuB,GAAM,KACrD4B,EAAOxD,UAAWltC,EAAM8uC,qBAAuB,EAAK,KACpD4B,EAAOxD,UAAsC,IAA5BltC,EAAM8uC,qBAEvB,MACD,IAAK,cACJ4B,EAAOxD,UAAU,IACjBwD,EAAOvD,YAAY,GAEnB,IAAI0D,EAAY,CAAEC,GAAI,EAAMC,GAAI,GAAMC,GAAI,GAAMC,GAAI,IAAOjxC,EAAMkxC,WACjER,EAAOxD,UAAUltC,EAAMmxC,KAAON,GAC9BH,EAAOxD,UAAUltC,EAAMwW,KACvBk6B,EAAOxD,UAAUltC,EAAMoxC,KACvBV,EAAOxD,UAAUltC,EAAMqxC,OACvBX,EAAOxD,UAAUltC,EAAMsxC,UAEvB,MACD,IAAK,gBACJZ,EAAOxD,UAAU,IACjBwD,EAAOvD,YAAY,GAEnBuD,EAAOxD,UAAUltC,EAAMuxC,WACvBb,EAAOxD,UAAUxxC,KAAK81C,KAAKxxC,EAAMyxC,cACjCf,EAAOxD,UAAUltC,EAAM0xC,WACvBhB,EAAOxD,UAAUltC,EAAM2xC,eAEvB,MACD,IAAK,eACJjB,EAAOxD,UAAU,IACjBwD,EAAOvD,YAAY,GAEnBuD,EAAOxD,UAAUltC,EAAMtF,KACvBg2C,EAAOxD,UAAUltC,EAAM4xC,OAEvB,MACD,IAAK,oBACJlB,EAAOxD,UAAU,KACjBwD,EAAOvD,YAAYntC,EAAME,KAAK3C,QAE9BmzC,EAAO7D,MAAM7sC,EAAME,MAEnB,MACD,QACC,MAAM,IAAImT,MAAM,2BAA6BrT,EAAM6uC,SAGpD,MACD,IAAK,QACJ6B,EAAOxD,UAAU,KACjBwD,EAAOvD,YAAYntC,EAAME,KAAK3C,QAC9BmzC,EAAO7D,MAAM7sC,EAAME,MAEnB,MACD,IAAK,eACJwwC,EAAOxD,UAAU,KACjBwD,EAAOvD,YAAYntC,EAAME,KAAK3C,QAC9BmzC,EAAO7D,MAAM7sC,EAAME,MAEnB,MACD,IAAK,UACJ,OAAQF,EAAM6uC,SACd,IAAK,SACJ6B,EAAOxD,UAAU,IAAOltC,EAAMkvC,SAC9BwB,EAAOxD,UAAUltC,EAAMmvC,YACvBuB,EAAOxD,UAAUltC,EAAM6xC,UAEvB,MACD,IAAK,UACJnB,EAAOxD,UAAU,IAAOltC,EAAMkvC,SAC9BwB,EAAOxD,UAAUltC,EAAMmvC,YACvBuB,EAAOxD,UAAUltC,EAAM6xC,SAAW7xC,EAAM6xC,SAAW,GAEnD,MACD,IAAK,iBACJnB,EAAOxD,UAAU,IAAOltC,EAAMkvC,SAC9BwB,EAAOxD,UAAUltC,EAAMmvC,YACvBuB,EAAOxD,UAAUltC,EAAM8xC,QAEvB,MACD,IAAK,aACJpB,EAAOxD,UAAU,IAAOltC,EAAMkvC,SAC9BwB,EAAOxD,UAAUltC,EAAM+xC,gBACvBrB,EAAOxD,UAAUltC,EAAM5F,OAEvB,MACD,IAAK,gBACJs2C,EAAOxD,UAAU,IAAOltC,EAAMkvC,SAC9BwB,EAAOxD,UAAUltC,EAAMgyC,eAEvB,MACD,IAAK,oBACJtB,EAAOxD,UAAU,IAAOltC,EAAMkvC,SAC9BwB,EAAOxD,UAAUltC,EAAM8xC,QAEvB,MACD,IAAK,YACJpB,EAAOxD,UAAU,IAAOltC,EAAMkvC,SAC9BwB,EAAOxD,UAAwB,IAAdltC,EAAM5F,OACvBs2C,EAAOxD,UAAWltC,EAAM5F,OAAS,EAAK,KAEtC,MACD,QACC,MAAM,IAAIiZ,MAAM,2BAA6BrT,EAAM6uC,SAGpD,MACD,QACC,MAAM,IAAIx7B,MAAM,wBAA0BrT,EAAMG,OAIlD,MAAMuwC,EAAS,IAAIF,EAEbyB,EAAc,IAAIzB,EACxByB,EAAYhF,WAAWa,EAAOoE,YAC9BD,EAAYhF,WAAWc,EAAOxwC,QAC9B00C,EAAYhF,WAAWa,EAAOD,cAE9B4C,EAAWC,EAAQ,OAAQuB,EAAY5E,aAEvC,IAAK,IAAIl0C,EAAI,EAAGA,EAAI40C,EAAOxwC,SAAUpE,EAAG,CACvC,MAAMg5C,EAAa,IAAI3B,EAEvB,IAAK,IAAI4B,EAAK,EAAGA,EAAKrE,EAAO50C,GAAGoE,SAAU60C,EACzCzB,EAAWwB,EAAYpE,EAAO50C,GAAGi5C,IAElC3B,EAAWC,EAAQ,OAAQyB,EAAW9E,aAGvC,OAAOqD,EAAOpD,mB,qBCjOf30C,EAAOD,QAAU,MAChB8F,YAAa+sB,GACZxyB,KAAK+T,MAAQ,IAAI2H,WAAW8W,GAC5BxyB,KAAK6qC,SAAW,EAIjByO,MACC,OAAOt5C,KAAK6qC,UAAY7qC,KAAK+T,MAAMvP,OAIpC+0C,KAAM/0C,GACL,MAAMiQ,EAASzU,KAAK+T,MAAMoD,MAAMnX,KAAK6qC,SAAU7qC,KAAK6qC,SAAWrmC,GAG/D,OAFAxE,KAAK6qC,UAAYrmC,EAEViQ,EAIR+kC,WAAYh1C,GACX,MAAM2C,EAAO4N,MAAMy/B,KAAKx0C,KAAKu5C,KAAK/0C,IAElC,OAAO2C,EAAK0R,IAAIpY,GAAK8Z,OAAO05B,aAAaxzC,IAAI+P,KAAK,IAKnDipC,YACC,MAAMhlC,GACJzU,KAAK+T,MAAM/T,KAAK6qC,WAAa,KAC7B7qC,KAAK+T,MAAM/T,KAAK6qC,SAAW,IAAM,KACjC7qC,KAAK+T,MAAM/T,KAAK6qC,SAAW,IAAM,GAClC7qC,KAAK+T,MAAM/T,KAAK6qC,SAAW,GAG5B,OAFA7qC,KAAK6qC,UAAY,EAEVp2B,EAKRilC,YACC,MAAMjlC,GACJzU,KAAK+T,MAAM/T,KAAK6qC,WAAa,GAC9B7qC,KAAK+T,MAAM/T,KAAK6qC,SAAW,GAG5B,OAFA7qC,KAAK6qC,UAAY,EAEVp2B,EAKRklC,SAAUC,GACT,IAAInlC,EAASzU,KAAK+T,MAAM/T,KAAK6qC,UAK7B,OAJI+O,GAAUnlC,EAAS,MACtBA,GAAU,KACXzU,KAAK6qC,UAAY,EAEVp2B,EAQRolC,aACC,IAAIplC,EAAS,EACb,MAAO,EAAM,CACZ,MAAM4/B,EAAIr0C,KAAK25C,WACf,KAAQ,IAAJtF,GAMH,OAAO5/B,EAAS4/B,EALhB5/B,GAAe,IAAJ4/B,EACX5/B,IAAW,M,qBC7Ef7U,EAAOD,QAAU,SAASC,GAoBzB,OAnBKA,EAAOk6C,kBACXl6C,EAAOm6C,UAAY,aACnBn6C,EAAO2lB,MAAQ,GAEV3lB,EAAOo6C,WAAUp6C,EAAOo6C,SAAW,IACxCl5C,OAAOC,eAAenB,EAAQ,SAAU,CACvCoB,YAAY,EACZC,IAAK,WACJ,OAAOrB,EAAOS,KAGhBS,OAAOC,eAAenB,EAAQ,KAAM,CACnCoB,YAAY,EACZC,IAAK,WACJ,OAAOrB,EAAOQ,KAGhBR,EAAOk6C,gBAAkB,GAEnBl6C,I,qBCpBR,WAMC,SAAUH,EAAMC,GAEb,EAAO,GAAI,EAAF,EAAS,kEAFtB,CAQkB,qBAATK,MAAuBA,MAAa,WAC3C,SAASk6C,IACP,GAAIC,SAASC,cACX,OAAOD,SAASC,cAKlB,IACE,MAAM,IAAI7/B,MAEZ,MAAO8/B,GAEL,IAMEC,EACAC,EACAC,EAREC,EAAgB,kCAClBC,EAAgB,6BAChBC,EAAeF,EAAct/B,KAAKk/B,EAAIr0B,QAAU00B,EAAcv/B,KAAKk/B,EAAIr0B,OACvE40B,EAAkBD,GAAgBA,EAAa,KAAO,EACtDE,EAAQF,GAAgBA,EAAa,KAAO,EAC5CG,EAAkBX,SAASY,SAASC,KAAK1jC,QAAQ6iC,SAASY,SAASE,KAAM,IAIzEC,EAAUf,SAASgB,qBAAqB,UAEtCP,IAAmBE,IACrBR,EAAaH,SAASiB,gBAAgBC,UACtCd,EAA2B,IAAI/tC,OAAO,sBAAwBquC,EAAO,GAAK,iDAAkD,KAC5HL,EAAqBF,EAAWhjC,QAAQijC,EAA0B,MAAMrN,QAG1E,IAAK,IAAI7sC,EAAI,EAAGA,EAAI66C,EAAQz2C,OAAQpE,IAAK,CAEvC,GAA8B,gBAA1B66C,EAAQ76C,GAAGi7C,WACb,OAAOJ,EAAQ76C,GAIjB,GAAI66C,EAAQ76C,GAAGk7C,MAAQX,EACrB,OAAOM,EAAQ76C,GAIjB,GACEu6C,IAAmBE,GACnBI,EAAQ76C,GAAGm7C,WACXN,EAAQ76C,GAAGm7C,UAAUtO,SAAWsN,EAEhC,OAAOU,EAAQ76C,GAKnB,OAAO,MAIX,OAAO65C,M,uBCjET,MAAMuB,EAASn5C,EAAQ,QAIvBzC,EAAOD,QAAU,SAAmBwH,GACnC,SAASs0C,EAAW9D,GACnB,MAAMplB,EAAKolB,EAAO6B,WAAW,GACvBh1C,EAASmzC,EAAO8B,YAEtB,MAAO,CACNlnB,KACA/tB,SACA2C,KAAMwwC,EAAO4B,KAAK/0C,IAIpB,IAAIk3C,EAEJ,SAASC,EAAWhE,GACnB,MAAM1wC,EAAQ,GACdA,EAAMkuC,UAAYwC,EAAOkC,aACzB,IAAI+B,EAAgBjE,EAAOgC,WAC3B,GAA+B,OAAV,IAAhBiC,GAAgC,CAEpC,GAAsB,MAAlBA,EA0HC,IAAsB,MAAlBA,EAAwB,CAChC30C,EAAMG,KAAO,QACb,MAAM5C,EAASmzC,EAAOkC,aAGtB,OAFA5yC,EAAME,KAAOwwC,EAAO6B,WAAWh1C,GAExByC,EAEH,GAAsB,MAAlB20C,EAAwB,CAChC30C,EAAMG,KAAO,eACb,MAAM5C,EAASmzC,EAAOkC,aAGtB,OAFA5yC,EAAME,KAAOwwC,EAAO6B,WAAWh1C,GAExByC,EAGP,MAAM,IAAIqT,MAAM,sCAAwCshC,GAzI7B,CAE3B30C,EAAMG,KAAO,OACb,MAAMy0C,EAAclE,EAAOgC,WACrBn1C,EAASmzC,EAAOkC,aAEtB,OAAQgC,GACR,KAAK,EAEJ,GADA50C,EAAM6uC,QAAU,iBACD,IAAXtxC,EACH,MAAM,IAAI8V,MAAM,sDAAwD9V,GAGzE,OAFAyC,EAAMwe,OAASkyB,EAAO+B,YAEfzyC,EACR,KAAK,EAIJ,OAHAA,EAAM6uC,QAAU,OAChB7uC,EAAM4wC,KAAOF,EAAO6B,WAAWh1C,GAExByC,EACR,KAAK,EAIJ,OAHAA,EAAM6uC,QAAU,kBAChB7uC,EAAM4wC,KAAOF,EAAO6B,WAAWh1C,GAExByC,EACR,KAAK,EAIJ,OAHAA,EAAM6uC,QAAU,YAChB7uC,EAAM4wC,KAAOF,EAAO6B,WAAWh1C,GAExByC,EACR,KAAK,EAIJ,OAHAA,EAAM6uC,QAAU,iBAChB7uC,EAAM4wC,KAAOF,EAAO6B,WAAWh1C,GAExByC,EACR,KAAK,EAIJ,OAHAA,EAAM6uC,QAAU,SAChB7uC,EAAM4wC,KAAOF,EAAO6B,WAAWh1C,GAExByC,EACR,KAAK,EAIJ,OAHAA,EAAM6uC,QAAU,SAChB7uC,EAAM4wC,KAAOF,EAAO6B,WAAWh1C,GAExByC,EACR,KAAK,EAIJ,OAHAA,EAAM6uC,QAAU,WAChB7uC,EAAM4wC,KAAOF,EAAO6B,WAAWh1C,GAExByC,EACR,KAAK,GAEJ,GADAA,EAAM6uC,QAAU,oBACD,IAAXtxC,EACH,MAAM,IAAI8V,MAAM,yDAA2D9V,GAG5E,OAFAyC,EAAMkvC,QAAUwB,EAAOgC,WAEhB1yC,EACR,KAAK,GAEJ,GADAA,EAAM6uC,QAAU,aACD,IAAXtxC,EACH,MAAM,IAAI8V,MAAM,kDAAoD9V,GAErE,OAAOyC,EACR,KAAK,GAEJ,GADAA,EAAM6uC,QAAU,WACD,IAAXtxC,EACH,MAAM,IAAI8V,MAAM,gDAAkD9V,GAOnE,OANAyC,EAAM8uC,qBACJ4B,EAAOgC,YAAc,KACpBhC,EAAOgC,YAAc,GACtBhC,EAAOgC,WAGF1yC,EACR,KAAK,GAEJ,GADAA,EAAM6uC,QAAU,cACD,IAAXtxC,EACH,MAAM,IAAI8V,MAAM,mDAAqD9V,GACtE,MAAMs3C,EAAWnE,EAAOgC,WAUxB,OATA1yC,EAAMkxC,UAAY,CACjB4D,EAAM,GAAI,GAAM,GAAI,GAAM,GAAI,GAAM,IACxB,GAAXD,GACF70C,EAAMmxC,KAAkB,GAAX0D,EACb70C,EAAMwW,IAAMk6B,EAAOgC,WACnB1yC,EAAMoxC,IAAMV,EAAOgC,WACnB1yC,EAAMqxC,MAAQX,EAAOgC,WACrB1yC,EAAMsxC,SAAWZ,EAAOgC,WAEjB1yC,EACR,KAAK,GAEJ,GADAA,EAAM6uC,QAAU,gBACD,IAAXtxC,EACH,MAAM,IAAI8V,MAAM,qDAAuD9V,GAMxE,OALAyC,EAAMuxC,UAAYb,EAAOgC,WACzB1yC,EAAMyxC,YAAc/1C,KAAKq5C,IAAI,EAAGrE,EAAOgC,YACvC1yC,EAAM0xC,UAAYhB,EAAOgC,WACzB1yC,EAAM2xC,cAAgBjB,EAAOgC,WAEtB1yC,EACR,KAAK,GAEJ,GADAA,EAAM6uC,QAAU,eACD,IAAXtxC,EACH,MAAM,IAAI8V,MAAM,oDAAsD9V,GAIvE,OAHAyC,EAAMtF,IAAMg2C,EAAOgC,UAAS,GAC5B1yC,EAAM4xC,MAAQlB,EAAOgC,WAEd1yC,EACR,KAAK,IAIJ,OAHAA,EAAM6uC,QAAU,oBAChB7uC,EAAME,KAAOwwC,EAAO6B,WAAWh1C,GAExByC,EACR,QAKC,OAHAA,EAAM6uC,QAAU,UAChB7uC,EAAME,KAAOwwC,EAAO6B,WAAWh1C,GAExByC,QAuBL,CAEJ,IAAIg1C,EAC2B,KAAV,IAAhBL,IAIJK,EAASL,EACTA,EAAgBF,IAGhBO,EAAStE,EAAOgC,WAChB+B,EAAoBE,GAGrB,MAAMM,EAAYN,GAAiB,EAInC,OAHA30C,EAAMkvC,QAA0B,GAAhByF,EAChB30C,EAAMG,KAAO,UAEL80C,GACR,KAAK,EAKJ,OAJAj1C,EAAM6uC,QAAU,UAChB7uC,EAAMmvC,WAAa6F,EACnBh1C,EAAM6xC,SAAWnB,EAAOgC,WAEjB1yC,EACR,KAAK,EAQJ,OAPAA,EAAMmvC,WAAa6F,EACnBh1C,EAAM6xC,SAAWnB,EAAOgC,WACD,IAAnB1yC,EAAM6xC,SACT7xC,EAAM6uC,QAAU,UAEhB7uC,EAAM6uC,QAAU,SAEV7uC,EACR,KAAK,GAKJ,OAJAA,EAAM6uC,QAAU,iBAChB7uC,EAAMmvC,WAAa6F,EACnBh1C,EAAM8xC,OAASpB,EAAOgC,WAEf1yC,EACR,KAAK,GAKJ,OAJAA,EAAM6uC,QAAU,aAChB7uC,EAAM+xC,eAAiBiD,EACvBh1C,EAAM5F,MAAQs2C,EAAOgC,WAEd1yC,EACR,KAAK,GAIJ,OAHAA,EAAM6uC,QAAU,gBAChB7uC,EAAMgyC,cAAgBgD,EAEfh1C,EACR,KAAK,GAIJ,OAHAA,EAAM6uC,QAAU,oBAChB7uC,EAAM8xC,OAASkD,EAERh1C,EACR,KAAK,GAIJ,OAHAA,EAAM6uC,QAAU,YAChB7uC,EAAM5F,MAAQ46C,GAAUtE,EAAOgC,YAAc,GAEtC1yC,EACR,QACC,MAAM,IAAIqT,MAAM,iCAAmC4hC,KAatD,IAAI1vC,EAASrF,EACO,kBAATA,IACVqF,EAASrF,EAAKwO,MAAM,IAAIkD,IAAIpY,GAAKA,EAAEu8B,WAAW,KAE/C,MAAM2a,EAAS,IAAI6D,EAAOhvC,GACpB0sC,EAAcuC,EAAU9D,GAC9B,GAAuB,SAAnBuB,EAAY3mB,IAAwC,IAAvB2mB,EAAY10C,OAC5C,MAAM,IAAI8V,MAAM,oCAEjB,MAAM6hC,EAAe,IAAIX,EAAOtC,EAAY/xC,MACtCgyC,EAAagD,EAAazC,YAC1B0C,EAAaD,EAAazC,YAC1B2C,EAAeF,EAAazC,YAElC,IAAI5E,EACJ,GAAmB,MAAfuH,EACH,MAAM,IAAI/hC,MAAM,iEAEhBw6B,EAAeuH,EAGhB,MAAMtH,EAAS,CACdoE,aACAiD,aACAtH,gBAEKE,EAAS,GACf,IAAK,IAAI50C,EAAI,EAAGA,EAAI20C,EAAOqH,WAAYh8C,IAAK,CAC3C40C,EAAO50C,GAAK,GACZ,MAAMg5C,EAAaqC,EAAU9D,GAC7B,GAAsB,SAAlByB,EAAW7mB,GACd,MAAM,IAAIjY,MAAM,yCAA2C8+B,EAAW7mB,IAEvE,MAAM+pB,EAAc,IAAId,EAAOpC,EAAWjyC,MAC1C,OAAQm1C,EAAYhD,MAAO,CAC1B,MAAMryC,EAAQ00C,EAAUW,GACxBtH,EAAO50C,GAAGiE,KAAK4C,IAIjB,MAAO,CACN8tC,SACAC,Y,qBC7RF,MAAM,KAAC56B,GAAQ/X,EAAQ,QAEjBuvC,EAASvvC,EAAQ,QAIvB,MAAMD,EACLqD,YAAa82C,EAAQC,GACpBx8C,KAAKu8C,OAASA,EACdv8C,KAAKw8C,OAASA,EAEdp5C,QAAQC,OAAgC,MAAzBrD,KAAKu8C,OAAO/4C,UAAmB,4BAC9CxD,KAAKkV,OAASlV,KAAKu8C,OAAO/4C,UAAYxD,KAAKw8C,OAAOh5C,UAElDxD,KAAKy8C,MAAQ,KACbz8C,KAAK08C,WAAa,EAClB18C,KAAK28C,OAAS,EACd38C,KAAK48C,YAAa,EAMnB,WACC,OAAO58C,KAAKy8C,MAIb,SAAUp7C,GACLA,GAASrB,KAAKy8C,QACjBz8C,KAAKy8C,MAAQp7C,EACbrB,KAAK48C,YAAa,GAKpB,SACC,OAAO58C,KAAKu8C,OAAOx5C,MAIpB,SACC,OAAO/C,KAAKw8C,OAAOz5C,MAIpB,WACC,OAAO/C,KAAK68C,KAAKp9C,MAAQO,KAI1B,aACC,OAAQA,KAAK68C,KAAKh5C,KAA0B7D,KAAKoyC,GAAxBpyC,KAAK68C,KAAKjJ,OAIpC,SACC,MAAQ,GAAE5zC,KAAKu8C,OAAOx5C,SAAS/C,KAAKw8C,OAAOz5C,QAI5C,YAAa85C,EAAMr3B,EAAMzlB,GACxB,OAAO88C,EAAOjL,EAAOwF,oBAAsBz0C,KAAKC,KAAK4iB,EAAOosB,EAAO2F,UAAY50C,KAAKC,KAAY,GAAP7C,GAI1F+8C,cACK98C,KAAK48C,aACR58C,KAAK08C,WAAat6C,EAAK26C,KAAK/8C,KAAK68C,KAAKjK,UAAW5yC,KAAKoyC,GAAKpyC,KAAK68C,KAAKzK,GAAK,EAAGpyC,KAAKg9C,UAClFh9C,KAAK28C,OAAS38C,KAAK68C,KAAKx7C,MAAQ,EAAIsB,KAAKC,KAAqB,GAAhB5C,KAAKg9C,UAEnDh9C,KAAK48C,YAAa,GAKpB,gBAGC,OAFA58C,KAAK88C,cAEE98C,KAAK08C,WAIb,YAGC,OAFA18C,KAAK88C,cAEE98C,KAAK28C,OAIb,WACC,OAAO38C,KAAK68C,KAAKI,KAAO,EAIzB,WACC,MAAMj0B,EAAO,GACb,IAAK,IAAI7kB,EAAOnE,MAAOmE,EAAKN,KAAMM,EAAOA,EAAK04C,KAC7C7zB,EAAK7kB,EAAKiuC,IAAMjuC,EAAK4uC,GAGtB,IAAK,IAAI3yC,EAAI,EAAGA,EAAI4oB,EAAKxkB,SAAUpE,EACZ,iBAAX4oB,EAAK5oB,KACf4oB,EAAK5oB,IAAM,GAEb,OAAO4oB,EAIRk0B,OACC,OAAO9iC,EAAKpa,KAAM,CAAC,KAAM,KAAM,KAAM,SAAU,QAAS,OAAQ,SAAU,SAAU,QAAS,WAAY,cAI1GoE,aAAcD,GACb,MAAM44C,EAAO/8C,KAAKm9C,iBAAiBh5C,GAEnCf,QAAQC,OAAOrD,KAAKoyC,GAAKjuC,EAAKiuC,IAAM,EAAG,oBAAqBpyC,KAAMmE,GAIlE,MAAMyuC,EAAYxwC,EAAK26C,KAAK54C,EAAKyuC,UAAW5yC,KAAKoyC,GAAKjuC,EAAKiuC,GAAK,EAAG2K,GAEnE,QAAK/8C,KAAK68C,MAAQjK,EAAY5yC,KAAK4yC,aAClC5yC,KAAK68C,KAAO14C,EACZnE,KAAKg9C,SAAWD,GAET,GAOTI,iBAAkBh5C,GACjB,IAAI44C,EAAO,EAEX,GAAmB,MAAf54C,EAAK+Q,OAAgB,CACxB,MAAMs9B,EAAOxyC,KAAKkV,OAAS/Q,EAAK+Q,OAC1BkoC,EAAYj5C,EAAKN,KAAO+tC,EAAO4F,eAAkBhF,EAAO,EAAIZ,EAAOa,cAAgBb,EAAOc,eAChGqK,IAASvK,EAAO4K,IAAc,EAG/B,OAAOL,EAIRlK,cAAe39B,GACd,MAAMmoC,EAAW16C,KAAK26C,IAAIt9C,KAAKkV,OAASA,GAAU,EAElD,OAAOvS,KAAKC,KAAK5C,KAAKqB,MAAQuwC,EAAO0F,yBAA2B30C,KAAKC,KAAKy6C,EAAWzL,EAAOyF,4BAM7F,cACC,MAAO,CACNxzC,MAAM,EACN+uC,UAAW,EACXvxC,MAAO,EACP+wC,IAAK,EACLW,IAAK,EACLkK,KAAM,EACN/nC,OAAQ,IAOXtV,EAAOD,QAAUyC,G,mBC5KjB,IAAIm7C,EAGJA,EAAI,WACH,OAAOv9C,KADJ,GAIJ,IAECu9C,EAAIA,GAAK,IAAIprC,SAAS,cAAb,GACR,MAAOU,GAEc,kBAAX2qC,SAAqBD,EAAIC,QAOrC59C,EAAOD,QAAU49C,G,qBClBjB,MAAME,EAAOp7C,EAAQ,QAIfq7C,EAAkBx3C,IACvB,IAAI4sC,EAAO,EAEX5sC,EAAO6S,QAAQ9R,IACd6rC,GAAQ7rC,EAAMkuC,UACdluC,EAAM6rC,KAAOA,KAKT6K,EAAkBz3C,IACvB,IAAI03C,EAAW,EAEf13C,EAAO2Q,KAAK,CAACgnC,EAAIC,IAAOD,EAAG/K,KAAOgL,EAAGhL,MAAM/5B,QAAQ9R,IAClDA,EAAMkuC,UAAYluC,EAAM6rC,KAAO8K,EAC/BA,EAAW32C,EAAM6rC,QAKbiL,EAAa,CAACvI,EAAOxC,EAAWgL,KACrCN,EAAgBlI,GAEhB,MAAMtvC,EAAS,GACTgwC,EAAS,GA+Bf,OA7BAV,EAAMz8B,QAAQ9R,IACb,GAAIA,EAAM6rC,MAAQE,GAAa/rC,EAAM6rC,MAAQkL,GAA6B,eAAlB/2C,EAAM6uC,QAC7D5vC,EAAO7B,KAAK,IACR4C,EACH6rC,KAAM7rC,EAAM6rC,KAAOE,SAEhB,GAAI/rC,EAAM6rC,KAAOE,EACrB,OAAQ/rC,EAAMG,MACd,IAAK,OACJ8uC,EAAOjvC,EAAM6uC,SAAW7uC,EAExB,SAKHnG,OAAOmU,OAAOihC,GAAQn9B,QAAQ9R,GAASf,EAAO7B,KAAK,IAC/C4C,EACH6rC,KAAM,KAGP5sC,EAAO7B,KAAK,CACXyuC,KAAMkL,EAAUhL,EAChB5rC,KAAM,OACN0uC,QAAS,eAGV6H,EAAgBz3C,GAETA,GAIF+3C,EAAY,CAACC,EAAMlL,EAAWgL,KAAlB,CACjBjJ,OAAQmJ,EAAKnJ,OACbC,OAAQkJ,EAAKlJ,OAAOn8B,IAAI28B,GAASuI,EAAWvI,EAAOxC,EAAWgL,MAIzDG,EAAkB,IAElBC,EAA8B,CACnC,aAAc,YACd,SAAU,WAIX,SAASC,EAAiB95C,GAAU,UAAC8B,EAAD,qBAAYi4C,EAAuB,KAAS,IAC/E/5C,EAASwxC,oBAAsBxxC,EAASwxC,qBAAuB,IAE/D,MAAMjB,EAAeqJ,EACfI,EAA2B,IAAfzJ,EAAsBvwC,EAASwxC,oBAE3ChB,EAAS,CAAEoE,WAAY,EAAGrE,gBAC1BU,EAAQ,GAEd,IAAKvyC,OAAO8C,SAASM,GAAY,CAChC,IAAK9B,EAASzB,QAAUyB,EAASzB,MAAM,GACtC,MAAM,IAAIwX,MAAM,8CAEjBjU,EAAY9B,EAASzB,MAAM,GAAGQ,MAG/BkyC,EAAMnxC,KAAK,CAAE6C,KAAMb,EAAWe,KAAM,OAAQ0uC,QAAS,kBAAmB+B,KAAO,sCAAqC,IAAIx9B,KAAKpX,OAAOwP,kBAAiC+rC,iBAErK,MAAMC,EAAgBl6C,EAAS2B,QAAU3B,EAAS2B,OAAO67B,KAAK96B,GAA0B,YAAjBA,EAAM6uC,SACxE2I,IACJjJ,EAAMnxC,KAAK,CAAE6C,KAAMb,EAAWe,KAAM,OAAQ0uC,QAAS,gBAAiB0C,UAAW,EAAGE,YAAa,EAAGE,cAAe,IACnHpD,EAAMnxC,KAAK,CAAE6C,KAAMb,EAAWe,KAAM,OAAQ0uC,QAAS,WAAYC,oBAAqBxxC,EAASwxC,uBAMhG,IAAI/vC,EAAUK,GAAa,EAE3B,GAAI9B,EAASzB,MACZ,IAAK,MAAMI,KAAQqB,EAASzB,MAC3B0yC,EAAMnxC,KAAK,CACV6C,KAAMhE,EAAKI,MACX8D,KAAM,UACN0uC,QAAS,SACTK,QAASjzC,EAAKizC,SAAW,EACzBC,WAAYlzC,EAAKe,MACjB60C,SAAU51C,EAAK41C,SACf4F,OAAQx7C,EAAKw7C,SAGd14C,EAAUrD,KAAK4a,IAAIvX,EAAS9C,EAAKI,OAE7BL,OAAO8C,SAASu4C,KACnBp7C,EAAKsD,SAAWtD,EAAKsD,UAAY83C,GAC9Bp7C,EAAKsD,WACRgvC,EAAMnxC,KAAK,CACV6C,KAAMhE,EAAKI,MAAQJ,EAAKsD,SACxBY,KAAM,UACN0uC,QAAS,UACTK,QAASjzC,EAAKizC,SAAW,EACzBC,WAAYlzC,EAAKe,MACjB60C,SAAU,IAGX9yC,EAAUrD,KAAK4a,IAAIvX,EAAS9C,EAAKI,MAAQJ,EAAKsD,WAKjD,GAAIjC,EAAS2B,OAAQ,CACpB,MAAMA,EAAS3B,EAAS2B,OAAO47B,OAAO76B,IAAUm3C,EAA4B92B,SAASrgB,EAAME,KAAK2uC,UAChG,IAAK,MAAM7uC,KAASf,EACnBsvC,EAAMnxC,KAAK,CACV6C,KAAMD,EAAMC,QACTD,EAAME,OAGVnB,EAAUrD,KAAK4a,IAAIvX,EAASiB,EAAMC,MAsBpC,OAlBAsuC,EAAMnxC,KAAK,CAAE6C,KAAMlB,EAAU,IAAKoB,KAAM,OAAQ0uC,QAAS,eAEzDN,EAAM3+B,MAAK,SAAUgnC,EAAIC,GAAM,OAAOD,EAAG32C,KAAO42C,EAAG52C,QAGnDsuC,EAAM38B,IAAI,CAAC5R,EAAOlE,KAAR,CAAoBkE,QAAOlE,WACnC++B,OAAO,EAAE76B,WAA4B,UAAjBA,EAAM6uC,SAAuC,MAAhB7uC,EAAMy3C,QACvD3gC,UACAhF,QAAQ,EAAE9R,QAAOlE,WAAWyyC,EAAMx5B,OAAOjZ,EAAQ,EAAG,EAAG,CACvDmE,KAAMD,EAAMC,KACZE,KAAM,OACN0uC,QAAS,OACT+B,KAAO,aAAY5wC,EAAMy3C,aAG3BlJ,EAAMz8B,QAAQ9R,GAASA,EAAM03C,MAAQh8C,KAAKstC,OAAOhpC,EAAMC,KAAOb,GAAak4C,IAC3E/I,EAAMz8B,QAAQ,CAAC9R,EAAO7G,IAAM6G,EAAMkuC,UAAaluC,EAAM03C,OAASv+C,EAAI,EAAIo1C,EAAMp1C,EAAI,GAAGu+C,MAAQ,IAEpF,CAAC5J,SAAQC,OAAQ,CAACQ,IAI1B,SAASoJ,EAAar6C,EAAUk/B,GAC/B,MAAMt8B,EAAOk3C,EAAiB95C,EAAUk/B,GACxC,OAAOga,EAAKoB,eAAe13C,GAK5BvH,EAAOD,QAAU,CAChBs+C,YACAI,mBACAO,iB,qBCrLD,MAAME,EAAez8C,EAAQ,QAIvB08C,EAAuB,CAC5BC,GAAI,UACJC,GAAI,aACJC,GAAI,YACJC,GAAI,QAKL,MAAMh6C,EACL,iBAAkBgC,GAAM,WAACi4C,GAAa,GAAQ,IAC7C,MAAMC,EAAgB,GAChBC,EAAc,GACdC,EAAS,GACTC,EAAW,GACXC,EAAO,GACb,IAAIv4C,EAAO,EACPw4C,EAAsB,IACtBC,EAAQ,EACRnH,EAAY,EACZoH,EAAW,EACf,MAAMC,EAAW,GACjB,IAEIC,EAFAC,EAAW,EACXpB,EAAQ,EAEZ,MAAMj4C,EAAS,GAETouC,EAAe3tC,EAAK4tC,OAAOD,aAEjC,IAAIkL,EAAYlB,EAAarK,eAAettC,GAExCi4C,IACHY,EAAYlB,EAAa9I,aAAa8I,EAAazI,gBAAgB2J,KAEpE,MAAM95C,EAAS85C,EAAUnnC,IAAInY,IAAK,CACjCyG,KAAMzG,EAAE,GAAGuG,MACXuuC,MAAO90C,EAAE,GAAG80C,MACZL,UAAWz0C,EAAE,GACbu/C,WAAYv/C,EAAE,GAAG60C,gBAGlB,IAAIxyC,EAAQ,EAEZ,MAAMm9C,EAAc,EAEpB,IAAK,MAAMC,KAAMj6C,EAAQ,CAIxB,GAHA65C,GAAYI,EAAGF,WACftB,EAAQh8C,KAAKstC,MAAM8P,EAAWG,GAE1BC,EAAGF,WAAa,EAAG,CAEtB,MAAMG,EAAaD,EAAGF,WAAanL,EACnC,IAAK,IAAIT,EAAI1xC,KAAKia,KAAK+iC,GAAQtL,EAAIsL,EAAQS,IAAc/L,EAAG,CAC3D,MAAM/yC,EAAI4F,GAAQmtC,EAAIsL,GAASD,EAC/BD,EAAKp7C,KAAK,CAAC6C,KAAM5F,EAAGyB,MAAO68C,EAAWpH,MAEpCoH,EAGHD,GAASS,EAGVl5C,GAAQi5C,EAAGhL,UAKXgL,EAAGj5C,KAAOA,EACVi5C,EAAGxB,MAAQA,EAEX,MAAM13C,EAAQk5C,EAAGh5C,KACjB,OAAQF,EAAMG,MACd,IAAK,UAGJ,OAAQH,EAAM6uC,SACd,IAAK,SACJ,CACC,MAAM7xC,EAAQgD,EAAMmvC,WAEpBiJ,EAAch7C,KAAK,CAClB8xC,QAASlvC,EAAMkvC,QACflyC,QACA+uC,UAAW2L,EACXr7C,MAAO4D,EACP4xC,SAAU7xC,EAAM6xC,SAChB6G,MAAOA,EACPnK,MAAO2K,EAAG3K,QAGXqK,EAASxvB,IAAM1tB,KAAK8a,IAAIoiC,EAASxvB,KAAOpsB,EAAOA,GAE/Ck8C,EAAGp9C,MAAQA,IACTA,EAGH,MACD,IAAK,UACJ,CACC,MAAMkB,EAAQgD,EAAMmvC,WAEpBoJ,EAASv4C,EAAMkvC,SAAWqJ,EAASv4C,EAAMkvC,UAAY,GAErD,MAAMkK,EAAchB,EAAcr4C,UAAUkvC,GAAUA,EAAOC,SAAWlvC,EAAMkvC,SAAWD,EAAOjyC,OAASA,GACzG,GAAIo8C,GAAe,EAAG,CACrB,MAAMnK,EAASmJ,EAAcrjC,OAAOqkC,EAAa,GAAG,GAEpDb,EAASv4C,EAAMkvC,SAAS9xC,KAAK,CAC5B8xC,QAASlvC,EAAMkvC,QACfnD,UAAWkD,EAAOlD,UAClBgL,QAASW,EACT16C,QACAX,MAAO4yC,EAAO5yC,MACdkD,SAAUU,EAAOgvC,EAAO5yC,MACxBw1C,SAAU5C,EAAO4C,SACjB6G,MAAOzJ,EAAOyJ,MACdnK,MAAOU,EAAOV,MACdkJ,OAAQxI,EAAOwI,cAIhBt7C,QAAQk9C,MAAM,uBAAwBp5C,EAAMD,GAE7C44C,EAASvvB,KAAO3tB,KAAK4a,IAAIsiC,EAASvvB,MAAQrsB,EAAOA,GAGlD,MACD,IAAK,aACJ,OAAQgD,EAAM+xC,gBAEd,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACJ,MAAMuH,EAAYxB,EAAqB93C,EAAM+xC,gBAE7CsG,EAAYr4C,EAAMkvC,SAAWmJ,EAAYr4C,EAAMkvC,UAAY,GAC3DoJ,EAAOt4C,EAAMkvC,SAAWoJ,EAAOt4C,EAAMkvC,UAAY,GAEjD,MAAMD,EAASoJ,EAAYr4C,EAAMkvC,SAASoK,GAEtCrK,GACHqJ,EAAOt4C,EAAMkvC,SAAS9xC,KAAK,CAAC+C,KAAMm5C,EAAWj9C,MAAO4yC,EAAO5yC,MAAOkD,SAAUU,EAAOgvC,EAAO5yC,MAAOjC,MAAO60C,EAAO70C,QAChHi+C,EAAYr4C,EAAMkvC,SAASoK,GAAa,CAACj9C,MAAO4D,EAAM7F,MAAO4F,EAAM5F,OAEnE,MAGD,MAGD,MACD,IAAK,OACJ,OAAQ4F,EAAM6uC,SACd,IAAK,WACJ4J,EAAsBz4C,EAAM8uC,oBAAsB,IAGlDrvC,EAAOrC,KAAK,CAAC8yC,MAAOlwC,EAAM8uC,oBAAqBjD,KAAM6L,EAAOz3C,SAE5D,MACD,IAAK,gBACJsxC,EAAYvxC,EAAMuxC,UAClBoH,EAAW,EAEX,MACD,IAAK,OACJ,IAAKE,GAAmB,gBAAgBvnC,KAAKtR,EAAM4wC,MAAO,CACzD,MAAM2I,EAAWv5C,EAAM4wC,KAAKhiC,MAAM,eAC5Bk+B,EAAMyM,GAAYA,EAAS,IAAM,GACvCV,EAAkB/L,EAAIp+B,MAAM,KAAKkD,IAAI1W,GAAKc,OAAOd,SAE7C,GAAI,kBAAkBoW,KAAKtR,EAAM4wC,MAAO,CAC5C,MAAO39B,EAAGumC,GAAWx5C,EAAM4wC,KAAKhiC,MAAM,YAChC6oC,EAASz7C,OAAOw9C,GACtB,IAAKx9C,OAAOQ,MAAMi7C,GAAS,CAC1B,MAAMxI,EAASmJ,EAAcA,EAAc76C,OAAS,GAChD0xC,IACHA,EAAOwI,OAASA,GAEjB,MAAMz3C,EAAQf,EAAO67B,KAAKlvB,GAAKA,EAAE9P,OAASA,EAAQ,GAC9CkE,IACHA,EAAME,KAAKu3C,OAASA,IAIvB,MACD,IAAK,kBACJt7C,QAAQ8B,IAAI,kBAAmB+B,EAAM4wC,MAErC,MAGD,OAoBF,OAhBAwH,EAActmC,QAAQm9B,IACrB9yC,QAAQk9C,MAAM,2BAA4BpK,EAAOlD,UAAWkD,GAE5DsJ,EAAStJ,EAAOC,SAAS9xC,KAAK,CAC7B2uC,UAAWkD,EAAOlD,UAClBgL,QAASW,EACT16C,MAAOiyC,EAAOjyC,MACdX,MAAO4yC,EAAO5yC,MACdkD,SAAUU,EAAOgvC,EAAO5yC,MACxBw1C,SAAU5C,EAAO4C,SACjB6G,MAAOzJ,EAAOyJ,MACdnK,MAAOU,EAAOV,MACdkJ,OAAQxI,EAAOwI,WAIV,IAAIv5C,EAAS,CACnBq6C,WACAK,WACAN,SACAE,OACAz5C,QAASkB,EACT82C,QAASW,EACTmB,kBACA55C,SACAQ,SACAouC,eACA4L,KAAM,KAKRj7C,YAAak7C,GACZ7/C,OAAOgnC,OAAO9nC,KAAM2gD,GAGpB3gD,KAAK8C,MAAQ,GACb,IAAK,MAAMqzC,KAAWn2C,KAAKw/C,SAC1B,GAAIrJ,EACH,IAAK,MAAMjzC,KAAQizC,EAClBn2C,KAAK8C,MAAMuB,KAAKnB,GAGnBlD,KAAK8C,MAAM+T,MAAK,SAAU68B,EAAIC,GAC7B,OAAOD,EAAGpwC,MAAQqwC,EAAGrwC,SAGtB,IAAK,MAAMlD,KAAKJ,KAAK8C,MACpB9C,KAAK8C,MAAM1C,GAAG2C,MAAQE,OAAO7C,GAI9BJ,KAAKwG,SAAWxG,KAAK8C,MAAM0B,OAAS,EAAKxE,KAAKgG,QAAUhG,KAAK8C,MAAM,GAAGQ,MAAS,EAM/EtD,KAAKgE,SAAW,GAChB,IAAK,MAAMvD,KAAKT,KAAKw/C,SACpB,IAAK,MAAM39C,KAAK7B,KAAKw/C,SAAS/+C,GAAI,CACjC,MAAMwD,EAAQjE,KAAKw/C,SAAS/+C,GAAGoB,GAAGoC,MAClCjE,KAAKgE,SAASC,GAASjE,KAAKgE,SAASC,IAAU,GAE/CjE,KAAKgE,SAASC,GAAOI,KAAKrE,KAAKw/C,SAAS/+C,GAAGoB,IA2C7C,GAvCA7B,KAAKgE,SAAS+U,QAAQjW,GAASA,EAAM+T,KAAK,CAAC68B,EAAIC,IAAOD,EAAGpwC,MAAQqwC,EAAGrwC,QAuChEtD,KAAK0gD,KAAKE,UACb,IAAK,IAAIxgD,EAAI,EAAGA,EAAIJ,KAAK0gD,KAAKE,UAAUp8C,SAAUpE,EAAG,CACpD,MAAMygD,EAAO7gD,KAAK0gD,KAAKE,UAAUxgD,GACjC,GAAIA,EAAI,EAAG,CACV,MAAM0gD,EAAW9gD,KAAK0gD,KAAKE,UAAUxgD,EAAI,GACzCygD,EAAKE,UAAYD,EAASC,UAAYp+C,KAAKia,MAAMikC,EAAK/N,KAAOgO,EAAShO,MAAQ9yC,KAAK80C,mBAGnF+L,EAAKE,UAAY,EAMpB,CACC,IAAI75C,EAAO,EACPy3C,EAAQ,EACRxH,EAAQ,IACZ,IAAK,MAAMv1B,KAAS5hB,KAAK0G,OAAQ,CAChC,MAAMu5C,EAAar+B,EAAMkxB,KAAO6L,EAChCz3C,GAASiwC,EAAQ,IAAQ8I,EAAajgD,KAAK80C,aAE3C6J,EAAQ/8B,EAAMkxB,KACdqE,EAAQv1B,EAAMu1B,MAEdv1B,EAAM1a,KAAOA,IAMhB85C,qBAAsBx9C,EAAWy9C,EAAS,IACzC,OAAOjhD,KAAK8C,MAAMg/B,OAAO5+B,GAAQP,KAAK26C,IAAIp6C,EAAKM,UAAYA,GAAay9C,GAIzEC,aAAcC,GACbA,EAAYA,GAAa,CAAC3M,KAAM,EAAG4M,GAAIphD,KAAKqhD,SAE5Cj+C,QAAQC,OAAOrD,KAAK0G,OAAQ,cAC5BtD,QAAQC,OAAO89C,EAAUC,GAAKD,EAAU3M,KAAM,oBAAqB2M,GAEnE,MAAMG,EAAOv+C,IACZ,MAAMyxC,EAAO7xC,KAAK4a,IAAI4jC,EAAU3M,KAAMx0C,KAAK0G,OAAO3D,GAAO+vC,MACnDsO,EAAMr+C,EAAQ/C,KAAK0G,OAAOlC,OAAS,EAAK7B,KAAK8a,IAAIzd,KAAK0G,OAAO3D,EAAQ,GAAG+vC,KAAMqO,EAAUC,IAAMD,EAAUC,GAE9G,OAAOz+C,KAAK4a,IAAI,EAAG6jC,EAAK5M,IAGnB+M,EAAYvhD,KAAK0G,OAAOi8B,OAAO,CAAC0N,EAAK8G,EAAOp0C,IAAUstC,EAAM8G,EAAMA,MAAQmK,EAAKv+C,GAAQ,GAEvFy+C,EAAUD,GAAaJ,EAAUC,GAAKD,EAAU3M,MAGtD,OAAO,IAAQgN,EAIhB36C,YAAaisC,GACZ1vC,QAAQC,OAAOJ,OAAO8C,SAAS+sC,GAAO,sBAAuBA,GAC7D1vC,QAAQC,OAAOrD,KAAK0G,QAAU1G,KAAK0G,OAAOlC,OAAQ,cAElD,MAAMi9C,EAAmBzhD,KAAK0G,OAAOM,UAAUmwC,GAASA,EAAMrE,KAAOA,GAC/D4O,EAAcD,EAAmB,EAAIzhD,KAAK0G,OAAOlC,OAAS,EAAI7B,KAAK4a,IAAIkkC,EAAmB,EAAG,GAE7FtK,EAAQn3C,KAAK0G,OAAOg7C,GAE1B,OAAOvK,EAAMjwC,MAAQ4rC,EAAOqE,EAAMrE,MAAQqE,EAAMA,MAAQ,KAAOn3C,KAAK80C,aAIrEluC,YAAaM,GACZ9D,QAAQC,OAAOJ,OAAO8C,SAASmB,GAAO,sBAAuBA,GAC7D9D,QAAQC,OAAOrD,KAAK0G,QAAU1G,KAAK0G,OAAOlC,OAAQ,cAElD,MAAMi9C,EAAmBzhD,KAAK0G,OAAOM,UAAUmwC,GAASA,EAAMjwC,KAAOA,GAC/Dw6C,EAAcD,EAAmB,EAAIzhD,KAAK0G,OAAOlC,OAAS,EAAI7B,KAAK4a,IAAIkkC,EAAmB,EAAG,GAE7FtK,EAAQn3C,KAAK0G,OAAOg7C,GAE1B,OAAOvK,EAAMrE,MAAQ5rC,EAAOiwC,EAAMjwC,MAAQlH,KAAK80C,cAA8B,KAAdqC,EAAMA,OAItEwK,qBAAsBR,GAGrB,OAFA/9C,QAAQC,OAAO89C,EAAUC,IAAMD,EAAU3M,KAAM,sBAAuB2M,GAE/D,CACN3M,KAAMx0C,KAAK6G,YAAYs6C,EAAU3M,MACjC4M,GAAIphD,KAAK6G,YAAYs6C,EAAUC,KAiCjCQ,YAAY,OAACC,EAAD,UAASC,IACpB1+C,QAAQC,OAAOrD,KAAK0G,QAAU1G,KAAK0G,OAAOlC,OAAQ,0CAE9Cs9C,IACHD,EAASC,EAAY9hD,KAAK0G,OAAO,GAAGywC,OAErC/zC,QAAQC,OAAOJ,OAAO8C,SAAS87C,IAAWA,EAAS,EAAG,wCAAyCA,GAE/F7hD,KAAK0G,OAAOqS,QAAQo+B,IACnBA,EAAMA,OAAS0K,EACf1K,EAAMjwC,MAAQ26C,IAEf7hD,KAAKkG,OAAO6S,QAAQ9R,IACnBA,EAAMkuC,WAAa0M,EACnB56C,EAAMC,MAAQ26C,IAEf7hD,KAAK8C,MAAMiW,QAAQ7V,IAClBA,EAAKI,OAASu+C,EACd3+C,EAAKsD,UAAYq7C,IAGlB7hD,KAAKgG,SAAW67C,GAMlBjiD,EAAOD,QAAU,CAChBwF,a,qBC1cDvF,EAAOD,QAAU,CAChBoiD,cAAe1/C,EAAQ,QACvBw8C,eAAgBx8C,EAAQ,U,kCCDzB,G,mQAAsB,qBAAXm7C,OAAwB,CACjC,IAAIrD,EAAgBqD,OAAOtD,SAASC,cAE9BF,EAAmB,EAAQ,QAC/BE,EAAgBF,IAGV,kBAAmBC,UACvBp5C,OAAOC,eAAem5C,SAAU,gBAAiB,CAAEj5C,IAAKg5C,IAI5D,IAAIqB,EAAMnB,GAAiBA,EAAcmB,IAAIzlC,MAAM,2BAC/CylC,IACF,IAA0BA,EAAI,IAKnB,I,yDCpBf,MAAM0G,EAAe,CACpBC,QAAS,oEAGTC,kBAAmB,SAAUxmB,GAC5B,MAAMymB,EAAQx/C,KAAKia,KAAM,EAAI8e,EAAMl3B,OAAU,GACvC49C,EAAK,IAAIvmB,YAAYsmB,GAG3B,OAFAniD,KAAKqiD,OAAO3mB,EAAO0mB,GAEZA,GAGRC,OAAQ,SAAU3mB,EAAO/I,GAExB,MAAM2vB,EAAQtiD,KAAKiiD,QAAQjzB,QAAQ0M,EAAM9hB,OAAO8hB,EAAMl3B,OAAS,IACzD+9C,EAAQviD,KAAKiiD,QAAQjzB,QAAQ0M,EAAM9hB,OAAO8hB,EAAMl3B,OAAS,IAE/D,IAIIg+C,EACAC,EAAMC,EAAMC,EACZC,EAAMC,EAAMC,EAAMC,EANlBZ,EAAQx/C,KAAKia,KAAM,EAAI8e,EAAMl3B,OAAU,GAC7B,KAAV89C,GAAcH,IACJ,KAAVI,GAAcJ,IAKlB,IAAI/hD,EAAI,EACJ4iD,EAAI,EASR,IANCR,EADG7vB,EACM,IAAIjX,WAAWiX,GAEf,IAAIjX,WAAWymC,GAEzBzmB,EAAQA,EAAMrkB,QAAQ,mBAAoB,IAErCjX,EAAI,EAAGA,EAAI+hD,EAAO/hD,GAAK,EAE3BwiD,EAAO5iD,KAAKiiD,QAAQjzB,QAAQ0M,EAAM9hB,OAAOopC,MACzCH,EAAO7iD,KAAKiiD,QAAQjzB,QAAQ0M,EAAM9hB,OAAOopC,MACzCF,EAAO9iD,KAAKiiD,QAAQjzB,QAAQ0M,EAAM9hB,OAAOopC,MACzCD,EAAO/iD,KAAKiiD,QAAQjzB,QAAQ0M,EAAM9hB,OAAOopC,MAEzCP,EAAQG,GAAQ,EAAMC,GAAQ,EAC9BH,GAAgB,GAAPG,IAAc,EAAMC,GAAQ,EACrCH,GAAgB,EAAPG,IAAa,EAAKC,EAE3BP,EAAOpiD,GAAKqiD,EACC,KAATK,IAAaN,EAAOpiD,EAAI,GAAKsiD,GACpB,KAATK,IAAaP,EAAOpiD,EAAI,GAAKuiD,GAGlC,OAAOH,IAMMR,QCpDf,MAAMvE,EAAOD,OAAOC,MAAQ,GAC5BD,OAAOC,KAAOA,EAGd,MAAMwF,EAAY,SAAUxjD,GAC3Bg+C,EAAKyF,IAAMzjD,EAAKyjD,IAChBzF,EAAK0F,UAAY1jD,EAAK0jD,UACtB1F,EAAK2F,cAAgB3jD,EAAK2jD,cAC1B3F,EAAK4F,OAAS5jD,EAAK4jD,OACnB5F,EAAK6F,QAAU7jD,EAAK6jD,QACpB7F,EAAK8F,QAAU9jD,EAAK8jD,QACpB9F,EAAK+F,SAAW/jD,EAAK+jD,SACrB/F,EAAKgG,aAAehkD,EAAKgkD,aACzBhG,EAAKiG,SAAWjkD,EAAKikD,SACrBjG,EAAKkG,WAAalkD,EAAKkkD,aAWxB,WACC,IAAIC,EAAS,KACTC,EAAS,KAEb,MAAMpkD,EAAOg+C,EAAKqG,QAAU,CAC3BZ,IAAK,WAENzjD,EAAK0jD,UAAY,SAAUhN,EAAS4N,GACnCF,EAAOG,KAAK,CAAC,IAAO7N,EAAS,EAAM4N,KAGpCtkD,EAAK2jD,cAAgB,SAAUjN,EAAS8N,GACvCJ,EAAOG,KAAK,CAAC,IAAO7N,EAAS8N,KAG9BxkD,EAAK4jD,OAAS,SAAUlN,EAASjzC,EAAM41C,EAAU9T,GAChD6e,EAAOG,KAAK,CAAC,IAAO7N,EAASjzC,EAAM41C,GAAmB,IAAR9T,IAG/CvlC,EAAK6jD,QAAU,SAAUnN,EAASjzC,EAAM8hC,GACvC6e,EAAOG,KAAK,CAAC,IAAO7N,EAASjzC,EAAM,GAAY,IAAR8hC,IAGxCvlC,EAAK8jD,QAAU,SAAUpN,EAAS+N,EAAOpL,EAAU9T,GAClD,IAAK,IAAInjC,EAAI,EAAGA,EAAIqiD,EAAM1/C,OAAQ3C,IAAK,CACtC,IAAIqB,EAAOghD,EAAMriD,GACjBgiD,EAAOG,KAAK,CAAC,IAAO7N,EAASjzC,EAAM41C,GAAmB,IAAR9T,KAIhDvlC,EAAK+jD,SAAW,SAAUrN,EAAS+N,EAAOlf,GACzC,IAAK,IAAInjC,EAAI,EAAGA,EAAIqiD,EAAM1/C,OAAQ3C,IAAK,CACtC,IAAIqB,EAAOghD,EAAMriD,GACjBgiD,EAAOG,KAAK,CAAC,IAAO7N,EAASjzC,EAAM,GAAY,IAAR8hC,KAIzCvlC,EAAKgkD,aAAe,WACnB,IAAK,IAAItN,EAAU,EAAGA,EAAU,GAAIA,IACnC0N,EAAOG,KAAK,CAAC,IAAO7N,EAAS,IAAM,KAGrC12C,EAAKikD,SAAW,WACf,OAAOE,EAAOO,aAGf1kD,EAAKkkD,WAAa,WACjB,OAAOC,EAAOD,cAGflkD,EAAK2kD,QAAU,SAAUC,GACxBpB,EAAUxjD,GACVoF,UAAUy/C,oBAAoBC,MAAK,SAAUC,GAC5CZ,EAASY,EAET,MAAMC,EAAU,IAAIb,EAAOa,SAC3BZ,EAASY,EAAQJ,EAAKK,mBAAqB,GAAG,GAC1CL,EAAKpuB,UAAUouB,EAAKpuB,cACtB,WACEunB,OAAOmH,cAAgBnH,OAAOoH,mBACjCP,EAAKnB,IAAM,WAEH1F,OAAOqH,MACfR,EAAKnB,IAAM,WAGXmB,EAAKnB,IAAM,QAEZzF,EAAKqH,WAAWT,QApEnB,IAiFI7G,OAAOmH,cAAgBnH,OAAOoH,qBACjC,WAEC,GAAIpH,OAAOC,MAAQD,OAAOC,KAAKsH,SAE9B,YADAtH,EAAKsH,SAAWvH,OAAOC,KAAKsH,UAI7B,MAAMJ,EAAenH,OAAOmH,cAAgBnH,OAAOoH,mBAE7CnlD,EAAOg+C,EAAKsH,SAAW,CAC5B7B,IAAK,WACL8B,mBAAoB,IAErB,IAAIC,EACJ,MAAM/vB,EAAU,GAChB,IAAIgwB,EAAe,IACnB,MAAMC,EAAe,GACfC,EAAc,SAAUC,EAAYC,EAASviD,EAAOwiD,EAAYtvB,GACrE,MAAMuvB,EAAQ/H,EAAKgI,YAAYC,OAAOL,GAChCM,EAAeH,EAAM//B,OACrBmgC,EAAMN,EAAQviD,GACpB,IAAK06C,EAAKoI,UAAUR,GAAYO,GAC/B,OAAO3vB,EAASovB,GAEjB,MAAMS,EAASrI,EAAKoI,UAAUR,GAAYO,GAAKjwC,MAAM,KAAK,GACpD6c,EAASwvB,EAAaE,kBAAkB4D,GAC9Cb,EAAIc,gBAAgBvzB,GAAQ,SAAUA,GACrC,IAAIwzB,EAAMJ,EACV,MAAOI,EAAIxhD,OAAS,EACnBwhD,GAAO,SAOR,GAN6B,qBAAjBvI,EAAKwI,QAChBxI,EAAKwI,OAAOlc,OAAO,KAAMyb,EAAMH,WAAa,oBAAsBtiD,EAAQ,GAAK,KAAO,GAAK,QAAUijD,GAEtGxzB,EAAOD,GAAKqzB,EACZL,EAAWxiD,GAASyvB,EAEhB+yB,EAAW/gD,SAAW8gD,EAAQ9gD,OAAQ,CACzC,MAAO+gD,EAAW/gD,OAAQ,CAEzB,GADAguB,EAAS+yB,EAAWhjC,OACfiQ,EACJ,SACD,MAAM0zB,EAASzI,EAAK0I,UAAU3zB,EAAOD,IACrC4yB,EAAaQ,EAAe,GAAKO,GAAU1zB,EAE5CyD,EAASovB,QAKNe,EAAuBC,GAAa1jD,KAAK4a,IAAsC,MAAjC8oC,EAAY//C,YAAYC,OAAgB0+C,EAAIqB,YAAa,GAE7G7mD,EAAK0jD,UAAY,SAAUhN,EAAS4N,GACnCmB,EAAenB,GAGhBtkD,EAAK8mD,MAAQ,WACZ,OAAQzlD,OAAOqa,KAAKgqC,GAAc3gD,QAGnC/E,EAAK+mD,WAAa,WACjB,OAAQ1lD,OAAOqa,KAAK1b,EAAKulD,oBAAoBxgD,QAG9C/E,EAAK2jD,cAAgB,SAAUjN,EAAS8N,GACvCxG,EAAK+B,SAASrJ,GAASkP,WAAapB,GAGrCxkD,EAAK4jD,OAAS,SAAUlN,EAASjzC,EAAM41C,EAAUuN,EAAY,GAE5D,IAAK5I,EAAK+B,SAASrJ,GAClB,OACD,MAAMkP,EAAa5H,EAAK+B,SAASrJ,GAASkP,WAC1C,IAAKF,EAAaE,EAAa,GAAKniD,GACnC,OAED,MAAMujD,EAAOL,EAAqBC,GAG5B75C,EAASy4C,EAAIyB,qBACnBxxB,EAAQihB,EAAU,GAAKjzC,GAAQsJ,EAC/BA,EAAOgmB,OAAS2yB,EAAaE,EAAa,GAAKniD,GAC/CsJ,EAAO43C,QAAQa,EAAI0B,aAEf1B,EAAI2B,WACPp6C,EAAOq6C,SAAW5B,EAAI2B,aAGtBp6C,EAAOq6C,SAAW5B,EAAI6B,iBAEvB,MAAMzlD,EAASy3C,EAAW,KAAQoM,EAAe,KAAO,EAAI,EAY5D,OAXA14C,EAAOq6C,SAASzC,QAAQa,EAAI0B,aAG5Bn6C,EAAOq6C,SAASE,KAAKC,gBAAgBrkD,KAAK4a,KAAK,EAAGlc,GAAQ4jD,EAAIqB,YAAa,GAC3E95C,EAAO43C,QAAQ53C,EAAOq6C,UAClBr6C,EAAO62C,OACV72C,EAAO62C,OAAOoD,GAGdj6C,EAAOlJ,MAAMmjD,GAEPj6C,GAGR/M,EAAK6jD,QAAU,SAAUnN,EAASjzC,EAAMmjD,EAAY,GACnD,MAAMI,EAAOL,EAAqBC,GAE5B75C,EAAS0oB,EAAQihB,EAAU,GAAKjzC,GACtC,GAAKsJ,EAAL,CACA,GAAIA,EAAOq6C,SAAU,CAIpB,MAAME,EAAOv6C,EAAOq6C,SAASE,KAC7BA,EAAKE,wBAAwBF,EAAK1lD,MAAOolD,GACzCM,EAAKE,yBAAyB,EAAGR,EAAO,IAErCj6C,EAAO82C,QACV92C,EAAO82C,QAAQmD,EAAO,IAGtBj6C,EAAO06C,KAAKT,EAAO,WAGbvxB,EAAQihB,EAAU,GAAKjzC,KAG/BzD,EAAK8jD,QAAU,SAAUpN,EAAS+N,EAAOpL,EAAU9T,GAElD,IADA,IAAkB9hC,EAAdikD,EAAM,GACDtlD,EAAI,EAAG2C,EAAS0/C,EAAM1/C,OAAQ3C,EAAI2C,EAAQ3C,IAClDslD,EAAIjkD,EAAOghD,EAAMriD,IAAMpC,EAAK4jD,OAAOlN,EAASjzC,EAAM41C,EAAU9T,GAE7D,OAAOmiB,GAGR1nD,EAAK+jD,SAAW,SAAUrN,EAAS+N,EAAOlf,GAEzC,IADA,IAAkB9hC,EAAdikD,EAAM,GACDtlD,EAAI,EAAG2C,EAAS0/C,EAAM1/C,OAAQ3C,EAAI2C,EAAQ3C,IAClDslD,EAAIjkD,EAAOghD,EAAMriD,IAAMpC,EAAK6jD,QAAQnN,EAASjzC,EAAM8hC,GAEpD,OAAOmiB,GAGR1nD,EAAKgkD,aAAe,WACnB,IAAK,IAAIj3C,KAAU0oB,EAAS,CAC3B,IAAI8P,EAAQ,EACRA,EAAQigB,EAAIqB,cAAathB,GAASigB,EAAIqB,aAI1CpxB,EAAQ1oB,GAAQq6C,SAASE,KAAKE,wBAAwB,EAAGjiB,GACzD9P,EAAQ1oB,GAAQq6C,SAASE,KAAKE,wBAAwB,EAAGjiB,EAAQ,WAE1D9P,EAAQ1oB,KAIjB/M,EAAK2kD,QAAU,SAAUC,GACxBpB,EAAUxjD,GAEVwlD,EAAM,IAAIN,EAEV,MAAMW,EAAU,GAChB,IAAK,MAAM3jD,KAAO87C,EAAK0I,UACtBb,EAAQjhD,KAAK1C,GACd,MAAM4jD,EAAa,GACb6B,EAAU,GACVC,EAAa,SAAUhC,GAE5B,IAAK,IAAI1jD,YADFylD,EAAQ/B,GACC+B,EACf,OACIzlD,GAAO0iD,EAAKpuB,UAChBouB,EAAKpuB,YAGP,IAAK,MAAMovB,KAAc5H,EAAKoI,UAAW,CACxCuB,EAAQ/B,IAAc,EACtB,IAAK,IAAIjlD,EAAI,EAAGA,EAAIklD,EAAQ9gD,OAAQpE,IACnCglD,EAAYC,EAAYC,EAASllD,EAAGmlD,EAAY8B,KAlLpD,GAgMG7J,OAAOqH,OACV,WACC,MAAMplD,EAAOg+C,EAAK6J,SAAW,CAC5BpE,IAAK,YAQN,IANA,IAAIqE,EAAU,GACVxD,EAAS,IACTyD,GAAe,EACfhI,EAAW,GACXiI,EAA2B,GAC3B3kD,EAAQ,GACH4kD,EAAM,EAAGA,EAAM,GAAIA,IAC3BlI,EAASkI,GAAO,IAAI7C,MAGrB,IAAI8C,EAAc,SAAUxR,EAASyR,GACpC,GAAKnK,EAAK+B,SAASrJ,GAAnB,CACA,IAAIkP,EAAa5H,EAAK+B,SAASrJ,GAASkP,WACpCM,EAAelI,EAAKgI,YAAYoC,KAAKxC,GAAY9yB,GACjDrvB,EAAOJ,EAAM8kD,GACjB,GAAK1kD,EAAL,CACA,IAAI4kD,EAAmBnC,EAAe,GAAKziD,EAAKqvB,GAC5Cm1B,GAAOF,EAAc,GAAKhI,EAASh7C,OACnCujD,EAAQvI,EAASkI,GACrBD,EAA0BC,GAAQI,EAClCC,EAAMzM,IAAMmC,EAAKoI,UAAUF,GAAcziD,EAAKqvB,IAC9Cw1B,EAAMhE,OAASA,EAAS,IACxBgE,EAAMC,OACNR,EAAcE,KAGXO,EAAc,SAAU9R,EAASyR,GACpC,GAAKnK,EAAK+B,SAASrJ,GAAnB,CACA,IAAIkP,EAAa5H,EAAK+B,SAASrJ,GAASkP,WACpCM,EAAelI,EAAKgI,YAAYoC,KAAKxC,GAAY9yB,GACjDrvB,EAAOJ,EAAM8kD,GACjB,GAAK1kD,EAGL,IAFA,IAAI4kD,EAAmBnC,EAAe,GAAKziD,EAAKqvB,GAEvCnyB,EAAI,EAAGA,EAAIo/C,EAASh7C,OAAQpE,IAAK,CACzC,IAAIsnD,GAAOtnD,EAAIonD,EAAc,GAAKhI,EAASh7C,OACvC0jD,EAAMT,EAAyBC,GAEnC,GAAIQ,GAAOA,IAAQJ,EAGlB,OAFAtI,EAASkI,GAAKngD,aACdkgD,EAAyBC,GAAO,SAMnCjoD,EAAK2jD,cAAgB,SAAUjN,EAAS8N,GACvCxG,EAAK+B,SAASrJ,GAASkP,WAAapB,GAGrCxkD,EAAK0jD,UAAY,SAAUhN,EAASt0C,GACnCkiD,EAASliD,GAGVpC,EAAK4jD,OAAS,SAAUlN,EAASjzC,EAAM41C,EAAU9T,GAChD,IAAIzS,EAAKg1B,EAAQrkD,GACjB,GAAKJ,EAAMyvB,GACX,OAAIyS,EACIwY,OAAO9gC,YAAW,WACxBirC,EAAYxR,EAAS5jB,KACX,IAARyS,QAGH2iB,EAAYxR,EAAS5jB,IAGvB9yB,EAAK6jD,QAAU,SAAUnN,EAASjzC,EAAM8hC,GACvC,IAAIzS,EAAKg1B,EAAQrkD,GACjB,GAAKJ,EAAMyvB,GACX,OAAIyS,EACItoB,YAAW,WACjBurC,EAAY9R,EAAS5jB,KACX,IAARyS,QAGHijB,EAAY9R,EAAS5jB,IAGvB9yB,EAAK8jD,QAAU,SAAUpN,EAAS+N,EAAOpL,EAAU9T,GAClD,IAAK,IAAImjB,EAAM,EAAGA,EAAMjE,EAAM1/C,OAAQ2jD,IAAO,CAC5C,IAAItmD,EAAIqiD,EAAMiE,GACV51B,EAAKg1B,EAAQ1lD,GACjB,GAAKiB,EAAMyvB,GAAX,CACA,GAAIyS,EACH,OAAOwY,OAAO9gC,YAAW,WACxBirC,EAAYxR,EAAS5jB,KACX,IAARyS,GAGH2iB,EAAYxR,EAAS5jB,MAIxB9yB,EAAK+jD,SAAW,SAAUrN,EAAS+N,EAAOlf,GACzC,IAAK,IAAImjB,EAAM,EAAGA,EAAMjE,EAAM1/C,OAAQ2jD,IAAO,CAC5C,IAAItmD,EAAIqiD,EAAMiE,GACV51B,EAAKg1B,EAAQ1lD,GACjB,GAAKiB,EAAMyvB,GAAX,CACA,GAAIyS,EACH,OAAOwY,OAAO9gC,YAAW,WACxBurC,EAAY9R,EAAS5jB,KACX,IAARyS,GAGHijB,EAAY9R,EAAS5jB,MAIxB9yB,EAAKgkD,aAAe,WACnB,IAAK,IAAIiE,EAAM,EAAGljD,EAASg7C,EAASh7C,OAAQkjD,EAAMljD,EAAQkjD,IACzDlI,EAASkI,GAAKngD,SAGhB9H,EAAK2kD,QAAU,SAAUC,GAExB,IAAK,IAAI1iD,KADTyB,QAAQ8B,IAAI,oBAAqBm/C,GACjB5G,EAAK0I,UACpBoB,EAAQ9J,EAAK0I,UAAUxkD,IAAQA,EAC/BmB,EAAMnB,GAAO,CACZ4wB,GAAI5wB,GAGNshD,EAAUxjD,GAEN4kD,EAAKpuB,UAAUouB,EAAKpuB,YA/H1B,GA0IDwnB,EAAKgI,YAAe,SAAU2C,GAC7B,IAAIC,EAAQ,SAAUC,GACrB,OAAOA,EAAEjxC,QAAQ,eAAgB,IAAIA,QAAQ,OAAQ,KAAKmzB,eAEvD2c,EAAM,CACTzB,OAAQ,GACRmC,KAAM,GACNU,WAAY,IAEb,IAAK,IAAI5mD,KAAOymD,EAEf,IADA,IAAII,EAAOJ,EAAIzmD,GACNE,EAAI,EAAG2C,EAASgkD,EAAKhkD,OAAQ3C,EAAI2C,EAAQ3C,IAAK,CACtD,IAAIwjD,EAAamD,EAAK3mD,GACtB,GAAKwjD,EAAL,CACA,IAAIoD,EAAM12C,SAASszC,EAAWqD,OAAO,EAAGrD,EAAWr2B,QAAQ,MAAO,IAClEq2B,EAAaA,EAAWhuC,QAAQoxC,EAAM,IAAK,IAC3CtB,EAAIU,OAAOY,GACXtB,EAAIzB,OAAO2C,EAAMhD,IACjB8B,EAAIoB,WAAWF,EAAM1mD,IAAQ,CAC5B4wB,GAAI81B,EAAMhD,GACVA,WAAYA,EACZ5/B,OAAQgjC,EACRE,SAAUhnD,IAIb,OAAOwlD,EA1BY,CA2BjB,CACFyB,MAAO,CAAC,yBAA0B,0BAA2B,yBAA0B,qBAAsB,qBAAsB,qBAAsB,gBAAiB,cAC1K,uBAAwB,CAAC,YAAa,kBAAmB,eAAgB,gBAAiB,aAAc,eAAgB,mBAAoB,eAC5IC,MAAO,CAAC,mBAAoB,sBAAuB,gBAAiB,kBAAmB,gBAAiB,eAAgB,eAAgB,sBACxIC,OAAQ,CAAC,6BAA8B,6BAA8B,4BAA6B,6BAA8B,6BAA8B,uBAAwB,uBAAwB,uBAC9MC,KAAM,CAAC,mBAAoB,4BAA6B,0BAA2B,mBAAoB,iBAAkB,iBAAkB,kBAAmB,mBAC9JC,QAAS,CAAC,YAAa,WAAY,WAAY,gBAAiB,qBAAsB,uBAAwB,qBAAsB,cACpIC,SAAU,CAAC,uBAAwB,uBAAwB,qBAAsB,qBAAsB,gBAAiB,gBAAiB,iBAAkB,oBAC3JC,MAAO,CAAC,aAAc,cAAe,UAAW,mBAAoB,iBAAkB,mBAAoB,mBAAoB,oBAC9HC,KAAM,CAAC,iBAAkB,cAAe,eAAgB,kBAAmB,UAAW,kBAAmB,aAAc,eACvHC,KAAM,CAAC,aAAc,WAAY,cAAe,eAAgB,kBAAmB,gBAAiB,aAAc,cAClH,aAAc,CAAC,qBAAsB,uBAAwB,uBAAwB,oBAAqB,sBAAuB,oBAAqB,qBAAsB,2BAC5K,YAAa,CAAC,qBAAsB,kBAAmB,uBAAwB,mBAAoB,mBAAoB,sBAAuB,kBAAmB,oBACjK,gBAAiB,CAAC,iBAAkB,uBAAwB,oBAAqB,wBAAyB,wBAAyB,qBAAsB,oBAAqB,qBAC9KC,OAAQ,CAAC,YAAa,YAAa,eAAgB,WAAY,cAAe,cAAe,aAAc,cAC3GC,WAAY,CAAC,kBAAmB,YAAa,kBAAmB,gBAAiB,iBAAkB,kBAAmB,kBACtH,gBAAiB,CAAC,qBAAsB,wBAAyB,mBAAoB,eAAgB,iBAAkB,qBAAsB,iBAAkB,eAAgB,iBAIhL7L,EAAK+B,SAAY,WAEhB,IADA,IAAIA,EAAW,GACN39C,EAAI,EAAGA,EAAI,GAAIA,IACvB29C,EAAS39C,GAAK,CACbwjD,WAAY,EAEZkE,MAAM,EACNC,MAAM,EACNC,MAAM,EACNC,MAAM,GAGR,OAAOlK,EAZS,GAgBjB/B,EAAKkM,eAAiB,GAGtBlM,EAAK0I,UAAY,GACjB1I,EAAKmM,UAAY,GAEjB,WAIC,IAHA,IAAIC,EAAK,GACLC,EAAK,IACLC,EAAa,CAAC,IAAK,KAAM,IAAK,KAAM,IAAK,IAAK,KAAM,IAAK,KAAM,IAAK,KAAM,KACrEloD,EAAIgoD,EAAIhoD,GAAKioD,EAAIjoD,IAAK,CAC9B,IAAImoD,GAAUnoD,EAAI,IAAM,IAAM,EAC1BlB,EAAOopD,EAAWloD,EAAI,IAAMmoD,EAChCvM,EAAK0I,UAAUxlD,GAAQkB,EACvB47C,EAAKmM,UAAU/nD,GAAKlB,GARtB,GAce88C,QCxgBf,MAAMwM,EAAW,GACjB,IAAI7C,EAAU,EACd,MAAM8C,EAAiB,SAAU5O,GAChC8L,IACA,MAAMW,EAAQ,IAAIlD,MACZsF,EAAO7O,EAAI3lC,MAAM,KAAK,GAC5BoyC,EAAMx1B,GAAK,QACXw1B,EAAMqC,aAAa,UAAW,QAC9BrC,EAAMqC,aAAa,eAAe,GAClCrC,EAAMsC,iBAAiB,SAAS,WAC/BJ,EAASE,IAAQ,EACjB/C,OACE,GACHW,EAAMsC,iBAAiB,kBAAkB,WACxCJ,EAASE,IAAQ,EACjB/C,OACE,GACHW,EAAMzM,IAAM,QAAUA,EACtBpB,SAASoQ,KAAKC,YAAYxC,IAKZ,SAASyC,EAAav0B,GAEpC,GAAuB,qBAAX4uB,MAAwB,OAAO5uB,EAAS,IAEpD,MAAM8xB,EAAQ,IAAIlD,MAClB,GAAmC,qBAAvBkD,EAAM0C,YAA8B,OAAOx0B,EAASg0B,GAEhE,IAAIS,EAAS3C,EAAM0C,YAAY,8BAC/BC,EAAqB,aAAXA,GAAoC,UAAXA,EACnC,IAAIC,EAAO5C,EAAM0C,YAAY,cAG7B,GAFAE,EAAiB,aAATA,GAAgC,UAATA,GAE1BD,IAAWC,EAEf,YADA10B,EAASg0B,GAINS,GAAQR,EAAe,6mGACvBS,GAAMT,EAAe,sTAEzB,MAAMhjD,GAAQ,IAAImT,MAAQuwC,UACpBloD,EAAW86C,OAAOqN,aAAY,WACnC,MAAMtkD,GAAO,IAAI8T,MAAQuwC,UACnBE,EAAevkD,EAAMW,EAAO,IAC7BkgD,IAAW0D,IACftN,OAAOuN,cAAcroD,GACrBuzB,EAASg0B,MAER,GCxDJ,MAAMe,EAAS,WAGd,OAFAhrD,KAAKirD,OAAS,GACdjrD,KAAKkrD,QAAU,GACRlrD,MAIRgrD,EAAOhpD,UAAUmhB,IAAM,SAAUgoC,GAChC,MAAMC,EAAOprD,KACW,kBAAZmrD,IACXA,EAAS,CAAE7P,IAAK6P,IAEjB,IAAIE,EAAOF,EAAOE,KACI,qBAAVA,IACXA,EAAO,CAAC,CACP/P,IAAK6P,EAAO7P,IACZgQ,OAAQH,EAAOG,UAIjB,MAAMC,EAAMrR,SAASgB,qBAAqB,QAAQ,GAE5CsQ,EAAc,SAAUC,EAASlzC,GAClC6yC,EAAKH,OAAOQ,EAAQnQ,MACpB/iC,GAAkC,qBAAlBilC,OAAOjlC,KAC3B6yC,EAAKH,OAAOQ,EAAQnQ,MAAO,EAEvB8P,EAAKF,QAAQO,EAAQnQ,MAAM8P,EAAKF,QAAQO,EAAQnQ,cAC7C8P,EAAKF,QAAQO,EAAQnQ,KAExBmQ,EAAQx1B,UAAUw1B,EAAQx1B,WACL,qBAAby1B,SAA0BA,YAGjCC,EAAY,GACZC,EAAa,SAAUH,GAO5B,GANyB,kBAAbA,IACXA,EAAU,CACTnQ,IAAKmQ,EACLH,OAAQH,EAAOG,SAGb,aAAa/yC,KAAKkzC,EAAQH,QAE7B,GADAG,EAAQlzC,KAAOkzC,EAAQH,OACO,kBAAlBG,EAAQlzC,KACnB,IAAK,MAAM5W,KAAO8pD,EAAQlzC,KACzBozC,EAAUtnD,KAAKonD,EAAQlzC,KAAK5W,SAG7BgqD,EAAUtnD,KAAKonD,EAAQlzC,MAEzB,GAAI6yC,EAAKH,OAAOQ,EAAQnQ,KAAM,OAC9B,MAAMuQ,EAAS3R,SAAS4R,cAAc,UACtCD,EAAOE,mBAAqB,WACH,WAApB/rD,KAAKq7C,YAA+C,aAApBr7C,KAAKq7C,YACzCmQ,EAAYC,IAEbI,EAAOG,OAAS,WACfR,EAAYC,IAEbI,EAAOI,QAAU,aAEjBJ,EAAOzB,aAAa,OAAQ,mBAC5ByB,EAAOzB,aAAa,MAAOqB,EAAQnQ,KACnCiQ,EAAIhB,YAAYsB,GAChBT,EAAKF,QAAQO,EAAQnQ,KAAO,cAGvB4Q,EAAS,SAAUT,GACxB,GAAIA,EACHD,EAAYC,EAASA,EAAQlzC,WAE7B,IAAK,IAAI1W,EAAI,EAAGA,EAAIwpD,EAAK7mD,OAAQ3C,IAChC2pD,EAAYH,EAAKxpD,GAAIwpD,EAAKxpD,GAAG0W,MAE/B,IAAI4zC,GAAS,EACb,IAAK,IAAItqD,EAAI,EAAGA,EAAI8pD,EAAUnnD,OAAQ3C,IAAK,CAC1C,IAAI0W,EAAOozC,EAAU9pD,GACrB,GAAI0W,IAA+B,IAAvBA,EAAKyW,QAAQ,KAAa,CACrCzW,EAAOA,EAAK5C,MAAM,KAClB,MAAMy2C,EAAS5O,OAAOjlC,EAAK,IAC3B,GAAwB,qBAAZ6zC,EAAyB,SACjB,IAAhB7zC,EAAK/T,OACyB,qBAArB4nD,EAAO7zC,EAAK,MACvB4zC,GAAS,GAEc,IAAhB5zC,EAAK/T,QAC6B,qBAA9B4nD,EAAO7zC,EAAK,IAAIA,EAAK,MAChC4zC,GAAS,OAImB,qBAAlB3O,OAAOjlC,KAClB4zC,GAAS,IAGPhB,EAAOkB,aAAeF,EACtBhB,EAAOl1B,UAAUk1B,EAAOl1B,WAG5BvZ,YAAW,WACVwvC,EAAOT,KACL,KAIL,GAAIN,EAAOkB,YAAa,CACvB,IAAIC,GAAM,EACV,MAAMZ,EAAU,WAEf,GADAY,IACKjB,EAAKiB,GAGL,CACJ,MAAMb,EAAUJ,EAAKiB,GACfhR,EAAMmQ,EAAQnQ,IAChB8P,EAAKF,QAAQ5P,GAChB8P,EAAKF,QAAQ5P,GAAO,WACfmQ,EAAQx1B,UAAUw1B,EAAQx1B,WAC9By1B,KAGQN,EAAKH,OAAO3P,GAKrBoQ,KAJAE,EAAWH,GACXS,EAAOT,SAbJN,EAAOl1B,UAAUk1B,EAAOl1B,YAoB9By1B,QAEI,CACJ,IAAK,IAAIY,EAAK,EAAGA,EAAKjB,EAAK7mD,OAAQ8nD,IAClCV,EAAWP,EAAKiB,IAEjBJ,MAMF,MAAML,EAAS,IAAIb,EACJa,QC7IA,SAASU,EAAalI,GACpCmI,MAAMnI,EAAKuB,IAAKvB,EAAKl9C,MAAMo9C,KAAKkI,GAAOA,EAAI5U,QAAQ0M,KAAKp9C,IAEnDk9C,EAAK2H,QACR3H,EAAK2H,OAAO,CAAEU,aAAcvlD,MAC3BwlD,MAAM95C,IACRzP,QAAQ8zC,KAAK,+BAAgCrkC,GAEzCwxC,EAAK4H,SACR5H,EAAK4H,QAAQp5C,GAAG,KCGnB,MAAM+5C,EAAY,CAAEf,SAAQU,eAI5B9O,EAAKoI,UAAYrI,OAAOC,MAAQD,OAAOC,KAAKoI,WAAa,GAIzDrI,OAAOC,KAAOA,EAGdA,EAAK+M,YAAcA,EAGnB,MAAMqC,GAAe,EAEfzI,EAAU,GAGhB3G,EAAKqH,WAAa,SAAUT,EAAO,IACZ,oBAAVA,IACXA,EAAO,CACNpuB,SAAUouB,IAIZ,IAAIyI,EAAczI,EAAKyI,aAAezI,EAAKgB,YAAc,uBAC5B,kBAAjByH,IACXA,EAAc,CAAEA,IAEjB,IAAK,IAAIjrD,EAAI,EAAGA,EAAIirD,EAAYtoD,OAAQ3C,IAAK,CAC5C,IAAIwjD,EAAayH,EAAYjrD,GACD,kBAAhBwjD,IACXyH,EAAYjrD,GAAK47C,EAAKgI,YAAYoC,KAAKxC,IAoCzC,GAjCA5H,EAAKsP,aAAe1I,EAAK0I,cAAgBtP,EAAKsP,cAAgB,eAE9DtP,EAAK+M,aAAY,SAAU73C,GAC1B,IAAIuwC,EAAM,GAgBV,GAbCA,EADG8J,EAAK3I,EAAKnB,KACPmB,EAAKnB,IACH2J,GAAgBhoD,UAAUy/C,kBAC5B,UACE9G,OAAOoH,oBAAsBpH,OAAOmH,aACtC,WAEEnH,OAAOqH,MACT,WAGA,SAGFT,EAAQlB,GAAM,OAEnB,IAAI+J,EAEHA,EADG5I,EAAK6I,aACG7I,EAAK6I,aAELv6C,EAAM,aAAe,MAAQ,MAGzC8qC,EAAK0P,KAAOjK,EACZzF,EAAKwM,SAAWt3C,EAChByxC,EAAQlB,GAAK+J,EAAUH,EAAazI,OAGhCA,EAAKpuB,SACT,OAAO,IAAI5wB,QAAQC,GAAW++C,EAAKpuB,SAAW3wB,IAKhD8+C,EAAQgJ,QAAU,SAAUH,EAAUH,EAAazI,GAC9C5G,EAAKwI,QAAQxI,EAAKwI,OAAO1rB,QAAQ,mBACrCkjB,EAAKqG,QAAQM,QAAQC,IAGtBD,EAAQiJ,MAAQ,SAAUJ,EAAUH,EAAazI,GAE5C5G,EAAKwI,QAAQxI,EAAKwI,OAAO1rB,QAAQ,gBACrCqyB,EAAUf,OAAO1oC,IAAI,CACpBm4B,IAAK+I,EAAKiJ,iBAAmB,8CAC7BhC,OAAQ,eACRr1B,SAAU,WACTwnB,EAAK8P,MAAMnJ,QAAQ0I,EAAazI,OAKnCD,EAAQoJ,SAAW,SAAUP,EAAUH,EAAazI,GAC/C5G,EAAKwI,QACRxI,EAAKwI,OAAO1rB,QAAQ,sBAErB,MAAMkzB,EAAQC,EAAY,CACzBC,MAAOb,EACPpB,QAAS/F,GACJlI,EAAKoI,UAAUF,GAClB8H,EAAM/B,UAENkB,EAAUL,YAAY,CACrB3G,IAAKnI,EAAKsP,aAAepH,EAAe,IAAMsH,EAAW,MACzDW,WAAYC,EACZ7B,OAAQ8B,GACPC,EAAaD,EAASpB,cAClBjP,EAAKwI,QACRxI,EAAKwI,OAAOlc,OAAO,KAAM,cAAe,KACzC0jB,EAAM/B,cAIVsC,aACCvQ,EAAK6J,SAASlD,QAAQC,OAKzBD,EAAQ6J,SAAW,SAAUhB,EAAUH,EAAazI,GAC/C5G,EAAKwI,QACRxI,EAAKwI,OAAO1rB,QAAQ,oBAErB,MAAMkzB,EAAQC,EAAY,CACzBC,MAAOb,EACPpB,QAAS/F,GACJlI,EAAKoI,UAAUF,GAClB8H,EAAM/B,WAIPjO,EAAKsH,SAASC,mBAAmB8H,IAAe,EAEhDF,EAAUL,YAAY,CACrB3G,IAAKnI,EAAKsP,aAAepH,EAAe,IAAMsH,EAAW,MACzDW,WAAYC,EACZ7B,OAAQ8B,GACPC,EAAaD,EAASpB,cAClBjP,EAAKwI,QACRxI,EAAKwI,OAAOlc,OAAO,KAAM,iBAAkB,KAC5C0jB,EAAM/B,iBAECjO,EAAKsH,SAASC,mBAAmB8H,IAEzCb,QAAS7R,GACJqD,EAAKwI,QACRxI,EAAKwI,OAAOlc,OAAOqQ,EAAK,2BAElBqD,EAAKsH,SAASC,mBAAmB8H,QAI3CkB,aAECvQ,EAAKsH,SAASX,QAAQC,OAOzB,MAAM2I,EAAO,CACZI,SAAS,EACTa,UAAU,EACVT,UAAU,EACVH,OAAO,GAGFU,EAAe,SAAUlW,GAC9B,IAAIgU,EAAS3R,SAAS4R,cAAc,UACpCD,EAAOqC,SAAW,aAClBrC,EAAOzkD,KAAO,kBACdykD,EAAOhU,KAAOA,EACdqC,SAASoQ,KAAKC,YAAYsB,IAGrBgC,EAAa,SAAU5mD,GACvBjH,KAAKmuD,YACLnuD,KAAKouD,kBAAkB,sBAC1BpuD,KAAKmuD,UAAYp8C,SAAS/R,KAAKouD,kBAAkB,uBAEjDpuD,KAAKmuD,UAAYlnD,EAAMonD,OAGzB,MAAMC,EAAUtuD,KAAKmuD,UAAYxrD,KAAKstC,MAAMhpC,EAAMgkD,OAASjrD,KAAKmuD,UAAY,KAAO,GAC/E1Q,EAAKwI,QACRxI,EAAKwI,OAAOlc,OAAO,KAAM,iBAAkBukB,IAGvCZ,EAAc,SAAUrJ,GAC7B,MAAMtkD,EAAO,CACbA,MAAa,IACb,IAAK,MAAM4B,KAAO0iD,EAAKsJ,MAClBtJ,EAAKsJ,MAAM1rD,eAAeN,IAC7B5B,EAAK0tD,MAAMppD,KAAKggD,EAAKsJ,MAAMhsD,IAQ7B,OANA5B,EAAK2rD,QAAU,WACd,IAAK3rD,EAAK0tD,MAAMjpD,OACf,OAAO6/C,EAAK2J,aACb3J,EAAKqH,QAAQ3rD,EAAK0tD,MAAMc,UAEzB7xC,WAAW3c,EAAK2rD,QAAS,GAClB3rD,GAKO09C,EAAf,WAAeA,ICzNAA,I","file":"musicWidgetsBrowser.umd.min.js","sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"musicWidgetsBrowser\"] = factory();\n\telse\n\t\troot[\"musicWidgetsBrowser\"] = factory();\n})((typeof self !== 'undefined' ? self : this), function() {\nreturn "," \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\n \t\t}\n \t};\n\n \t// define __esModule on exports\n \t__webpack_require__.r = function(exports) {\n \t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n \t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n \t\t}\n \t\tObject.defineProperty(exports, '__esModule', { value: true });\n \t};\n\n \t// create a fake namespace object\n \t// mode & 1: value is a module id, require it\n \t// mode & 2: merge all properties of value into the ns\n \t// mode & 4: return value when already ns object\n \t// mode & 8|1: behave like require\n \t__webpack_require__.t = function(value, mode) {\n \t\tif(mode & 1) value = __webpack_require__(value);\n \t\tif(mode & 8) return value;\n \t\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\n \t\tvar ns = Object.create(null);\n \t\t__webpack_require__.r(ns);\n \t\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\n \t\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\n \t\treturn ns;\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"\";\n\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = \"fae3\");\n","\nconst Node = require(\"./node.js\");\nconst Navigator = require(\"./navigator.js\");\n\n\n\nconst HEART_BEAT = 800;\t// in ms\nconst SIMULTANEOUS_INTERVAL = HEART_BEAT * 0.24;\n\n\nconst normalizeInterval = interval => Math.tanh(interval / SIMULTANEOUS_INTERVAL);\n\n\n// greater softIndexFactor make 'harder' soft index\nconst makeNoteSoftIndex = function (notes, index, {softIndexFactor = 1} = {}) {\n\tindex = Number(index);\n\n\tconst note = notes[index];\n\n\t// make soft index\n\tif (index > 0) {\n\t\tconst lastNote = notes[index - 1];\n\n\t\tconsole.assert(note.start != null, \"note.start is null\", note);\n\t\tconsole.assert(lastNote.start != null, \"lastNote.start is null\", lastNote);\n\n\t\tnote.deltaSi = normalizeInterval((note.start - lastNote.start) * softIndexFactor);\n\t\tnote.softIndex = lastNote.softIndex + note.deltaSi;\n\n\t\tconsole.assert(!Number.isNaN(note.deltaSi), \"note.deltaSi is NaN.\", note.start, lastNote.start);\n\t}\n\telse {\n\t\tnote.softIndex = 0;\n\t\tnote.deltaSi = 0;\n\t}\n};\n\n\nconst makeMatchNodes = function (note, criterion, zeroNode = Node.zero()) {\n\tnote.matches = [];\n\n\tconst targetList = criterion.pitchMap[note.pitch];\n\tif (targetList) {\n\t\tfor (const targetNote of targetList) {\n\t\t\tconst node = new Node(note, targetNote);\n\t\t\tif (zeroNode)\n\t\t\t\tnode.evaluatePrev(zeroNode);\n\n\t\t\tnote.matches.push(node);\n\t\t}\n\t}\n};\n\n\nconst genNotationContext = function (notation, {softIndexFactor = 1} = {}) {\n\tfor (let i = 0; i < notation.notes.length; ++i)\n\t\tmakeNoteSoftIndex(notation.notes, i, {softIndexFactor});\n};\n\n\nconst runNavigation = async function(criterion, sample, onStep) {\n\tconst navigator = new Navigator(criterion, sample);\n\tnavigator.resetCursor(-1);\n\n\tfor (let i = 0; i < sample.notes.length; ++i) {\n\t\tnavigator.step(i);\n\n\t\tconst next = await (onStep && onStep(i, navigator));\n\t\tif (next === Symbol.for(\"end\")) {\n\t\t\tconsole.log(\"Navigation interrupted.\");\n\n\t\t\treturn;\n\t\t}\n\t}\n\n\t//console.log(\"Navigation accomplished.\");\n\n\treturn navigator;\n};\n\n\n\nmodule.exports = {\n\tnormalizeInterval,\n\tmakeNoteSoftIndex,\n\tmakeMatchNodes,\n\tgenNotationContext,\n\trunNavigation,\n\tNavigator,\n\tNode,\n};\n","\nconst { Notation } = require(\"./MusicNotation.js\");\n\n\n\n//const msDelay = ms => new Promise(resolve => setTimeout(resolve, ms));\nconst animationDelay = () => new Promise(resolve => requestAnimationFrame(resolve));\n\n\nclass MidiPlayer {\n\tconstructor (midiData, {cacheSpan = 600, onMidi, onPlayFinish, onTurnCursor} = {}) {\n\t\tthis.cacheSpan = cacheSpan;\n\t\tthis.onMidi = onMidi;\n\t\tthis.onPlayFinish = onPlayFinish;\n\t\tthis.onTurnCursor = onTurnCursor;\n\n\t\tlet notation;\n\t\tif (midiData.notes && Number.isFinite(midiData.endTime))\n\t\t\tnotation = midiData;\n\t\telse\n\t\t\tnotation = Notation.parseMidi(midiData);\n\n\t\tthis.notation = notation;\n\t\tthis.events = notation.events;\n\t\t//console.log(\"events:\", this.events);\n\n\t\tthis.isPlaying = false;\n\t\tthis.progressTime = 0;\n\t\tthis.startTime = performance.now();\n\t\tthis.duration = notation.endTime;\n\t\tthis.cursorTurnDelta = 0;\n\n\t\tconsole.assert(notation.tempos && notation.tempos.length, \"[MidiPlayer] invalid notation, tempos is empty.\");\n\t}\n\n\n\tdispose () {\n\t\tthis.isPlaying = false;\n\t\tthis.progressTime = 0;\n\t}\n\n\n\tget progressTicks () {\n\t\treturn this.notation.timeToTicks(this.progressTime);\n\t}\n\n\n\tset progressTicks (value) {\n\t\tthis.progressTime = this.notation.ticksToTime(value);\n\n\t\tif (this.onTurnCursor)\n\t\t\tthis.onTurnCursor(this.progressTime);\n\t}\n\n\n\tasync play ({nextFrame = animationDelay} = {}) {\n\t\tif (this.progressTime >= this.duration)\n\t\t\tthis.progressTime = 0;\n\n\t\tlet now = performance.now();\n\t\tthis.startTime = now - this.progressTime;\n\n\t\tthis.isPlaying = true;\n\n\t\tlet currentEventIndex = this.events.findIndex(event => event.time >= now - this.startTime);\n\n\t\twhile (this.isPlaying) {\n\t\t\tfor (; currentEventIndex < this.events.length; ++currentEventIndex) {\n\t\t\t\tconst event = this.events[currentEventIndex];\n\t\t\t\t//console.log(\"play event:\", currentEventIndex, event.time, this.progressTime + this.cacheSpan);\n\t\t\t\tif (!event || event.time > this.progressTime + this.cacheSpan)\n\t\t\t\t\tbreak;\n\n\t\t\t\tif (event.data.type === \"channel\" && this.startTime + event.time >= now)\n\t\t\t\t\tif (this.onMidi)\n\t\t\t\t\t\tthis.onMidi(event.data, this.startTime + event.time);\n\t\t\t}\n\n\t\t\tawait nextFrame();\n\n\t\t\tif (!this.isPlaying)\n\t\t\t\tbreak;\n\n\t\t\tif (this.cursorTurnDelta !== 0) {\n\t\t\t\tconst backturn = this.cursorTurnDelta < 0;\n\n\t\t\t\tthis.startTime -= this.cursorTurnDelta;\n\t\t\t\tthis.cursorTurnDelta = 0;\n\n\t\t\t\tif (backturn) {\n\t\t\t\t\tfor (; currentEventIndex > 0; --currentEventIndex) {\n\t\t\t\t\t\tconst eventTime = this.events[currentEventIndex].time;\n\t\t\t\t\t\tif (this.startTime + eventTime < now)\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tnow = performance.now();\n\n\t\t\tthis.progressTime = now - this.startTime;\n\n\t\t\tif (this.progressTime > this.duration) {\n\t\t\t\tthis.isPlaying = false;\n\n\t\t\t\tif (this.onPlayFinish)\n\t\t\t\t\tthis.onPlayFinish();\n\t\t\t}\n\t\t}\n\t}\n\n\n\tpause () {\n\t\tthis.isPlaying = false;\n\t}\n\n\n\tturnCursor (time) {\n\t\t//console.log(\"onTurnCursor:\", time, oldTime);\n\t\tif (this.isPlaying)\n\t\t\tthis.cursorTurnDelta += time - this.progressTime;\n\t\telse\n\t\t\tthis.progressTime = time;\n\n\t\tif (this.onTurnCursor)\n\t\t\tthis.onTurnCursor(time);\n\t}\n};\n\n\n\nmodule.exports = MidiPlayer;\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': '