{"version":3,"sources":["webpack:///./src/assets/img/svg/civil.svg","webpack:///./src/assets/img/svg/articles.svg","webpack:///./src/assets/img/svg/white_icon.svg","webpack:///./src/assets/img/svg/compliance.svg","webpack:///./src/components/Svg/LogoIcon.vue?33b7","webpack:///src/components/Svg/LogoIcon.vue","webpack:///./src/components/Svg/LogoIcon.vue?da2c","webpack:///./src/components/Svg/LogoIcon.vue","webpack:///./src/assets/img/svg/whatsapp.svg","webpack:///./src/assets/img/svg/news.svg","webpack:///./src/assets/img/svg/diversidade.svg","webpack:///./src/assets/img/svg/tributario.svg","webpack:///./src/assets/img/svg/white_icon_outlined.svg","webpack:///./src/assets/img/svg/banner_home.svg","webpack:///./src/assets/img/svg/expertise_area_logo.svg","webpack:///./src/assets/img/svg/logo.svg","webpack:///./src/assets/img/phone_blue.png","webpack:///./node_modules/lodash/lodash.js","webpack:///./src/assets/img/svg/bg_app_small.svg","webpack:///./src/assets/img/svg/facebook.svg","webpack:///./src/components/Svg/CalendarIcon.vue?60dd","webpack:///src/components/Svg/CalendarIcon.vue","webpack:///./src/components/Svg/CalendarIcon.vue?90b5","webpack:///./src/components/Svg/CalendarIcon.vue","webpack:///./src/assets/img/svg/map.svg","webpack:///./src/assets/img/svg/icon.svg","webpack:///./src/assets/img/svg/icon_base.svg","webpack:///./src/assets/img/svg/seniors.svg","webpack:///./src/assets/img/svg/family.svg","webpack:///./src/components/ContactInfo.vue?7632","webpack:///src/components/ContactInfo.vue","webpack:///./src/components/ContactInfo.vue?1a40","webpack:///./src/components/ContactInfo.vue","webpack:///./src/assets/img/svg/youtube.svg","webpack:///./src/assets/img/svg sync ^\\.\\/.*\\.svg$","webpack:///./src/assets/img/svg/close.svg","webpack:///./src/components/Home/ExpertiseArea.vue?9c56","webpack:///./src/components/Bullets.vue?2cb6","webpack:///src/components/Bullets.vue","webpack:///./src/components/Bullets.vue?4d3e","webpack:///./src/components/Bullets.vue","webpack:///src/components/Home/ExpertiseArea.vue","webpack:///./src/components/Home/ExpertiseArea.vue?ea2b","webpack:///./src/components/Home/ExpertiseArea.vue","webpack:///(webpack)/buildin/module.js","webpack:///./src/components/Home/DownloadApp.vue?9aee","webpack:///src/components/Home/DownloadApp.vue","webpack:///./src/components/Home/DownloadApp.vue?7edd","webpack:///./src/components/Home/DownloadApp.vue","webpack:///./src/assets/img/svg/mouse.svg","webpack:///./src/assets/img/svg/blue_logo.svg","webpack:///./src/components/Svg/ClockIcon.vue?5e73","webpack:///./src/components/Svg/ClockIcon.vue","webpack:///./src/assets/img/svg/download_google_app.svg","webpack:///./src/assets/img/svg/most_read.svg","webpack:///./src/assets/img/svg/familia.svg","webpack:///./src/assets/img/svg/white_whatsapp.svg","webpack:///./src/assets/img/svg/arrow-left.svg","webpack:///./src/assets/img/svg/white_calendar.svg","webpack:///./src/assets/img/svg/outlined_icon.svg","webpack:///./src/assets/img/svg/brasil.svg.2020_08_12_22_43_13.0.svg","webpack:///./src/assets/img/svg/brasil.svg","webpack:///./src/assets/img/svg/white_family.svg","webpack:///./src/assets/img/svg/white_linkedin.svg","webpack:///./src/assets/img/svg/white_youtube.svg","webpack:///./src/assets/img/svg/white_medical.svg","webpack:///./src/assets/img/svg/white_facebook.svg","webpack:///./src/assets/img/svg/white_seniors.svg","webpack:///./src/components/Blog/PostCard.vue?8893","webpack:///src/components/Blog/PostCard.vue","webpack:///./src/components/Blog/PostCard.vue?34f6","webpack:///./src/components/Blog/PostCard.vue","webpack:///./src/assets/img/svg/mobile_qr_code.svg","webpack:///./src/assets/img/svg/dike_logo.svg","webpack:///./src/assets/img/svg/email.svg","webpack:///./src/components/Newsletter.vue?1425","webpack:///src/components/Newsletter.vue","webpack:///./src/components/Newsletter.vue?d5a5","webpack:///./src/components/Newsletter.vue","webpack:///./src/assets/img/svg/logo_icone_esquerda.svg","webpack:///./src/assets/img/svg/map_marker.svg","webpack:///./src/assets/img/svg/video.svg","webpack:///./src/views/Home.vue?8d4c","webpack:///./src/components/Home/Banner.vue?33f1","webpack:///src/components/Home/Banner.vue","webpack:///./src/components/Home/Banner.vue?af5a","webpack:///./src/components/Home/Banner.vue","webpack:///./src/components/Home/Posts.vue?c751","webpack:///./src/components/ScrollableContent.vue?fbbf","webpack:///src/components/ScrollableContent.vue","webpack:///./src/components/ScrollableContent.vue?a38d","webpack:///./src/components/ScrollableContent.vue","webpack:///src/components/Home/Posts.vue","webpack:///./src/components/Home/Posts.vue?6e02","webpack:///./src/components/Home/Posts.vue","webpack:///./src/components/Home/Story.vue?3703","webpack:///src/components/Home/Story.vue","webpack:///./src/components/Home/Story.vue?d976","webpack:///./src/components/Home/Story.vue","webpack:///./src/components/Home/Team.vue?cace","webpack:///src/components/Home/Team.vue","webpack:///./src/components/Home/Team.vue?a7dd","webpack:///./src/components/Home/Team.vue","webpack:///./src/components/Home/Contact.vue?b8e5","webpack:///src/components/Home/Contact.vue","webpack:///./src/components/Home/Contact.vue?0fcc","webpack:///./src/components/Home/Contact.vue","webpack:///src/views/Home.vue","webpack:///./src/views/Home.vue?493c","webpack:///./src/views/Home.vue","webpack:///./src/assets/img/svg/blue_whatsapp.svg","webpack:///./src/assets/img/svg/instagram.svg","webpack:///./src/assets/img/svg/menu.svg","webpack:///./src/components/Svg/VideoIcon.vue?625c","webpack:///src/components/Svg/VideoIcon.vue","webpack:///./src/components/Svg/VideoIcon.vue?b184","webpack:///./src/components/Svg/VideoIcon.vue","webpack:///./src/assets/img/svg/search.svg","webpack:///./src/assets/img/svg/medical.svg","webpack:///./src/assets/img/svg/download_apple_store.svg","webpack:///./src/assets/img/svg/white_workers.svg","webpack:///./src/assets/img/svg/bg_app.svg","webpack:///./src/assets/img/svg/workers.svg","webpack:///./src/assets/img/svg/societario.svg","webpack:///./src/assets/img/svg/linkedin.svg","webpack:///./src/assets/img/svg/white_civil.svg","webpack:///./src/assets/img/svg/chevron.svg","webpack:///./src/assets/img/svg/linkedin_square.svg","webpack:///./src/assets/img/svg/dike_logo.png","webpack:///./src/assets/img/svg/podcast.svg","webpack:///./src/components/Page/TopNavbar.vue?6923","webpack:///src/components/Page/TopNavbar.vue","webpack:///./src/components/Page/TopNavbar.vue?6458","webpack:///./src/components/Page/TopNavbar.vue","webpack:///./src/assets/img/svg/events.svg","webpack:///./src/assets/img/svg/logo_icon_left.svg","webpack:///./src/components/Menu.vue?fdec","webpack:///src/components/Menu.vue","webpack:///./src/components/Menu.vue?797a","webpack:///./src/components/Menu.vue"],"names":["module","exports","render","_vm","this","_h","$createElement","_c","_self","staticClass","class","active","attrs","staticRenderFns","component","undefined","VERSION","LARGE_ARRAY_SIZE","CORE_ERROR_TEXT","FUNC_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","reTrim","reTrimStart","reTrimEnd","reWrapComment","reWrapDetails","reSplitDetails","reAsciiWord","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","Object","freeSelf","self","root","Function","freeExports","nodeType","freeModule","moduleExports","freeProcess","process","nodeUtil","types","require","binding","e","nodeIsArrayBuffer","isArrayBuffer","nodeIsDate","isDate","nodeIsMap","isMap","nodeIsRegExp","isRegExp","nodeIsSet","isSet","nodeIsTypedArray","isTypedArray","apply","func","thisArg","args","length","call","arrayAggregator","array","setter","iteratee","accumulator","index","value","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","key","baseFindIndex","fromIndex","fromRight","strictIndexOf","baseIsNaN","baseIndexOfWith","baseMean","baseSum","object","basePropertyOf","baseReduce","baseSortBy","comparer","sort","current","baseTimes","n","baseToPairs","props","baseUnary","baseValues","cacheHas","cache","has","charsStartIndex","strSymbols","chrSymbols","charsEndIndex","countHolders","placeholder","deburrLetter","escapeHtmlChar","escapeStringChar","chr","getValue","hasUnicode","test","hasUnicodeWord","iteratorToArray","iterator","data","next","done","push","mapToArray","map","size","forEach","overArg","transform","arg","replaceHolders","setToArray","set","setToPairs","strictLastIndexOf","stringSize","unicodeSize","stringToArray","unicodeToArray","unescapeHtmlChar","lastIndex","unicodeWords","runInContext","context","_","defaults","pick","Date","Error","Math","String","TypeError","arrayProto","prototype","funcProto","objectProto","coreJsData","funcToString","toString","hasOwnProperty","idCounter","maskSrcKey","uid","exec","keys","IE_PROTO","nativeObjectToString","objectCtorString","oldDash","reIsNative","replace","Buffer","Symbol","Uint8Array","allocUnsafe","getPrototype","getPrototypeOf","objectCreate","create","propertyIsEnumerable","splice","spreadableSymbol","isConcatSpreadable","symIterator","symToStringTag","toStringTag","defineProperty","getNative","ctxClearTimeout","clearTimeout","ctxNow","now","ctxSetTimeout","setTimeout","nativeCeil","ceil","nativeFloor","floor","nativeGetSymbols","getOwnPropertySymbols","nativeIsBuffer","isBuffer","nativeIsFinite","isFinite","nativeJoin","nativeKeys","nativeMax","max","nativeMin","min","nativeNow","nativeParseInt","nativeRandom","random","nativeReverse","reverse","DataView","Map","Promise","Set","WeakMap","nativeCreate","metaMap","realNames","dataViewCtorString","toSource","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","symbolProto","symbolValueOf","valueOf","symbolToString","lodash","isObjectLike","isArray","LazyWrapper","LodashWrapper","wrapperClone","baseCreate","proto","isObject","baseLodash","chainAll","__wrapped__","__actions__","__chain__","__index__","__values__","__dir__","__filtered__","__iteratees__","__takeCount__","__views__","lazyClone","copyArray","lazyReverse","clone","lazyValue","dir","isArr","isRight","arrLength","view","getView","start","end","iteratees","iterLength","takeCount","baseWrapperValue","outer","iterIndex","type","computed","Hash","entries","clear","entry","hashClear","__data__","hashDelete","hashGet","hashHas","hashSet","ListCache","listCacheClear","listCacheDelete","assocIndexOf","pop","listCacheGet","listCacheHas","listCacheSet","MapCache","mapCacheClear","mapCacheDelete","getMapData","mapCacheGet","get","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","constructor","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","property","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","step","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","slice","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","charAt","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","name","message","convert","objProps","objLength","othProps","objStacked","skipCtor","objCtor","othCtor","flatten","otherFunc","isKeyable","isOwn","unmasked","stubArray","transforms","getWrapDetails","hasPath","hasFunc","input","insertWrapDetails","details","ArrayBuffer","resolve","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","findIndex","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","sample","sampleSize","shuffle","some","sortBy","after","before","bind","bindKey","curry","curryRight","debounce","options","lastArgs","lastThis","maxWait","timerId","lastCallTime","lastInvokeTime","leading","maxing","invokeFunc","time","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","isNaN","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","matches","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","isDark","_m","_v","webpackContext","req","webpackContextResolve","__webpack_require__","o","code","_s","title","_e","mobileVertical","small","style","_l","item","icon","params","slug","items","Number","mobileCurrentIndex","on","$event","i","select","webpackPolyfill","deprecate","children","enumerable","l","Boolean","script","isLarge","isSquareCover","post","author","posted_at","to","event_date","event_hour","text","buttonText","buttonTextOfType","components","hasButton","default","defaut","0","1","2","3","4","5","6","console","log","theme","ref","submitEmail","modalContactIsOpen","socials_networks","methods","areas","team","posts","modalAlertIsOpen","alert","menuOpen","isFixedNavbar","category","containerClass","_t","showMobile","move","preventDefault","PostCard","ScrollableContent","modalOpened","VideoIcon","member","image","staticStyle","Contact","DownloadApp","ExpertiseArea","HomeBanner","Newsletter","Team","Posts","Story","Modal","beforeCreate","document","documentElement","classList","beforeDestroy","isFixed","toggleMenu","bottom","$emit","$route"],"mappings":"qGAAAA,EAAOC,QAAU,IAA0B,0B,uBCA3CD,EAAOC,QAAU,IAA0B,6B,uBCA3CD,EAAOC,QAAU,IAA0B,+B,uBCA3CD,EAAOC,QAAU,IAA0B,+B,oCCA3C,IAAIC,EAAS,WAAa,IAAIC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,MAAM,CAACE,YAAY,YAAYC,MAAM,CAACC,OAAQR,EAAIQ,QAAQC,MAAM,CAAC,QAAU,wBAAwB,CAACL,EAAG,IAAI,CAACK,MAAM,CAAC,UAAY,mDAAmD,CAACL,EAAG,IAAI,CAACA,EAAG,OAAO,CAACE,YAAY,mBAAmBG,MAAM,CAAC,EAAI,wOAAwO,KAAO,OAAO,eAAe,KAAK,oBAAoB,QAAQL,EAAG,OAAO,CAACE,YAAY,mBAAmBG,MAAM,CAAC,EAAI,wOAAwO,KAAO,OAAO,eAAe,KAAK,oBAAoB,eACx8BC,EAAkB,GCWtB,GACE,MAAF,YCbiW,I,YCO7VC,EAAY,eACd,EACAZ,EACAW,GACA,EACA,KACA,KACA,MAIa,OAAAC,E,gCClBfd,EAAOC,QAAU,IAA0B,6B,qBCA3CD,EAAOC,QAAU,IAA0B,yB,qBCA3CD,EAAOC,QAAU,IAA0B,gC,qBCA3CD,EAAOC,QAAU,IAA0B,+B,uBCA3CD,EAAOC,QAAU,IAA0B,wC,uBCA3CD,EAAOC,QAAU,IAA0B,gC,uBCA3CD,EAAOC,QAAU,IAA0B,wC,uBCA3CD,EAAOC,QAAU,IAA0B,yB,qBCA3CD,EAAOC,QAAU,IAA0B,+B,wBCA3C;;;;;;;;IAQE,WAGA,IAAIc,EAGAC,EAAU,UAGVC,EAAmB,IAGnBC,EAAkB,kEAClBC,EAAkB,sBAGlBC,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,EAAY,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,GAAS,aACTC,GAAc,OACdC,GAAY,OAGZC,GAAgB,4CAChBC,GAAgB,oCAChBC,GAAiB,QAGjBC,GAAc,4CAGdC,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,GACxC4G,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,GAAa6G,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,EAAOC,SAAWA,QAAUD,EAGhFE,GAA0B,iBAARC,MAAoBA,MAAQA,KAAKF,SAAWA,QAAUE,KAGxEC,GAAOL,IAAcG,IAAYG,SAAS,cAATA,GAGjCC,GAA4C3L,IAAYA,EAAQ4L,UAAY5L,EAG5E6L,GAAaF,IAAgC,iBAAV5L,GAAsBA,IAAWA,EAAO6L,UAAY7L,EAGvF+L,GAAgBD,IAAcA,GAAW7L,UAAY2L,GAGrDI,GAAcD,IAAiBV,GAAWY,QAG1CC,GAAY,WACd,IAEE,IAAIC,EAAQL,IAAcA,GAAWM,SAAWN,GAAWM,QAAQ,QAAQD,MAE3E,OAAIA,GAKGH,IAAeA,GAAYK,SAAWL,GAAYK,QAAQ,QACjE,MAAOC,KAXI,GAeXC,GAAoBL,IAAYA,GAASM,cACzCC,GAAaP,IAAYA,GAASQ,OAClCC,GAAYT,IAAYA,GAASU,MACjCC,GAAeX,IAAYA,GAASY,SACpCC,GAAYb,IAAYA,GAASc,MACjCC,GAAmBf,IAAYA,GAASgB,aAc5C,SAASC,GAAMC,EAAMC,EAASC,GAC5B,OAAQA,EAAKC,QACX,KAAK,EAAG,OAAOH,EAAKI,KAAKH,GACzB,KAAK,EAAG,OAAOD,EAAKI,KAAKH,EAASC,EAAK,IACvC,KAAK,EAAG,OAAOF,EAAKI,KAAKH,EAASC,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAOF,EAAKI,KAAKH,EAASC,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAOF,EAAKD,MAAME,EAASC,GAa7B,SAASG,GAAgBC,EAAOC,EAAQC,EAAUC,GAChD,IAAIC,GAAS,EACTP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OAEvC,QAASO,EAAQP,EAAQ,CACvB,IAAIQ,EAAQL,EAAMI,GAClBH,EAAOE,EAAaE,EAAOH,EAASG,GAAQL,GAE9C,OAAOG,EAYT,SAASG,GAAUN,EAAOE,GACxB,IAAIE,GAAS,EACTP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OAEvC,QAASO,EAAQP,EACf,IAA6C,IAAzCK,EAASF,EAAMI,GAAQA,EAAOJ,GAChC,MAGJ,OAAOA,EAYT,SAASO,GAAeP,EAAOE,GAC7B,IAAIL,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OAEvC,MAAOA,IACL,IAA+C,IAA3CK,EAASF,EAAMH,GAASA,EAAQG,GAClC,MAGJ,OAAOA,EAaT,SAASQ,GAAWR,EAAOS,GACzB,IAAIL,GAAS,EACTP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OAEvC,QAASO,EAAQP,EACf,IAAKY,EAAUT,EAAMI,GAAQA,EAAOJ,GAClC,OAAO,EAGX,OAAO,EAYT,SAASU,GAAYV,EAAOS,GAC1B,IAAIL,GAAS,EACTP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACnCc,EAAW,EACXC,EAAS,GAEb,QAASR,EAAQP,EAAQ,CACvB,IAAIQ,EAAQL,EAAMI,GACdK,EAAUJ,EAAOD,EAAOJ,KAC1BY,EAAOD,KAAcN,GAGzB,OAAOO,EAYT,SAASC,GAAcb,EAAOK,GAC5B,IAAIR,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,QAASA,GAAUiB,GAAYd,EAAOK,EAAO,IAAM,EAYrD,SAASU,GAAkBf,EAAOK,EAAOW,GACvC,IAAIZ,GAAS,EACTP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OAEvC,QAASO,EAAQP,EACf,GAAImB,EAAWX,EAAOL,EAAMI,IAC1B,OAAO,EAGX,OAAO,EAYT,SAASa,GAASjB,EAAOE,GACvB,IAAIE,GAAS,EACTP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACnCe,EAASM,MAAMrB,GAEnB,QAASO,EAAQP,EACfe,EAAOR,GAASF,EAASF,EAAMI,GAAQA,EAAOJ,GAEhD,OAAOY,EAWT,SAASO,GAAUnB,EAAOoB,GACxB,IAAIhB,GAAS,EACTP,EAASuB,EAAOvB,OAChBwB,EAASrB,EAAMH,OAEnB,QAASO,EAAQP,EACfG,EAAMqB,EAASjB,GAASgB,EAAOhB,GAEjC,OAAOJ,EAeT,SAASsB,GAAYtB,EAAOE,EAAUC,EAAaoB,GACjD,IAAInB,GAAS,EACTP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OAEnC0B,GAAa1B,IACfM,EAAcH,IAAQI,IAExB,QAASA,EAAQP,EACfM,EAAcD,EAASC,EAAaH,EAAMI,GAAQA,EAAOJ,GAE3D,OAAOG,EAeT,SAASqB,GAAiBxB,EAAOE,EAAUC,EAAaoB,GACtD,IAAI1B,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACnC0B,GAAa1B,IACfM,EAAcH,IAAQH,IAExB,MAAOA,IACLM,EAAcD,EAASC,EAAaH,EAAMH,GAASA,EAAQG,GAE7D,OAAOG,EAaT,SAASsB,GAAUzB,EAAOS,GACxB,IAAIL,GAAS,EACTP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OAEvC,QAASO,EAAQP,EACf,GAAIY,EAAUT,EAAMI,GAAQA,EAAOJ,GACjC,OAAO,EAGX,OAAO,EAUT,IAAI0B,GAAYC,GAAa,UAS7B,SAASC,GAAaC,GACpB,OAAOA,EAAOC,MAAM,IAUtB,SAASC,GAAWF,GAClB,OAAOA,EAAOG,MAAM7I,KAAgB,GActC,SAAS8I,GAAYC,EAAYzB,EAAW0B,GAC1C,IAAIvB,EAOJ,OANAuB,EAASD,GAAY,SAAS7B,EAAO+B,EAAKF,GACxC,GAAIzB,EAAUJ,EAAO+B,EAAKF,GAExB,OADAtB,EAASwB,GACF,KAGJxB,EAcT,SAASyB,GAAcrC,EAAOS,EAAW6B,EAAWC,GAClD,IAAI1C,EAASG,EAAMH,OACfO,EAAQkC,GAAaC,EAAY,GAAK,GAE1C,MAAQA,EAAYnC,MAAYA,EAAQP,EACtC,GAAIY,EAAUT,EAAMI,GAAQA,EAAOJ,GACjC,OAAOI,EAGX,OAAQ,EAYV,SAASU,GAAYd,EAAOK,EAAOiC,GACjC,OAAOjC,IAAUA,EACbmC,GAAcxC,EAAOK,EAAOiC,GAC5BD,GAAcrC,EAAOyC,GAAWH,GAatC,SAASI,GAAgB1C,EAAOK,EAAOiC,EAAWtB,GAChD,IAAIZ,EAAQkC,EAAY,EACpBzC,EAASG,EAAMH,OAEnB,QAASO,EAAQP,EACf,GAAImB,EAAWhB,EAAMI,GAAQC,GAC3B,OAAOD,EAGX,OAAQ,EAUV,SAASqC,GAAUpC,GACjB,OAAOA,IAAUA,EAYnB,SAASsC,GAAS3C,EAAOE,GACvB,IAAIL,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAOA,EAAU+C,GAAQ5C,EAAOE,GAAYL,EAAUvK,EAUxD,SAASqM,GAAaS,GACpB,OAAO,SAASS,GACd,OAAiB,MAAVA,EAAiBxP,EAAYwP,EAAOT,IAW/C,SAASU,GAAeD,GACtB,OAAO,SAAST,GACd,OAAiB,MAAVS,EAAiBxP,EAAYwP,EAAOT,IAiB/C,SAASW,GAAWb,EAAYhC,EAAUC,EAAaoB,EAAWY,GAMhE,OALAA,EAASD,GAAY,SAAS7B,EAAOD,EAAO8B,GAC1C/B,EAAcoB,GACTA,GAAY,EAAOlB,GACpBH,EAASC,EAAaE,EAAOD,EAAO8B,MAEnC/B,EAaT,SAAS6C,GAAWhD,EAAOiD,GACzB,IAAIpD,EAASG,EAAMH,OAEnBG,EAAMkD,KAAKD,GACX,MAAOpD,IACLG,EAAMH,GAAUG,EAAMH,GAAQQ,MAEhC,OAAOL,EAYT,SAAS4C,GAAQ5C,EAAOE,GACtB,IAAIU,EACAR,GAAS,EACTP,EAASG,EAAMH,OAEnB,QAASO,EAAQP,EAAQ,CACvB,IAAIsD,EAAUjD,EAASF,EAAMI,IACzB+C,IAAY9P,IACduN,EAASA,IAAWvN,EAAY8P,EAAWvC,EAASuC,GAGxD,OAAOvC,EAYT,SAASwC,GAAUC,EAAGnD,GACpB,IAAIE,GAAS,EACTQ,EAASM,MAAMmC,GAEnB,QAASjD,EAAQiD,EACfzC,EAAOR,GAASF,EAASE,GAE3B,OAAOQ,EAYT,SAAS0C,GAAYT,EAAQU,GAC3B,OAAOtC,GAASsC,GAAO,SAASnB,GAC9B,MAAO,CAACA,EAAKS,EAAOT,OAWxB,SAASoB,GAAU9D,GACjB,OAAO,SAASW,GACd,OAAOX,EAAKW,IAchB,SAASoD,GAAWZ,EAAQU,GAC1B,OAAOtC,GAASsC,GAAO,SAASnB,GAC9B,OAAOS,EAAOT,MAYlB,SAASsB,GAASC,EAAOvB,GACvB,OAAOuB,EAAMC,IAAIxB,GAYnB,SAASyB,GAAgBC,EAAYC,GACnC,IAAI3D,GAAS,EACTP,EAASiE,EAAWjE,OAExB,QAASO,EAAQP,GAAUiB,GAAYiD,EAAYD,EAAW1D,GAAQ,IAAM,GAC5E,OAAOA,EAYT,SAAS4D,GAAcF,EAAYC,GACjC,IAAI3D,EAAQ0D,EAAWjE,OAEvB,MAAOO,KAAWU,GAAYiD,EAAYD,EAAW1D,GAAQ,IAAM,GACnE,OAAOA,EAWT,SAAS6D,GAAajE,EAAOkE,GAC3B,IAAIrE,EAASG,EAAMH,OACfe,EAAS,EAEb,MAAOf,IACDG,EAAMH,KAAYqE,KAClBtD,EAGN,OAAOA,EAWT,IAAIuD,GAAerB,GAAe3F,IAS9BiH,GAAiBtB,GAAe1F,IASpC,SAASiH,GAAiBC,GACxB,MAAO,KAAOhH,GAAcgH,GAW9B,SAASC,GAAS1B,EAAQT,GACxB,OAAiB,MAAVS,EAAiBxP,EAAYwP,EAAOT,GAU7C,SAASoC,GAAW3C,GAClB,OAAOhF,GAAa4H,KAAK5C,GAU3B,SAAS6C,GAAe7C,GACtB,OAAO/E,GAAiB2H,KAAK5C,GAU/B,SAAS8C,GAAgBC,GACvB,IAAIC,EACAjE,EAAS,GAEb,QAASiE,EAAOD,EAASE,QAAQC,KAC/BnE,EAAOoE,KAAKH,EAAKxE,OAEnB,OAAOO,EAUT,SAASqE,GAAWC,GAClB,IAAI9E,GAAS,EACTQ,EAASM,MAAMgE,EAAIC,MAKvB,OAHAD,EAAIE,SAAQ,SAAS/E,EAAO+B,GAC1BxB,IAASR,GAAS,CAACgC,EAAK/B,MAEnBO,EAWT,SAASyE,GAAQ3F,EAAM4F,GACrB,OAAO,SAASC,GACd,OAAO7F,EAAK4F,EAAUC,KAa1B,SAASC,GAAexF,EAAOkE,GAC7B,IAAI9D,GAAS,EACTP,EAASG,EAAMH,OACfc,EAAW,EACXC,EAAS,GAEb,QAASR,EAAQP,EAAQ,CACvB,IAAIQ,EAAQL,EAAMI,GACdC,IAAU6D,GAAe7D,IAAUzM,IACrCoM,EAAMI,GAASxM,EACfgN,EAAOD,KAAcP,GAGzB,OAAOQ,EAUT,SAAS6E,GAAWC,GAClB,IAAItF,GAAS,EACTQ,EAASM,MAAMwE,EAAIP,MAKvB,OAHAO,EAAIN,SAAQ,SAAS/E,GACnBO,IAASR,GAASC,KAEbO,EAUT,SAAS+E,GAAWD,GAClB,IAAItF,GAAS,EACTQ,EAASM,MAAMwE,EAAIP,MAKvB,OAHAO,EAAIN,SAAQ,SAAS/E,GACnBO,IAASR,GAAS,CAACC,EAAOA,MAErBO,EAaT,SAAS4B,GAAcxC,EAAOK,EAAOiC,GACnC,IAAIlC,EAAQkC,EAAY,EACpBzC,EAASG,EAAMH,OAEnB,QAASO,EAAQP,EACf,GAAIG,EAAMI,KAAWC,EACnB,OAAOD,EAGX,OAAQ,EAaV,SAASwF,GAAkB5F,EAAOK,EAAOiC,GACvC,IAAIlC,EAAQkC,EAAY,EACxB,MAAOlC,IACL,GAAIJ,EAAMI,KAAWC,EACnB,OAAOD,EAGX,OAAOA,EAUT,SAASyF,GAAWhE,GAClB,OAAO2C,GAAW3C,GACdiE,GAAYjE,GACZH,GAAUG,GAUhB,SAASkE,GAAclE,GACrB,OAAO2C,GAAW3C,GACdmE,GAAenE,GACfD,GAAaC,GAUnB,IAAIoE,GAAmBnD,GAAezF,IAStC,SAASyI,GAAYjE,GACnB,IAAIjB,EAASjE,GAAUuJ,UAAY,EACnC,MAAOvJ,GAAU8H,KAAK5C,KAClBjB,EAEJ,OAAOA,EAUT,SAASoF,GAAenE,GACtB,OAAOA,EAAOG,MAAMrF,KAAc,GAUpC,SAASwJ,GAAatE,GACpB,OAAOA,EAAOG,MAAMpF,KAAkB,GAkCxC,IAAIwJ,GAAe,SAAUA,EAAaC,GACxCA,EAAqB,MAAXA,EAAkBrI,GAAOsI,GAAEC,SAASvI,GAAKH,SAAUwI,EAASC,GAAEE,KAAKxI,GAAMjB,KAGnF,IAAImE,EAAQmF,EAAQnF,MAChBuF,EAAOJ,EAAQI,KACfC,EAAQL,EAAQK,MAChBzI,GAAWoI,EAAQpI,SACnB0I,GAAON,EAAQM,KACf9I,GAASwI,EAAQxI,OACjB3F,GAASmO,EAAQnO,OACjB0O,GAASP,EAAQO,OACjBC,GAAYR,EAAQQ,UAGpBC,GAAa5F,EAAM6F,UACnBC,GAAY/I,GAAS8I,UACrBE,GAAcpJ,GAAOkJ,UAGrBG,GAAab,EAAQ,sBAGrBc,GAAeH,GAAUI,SAGzBC,GAAiBJ,GAAYI,eAG7BC,GAAY,EAGZC,GAAc,WAChB,IAAIC,EAAM,SAASC,KAAKP,IAAcA,GAAWQ,MAAQR,GAAWQ,KAAKC,UAAY,IACrF,OAAOH,EAAO,iBAAmBA,EAAO,GAFzB,GAUbI,GAAuBX,GAAYG,SAGnCS,GAAmBV,GAAarH,KAAKjC,IAGrCiK,GAAU9J,GAAKsI,EAGfyB,GAAa7P,GAAO,IACtBiP,GAAarH,KAAKuH,IAAgBW,QAAQrP,GAAc,QACvDqP,QAAQ,yDAA0D,SAAW,KAI5EC,GAAS5J,GAAgBgI,EAAQ4B,OAAS5U,EAC1C6U,GAAS7B,EAAQ6B,OACjBC,GAAa9B,EAAQ8B,WACrBC,GAAcH,GAASA,GAAOG,YAAc/U,EAC5CgV,GAAehD,GAAQxH,GAAOyK,eAAgBzK,IAC9C0K,GAAe1K,GAAO2K,OACtBC,GAAuBxB,GAAYwB,qBACnCC,GAAS5B,GAAW4B,OACpBC,GAAmBT,GAASA,GAAOU,mBAAqBvV,EACxDwV,GAAcX,GAASA,GAAOtD,SAAWvR,EACzCyV,GAAiBZ,GAASA,GAAOa,YAAc1V,EAE/C2V,GAAkB,WACpB,IACE,IAAItJ,EAAOuJ,GAAUpL,GAAQ,kBAE7B,OADA6B,EAAK,GAAI,GAAI,IACNA,EACP,MAAOd,KALU,GASjBsK,GAAkB7C,EAAQ8C,eAAiBnL,GAAKmL,cAAgB9C,EAAQ8C,aACxEC,GAAS3C,GAAQA,EAAK4C,MAAQrL,GAAKyI,KAAK4C,KAAO5C,EAAK4C,IACpDC,GAAgBjD,EAAQkD,aAAevL,GAAKuL,YAAclD,EAAQkD,WAGlEC,GAAa7C,GAAK8C,KAClBC,GAAc/C,GAAKgD,MACnBC,GAAmB/L,GAAOgM,sBAC1BC,GAAiB7B,GAASA,GAAO8B,SAAW1W,EAC5C2W,GAAiB3D,EAAQ4D,SACzBC,GAAapD,GAAW3K,KACxBgO,GAAa9E,GAAQxH,GAAO6J,KAAM7J,IAClCuM,GAAYzD,GAAK0D,IACjBC,GAAY3D,GAAK4D,IACjBC,GAAY/D,EAAK4C,IACjBoB,GAAiBpE,EAAQ3I,SACzBgN,GAAe/D,GAAKgE,OACpBC,GAAgB9D,GAAW+D,QAG3BC,GAAW7B,GAAU5C,EAAS,YAC9B0E,GAAM9B,GAAU5C,EAAS,OACzB2E,GAAU/B,GAAU5C,EAAS,WAC7B4E,GAAMhC,GAAU5C,EAAS,OACzB6E,GAAUjC,GAAU5C,EAAS,WAC7B8E,GAAelC,GAAUpL,GAAQ,UAGjCuN,GAAUF,IAAW,IAAIA,GAGzBG,GAAY,GAGZC,GAAqBC,GAAST,IAC9BU,GAAgBD,GAASR,IACzBU,GAAoBF,GAASP,IAC7BU,GAAgBH,GAASN,IACzBU,GAAoBJ,GAASL,IAG7BU,GAAc1D,GAASA,GAAOnB,UAAY1T,EAC1CwY,GAAgBD,GAAcA,GAAYE,QAAUzY,EACpD0Y,GAAiBH,GAAcA,GAAYxE,SAAW/T,EAyH1D,SAAS2Y,GAAO3L,GACd,GAAI4L,GAAa5L,KAAW6L,GAAQ7L,MAAYA,aAAiB8L,IAAc,CAC7E,GAAI9L,aAAiB+L,GACnB,OAAO/L,EAET,GAAIgH,GAAevH,KAAKO,EAAO,eAC7B,OAAOgM,GAAahM,GAGxB,OAAO,IAAI+L,GAAc/L,GAW3B,IAAIiM,GAAc,WAChB,SAASzJ,KACT,OAAO,SAAS0J,GACd,IAAKC,GAASD,GACZ,MAAO,GAET,GAAIhE,GACF,OAAOA,GAAagE,GAEtB1J,EAAOkE,UAAYwF,EACnB,IAAI3L,EAAS,IAAIiC,EAEjB,OADAA,EAAOkE,UAAY1T,EACZuN,GAZM,GAqBjB,SAAS6L,MAWT,SAASL,GAAc/L,EAAOqM,GAC5Bha,KAAKia,YAActM,EACnB3N,KAAKka,YAAc,GACnBla,KAAKma,YAAcH,EACnBha,KAAKoa,UAAY,EACjBpa,KAAKqa,WAAa1Z,EAgFpB,SAAS8Y,GAAY9L,GACnB3N,KAAKia,YAActM,EACnB3N,KAAKka,YAAc,GACnBla,KAAKsa,QAAU,EACfta,KAAKua,cAAe,EACpBva,KAAKwa,cAAgB,GACrBxa,KAAKya,cAAgB5X,EACrB7C,KAAK0a,UAAY,GAWnB,SAASC,KACP,IAAIzM,EAAS,IAAIuL,GAAYzZ,KAAKia,aAOlC,OANA/L,EAAOgM,YAAcU,GAAU5a,KAAKka,aACpChM,EAAOoM,QAAUta,KAAKsa,QACtBpM,EAAOqM,aAAeva,KAAKua,aAC3BrM,EAAOsM,cAAgBI,GAAU5a,KAAKwa,eACtCtM,EAAOuM,cAAgBza,KAAKya,cAC5BvM,EAAOwM,UAAYE,GAAU5a,KAAK0a,WAC3BxM,EAWT,SAAS2M,KACP,GAAI7a,KAAKua,aAAc,CACrB,IAAIrM,EAAS,IAAIuL,GAAYzZ,MAC7BkO,EAAOoM,SAAW,EAClBpM,EAAOqM,cAAe,OAEtBrM,EAASlO,KAAK8a,QACd5M,EAAOoM,UAAY,EAErB,OAAOpM,EAWT,SAAS6M,KACP,IAAIzN,EAAQtN,KAAKia,YAAYtM,QACzBqN,EAAMhb,KAAKsa,QACXW,EAAQzB,GAAQlM,GAChB4N,EAAUF,EAAM,EAChBG,EAAYF,EAAQ3N,EAAMH,OAAS,EACnCiO,EAAOC,GAAQ,EAAGF,EAAWnb,KAAK0a,WAClCY,EAAQF,EAAKE,MACbC,EAAMH,EAAKG,IACXpO,EAASoO,EAAMD,EACf5N,EAAQwN,EAAUK,EAAOD,EAAQ,EACjCE,EAAYxb,KAAKwa,cACjBiB,EAAaD,EAAUrO,OACvBc,EAAW,EACXyN,EAAY9D,GAAUzK,EAAQnN,KAAKya,eAEvC,IAAKQ,IAAWC,GAAWC,GAAahO,GAAUuO,GAAavO,EAC7D,OAAOwO,GAAiBrO,EAAOtN,KAAKka,aAEtC,IAAIhM,EAAS,GAEb0N,EACA,MAAOzO,KAAYc,EAAWyN,EAAW,CACvChO,GAASsN,EAET,IAAIa,GAAa,EACblO,EAAQL,EAAMI,GAElB,QAASmO,EAAYJ,EAAY,CAC/B,IAAItJ,EAAOqJ,EAAUK,GACjBrO,EAAW2E,EAAK3E,SAChBsO,EAAO3J,EAAK2J,KACZC,EAAWvO,EAASG,GAExB,GAAImO,GAAQvZ,EACVoL,EAAQoO,OACH,IAAKA,EAAU,CACpB,GAAID,GAAQxZ,EACV,SAASsZ,EAET,MAAMA,GAIZ1N,EAAOD,KAAcN,EAEvB,OAAOO,EAgBT,SAAS8N,GAAKC,GACZ,IAAIvO,GAAS,EACTP,EAAoB,MAAX8O,EAAkB,EAAIA,EAAQ9O,OAE3CnN,KAAKkc,QACL,QAASxO,EAAQP,EAAQ,CACvB,IAAIgP,EAAQF,EAAQvO,GACpB1N,KAAKgT,IAAImJ,EAAM,GAAIA,EAAM,KAW7B,SAASC,KACPpc,KAAKqc,SAAW5D,GAAeA,GAAa,MAAQ,GACpDzY,KAAKyS,KAAO,EAad,SAAS6J,GAAW5M,GAClB,IAAIxB,EAASlO,KAAKkR,IAAIxB,WAAe1P,KAAKqc,SAAS3M,GAEnD,OADA1P,KAAKyS,MAAQvE,EAAS,EAAI,EACnBA,EAYT,SAASqO,GAAQ7M,GACf,IAAIyC,EAAOnS,KAAKqc,SAChB,GAAI5D,GAAc,CAChB,IAAIvK,EAASiE,EAAKzC,GAClB,OAAOxB,IAAWlN,EAAiBL,EAAYuN,EAEjD,OAAOyG,GAAevH,KAAK+E,EAAMzC,GAAOyC,EAAKzC,GAAO/O,EAYtD,SAAS6b,GAAQ9M,GACf,IAAIyC,EAAOnS,KAAKqc,SAChB,OAAO5D,GAAgBtG,EAAKzC,KAAS/O,EAAagU,GAAevH,KAAK+E,EAAMzC,GAa9E,SAAS+M,GAAQ/M,EAAK/B,GACpB,IAAIwE,EAAOnS,KAAKqc,SAGhB,OAFArc,KAAKyS,MAAQzS,KAAKkR,IAAIxB,GAAO,EAAI,EACjCyC,EAAKzC,GAAQ+I,IAAgB9K,IAAUhN,EAAaK,EAAiB2M,EAC9D3N,KAmBT,SAAS0c,GAAUT,GACjB,IAAIvO,GAAS,EACTP,EAAoB,MAAX8O,EAAkB,EAAIA,EAAQ9O,OAE3CnN,KAAKkc,QACL,QAASxO,EAAQP,EAAQ,CACvB,IAAIgP,EAAQF,EAAQvO,GACpB1N,KAAKgT,IAAImJ,EAAM,GAAIA,EAAM,KAW7B,SAASQ,KACP3c,KAAKqc,SAAW,GAChBrc,KAAKyS,KAAO,EAYd,SAASmK,GAAgBlN,GACvB,IAAIyC,EAAOnS,KAAKqc,SACZ3O,EAAQmP,GAAa1K,EAAMzC,GAE/B,GAAIhC,EAAQ,EACV,OAAO,EAET,IAAI8F,EAAYrB,EAAKhF,OAAS,EAO9B,OANIO,GAAS8F,EACXrB,EAAK2K,MAEL9G,GAAO5I,KAAK+E,EAAMzE,EAAO,KAEzB1N,KAAKyS,MACA,EAYT,SAASsK,GAAarN,GACpB,IAAIyC,EAAOnS,KAAKqc,SACZ3O,EAAQmP,GAAa1K,EAAMzC,GAE/B,OAAOhC,EAAQ,EAAI/M,EAAYwR,EAAKzE,GAAO,GAY7C,SAASsP,GAAatN,GACpB,OAAOmN,GAAa7c,KAAKqc,SAAU3M,IAAQ,EAa7C,SAASuN,GAAavN,EAAK/B,GACzB,IAAIwE,EAAOnS,KAAKqc,SACZ3O,EAAQmP,GAAa1K,EAAMzC,GAQ/B,OANIhC,EAAQ,KACR1N,KAAKyS,KACPN,EAAKG,KAAK,CAAC5C,EAAK/B,KAEhBwE,EAAKzE,GAAO,GAAKC,EAEZ3N,KAmBT,SAASkd,GAASjB,GAChB,IAAIvO,GAAS,EACTP,EAAoB,MAAX8O,EAAkB,EAAIA,EAAQ9O,OAE3CnN,KAAKkc,QACL,QAASxO,EAAQP,EAAQ,CACvB,IAAIgP,EAAQF,EAAQvO,GACpB1N,KAAKgT,IAAImJ,EAAM,GAAIA,EAAM,KAW7B,SAASgB,KACPnd,KAAKyS,KAAO,EACZzS,KAAKqc,SAAW,CACd,KAAQ,IAAIL,GACZ,IAAO,IAAK3D,IAAOqE,IACnB,OAAU,IAAIV,IAalB,SAASoB,GAAe1N,GACtB,IAAIxB,EAASmP,GAAWrd,KAAM0P,GAAK,UAAUA,GAE7C,OADA1P,KAAKyS,MAAQvE,EAAS,EAAI,EACnBA,EAYT,SAASoP,GAAY5N,GACnB,OAAO2N,GAAWrd,KAAM0P,GAAK6N,IAAI7N,GAYnC,SAAS8N,GAAY9N,GACnB,OAAO2N,GAAWrd,KAAM0P,GAAKwB,IAAIxB,GAanC,SAAS+N,GAAY/N,EAAK/B,GACxB,IAAIwE,EAAOkL,GAAWrd,KAAM0P,GACxB+C,EAAON,EAAKM,KAIhB,OAFAN,EAAKa,IAAItD,EAAK/B,GACd3N,KAAKyS,MAAQN,EAAKM,MAAQA,EAAO,EAAI,EAC9BzS,KAoBT,SAAS0d,GAAShP,GAChB,IAAIhB,GAAS,EACTP,EAAmB,MAAVuB,EAAiB,EAAIA,EAAOvB,OAEzCnN,KAAKqc,SAAW,IAAIa,GACpB,QAASxP,EAAQP,EACfnN,KAAK2d,IAAIjP,EAAOhB,IAcpB,SAASkQ,GAAYjQ,GAEnB,OADA3N,KAAKqc,SAASrJ,IAAIrF,EAAO3M,GAClBhB,KAYT,SAAS6d,GAAYlQ,GACnB,OAAO3N,KAAKqc,SAASnL,IAAIvD,GAgB3B,SAASmQ,GAAM7B,GACb,IAAI9J,EAAOnS,KAAKqc,SAAW,IAAIK,GAAUT,GACzCjc,KAAKyS,KAAON,EAAKM,KAUnB,SAASsL,KACP/d,KAAKqc,SAAW,IAAIK,GACpB1c,KAAKyS,KAAO,EAYd,SAASuL,GAAYtO,GACnB,IAAIyC,EAAOnS,KAAKqc,SACZnO,EAASiE,EAAK,UAAUzC,GAG5B,OADA1P,KAAKyS,KAAON,EAAKM,KACVvE,EAYT,SAAS+P,GAASvO,GAChB,OAAO1P,KAAKqc,SAASkB,IAAI7N,GAY3B,SAASwO,GAASxO,GAChB,OAAO1P,KAAKqc,SAASnL,IAAIxB,GAa3B,SAASyO,GAASzO,EAAK/B,GACrB,IAAIwE,EAAOnS,KAAKqc,SAChB,GAAIlK,aAAgBuK,GAAW,CAC7B,IAAI0B,EAAQjM,EAAKkK,SACjB,IAAKhE,IAAQ+F,EAAMjR,OAAStM,EAAmB,EAG7C,OAFAud,EAAM9L,KAAK,CAAC5C,EAAK/B,IACjB3N,KAAKyS,OAASN,EAAKM,KACZzS,KAETmS,EAAOnS,KAAKqc,SAAW,IAAIa,GAASkB,GAItC,OAFAjM,EAAKa,IAAItD,EAAK/B,GACd3N,KAAKyS,KAAON,EAAKM,KACVzS,KAoBT,SAASqe,GAAc1Q,EAAO2Q,GAC5B,IAAIrD,EAAQzB,GAAQ7L,GAChB4Q,GAAStD,GAASuD,GAAY7Q,GAC9B8Q,GAAUxD,IAAUsD,GAASlH,GAAS1J,GACtC+Q,GAAUzD,IAAUsD,IAAUE,GAAU3R,GAAaa,GACrDgR,EAAc1D,GAASsD,GAASE,GAAUC,EAC1CxQ,EAASyQ,EAAcjO,GAAU/C,EAAMR,OAAQ+G,IAAU,GACzD/G,EAASe,EAAOf,OAEpB,IAAK,IAAIuC,KAAO/B,GACT2Q,IAAa3J,GAAevH,KAAKO,EAAO+B,IACvCiP,IAEQ,UAAPjP,GAEC+O,IAAkB,UAAP/O,GAA0B,UAAPA,IAE9BgP,IAAkB,UAAPhP,GAA0B,cAAPA,GAA8B,cAAPA,IAEtDkP,GAAQlP,EAAKvC,KAElBe,EAAOoE,KAAK5C,GAGhB,OAAOxB,EAUT,SAAS2Q,GAAYvR,GACnB,IAAIH,EAASG,EAAMH,OACnB,OAAOA,EAASG,EAAMwR,GAAW,EAAG3R,EAAS,IAAMxM,EAWrD,SAASoe,GAAgBzR,EAAOqD,GAC9B,OAAOqO,GAAYpE,GAAUtN,GAAQ2R,GAAUtO,EAAG,EAAGrD,EAAMH,SAU7D,SAAS+R,GAAa5R,GACpB,OAAO0R,GAAYpE,GAAUtN,IAY/B,SAAS6R,GAAiBhP,EAAQT,EAAK/B,IAChCA,IAAUhN,IAAcye,GAAGjP,EAAOT,GAAM/B,IACxCA,IAAUhN,KAAe+O,KAAOS,KACnCkP,GAAgBlP,EAAQT,EAAK/B,GAcjC,SAAS2R,GAAYnP,EAAQT,EAAK/B,GAChC,IAAI4R,EAAWpP,EAAOT,GAChBiF,GAAevH,KAAK+C,EAAQT,IAAQ0P,GAAGG,EAAU5R,KAClDA,IAAUhN,GAAe+O,KAAOS,IACnCkP,GAAgBlP,EAAQT,EAAK/B,GAYjC,SAASkP,GAAavP,EAAOoC,GAC3B,IAAIvC,EAASG,EAAMH,OACnB,MAAOA,IACL,GAAIiS,GAAG9R,EAAMH,GAAQ,GAAIuC,GACvB,OAAOvC,EAGX,OAAQ,EAcV,SAASqS,GAAehQ,EAAYjC,EAAQC,EAAUC,GAIpD,OAHAgS,GAASjQ,GAAY,SAAS7B,EAAO+B,EAAKF,GACxCjC,EAAOE,EAAaE,EAAOH,EAASG,GAAQ6B,MAEvC/B,EAYT,SAASiS,GAAWvP,EAAQ1K,GAC1B,OAAO0K,GAAUwP,GAAWla,EAAQuP,GAAKvP,GAAS0K,GAYpD,SAASyP,GAAazP,EAAQ1K,GAC5B,OAAO0K,GAAUwP,GAAWla,EAAQoa,GAAOpa,GAAS0K,GAYtD,SAASkP,GAAgBlP,EAAQT,EAAK/B,GACzB,aAAP+B,GAAsB4G,GACxBA,GAAenG,EAAQT,EAAK,CAC1B,cAAgB,EAChB,YAAc,EACd,MAAS/B,EACT,UAAY,IAGdwC,EAAOT,GAAO/B,EAYlB,SAASmS,GAAO3P,EAAQ4P,GACtB,IAAIrS,GAAS,EACTP,EAAS4S,EAAM5S,OACfe,EAASM,EAAMrB,GACf6S,EAAiB,MAAV7P,EAEX,QAASzC,EAAQP,EACfe,EAAOR,GAASsS,EAAOrf,EAAY4c,GAAIpN,EAAQ4P,EAAMrS,IAEvD,OAAOQ,EAYT,SAAS+Q,GAAUgB,EAAQC,EAAOC,GAShC,OARIF,IAAWA,IACTE,IAAUxf,IACZsf,EAASA,GAAUE,EAAQF,EAASE,GAElCD,IAAUvf,IACZsf,EAASA,GAAUC,EAAQD,EAASC,IAGjCD,EAmBT,SAASG,GAAUzS,EAAO0S,EAASC,EAAY5Q,EAAKS,EAAQoQ,GAC1D,IAAIrS,EACAsS,EAASH,EAAUlf,EACnBsf,EAASJ,EAAUjf,EACnBsf,EAASL,EAAUhf,EAKvB,GAHIif,IACFpS,EAASiC,EAASmQ,EAAW3S,EAAO+B,EAAKS,EAAQoQ,GAASD,EAAW3S,IAEnEO,IAAWvN,EACb,OAAOuN,EAET,IAAK4L,GAASnM,GACZ,OAAOA,EAET,IAAIsN,EAAQzB,GAAQ7L,GACpB,GAAIsN,GAEF,GADA/M,EAASyS,GAAehT,IACnB6S,EACH,OAAO5F,GAAUjN,EAAOO,OAErB,CACL,IAAI0S,EAAMC,GAAOlT,GACbmT,EAASF,GAAOpd,GAAWod,GAAOnd,EAEtC,GAAI4T,GAAS1J,GACX,OAAOoT,GAAYpT,EAAO6S,GAE5B,GAAII,GAAO/c,IAAa+c,GAAO3d,GAAY6d,IAAW3Q,GAEpD,GADAjC,EAAUuS,GAAUK,EAAU,GAAKE,GAAgBrT,IAC9C6S,EACH,OAAOC,EACHQ,GAActT,EAAOiS,GAAa1R,EAAQP,IAC1CuT,GAAYvT,EAAO+R,GAAWxR,EAAQP,QAEvC,CACL,IAAKnD,GAAcoW,GACjB,OAAOzQ,EAASxC,EAAQ,GAE1BO,EAASiT,GAAexT,EAAOiT,EAAKJ,IAIxCD,IAAUA,EAAQ,IAAIzC,IACtB,IAAIsD,EAAUb,EAAMhD,IAAI5P,GACxB,GAAIyT,EACF,OAAOA,EAETb,EAAMvN,IAAIrF,EAAOO,GAEbtB,GAAMe,GACRA,EAAM+E,SAAQ,SAAS2O,GACrBnT,EAAOyP,IAAIyC,GAAUiB,EAAUhB,EAASC,EAAYe,EAAU1T,EAAO4S,OAE9D/T,GAAMmB,IACfA,EAAM+E,SAAQ,SAAS2O,EAAU3R,GAC/BxB,EAAO8E,IAAItD,EAAK0Q,GAAUiB,EAAUhB,EAASC,EAAY5Q,EAAK/B,EAAO4S,OAIzE,IAAIe,EAAWZ,EACVD,EAASc,GAAeC,GACxBf,EAASZ,GAAS7K,GAEnBnE,EAAQoK,EAAQta,EAAY2gB,EAAS3T,GASzC,OARAC,GAAUiD,GAASlD,GAAO,SAAS0T,EAAU3R,GACvCmB,IACFnB,EAAM2R,EACNA,EAAW1T,EAAM+B,IAGnB4P,GAAYpR,EAAQwB,EAAK0Q,GAAUiB,EAAUhB,EAASC,EAAY5Q,EAAK/B,EAAO4S,OAEzErS,EAUT,SAASuT,GAAahc,GACpB,IAAIoL,EAAQmE,GAAKvP,GACjB,OAAO,SAAS0K,GACd,OAAOuR,GAAevR,EAAQ1K,EAAQoL,IAY1C,SAAS6Q,GAAevR,EAAQ1K,EAAQoL,GACtC,IAAI1D,EAAS0D,EAAM1D,OACnB,GAAc,MAAVgD,EACF,OAAQhD,EAEVgD,EAAShF,GAAOgF,GAChB,MAAOhD,IAAU,CACf,IAAIuC,EAAMmB,EAAM1D,GACZY,EAAYtI,EAAOiK,GACnB/B,EAAQwC,EAAOT,GAEnB,GAAK/B,IAAUhN,KAAe+O,KAAOS,KAAapC,EAAUJ,GAC1D,OAAO,EAGX,OAAO,EAaT,SAASgU,GAAU3U,EAAM4U,EAAM1U,GAC7B,GAAmB,mBAARF,EACT,MAAM,IAAImH,GAAUpT,GAEtB,OAAO8V,IAAW,WAAa7J,EAAKD,MAAMpM,EAAWuM,KAAU0U,GAcjE,SAASC,GAAevU,EAAOoB,EAAQlB,EAAUc,GAC/C,IAAIZ,GAAS,EACToU,EAAW3T,GACX4T,GAAW,EACX5U,EAASG,EAAMH,OACfe,EAAS,GACT8T,EAAetT,EAAOvB,OAE1B,IAAKA,EACH,OAAOe,EAELV,IACFkB,EAASH,GAASG,EAAQoC,GAAUtD,KAElCc,GACFwT,EAAWzT,GACX0T,GAAW,GAEJrT,EAAOvB,QAAUtM,IACxBihB,EAAW9Q,GACX+Q,GAAW,EACXrT,EAAS,IAAIgP,GAAShP,IAExBkN,EACA,QAASlO,EAAQP,EAAQ,CACvB,IAAIQ,EAAQL,EAAMI,GACdqO,EAAuB,MAAZvO,EAAmBG,EAAQH,EAASG,GAGnD,GADAA,EAASW,GAAwB,IAAVX,EAAeA,EAAQ,EAC1CoU,GAAYhG,IAAaA,EAAU,CACrC,IAAIkG,EAAcD,EAClB,MAAOC,IACL,GAAIvT,EAAOuT,KAAiBlG,EAC1B,SAASH,EAGb1N,EAAOoE,KAAK3E,QAEJmU,EAASpT,EAAQqN,EAAUzN,IACnCJ,EAAOoE,KAAK3E,GAGhB,OAAOO,EAjkCToL,GAAO4I,iBAAmB,CAQxB,OAAUvc,GAQV,SAAYC,GAQZ,YAAeC,GAQf,SAAY,GAQZ,QAAW,CAQT,EAAKyT,KAKTA,GAAOjF,UAAY0F,GAAW1F,UAC9BiF,GAAOjF,UAAU8N,YAAc7I,GAE/BI,GAAcrF,UAAYuF,GAAWG,GAAW1F,WAChDqF,GAAcrF,UAAU8N,YAAczI,GAsHtCD,GAAYpF,UAAYuF,GAAWG,GAAW1F,WAC9CoF,GAAYpF,UAAU8N,YAAc1I,GAoGpCuC,GAAK3H,UAAU6H,MAAQE,GACvBJ,GAAK3H,UAAU,UAAYiI,GAC3BN,GAAK3H,UAAUkJ,IAAMhB,GACrBP,GAAK3H,UAAUnD,IAAMsL,GACrBR,GAAK3H,UAAUrB,IAAMyJ,GAiHrBC,GAAUrI,UAAU6H,MAAQS,GAC5BD,GAAUrI,UAAU,UAAYuI,GAChCF,GAAUrI,UAAUkJ,IAAMR,GAC1BL,GAAUrI,UAAUnD,IAAM8L,GAC1BN,GAAUrI,UAAUrB,IAAMiK,GAmG1BC,GAAS7I,UAAU6H,MAAQiB,GAC3BD,GAAS7I,UAAU,UAAY+I,GAC/BF,GAAS7I,UAAUkJ,IAAMD,GACzBJ,GAAS7I,UAAUnD,IAAMsM,GACzBN,GAAS7I,UAAUrB,IAAMyK,GAmDzBC,GAASrJ,UAAUsJ,IAAMD,GAASrJ,UAAU/B,KAAOsL,GACnDF,GAASrJ,UAAUnD,IAAM2M,GAkGzBC,GAAMzJ,UAAU6H,MAAQ6B,GACxBD,GAAMzJ,UAAU,UAAY2J,GAC5BF,GAAMzJ,UAAUkJ,IAAMU,GACtBH,GAAMzJ,UAAUnD,IAAMgN,GACtBJ,GAAMzJ,UAAUrB,IAAMmL,GA8btB,IAAIsB,GAAW2C,GAAeC,IAU1BC,GAAgBF,GAAeG,IAAiB,GAWpD,SAASC,GAAUhT,EAAYzB,GAC7B,IAAIG,GAAS,EAKb,OAJAuR,GAASjQ,GAAY,SAAS7B,EAAOD,EAAO8B,GAE1C,OADAtB,IAAWH,EAAUJ,EAAOD,EAAO8B,GAC5BtB,KAEFA,EAaT,SAASuU,GAAanV,EAAOE,EAAUc,GACrC,IAAIZ,GAAS,EACTP,EAASG,EAAMH,OAEnB,QAASO,EAAQP,EAAQ,CACvB,IAAIQ,EAAQL,EAAMI,GACd+C,EAAUjD,EAASG,GAEvB,GAAe,MAAX8C,IAAoBsL,IAAapb,EAC5B8P,IAAYA,IAAYiS,GAASjS,GAClCnC,EAAWmC,EAASsL,IAE1B,IAAIA,EAAWtL,EACXvC,EAASP,EAGjB,OAAOO,EAaT,SAASyU,GAASrV,EAAOK,EAAO2N,EAAOC,GACrC,IAAIpO,EAASG,EAAMH,OAEnBmO,EAAQsH,GAAUtH,GACdA,EAAQ,IACVA,GAASA,EAAQnO,EAAS,EAAKA,EAASmO,GAE1CC,EAAOA,IAAQ5a,GAAa4a,EAAMpO,EAAUA,EAASyV,GAAUrH,GAC3DA,EAAM,IACRA,GAAOpO,GAEToO,EAAMD,EAAQC,EAAM,EAAIsH,GAAStH,GACjC,MAAOD,EAAQC,EACbjO,EAAMgO,KAAW3N,EAEnB,OAAOL,EAWT,SAASwV,GAAWtT,EAAYzB,GAC9B,IAAIG,EAAS,GAMb,OALAuR,GAASjQ,GAAY,SAAS7B,EAAOD,EAAO8B,GACtCzB,EAAUJ,EAAOD,EAAO8B,IAC1BtB,EAAOoE,KAAK3E,MAGTO,EAcT,SAAS6U,GAAYzV,EAAO0V,EAAOjV,EAAWkV,EAAU/U,GACtD,IAAIR,GAAS,EACTP,EAASG,EAAMH,OAEnBY,IAAcA,EAAYmV,IAC1BhV,IAAWA,EAAS,IAEpB,QAASR,EAAQP,EAAQ,CACvB,IAAIQ,EAAQL,EAAMI,GACdsV,EAAQ,GAAKjV,EAAUJ,GACrBqV,EAAQ,EAEVD,GAAYpV,EAAOqV,EAAQ,EAAGjV,EAAWkV,EAAU/U,GAEnDO,GAAUP,EAAQP,GAEVsV,IACV/U,EAAOA,EAAOf,QAAUQ,GAG5B,OAAOO,EAcT,IAAIiV,GAAUC,KAYVC,GAAeD,IAAc,GAUjC,SAASf,GAAWlS,EAAQ3C,GAC1B,OAAO2C,GAAUgT,GAAQhT,EAAQ3C,EAAUwH,IAW7C,SAASuN,GAAgBpS,EAAQ3C,GAC/B,OAAO2C,GAAUkT,GAAalT,EAAQ3C,EAAUwH,IAYlD,SAASsO,GAAcnT,EAAQU,GAC7B,OAAO7C,GAAY6C,GAAO,SAASnB,GACjC,OAAO6T,GAAWpT,EAAOT,OAY7B,SAAS8T,GAAQrT,EAAQsT,GACvBA,EAAOC,GAASD,EAAMtT,GAEtB,IAAIzC,EAAQ,EACRP,EAASsW,EAAKtW,OAElB,MAAiB,MAAVgD,GAAkBzC,EAAQP,EAC/BgD,EAASA,EAAOwT,GAAMF,EAAK/V,OAE7B,OAAQA,GAASA,GAASP,EAAUgD,EAASxP,EAc/C,SAASijB,GAAezT,EAAQmR,EAAUuC,GACxC,IAAI3V,EAASoT,EAASnR,GACtB,OAAOqJ,GAAQrJ,GAAUjC,EAASO,GAAUP,EAAQ2V,EAAY1T,IAUlE,SAAS2T,GAAWnW,GAClB,OAAa,MAATA,EACKA,IAAUhN,EAAYyD,GAAeR,GAEtCwS,IAAkBA,MAAkBjL,GAAOwC,GAC/CoW,GAAUpW,GACVqW,GAAerW,GAYrB,SAASsW,GAAOtW,EAAOuW,GACrB,OAAOvW,EAAQuW,EAWjB,SAASC,GAAQhU,EAAQT,GACvB,OAAiB,MAAVS,GAAkBwE,GAAevH,KAAK+C,EAAQT,GAWvD,SAAS0U,GAAUjU,EAAQT,GACzB,OAAiB,MAAVS,GAAkBT,KAAOvE,GAAOgF,GAYzC,SAASkU,GAAYpE,EAAQ3E,EAAOC,GAClC,OAAO0E,GAAUrI,GAAU0D,EAAOC,IAAQ0E,EAASvI,GAAU4D,EAAOC,GAatE,SAAS+I,GAAiBC,EAAQ/W,EAAUc,GAC1C,IAAIwT,EAAWxT,EAAaD,GAAoBF,GAC5ChB,EAASoX,EAAO,GAAGpX,OACnBqX,EAAYD,EAAOpX,OACnBsX,EAAWD,EACXE,EAASlW,EAAMgW,GACfG,EAAYC,IACZ1W,EAAS,GAEb,MAAOuW,IAAY,CACjB,IAAInX,EAAQiX,EAAOE,GACfA,GAAYjX,IACdF,EAAQiB,GAASjB,EAAOwD,GAAUtD,KAEpCmX,EAAY/M,GAAUtK,EAAMH,OAAQwX,GACpCD,EAAOD,IAAanW,IAAed,GAAaL,GAAU,KAAOG,EAAMH,QAAU,KAC7E,IAAIuQ,GAAS+G,GAAYnX,GACzB3M,EAEN2M,EAAQiX,EAAO,GAEf,IAAI7W,GAAS,EACTmX,EAAOH,EAAO,GAElB9I,EACA,QAASlO,EAAQP,GAAUe,EAAOf,OAASwX,EAAW,CACpD,IAAIhX,EAAQL,EAAMI,GACdqO,EAAWvO,EAAWA,EAASG,GAASA,EAG5C,GADAA,EAASW,GAAwB,IAAVX,EAAeA,EAAQ,IACxCkX,EACE7T,GAAS6T,EAAM9I,GACf+F,EAAS5T,EAAQ6N,EAAUzN,IAC5B,CACLmW,EAAWD,EACX,QAASC,EAAU,CACjB,IAAIxT,EAAQyT,EAAOD,GACnB,KAAMxT,EACED,GAASC,EAAO8K,GAChB+F,EAASyC,EAAOE,GAAW1I,EAAUzN,IAE3C,SAASsN,EAGTiJ,GACFA,EAAKvS,KAAKyJ,GAEZ7N,EAAOoE,KAAK3E,IAGhB,OAAOO,EAcT,SAAS4W,GAAa3U,EAAQ5C,EAAQC,EAAUC,GAI9C,OAHA4U,GAAWlS,GAAQ,SAASxC,EAAO+B,EAAKS,GACtC5C,EAAOE,EAAaD,EAASG,GAAQ+B,EAAKS,MAErC1C,EAaT,SAASsX,GAAW5U,EAAQsT,EAAMvW,GAChCuW,EAAOC,GAASD,EAAMtT,GACtBA,EAAS6U,GAAO7U,EAAQsT,GACxB,IAAIzW,EAAiB,MAAVmD,EAAiBA,EAASA,EAAOwT,GAAMsB,GAAKxB,KACvD,OAAe,MAARzW,EAAerM,EAAYoM,GAAMC,EAAMmD,EAAQjD,GAUxD,SAASgY,GAAgBvX,GACvB,OAAO4L,GAAa5L,IAAUmW,GAAWnW,IAAU1K,EAUrD,SAASkiB,GAAkBxX,GACzB,OAAO4L,GAAa5L,IAAUmW,GAAWnW,IAAUpJ,GAUrD,SAAS6gB,GAAWzX,GAClB,OAAO4L,GAAa5L,IAAUmW,GAAWnW,IAAUtK,EAiBrD,SAASgiB,GAAY1X,EAAOuW,EAAO7D,EAASC,EAAYC,GACtD,OAAI5S,IAAUuW,IAGD,MAATvW,GAA0B,MAATuW,IAAmB3K,GAAa5L,KAAW4L,GAAa2K,GACpEvW,IAAUA,GAASuW,IAAUA,EAE/BoB,GAAgB3X,EAAOuW,EAAO7D,EAASC,EAAY+E,GAAa9E,IAiBzE,SAAS+E,GAAgBnV,EAAQ+T,EAAO7D,EAASC,EAAYiF,EAAWhF,GACtE,IAAIiF,EAAWhM,GAAQrJ,GACnBsV,EAAWjM,GAAQ0K,GACnBwB,EAASF,EAAWtiB,EAAW2d,GAAO1Q,GACtCwV,EAASF,EAAWviB,EAAW2d,GAAOqD,GAE1CwB,EAASA,GAAUziB,EAAUY,GAAY6hB,EACzCC,EAASA,GAAU1iB,EAAUY,GAAY8hB,EAEzC,IAAIC,EAAWF,GAAU7hB,GACrBgiB,EAAWF,GAAU9hB,GACrBiiB,EAAYJ,GAAUC,EAE1B,GAAIG,GAAazO,GAASlH,GAAS,CACjC,IAAKkH,GAAS6M,GACZ,OAAO,EAETsB,GAAW,EACXI,GAAW,EAEb,GAAIE,IAAcF,EAEhB,OADArF,IAAUA,EAAQ,IAAIzC,IACd0H,GAAY1Y,GAAaqD,GAC7B4V,GAAY5V,EAAQ+T,EAAO7D,EAASC,EAAYiF,EAAWhF,GAC3DyF,GAAW7V,EAAQ+T,EAAOwB,EAAQrF,EAASC,EAAYiF,EAAWhF,GAExE,KAAMF,EAAU/e,GAAuB,CACrC,IAAI2kB,EAAeL,GAAYjR,GAAevH,KAAK+C,EAAQ,eACvD+V,EAAeL,GAAYlR,GAAevH,KAAK8W,EAAO,eAE1D,GAAI+B,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAe9V,EAAOxC,QAAUwC,EAC/CiW,EAAeF,EAAehC,EAAMvW,QAAUuW,EAGlD,OADA3D,IAAUA,EAAQ,IAAIzC,IACfyH,EAAUY,EAAcC,EAAc/F,EAASC,EAAYC,IAGtE,QAAKuF,IAGLvF,IAAUA,EAAQ,IAAIzC,IACfuI,GAAalW,EAAQ+T,EAAO7D,EAASC,EAAYiF,EAAWhF,IAUrE,SAAS+F,GAAU3Y,GACjB,OAAO4L,GAAa5L,IAAUkT,GAAOlT,IAAUjK,EAajD,SAAS6iB,GAAYpW,EAAQ1K,EAAQ+gB,EAAWlG,GAC9C,IAAI5S,EAAQ8Y,EAAUrZ,OAClBA,EAASO,EACT+Y,GAAgBnG,EAEpB,GAAc,MAAVnQ,EACF,OAAQhD,EAEVgD,EAAShF,GAAOgF,GAChB,MAAOzC,IAAS,CACd,IAAIyE,EAAOqU,EAAU9Y,GACrB,GAAK+Y,GAAgBtU,EAAK,GAClBA,EAAK,KAAOhC,EAAOgC,EAAK,MACtBA,EAAK,KAAMhC,GAEnB,OAAO,EAGX,QAASzC,EAAQP,EAAQ,CACvBgF,EAAOqU,EAAU9Y,GACjB,IAAIgC,EAAMyC,EAAK,GACXoN,EAAWpP,EAAOT,GAClBgX,EAAWvU,EAAK,GAEpB,GAAIsU,GAAgBtU,EAAK,IACvB,GAAIoN,IAAa5e,KAAe+O,KAAOS,GACrC,OAAO,MAEJ,CACL,IAAIoQ,EAAQ,IAAIzC,GAChB,GAAIwC,EACF,IAAIpS,EAASoS,EAAWf,EAAUmH,EAAUhX,EAAKS,EAAQ1K,EAAQ8a,GAEnE,KAAMrS,IAAWvN,EACT0kB,GAAYqB,EAAUnH,EAAUje,EAAuBC,EAAwB+e,EAAYC,GAC3FrS,GAEN,OAAO,GAIb,OAAO,EAWT,SAASyY,GAAahZ,GACpB,IAAKmM,GAASnM,IAAUiZ,GAASjZ,GAC/B,OAAO,EAET,IAAIkZ,EAAUtD,GAAW5V,GAAS0H,GAAatO,GAC/C,OAAO8f,EAAQ9U,KAAK8G,GAASlL,IAU/B,SAASmZ,GAAanZ,GACpB,OAAO4L,GAAa5L,IAAUmW,GAAWnW,IAAU3J,GAUrD,SAAS+iB,GAAUpZ,GACjB,OAAO4L,GAAa5L,IAAUkT,GAAOlT,IAAU1J,GAUjD,SAAS+iB,GAAiBrZ,GACxB,OAAO4L,GAAa5L,IAClBsZ,GAAStZ,EAAMR,WAAa5C,GAAeuZ,GAAWnW,IAU1D,SAASuZ,GAAavZ,GAGpB,MAAoB,mBAATA,EACFA,EAEI,MAATA,EACKwZ,GAEW,iBAATxZ,EACF6L,GAAQ7L,GACXyZ,GAAoBzZ,EAAM,GAAIA,EAAM,IACpC0Z,GAAY1Z,GAEX2Z,GAAS3Z,GAUlB,SAAS4Z,GAASpX,GAChB,IAAKqX,GAAYrX,GACf,OAAOsH,GAAWtH,GAEpB,IAAIjC,EAAS,GACb,IAAK,IAAIwB,KAAOvE,GAAOgF,GACjBwE,GAAevH,KAAK+C,EAAQT,IAAe,eAAPA,GACtCxB,EAAOoE,KAAK5C,GAGhB,OAAOxB,EAUT,SAASuZ,GAAWtX,GAClB,IAAK2J,GAAS3J,GACZ,OAAOuX,GAAavX,GAEtB,IAAIwX,EAAUH,GAAYrX,GACtBjC,EAAS,GAEb,IAAK,IAAIwB,KAAOS,GACD,eAAPT,IAAyBiY,GAAYhT,GAAevH,KAAK+C,EAAQT,KACrExB,EAAOoE,KAAK5C,GAGhB,OAAOxB,EAYT,SAAS0Z,GAAOja,EAAOuW,GACrB,OAAOvW,EAAQuW,EAWjB,SAAS2D,GAAQrY,EAAYhC,GAC3B,IAAIE,GAAS,EACTQ,EAAS4Z,GAAYtY,GAAchB,EAAMgB,EAAWrC,QAAU,GAKlE,OAHAsS,GAASjQ,GAAY,SAAS7B,EAAO+B,EAAKF,GACxCtB,IAASR,GAASF,EAASG,EAAO+B,EAAKF,MAElCtB,EAUT,SAASmZ,GAAY5hB,GACnB,IAAI+gB,EAAYuB,GAAatiB,GAC7B,OAAwB,GAApB+gB,EAAUrZ,QAAeqZ,EAAU,GAAG,GACjCwB,GAAwBxB,EAAU,GAAG,GAAIA,EAAU,GAAG,IAExD,SAASrW,GACd,OAAOA,IAAW1K,GAAU8gB,GAAYpW,EAAQ1K,EAAQ+gB,IAY5D,SAASY,GAAoB3D,EAAMiD,GACjC,OAAIuB,GAAMxE,IAASyE,GAAmBxB,GAC7BsB,GAAwBrE,GAAMF,GAAOiD,GAEvC,SAASvW,GACd,IAAIoP,EAAWhC,GAAIpN,EAAQsT,GAC3B,OAAQlE,IAAa5e,GAAa4e,IAAamH,EAC3CyB,GAAMhY,EAAQsT,GACd4B,GAAYqB,EAAUnH,EAAUje,EAAuBC,IAe/D,SAAS6mB,GAAUjY,EAAQ1K,EAAQ4iB,EAAU/H,EAAYC,GACnDpQ,IAAW1K,GAGf0d,GAAQ1d,GAAQ,SAASihB,EAAUhX,GAEjC,GADA6Q,IAAUA,EAAQ,IAAIzC,IAClBhE,GAAS4M,GACX4B,GAAcnY,EAAQ1K,EAAQiK,EAAK2Y,EAAUD,GAAW9H,EAAYC,OAEjE,CACH,IAAIgI,EAAWjI,EACXA,EAAWkI,GAAQrY,EAAQT,GAAMgX,EAAWhX,EAAM,GAAKS,EAAQ1K,EAAQ8a,GACvE5f,EAEA4nB,IAAa5nB,IACf4nB,EAAW7B,GAEbvH,GAAiBhP,EAAQT,EAAK6Y,MAE/B1I,IAkBL,SAASyI,GAAcnY,EAAQ1K,EAAQiK,EAAK2Y,EAAUI,EAAWnI,EAAYC,GAC3E,IAAIhB,EAAWiJ,GAAQrY,EAAQT,GAC3BgX,EAAW8B,GAAQ/iB,EAAQiK,GAC3B0R,EAAUb,EAAMhD,IAAImJ,GAExB,GAAItF,EACFjC,GAAiBhP,EAAQT,EAAK0R,OADhC,CAIA,IAAImH,EAAWjI,EACXA,EAAWf,EAAUmH,EAAWhX,EAAM,GAAKS,EAAQ1K,EAAQ8a,GAC3D5f,EAEAohB,EAAWwG,IAAa5nB,EAE5B,GAAIohB,EAAU,CACZ,IAAI9G,EAAQzB,GAAQkN,GAChBjI,GAAUxD,GAAS5D,GAASqP,GAC5BgC,GAAWzN,IAAUwD,GAAU3R,GAAa4Z,GAEhD6B,EAAW7B,EACPzL,GAASwD,GAAUiK,EACjBlP,GAAQ+F,GACVgJ,EAAWhJ,EAEJoJ,GAAkBpJ,GACzBgJ,EAAW3N,GAAU2E,GAEdd,GACPsD,GAAW,EACXwG,EAAWxH,GAAY2F,GAAU,IAE1BgC,GACP3G,GAAW,EACXwG,EAAWK,GAAgBlC,GAAU,IAGrC6B,EAAW,GAGNM,GAAcnC,IAAalI,GAAYkI,IAC9C6B,EAAWhJ,EACPf,GAAYe,GACdgJ,EAAWO,GAAcvJ,GAEjBzF,GAASyF,KAAagE,GAAWhE,KACzCgJ,EAAWvH,GAAgB0F,KAI7B3E,GAAW,EAGXA,IAEFxB,EAAMvN,IAAI0T,EAAU6B,GACpBE,EAAUF,EAAU7B,EAAU2B,EAAU/H,EAAYC,GACpDA,EAAM,UAAUmG,IAElBvH,GAAiBhP,EAAQT,EAAK6Y,IAWhC,SAASQ,GAAQzb,EAAOqD,GACtB,IAAIxD,EAASG,EAAMH,OACnB,GAAKA,EAIL,OADAwD,GAAKA,EAAI,EAAIxD,EAAS,EACfyR,GAAQjO,EAAGxD,GAAUG,EAAMqD,GAAKhQ,EAYzC,SAASqoB,GAAYxZ,EAAYgM,EAAWyN,GAExCzN,EADEA,EAAUrO,OACAoB,GAASiN,GAAW,SAAShO,GACvC,OAAIgM,GAAQhM,GACH,SAASG,GACd,OAAO6V,GAAQ7V,EAA2B,IAApBH,EAASL,OAAeK,EAAS,GAAKA,IAGzDA,KAGG,CAAC2Z,IAGf,IAAIzZ,GAAS,EACb8N,EAAYjN,GAASiN,EAAW1K,GAAUoY,OAE1C,IAAIhb,EAAS2Z,GAAQrY,GAAY,SAAS7B,EAAO+B,EAAKF,GACpD,IAAI2Z,EAAW5a,GAASiN,GAAW,SAAShO,GAC1C,OAAOA,EAASG,MAElB,MAAO,CAAE,SAAYwb,EAAU,QAAWzb,EAAO,MAASC,MAG5D,OAAO2C,GAAWpC,GAAQ,SAASiC,EAAQ+T,GACzC,OAAOkF,GAAgBjZ,EAAQ+T,EAAO+E,MAa1C,SAASI,GAASlZ,EAAQ4P,GACxB,OAAOuJ,GAAWnZ,EAAQ4P,GAAO,SAASpS,EAAO8V,GAC/C,OAAO0E,GAAMhY,EAAQsT,MAazB,SAAS6F,GAAWnZ,EAAQ4P,EAAOhS,GACjC,IAAIL,GAAS,EACTP,EAAS4S,EAAM5S,OACfe,EAAS,GAEb,QAASR,EAAQP,EAAQ,CACvB,IAAIsW,EAAO1D,EAAMrS,GACbC,EAAQ6V,GAAQrT,EAAQsT,GAExB1V,EAAUJ,EAAO8V,IACnB8F,GAAQrb,EAAQwV,GAASD,EAAMtT,GAASxC,GAG5C,OAAOO,EAUT,SAASsb,GAAiB/F,GACxB,OAAO,SAAStT,GACd,OAAOqT,GAAQrT,EAAQsT,IAe3B,SAASgG,GAAYnc,EAAOoB,EAAQlB,EAAUc,GAC5C,IAAIob,EAAUpb,EAAa0B,GAAkB5B,GACzCV,GAAS,EACTP,EAASuB,EAAOvB,OAChB0X,EAAOvX,EAEPA,IAAUoB,IACZA,EAASkM,GAAUlM,IAEjBlB,IACFqX,EAAOtW,GAASjB,EAAOwD,GAAUtD,KAEnC,QAASE,EAAQP,EAAQ,CACvB,IAAIyC,EAAY,EACZjC,EAAQe,EAAOhB,GACfqO,EAAWvO,EAAWA,EAASG,GAASA,EAE5C,OAAQiC,EAAY8Z,EAAQ7E,EAAM9I,EAAUnM,EAAWtB,KAAgB,EACjEuW,IAASvX,GACX0I,GAAO5I,KAAKyX,EAAMjV,EAAW,GAE/BoG,GAAO5I,KAAKE,EAAOsC,EAAW,GAGlC,OAAOtC,EAYT,SAASqc,GAAWrc,EAAOsc,GACzB,IAAIzc,EAASG,EAAQsc,EAAQzc,OAAS,EAClCqG,EAAYrG,EAAS,EAEzB,MAAOA,IAAU,CACf,IAAIO,EAAQkc,EAAQzc,GACpB,GAAIA,GAAUqG,GAAa9F,IAAUmc,EAAU,CAC7C,IAAIA,EAAWnc,EACXkR,GAAQlR,GACVsI,GAAO5I,KAAKE,EAAOI,EAAO,GAE1Boc,GAAUxc,EAAOI,IAIvB,OAAOJ,EAYT,SAASwR,GAAWoB,EAAOC,GACzB,OAAOD,EAAQlJ,GAAYgB,MAAkBmI,EAAQD,EAAQ,IAc/D,SAAS6J,GAAUzO,EAAOC,EAAKyO,EAAMna,GACnC,IAAInC,GAAS,EACTP,EAASuK,GAAUZ,IAAYyE,EAAMD,IAAU0O,GAAQ,IAAK,GAC5D9b,EAASM,EAAMrB,GAEnB,MAAOA,IACLe,EAAO2B,EAAY1C,IAAWO,GAAS4N,EACvCA,GAAS0O,EAEX,OAAO9b,EAWT,SAAS+b,GAAW9a,EAAQwB,GAC1B,IAAIzC,EAAS,GACb,IAAKiB,GAAUwB,EAAI,GAAKA,EAAIjO,EAC1B,OAAOwL,EAIT,GACMyC,EAAI,IACNzC,GAAUiB,GAEZwB,EAAIqG,GAAYrG,EAAI,GAChBA,IACFxB,GAAUA,SAELwB,GAET,OAAOzC,EAWT,SAASgc,GAASld,EAAMsO,GACtB,OAAO6O,GAAYC,GAASpd,EAAMsO,EAAO6L,IAAWna,EAAO,IAU7D,SAASqd,GAAW7a,GAClB,OAAOqP,GAAYnQ,GAAOc,IAW5B,SAAS8a,GAAe9a,EAAYmB,GAClC,IAAIrD,EAAQoB,GAAOc,GACnB,OAAOwP,GAAY1R,EAAO2R,GAAUtO,EAAG,EAAGrD,EAAMH,SAalD,SAASoc,GAAQpZ,EAAQsT,EAAM9V,EAAO2S,GACpC,IAAKxG,GAAS3J,GACZ,OAAOA,EAETsT,EAAOC,GAASD,EAAMtT,GAEtB,IAAIzC,GAAS,EACTP,EAASsW,EAAKtW,OACdqG,EAAYrG,EAAS,EACrBod,EAASpa,EAEb,MAAiB,MAAVoa,KAAoB7c,EAAQP,EAAQ,CACzC,IAAIuC,EAAMiU,GAAMF,EAAK/V,IACjB6a,EAAW5a,EAEf,GAAY,cAAR+B,GAA+B,gBAARA,GAAiC,cAARA,EAClD,OAAOS,EAGT,GAAIzC,GAAS8F,EAAW,CACtB,IAAI+L,EAAWgL,EAAO7a,GACtB6Y,EAAWjI,EAAaA,EAAWf,EAAU7P,EAAK6a,GAAU5pB,EACxD4nB,IAAa5nB,IACf4nB,EAAWzO,GAASyF,GAChBA,EACCX,GAAQ6E,EAAK/V,EAAQ,IAAM,GAAK,IAGzC4R,GAAYiL,EAAQ7a,EAAK6Y,GACzBgC,EAASA,EAAO7a,GAElB,OAAOS,EAWT,IAAIqa,GAAe9R,GAAqB,SAAS1L,EAAMmF,GAErD,OADAuG,GAAQ1F,IAAIhG,EAAMmF,GACXnF,GAFoBma,GAazBsD,GAAmBnU,GAA4B,SAAStJ,EAAMmC,GAChE,OAAOmH,GAAetJ,EAAM,WAAY,CACtC,cAAgB,EAChB,YAAc,EACd,MAAS0d,GAASvb,GAClB,UAAY,KALwBgY,GAgBxC,SAASwD,GAAYnb,GACnB,OAAOwP,GAAYtQ,GAAOc,IAY5B,SAASob,GAAUtd,EAAOgO,EAAOC,GAC/B,IAAI7N,GAAS,EACTP,EAASG,EAAMH,OAEfmO,EAAQ,IACVA,GAASA,EAAQnO,EAAS,EAAKA,EAASmO,GAE1CC,EAAMA,EAAMpO,EAASA,EAASoO,EAC1BA,EAAM,IACRA,GAAOpO,GAETA,EAASmO,EAAQC,EAAM,EAAMA,EAAMD,IAAW,EAC9CA,KAAW,EAEX,IAAIpN,EAASM,EAAMrB,GACnB,QAASO,EAAQP,EACfe,EAAOR,GAASJ,EAAMI,EAAQ4N,GAEhC,OAAOpN,EAYT,SAAS2c,GAASrb,EAAYzB,GAC5B,IAAIG,EAMJ,OAJAuR,GAASjQ,GAAY,SAAS7B,EAAOD,EAAO8B,GAE1C,OADAtB,EAASH,EAAUJ,EAAOD,EAAO8B,IACzBtB,OAEDA,EAeX,SAAS4c,GAAgBxd,EAAOK,EAAOod,GACrC,IAAIC,EAAM,EACNC,EAAgB,MAAT3d,EAAgB0d,EAAM1d,EAAMH,OAEvC,GAAoB,iBAATQ,GAAqBA,IAAUA,GAASsd,GAAQloB,EAAuB,CAChF,MAAOioB,EAAMC,EAAM,CACjB,IAAIC,EAAOF,EAAMC,IAAU,EACvBlP,EAAWzO,EAAM4d,GAEJ,OAAbnP,IAAsB2G,GAAS3G,KAC9BgP,EAAchP,GAAYpO,EAAUoO,EAAWpO,GAClDqd,EAAME,EAAM,EAEZD,EAAOC,EAGX,OAAOD,EAET,OAAOE,GAAkB7d,EAAOK,EAAOwZ,GAAU4D,GAgBnD,SAASI,GAAkB7d,EAAOK,EAAOH,EAAUud,GACjD,IAAIC,EAAM,EACNC,EAAgB,MAAT3d,EAAgB,EAAIA,EAAMH,OACrC,GAAa,IAAT8d,EACF,OAAO,EAGTtd,EAAQH,EAASG,GACjB,IAAIyd,EAAWzd,IAAUA,EACrB0d,EAAsB,OAAV1d,EACZ2d,EAAc5I,GAAS/U,GACvB4d,EAAiB5d,IAAUhN,EAE/B,MAAOqqB,EAAMC,EAAM,CACjB,IAAIC,EAAMlU,IAAagU,EAAMC,GAAQ,GACjClP,EAAWvO,EAASF,EAAM4d,IAC1BM,EAAezP,IAAapb,EAC5B8qB,EAAyB,OAAb1P,EACZ2P,EAAiB3P,IAAaA,EAC9B4P,EAAcjJ,GAAS3G,GAE3B,GAAIqP,EACF,IAAIQ,EAASb,GAAcW,OAE3BE,EADSL,EACAG,IAAmBX,GAAcS,GACjCH,EACAK,GAAkBF,IAAiBT,IAAeU,GAClDH,EACAI,GAAkBF,IAAiBC,IAAcV,IAAeY,IAChEF,IAAaE,IAGbZ,EAAchP,GAAYpO,EAAUoO,EAAWpO,GAEtDie,EACFZ,EAAME,EAAM,EAEZD,EAAOC,EAGX,OAAOtT,GAAUqT,EAAMnoB,GAYzB,SAAS+oB,GAAeve,EAAOE,GAC7B,IAAIE,GAAS,EACTP,EAASG,EAAMH,OACfc,EAAW,EACXC,EAAS,GAEb,QAASR,EAAQP,EAAQ,CACvB,IAAIQ,EAAQL,EAAMI,GACdqO,EAAWvO,EAAWA,EAASG,GAASA,EAE5C,IAAKD,IAAU0R,GAAGrD,EAAU8I,GAAO,CACjC,IAAIA,EAAO9I,EACX7N,EAAOD,KAAwB,IAAVN,EAAc,EAAIA,GAG3C,OAAOO,EAWT,SAAS4d,GAAane,GACpB,MAAoB,iBAATA,EACFA,EAEL+U,GAAS/U,GACJ/K,GAED+K,EAWV,SAASoe,GAAape,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAI6L,GAAQ7L,GAEV,OAAOY,GAASZ,EAAOoe,IAAgB,GAEzC,GAAIrJ,GAAS/U,GACX,OAAO0L,GAAiBA,GAAejM,KAAKO,GAAS,GAEvD,IAAIO,EAAUP,EAAQ,GACtB,MAAkB,KAAVO,GAAkB,EAAIP,IAAWlL,EAAY,KAAOyL,EAY9D,SAAS8d,GAAS1e,EAAOE,EAAUc,GACjC,IAAIZ,GAAS,EACToU,EAAW3T,GACXhB,EAASG,EAAMH,OACf4U,GAAW,EACX7T,EAAS,GACT2W,EAAO3W,EAEX,GAAII,EACFyT,GAAW,EACXD,EAAWzT,QAER,GAAIlB,GAAUtM,EAAkB,CACnC,IAAImS,EAAMxF,EAAW,KAAOye,GAAU3e,GACtC,GAAI0F,EACF,OAAOD,GAAWC,GAEpB+O,GAAW,EACXD,EAAW9Q,GACX6T,EAAO,IAAInH,QAGXmH,EAAOrX,EAAW,GAAKU,EAEzB0N,EACA,QAASlO,EAAQP,EAAQ,CACvB,IAAIQ,EAAQL,EAAMI,GACdqO,EAAWvO,EAAWA,EAASG,GAASA,EAG5C,GADAA,EAASW,GAAwB,IAAVX,EAAeA,EAAQ,EAC1CoU,GAAYhG,IAAaA,EAAU,CACrC,IAAImQ,EAAYrH,EAAK1X,OACrB,MAAO+e,IACL,GAAIrH,EAAKqH,KAAenQ,EACtB,SAASH,EAGTpO,GACFqX,EAAKvS,KAAKyJ,GAEZ7N,EAAOoE,KAAK3E,QAEJmU,EAAS+C,EAAM9I,EAAUzN,KAC7BuW,IAAS3W,GACX2W,EAAKvS,KAAKyJ,GAEZ7N,EAAOoE,KAAK3E,IAGhB,OAAOO,EAWT,SAAS4b,GAAU3Z,EAAQsT,GAGzB,OAFAA,EAAOC,GAASD,EAAMtT,GACtBA,EAAS6U,GAAO7U,EAAQsT,GACP,MAAVtT,UAAyBA,EAAOwT,GAAMsB,GAAKxB,KAapD,SAAS0I,GAAWhc,EAAQsT,EAAM2I,EAAS9L,GACzC,OAAOiJ,GAAQpZ,EAAQsT,EAAM2I,EAAQ5I,GAAQrT,EAAQsT,IAAQnD,GAc/D,SAAS+L,GAAU/e,EAAOS,EAAWue,EAAQzc,GAC3C,IAAI1C,EAASG,EAAMH,OACfO,EAAQmC,EAAY1C,GAAU,EAElC,OAAQ0C,EAAYnC,MAAYA,EAAQP,IACtCY,EAAUT,EAAMI,GAAQA,EAAOJ,IAEjC,OAAOgf,EACH1B,GAAUtd,EAAQuC,EAAY,EAAInC,EAASmC,EAAYnC,EAAQ,EAAIP,GACnEyd,GAAUtd,EAAQuC,EAAYnC,EAAQ,EAAI,EAAKmC,EAAY1C,EAASO,GAa1E,SAASiO,GAAiBhO,EAAO4e,GAC/B,IAAIre,EAASP,EAIb,OAHIO,aAAkBuL,KACpBvL,EAASA,EAAOP,SAEXiB,GAAY2d,GAAS,SAASre,EAAQse,GAC3C,OAAOA,EAAOxf,KAAKD,MAAMyf,EAAOvf,QAASwB,GAAU,CAACP,GAASse,EAAOtf,SACnEgB,GAaL,SAASue,GAAQlI,EAAQ/W,EAAUc,GACjC,IAAInB,EAASoX,EAAOpX,OACpB,GAAIA,EAAS,EACX,OAAOA,EAAS6e,GAASzH,EAAO,IAAM,GAExC,IAAI7W,GAAS,EACTQ,EAASM,EAAMrB,GAEnB,QAASO,EAAQP,EAAQ,CACvB,IAAIG,EAAQiX,EAAO7W,GACf+W,GAAY,EAEhB,QAASA,EAAWtX,EACdsX,GAAY/W,IACdQ,EAAOR,GAASmU,GAAe3T,EAAOR,IAAUJ,EAAOiX,EAAOE,GAAWjX,EAAUc,IAIzF,OAAO0d,GAASjJ,GAAY7U,EAAQ,GAAIV,EAAUc,GAYpD,SAASoe,GAAc7b,EAAOnC,EAAQie,GACpC,IAAIjf,GAAS,EACTP,EAAS0D,EAAM1D,OACfyf,EAAale,EAAOvB,OACpBe,EAAS,GAEb,QAASR,EAAQP,EAAQ,CACvB,IAAIQ,EAAQD,EAAQkf,EAAale,EAAOhB,GAAS/M,EACjDgsB,EAAWze,EAAQ2C,EAAMnD,GAAQC,GAEnC,OAAOO,EAUT,SAAS2e,GAAoBlf,GAC3B,OAAOgb,GAAkBhb,GAASA,EAAQ,GAU5C,SAASmf,GAAanf,GACpB,MAAuB,mBAATA,EAAsBA,EAAQwZ,GAW9C,SAASzD,GAAS/V,EAAOwC,GACvB,OAAIqJ,GAAQ7L,GACHA,EAEFsa,GAAMta,EAAOwC,GAAU,CAACxC,GAASof,GAAarY,GAAS/G,IAYhE,IAAIqf,GAAW9C,GAWf,SAAS+C,GAAU3f,EAAOgO,EAAOC,GAC/B,IAAIpO,EAASG,EAAMH,OAEnB,OADAoO,EAAMA,IAAQ5a,EAAYwM,EAASoO,GAC1BD,GAASC,GAAOpO,EAAUG,EAAQsd,GAAUtd,EAAOgO,EAAOC,GASrE,IAAI9E,GAAeD,IAAmB,SAAS0W,GAC7C,OAAO5hB,GAAKmL,aAAayW,IAW3B,SAASnM,GAAYoM,EAAQ3M,GAC3B,GAAIA,EACF,OAAO2M,EAAOC,QAEhB,IAAIjgB,EAASggB,EAAOhgB,OAChBe,EAASwH,GAAcA,GAAYvI,GAAU,IAAIggB,EAAOhL,YAAYhV,GAGxE,OADAggB,EAAOE,KAAKnf,GACLA,EAUT,SAASof,GAAiBC,GACxB,IAAIrf,EAAS,IAAIqf,EAAYpL,YAAYoL,EAAYC,YAErD,OADA,IAAI/X,GAAWvH,GAAQ8E,IAAI,IAAIyC,GAAW8X,IACnCrf,EAWT,SAASuf,GAAcC,EAAUlN,GAC/B,IAAI2M,EAAS3M,EAAS8M,GAAiBI,EAASP,QAAUO,EAASP,OACnE,OAAO,IAAIO,EAASvL,YAAYgL,EAAQO,EAASC,WAAYD,EAASF,YAUxE,SAASI,GAAYC,GACnB,IAAI3f,EAAS,IAAI2f,EAAO1L,YAAY0L,EAAOpoB,OAAQmB,GAAQmO,KAAK8Y,IAEhE,OADA3f,EAAOsF,UAAYqa,EAAOra,UACnBtF,EAUT,SAAS4f,GAAYC,GACnB,OAAO5U,GAAgBhO,GAAOgO,GAAc/L,KAAK2gB,IAAW,GAW9D,SAASnF,GAAgBoF,EAAYxN,GACnC,IAAI2M,EAAS3M,EAAS8M,GAAiBU,EAAWb,QAAUa,EAAWb,OACvE,OAAO,IAAIa,EAAW7L,YAAYgL,EAAQa,EAAWL,WAAYK,EAAW7gB,QAW9E,SAAS8gB,GAAiBtgB,EAAOuW,GAC/B,GAAIvW,IAAUuW,EAAO,CACnB,IAAIgK,EAAevgB,IAAUhN,EACzB0qB,EAAsB,OAAV1d,EACZwgB,EAAiBxgB,IAAUA,EAC3B2d,EAAc5I,GAAS/U,GAEvB6d,EAAetH,IAAUvjB,EACzB8qB,EAAsB,OAAVvH,EACZwH,EAAiBxH,IAAUA,EAC3ByH,EAAcjJ,GAASwB,GAE3B,IAAMuH,IAAcE,IAAgBL,GAAe3d,EAAQuW,GACtDoH,GAAeE,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5BwC,GAAgBxC,IACjByC,EACH,OAAO,EAET,IAAM9C,IAAcC,IAAgBK,GAAehe,EAAQuW,GACtDyH,GAAeuC,GAAgBC,IAAmB9C,IAAcC,GAChEG,GAAayC,GAAgBC,IAC5B3C,GAAgB2C,IACjBzC,EACH,OAAQ,EAGZ,OAAO,EAiBT,SAAStC,GAAgBjZ,EAAQ+T,EAAO+E,GACtC,IAAIvb,GAAS,EACT0gB,EAAcje,EAAOgZ,SACrBkF,EAAcnK,EAAMiF,SACpBhc,EAASihB,EAAYjhB,OACrBmhB,EAAerF,EAAO9b,OAE1B,QAASO,EAAQP,EAAQ,CACvB,IAAIe,EAAS+f,GAAiBG,EAAY1gB,GAAQ2gB,EAAY3gB,IAC9D,GAAIQ,EAAQ,CACV,GAAIR,GAAS4gB,EACX,OAAOpgB,EAET,IAAIqgB,EAAQtF,EAAOvb,GACnB,OAAOQ,GAAmB,QAATqgB,GAAmB,EAAI,IAU5C,OAAOpe,EAAOzC,MAAQwW,EAAMxW,MAc9B,SAAS8gB,GAAYthB,EAAMuhB,EAAUC,EAASC,GAC5C,IAAIC,GAAa,EACbC,EAAa3hB,EAAKC,OAClB2hB,EAAgBJ,EAAQvhB,OACxB4hB,GAAa,EACbC,EAAaP,EAASthB,OACtB8hB,EAAcvX,GAAUmX,EAAaC,EAAe,GACpD5gB,EAASM,EAAMwgB,EAAaC,GAC5BC,GAAeP,EAEnB,QAASI,EAAYC,EACnB9gB,EAAO6gB,GAAaN,EAASM,GAE/B,QAASH,EAAYE,GACfI,GAAeN,EAAYC,KAC7B3gB,EAAOwgB,EAAQE,IAAc1hB,EAAK0hB,IAGtC,MAAOK,IACL/gB,EAAO6gB,KAAe7hB,EAAK0hB,KAE7B,OAAO1gB,EAcT,SAASihB,GAAiBjiB,EAAMuhB,EAAUC,EAASC,GACjD,IAAIC,GAAa,EACbC,EAAa3hB,EAAKC,OAClBiiB,GAAgB,EAChBN,EAAgBJ,EAAQvhB,OACxBkiB,GAAc,EACdC,EAAcb,EAASthB,OACvB8hB,EAAcvX,GAAUmX,EAAaC,EAAe,GACpD5gB,EAASM,EAAMygB,EAAcK,GAC7BJ,GAAeP,EAEnB,QAASC,EAAYK,EACnB/gB,EAAO0gB,GAAa1hB,EAAK0hB,GAE3B,IAAIjgB,EAASigB,EACb,QAASS,EAAaC,EACpBphB,EAAOS,EAAS0gB,GAAcZ,EAASY,GAEzC,QAASD,EAAeN,GAClBI,GAAeN,EAAYC,KAC7B3gB,EAAOS,EAAS+f,EAAQU,IAAiBliB,EAAK0hB,MAGlD,OAAO1gB,EAWT,SAAS0M,GAAUnV,EAAQ6H,GACzB,IAAII,GAAS,EACTP,EAAS1H,EAAO0H,OAEpBG,IAAUA,EAAQkB,EAAMrB,IACxB,QAASO,EAAQP,EACfG,EAAMI,GAASjI,EAAOiI,GAExB,OAAOJ,EAaT,SAASqS,GAAWla,EAAQoL,EAAOV,EAAQmQ,GACzC,IAAIiP,GAASpf,EACbA,IAAWA,EAAS,IAEpB,IAAIzC,GAAS,EACTP,EAAS0D,EAAM1D,OAEnB,QAASO,EAAQP,EAAQ,CACvB,IAAIuC,EAAMmB,EAAMnD,GAEZ6a,EAAWjI,EACXA,EAAWnQ,EAAOT,GAAMjK,EAAOiK,GAAMA,EAAKS,EAAQ1K,GAClD9E,EAEA4nB,IAAa5nB,IACf4nB,EAAW9iB,EAAOiK,IAEhB6f,EACFlQ,GAAgBlP,EAAQT,EAAK6Y,GAE7BjJ,GAAYnP,EAAQT,EAAK6Y,GAG7B,OAAOpY,EAWT,SAAS+Q,GAAYzb,EAAQ0K,GAC3B,OAAOwP,GAAWla,EAAQ+pB,GAAW/pB,GAAS0K,GAWhD,SAAS8Q,GAAcxb,EAAQ0K,GAC7B,OAAOwP,GAAWla,EAAQgqB,GAAahqB,GAAS0K,GAWlD,SAASuf,GAAiBniB,EAAQoiB,GAChC,OAAO,SAASngB,EAAYhC,GAC1B,IAAIR,EAAOwM,GAAQhK,GAAcnC,GAAkBmS,GAC/C/R,EAAckiB,EAAcA,IAAgB,GAEhD,OAAO3iB,EAAKwC,EAAYjC,EAAQ2b,GAAY1b,EAAU,GAAIC,IAW9D,SAASmiB,GAAeC,GACtB,OAAO3F,IAAS,SAAS/Z,EAAQ2f,GAC/B,IAAIpiB,GAAS,EACTP,EAAS2iB,EAAQ3iB,OACjBmT,EAAanT,EAAS,EAAI2iB,EAAQ3iB,EAAS,GAAKxM,EAChDovB,EAAQ5iB,EAAS,EAAI2iB,EAAQ,GAAKnvB,EAEtC2f,EAAcuP,EAAS1iB,OAAS,GAA0B,mBAAdmT,GACvCnT,IAAUmT,GACX3f,EAEAovB,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClDzP,EAAanT,EAAS,EAAIxM,EAAY2f,EACtCnT,EAAS,GAEXgD,EAAShF,GAAOgF,GAChB,QAASzC,EAAQP,EAAQ,CACvB,IAAI1H,EAASqqB,EAAQpiB,GACjBjI,GACFoqB,EAAS1f,EAAQ1K,EAAQiI,EAAO4S,GAGpC,OAAOnQ,KAYX,SAASiS,GAAe3S,EAAUI,GAChC,OAAO,SAASL,EAAYhC,GAC1B,GAAkB,MAAdgC,EACF,OAAOA,EAET,IAAKsY,GAAYtY,GACf,OAAOC,EAASD,EAAYhC,GAE9B,IAAIL,EAASqC,EAAWrC,OACpBO,EAAQmC,EAAY1C,GAAU,EAC9B8iB,EAAW9kB,GAAOqE,GAEtB,MAAQK,EAAYnC,MAAYA,EAAQP,EACtC,IAAmD,IAA/CK,EAASyiB,EAASviB,GAAQA,EAAOuiB,GACnC,MAGJ,OAAOzgB,GAWX,SAAS4T,GAAcvT,GACrB,OAAO,SAASM,EAAQ3C,EAAU8T,GAChC,IAAI5T,GAAS,EACTuiB,EAAW9kB,GAAOgF,GAClBU,EAAQyQ,EAASnR,GACjBhD,EAAS0D,EAAM1D,OAEnB,MAAOA,IAAU,CACf,IAAIuC,EAAMmB,EAAMhB,EAAY1C,IAAWO,GACvC,IAA+C,IAA3CF,EAASyiB,EAASvgB,GAAMA,EAAKugB,GAC/B,MAGJ,OAAO9f,GAcX,SAAS+f,GAAWljB,EAAMqT,EAASpT,GACjC,IAAIkjB,EAAS9P,EAAU7e,EACnB4uB,EAAOC,GAAWrjB,GAEtB,SAASsjB,IACP,IAAIC,EAAMvwB,MAAQA,OAASsL,IAAQtL,gBAAgBswB,EAAWF,EAAOpjB,EACrE,OAAOujB,EAAGxjB,MAAMojB,EAASljB,EAAUjN,KAAMwwB,WAE3C,OAAOF,EAUT,SAASG,GAAgBC,GACvB,OAAO,SAASvhB,GACdA,EAASuF,GAASvF,GAElB,IAAIiC,EAAaU,GAAW3C,GACxBkE,GAAclE,GACdxO,EAEAiR,EAAMR,EACNA,EAAW,GACXjC,EAAOwhB,OAAO,GAEdC,EAAWxf,EACX6b,GAAU7b,EAAY,GAAG3H,KAAK,IAC9B0F,EAAOie,MAAM,GAEjB,OAAOxb,EAAI8e,KAAgBE,GAW/B,SAASC,GAAiBC,GACxB,OAAO,SAAS3hB,GACd,OAAOP,GAAYmiB,GAAMC,GAAO7hB,GAAQmG,QAAQvL,GAAQ,KAAM+mB,EAAU,KAY5E,SAAST,GAAWD,GAClB,OAAO,WAIL,IAAIljB,EAAOsjB,UACX,OAAQtjB,EAAKC,QACX,KAAK,EAAG,OAAO,IAAIijB,EACnB,KAAK,EAAG,OAAO,IAAIA,EAAKljB,EAAK,IAC7B,KAAK,EAAG,OAAO,IAAIkjB,EAAKljB,EAAK,GAAIA,EAAK,IACtC,KAAK,EAAG,OAAO,IAAIkjB,EAAKljB,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC/C,KAAK,EAAG,OAAO,IAAIkjB,EAAKljB,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACxD,KAAK,EAAG,OAAO,IAAIkjB,EAAKljB,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACjE,KAAK,EAAG,OAAO,IAAIkjB,EAAKljB,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC1E,KAAK,EAAG,OAAO,IAAIkjB,EAAKljB,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAErF,IAAI+jB,EAAcrX,GAAWwW,EAAK/b,WAC9BnG,EAASkiB,EAAKrjB,MAAMkkB,EAAa/jB,GAIrC,OAAO4M,GAAS5L,GAAUA,EAAS+iB,GAavC,SAASC,GAAYlkB,EAAMqT,EAAS8Q,GAClC,IAAIf,EAAOC,GAAWrjB,GAEtB,SAASsjB,IACP,IAAInjB,EAASqjB,UAAUrjB,OACnBD,EAAOsB,EAAMrB,GACbO,EAAQP,EACRqE,EAAc4f,GAAUd,GAE5B,MAAO5iB,IACLR,EAAKQ,GAAS8iB,UAAU9iB,GAE1B,IAAIghB,EAAWvhB,EAAS,GAAKD,EAAK,KAAOsE,GAAetE,EAAKC,EAAS,KAAOqE,EACzE,GACAsB,GAAe5F,EAAMsE,GAGzB,GADArE,GAAUuhB,EAAQvhB,OACdA,EAASgkB,EACX,OAAOE,GACLrkB,EAAMqT,EAASiR,GAAchB,EAAQ9e,YAAa7Q,EAClDuM,EAAMwhB,EAAS/tB,EAAWA,EAAWwwB,EAAQhkB,GAEjD,IAAIojB,EAAMvwB,MAAQA,OAASsL,IAAQtL,gBAAgBswB,EAAWF,EAAOpjB,EACrE,OAAOD,GAAMwjB,EAAIvwB,KAAMkN,GAEzB,OAAOojB,EAUT,SAASiB,GAAWC,GAClB,OAAO,SAAShiB,EAAYzB,EAAW6B,GACrC,IAAIqgB,EAAW9kB,GAAOqE,GACtB,IAAKsY,GAAYtY,GAAa,CAC5B,IAAIhC,EAAW0b,GAAYnb,EAAW,GACtCyB,EAAawF,GAAKxF,GAClBzB,EAAY,SAAS2B,GAAO,OAAOlC,EAASyiB,EAASvgB,GAAMA,EAAKugB,IAElE,IAAIviB,EAAQ8jB,EAAchiB,EAAYzB,EAAW6B,GACjD,OAAOlC,GAAS,EAAIuiB,EAASziB,EAAWgC,EAAW9B,GAASA,GAAS/M,GAWzE,SAAS8wB,GAAW5hB,GAClB,OAAO6hB,IAAS,SAASC,GACvB,IAAIxkB,EAASwkB,EAAMxkB,OACfO,EAAQP,EACRykB,EAASlY,GAAcrF,UAAUwd,KAEjChiB,GACF8hB,EAAMxZ,UAER,MAAOzK,IAAS,CACd,IAAIV,EAAO2kB,EAAMjkB,GACjB,GAAmB,mBAARV,EACT,MAAM,IAAImH,GAAUpT,GAEtB,GAAI6wB,IAAWtB,GAAgC,WAArBwB,GAAY9kB,GACpC,IAAIsjB,EAAU,IAAI5W,GAAc,IAAI,GAGxChM,EAAQ4iB,EAAU5iB,EAAQP,EAC1B,QAASO,EAAQP,EAAQ,CACvBH,EAAO2kB,EAAMjkB,GAEb,IAAIqkB,EAAWD,GAAY9kB,GACvBmF,EAAmB,WAAZ4f,EAAwBC,GAAQhlB,GAAQrM,EAMjD2vB,EAJEne,GAAQ8f,GAAW9f,EAAK,KACtBA,EAAK,KAAOpQ,EAAgBJ,EAAkBE,EAAoBG,KACjEmQ,EAAK,GAAGhF,QAAqB,GAAXgF,EAAK,GAElBme,EAAQwB,GAAY3f,EAAK,KAAKpF,MAAMujB,EAASne,EAAK,IAElC,GAAfnF,EAAKG,QAAe8kB,GAAWjlB,GACtCsjB,EAAQyB,KACRzB,EAAQuB,KAAK7kB,GAGrB,OAAO,WACL,IAAIE,EAAOsjB,UACP7iB,EAAQT,EAAK,GAEjB,GAAIojB,GAA0B,GAAfpjB,EAAKC,QAAeqM,GAAQ7L,GACzC,OAAO2iB,EAAQ4B,MAAMvkB,GAAOA,QAE9B,IAAID,EAAQ,EACRQ,EAASf,EAASwkB,EAAMjkB,GAAOX,MAAM/M,KAAMkN,GAAQS,EAEvD,QAASD,EAAQP,EACfe,EAASyjB,EAAMjkB,GAAON,KAAKpN,KAAMkO,GAEnC,OAAOA,MAwBb,SAASojB,GAAatkB,EAAMqT,EAASpT,EAASwhB,EAAUC,EAASyD,EAAeC,EAAcC,EAAQC,EAAKnB,GACzG,IAAIoB,EAAQlS,EAAUte,EAClBouB,EAAS9P,EAAU7e,EACnBgxB,EAAYnS,EAAU5e,EACtBktB,EAAYtO,GAAW1e,EAAkBC,GACzC6wB,EAASpS,EAAUpe,EACnBmuB,EAAOoC,EAAY7xB,EAAY0vB,GAAWrjB,GAE9C,SAASsjB,IACP,IAAInjB,EAASqjB,UAAUrjB,OACnBD,EAAOsB,EAAMrB,GACbO,EAAQP,EAEZ,MAAOO,IACLR,EAAKQ,GAAS8iB,UAAU9iB,GAE1B,GAAIihB,EACF,IAAInd,EAAc4f,GAAUd,GACxBoC,EAAenhB,GAAarE,EAAMsE,GASxC,GAPIid,IACFvhB,EAAOshB,GAAYthB,EAAMuhB,EAAUC,EAASC,IAE1CwD,IACFjlB,EAAOiiB,GAAiBjiB,EAAMilB,EAAeC,EAAczD,IAE7DxhB,GAAUulB,EACN/D,GAAaxhB,EAASgkB,EAAO,CAC/B,IAAIwB,EAAa7f,GAAe5F,EAAMsE,GACtC,OAAO6f,GACLrkB,EAAMqT,EAASiR,GAAchB,EAAQ9e,YAAavE,EAClDC,EAAMylB,EAAYN,EAAQC,EAAKnB,EAAQhkB,GAG3C,IAAI8jB,EAAcd,EAASljB,EAAUjN,KACjCuwB,EAAKiC,EAAYvB,EAAYjkB,GAAQA,EAczC,OAZAG,EAASD,EAAKC,OACVklB,EACFnlB,EAAO0lB,GAAQ1lB,EAAMmlB,GACZI,GAAUtlB,EAAS,GAC5BD,EAAKiL,UAEHoa,GAASD,EAAMnlB,IACjBD,EAAKC,OAASmlB,GAEZtyB,MAAQA,OAASsL,IAAQtL,gBAAgBswB,IAC3CC,EAAKH,GAAQC,GAAWE,IAEnBA,EAAGxjB,MAAMkkB,EAAa/jB,GAE/B,OAAOojB,EAWT,SAASuC,GAAetlB,EAAQulB,GAC9B,OAAO,SAAS3iB,EAAQ3C,GACtB,OAAOsX,GAAa3U,EAAQ5C,EAAQulB,EAAWtlB,GAAW,KAY9D,SAASulB,GAAoBC,EAAUC,GACrC,OAAO,SAAStlB,EAAOuW,GACrB,IAAIhW,EACJ,GAAIP,IAAUhN,GAAaujB,IAAUvjB,EACnC,OAAOsyB,EAKT,GAHItlB,IAAUhN,IACZuN,EAASP,GAEPuW,IAAUvjB,EAAW,CACvB,GAAIuN,IAAWvN,EACb,OAAOujB,EAEW,iBAATvW,GAAqC,iBAATuW,GACrCvW,EAAQoe,GAAape,GACrBuW,EAAQ6H,GAAa7H,KAErBvW,EAAQme,GAAane,GACrBuW,EAAQ4H,GAAa5H,IAEvBhW,EAAS8kB,EAASrlB,EAAOuW,GAE3B,OAAOhW,GAWX,SAASglB,GAAWC,GAClB,OAAOzB,IAAS,SAASlW,GAEvB,OADAA,EAAYjN,GAASiN,EAAW1K,GAAUoY,OACnCgB,IAAS,SAAShd,GACvB,IAAID,EAAUjN,KACd,OAAOmzB,EAAU3X,GAAW,SAAShO,GACnC,OAAOT,GAAMS,EAAUP,EAASC,YAexC,SAASkmB,GAAcjmB,EAAQkmB,GAC7BA,EAAQA,IAAU1yB,EAAY,IAAMorB,GAAasH,GAEjD,IAAIC,EAAcD,EAAMlmB,OACxB,GAAImmB,EAAc,EAChB,OAAOA,EAAcrJ,GAAWoJ,EAAOlmB,GAAUkmB,EAEnD,IAAInlB,EAAS+b,GAAWoJ,EAAOvc,GAAW3J,EAASgG,GAAWkgB,KAC9D,OAAOvhB,GAAWuhB,GACdpG,GAAU5Z,GAAcnF,GAAS,EAAGf,GAAQ1D,KAAK,IACjDyE,EAAOkf,MAAM,EAAGjgB,GAetB,SAASomB,GAAcvmB,EAAMqT,EAASpT,EAASwhB,GAC7C,IAAI0B,EAAS9P,EAAU7e,EACnB4uB,EAAOC,GAAWrjB,GAEtB,SAASsjB,IACP,IAAI1B,GAAa,EACbC,EAAa2B,UAAUrjB,OACvB4hB,GAAa,EACbC,EAAaP,EAASthB,OACtBD,EAAOsB,EAAMwgB,EAAaH,GAC1B0B,EAAMvwB,MAAQA,OAASsL,IAAQtL,gBAAgBswB,EAAWF,EAAOpjB,EAErE,QAAS+hB,EAAYC,EACnB9hB,EAAK6hB,GAAaN,EAASM,GAE7B,MAAOF,IACL3hB,EAAK6hB,KAAeyB,YAAY5B,GAElC,OAAO7hB,GAAMwjB,EAAIJ,EAASljB,EAAUjN,KAAMkN,GAE5C,OAAOojB,EAUT,SAASkD,GAAY3jB,GACnB,OAAO,SAASyL,EAAOC,EAAKyO,GAa1B,OAZIA,GAAuB,iBAARA,GAAoBgG,GAAe1U,EAAOC,EAAKyO,KAChEzO,EAAMyO,EAAOrpB,GAGf2a,EAAQmY,GAASnY,GACbC,IAAQ5a,GACV4a,EAAMD,EACNA,EAAQ,GAERC,EAAMkY,GAASlY,GAEjByO,EAAOA,IAASrpB,EAAa2a,EAAQC,EAAM,GAAK,EAAKkY,GAASzJ,GACvDD,GAAUzO,EAAOC,EAAKyO,EAAMna,IAWvC,SAAS6jB,GAA0BV,GACjC,OAAO,SAASrlB,EAAOuW,GAKrB,MAJsB,iBAATvW,GAAqC,iBAATuW,IACvCvW,EAAQgmB,GAAShmB,GACjBuW,EAAQyP,GAASzP,IAEZ8O,EAASrlB,EAAOuW,IAqB3B,SAASmN,GAAcrkB,EAAMqT,EAASuT,EAAUpiB,EAAavE,EAASwhB,EAAUC,EAAS2D,EAAQC,EAAKnB,GACpG,IAAI0C,EAAUxT,EAAU1e,EACpBgxB,EAAakB,EAAUnF,EAAU/tB,EACjCmzB,EAAkBD,EAAUlzB,EAAY+tB,EACxCqF,EAAcF,EAAUpF,EAAW9tB,EACnCqzB,EAAmBH,EAAUlzB,EAAY8tB,EAE7CpO,GAAYwT,EAAUhyB,EAAoBC,EAC1Cue,KAAawT,EAAU/xB,EAA0BD,GAE3Cwe,EAAU3e,IACd2e,KAAa7e,EAAiBC,IAEhC,IAAIwyB,EAAU,CACZjnB,EAAMqT,EAASpT,EAAS8mB,EAAapB,EAAYqB,EACjDF,EAAiBzB,EAAQC,EAAKnB,GAG5BjjB,EAAS0lB,EAAS7mB,MAAMpM,EAAWszB,GAKvC,OAJIhC,GAAWjlB,IACbknB,GAAQhmB,EAAQ+lB,GAElB/lB,EAAOsD,YAAcA,EACd2iB,GAAgBjmB,EAAQlB,EAAMqT,GAUvC,SAAS+T,GAAY1D,GACnB,IAAI1jB,EAAOiH,GAAKyc,GAChB,OAAO,SAASzQ,EAAQoU,GAGtB,GAFApU,EAAS0T,GAAS1T,GAClBoU,EAAyB,MAAbA,EAAoB,EAAIzc,GAAUgL,GAAUyR,GAAY,KAChEA,GAAa/c,GAAe2I,GAAS,CAGvC,IAAIqU,GAAQ5f,GAASuL,GAAU,KAAK7Q,MAAM,KACtCzB,EAAQX,EAAKsnB,EAAK,GAAK,MAAQA,EAAK,GAAKD,IAG7C,OADAC,GAAQ5f,GAAS/G,GAAS,KAAKyB,MAAM,OAC5BklB,EAAK,GAAK,MAAQA,EAAK,GAAKD,IAEvC,OAAOrnB,EAAKiT,IAWhB,IAAIgM,GAAc1T,IAAQ,EAAIxF,GAAW,IAAIwF,GAAI,CAAC,EAAE,KAAK,IAAO9V,EAAmB,SAASiM,GAC1F,OAAO,IAAI6J,GAAI7J,IAD2D6lB,GAW5E,SAASC,GAAclT,GACrB,OAAO,SAASnR,GACd,IAAIyQ,EAAMC,GAAO1Q,GACjB,OAAIyQ,GAAOld,EACF6O,GAAWpC,GAEhByQ,GAAO3c,GACFgP,GAAW9C,GAEbS,GAAYT,EAAQmR,EAASnR,KA6BxC,SAASskB,GAAWznB,EAAMqT,EAASpT,EAASwhB,EAAUC,EAAS2D,EAAQC,EAAKnB,GAC1E,IAAIqB,EAAYnS,EAAU5e,EAC1B,IAAK+wB,GAA4B,mBAARxlB,EACvB,MAAM,IAAImH,GAAUpT,GAEtB,IAAIoM,EAASshB,EAAWA,EAASthB,OAAS,EAS1C,GARKA,IACHkT,KAAaxe,EAAoBC,GACjC2sB,EAAWC,EAAU/tB,GAEvB2xB,EAAMA,IAAQ3xB,EAAY2xB,EAAM5a,GAAUkL,GAAU0P,GAAM,GAC1DnB,EAAQA,IAAUxwB,EAAYwwB,EAAQvO,GAAUuO,GAChDhkB,GAAUuhB,EAAUA,EAAQvhB,OAAS,EAEjCkT,EAAUve,EAAyB,CACrC,IAAIqwB,EAAgB1D,EAChB2D,EAAe1D,EAEnBD,EAAWC,EAAU/tB,EAEvB,IAAIwR,EAAOqgB,EAAY7xB,EAAYqxB,GAAQhlB,GAEvCinB,EAAU,CACZjnB,EAAMqT,EAASpT,EAASwhB,EAAUC,EAASyD,EAAeC,EAC1DC,EAAQC,EAAKnB,GAkBf,GAfIhf,GACFuiB,GAAUT,EAAS9hB,GAErBnF,EAAOinB,EAAQ,GACf5T,EAAU4T,EAAQ,GAClBhnB,EAAUgnB,EAAQ,GAClBxF,EAAWwF,EAAQ,GACnBvF,EAAUuF,EAAQ,GAClB9C,EAAQ8C,EAAQ,GAAKA,EAAQ,KAAOtzB,EAC/B6xB,EAAY,EAAIxlB,EAAKG,OACtBuK,GAAUuc,EAAQ,GAAK9mB,EAAQ,IAE9BgkB,GAAS9Q,GAAW1e,EAAkBC,KACzCye,KAAa1e,EAAkBC,IAE5Bye,GAAWA,GAAW7e,EAGzB0M,EADSmS,GAAW1e,GAAmB0e,GAAWze,EACzCsvB,GAAYlkB,EAAMqT,EAAS8Q,GAC1B9Q,GAAWxe,GAAqBwe,IAAY7e,EAAiBK,IAAwB6sB,EAAQvhB,OAG9FmkB,GAAavkB,MAAMpM,EAAWszB,GAF9BV,GAAcvmB,EAAMqT,EAASpT,EAASwhB,QAJ/C,IAAIvgB,EAASgiB,GAAWljB,EAAMqT,EAASpT,GAQzC,IAAIM,EAAS4E,EAAOqY,GAAc0J,GAClC,OAAOC,GAAgB5mB,EAAOW,EAAQ+lB,GAAUjnB,EAAMqT,GAexD,SAASsU,GAAuBpV,EAAUmH,EAAUhX,EAAKS,GACvD,OAAIoP,IAAa5e,GACZye,GAAGG,EAAUhL,GAAY7E,MAAUiF,GAAevH,KAAK+C,EAAQT,GAC3DgX,EAEFnH,EAiBT,SAASqV,GAAoBrV,EAAUmH,EAAUhX,EAAKS,EAAQ1K,EAAQ8a,GAOpE,OANIzG,GAASyF,IAAazF,GAAS4M,KAEjCnG,EAAMvN,IAAI0T,EAAUnH,GACpB6I,GAAU7I,EAAUmH,EAAU/lB,EAAWi0B,GAAqBrU,GAC9DA,EAAM,UAAUmG,IAEXnH,EAYT,SAASsV,GAAgBlnB,GACvB,OAAOkb,GAAclb,GAAShN,EAAYgN,EAgB5C,SAASoY,GAAYzY,EAAO4W,EAAO7D,EAASC,EAAYiF,EAAWhF,GACjE,IAAIuU,EAAYzU,EAAU/e,EACtB6Z,EAAY7N,EAAMH,OAClBqX,EAAYN,EAAM/W,OAEtB,GAAIgO,GAAaqJ,KAAesQ,GAAatQ,EAAYrJ,GACvD,OAAO,EAGT,IAAI4Z,EAAaxU,EAAMhD,IAAIjQ,GACvB0nB,EAAazU,EAAMhD,IAAI2G,GAC3B,GAAI6Q,GAAcC,EAChB,OAAOD,GAAc7Q,GAAS8Q,GAAc1nB,EAE9C,IAAII,GAAS,EACTQ,GAAS,EACT2W,EAAQxE,EAAU9e,EAA0B,IAAImc,GAAW/c,EAE/D4f,EAAMvN,IAAI1F,EAAO4W,GACjB3D,EAAMvN,IAAIkR,EAAO5W,GAGjB,QAASI,EAAQyN,EAAW,CAC1B,IAAI8Z,EAAW3nB,EAAMI,GACjBwnB,EAAWhR,EAAMxW,GAErB,GAAI4S,EACF,IAAI6U,EAAWL,EACXxU,EAAW4U,EAAUD,EAAUvnB,EAAOwW,EAAO5W,EAAOiT,GACpDD,EAAW2U,EAAUC,EAAUxnB,EAAOJ,EAAO4W,EAAO3D,GAE1D,GAAI4U,IAAax0B,EAAW,CAC1B,GAAIw0B,EACF,SAEFjnB,GAAS,EACT,MAGF,GAAI2W,GACF,IAAK9V,GAAUmV,GAAO,SAASgR,EAAUzQ,GACnC,IAAKzT,GAAS6T,EAAMJ,KACfwQ,IAAaC,GAAY3P,EAAU0P,EAAUC,EAAU7U,EAASC,EAAYC,IAC/E,OAAOsE,EAAKvS,KAAKmS,MAEjB,CACNvW,GAAS,EACT,YAEG,GACD+mB,IAAaC,IACX3P,EAAU0P,EAAUC,EAAU7U,EAASC,EAAYC,GACpD,CACLrS,GAAS,EACT,OAKJ,OAFAqS,EAAM,UAAUjT,GAChBiT,EAAM,UAAU2D,GACThW,EAoBT,SAAS8X,GAAW7V,EAAQ+T,EAAOtD,EAAKP,EAASC,EAAYiF,EAAWhF,GACtE,OAAQK,GACN,KAAKpc,GACH,GAAK2L,EAAOqd,YAActJ,EAAMsJ,YAC3Brd,EAAOwd,YAAczJ,EAAMyJ,WAC9B,OAAO,EAETxd,EAASA,EAAOgd,OAChBjJ,EAAQA,EAAMiJ,OAEhB,KAAK5oB,GACH,QAAK4L,EAAOqd,YAActJ,EAAMsJ,aAC3BjI,EAAU,IAAI9P,GAAWtF,GAAS,IAAIsF,GAAWyO,KAKxD,KAAK9gB,EACL,KAAKC,EACL,KAAKM,EAGH,OAAOyb,IAAIjP,GAAS+T,GAEtB,KAAK3gB,EACH,OAAO4M,EAAOilB,MAAQlR,EAAMkR,MAAQjlB,EAAOklB,SAAWnR,EAAMmR,QAE9D,KAAKrxB,GACL,KAAKE,GAIH,OAAOiM,GAAW+T,EAAQ,GAE5B,KAAKxgB,EACH,IAAI4xB,EAAU/iB,GAEhB,KAAKtO,GACH,IAAI6wB,EAAYzU,EAAU/e,EAG1B,GAFAg0B,IAAYA,EAAUviB,IAElB5C,EAAOsC,MAAQyR,EAAMzR,OAASqiB,EAChC,OAAO,EAGT,IAAI1T,EAAUb,EAAMhD,IAAIpN,GACxB,GAAIiR,EACF,OAAOA,GAAW8C,EAEpB7D,GAAW9e,EAGXgf,EAAMvN,IAAI7C,EAAQ+T,GAClB,IAAIhW,EAAS6X,GAAYuP,EAAQnlB,GAASmlB,EAAQpR,GAAQ7D,EAASC,EAAYiF,EAAWhF,GAE1F,OADAA,EAAM,UAAUpQ,GACTjC,EAET,KAAK/J,GACH,GAAIgV,GACF,OAAOA,GAAc/L,KAAK+C,IAAWgJ,GAAc/L,KAAK8W,GAG9D,OAAO,EAgBT,SAASmC,GAAalW,EAAQ+T,EAAO7D,EAASC,EAAYiF,EAAWhF,GACnE,IAAIuU,EAAYzU,EAAU/e,EACtBi0B,EAAW/T,GAAWrR,GACtBqlB,EAAYD,EAASpoB,OACrBsoB,EAAWjU,GAAW0C,GACtBM,EAAYiR,EAAStoB,OAEzB,GAAIqoB,GAAahR,IAAcsQ,EAC7B,OAAO,EAET,IAAIpnB,EAAQ8nB,EACZ,MAAO9nB,IAAS,CACd,IAAIgC,EAAM6lB,EAAS7nB,GACnB,KAAMonB,EAAYplB,KAAOwU,EAAQvP,GAAevH,KAAK8W,EAAOxU,IAC1D,OAAO,EAIX,IAAIgmB,EAAanV,EAAMhD,IAAIpN,GACvB6kB,EAAazU,EAAMhD,IAAI2G,GAC3B,GAAIwR,GAAcV,EAChB,OAAOU,GAAcxR,GAAS8Q,GAAc7kB,EAE9C,IAAIjC,GAAS,EACbqS,EAAMvN,IAAI7C,EAAQ+T,GAClB3D,EAAMvN,IAAIkR,EAAO/T,GAEjB,IAAIwlB,EAAWb,EACf,QAASpnB,EAAQ8nB,EAAW,CAC1B9lB,EAAM6lB,EAAS7nB,GACf,IAAI6R,EAAWpP,EAAOT,GAClBwlB,EAAWhR,EAAMxU,GAErB,GAAI4Q,EACF,IAAI6U,EAAWL,EACXxU,EAAW4U,EAAU3V,EAAU7P,EAAKwU,EAAO/T,EAAQoQ,GACnDD,EAAWf,EAAU2V,EAAUxlB,EAAKS,EAAQ+T,EAAO3D,GAGzD,KAAM4U,IAAax0B,EACV4e,IAAa2V,GAAY3P,EAAUhG,EAAU2V,EAAU7U,EAASC,EAAYC,GAC7E4U,GACD,CACLjnB,GAAS,EACT,MAEFynB,IAAaA,EAAkB,eAAPjmB,GAE1B,GAAIxB,IAAWynB,EAAU,CACvB,IAAIC,EAAUzlB,EAAOgS,YACjB0T,EAAU3R,EAAM/B,YAGhByT,GAAWC,KACV,gBAAiB1lB,MAAU,gBAAiB+T,IACzB,mBAAX0R,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,IACvD3nB,GAAS,GAKb,OAFAqS,EAAM,UAAUpQ,GAChBoQ,EAAM,UAAU2D,GACThW,EAUT,SAASwjB,GAAS1kB,GAChB,OAAOmd,GAAYC,GAASpd,EAAMrM,EAAWm1B,IAAU9oB,EAAO,IAUhE,SAASwU,GAAWrR,GAClB,OAAOyT,GAAezT,EAAQ6E,GAAMwa,IAWtC,SAASjO,GAAapR,GACpB,OAAOyT,GAAezT,EAAQ0P,GAAQ4P,IAUxC,IAAIuC,GAAWtZ,GAAiB,SAAS1L,GACvC,OAAO0L,GAAQ6E,IAAIvQ,IADIunB,GAWzB,SAASzC,GAAY9kB,GACnB,IAAIkB,EAAUlB,EAAKooB,KAAO,GACtB9nB,EAAQqL,GAAUzK,GAClBf,EAASwH,GAAevH,KAAKuL,GAAWzK,GAAUZ,EAAMH,OAAS,EAErE,MAAOA,IAAU,CACf,IAAIgF,EAAO7E,EAAMH,GACb4oB,EAAY5jB,EAAKnF,KACrB,GAAiB,MAAb+oB,GAAqBA,GAAa/oB,EACpC,OAAOmF,EAAKijB,KAGhB,OAAOlnB,EAUT,SAASkjB,GAAUpkB,GACjB,IAAImD,EAASwE,GAAevH,KAAKkM,GAAQ,eAAiBA,GAAStM,EACnE,OAAOmD,EAAOqB,YAchB,SAAS0X,KACP,IAAIhb,EAASoL,GAAO9L,UAAYA,GAEhC,OADAU,EAASA,IAAWV,GAAW0Z,GAAehZ,EACvCsiB,UAAUrjB,OAASe,EAAOsiB,UAAU,GAAIA,UAAU,IAAMtiB,EAWjE,SAASmP,GAAW7K,EAAK9C,GACvB,IAAIyC,EAAOK,EAAI6J,SACf,OAAO2Z,GAAUtmB,GACbyC,EAAmB,iBAAPzC,EAAkB,SAAW,QACzCyC,EAAKK,IAUX,SAASuV,GAAa5X,GACpB,IAAIjC,EAAS8G,GAAK7E,GACdhD,EAASe,EAAOf,OAEpB,MAAOA,IAAU,CACf,IAAIuC,EAAMxB,EAAOf,GACbQ,EAAQwC,EAAOT,GAEnBxB,EAAOf,GAAU,CAACuC,EAAK/B,EAAOua,GAAmBva,IAEnD,OAAOO,EAWT,SAASqI,GAAUpG,EAAQT,GACzB,IAAI/B,EAAQkE,GAAS1B,EAAQT,GAC7B,OAAOiX,GAAahZ,GAASA,EAAQhN,EAUvC,SAASojB,GAAUpW,GACjB,IAAIsoB,EAAQthB,GAAevH,KAAKO,EAAOyI,IACnCwK,EAAMjT,EAAMyI,IAEhB,IACEzI,EAAMyI,IAAkBzV,EACxB,IAAIu1B,GAAW,EACf,MAAOhqB,IAET,IAAIgC,EAASgH,GAAqB9H,KAAKO,GAQvC,OAPIuoB,IACED,EACFtoB,EAAMyI,IAAkBwK,SAEjBjT,EAAMyI,KAGVlI,EAUT,IAAIshB,GAActY,GAA+B,SAAS/G,GACxD,OAAc,MAAVA,EACK,IAETA,EAAShF,GAAOgF,GACTnC,GAAYkJ,GAAiB/G,IAAS,SAAS4d,GACpD,OAAOhY,GAAqB3I,KAAK+C,EAAQ4d,QANRoI,GAiBjC1G,GAAgBvY,GAA+B,SAAS/G,GAC1D,IAAIjC,EAAS,GACb,MAAOiC,EACL1B,GAAUP,EAAQshB,GAAWrf,IAC7BA,EAASwF,GAAaxF,GAExB,OAAOjC,GAN8BioB,GAgBnCtV,GAASiD,GAoCb,SAASzI,GAAQC,EAAOC,EAAK6a,GAC3B,IAAI1oB,GAAS,EACTP,EAASipB,EAAWjpB,OAExB,QAASO,EAAQP,EAAQ,CACvB,IAAIgF,EAAOikB,EAAW1oB,GAClB+E,EAAON,EAAKM,KAEhB,OAAQN,EAAK2J,MACX,IAAK,OAAaR,GAAS7I,EAAM,MACjC,IAAK,YAAa8I,GAAO9I,EAAM,MAC/B,IAAK,OAAa8I,EAAM3D,GAAU2D,EAAKD,EAAQ7I,GAAO,MACtD,IAAK,YAAa6I,EAAQ5D,GAAU4D,EAAOC,EAAM9I,GAAO,OAG5D,MAAO,CAAE,MAAS6I,EAAO,IAAOC,GAUlC,SAAS8a,GAAe5wB,GACtB,IAAI6J,EAAQ7J,EAAO6J,MAAM/I,IACzB,OAAO+I,EAAQA,EAAM,GAAGF,MAAM5I,IAAkB,GAYlD,SAAS8vB,GAAQnmB,EAAQsT,EAAM8S,GAC7B9S,EAAOC,GAASD,EAAMtT,GAEtB,IAAIzC,GAAS,EACTP,EAASsW,EAAKtW,OACde,GAAS,EAEb,QAASR,EAAQP,EAAQ,CACvB,IAAIuC,EAAMiU,GAAMF,EAAK/V,IACrB,KAAMQ,EAAmB,MAAViC,GAAkBomB,EAAQpmB,EAAQT,IAC/C,MAEFS,EAASA,EAAOT,GAElB,OAAIxB,KAAYR,GAASP,EAChBe,GAETf,EAAmB,MAAVgD,EAAiB,EAAIA,EAAOhD,SAC5BA,GAAU8Z,GAAS9Z,IAAWyR,GAAQlP,EAAKvC,KACjDqM,GAAQrJ,IAAWqO,GAAYrO,KAUpC,SAASwQ,GAAerT,GACtB,IAAIH,EAASG,EAAMH,OACfe,EAAS,IAAIZ,EAAM6U,YAAYhV,GAOnC,OAJIA,GAA6B,iBAAZG,EAAM,IAAkBqH,GAAevH,KAAKE,EAAO,WACtEY,EAAOR,MAAQJ,EAAMI,MACrBQ,EAAOsoB,MAAQlpB,EAAMkpB,OAEhBtoB,EAUT,SAAS8S,GAAgB7Q,GACvB,MAAqC,mBAAtBA,EAAOgS,aAA8BqF,GAAYrX,GAE5D,GADAyJ,GAAWjE,GAAaxF,IAgB9B,SAASgR,GAAehR,EAAQyQ,EAAKJ,GACnC,IAAI4P,EAAOjgB,EAAOgS,YAClB,OAAQvB,GACN,KAAKrc,GACH,OAAO+oB,GAAiBnd,GAE1B,KAAK/M,EACL,KAAKC,EACH,OAAO,IAAI+sB,GAAMjgB,GAEnB,KAAK3L,GACH,OAAOipB,GAActd,EAAQqQ,GAE/B,KAAK/b,GAAY,KAAKC,GACtB,KAAKC,GAAS,KAAKC,GAAU,KAAKC,GAClC,KAAKC,GAAU,KAAKC,GAAiB,KAAKC,GAAW,KAAKC,GACxD,OAAO2jB,GAAgBzY,EAAQqQ,GAEjC,KAAK9c,EACH,OAAO,IAAI0sB,EAEb,KAAKzsB,EACL,KAAKO,GACH,OAAO,IAAIksB,EAAKjgB,GAElB,KAAKnM,GACH,OAAO4pB,GAAYzd,GAErB,KAAKlM,GACH,OAAO,IAAImsB,EAEb,KAAKjsB,GACH,OAAO2pB,GAAY3d,IAYzB,SAASsmB,GAAkBhxB,EAAQixB,GACjC,IAAIvpB,EAASupB,EAAQvpB,OACrB,IAAKA,EACH,OAAO1H,EAET,IAAI+N,EAAYrG,EAAS,EAGzB,OAFAupB,EAAQljB,IAAcrG,EAAS,EAAI,KAAO,IAAMupB,EAAQljB,GACxDkjB,EAAUA,EAAQjtB,KAAK0D,EAAS,EAAI,KAAO,KACpC1H,EAAO6P,QAAQhP,GAAe,uBAAyBowB,EAAU,UAU1E,SAASxT,GAAcvV,GACrB,OAAO6L,GAAQ7L,IAAU6Q,GAAY7Q,OAChCsI,IAAoBtI,GAASA,EAAMsI,KAW1C,SAAS2I,GAAQjR,EAAOR,GACtB,IAAI2O,SAAcnO,EAGlB,OAFAR,EAAmB,MAAVA,EAAiBzK,EAAmByK,IAEpCA,IACE,UAAR2O,GACU,UAARA,GAAoB7U,GAAS8K,KAAKpE,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQR,EAajD,SAAS6iB,GAAeriB,EAAOD,EAAOyC,GACpC,IAAK2J,GAAS3J,GACZ,OAAO,EAET,IAAI2L,SAAcpO,EAClB,SAAY,UAARoO,EACKgM,GAAY3X,IAAWyO,GAAQlR,EAAOyC,EAAOhD,QACrC,UAAR2O,GAAoBpO,KAASyC,IAE7BiP,GAAGjP,EAAOzC,GAAQC,GAa7B,SAASsa,GAAMta,EAAOwC,GACpB,GAAIqJ,GAAQ7L,GACV,OAAO,EAET,IAAImO,SAAcnO,EAClB,QAAY,UAARmO,GAA4B,UAARA,GAA4B,WAARA,GAC/B,MAATnO,IAAiB+U,GAAS/U,MAGvB5H,GAAcgM,KAAKpE,KAAW7H,GAAaiM,KAAKpE,IAC1C,MAAVwC,GAAkBxC,KAASxC,GAAOgF,IAUvC,SAAS6lB,GAAUroB,GACjB,IAAImO,SAAcnO,EAClB,MAAgB,UAARmO,GAA4B,UAARA,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAVnO,EACU,OAAVA,EAWP,SAASskB,GAAWjlB,GAClB,IAAI+kB,EAAWD,GAAY9kB,GACvBkX,EAAQ5K,GAAOyY,GAEnB,GAAoB,mBAAT7N,KAAyB6N,KAAYtY,GAAYpF,WAC1D,OAAO,EAET,GAAIrH,IAASkX,EACX,OAAO,EAET,IAAI/R,EAAO6f,GAAQ9N,GACnB,QAAS/R,GAAQnF,IAASmF,EAAK,GAUjC,SAASyU,GAAS5Z,GAChB,QAAS6H,IAAeA,MAAc7H,GAxTnCoL,IAAYyI,GAAO,IAAIzI,GAAS,IAAIue,YAAY,MAAQnyB,IACxD6T,IAAOwI,GAAO,IAAIxI,KAAQ3U,GAC1B4U,IAAWuI,GAAOvI,GAAQse,YAAc9yB,IACxCyU,IAAOsI,GAAO,IAAItI,KAAQtU,IAC1BuU,IAAWqI,GAAO,IAAIrI,KAAYnU,MACrCwc,GAAS,SAASlT,GAChB,IAAIO,EAAS4V,GAAWnW,GACpByiB,EAAOliB,GAAUrK,GAAY8J,EAAMwU,YAAcxhB,EACjDk2B,EAAazG,EAAOvX,GAASuX,GAAQ,GAEzC,GAAIyG,EACF,OAAQA,GACN,KAAKje,GAAoB,OAAOpU,GAChC,KAAKsU,GAAe,OAAOpV,EAC3B,KAAKqV,GAAmB,OAAOjV,GAC/B,KAAKkV,GAAe,OAAO/U,GAC3B,KAAKgV,GAAmB,OAAO5U,GAGnC,OAAO6J,IA+SX,IAAI4oB,GAAatiB,GAAa+O,GAAawT,GAS3C,SAASvP,GAAY7Z,GACnB,IAAIyiB,EAAOziB,GAASA,EAAMwU,YACtBtI,EAAwB,mBAARuW,GAAsBA,EAAK/b,WAAcE,GAE7D,OAAO5G,IAAUkM,EAWnB,SAASqO,GAAmBva,GAC1B,OAAOA,IAAUA,IAAUmM,GAASnM,GAYtC,SAASqa,GAAwBtY,EAAKgX,GACpC,OAAO,SAASvW,GACd,OAAc,MAAVA,IAGGA,EAAOT,KAASgX,IACpBA,IAAa/lB,GAAc+O,KAAOvE,GAAOgF,MAYhD,SAAS6mB,GAAchqB,GACrB,IAAIkB,EAAS+oB,GAAQjqB,GAAM,SAAS0C,GAIlC,OAHIuB,EAAMwB,OAASxR,GACjBgQ,EAAMiL,QAEDxM,KAGLuB,EAAQ/C,EAAO+C,MACnB,OAAO/C,EAmBT,SAASwmB,GAAUviB,EAAM1M,GACvB,IAAI4a,EAAUlO,EAAK,GACf+kB,EAAazxB,EAAO,GACpB0xB,EAAa9W,EAAU6W,EACvBnV,EAAWoV,GAAc31B,EAAiBC,EAAqBM,GAE/Dq1B,EACAF,GAAcn1B,GAAmBse,GAAW1e,GAC5Cu1B,GAAcn1B,GAAmBse,GAAWre,GAAqBmQ,EAAK,GAAGhF,QAAU1H,EAAO,IAC1FyxB,IAAen1B,EAAgBC,IAAsByD,EAAO,GAAG0H,QAAU1H,EAAO,IAAQ4a,GAAW1e,EAGvG,IAAMogB,IAAYqV,EAChB,OAAOjlB,EAGL+kB,EAAa11B,IACf2Q,EAAK,GAAK1M,EAAO,GAEjB0xB,GAAc9W,EAAU7e,EAAiB,EAAIE,GAG/C,IAAIiM,EAAQlI,EAAO,GACnB,GAAIkI,EAAO,CACT,IAAI8gB,EAAWtc,EAAK,GACpBA,EAAK,GAAKsc,EAAWD,GAAYC,EAAU9gB,EAAOlI,EAAO,IAAMkI,EAC/DwE,EAAK,GAAKsc,EAAW3b,GAAeX,EAAK,GAAIjR,GAAeuE,EAAO,GA0BrE,OAvBAkI,EAAQlI,EAAO,GACXkI,IACF8gB,EAAWtc,EAAK,GAChBA,EAAK,GAAKsc,EAAWU,GAAiBV,EAAU9gB,EAAOlI,EAAO,IAAMkI,EACpEwE,EAAK,GAAKsc,EAAW3b,GAAeX,EAAK,GAAIjR,GAAeuE,EAAO,IAGrEkI,EAAQlI,EAAO,GACXkI,IACFwE,EAAK,GAAKxE,GAGRupB,EAAan1B,IACfoQ,EAAK,GAAgB,MAAXA,EAAK,GAAa1M,EAAO,GAAKmS,GAAUzF,EAAK,GAAI1M,EAAO,KAGrD,MAAX0M,EAAK,KACPA,EAAK,GAAK1M,EAAO,IAGnB0M,EAAK,GAAK1M,EAAO,GACjB0M,EAAK,GAAKglB,EAEHhlB,EAYT,SAASuV,GAAavX,GACpB,IAAIjC,EAAS,GACb,GAAc,MAAViC,EACF,IAAK,IAAIT,KAAOvE,GAAOgF,GACrBjC,EAAOoE,KAAK5C,GAGhB,OAAOxB,EAUT,SAAS8V,GAAerW,GACtB,OAAOuH,GAAqB9H,KAAKO,GAYnC,SAASyc,GAASpd,EAAMsO,EAAO1I,GAE7B,OADA0I,EAAQ5D,GAAU4D,IAAU3a,EAAaqM,EAAKG,OAAS,EAAKmO,EAAO,GAC5D,WACL,IAAIpO,EAAOsjB,UACP9iB,GAAS,EACTP,EAASuK,GAAUxK,EAAKC,OAASmO,EAAO,GACxChO,EAAQkB,EAAMrB,GAElB,QAASO,EAAQP,EACfG,EAAMI,GAASR,EAAKoO,EAAQ5N,GAE9BA,GAAS,EACT,IAAI2pB,EAAY7oB,EAAM8M,EAAQ,GAC9B,QAAS5N,EAAQ4N,EACf+b,EAAU3pB,GAASR,EAAKQ,GAG1B,OADA2pB,EAAU/b,GAAS1I,EAAUtF,GACtBP,GAAMC,EAAMhN,KAAMq3B,IAY7B,SAASrS,GAAO7U,EAAQsT,GACtB,OAAOA,EAAKtW,OAAS,EAAIgD,EAASqT,GAAQrT,EAAQya,GAAUnH,EAAM,GAAI,IAaxE,SAASmP,GAAQtlB,EAAOsc,GACtB,IAAIzO,EAAY7N,EAAMH,OAClBA,EAASyK,GAAUgS,EAAQzc,OAAQgO,GACnCmc,EAAW1c,GAAUtN,GAEzB,MAAOH,IAAU,CACf,IAAIO,EAAQkc,EAAQzc,GACpBG,EAAMH,GAAUyR,GAAQlR,EAAOyN,GAAamc,EAAS5pB,GAAS/M,EAEhE,OAAO2M,EAWT,SAASkb,GAAQrY,EAAQT,GACvB,IAAY,gBAARA,GAAgD,oBAAhBS,EAAOT,KAIhC,aAAPA,EAIJ,OAAOS,EAAOT,GAiBhB,IAAIwkB,GAAUqD,GAAS/M,IAUnB3T,GAAaD,IAAiB,SAAS5J,EAAM4U,GAC/C,OAAOtW,GAAKuL,WAAW7J,EAAM4U,IAW3BuI,GAAcoN,GAAS9M,IAY3B,SAAS0J,GAAgB7D,EAASkH,EAAWnX,GAC3C,IAAI5a,EAAU+xB,EAAY,GAC1B,OAAOrN,GAAYmG,EAASmG,GAAkBhxB,EAAQgyB,GAAkBpB,GAAe5wB,GAAS4a,KAYlG,SAASkX,GAASvqB,GAChB,IAAI0qB,EAAQ,EACRC,EAAa,EAEjB,OAAO,WACL,IAAIC,EAAQ9f,KACR+f,EAAYx1B,GAAYu1B,EAAQD,GAGpC,GADAA,EAAaC,EACTC,EAAY,GACd,KAAMH,GAASt1B,EACb,OAAOouB,UAAU,QAGnBkH,EAAQ,EAEV,OAAO1qB,EAAKD,MAAMpM,EAAW6vB,YAYjC,SAASxR,GAAY1R,EAAOmF,GAC1B,IAAI/E,GAAS,EACTP,EAASG,EAAMH,OACfqG,EAAYrG,EAAS,EAEzBsF,EAAOA,IAAS9R,EAAYwM,EAASsF,EACrC,QAAS/E,EAAQ+E,EAAM,CACrB,IAAIqlB,EAAOhZ,GAAWpR,EAAO8F,GACzB7F,EAAQL,EAAMwqB,GAElBxqB,EAAMwqB,GAAQxqB,EAAMI,GACpBJ,EAAMI,GAASC,EAGjB,OADAL,EAAMH,OAASsF,EACRnF,EAUT,IAAIyf,GAAeiK,IAAc,SAAS7nB,GACxC,IAAIjB,EAAS,GAOb,OAN6B,KAAzBiB,EAAO4oB,WAAW,IACpB7pB,EAAOoE,KAAK,IAEdnD,EAAOmG,QAAQtP,IAAY,SAASsJ,EAAO2Q,EAAQ+X,EAAOC,GACxD/pB,EAAOoE,KAAK0lB,EAAQC,EAAU3iB,QAAQ5O,GAAc,MAASuZ,GAAU3Q,MAElEpB,KAUT,SAASyV,GAAMhW,GACb,GAAoB,iBAATA,GAAqB+U,GAAS/U,GACvC,OAAOA,EAET,IAAIO,EAAUP,EAAQ,GACtB,MAAkB,KAAVO,GAAkB,EAAIP,IAAWlL,EAAY,KAAOyL,EAU9D,SAAS2K,GAAS7L,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAOyH,GAAarH,KAAKJ,GACzB,MAAOd,IACT,IACE,OAAQc,EAAO,GACf,MAAOd,KAEX,MAAO,GAWT,SAASurB,GAAkBf,EAASrW,GAOlC,OANAzS,GAAU5K,GAAW,SAASsxB,GAC5B,IAAI3mB,EAAQ,KAAO2mB,EAAK,GACnBjU,EAAUiU,EAAK,KAAQnmB,GAAcuoB,EAAS/oB,IACjD+oB,EAAQpkB,KAAK3E,MAGV+oB,EAAQlmB,OAUjB,SAASmJ,GAAa2W,GACpB,GAAIA,aAAmB7W,GACrB,OAAO6W,EAAQxV,QAEjB,IAAI5M,EAAS,IAAIwL,GAAc4W,EAAQrW,YAAaqW,EAAQnW,WAI5D,OAHAjM,EAAOgM,YAAcU,GAAU0V,EAAQpW,aACvChM,EAAOkM,UAAakW,EAAQlW,UAC5BlM,EAAOmM,WAAaiW,EAAQjW,WACrBnM,EA0BT,SAASgqB,GAAM5qB,EAAOmF,EAAMsd,GAExBtd,GADGsd,EAAQC,GAAe1iB,EAAOmF,EAAMsd,GAAStd,IAAS9R,GAClD,EAEA+W,GAAUkL,GAAUnQ,GAAO,GAEpC,IAAItF,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,IAAKA,GAAUsF,EAAO,EACpB,MAAO,GAET,IAAI/E,EAAQ,EACRO,EAAW,EACXC,EAASM,EAAMsI,GAAW3J,EAASsF,IAEvC,MAAO/E,EAAQP,EACbe,EAAOD,KAAc2c,GAAUtd,EAAOI,EAAQA,GAAS+E,GAEzD,OAAOvE,EAkBT,SAASiqB,GAAQ7qB,GACf,IAAII,GAAS,EACTP,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACnCc,EAAW,EACXC,EAAS,GAEb,QAASR,EAAQP,EAAQ,CACvB,IAAIQ,EAAQL,EAAMI,GACdC,IACFO,EAAOD,KAAcN,GAGzB,OAAOO,EAyBT,SAASkqB,KACP,IAAIjrB,EAASqjB,UAAUrjB,OACvB,IAAKA,EACH,MAAO,GAET,IAAID,EAAOsB,EAAMrB,EAAS,GACtBG,EAAQkjB,UAAU,GAClB9iB,EAAQP,EAEZ,MAAOO,IACLR,EAAKQ,EAAQ,GAAK8iB,UAAU9iB,GAE9B,OAAOe,GAAU+K,GAAQlM,GAASsN,GAAUtN,GAAS,CAACA,GAAQyV,GAAY7V,EAAM,IAwBlF,IAAImrB,GAAanO,IAAS,SAAS5c,EAAOoB,GACxC,OAAOia,GAAkBrb,GACrBuU,GAAevU,EAAOyV,GAAYrU,EAAQ,EAAGia,IAAmB,IAChE,MA6BF2P,GAAepO,IAAS,SAAS5c,EAAOoB,GAC1C,IAAIlB,EAAWyX,GAAKvW,GAIpB,OAHIia,GAAkBnb,KACpBA,EAAW7M,GAENgoB,GAAkBrb,GACrBuU,GAAevU,EAAOyV,GAAYrU,EAAQ,EAAGia,IAAmB,GAAOO,GAAY1b,EAAU,IAC7F,MA0BF+qB,GAAiBrO,IAAS,SAAS5c,EAAOoB,GAC5C,IAAIJ,EAAa2W,GAAKvW,GAItB,OAHIia,GAAkBra,KACpBA,EAAa3N,GAERgoB,GAAkBrb,GACrBuU,GAAevU,EAAOyV,GAAYrU,EAAQ,EAAGia,IAAmB,GAAOhoB,EAAW2N,GAClF,MA4BN,SAASkqB,GAAKlrB,EAAOqD,EAAGof,GACtB,IAAI5iB,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAKA,GAGLwD,EAAKof,GAASpf,IAAMhQ,EAAa,EAAIiiB,GAAUjS,GACxCia,GAAUtd,EAAOqD,EAAI,EAAI,EAAIA,EAAGxD,IAH9B,GA+BX,SAASsrB,GAAUnrB,EAAOqD,EAAGof,GAC3B,IAAI5iB,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAKA,GAGLwD,EAAKof,GAASpf,IAAMhQ,EAAa,EAAIiiB,GAAUjS,GAC/CA,EAAIxD,EAASwD,EACNia,GAAUtd,EAAO,EAAGqD,EAAI,EAAI,EAAIA,IAJ9B,GA0CX,SAAS+nB,GAAeprB,EAAOS,GAC7B,OAAQT,GAASA,EAAMH,OACnBkf,GAAU/e,EAAO4b,GAAYnb,EAAW,IAAI,GAAM,GAClD,GAsCN,SAAS4qB,GAAUrrB,EAAOS,GACxB,OAAQT,GAASA,EAAMH,OACnBkf,GAAU/e,EAAO4b,GAAYnb,EAAW,IAAI,GAC5C,GAgCN,SAAS6qB,GAAKtrB,EAAOK,EAAO2N,EAAOC,GACjC,IAAIpO,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAKA,GAGDmO,GAAyB,iBAATA,GAAqB0U,GAAe1iB,EAAOK,EAAO2N,KACpEA,EAAQ,EACRC,EAAMpO,GAEDwV,GAASrV,EAAOK,EAAO2N,EAAOC,IAN5B,GA4CX,SAASsd,GAAUvrB,EAAOS,EAAW6B,GACnC,IAAIzC,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIO,EAAqB,MAAbkC,EAAoB,EAAIgT,GAAUhT,GAI9C,OAHIlC,EAAQ,IACVA,EAAQgK,GAAUvK,EAASO,EAAO,IAE7BiC,GAAcrC,EAAO4b,GAAYnb,EAAW,GAAIL,GAsCzD,SAASorB,GAAcxrB,EAAOS,EAAW6B,GACvC,IAAIzC,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIO,EAAQP,EAAS,EAOrB,OANIyC,IAAcjP,IAChB+M,EAAQkV,GAAUhT,GAClBlC,EAAQkC,EAAY,EAChB8H,GAAUvK,EAASO,EAAO,GAC1BkK,GAAUlK,EAAOP,EAAS,IAEzBwC,GAAcrC,EAAO4b,GAAYnb,EAAW,GAAIL,GAAO,GAiBhE,SAASooB,GAAQxoB,GACf,IAAIH,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAOA,EAAS4V,GAAYzV,EAAO,GAAK,GAiB1C,SAASyrB,GAAYzrB,GACnB,IAAIH,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAOA,EAAS4V,GAAYzV,EAAO7K,GAAY,GAuBjD,SAASu2B,GAAa1rB,EAAO0V,GAC3B,IAAI7V,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAKA,GAGL6V,EAAQA,IAAUriB,EAAY,EAAIiiB,GAAUI,GACrCD,GAAYzV,EAAO0V,IAHjB,GAqBX,SAASiW,GAAU7a,GACjB,IAAI1Q,GAAS,EACTP,EAAkB,MAATiR,EAAgB,EAAIA,EAAMjR,OACnCe,EAAS,GAEb,QAASR,EAAQP,EAAQ,CACvB,IAAImnB,EAAOlW,EAAM1Q,GACjBQ,EAAOomB,EAAK,IAAMA,EAAK,GAEzB,OAAOpmB,EAqBT,SAASgrB,GAAK5rB,GACZ,OAAQA,GAASA,EAAMH,OAAUG,EAAM,GAAK3M,EA0B9C,SAAS+oB,GAAQpc,EAAOK,EAAOiC,GAC7B,IAAIzC,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIO,EAAqB,MAAbkC,EAAoB,EAAIgT,GAAUhT,GAI9C,OAHIlC,EAAQ,IACVA,EAAQgK,GAAUvK,EAASO,EAAO,IAE7BU,GAAYd,EAAOK,EAAOD,GAiBnC,SAASyrB,GAAQ7rB,GACf,IAAIH,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAOA,EAASyd,GAAUtd,EAAO,GAAI,GAAK,GAoB5C,IAAI8rB,GAAelP,IAAS,SAAS3F,GACnC,IAAI8U,EAAS9qB,GAASgW,EAAQsI,IAC9B,OAAQwM,EAAOlsB,QAAUksB,EAAO,KAAO9U,EAAO,GAC1CD,GAAiB+U,GACjB,MA0BFC,GAAiBpP,IAAS,SAAS3F,GACrC,IAAI/W,EAAWyX,GAAKV,GAChB8U,EAAS9qB,GAASgW,EAAQsI,IAO9B,OALIrf,IAAayX,GAAKoU,GACpB7rB,EAAW7M,EAEX04B,EAAOvc,MAEDuc,EAAOlsB,QAAUksB,EAAO,KAAO9U,EAAO,GAC1CD,GAAiB+U,EAAQnQ,GAAY1b,EAAU,IAC/C,MAwBF+rB,GAAmBrP,IAAS,SAAS3F,GACvC,IAAIjW,EAAa2W,GAAKV,GAClB8U,EAAS9qB,GAASgW,EAAQsI,IAM9B,OAJAve,EAAkC,mBAAdA,EAA2BA,EAAa3N,EACxD2N,GACF+qB,EAAOvc,MAEDuc,EAAOlsB,QAAUksB,EAAO,KAAO9U,EAAO,GAC1CD,GAAiB+U,EAAQ14B,EAAW2N,GACpC,MAkBN,SAAS7E,GAAK6D,EAAOksB,GACnB,OAAgB,MAATlsB,EAAgB,GAAKkK,GAAWpK,KAAKE,EAAOksB,GAiBrD,SAASvU,GAAK3X,GACZ,IAAIH,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAOA,EAASG,EAAMH,EAAS,GAAKxM,EAwBtC,SAAS84B,GAAYnsB,EAAOK,EAAOiC,GACjC,IAAIzC,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIO,EAAQP,EAKZ,OAJIyC,IAAcjP,IAChB+M,EAAQkV,GAAUhT,GAClBlC,EAAQA,EAAQ,EAAIgK,GAAUvK,EAASO,EAAO,GAAKkK,GAAUlK,EAAOP,EAAS,IAExEQ,IAAUA,EACbuF,GAAkB5F,EAAOK,EAAOD,GAChCiC,GAAcrC,EAAOyC,GAAWrC,GAAO,GAwB7C,SAASgsB,GAAIpsB,EAAOqD,GAClB,OAAQrD,GAASA,EAAMH,OAAU4b,GAAQzb,EAAOsV,GAAUjS,IAAMhQ,EA0BlE,IAAIg5B,GAAOzP,GAAS0P,IAsBpB,SAASA,GAAQtsB,EAAOoB,GACtB,OAAQpB,GAASA,EAAMH,QAAUuB,GAAUA,EAAOvB,OAC9Csc,GAAYnc,EAAOoB,GACnBpB,EA0BN,SAASusB,GAAUvsB,EAAOoB,EAAQlB,GAChC,OAAQF,GAASA,EAAMH,QAAUuB,GAAUA,EAAOvB,OAC9Csc,GAAYnc,EAAOoB,EAAQwa,GAAY1b,EAAU,IACjDF,EA0BN,SAASwsB,GAAYxsB,EAAOoB,EAAQJ,GAClC,OAAQhB,GAASA,EAAMH,QAAUuB,GAAUA,EAAOvB,OAC9Csc,GAAYnc,EAAOoB,EAAQ/N,EAAW2N,GACtChB,EA2BN,IAAIysB,GAASrI,IAAS,SAASpkB,EAAOsc,GACpC,IAAIzc,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACnCe,EAAS4R,GAAOxS,EAAOsc,GAM3B,OAJAD,GAAWrc,EAAOiB,GAASqb,GAAS,SAASlc,GAC3C,OAAOkR,GAAQlR,EAAOP,IAAWO,EAAQA,KACxC8C,KAAKyd,KAED/f,KA+BT,SAAS8rB,GAAO1sB,EAAOS,GACrB,IAAIG,EAAS,GACb,IAAMZ,IAASA,EAAMH,OACnB,OAAOe,EAET,IAAIR,GAAS,EACTkc,EAAU,GACVzc,EAASG,EAAMH,OAEnBY,EAAYmb,GAAYnb,EAAW,GACnC,QAASL,EAAQP,EAAQ,CACvB,IAAIQ,EAAQL,EAAMI,GACdK,EAAUJ,EAAOD,EAAOJ,KAC1BY,EAAOoE,KAAK3E,GACZic,EAAQtX,KAAK5E,IAIjB,OADAic,GAAWrc,EAAOsc,GACX1b,EA0BT,SAASiK,GAAQ7K,GACf,OAAgB,MAATA,EAAgBA,EAAQ4K,GAAc9K,KAAKE,GAmBpD,SAAS8f,GAAM9f,EAAOgO,EAAOC,GAC3B,IAAIpO,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAKA,GAGDoO,GAAqB,iBAAPA,GAAmByU,GAAe1iB,EAAOgO,EAAOC,IAChED,EAAQ,EACRC,EAAMpO,IAGNmO,EAAiB,MAATA,EAAgB,EAAIsH,GAAUtH,GACtCC,EAAMA,IAAQ5a,EAAYwM,EAASyV,GAAUrH,IAExCqP,GAAUtd,EAAOgO,EAAOC,IAVtB,GA8BX,SAAS0e,GAAY3sB,EAAOK,GAC1B,OAAOmd,GAAgBxd,EAAOK,GA4BhC,SAASusB,GAAc5sB,EAAOK,EAAOH,GACnC,OAAO2d,GAAkB7d,EAAOK,EAAOub,GAAY1b,EAAU,IAmB/D,SAAS2sB,GAAc7sB,EAAOK,GAC5B,IAAIR,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,GAAIA,EAAQ,CACV,IAAIO,EAAQod,GAAgBxd,EAAOK,GACnC,GAAID,EAAQP,GAAUiS,GAAG9R,EAAMI,GAAQC,GACrC,OAAOD,EAGX,OAAQ,EAqBV,SAAS0sB,GAAgB9sB,EAAOK,GAC9B,OAAOmd,GAAgBxd,EAAOK,GAAO,GA4BvC,SAAS0sB,GAAkB/sB,EAAOK,EAAOH,GACvC,OAAO2d,GAAkB7d,EAAOK,EAAOub,GAAY1b,EAAU,IAAI,GAmBnE,SAAS8sB,GAAkBhtB,EAAOK,GAChC,IAAIR,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,GAAIA,EAAQ,CACV,IAAIO,EAAQod,GAAgBxd,EAAOK,GAAO,GAAQ,EAClD,GAAIyR,GAAG9R,EAAMI,GAAQC,GACnB,OAAOD,EAGX,OAAQ,EAkBV,SAAS6sB,GAAWjtB,GAClB,OAAQA,GAASA,EAAMH,OACnB0e,GAAeve,GACf,GAmBN,SAASktB,GAAaltB,EAAOE,GAC3B,OAAQF,GAASA,EAAMH,OACnB0e,GAAeve,EAAO4b,GAAY1b,EAAU,IAC5C,GAiBN,SAASitB,GAAKntB,GACZ,IAAIH,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAOA,EAASyd,GAAUtd,EAAO,EAAGH,GAAU,GA4BhD,SAASutB,GAAKptB,EAAOqD,EAAGof,GACtB,OAAMziB,GAASA,EAAMH,QAGrBwD,EAAKof,GAASpf,IAAMhQ,EAAa,EAAIiiB,GAAUjS,GACxCia,GAAUtd,EAAO,EAAGqD,EAAI,EAAI,EAAIA,IAH9B,GA+BX,SAASgqB,GAAUrtB,EAAOqD,EAAGof,GAC3B,IAAI5iB,EAAkB,MAATG,EAAgB,EAAIA,EAAMH,OACvC,OAAKA,GAGLwD,EAAKof,GAASpf,IAAMhQ,EAAa,EAAIiiB,GAAUjS,GAC/CA,EAAIxD,EAASwD,EACNia,GAAUtd,EAAOqD,EAAI,EAAI,EAAIA,EAAGxD,IAJ9B,GA0CX,SAASytB,GAAettB,EAAOS,GAC7B,OAAQT,GAASA,EAAMH,OACnBkf,GAAU/e,EAAO4b,GAAYnb,EAAW,IAAI,GAAO,GACnD,GAsCN,SAAS8sB,GAAUvtB,EAAOS,GACxB,OAAQT,GAASA,EAAMH,OACnBkf,GAAU/e,EAAO4b,GAAYnb,EAAW,IACxC,GAmBN,IAAI+sB,GAAQ5Q,IAAS,SAAS3F,GAC5B,OAAOyH,GAASjJ,GAAYwB,EAAQ,EAAGoE,IAAmB,OA0BxDoS,GAAU7Q,IAAS,SAAS3F,GAC9B,IAAI/W,EAAWyX,GAAKV,GAIpB,OAHIoE,GAAkBnb,KACpBA,EAAW7M,GAENqrB,GAASjJ,GAAYwB,EAAQ,EAAGoE,IAAmB,GAAOO,GAAY1b,EAAU,OAwBrFwtB,GAAY9Q,IAAS,SAAS3F,GAChC,IAAIjW,EAAa2W,GAAKV,GAEtB,OADAjW,EAAkC,mBAAdA,EAA2BA,EAAa3N,EACrDqrB,GAASjJ,GAAYwB,EAAQ,EAAGoE,IAAmB,GAAOhoB,EAAW2N,MAqB9E,SAAS2sB,GAAK3tB,GACZ,OAAQA,GAASA,EAAMH,OAAU6e,GAAS1e,GAAS,GA0BrD,SAAS4tB,GAAO5tB,EAAOE,GACrB,OAAQF,GAASA,EAAMH,OAAU6e,GAAS1e,EAAO4b,GAAY1b,EAAU,IAAM,GAuB/E,SAAS2tB,GAAS7tB,EAAOgB,GAEvB,OADAA,EAAkC,mBAAdA,EAA2BA,EAAa3N,EACpD2M,GAASA,EAAMH,OAAU6e,GAAS1e,EAAO3M,EAAW2N,GAAc,GAsB5E,SAAS8sB,GAAM9tB,GACb,IAAMA,IAASA,EAAMH,OACnB,MAAO,GAET,IAAIA,EAAS,EAOb,OANAG,EAAQU,GAAYV,GAAO,SAAS+tB,GAClC,GAAI1S,GAAkB0S,GAEpB,OADAluB,EAASuK,GAAU2jB,EAAMluB,OAAQA,IAC1B,KAGJuD,GAAUvD,GAAQ,SAASO,GAChC,OAAOa,GAASjB,EAAO2B,GAAavB,OAyBxC,SAAS4tB,GAAUhuB,EAAOE,GACxB,IAAMF,IAASA,EAAMH,OACnB,MAAO,GAET,IAAIe,EAASktB,GAAM9tB,GACnB,OAAgB,MAAZE,EACKU,EAEFK,GAASL,GAAQ,SAASmtB,GAC/B,OAAOtuB,GAAMS,EAAU7M,EAAW06B,MAwBtC,IAAIE,GAAUrR,IAAS,SAAS5c,EAAOoB,GACrC,OAAOia,GAAkBrb,GACrBuU,GAAevU,EAAOoB,GACtB,MAqBF8sB,GAAMtR,IAAS,SAAS3F,GAC1B,OAAOkI,GAAQze,GAAYuW,EAAQoE,QA0BjC8S,GAAQvR,IAAS,SAAS3F,GAC5B,IAAI/W,EAAWyX,GAAKV,GAIpB,OAHIoE,GAAkBnb,KACpBA,EAAW7M,GAEN8rB,GAAQze,GAAYuW,EAAQoE,IAAoBO,GAAY1b,EAAU,OAwB3EkuB,GAAUxR,IAAS,SAAS3F,GAC9B,IAAIjW,EAAa2W,GAAKV,GAEtB,OADAjW,EAAkC,mBAAdA,EAA2BA,EAAa3N,EACrD8rB,GAAQze,GAAYuW,EAAQoE,IAAoBhoB,EAAW2N,MAmBhEqtB,GAAMzR,GAASkR,IAkBnB,SAASQ,GAAU/qB,EAAOnC,GACxB,OAAOge,GAAc7b,GAAS,GAAInC,GAAU,GAAI4Q,IAkBlD,SAASuc,GAAchrB,EAAOnC,GAC5B,OAAOge,GAAc7b,GAAS,GAAInC,GAAU,GAAI6a,IAuBlD,IAAIuS,GAAU5R,IAAS,SAAS3F,GAC9B,IAAIpX,EAASoX,EAAOpX,OAChBK,EAAWL,EAAS,EAAIoX,EAAOpX,EAAS,GAAKxM,EAGjD,OADA6M,EAA8B,mBAAZA,GAA0B+W,EAAOzH,MAAOtP,GAAY7M,EAC/D26B,GAAU/W,EAAQ/W,MAkC3B,SAASuuB,GAAMpuB,GACb,IAAIO,EAASoL,GAAO3L,GAEpB,OADAO,EAAOiM,WAAY,EACZjM,EA0BT,SAAS8tB,GAAIruB,EAAOsuB,GAElB,OADAA,EAAYtuB,GACLA,EA0BT,SAASkkB,GAAKlkB,EAAOsuB,GACnB,OAAOA,EAAYtuB,GAmBrB,IAAIuuB,GAAYxK,IAAS,SAAS3R,GAChC,IAAI5S,EAAS4S,EAAM5S,OACfmO,EAAQnO,EAAS4S,EAAM,GAAK,EAC5BpS,EAAQ3N,KAAKia,YACbgiB,EAAc,SAAS9rB,GAAU,OAAO2P,GAAO3P,EAAQ4P,IAE3D,QAAI5S,EAAS,GAAKnN,KAAKka,YAAY/M,SAC7BQ,aAAiB8L,IAAiBmF,GAAQtD,IAGhD3N,EAAQA,EAAMyf,MAAM9R,GAAQA,GAASnO,EAAS,EAAI,IAClDQ,EAAMuM,YAAY5H,KAAK,CACrB,KAAQuf,GACR,KAAQ,CAACoK,GACT,QAAWt7B,IAEN,IAAI+Y,GAAc/L,EAAO3N,KAAKma,WAAW0X,MAAK,SAASvkB,GAI5D,OAHIH,IAAWG,EAAMH,QACnBG,EAAMgF,KAAK3R,GAEN2M,MAZAtN,KAAK6xB,KAAKoK,MA2CrB,SAASE,KACP,OAAOJ,GAAM/7B,MA6Bf,SAASo8B,KACP,OAAO,IAAI1iB,GAAc1Z,KAAK2N,QAAS3N,KAAKma,WAyB9C,SAASkiB,KACHr8B,KAAKqa,aAAe1Z,IACtBX,KAAKqa,WAAaiiB,GAAQt8B,KAAK2N,UAEjC,IAAI0E,EAAOrS,KAAKoa,WAAapa,KAAKqa,WAAWlN,OACzCQ,EAAQ0E,EAAO1R,EAAYX,KAAKqa,WAAWra,KAAKoa,aAEpD,MAAO,CAAE,KAAQ/H,EAAM,MAAS1E,GAqBlC,SAAS4uB,KACP,OAAOv8B,KA2BT,SAASw8B,GAAa7uB,GACpB,IAAIO,EACA8W,EAAShlB,KAEb,MAAOglB,aAAkBjL,GAAY,CACnC,IAAIe,EAAQnB,GAAaqL,GACzBlK,EAAMV,UAAY,EAClBU,EAAMT,WAAa1Z,EACfuN,EACF2b,EAAS5P,YAAca,EAEvB5M,EAAS4M,EAEX,IAAI+O,EAAW/O,EACfkK,EAASA,EAAO/K,YAGlB,OADA4P,EAAS5P,YAActM,EAChBO,EAuBT,SAASuuB,KACP,IAAI9uB,EAAQ3N,KAAKia,YACjB,GAAItM,aAAiB8L,GAAa,CAChC,IAAIijB,EAAU/uB,EAUd,OATI3N,KAAKka,YAAY/M,SACnBuvB,EAAU,IAAIjjB,GAAYzZ,OAE5B08B,EAAUA,EAAQvkB,UAClBukB,EAAQxiB,YAAY5H,KAAK,CACvB,KAAQuf,GACR,KAAQ,CAAC1Z,IACT,QAAWxX,IAEN,IAAI+Y,GAAcgjB,EAAS18B,KAAKma,WAEzC,OAAOna,KAAK6xB,KAAK1Z,IAiBnB,SAASwkB,KACP,OAAOhhB,GAAiB3b,KAAKia,YAAaja,KAAKka,aA2BjD,IAAI0iB,GAAUlN,IAAiB,SAASxhB,EAAQP,EAAO+B,GACjDiF,GAAevH,KAAKc,EAAQwB,KAC5BxB,EAAOwB,GAET2P,GAAgBnR,EAAQwB,EAAK,MA6CjC,SAASmtB,GAAMrtB,EAAYzB,EAAWgiB,GACpC,IAAI/iB,EAAOwM,GAAQhK,GAAc1B,GAAa0U,GAI9C,OAHIuN,GAASC,GAAexgB,EAAYzB,EAAWgiB,KACjDhiB,EAAYpN,GAEPqM,EAAKwC,EAAY0Z,GAAYnb,EAAW,IA4CjD,SAAS+uB,GAAOttB,EAAYzB,GAC1B,IAAIf,EAAOwM,GAAQhK,GAAcxB,GAAc8U,GAC/C,OAAO9V,EAAKwC,EAAY0Z,GAAYnb,EAAW,IAuCjD,IAAIgvB,GAAOxL,GAAWsH,IAqBlBmE,GAAWzL,GAAWuH,IAuB1B,SAASmE,GAAQztB,EAAYhC,GAC3B,OAAOuV,GAAYvQ,GAAIhD,EAAYhC,GAAW,GAuBhD,SAAS0vB,GAAY1tB,EAAYhC,GAC/B,OAAOuV,GAAYvQ,GAAIhD,EAAYhC,GAAW/K,GAwBhD,SAAS06B,GAAa3tB,EAAYhC,EAAUwV,GAE1C,OADAA,EAAQA,IAAUriB,EAAY,EAAIiiB,GAAUI,GACrCD,GAAYvQ,GAAIhD,EAAYhC,GAAWwV,GAiChD,SAAStQ,GAAQlD,EAAYhC,GAC3B,IAAIR,EAAOwM,GAAQhK,GAAc5B,GAAY6R,GAC7C,OAAOzS,EAAKwC,EAAY0Z,GAAY1b,EAAU,IAuBhD,SAAS4vB,GAAa5tB,EAAYhC,GAChC,IAAIR,EAAOwM,GAAQhK,GAAc3B,GAAiByU,GAClD,OAAOtV,EAAKwC,EAAY0Z,GAAY1b,EAAU,IA0BhD,IAAI6vB,GAAU3N,IAAiB,SAASxhB,EAAQP,EAAO+B,GACjDiF,GAAevH,KAAKc,EAAQwB,GAC9BxB,EAAOwB,GAAK4C,KAAK3E,GAEjB0R,GAAgBnR,EAAQwB,EAAK,CAAC/B,OAkClC,SAASmU,GAAStS,EAAY7B,EAAOiC,EAAWmgB,GAC9CvgB,EAAasY,GAAYtY,GAAcA,EAAad,GAAOc,GAC3DI,EAAaA,IAAcmgB,EAASnN,GAAUhT,GAAa,EAE3D,IAAIzC,EAASqC,EAAWrC,OAIxB,OAHIyC,EAAY,IACdA,EAAY8H,GAAUvK,EAASyC,EAAW,IAErC0tB,GAAS9tB,GACXI,GAAazC,GAAUqC,EAAWka,QAAQ/b,EAAOiC,IAAc,IAC7DzC,GAAUiB,GAAYoB,EAAY7B,EAAOiC,IAAc,EA0BhE,IAAI2tB,GAAYrT,IAAS,SAAS1a,EAAYiU,EAAMvW,GAClD,IAAIQ,GAAS,EACToT,EAAwB,mBAAR2C,EAChBvV,EAAS4Z,GAAYtY,GAAchB,EAAMgB,EAAWrC,QAAU,GAKlE,OAHAsS,GAASjQ,GAAY,SAAS7B,GAC5BO,IAASR,GAASoT,EAAS/T,GAAM0W,EAAM9V,EAAOT,GAAQ6X,GAAWpX,EAAO8V,EAAMvW,MAEzEgB,KA+BLsvB,GAAQ9N,IAAiB,SAASxhB,EAAQP,EAAO+B,GACnD2P,GAAgBnR,EAAQwB,EAAK/B,MA6C/B,SAAS6E,GAAIhD,EAAYhC,GACvB,IAAIR,EAAOwM,GAAQhK,GAAcjB,GAAWsZ,GAC5C,OAAO7a,EAAKwC,EAAY0Z,GAAY1b,EAAU,IAgChD,SAASiwB,GAAQjuB,EAAYgM,EAAWyN,EAAQ8G,GAC9C,OAAkB,MAAdvgB,EACK,IAEJgK,GAAQgC,KACXA,EAAyB,MAAbA,EAAoB,GAAK,CAACA,IAExCyN,EAAS8G,EAAQpvB,EAAYsoB,EACxBzP,GAAQyP,KACXA,EAAmB,MAAVA,EAAiB,GAAK,CAACA,IAE3BD,GAAYxZ,EAAYgM,EAAWyN,IAuC5C,IAAIyU,GAAYhO,IAAiB,SAASxhB,EAAQP,EAAO+B,GACvDxB,EAAOwB,EAAM,EAAI,GAAG4C,KAAK3E,MACxB,WAAa,MAAO,CAAC,GAAI,OAuC5B,SAASgwB,GAAOnuB,EAAYhC,EAAUC,GACpC,IAAIT,EAAOwM,GAAQhK,GAAcZ,GAAcyB,GAC3CxB,EAAY2hB,UAAUrjB,OAAS,EAEnC,OAAOH,EAAKwC,EAAY0Z,GAAY1b,EAAU,GAAIC,EAAaoB,EAAW4Q,IAyB5E,SAASme,GAAYpuB,EAAYhC,EAAUC,GACzC,IAAIT,EAAOwM,GAAQhK,GAAcV,GAAmBuB,GAChDxB,EAAY2hB,UAAUrjB,OAAS,EAEnC,OAAOH,EAAKwC,EAAY0Z,GAAY1b,EAAU,GAAIC,EAAaoB,EAAWyT,IAqC5E,SAASub,GAAOruB,EAAYzB,GAC1B,IAAIf,EAAOwM,GAAQhK,GAAcxB,GAAc8U,GAC/C,OAAO9V,EAAKwC,EAAYsuB,GAAO5U,GAAYnb,EAAW,KAiBxD,SAASgwB,GAAOvuB,GACd,IAAIxC,EAAOwM,GAAQhK,GAAcqP,GAAcwL,GAC/C,OAAOrd,EAAKwC,GAuBd,SAASwuB,GAAWxuB,EAAYmB,EAAGof,GAE/Bpf,GADGof,EAAQC,GAAexgB,EAAYmB,EAAGof,GAASpf,IAAMhQ,GACpD,EAEAiiB,GAAUjS,GAEhB,IAAI3D,EAAOwM,GAAQhK,GAAcuP,GAAkBuL,GACnD,OAAOtd,EAAKwC,EAAYmB,GAkB1B,SAASstB,GAAQzuB,GACf,IAAIxC,EAAOwM,GAAQhK,GAAc0P,GAAeyL,GAChD,OAAO3d,EAAKwC,GAwBd,SAASiD,GAAKjD,GACZ,GAAkB,MAAdA,EACF,OAAO,EAET,GAAIsY,GAAYtY,GACd,OAAO8tB,GAAS9tB,GAAc2D,GAAW3D,GAAcA,EAAWrC,OAEpE,IAAIyT,EAAMC,GAAOrR,GACjB,OAAIoR,GAAOld,GAAUkd,GAAO3c,GACnBuL,EAAWiD,KAEb8U,GAAS/X,GAAYrC,OAuC9B,SAAS+wB,GAAK1uB,EAAYzB,EAAWgiB,GACnC,IAAI/iB,EAAOwM,GAAQhK,GAAcT,GAAY8b,GAI7C,OAHIkF,GAASC,GAAexgB,EAAYzB,EAAWgiB,KACjDhiB,EAAYpN,GAEPqM,EAAKwC,EAAY0Z,GAAYnb,EAAW,IAgCjD,IAAIowB,GAASjU,IAAS,SAAS1a,EAAYgM,GACzC,GAAkB,MAAdhM,EACF,MAAO,GAET,IAAIrC,EAASqO,EAAUrO,OAMvB,OALIA,EAAS,GAAK6iB,GAAexgB,EAAYgM,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACHrO,EAAS,GAAK6iB,GAAexU,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElBwN,GAAYxZ,EAAYuT,GAAYvH,EAAW,GAAI,OAqBxD7E,GAAMD,IAAU,WAClB,OAAOpL,GAAKyI,KAAK4C,OA6BnB,SAASynB,GAAMztB,EAAG3D,GAChB,GAAmB,mBAARA,EACT,MAAM,IAAImH,GAAUpT,GAGtB,OADA4P,EAAIiS,GAAUjS,GACP,WACL,KAAMA,EAAI,EACR,OAAO3D,EAAKD,MAAM/M,KAAMwwB,YAsB9B,SAAS8B,GAAItlB,EAAM2D,EAAGof,GAGpB,OAFApf,EAAIof,EAAQpvB,EAAYgQ,EACxBA,EAAK3D,GAAa,MAAL2D,EAAa3D,EAAKG,OAASwD,EACjC8jB,GAAWznB,EAAMjL,EAAepB,EAAWA,EAAWA,EAAWA,EAAWgQ,GAoBrF,SAAS0tB,GAAO1tB,EAAG3D,GACjB,IAAIkB,EACJ,GAAmB,mBAARlB,EACT,MAAM,IAAImH,GAAUpT,GAGtB,OADA4P,EAAIiS,GAAUjS,GACP,WAOL,QANMA,EAAI,IACRzC,EAASlB,EAAKD,MAAM/M,KAAMwwB,YAExB7f,GAAK,IACP3D,EAAOrM,GAEFuN,GAuCX,IAAIowB,GAAOpU,IAAS,SAASld,EAAMC,EAASwhB,GAC1C,IAAIpO,EAAU7e,EACd,GAAIitB,EAASthB,OAAQ,CACnB,IAAIuhB,EAAU5b,GAAe2b,EAAU2C,GAAUkN,KACjDje,GAAWxe,EAEb,OAAO4yB,GAAWznB,EAAMqT,EAASpT,EAASwhB,EAAUC,MAgDlD6P,GAAUrU,IAAS,SAAS/Z,EAAQT,EAAK+e,GAC3C,IAAIpO,EAAU7e,EAAiBC,EAC/B,GAAIgtB,EAASthB,OAAQ,CACnB,IAAIuhB,EAAU5b,GAAe2b,EAAU2C,GAAUmN,KACjDle,GAAWxe,EAEb,OAAO4yB,GAAW/kB,EAAK2Q,EAASlQ,EAAQse,EAAUC,MA4CpD,SAAS8P,GAAMxxB,EAAMmkB,EAAOpB,GAC1BoB,EAAQpB,EAAQpvB,EAAYwwB,EAC5B,IAAIjjB,EAASumB,GAAWznB,EAAMrL,EAAiBhB,EAAWA,EAAWA,EAAWA,EAAWA,EAAWwwB,GAEtG,OADAjjB,EAAOsD,YAAcgtB,GAAMhtB,YACpBtD,EAyCT,SAASuwB,GAAWzxB,EAAMmkB,EAAOpB,GAC/BoB,EAAQpB,EAAQpvB,EAAYwwB,EAC5B,IAAIjjB,EAASumB,GAAWznB,EAAMpL,EAAuBjB,EAAWA,EAAWA,EAAWA,EAAWA,EAAWwwB,GAE5G,OADAjjB,EAAOsD,YAAcitB,GAAWjtB,YACzBtD,EAyDT,SAASwwB,GAAS1xB,EAAM4U,EAAM+c,GAC5B,IAAIC,EACAC,EACAC,EACA5wB,EACA6wB,EACAC,EACAC,EAAiB,EACjBC,GAAU,EACVC,GAAS,EACTvO,GAAW,EAEf,GAAmB,mBAAR5jB,EACT,MAAM,IAAImH,GAAUpT,GAUtB,SAASq+B,EAAWC,GAClB,IAAInyB,EAAO0xB,EACP3xB,EAAU4xB,EAKd,OAHAD,EAAWC,EAAWl+B,EACtBs+B,EAAiBI,EACjBnxB,EAASlB,EAAKD,MAAME,EAASC,GACtBgB,EAGT,SAASoxB,EAAYD,GAMnB,OAJAJ,EAAiBI,EAEjBN,EAAUloB,GAAW0oB,EAAc3d,GAE5Bsd,EAAUE,EAAWC,GAAQnxB,EAGtC,SAASsxB,EAAcH,GACrB,IAAII,EAAoBJ,EAAOL,EAC3BU,EAAsBL,EAAOJ,EAC7BU,EAAc/d,EAAO6d,EAEzB,OAAON,EACHvnB,GAAU+nB,EAAab,EAAUY,GACjCC,EAGN,SAASC,EAAaP,GACpB,IAAII,EAAoBJ,EAAOL,EAC3BU,EAAsBL,EAAOJ,EAKjC,OAAQD,IAAiBr+B,GAAc8+B,GAAqB7d,GACzD6d,EAAoB,GAAON,GAAUO,GAAuBZ,EAGjE,SAASS,IACP,IAAIF,EAAO1oB,KACX,GAAIipB,EAAaP,GACf,OAAOQ,EAAaR,GAGtBN,EAAUloB,GAAW0oB,EAAcC,EAAcH,IAGnD,SAASQ,EAAaR,GAKpB,OAJAN,EAAUp+B,EAINiwB,GAAYgO,EACPQ,EAAWC,IAEpBT,EAAWC,EAAWl+B,EACfuN,GAGT,SAAS4xB,IACHf,IAAYp+B,GACd8V,GAAasoB,GAEfE,EAAiB,EACjBL,EAAWI,EAAeH,EAAWE,EAAUp+B,EAGjD,SAASo/B,IACP,OAAOhB,IAAYp+B,EAAYuN,EAAS2xB,EAAalpB,MAGvD,SAASqpB,IACP,IAAIX,EAAO1oB,KACPspB,EAAaL,EAAaP,GAM9B,GAJAT,EAAWpO,UACXqO,EAAW7+B,KACXg/B,EAAeK,EAEXY,EAAY,CACd,GAAIlB,IAAYp+B,EACd,OAAO2+B,EAAYN,GAErB,GAAIG,EAIF,OAFA1oB,GAAasoB,GACbA,EAAUloB,GAAW0oB,EAAc3d,GAC5Bwd,EAAWJ,GAMtB,OAHID,IAAYp+B,IACdo+B,EAAUloB,GAAW0oB,EAAc3d,IAE9B1T,EAIT,OA3GA0T,EAAO+R,GAAS/R,IAAS,EACrB9H,GAAS6kB,KACXO,IAAYP,EAAQO,QACpBC,EAAS,YAAaR,EACtBG,EAAUK,EAASznB,GAAUic,GAASgL,EAAQG,UAAY,EAAGld,GAAQkd,EACrElO,EAAW,aAAc+N,IAAYA,EAAQ/N,SAAWA,GAoG1DoP,EAAUF,OAASA,EACnBE,EAAUD,MAAQA,EACXC,EAqBT,IAAIE,GAAQhW,IAAS,SAASld,EAAME,GAClC,OAAOyU,GAAU3U,EAAM,EAAGE,MAsBxBizB,GAAQjW,IAAS,SAASld,EAAM4U,EAAM1U,GACxC,OAAOyU,GAAU3U,EAAM2mB,GAAS/R,IAAS,EAAG1U,MAqB9C,SAASkzB,GAAKpzB,GACZ,OAAOynB,GAAWznB,EAAM/K,GA+C1B,SAASg1B,GAAQjqB,EAAMqzB,GACrB,GAAmB,mBAARrzB,GAAmC,MAAZqzB,GAAuC,mBAAZA,EAC3D,MAAM,IAAIlsB,GAAUpT,GAEtB,IAAIu/B,EAAW,WACb,IAAIpzB,EAAOsjB,UACP9gB,EAAM2wB,EAAWA,EAAStzB,MAAM/M,KAAMkN,GAAQA,EAAK,GACnD+D,EAAQqvB,EAASrvB,MAErB,GAAIA,EAAMC,IAAIxB,GACZ,OAAOuB,EAAMsM,IAAI7N,GAEnB,IAAIxB,EAASlB,EAAKD,MAAM/M,KAAMkN,GAE9B,OADAozB,EAASrvB,MAAQA,EAAM+B,IAAItD,EAAKxB,IAAW+C,EACpC/C,GAGT,OADAoyB,EAASrvB,MAAQ,IAAKgmB,GAAQsJ,OAASrjB,IAChCojB,EA0BT,SAASxC,GAAO/vB,GACd,GAAwB,mBAAbA,EACT,MAAM,IAAIoG,GAAUpT,GAEtB,OAAO,WACL,IAAImM,EAAOsjB,UACX,OAAQtjB,EAAKC,QACX,KAAK,EAAG,OAAQY,EAAUX,KAAKpN,MAC/B,KAAK,EAAG,OAAQ+N,EAAUX,KAAKpN,KAAMkN,EAAK,IAC1C,KAAK,EAAG,OAAQa,EAAUX,KAAKpN,KAAMkN,EAAK,GAAIA,EAAK,IACnD,KAAK,EAAG,OAAQa,EAAUX,KAAKpN,KAAMkN,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE9D,OAAQa,EAAUhB,MAAM/M,KAAMkN,IAsBlC,SAASszB,GAAKxzB,GACZ,OAAOqxB,GAAO,EAAGrxB,GAzDnBiqB,GAAQsJ,MAAQrjB,GA2FhB,IAAIujB,GAAWzT,IAAS,SAAShgB,EAAMopB,GACrCA,EAAmC,GAArBA,EAAWjpB,QAAeqM,GAAQ4c,EAAW,IACvD7nB,GAAS6nB,EAAW,GAAItlB,GAAUoY,OAClC3a,GAASwU,GAAYqT,EAAY,GAAItlB,GAAUoY,OAEnD,IAAIwX,EAActK,EAAWjpB,OAC7B,OAAO+c,IAAS,SAAShd,GACvB,IAAIQ,GAAS,EACTP,EAASyK,GAAU1K,EAAKC,OAAQuzB,GAEpC,QAAShzB,EAAQP,EACfD,EAAKQ,GAAS0oB,EAAW1oB,GAAON,KAAKpN,KAAMkN,EAAKQ,IAElD,OAAOX,GAAMC,EAAMhN,KAAMkN,SAqCzByzB,GAAUzW,IAAS,SAASld,EAAMyhB,GACpC,IAAIC,EAAU5b,GAAe2b,EAAU2C,GAAUuP,KACjD,OAAOlM,GAAWznB,EAAMnL,EAAmBlB,EAAW8tB,EAAUC,MAmC9DkS,GAAe1W,IAAS,SAASld,EAAMyhB,GACzC,IAAIC,EAAU5b,GAAe2b,EAAU2C,GAAUwP,KACjD,OAAOnM,GAAWznB,EAAMlL,EAAyBnB,EAAW8tB,EAAUC,MAyBpEmS,GAAQnP,IAAS,SAAS1kB,EAAM4c,GAClC,OAAO6K,GAAWznB,EAAMhL,EAAiBrB,EAAWA,EAAWA,EAAWipB,MA4B5E,SAASkX,GAAK9zB,EAAMsO,GAClB,GAAmB,mBAARtO,EACT,MAAM,IAAImH,GAAUpT,GAGtB,OADAua,EAAQA,IAAU3a,EAAY2a,EAAQsH,GAAUtH,GACzC4O,GAASld,EAAMsO,GAqCxB,SAASylB,GAAO/zB,EAAMsO,GACpB,GAAmB,mBAARtO,EACT,MAAM,IAAImH,GAAUpT,GAGtB,OADAua,EAAiB,MAATA,EAAgB,EAAI5D,GAAUkL,GAAUtH,GAAQ,GACjD4O,IAAS,SAAShd,GACvB,IAAII,EAAQJ,EAAKoO,GACb+b,EAAYpK,GAAU/f,EAAM,EAAGoO,GAKnC,OAHIhO,GACFmB,GAAU4oB,EAAW/pB,GAEhBP,GAAMC,EAAMhN,KAAMq3B,MAgD7B,SAAS2J,GAASh0B,EAAM4U,EAAM+c,GAC5B,IAAIO,GAAU,EACVtO,GAAW,EAEf,GAAmB,mBAAR5jB,EACT,MAAM,IAAImH,GAAUpT,GAMtB,OAJI+Y,GAAS6kB,KACXO,EAAU,YAAaP,IAAYA,EAAQO,QAAUA,EACrDtO,EAAW,aAAc+N,IAAYA,EAAQ/N,SAAWA,GAEnD8N,GAAS1xB,EAAM4U,EAAM,CAC1B,QAAWsd,EACX,QAAWtd,EACX,SAAYgP,IAmBhB,SAASqQ,GAAMj0B,GACb,OAAOslB,GAAItlB,EAAM,GAyBnB,SAASk0B,GAAKvzB,EAAO2iB,GACnB,OAAOqQ,GAAQ7T,GAAawD,GAAU3iB,GAsCxC,SAASwzB,KACP,IAAK3Q,UAAUrjB,OACb,MAAO,GAET,IAAIQ,EAAQ6iB,UAAU,GACtB,OAAOhX,GAAQ7L,GAASA,EAAQ,CAACA,GA6BnC,SAASmN,GAAMnN,GACb,OAAOyS,GAAUzS,EAAOtM,GAkC1B,SAAS+/B,GAAUzzB,EAAO2S,GAExB,OADAA,EAAkC,mBAAdA,EAA2BA,EAAa3f,EACrDyf,GAAUzS,EAAOtM,EAAoBif,GAqB9C,SAAS+gB,GAAU1zB,GACjB,OAAOyS,GAAUzS,EAAOxM,EAAkBE,GA+B5C,SAASigC,GAAc3zB,EAAO2S,GAE5B,OADAA,EAAkC,mBAAdA,EAA2BA,EAAa3f,EACrDyf,GAAUzS,EAAOxM,EAAkBE,EAAoBif,GA2BhE,SAASihB,GAAWpxB,EAAQ1K,GAC1B,OAAiB,MAAVA,GAAkBic,GAAevR,EAAQ1K,EAAQuP,GAAKvP,IAmC/D,SAAS2Z,GAAGzR,EAAOuW,GACjB,OAAOvW,IAAUuW,GAAUvW,IAAUA,GAASuW,IAAUA,EA0B1D,IAAIsd,GAAK9N,GAA0BzP,IAyB/Bwd,GAAM/N,IAA0B,SAAS/lB,EAAOuW,GAClD,OAAOvW,GAASuW,KAqBd1F,GAAc0G,GAAgB,WAAa,OAAOsL,UAApB,IAAsCtL,GAAkB,SAASvX,GACjG,OAAO4L,GAAa5L,IAAUgH,GAAevH,KAAKO,EAAO,YACtDoI,GAAqB3I,KAAKO,EAAO,WA0BlC6L,GAAUhL,EAAMgL,QAmBhBpN,GAAgBD,GAAoB2E,GAAU3E,IAAqBgZ,GA2BvE,SAAS2C,GAAYna,GACnB,OAAgB,MAATA,GAAiBsZ,GAAStZ,EAAMR,UAAYoW,GAAW5V,GA4BhE,SAASgb,GAAkBhb,GACzB,OAAO4L,GAAa5L,IAAUma,GAAYna,GAoB5C,SAAS+zB,GAAU/zB,GACjB,OAAiB,IAAVA,IAA4B,IAAVA,GACtB4L,GAAa5L,IAAUmW,GAAWnW,IAAUvK,EAoBjD,IAAIiU,GAAWD,IAAkB2f,GAmB7BzqB,GAASD,GAAayE,GAAUzE,IAAc+Y,GAmBlD,SAASuc,GAAUh0B,GACjB,OAAO4L,GAAa5L,IAA6B,IAAnBA,EAAMlC,WAAmBod,GAAclb,GAoCvE,SAASi0B,GAAQj0B,GACf,GAAa,MAATA,EACF,OAAO,EAET,GAAIma,GAAYna,KACX6L,GAAQ7L,IAA0B,iBAATA,GAA4C,mBAAhBA,EAAMqI,QAC1DqB,GAAS1J,IAAUb,GAAaa,IAAU6Q,GAAY7Q,IAC1D,OAAQA,EAAMR,OAEhB,IAAIyT,EAAMC,GAAOlT,GACjB,GAAIiT,GAAOld,GAAUkd,GAAO3c,GAC1B,OAAQ0J,EAAM8E,KAEhB,GAAI+U,GAAY7Z,GACd,OAAQ4Z,GAAS5Z,GAAOR,OAE1B,IAAK,IAAIuC,KAAO/B,EACd,GAAIgH,GAAevH,KAAKO,EAAO+B,GAC7B,OAAO,EAGX,OAAO,EA+BT,SAASmyB,GAAQl0B,EAAOuW,GACtB,OAAOmB,GAAY1X,EAAOuW,GAmC5B,SAAS4d,GAAYn0B,EAAOuW,EAAO5D,GACjCA,EAAkC,mBAAdA,EAA2BA,EAAa3f,EAC5D,IAAIuN,EAASoS,EAAaA,EAAW3S,EAAOuW,GAASvjB,EACrD,OAAOuN,IAAWvN,EAAY0kB,GAAY1X,EAAOuW,EAAOvjB,EAAW2f,KAAgBpS,EAqBrF,SAAS6zB,GAAQp0B,GACf,IAAK4L,GAAa5L,GAChB,OAAO,EAET,IAAIiT,EAAMkD,GAAWnW,GACrB,OAAOiT,GAAOrd,GAAYqd,GAAOtd,GACN,iBAAjBqK,EAAM0nB,SAA4C,iBAAd1nB,EAAMynB,OAAqBvM,GAAclb,GA6BzF,SAAS4J,GAAS5J,GAChB,MAAuB,iBAATA,GAAqB2J,GAAe3J,GAoBpD,SAAS4V,GAAW5V,GAClB,IAAKmM,GAASnM,GACZ,OAAO,EAIT,IAAIiT,EAAMkD,GAAWnW,GACrB,OAAOiT,GAAOpd,GAAWod,GAAOnd,GAAUmd,GAAOzd,GAAYyd,GAAO7c,GA6BtE,SAASi+B,GAAUr0B,GACjB,MAAuB,iBAATA,GAAqBA,GAASiV,GAAUjV,GA6BxD,SAASsZ,GAAStZ,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAASjL,EA4B7C,SAASoX,GAASnM,GAChB,IAAImO,SAAcnO,EAClB,OAAgB,MAATA,IAA0B,UAARmO,GAA4B,YAARA,GA2B/C,SAASvC,GAAa5L,GACpB,OAAgB,MAATA,GAAiC,iBAATA,EAoBjC,IAAInB,GAAQD,GAAYuE,GAAUvE,IAAa+Z,GA8B/C,SAAS2b,GAAQ9xB,EAAQ1K,GACvB,OAAO0K,IAAW1K,GAAU8gB,GAAYpW,EAAQ1K,EAAQsiB,GAAatiB,IAmCvE,SAASy8B,GAAY/xB,EAAQ1K,EAAQ6a,GAEnC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAa3f,EACrD4lB,GAAYpW,EAAQ1K,EAAQsiB,GAAatiB,GAAS6a,GA+B3D,SAAS6hB,GAAMx0B,GAIb,OAAOy0B,GAASz0B,IAAUA,IAAUA,EA6BtC,SAAS00B,GAAS10B,GAChB,GAAImpB,GAAWnpB,GACb,MAAM,IAAIqG,EAAMlT,GAElB,OAAO6lB,GAAahZ,GAoBtB,SAAS20B,GAAO30B,GACd,OAAiB,OAAVA,EAuBT,SAAS40B,GAAM50B,GACb,OAAgB,MAATA,EA6BT,SAASy0B,GAASz0B,GAChB,MAAuB,iBAATA,GACX4L,GAAa5L,IAAUmW,GAAWnW,IAAUhK,EA+BjD,SAASklB,GAAclb,GACrB,IAAK4L,GAAa5L,IAAUmW,GAAWnW,IAAU9J,GAC/C,OAAO,EAET,IAAIgW,EAAQlE,GAAahI,GACzB,GAAc,OAAVkM,EACF,OAAO,EAET,IAAIuW,EAAOzb,GAAevH,KAAKyM,EAAO,gBAAkBA,EAAMsI,YAC9D,MAAsB,mBAARiO,GAAsBA,aAAgBA,GAClD3b,GAAarH,KAAKgjB,IAASjb,GAoB/B,IAAIzI,GAAWD,GAAeqE,GAAUrE,IAAgBqa,GA6BxD,SAAS0b,GAAc70B,GACrB,OAAOq0B,GAAUr0B,IAAUA,IAAUjL,GAAoBiL,GAASjL,EAoBpE,IAAIkK,GAAQD,GAAYmE,GAAUnE,IAAaoa,GAmB/C,SAASuW,GAAS3vB,GAChB,MAAuB,iBAATA,IACV6L,GAAQ7L,IAAU4L,GAAa5L,IAAUmW,GAAWnW,IAAUzJ,GAoBpE,SAASwe,GAAS/U,GAChB,MAAuB,iBAATA,GACX4L,GAAa5L,IAAUmW,GAAWnW,IAAUxJ,GAoBjD,IAAI2I,GAAeD,GAAmBiE,GAAUjE,IAAoBma,GAmBpE,SAASyb,GAAY90B,GACnB,OAAOA,IAAUhN,EAoBnB,SAAS+hC,GAAU/0B,GACjB,OAAO4L,GAAa5L,IAAUkT,GAAOlT,IAAUtJ,GAoBjD,SAASs+B,GAAUh1B,GACjB,OAAO4L,GAAa5L,IAAUmW,GAAWnW,IAAUrJ,GA0BrD,IAAIs+B,GAAKlP,GAA0B9L,IAyB/Bib,GAAMnP,IAA0B,SAAS/lB,EAAOuW,GAClD,OAAOvW,GAASuW,KA0BlB,SAASoY,GAAQ3uB,GACf,IAAKA,EACH,MAAO,GAET,GAAIma,GAAYna,GACd,OAAO2vB,GAAS3vB,GAAS0F,GAAc1F,GAASiN,GAAUjN,GAE5D,GAAIwI,IAAexI,EAAMwI,IACvB,OAAOlE,GAAgBtE,EAAMwI,OAE/B,IAAIyK,EAAMC,GAAOlT,GACbX,EAAO4T,GAAOld,EAAS6O,GAAcqO,GAAO3c,GAAS8O,GAAarE,GAEtE,OAAO1B,EAAKW,GA0Bd,SAAS8lB,GAAS9lB,GAChB,IAAKA,EACH,OAAiB,IAAVA,EAAcA,EAAQ,EAG/B,GADAA,EAAQgmB,GAAShmB,GACbA,IAAUlL,GAAYkL,KAAWlL,EAAU,CAC7C,IAAIqgC,EAAQn1B,EAAQ,GAAK,EAAI,EAC7B,OAAOm1B,EAAOngC,EAEhB,OAAOgL,IAAUA,EAAQA,EAAQ,EA6BnC,SAASiV,GAAUjV,GACjB,IAAIO,EAASulB,GAAS9lB,GAClBo1B,EAAY70B,EAAS,EAEzB,OAAOA,IAAWA,EAAU60B,EAAY70B,EAAS60B,EAAY70B,EAAU,EA8BzE,SAAS2U,GAASlV,GAChB,OAAOA,EAAQsR,GAAU2D,GAAUjV,GAAQ,EAAG9K,GAAoB,EA0BpE,SAAS8wB,GAAShmB,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAI+U,GAAS/U,GACX,OAAO/K,EAET,GAAIkX,GAASnM,GAAQ,CACnB,IAAIuW,EAAgC,mBAAjBvW,EAAMyL,QAAwBzL,EAAMyL,UAAYzL,EACnEA,EAAQmM,GAASoK,GAAUA,EAAQ,GAAMA,EAE3C,GAAoB,iBAATvW,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQA,EAAM2H,QAAQnP,GAAQ,IAC9B,IAAI68B,EAAWl8B,GAAWiL,KAAKpE,GAC/B,OAAQq1B,GAAYh8B,GAAU+K,KAAKpE,GAC/B5C,GAAa4C,EAAMyf,MAAM,GAAI4V,EAAW,EAAI,GAC3Cn8B,GAAWkL,KAAKpE,GAAS/K,GAAO+K,EA2BvC,SAASmb,GAAcnb,GACrB,OAAOgS,GAAWhS,EAAOkS,GAAOlS,IA2BlC,SAASs1B,GAAct1B,GACrB,OAAOA,EACHsR,GAAU2D,GAAUjV,IAASjL,EAAkBA,GACpC,IAAViL,EAAcA,EAAQ,EAwB7B,SAAS+G,GAAS/G,GAChB,OAAgB,MAATA,EAAgB,GAAKoe,GAAape,GAqC3C,IAAIu1B,GAAStT,IAAe,SAASzf,EAAQ1K,GAC3C,GAAI+hB,GAAY/hB,IAAWqiB,GAAYriB,GACrCka,GAAWla,EAAQuP,GAAKvP,GAAS0K,QAGnC,IAAK,IAAIT,KAAOjK,EACVkP,GAAevH,KAAK3H,EAAQiK,IAC9B4P,GAAYnP,EAAQT,EAAKjK,EAAOiK,OAoClCyzB,GAAWvT,IAAe,SAASzf,EAAQ1K,GAC7Cka,GAAWla,EAAQoa,GAAOpa,GAAS0K,MAgCjCizB,GAAexT,IAAe,SAASzf,EAAQ1K,EAAQ4iB,EAAU/H,GACnEX,GAAWla,EAAQoa,GAAOpa,GAAS0K,EAAQmQ,MA+BzC+iB,GAAazT,IAAe,SAASzf,EAAQ1K,EAAQ4iB,EAAU/H,GACjEX,GAAWla,EAAQuP,GAAKvP,GAAS0K,EAAQmQ,MAoBvCgjB,GAAK5R,GAAS5R,IAoClB,SAAShK,GAAOzB,EAAWkvB,GACzB,IAAIr1B,EAAS0L,GAAWvF,GACxB,OAAqB,MAAdkvB,EAAqBr1B,EAASwR,GAAWxR,EAAQq1B,GAwB1D,IAAI1vB,GAAWqW,IAAS,SAAS/Z,EAAQ2f,GACvC3f,EAAShF,GAAOgF,GAEhB,IAAIzC,GAAS,EACTP,EAAS2iB,EAAQ3iB,OACjB4iB,EAAQ5iB,EAAS,EAAI2iB,EAAQ,GAAKnvB,EAElCovB,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClD5iB,EAAS,GAGX,QAASO,EAAQP,EAAQ,CACvB,IAAI1H,EAASqqB,EAAQpiB,GACjBmD,EAAQgP,GAAOpa,GACf+9B,GAAc,EACdC,EAAc5yB,EAAM1D,OAExB,QAASq2B,EAAaC,EAAa,CACjC,IAAI/zB,EAAMmB,EAAM2yB,GACZ71B,EAAQwC,EAAOT,IAEf/B,IAAUhN,GACTye,GAAGzR,EAAO4G,GAAY7E,MAAUiF,GAAevH,KAAK+C,EAAQT,MAC/DS,EAAOT,GAAOjK,EAAOiK,KAK3B,OAAOS,KAsBLuzB,GAAexZ,IAAS,SAAShd,GAEnC,OADAA,EAAKoF,KAAK3R,EAAWi0B,IACd7nB,GAAM42B,GAAWhjC,EAAWuM,MAsCrC,SAAS02B,GAAQzzB,EAAQpC,GACvB,OAAOwB,GAAYY,EAAQ+Y,GAAYnb,EAAW,GAAIsU,IAsCxD,SAASwhB,GAAY1zB,EAAQpC,GAC3B,OAAOwB,GAAYY,EAAQ+Y,GAAYnb,EAAW,GAAIwU,IA+BxD,SAASuhB,GAAM3zB,EAAQ3C,GACrB,OAAiB,MAAV2C,EACHA,EACAgT,GAAQhT,EAAQ+Y,GAAY1b,EAAU,GAAIqS,IA6BhD,SAASkkB,GAAW5zB,EAAQ3C,GAC1B,OAAiB,MAAV2C,EACHA,EACAkT,GAAalT,EAAQ+Y,GAAY1b,EAAU,GAAIqS,IA+BrD,SAASmkB,GAAO7zB,EAAQ3C,GACtB,OAAO2C,GAAUkS,GAAWlS,EAAQ+Y,GAAY1b,EAAU,IA6B5D,SAASy2B,GAAY9zB,EAAQ3C,GAC3B,OAAO2C,GAAUoS,GAAgBpS,EAAQ+Y,GAAY1b,EAAU,IA0BjE,SAAS02B,GAAU/zB,GACjB,OAAiB,MAAVA,EAAiB,GAAKmT,GAAcnT,EAAQ6E,GAAK7E,IA0B1D,SAASg0B,GAAYh0B,GACnB,OAAiB,MAAVA,EAAiB,GAAKmT,GAAcnT,EAAQ0P,GAAO1P,IA4B5D,SAASoN,GAAIpN,EAAQsT,EAAMwP,GACzB,IAAI/kB,EAAmB,MAAViC,EAAiBxP,EAAY6iB,GAAQrT,EAAQsT,GAC1D,OAAOvV,IAAWvN,EAAYsyB,EAAe/kB,EA8B/C,SAASgD,GAAIf,EAAQsT,GACnB,OAAiB,MAAVtT,GAAkBmmB,GAAQnmB,EAAQsT,EAAMU,IA6BjD,SAASgE,GAAMhY,EAAQsT,GACrB,OAAiB,MAAVtT,GAAkBmmB,GAAQnmB,EAAQsT,EAAMW,IAqBjD,IAAIggB,GAASvR,IAAe,SAAS3kB,EAAQP,EAAO+B,GACrC,MAAT/B,GACyB,mBAAlBA,EAAM+G,WACf/G,EAAQuH,GAAqB9H,KAAKO,IAGpCO,EAAOP,GAAS+B,IACfgb,GAASvD,KA4BRkd,GAAWxR,IAAe,SAAS3kB,EAAQP,EAAO+B,GACvC,MAAT/B,GACyB,mBAAlBA,EAAM+G,WACf/G,EAAQuH,GAAqB9H,KAAKO,IAGhCgH,GAAevH,KAAKc,EAAQP,GAC9BO,EAAOP,GAAO2E,KAAK5C,GAEnBxB,EAAOP,GAAS,CAAC+B,KAElBwZ,IAoBCob,GAASpa,GAASnF,IA8BtB,SAAS/P,GAAK7E,GACZ,OAAO2X,GAAY3X,GAAUkO,GAAclO,GAAUoX,GAASpX,GA0BhE,SAAS0P,GAAO1P,GACd,OAAO2X,GAAY3X,GAAUkO,GAAclO,GAAQ,GAAQsX,GAAWtX,GAwBxE,SAASo0B,GAAQp0B,EAAQ3C,GACvB,IAAIU,EAAS,GAMb,OALAV,EAAW0b,GAAY1b,EAAU,GAEjC6U,GAAWlS,GAAQ,SAASxC,EAAO+B,EAAKS,GACtCkP,GAAgBnR,EAAQV,EAASG,EAAO+B,EAAKS,GAASxC,MAEjDO,EA+BT,SAASs2B,GAAUr0B,EAAQ3C,GACzB,IAAIU,EAAS,GAMb,OALAV,EAAW0b,GAAY1b,EAAU,GAEjC6U,GAAWlS,GAAQ,SAASxC,EAAO+B,EAAKS,GACtCkP,GAAgBnR,EAAQwB,EAAKlC,EAASG,EAAO+B,EAAKS,OAE7CjC,EAkCT,IAAIu2B,GAAQ7U,IAAe,SAASzf,EAAQ1K,EAAQ4iB,GAClDD,GAAUjY,EAAQ1K,EAAQ4iB,MAkCxBsb,GAAY/T,IAAe,SAASzf,EAAQ1K,EAAQ4iB,EAAU/H,GAChE8H,GAAUjY,EAAQ1K,EAAQ4iB,EAAU/H,MAuBlCokB,GAAOhT,IAAS,SAASvhB,EAAQ4P,GACnC,IAAI7R,EAAS,GACb,GAAc,MAAViC,EACF,OAAOjC,EAET,IAAIsS,GAAS,EACbT,EAAQxR,GAASwR,GAAO,SAAS0D,GAG/B,OAFAA,EAAOC,GAASD,EAAMtT,GACtBqQ,IAAWA,EAASiD,EAAKtW,OAAS,GAC3BsW,KAET9D,GAAWxP,EAAQoR,GAAapR,GAASjC,GACrCsS,IACFtS,EAASkS,GAAUlS,EAAQ/M,EAAkBC,EAAkBC,EAAoBwzB,KAErF,IAAI1nB,EAAS4S,EAAM5S,OACnB,MAAOA,IACL2c,GAAU5b,EAAQ6R,EAAM5S,IAE1B,OAAOe,KAuBT,SAASy2B,GAAOx0B,EAAQpC,GACtB,OAAO62B,GAAOz0B,EAAQ2tB,GAAO5U,GAAYnb,KAoB3C,IAAI+F,GAAO4d,IAAS,SAASvhB,EAAQ4P,GACnC,OAAiB,MAAV5P,EAAiB,GAAKkZ,GAASlZ,EAAQ4P,MAqBhD,SAAS6kB,GAAOz0B,EAAQpC,GACtB,GAAc,MAAVoC,EACF,MAAO,GAET,IAAIU,EAAQtC,GAASgT,GAAapR,IAAS,SAAS00B,GAClD,MAAO,CAACA,MAGV,OADA92B,EAAYmb,GAAYnb,GACjBub,GAAWnZ,EAAQU,GAAO,SAASlD,EAAO8V,GAC/C,OAAO1V,EAAUJ,EAAO8V,EAAK,OAiCjC,SAASvV,GAAOiC,EAAQsT,EAAMwP,GAC5BxP,EAAOC,GAASD,EAAMtT,GAEtB,IAAIzC,GAAS,EACTP,EAASsW,EAAKtW,OAGbA,IACHA,EAAS,EACTgD,EAASxP,GAEX,QAAS+M,EAAQP,EAAQ,CACvB,IAAIQ,EAAkB,MAAVwC,EAAiBxP,EAAYwP,EAAOwT,GAAMF,EAAK/V,KACvDC,IAAUhN,IACZ+M,EAAQP,EACRQ,EAAQslB,GAEV9iB,EAASoT,GAAW5V,GAASA,EAAMP,KAAK+C,GAAUxC,EAEpD,OAAOwC,EA+BT,SAAS6C,GAAI7C,EAAQsT,EAAM9V,GACzB,OAAiB,MAAVwC,EAAiBA,EAASoZ,GAAQpZ,EAAQsT,EAAM9V,GA2BzD,SAASm3B,GAAQ30B,EAAQsT,EAAM9V,EAAO2S,GAEpC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAa3f,EAC3C,MAAVwP,EAAiBA,EAASoZ,GAAQpZ,EAAQsT,EAAM9V,EAAO2S,GA2BhE,IAAIykB,GAAUvQ,GAAcxf,IA0BxBgwB,GAAYxQ,GAAc3U,IAgC9B,SAASjN,GAAUzC,EAAQ3C,EAAUC,GACnC,IAAIwN,EAAQzB,GAAQrJ,GAChB80B,EAAYhqB,GAAS5D,GAASlH,IAAWrD,GAAaqD,GAG1D,GADA3C,EAAW0b,GAAY1b,EAAU,GACd,MAAfC,EAAqB,CACvB,IAAI2iB,EAAOjgB,GAAUA,EAAOgS,YAE1B1U,EADEw3B,EACYhqB,EAAQ,IAAImV,EAAO,GAE1BtW,GAAS3J,IACFoT,GAAW6M,GAAQxW,GAAWjE,GAAaxF,IAG3C,GAMlB,OAHC80B,EAAYr3B,GAAYyU,IAAYlS,GAAQ,SAASxC,EAAOD,EAAOyC,GAClE,OAAO3C,EAASC,EAAaE,EAAOD,EAAOyC,MAEtC1C,EA8BT,SAASy3B,GAAM/0B,EAAQsT,GACrB,OAAiB,MAAVtT,GAAwB2Z,GAAU3Z,EAAQsT,GA8BnD,SAAS0hB,GAAOh1B,EAAQsT,EAAM2I,GAC5B,OAAiB,MAAVjc,EAAiBA,EAASgc,GAAWhc,EAAQsT,EAAMqJ,GAAaV,IA2BzE,SAASgZ,GAAWj1B,EAAQsT,EAAM2I,EAAS9L,GAEzC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAa3f,EAC3C,MAAVwP,EAAiBA,EAASgc,GAAWhc,EAAQsT,EAAMqJ,GAAaV,GAAU9L,GA6BnF,SAAS5R,GAAOyB,GACd,OAAiB,MAAVA,EAAiB,GAAKY,GAAWZ,EAAQ6E,GAAK7E,IA2BvD,SAASk1B,GAASl1B,GAChB,OAAiB,MAAVA,EAAiB,GAAKY,GAAWZ,EAAQ0P,GAAO1P,IAwBzD,SAASm1B,GAAMrlB,EAAQC,EAAOC,GAa5B,OAZIA,IAAUxf,IACZwf,EAAQD,EACRA,EAAQvf,GAENwf,IAAUxf,IACZwf,EAAQwT,GAASxT,GACjBA,EAAQA,IAAUA,EAAQA,EAAQ,GAEhCD,IAAUvf,IACZuf,EAAQyT,GAASzT,GACjBA,EAAQA,IAAUA,EAAQA,EAAQ,GAE7BjB,GAAU0U,GAAS1T,GAASC,EAAOC,GAyC5C,SAASolB,GAAQtlB,EAAQ3E,EAAOC,GAS9B,OARAD,EAAQmY,GAASnY,GACbC,IAAQ5a,GACV4a,EAAMD,EACNA,EAAQ,GAERC,EAAMkY,GAASlY,GAEjB0E,EAAS0T,GAAS1T,GACXoE,GAAYpE,EAAQ3E,EAAOC,GAkCpC,SAAStD,GAAOiI,EAAOC,EAAOqlB,GA2B5B,GA1BIA,GAA+B,kBAAZA,GAAyBxV,GAAe9P,EAAOC,EAAOqlB,KAC3ErlB,EAAQqlB,EAAW7kC,GAEjB6kC,IAAa7kC,IACK,kBAATwf,GACTqlB,EAAWrlB,EACXA,EAAQxf,GAEe,kBAATuf,IACdslB,EAAWtlB,EACXA,EAAQvf,IAGRuf,IAAUvf,GAAawf,IAAUxf,GACnCuf,EAAQ,EACRC,EAAQ,IAGRD,EAAQuT,GAASvT,GACbC,IAAUxf,GACZwf,EAAQD,EACRA,EAAQ,GAERC,EAAQsT,GAAStT,IAGjBD,EAAQC,EAAO,CACjB,IAAIslB,EAAOvlB,EACXA,EAAQC,EACRA,EAAQslB,EAEV,GAAID,GAAYtlB,EAAQ,GAAKC,EAAQ,EAAG,CACtC,IAAI2X,EAAO9f,KACX,OAAOJ,GAAUsI,EAAS4X,GAAQ3X,EAAQD,EAAQrV,GAAe,QAAUitB,EAAO,IAAI3qB,OAAS,KAAOgT,GAExG,OAAOrB,GAAWoB,EAAOC,GAyB3B,IAAIulB,GAAY7U,IAAiB,SAAS3iB,EAAQy3B,EAAMj4B,GAEtD,OADAi4B,EAAOA,EAAKC,cACL13B,GAAUR,EAAQm4B,GAAWF,GAAQA,MAkB9C,SAASE,GAAW12B,GAClB,OAAO22B,GAAWpxB,GAASvF,GAAQy2B,eAqBrC,SAAS5U,GAAO7hB,GAEd,OADAA,EAASuF,GAASvF,GACXA,GAAUA,EAAOmG,QAAQpO,GAASuK,IAAc6D,QAAQtL,GAAa,IA0B9E,SAAS+7B,GAAS52B,EAAQ62B,EAAQC,GAChC92B,EAASuF,GAASvF,GAClB62B,EAASja,GAAaia,GAEtB,IAAI74B,EAASgC,EAAOhC,OACpB84B,EAAWA,IAAatlC,EACpBwM,EACA8R,GAAU2D,GAAUqjB,GAAW,EAAG94B,GAEtC,IAAIoO,EAAM0qB,EAEV,OADAA,GAAYD,EAAO74B,OACZ84B,GAAY,GAAK92B,EAAOie,MAAM6Y,EAAU1qB,IAAQyqB,EA+BzD,SAASE,GAAO/2B,GAEd,OADAA,EAASuF,GAASvF,GACVA,GAAUzJ,GAAmBqM,KAAK5C,GACtCA,EAAOmG,QAAQhQ,GAAiBoM,IAChCvC,EAkBN,SAASg3B,GAAah3B,GAEpB,OADAA,EAASuF,GAASvF,GACVA,GAAUjJ,GAAgB6L,KAAK5C,GACnCA,EAAOmG,QAAQrP,GAAc,QAC7BkJ,EAwBN,IAAIi3B,GAAYvV,IAAiB,SAAS3iB,EAAQy3B,EAAMj4B,GACtD,OAAOQ,GAAUR,EAAQ,IAAM,IAAMi4B,EAAKC,iBAuBxCS,GAAYxV,IAAiB,SAAS3iB,EAAQy3B,EAAMj4B,GACtD,OAAOQ,GAAUR,EAAQ,IAAM,IAAMi4B,EAAKC,iBAoBxCU,GAAa7V,GAAgB,eAyBjC,SAAS8V,GAAIp3B,EAAQhC,EAAQkmB,GAC3BlkB,EAASuF,GAASvF,GAClBhC,EAASyV,GAAUzV,GAEnB,IAAIq5B,EAAYr5B,EAASgG,GAAWhE,GAAU,EAC9C,IAAKhC,GAAUq5B,GAAar5B,EAC1B,OAAOgC,EAET,IAAI+b,GAAO/d,EAASq5B,GAAa,EACjC,OACEpT,GAAcpc,GAAYkU,GAAMmI,GAChClkB,EACAikB,GAActc,GAAWoU,GAAMmI,GA2BnC,SAASoT,GAAOt3B,EAAQhC,EAAQkmB,GAC9BlkB,EAASuF,GAASvF,GAClBhC,EAASyV,GAAUzV,GAEnB,IAAIq5B,EAAYr5B,EAASgG,GAAWhE,GAAU,EAC9C,OAAQhC,GAAUq5B,EAAYr5B,EACzBgC,EAASikB,GAAcjmB,EAASq5B,EAAWnT,GAC5ClkB,EA0BN,SAASu3B,GAASv3B,EAAQhC,EAAQkmB,GAChClkB,EAASuF,GAASvF,GAClBhC,EAASyV,GAAUzV,GAEnB,IAAIq5B,EAAYr5B,EAASgG,GAAWhE,GAAU,EAC9C,OAAQhC,GAAUq5B,EAAYr5B,EACzBimB,GAAcjmB,EAASq5B,EAAWnT,GAASlkB,EAC5CA,EA2BN,SAASnE,GAASmE,EAAQw3B,EAAO5W,GAM/B,OALIA,GAAkB,MAAT4W,EACXA,EAAQ,EACCA,IACTA,GAASA,GAEJ5uB,GAAerD,GAASvF,GAAQmG,QAAQlP,GAAa,IAAKugC,GAAS,GAyB5E,SAASC,GAAOz3B,EAAQwB,EAAGof,GAMzB,OAJEpf,GADGof,EAAQC,GAAe7gB,EAAQwB,EAAGof,GAASpf,IAAMhQ,GAChD,EAEAiiB,GAAUjS,GAETsZ,GAAWvV,GAASvF,GAASwB,GAsBtC,SAAS2E,KACP,IAAIpI,EAAOsjB,UACPrhB,EAASuF,GAASxH,EAAK,IAE3B,OAAOA,EAAKC,OAAS,EAAIgC,EAASA,EAAOmG,QAAQpI,EAAK,GAAIA,EAAK,IAwBjE,IAAI25B,GAAYhW,IAAiB,SAAS3iB,EAAQy3B,EAAMj4B,GACtD,OAAOQ,GAAUR,EAAQ,IAAM,IAAMi4B,EAAKC,iBAsB5C,SAASx2B,GAAMD,EAAQqqB,EAAWsN,GAKhC,OAJIA,GAAyB,iBAATA,GAAqB9W,GAAe7gB,EAAQqqB,EAAWsN,KACzEtN,EAAYsN,EAAQnmC,GAEtBmmC,EAAQA,IAAUnmC,EAAYkC,EAAmBikC,IAAU,EACtDA,GAGL33B,EAASuF,GAASvF,GACdA,IACsB,iBAAbqqB,GACO,MAAbA,IAAsB9sB,GAAS8sB,MAEpCA,EAAYzN,GAAayN,IACpBA,GAAa1nB,GAAW3C,IACpB8d,GAAU5Z,GAAclE,GAAS,EAAG23B,GAGxC33B,EAAOC,MAAMoqB,EAAWsN,IAZtB,GAoCX,IAAIC,GAAYlW,IAAiB,SAAS3iB,EAAQy3B,EAAMj4B,GACtD,OAAOQ,GAAUR,EAAQ,IAAM,IAAMo4B,GAAWH,MA0BlD,SAASqB,GAAW73B,EAAQ62B,EAAQC,GAOlC,OANA92B,EAASuF,GAASvF,GAClB82B,EAAuB,MAAZA,EACP,EACAhnB,GAAU2D,GAAUqjB,GAAW,EAAG92B,EAAOhC,QAE7C64B,EAASja,GAAaia,GACf72B,EAAOie,MAAM6Y,EAAUA,EAAWD,EAAO74B,SAAW64B,EA2G7D,SAASiB,GAAS93B,EAAQwvB,EAAS5O,GAIjC,IAAImX,EAAW5tB,GAAO4I,iBAElB6N,GAASC,GAAe7gB,EAAQwvB,EAAS5O,KAC3C4O,EAAUh+B,GAEZwO,EAASuF,GAASvF,GAClBwvB,EAAUyE,GAAa,GAAIzE,EAASuI,EAAUvS,IAE9C,IAIIwS,EACAC,EALAC,EAAUjE,GAAa,GAAIzE,EAAQ0I,QAASH,EAASG,QAAS1S,IAC9D2S,EAActyB,GAAKqyB,GACnBE,EAAgBx2B,GAAWs2B,EAASC,GAIpC55B,EAAQ,EACR85B,EAAc7I,EAAQ6I,aAAergC,GACrC1B,EAAS,WAGTgiC,EAAejiC,IAChBm5B,EAAQuH,QAAU/+B,IAAW1B,OAAS,IACvC+hC,EAAY/hC,OAAS,KACpB+hC,IAAgB3hC,GAAgBc,GAAeQ,IAAW1B,OAAS,KACnEk5B,EAAQ+I,UAAYvgC,IAAW1B,OAAS,KACzC,KAMEkiC,EAAY,kBACbhzB,GAAevH,KAAKuxB,EAAS,cACzBA,EAAQgJ,UAAY,IAAIryB,QAAQ,MAAO,KACvC,6BAA+BhL,GAAmB,KACnD,KAEN6E,EAAOmG,QAAQmyB,GAAc,SAASn4B,EAAOs4B,EAAaC,EAAkBC,EAAiBC,EAAep5B,GAsB1G,OArBAk5B,IAAqBA,EAAmBC,GAGxCriC,GAAU0J,EAAOie,MAAM1f,EAAOiB,GAAQ2G,QAAQlO,GAAmBuK,IAG7Di2B,IACFT,GAAa,EACb1hC,GAAU,YAAcmiC,EAAc,UAEpCG,IACFX,GAAe,EACf3hC,GAAU,OAASsiC,EAAgB,eAEjCF,IACFpiC,GAAU,iBAAmBoiC,EAAmB,+BAElDn6B,EAAQiB,EAASW,EAAMnC,OAIhBmC,KAGT7J,GAAU,OAIV,IAAIuiC,EAAWrzB,GAAevH,KAAKuxB,EAAS,aAAeA,EAAQqJ,SAC9DA,IACHviC,EAAS,iBAAmBA,EAAS,SAGvCA,GAAU2hC,EAAe3hC,EAAO6P,QAAQpQ,GAAsB,IAAMO,GACjE6P,QAAQnQ,GAAqB,MAC7BmQ,QAAQlQ,GAAuB,OAGlCK,EAAS,aAAeuiC,GAAY,OAAS,SAC1CA,EACG,GACA,wBAEJ,qBACCb,EACI,mBACA,KAEJC,EACG,uFAEA,OAEJ3hC,EACA,gBAEF,IAAIyI,EAAS+5B,IAAQ,WACnB,OAAO18B,GAAS+7B,EAAaK,EAAY,UAAYliC,GAClDsH,MAAMpM,EAAW4mC,MAMtB,GADAr5B,EAAOzI,OAASA,EACZs8B,GAAQ7zB,GACV,MAAMA,EAER,OAAOA,EAwBT,SAASg6B,GAAQv6B,GACf,OAAO+G,GAAS/G,GAAOi4B,cAwBzB,SAASuC,GAAQx6B,GACf,OAAO+G,GAAS/G,GAAOy6B,cAyBzB,SAASC,GAAKl5B,EAAQkkB,EAAOtD,GAE3B,GADA5gB,EAASuF,GAASvF,GACdA,IAAW4gB,GAASsD,IAAU1yB,GAChC,OAAOwO,EAAOmG,QAAQnP,GAAQ,IAEhC,IAAKgJ,KAAYkkB,EAAQtH,GAAasH,IACpC,OAAOlkB,EAET,IAAIiC,EAAaiC,GAAclE,GAC3BkC,EAAagC,GAAcggB,GAC3B/X,EAAQnK,GAAgBC,EAAYC,GACpCkK,EAAMjK,GAAcF,EAAYC,GAAc,EAElD,OAAO4b,GAAU7b,EAAYkK,EAAOC,GAAK9R,KAAK,IAsBhD,SAAS6+B,GAAQn5B,EAAQkkB,EAAOtD,GAE9B,GADA5gB,EAASuF,GAASvF,GACdA,IAAW4gB,GAASsD,IAAU1yB,GAChC,OAAOwO,EAAOmG,QAAQjP,GAAW,IAEnC,IAAK8I,KAAYkkB,EAAQtH,GAAasH,IACpC,OAAOlkB,EAET,IAAIiC,EAAaiC,GAAclE,GAC3BoM,EAAMjK,GAAcF,EAAYiC,GAAcggB,IAAU,EAE5D,OAAOpG,GAAU7b,EAAY,EAAGmK,GAAK9R,KAAK,IAsB5C,SAAS8+B,GAAUp5B,EAAQkkB,EAAOtD,GAEhC,GADA5gB,EAASuF,GAASvF,GACdA,IAAW4gB,GAASsD,IAAU1yB,GAChC,OAAOwO,EAAOmG,QAAQlP,GAAa,IAErC,IAAK+I,KAAYkkB,EAAQtH,GAAasH,IACpC,OAAOlkB,EAET,IAAIiC,EAAaiC,GAAclE,GAC3BmM,EAAQnK,GAAgBC,EAAYiC,GAAcggB,IAEtD,OAAOpG,GAAU7b,EAAYkK,GAAO7R,KAAK,IAwC3C,SAAS++B,GAASr5B,EAAQwvB,GACxB,IAAIxxB,EAASjL,EACTumC,EAAWtmC,EAEf,GAAI2X,GAAS6kB,GAAU,CACrB,IAAInF,EAAY,cAAemF,EAAUA,EAAQnF,UAAYA,EAC7DrsB,EAAS,WAAYwxB,EAAU/b,GAAU+b,EAAQxxB,QAAUA,EAC3Ds7B,EAAW,aAAc9J,EAAU5S,GAAa4S,EAAQ8J,UAAYA,EAEtEt5B,EAASuF,GAASvF,GAElB,IAAIq3B,EAAYr3B,EAAOhC,OACvB,GAAI2E,GAAW3C,GAAS,CACtB,IAAIiC,EAAaiC,GAAclE,GAC/Bq3B,EAAYp1B,EAAWjE,OAEzB,GAAIA,GAAUq5B,EACZ,OAAOr3B,EAET,IAAIoM,EAAMpO,EAASgG,GAAWs1B,GAC9B,GAAIltB,EAAM,EACR,OAAOktB,EAET,IAAIv6B,EAASkD,EACT6b,GAAU7b,EAAY,EAAGmK,GAAK9R,KAAK,IACnC0F,EAAOie,MAAM,EAAG7R,GAEpB,GAAIie,IAAc74B,EAChB,OAAOuN,EAASu6B,EAKlB,GAHIr3B,IACFmK,GAAQrN,EAAOf,OAASoO,GAEtB7O,GAAS8sB,IACX,GAAIrqB,EAAOie,MAAM7R,GAAKmtB,OAAOlP,GAAY,CACvC,IAAIlqB,EACAq5B,EAAYz6B,EAEXsrB,EAAUtuB,SACbsuB,EAAYh0B,GAAOg0B,EAAU/zB,OAAQiP,GAAS9N,GAAQmO,KAAKykB,IAAc,MAE3EA,EAAUhmB,UAAY,EACtB,MAAQlE,EAAQkqB,EAAUzkB,KAAK4zB,GAC7B,IAAIC,EAASt5B,EAAM5B,MAErBQ,EAASA,EAAOkf,MAAM,EAAGwb,IAAWjoC,EAAY4a,EAAMqtB,SAEnD,GAAIz5B,EAAOua,QAAQqC,GAAayN,GAAYje,IAAQA,EAAK,CAC9D,IAAI7N,EAAQQ,EAAOurB,YAAYD,GAC3B9rB,GAAS,IACXQ,EAASA,EAAOkf,MAAM,EAAG1f,IAG7B,OAAOQ,EAASu6B,EAsBlB,SAASI,GAAS15B,GAEhB,OADAA,EAASuF,GAASvF,GACVA,GAAU5J,GAAiBwM,KAAK5C,GACpCA,EAAOmG,QAAQjQ,GAAekO,IAC9BpE,EAuBN,IAAI25B,GAAYjY,IAAiB,SAAS3iB,EAAQy3B,EAAMj4B,GACtD,OAAOQ,GAAUR,EAAQ,IAAM,IAAMi4B,EAAKyC,iBAoBxCtC,GAAarV,GAAgB,eAqBjC,SAASM,GAAM5hB,EAAQ0X,EAASkJ,GAI9B,OAHA5gB,EAASuF,GAASvF,GAClB0X,EAAUkJ,EAAQpvB,EAAYkmB,EAE1BA,IAAYlmB,EACPqR,GAAe7C,GAAUsE,GAAatE,GAAUE,GAAWF,GAE7DA,EAAOG,MAAMuX,IAAY,GA2BlC,IAAIohB,GAAU/d,IAAS,SAASld,EAAME,GACpC,IACE,OAAOH,GAAMC,EAAMrM,EAAWuM,GAC9B,MAAOhB,GACP,OAAO61B,GAAQ71B,GAAKA,EAAI,IAAI8H,EAAM9H,OA8BlC68B,GAAUrX,IAAS,SAASvhB,EAAQ64B,GAKtC,OAJAp7B,GAAUo7B,GAAa,SAASt5B,GAC9BA,EAAMiU,GAAMjU,GACZ2P,GAAgBlP,EAAQT,EAAK4uB,GAAKnuB,EAAOT,GAAMS,OAE1CA,KAgCT,SAAS84B,GAAK7qB,GACZ,IAAIjR,EAAkB,MAATiR,EAAgB,EAAIA,EAAMjR,OACnC2lB,EAAa5J,KASjB,OAPA9K,EAASjR,EAAcoB,GAAS6P,GAAO,SAASkW,GAC9C,GAAsB,mBAAXA,EAAK,GACd,MAAM,IAAIngB,GAAUpT,GAEtB,MAAO,CAAC+xB,EAAWwB,EAAK,IAAKA,EAAK,OAJlB,GAOXpK,IAAS,SAAShd,GACvB,IAAIQ,GAAS,EACb,QAASA,EAAQP,EAAQ,CACvB,IAAImnB,EAAOlW,EAAM1Q,GACjB,GAAIX,GAAMunB,EAAK,GAAIt0B,KAAMkN,GACvB,OAAOH,GAAMunB,EAAK,GAAIt0B,KAAMkN,OA8BpC,SAASg8B,GAASzjC,GAChB,OAAOgc,GAAarB,GAAU3a,EAAQtE,IAsBxC,SAASupB,GAAS/c,GAChB,OAAO,WACL,OAAOA,GAwBX,SAASw7B,GAAUx7B,EAAOslB,GACxB,OAAiB,MAATtlB,GAAiBA,IAAUA,EAASslB,EAAetlB,EAyB7D,IAAIy7B,GAAO3X,KAuBP4X,GAAY5X,IAAW,GAkB3B,SAAStK,GAASxZ,GAChB,OAAOA,EA6CT,SAASH,GAASR,GAChB,OAAOka,GAA4B,mBAARla,EAAqBA,EAAOoT,GAAUpT,EAAM7L,IAsCzE,SAASmoC,GAAQ7jC,GACf,OAAO4hB,GAAYjH,GAAU3a,EAAQtE,IAoCvC,SAASooC,GAAgB9lB,EAAMiD,GAC7B,OAAOU,GAAoB3D,EAAMrD,GAAUsG,EAAUvlB,IA2BvD,IAAIqoC,GAAStf,IAAS,SAASzG,EAAMvW,GACnC,OAAO,SAASiD,GACd,OAAO4U,GAAW5U,EAAQsT,EAAMvW,OA2BhCu8B,GAAWvf,IAAS,SAAS/Z,EAAQjD,GACvC,OAAO,SAASuW,GACd,OAAOsB,GAAW5U,EAAQsT,EAAMvW,OAwCpC,SAASw8B,GAAMv5B,EAAQ1K,EAAQk5B,GAC7B,IAAI9tB,EAAQmE,GAAKvP,GACbujC,EAAc1lB,GAAc7d,EAAQoL,GAEzB,MAAX8tB,GACE7kB,GAASrU,KAAYujC,EAAY77B,SAAW0D,EAAM1D,UACtDwxB,EAAUl5B,EACVA,EAAS0K,EACTA,EAASnQ,KACTgpC,EAAc1lB,GAAc7d,EAAQuP,GAAKvP,KAE3C,IAAIs2B,IAAUjiB,GAAS6kB,IAAY,UAAWA,MAAcA,EAAQ5C,MAChEjb,EAASyC,GAAWpT,GAqBxB,OAnBAvC,GAAUo7B,GAAa,SAAStY,GAC9B,IAAI1jB,EAAOvH,EAAOirB,GAClBvgB,EAAOugB,GAAc1jB,EACjB8T,IACF3Q,EAAOkE,UAAUqc,GAAc,WAC7B,IAAI1W,EAAWha,KAAKma,UACpB,GAAI4hB,GAAS/hB,EAAU,CACrB,IAAI9L,EAASiC,EAAOnQ,KAAKia,aACrBsS,EAAUre,EAAOgM,YAAcU,GAAU5a,KAAKka,aAIlD,OAFAqS,EAAQja,KAAK,CAAE,KAAQtF,EAAM,KAAQwjB,UAAW,QAAWrgB,IAC3DjC,EAAOiM,UAAYH,EACZ9L,EAET,OAAOlB,EAAKD,MAAMoD,EAAQ1B,GAAU,CAACzO,KAAK2N,SAAU6iB,iBAKnDrgB,EAgBT,SAASw5B,KAIP,OAHIr+B,GAAKsI,IAAM5T,OACbsL,GAAKsI,EAAIwB,IAEJpV,KAeT,SAASu0B,MAwBT,SAASqV,GAAOj5B,GAEd,OADAA,EAAIiS,GAAUjS,GACPuZ,IAAS,SAAShd,GACvB,OAAO6b,GAAQ7b,EAAMyD,MAsBzB,IAAIk5B,GAAO3W,GAAW3kB,IA8BlBu7B,GAAY5W,GAAWplB,IAiCvBi8B,GAAW7W,GAAWnkB,IAwB1B,SAASuY,GAAS7D,GAChB,OAAOwE,GAAMxE,GAAQxU,GAAa0U,GAAMF,IAAS+F,GAAiB/F,GAwBpE,SAASumB,GAAW75B,GAClB,OAAO,SAASsT,GACd,OAAiB,MAAVtT,EAAiBxP,EAAY6iB,GAAQrT,EAAQsT,IA6CxD,IAAIwmB,GAAQzW,KAsCR0W,GAAa1W,IAAY,GAoB7B,SAAS2C,KACP,MAAO,GAgBT,SAASY,KACP,OAAO,EAqBT,SAASoT,KACP,MAAO,GAgBT,SAASC,KACP,MAAO,GAgBT,SAASC,KACP,OAAO,EAsBT,SAASC,GAAM35B,EAAGnD,GAEhB,GADAmD,EAAIiS,GAAUjS,GACVA,EAAI,GAAKA,EAAIjO,EACf,MAAO,GAET,IAAIgL,EAAQ7K,EACRsK,EAASyK,GAAUjH,EAAG9N,GAE1B2K,EAAW0b,GAAY1b,GACvBmD,GAAK9N,EAEL,IAAIqL,EAASwC,GAAUvD,EAAQK,GAC/B,QAASE,EAAQiD,EACfnD,EAASE,GAEX,OAAOQ,EAoBT,SAASq8B,GAAO58B,GACd,OAAI6L,GAAQ7L,GACHY,GAASZ,EAAOgW,IAElBjB,GAAS/U,GAAS,CAACA,GAASiN,GAAUmS,GAAarY,GAAS/G,KAoBrE,SAAS68B,GAASC,GAChB,IAAIvd,IAAOtY,GACX,OAAOF,GAAS+1B,GAAUvd,EAoB5B,IAAIvP,GAAMoV,IAAoB,SAAS2X,EAAQC,GAC7C,OAAOD,EAASC,IACf,GAuBC5zB,GAAOqd,GAAY,QAiBnBwW,GAAS7X,IAAoB,SAAS8X,EAAUC,GAClD,OAAOD,EAAWC,IACjB,GAuBC7zB,GAAQmd,GAAY,SAoBxB,SAASzc,GAAIrK,GACX,OAAQA,GAASA,EAAMH,OACnBsV,GAAanV,EAAO6Z,GAAUlD,IAC9BtjB,EA0BN,SAASoqC,GAAMz9B,EAAOE,GACpB,OAAQF,GAASA,EAAMH,OACnBsV,GAAanV,EAAO4b,GAAY1b,EAAU,GAAIyW,IAC9CtjB,EAiBN,SAASqqC,GAAK19B,GACZ,OAAO2C,GAAS3C,EAAO6Z,IA0BzB,SAAS8jB,GAAO39B,EAAOE,GACrB,OAAOyC,GAAS3C,EAAO4b,GAAY1b,EAAU,IAqB/C,SAASqK,GAAIvK,GACX,OAAQA,GAASA,EAAMH,OACnBsV,GAAanV,EAAO6Z,GAAUS,IAC9BjnB,EA0BN,SAASuqC,GAAM59B,EAAOE,GACpB,OAAQF,GAASA,EAAMH,OACnBsV,GAAanV,EAAO4b,GAAY1b,EAAU,GAAIoa,IAC9CjnB,EAkBN,IAAIwqC,GAAWpY,IAAoB,SAASqY,EAAYC,GACtD,OAAOD,EAAaC,IACnB,GAuBCC,GAAQlX,GAAY,SAiBpBmX,GAAWxY,IAAoB,SAASyY,EAASC,GACnD,OAAOD,EAAUC,IAChB,GAgBH,SAASC,GAAIp+B,GACX,OAAQA,GAASA,EAAMH,OACnB+C,GAAQ5C,EAAO6Z,IACf,EA0BN,SAASwkB,GAAMr+B,EAAOE,GACpB,OAAQF,GAASA,EAAMH,OACnB+C,GAAQ5C,EAAO4b,GAAY1b,EAAU,IACrC,EAgjBN,OA1iBA8L,GAAO8kB,MAAQA,GACf9kB,GAAOgZ,IAAMA,GACbhZ,GAAO4pB,OAASA,GAChB5pB,GAAO6pB,SAAWA,GAClB7pB,GAAO8pB,aAAeA,GACtB9pB,GAAO+pB,WAAaA,GACpB/pB,GAAOgqB,GAAKA,GACZhqB,GAAO+kB,OAASA,GAChB/kB,GAAOglB,KAAOA,GACdhlB,GAAOyvB,QAAUA,GACjBzvB,GAAOilB,QAAUA,GACjBjlB,GAAO6nB,UAAYA,GACnB7nB,GAAOyiB,MAAQA,GACfziB,GAAO4e,MAAQA,GACf5e,GAAO6e,QAAUA,GACjB7e,GAAO8e,OAASA,GAChB9e,GAAO2vB,KAAOA,GACd3vB,GAAO4vB,SAAWA,GAClB5vB,GAAOoR,SAAWA,GAClBpR,GAAOsjB,QAAUA,GACjBtjB,GAAOxD,OAASA,GAChBwD,GAAOklB,MAAQA,GACfllB,GAAOmlB,WAAaA,GACpBnlB,GAAOolB,SAAWA,GAClBplB,GAAOzF,SAAWA,GAClByF,GAAOoqB,aAAeA,GACtBpqB,GAAO4mB,MAAQA,GACf5mB,GAAO6mB,MAAQA,GACf7mB,GAAO+e,WAAaA,GACpB/e,GAAOgf,aAAeA,GACtBhf,GAAOif,eAAiBA,GACxBjf,GAAOkf,KAAOA,GACdlf,GAAOmf,UAAYA,GACnBnf,GAAOof,eAAiBA,GACxBpf,GAAOqf,UAAYA,GACnBrf,GAAOsf,KAAOA,GACdtf,GAAOwjB,OAASA,GAChBxjB,GAAO2jB,QAAUA,GACjB3jB,GAAO4jB,YAAcA,GACrB5jB,GAAO6jB,aAAeA,GACtB7jB,GAAOwc,QAAUA,GACjBxc,GAAOyf,YAAcA,GACrBzf,GAAO0f,aAAeA,GACtB1f,GAAO8mB,KAAOA,GACd9mB,GAAO8vB,KAAOA,GACd9vB,GAAO+vB,UAAYA,GACnB/vB,GAAO2f,UAAYA,GACnB3f,GAAO4qB,UAAYA,GACnB5qB,GAAO6qB,YAAcA,GACrB7qB,GAAO+jB,QAAUA,GACjB/jB,GAAO6f,QAAUA,GACjB7f,GAAO8f,aAAeA,GACtB9f,GAAOggB,eAAiBA,GACxBhgB,GAAOigB,iBAAmBA,GAC1BjgB,GAAO8qB,OAASA,GAChB9qB,GAAO+qB,SAAWA,GAClB/qB,GAAOikB,UAAYA,GACnBjkB,GAAO9L,SAAWA,GAClB8L,GAAOkkB,MAAQA,GACflkB,GAAOtE,KAAOA,GACdsE,GAAOuG,OAASA,GAChBvG,GAAO9G,IAAMA,GACb8G,GAAOirB,QAAUA,GACjBjrB,GAAOkrB,UAAYA,GACnBlrB,GAAOgwB,QAAUA,GACjBhwB,GAAOiwB,gBAAkBA,GACzBjwB,GAAO2d,QAAUA,GACjB3d,GAAOmrB,MAAQA,GACfnrB,GAAOqqB,UAAYA,GACnBrqB,GAAOkwB,OAASA,GAChBlwB,GAAOmwB,SAAWA,GAClBnwB,GAAOowB,MAAQA,GACfpwB,GAAOwkB,OAASA,GAChBxkB,GAAOswB,OAASA,GAChBtwB,GAAOorB,KAAOA,GACdprB,GAAOqrB,OAASA,GAChBrrB,GAAOknB,KAAOA,GACdlnB,GAAOmkB,QAAUA,GACjBnkB,GAAOuwB,KAAOA,GACdvwB,GAAOmnB,SAAWA,GAClBnnB,GAAOwwB,UAAYA,GACnBxwB,GAAOywB,SAAWA,GAClBzwB,GAAOqnB,QAAUA,GACjBrnB,GAAOsnB,aAAeA,GACtBtnB,GAAOokB,UAAYA,GACnBpkB,GAAOxF,KAAOA,GACdwF,GAAOsrB,OAASA,GAChBtrB,GAAOgO,SAAWA,GAClBhO,GAAO0wB,WAAaA,GACpB1wB,GAAOqgB,KAAOA,GACdrgB,GAAOsgB,QAAUA,GACjBtgB,GAAOugB,UAAYA,GACnBvgB,GAAOwgB,YAAcA,GACrBxgB,GAAOygB,OAASA,GAChBzgB,GAAO2wB,MAAQA,GACf3wB,GAAO4wB,WAAaA,GACpB5wB,GAAOunB,MAAQA,GACfvnB,GAAOukB,OAASA,GAChBvkB,GAAO0gB,OAASA,GAChB1gB,GAAOwnB,KAAOA,GACdxnB,GAAOnB,QAAUA,GACjBmB,GAAO0kB,WAAaA,GACpB1kB,GAAOtG,IAAMA,GACbsG,GAAOwrB,QAAUA,GACjBxrB,GAAO2kB,QAAUA,GACjB3kB,GAAO8T,MAAQA,GACf9T,GAAO6kB,OAASA,GAChB7kB,GAAOihB,WAAaA,GACpBjhB,GAAOkhB,aAAeA,GACtBlhB,GAAOlK,MAAQA,GACfkK,GAAOynB,OAASA,GAChBznB,GAAOmhB,KAAOA,GACdnhB,GAAOohB,KAAOA,GACdphB,GAAOqhB,UAAYA,GACnBrhB,GAAOshB,eAAiBA,GACxBthB,GAAOuhB,UAAYA,GACnBvhB,GAAO0iB,IAAMA,GACb1iB,GAAO0nB,SAAWA,GAClB1nB,GAAOuY,KAAOA,GACdvY,GAAOgjB,QAAUA,GACjBhjB,GAAOyrB,QAAUA,GACjBzrB,GAAO0rB,UAAYA,GACnB1rB,GAAOixB,OAASA,GAChBjxB,GAAOwP,cAAgBA,GACvBxP,GAAO1G,UAAYA,GACnB0G,GAAO2nB,MAAQA,GACf3nB,GAAOwhB,MAAQA,GACfxhB,GAAOyhB,QAAUA,GACjBzhB,GAAO0hB,UAAYA,GACnB1hB,GAAO2hB,KAAOA,GACd3hB,GAAO4hB,OAASA,GAChB5hB,GAAO6hB,SAAWA,GAClB7hB,GAAO4rB,MAAQA,GACf5rB,GAAO8hB,MAAQA,GACf9hB,GAAOgiB,UAAYA,GACnBhiB,GAAO6rB,OAASA,GAChB7rB,GAAO8rB,WAAaA,GACpB9rB,GAAO5K,OAASA,GAChB4K,GAAO+rB,SAAWA,GAClB/rB,GAAOiiB,QAAUA,GACjBjiB,GAAOyX,MAAQA,GACfzX,GAAO4nB,KAAOA,GACd5nB,GAAOkiB,IAAMA,GACbliB,GAAOmiB,MAAQA,GACfniB,GAAOoiB,QAAUA,GACjBpiB,GAAOqiB,IAAMA,GACbriB,GAAOsiB,UAAYA,GACnBtiB,GAAOuiB,cAAgBA,GACvBviB,GAAOwiB,QAAUA,GAGjBxiB,GAAO2C,QAAU8oB,GACjBzrB,GAAOsyB,UAAY5G,GACnB1rB,GAAOuyB,OAAS1I,GAChB7pB,GAAOwyB,WAAa1I,GAGpBsG,GAAMpwB,GAAQA,IAKdA,GAAOqE,IAAMA,GACbrE,GAAO2uB,QAAUA,GACjB3uB,GAAOosB,UAAYA,GACnBpsB,GAAOusB,WAAaA,GACpBvsB,GAAOvC,KAAOA,GACduC,GAAOgsB,MAAQA,GACfhsB,GAAOwB,MAAQA,GACfxB,GAAO+nB,UAAYA,GACnB/nB,GAAOgoB,cAAgBA,GACvBhoB,GAAO8nB,UAAYA,GACnB9nB,GAAOioB,WAAaA,GACpBjoB,GAAO0X,OAASA,GAChB1X,GAAO6vB,UAAYA,GACnB7vB,GAAOsxB,OAASA,GAChBtxB,GAAOysB,SAAWA,GAClBzsB,GAAO8F,GAAKA,GACZ9F,GAAO4sB,OAASA,GAChB5sB,GAAO6sB,aAAeA,GACtB7sB,GAAOujB,MAAQA,GACfvjB,GAAOyjB,KAAOA,GACdzjB,GAAOuf,UAAYA,GACnBvf,GAAOsqB,QAAUA,GACjBtqB,GAAO0jB,SAAWA,GAClB1jB,GAAOwf,cAAgBA,GACvBxf,GAAOuqB,YAAcA,GACrBvqB,GAAOrC,MAAQA,GACfqC,GAAO5G,QAAUA,GACjB4G,GAAO8jB,aAAeA,GACtB9jB,GAAOwqB,MAAQA,GACfxqB,GAAOyqB,WAAaA,GACpBzqB,GAAO0qB,OAASA,GAChB1qB,GAAO2qB,YAAcA,GACrB3qB,GAAOiE,IAAMA,GACbjE,GAAOkoB,GAAKA,GACZloB,GAAOmoB,IAAMA,GACbnoB,GAAOpI,IAAMA,GACboI,GAAO6O,MAAQA,GACf7O,GAAO4f,KAAOA,GACd5f,GAAO6N,SAAWA,GAClB7N,GAAOwI,SAAWA,GAClBxI,GAAOoQ,QAAUA,GACjBpQ,GAAOisB,QAAUA,GACjBjsB,GAAOgrB,OAASA,GAChBhrB,GAAOkF,YAAcA,GACrBlF,GAAOE,QAAUA,GACjBF,GAAOlN,cAAgBA,GACvBkN,GAAOwO,YAAcA,GACrBxO,GAAOqP,kBAAoBA,GAC3BrP,GAAOooB,UAAYA,GACnBpoB,GAAOjC,SAAWA,GAClBiC,GAAOhN,OAASA,GAChBgN,GAAOqoB,UAAYA,GACnBroB,GAAOsoB,QAAUA,GACjBtoB,GAAOuoB,QAAUA,GACjBvoB,GAAOwoB,YAAcA,GACrBxoB,GAAOyoB,QAAUA,GACjBzoB,GAAO/B,SAAWA,GAClB+B,GAAOiK,WAAaA,GACpBjK,GAAO0oB,UAAYA,GACnB1oB,GAAO2N,SAAWA,GAClB3N,GAAO9M,MAAQA,GACf8M,GAAO2oB,QAAUA,GACjB3oB,GAAO4oB,YAAcA,GACrB5oB,GAAO6oB,MAAQA,GACf7oB,GAAO+oB,SAAWA,GAClB/oB,GAAOipB,MAAQA,GACfjpB,GAAOgpB,OAASA,GAChBhpB,GAAO8oB,SAAWA,GAClB9oB,GAAOQ,SAAWA,GAClBR,GAAOC,aAAeA,GACtBD,GAAOuP,cAAgBA,GACvBvP,GAAO5M,SAAWA,GAClB4M,GAAOkpB,cAAgBA,GACvBlpB,GAAO1M,MAAQA,GACf0M,GAAOgkB,SAAWA,GAClBhkB,GAAOoJ,SAAWA,GAClBpJ,GAAOxM,aAAeA,GACtBwM,GAAOmpB,YAAcA,GACrBnpB,GAAOopB,UAAYA,GACnBppB,GAAOqpB,UAAYA,GACnBrpB,GAAO7P,KAAOA,GACd6P,GAAO8sB,UAAYA,GACnB9sB,GAAO2L,KAAOA,GACd3L,GAAOmgB,YAAcA,GACrBngB,GAAO+sB,UAAYA,GACnB/sB,GAAOgtB,WAAaA,GACpBhtB,GAAOspB,GAAKA,GACZtpB,GAAOupB,IAAMA,GACbvpB,GAAO3B,IAAMA,GACb2B,GAAOyxB,MAAQA,GACfzxB,GAAO0xB,KAAOA,GACd1xB,GAAO2xB,OAASA,GAChB3xB,GAAOzB,IAAMA,GACbyB,GAAO4xB,MAAQA,GACf5xB,GAAO6c,UAAYA,GACnB7c,GAAOyd,UAAYA,GACnBzd,GAAO6wB,WAAaA,GACpB7wB,GAAO8wB,WAAaA,GACpB9wB,GAAO+wB,SAAWA,GAClB/wB,GAAO6xB,SAAWA,GAClB7xB,GAAOogB,IAAMA,GACbpgB,GAAOqwB,WAAaA,GACpBrwB,GAAOib,KAAOA,GACdjb,GAAO3C,IAAMA,GACb2C,GAAOitB,IAAMA,GACbjtB,GAAOmtB,OAASA,GAChBntB,GAAOotB,SAAWA,GAClBptB,GAAOtO,SAAWA,GAClBsO,GAAOrB,OAASA,GAChBqB,GAAOqkB,OAASA,GAChBrkB,GAAOskB,YAAcA,GACrBtkB,GAAOstB,OAASA,GAChBttB,GAAOhE,QAAUA,GACjBgE,GAAOpL,OAASA,GAChBoL,GAAOgyB,MAAQA,GACfhyB,GAAO5F,aAAeA,EACtB4F,GAAOykB,OAASA,GAChBzkB,GAAO7G,KAAOA,GACd6G,GAAOutB,UAAYA,GACnBvtB,GAAO4kB,KAAOA,GACd5kB,GAAO2gB,YAAcA,GACrB3gB,GAAO4gB,cAAgBA,GACvB5gB,GAAO6gB,cAAgBA,GACvB7gB,GAAO8gB,gBAAkBA,GACzB9gB,GAAO+gB,kBAAoBA,GAC3B/gB,GAAOghB,kBAAoBA,GAC3BhhB,GAAOytB,UAAYA,GACnBztB,GAAO0tB,WAAaA,GACpB1tB,GAAOiyB,SAAWA,GAClBjyB,GAAOoyB,IAAMA,GACbpyB,GAAOqyB,MAAQA,GACfryB,GAAO2tB,SAAWA,GAClB3tB,GAAOgxB,MAAQA,GACfhxB,GAAOma,SAAWA,GAClBna,GAAOsJ,UAAYA,GACnBtJ,GAAOuJ,SAAWA,GAClBvJ,GAAO4uB,QAAUA,GACjB5uB,GAAOqa,SAAWA,GAClBra,GAAO2pB,cAAgBA,GACvB3pB,GAAO5E,SAAWA,GAClB4E,GAAO6uB,QAAUA,GACjB7uB,GAAO+uB,KAAOA,GACd/uB,GAAOgvB,QAAUA,GACjBhvB,GAAOivB,UAAYA,GACnBjvB,GAAOkvB,SAAWA,GAClBlvB,GAAOuvB,SAAWA,GAClBvvB,GAAOkxB,SAAWA,GAClBlxB,GAAOwvB,UAAYA,GACnBxvB,GAAOwsB,WAAaA,GAGpBxsB,GAAOyyB,KAAOr5B,GACd4G,GAAO0yB,UAAY5O,GACnB9jB,GAAO2yB,MAAQ/S,GAEfwQ,GAAMpwB,GAAS,WACb,IAAI7T,EAAS,GAMb,OALA4c,GAAW/I,IAAQ,SAAStM,EAAM0jB,GAC3B/b,GAAevH,KAAKkM,GAAOjF,UAAWqc,KACzCjrB,EAAOirB,GAAc1jB,MAGlBvH,EAPK,GAQR,CAAE,OAAS,IAWjB6T,GAAO1Y,QAAUA,EAGjBgN,GAAU,CAAC,OAAQ,UAAW,QAAS,aAAc,UAAW,iBAAiB,SAAS8iB,GACxFpX,GAAOoX,GAAYlf,YAAc8H,MAInC1L,GAAU,CAAC,OAAQ,SAAS,SAAS8iB,EAAYhjB,GAC/C+L,GAAYpF,UAAUqc,GAAc,SAAS/f,GAC3CA,EAAIA,IAAMhQ,EAAY,EAAI+W,GAAUkL,GAAUjS,GAAI,GAElD,IAAIzC,EAAUlO,KAAKua,eAAiB7M,EAChC,IAAI+L,GAAYzZ,MAChBA,KAAK8a,QAUT,OARI5M,EAAOqM,aACTrM,EAAOuM,cAAgB7C,GAAUjH,EAAGzC,EAAOuM,eAE3CvM,EAAOwM,UAAUpI,KAAK,CACpB,KAAQsF,GAAUjH,EAAG9N,GACrB,KAAQ6tB,GAAcxiB,EAAOoM,QAAU,EAAI,QAAU,MAGlDpM,GAGTuL,GAAYpF,UAAUqc,EAAa,SAAW,SAAS/f,GACrD,OAAO3Q,KAAKmY,UAAUuY,GAAY/f,GAAGwH,cAKzCvK,GAAU,CAAC,SAAU,MAAO,cAAc,SAAS8iB,EAAYhjB,GAC7D,IAAIoO,EAAOpO,EAAQ,EACfw+B,EAAWpwB,GAAQxZ,GAAoBwZ,GAAQtZ,EAEnDiX,GAAYpF,UAAUqc,GAAc,SAASljB,GAC3C,IAAIU,EAASlO,KAAK8a,QAMlB,OALA5M,EAAOsM,cAAclI,KAAK,CACxB,SAAY4W,GAAY1b,EAAU,GAClC,KAAQsO,IAEV5N,EAAOqM,aAAerM,EAAOqM,cAAgB2xB,EACtCh+B,MAKXN,GAAU,CAAC,OAAQ,SAAS,SAAS8iB,EAAYhjB,GAC/C,IAAIy+B,EAAW,QAAUz+B,EAAQ,QAAU,IAE3C+L,GAAYpF,UAAUqc,GAAc,WAClC,OAAO1wB,KAAKmsC,GAAU,GAAGx+B,QAAQ,OAKrCC,GAAU,CAAC,UAAW,SAAS,SAAS8iB,EAAYhjB,GAClD,IAAI0+B,EAAW,QAAU1+B,EAAQ,GAAK,SAEtC+L,GAAYpF,UAAUqc,GAAc,WAClC,OAAO1wB,KAAKua,aAAe,IAAId,GAAYzZ,MAAQA,KAAKosC,GAAU,OAItE3yB,GAAYpF,UAAU8jB,QAAU,WAC9B,OAAOn4B,KAAK88B,OAAO3V,KAGrB1N,GAAYpF,UAAU0oB,KAAO,SAAShvB,GACpC,OAAO/N,KAAK88B,OAAO/uB,GAAWmrB,QAGhCzf,GAAYpF,UAAU2oB,SAAW,SAASjvB,GACxC,OAAO/N,KAAKmY,UAAU4kB,KAAKhvB,IAG7B0L,GAAYpF,UAAUkpB,UAAYrT,IAAS,SAASzG,EAAMvW,GACxD,MAAmB,mBAARuW,EACF,IAAIhK,GAAYzZ,MAElBA,KAAKwS,KAAI,SAAS7E,GACvB,OAAOoX,GAAWpX,EAAO8V,EAAMvW,SAInCuM,GAAYpF,UAAUwpB,OAAS,SAAS9vB,GACtC,OAAO/N,KAAK88B,OAAOgB,GAAO5U,GAAYnb,MAGxC0L,GAAYpF,UAAU+Y,MAAQ,SAAS9R,EAAOC,GAC5CD,EAAQsH,GAAUtH,GAElB,IAAIpN,EAASlO,KACb,OAAIkO,EAAOqM,eAAiBe,EAAQ,GAAKC,EAAM,GACtC,IAAI9B,GAAYvL,IAErBoN,EAAQ,EACVpN,EAASA,EAAOysB,WAAWrf,GAClBA,IACTpN,EAASA,EAAOsqB,KAAKld,IAEnBC,IAAQ5a,IACV4a,EAAMqH,GAAUrH,GAChBrN,EAASqN,EAAM,EAAIrN,EAAOuqB,WAAWld,GAAOrN,EAAOwsB,KAAKnf,EAAMD,IAEzDpN,IAGTuL,GAAYpF,UAAUumB,eAAiB,SAAS7sB,GAC9C,OAAO/N,KAAKmY,UAAU0iB,UAAU9sB,GAAWoK,WAG7CsB,GAAYpF,UAAUioB,QAAU,WAC9B,OAAOt8B,KAAK06B,KAAK73B,IAInBwf,GAAW5I,GAAYpF,WAAW,SAASrH,EAAM0jB,GAC/C,IAAI2b,EAAgB,qCAAqCt6B,KAAK2e,GAC1D4b,EAAU,kBAAkBv6B,KAAK2e,GACjC6b,EAAajzB,GAAOgzB,EAAW,QAAwB,QAAd5b,EAAuB,QAAU,IAAOA,GACjF8b,EAAeF,GAAW,QAAQv6B,KAAK2e,GAEtC6b,IAGLjzB,GAAOjF,UAAUqc,GAAc,WAC7B,IAAI/iB,EAAQ3N,KAAKia,YACb/M,EAAOo/B,EAAU,CAAC,GAAK9b,UACvBic,EAAS9+B,aAAiB8L,GAC1BjM,EAAWN,EAAK,GAChBw/B,EAAUD,GAAUjzB,GAAQ7L,GAE5BsuB,EAAc,SAAStuB,GACzB,IAAIO,EAASq+B,EAAWx/B,MAAMuM,GAAQ7K,GAAU,CAACd,GAAQT,IACzD,OAAQo/B,GAAWtyB,EAAY9L,EAAO,GAAKA,GAGzCw+B,GAAWL,GAAoC,mBAAZ7+B,GAA6C,GAAnBA,EAASL,SAExEs/B,EAASC,GAAU,GAErB,IAAI1yB,EAAWha,KAAKma,UAChBwyB,IAAa3sC,KAAKka,YAAY/M,OAC9By/B,EAAcJ,IAAiBxyB,EAC/B6yB,EAAWJ,IAAWE,EAE1B,IAAKH,GAAgBE,EAAS,CAC5B/+B,EAAQk/B,EAAWl/B,EAAQ,IAAI8L,GAAYzZ,MAC3C,IAAIkO,EAASlB,EAAKD,MAAMY,EAAOT,GAE/B,OADAgB,EAAOgM,YAAY5H,KAAK,CAAE,KAAQuf,GAAM,KAAQ,CAACoK,GAAc,QAAWt7B,IACnE,IAAI+Y,GAAcxL,EAAQ8L,GAEnC,OAAI4yB,GAAeC,EACV7/B,EAAKD,MAAM/M,KAAMkN,IAE1BgB,EAASlO,KAAK6xB,KAAKoK,GACZ2Q,EAAeN,EAAUp+B,EAAOP,QAAQ,GAAKO,EAAOP,QAAWO,QAK1EN,GAAU,CAAC,MAAO,OAAQ,QAAS,OAAQ,SAAU,YAAY,SAAS8iB,GACxE,IAAI1jB,EAAOoH,GAAWsc,GAClBoc,EAAY,0BAA0B/6B,KAAK2e,GAAc,MAAQ,OACjE8b,EAAe,kBAAkBz6B,KAAK2e,GAE1CpX,GAAOjF,UAAUqc,GAAc,WAC7B,IAAIxjB,EAAOsjB,UACX,GAAIgc,IAAiBxsC,KAAKma,UAAW,CACnC,IAAIxM,EAAQ3N,KAAK2N,QACjB,OAAOX,EAAKD,MAAMyM,GAAQ7L,GAASA,EAAQ,GAAIT,GAEjD,OAAOlN,KAAK8sC,IAAW,SAASn/B,GAC9B,OAAOX,EAAKD,MAAMyM,GAAQ7L,GAASA,EAAQ,GAAIT,UAMrDmV,GAAW5I,GAAYpF,WAAW,SAASrH,EAAM0jB,GAC/C,IAAI6b,EAAajzB,GAAOoX,GACxB,GAAI6b,EAAY,CACd,IAAI78B,EAAM68B,EAAWnX,KAAO,GACvBzgB,GAAevH,KAAKuL,GAAWjJ,KAClCiJ,GAAUjJ,GAAO,IAEnBiJ,GAAUjJ,GAAK4C,KAAK,CAAE,KAAQoe,EAAY,KAAQ6b,QAItD5zB,GAAU2Y,GAAa3wB,EAAWc,GAAoB2zB,MAAQ,CAAC,CAC7D,KAAQ,UACR,KAAQz0B,IAIV8Y,GAAYpF,UAAUyG,MAAQH,GAC9BlB,GAAYpF,UAAU8D,QAAU0C,GAChCpB,GAAYpF,UAAU1G,MAAQoN,GAG9BzB,GAAOjF,UAAUivB,GAAKpH,GACtB5iB,GAAOjF,UAAU0nB,MAAQI,GACzB7iB,GAAOjF,UAAU04B,OAAS3Q,GAC1B9iB,GAAOjF,UAAUjC,KAAOiqB,GACxB/iB,GAAOjF,UAAU6d,MAAQsK,GACzBljB,GAAOjF,UAAU8D,QAAUskB,GAC3BnjB,GAAOjF,UAAU24B,OAAS1zB,GAAOjF,UAAU+E,QAAUE,GAAOjF,UAAU1G,MAAQgvB,GAG9ErjB,GAAOjF,UAAU43B,MAAQ3yB,GAAOjF,UAAU6kB,KAEtC/iB,KACFmD,GAAOjF,UAAU8B,IAAeomB,IAE3BjjB,IAML1F,GAAIF,KAQNpI,GAAKsI,EAAIA,GAIT,aACE,OAAOA,IACR,qCAaHxG,KAAKpN,Q,0DCxwhBPJ,EAAOC,QAAU,IAA0B,iC,uBCA3CD,EAAOC,QAAU,IAA0B,6B,oCCA3C,IAAIC,EAAS,WAAa,IAAIC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,MAAM,CAACK,MAAM,CAAC,MAAQ,6BAA6B,QAAU,kBAAkB,CAACL,EAAG,OAAO,CAACK,MAAM,CAAC,EAAI,gtBACrMC,EAAkB,GCMtB,KCPqW,I,YCOjWC,EAAY,eACd,EACAZ,EACAW,GACA,EACA,KACA,KACA,MAIa,OAAAC,E,gCClBfd,EAAOC,QAAU,IAA0B,wB,uBCA3CD,EAAOC,QAAU,IAA0B,yB,uBCA3CD,EAAOC,QAAU,IAA0B,8B,uBCA3CD,EAAOC,QAAU,IAA0B,4B,qBCA3CD,EAAOC,QAAU,IAA0B,2B,oCCA3C,IAAIC,EAAS,WAAa,IAAIC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,MAAM,CAACE,YAAY,eAAeC,MAAM,CAAE,UAAWP,EAAIktC,SAAU,CAACltC,EAAImtC,GAAG,GAAGntC,EAAImtC,GAAG,GAAGntC,EAAImtC,GAAG,MAC9LzsC,EAAkB,CAAC,WAAa,IAAIV,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,MAAM,CAACE,YAAY,qBAAqB,CAACF,EAAG,KAAK,CAACA,EAAG,MAAM,CAACK,MAAM,CAAC,IAAM,EAAQ,QAA+B,MAAQ,QAAQT,EAAIotC,GAAG,yBAAyBhtC,EAAG,IAAI,CAACA,EAAG,OAAO,CAACE,YAAY,OAAO,CAACN,EAAIotC,GAAG,oBAAoBptC,EAAIotC,GAAG,aAAahtC,EAAG,MAAMJ,EAAIotC,GAAG,sDAAsD,WAAa,IAAIptC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,MAAM,CAACE,YAAY,qBAAqB,CAACF,EAAG,KAAK,CAACA,EAAG,MAAM,CAACK,MAAM,CAAC,IAAM,EAAQ,QAA8B,MAAQ,QAAQT,EAAIotC,GAAG,YAAYhtC,EAAG,IAAI,CAACA,EAAG,OAAO,CAACE,YAAY,OAAO,CAACN,EAAIotC,GAAG,sCAAsC,WAAa,IAAIptC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,MAAM,CAACE,YAAY,qBAAqB,CAACF,EAAG,KAAK,CAACJ,EAAIotC,GAAG,4BAA4BhtC,EAAG,IAAI,CAACE,YAAY,WAAWG,MAAM,CAAC,KAAO,2EAA2E,OAAS,WAAW,CAACL,EAAG,MAAM,CAACK,MAAM,CAAC,MAAQ,eAAe,IAAM,EAAQ,aAAiDL,EAAG,IAAI,CAACE,YAAY,WAAWG,MAAM,CAAC,KAAO,gEAAgE,OAAS,WAAW,CAACL,EAAG,MAAM,CAACK,MAAM,CAAC,MAAQ,cAAc,IAAM,EAAQ,iBCsC3zC,GACEqQ,MAAO,CAAC,WCxC2U,I,YCOjVnQ,EAAY,eACd,EACAZ,EACAW,GACA,EACA,KACA,KACA,MAIa,OAAAC,E,8BClBfd,EAAOC,QAAU,IAA0B,4B,uBCA3C,IAAI2S,EAAM,CACT,mBAAoB,OACpB,iBAAkB,OAClB,oBAAqB,OACrB,eAAgB,OAChB,qBAAsB,OACtB,kBAAmB,OACnB,sBAAuB,OACvB,eAAgB,OAChB,yCAA0C,OAC1C,gBAAiB,OACjB,cAAe,OACf,cAAe,OACf,mBAAoB,OACpB,kBAAmB,OACnB,oBAAqB,OACrB,6BAA8B,OAC9B,4BAA6B,OAC7B,cAAe,OACf,eAAgB,OAChB,4BAA6B,OAC7B,iBAAkB,OAClB,gBAAiB,OACjB,eAAgB,OAChB,aAAc,OACd,kBAAmB,OACnB,kBAAmB,OACnB,iBAAkB,OAClB,wBAAyB,OACzB,aAAc,OACd,uBAAwB,OACxB,4BAA6B,OAC7B,YAAa,OACb,mBAAoB,OACpB,gBAAiB,OACjB,aAAc,OACd,uBAAwB,OACxB,kBAAmB,OACnB,cAAe,OACf,aAAc,OACd,sBAAuB,OACvB,gBAAiB,OACjB,eAAgB,OAChB,gBAAiB,OACjB,mBAAoB,OACpB,mBAAoB,OACpB,cAAe,OACf,iBAAkB,OAClB,uBAAwB,OACxB,oBAAqB,OACrB,uBAAwB,OACxB,qBAAsB,OACtB,mBAAoB,OACpB,4BAA6B,OAC7B,uBAAwB,OACxB,mBAAoB,OACpB,sBAAuB,OACvB,sBAAuB,OACvB,uBAAwB,OACxB,sBAAuB,OACvB,sBAAuB,OACvB,gBAAiB,OACjB,gBAAiB,QAIlB,SAAS46B,EAAeC,GACvB,IAAIngB,EAAKogB,EAAsBD,GAC/B,OAAOE,EAAoBrgB,GAE5B,SAASogB,EAAsBD,GAC9B,IAAIE,EAAoBC,EAAEh7B,EAAK66B,GAAM,CACpC,IAAInhC,EAAI,IAAI8H,MAAM,uBAAyBq5B,EAAM,KAEjD,MADAnhC,EAAEuhC,KAAO,mBACHvhC,EAEP,OAAOsG,EAAI66B,GAEZD,EAAep4B,KAAO,WACrB,OAAO7J,OAAO6J,KAAKxC,IAEpB46B,EAAexW,QAAU0W,EACzB1tC,EAAOC,QAAUutC,EACjBA,EAAelgB,GAAK,Q,uBCnFpBttB,EAAOC,QAAU,IAA0B,0B,oCCA3C,IAAIC,EAAS,WAAa,IAAIC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,UAAU,CAACE,YAAY,+BAA+B,CAACF,EAAG,MAAM,CAACE,YAAY,kBAAkB,CAAEN,EAAa,UAAEI,EAAG,KAAK,CAACA,EAAG,MAAM,CAACK,MAAM,CAAC,IAAM,EAAQ,QAA6B,IAAM,WAAW,MAAQ,QAAQT,EAAIotC,GAAGptC,EAAI2tC,GAAG3tC,EAAI4tC,UAAU5tC,EAAI6tC,KAAKztC,EAAG,MAAM,CAACE,YAAY,8BAA8B,CAACF,EAAG,MAAM,CAACE,YAAY,qBAAqBC,MAAM,CAAC,qBAAuBP,EAAI8tC,eAAgB,WAAa9tC,EAAI+tC,OAAOC,MAAM,CAAEn7B,UAAW7S,EAAI6S,YAAa7S,EAAIiuC,GAAIjuC,EAAS,OAAE,SAASkuC,GAAM,OAAO9tC,EAAG,MAAM,CAACuP,IAAK,OAAUu+B,EAAS,KAAG5tC,YAAY,uBAAuB,CAAe,MAAb4tC,EAAKC,KAAc/tC,EAAG,MAAM,CAACE,YAAY,OAAOG,MAAM,CAAC,IAAM,UAAS,KAAuBytC,EAAS,KAAI,WAAYluC,EAAI6tC,KAAKztC,EAAG,KAAK,CAACJ,EAAIotC,GAAGptC,EAAI2tC,GAAGO,EAAKN,UAAUxtC,EAAG,cAAc,CAACK,MAAM,CAAC,GAAK,CAAC40B,KAAM,wBAAyB+Y,OAAQ,CAACC,KAAMH,EAAKG,SAAS,CAACruC,EAAIotC,GAAG,eAAehtC,EAAG,qBAAqB,IAAI,MAAK,KAAOJ,EAAI8tC,eAAoO9tC,EAAI6tC,KAAxNztC,EAAG,MAAM,CAACE,YAAY,eAAe,CAACF,EAAG,UAAU,CAACK,MAAM,CAAC,MAAQ2K,OAAO6J,KAAKjV,EAAIsuC,OAAO77B,IAAI87B,QAAQ,QAAUvuC,EAAIwuC,oBAAoBC,GAAG,CAAC,iBAAiB,SAASC,GAAQ1uC,EAAIwuC,mBAAmBE,OAAY,QAC/rChuC,EAAkB,G,YCDlB,EAAS,WAAa,IAAIV,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,MAAM,CAACE,YAAY,WAAWN,EAAIiuC,GAAIjuC,EAAS,OAAE,SAAS2uC,GAAG,OAAOvuC,EAAG,IAAI,CAACuP,IAAK,UAAYg/B,EAAGruC,YAAY,cAAcC,MAAM,CAACC,OAAQmuC,GAAK3uC,EAAI0Q,SAAS+9B,GAAG,CAAC,MAAQ,SAASC,GAAQ,OAAO1uC,EAAI4uC,OAAOD,UAAS,IAClT,EAAkB,GCMtB,G,UAAA,CAEE,MAAF,CACI,MAAJ,sBACI,QAAJ,CACM,KAAN,OACM,QAAN,IAKE,QAAF,CACI,OADJ,SACA,GACM,KAAN,kBACM,KAAN,wCCrBiV,I,YCO7UhuC,EAAY,eACd,EACA,EACA,GACA,EACA,KACA,KACA,MAIa,EAAAA,E,QCSf,GAEE,MAAF,CACI,UAAJ,CACM,KAAN,QACM,SAAN,GAGI,MAAJ,CACM,KAAN,OACM,QAAN,oBAGI,eAAJ,CACM,KAAN,QACM,SAAN,GAGI,MAAJ,CACM,KAAN,OAGI,MAAJ,SAGE,WAAF,CACI,gBAAJ,OACI,QAAJ,GAGE,SAAF,CACI,UADJ,WAEM,MAAN,0DAIE,KApCF,WAqCI,MAAJ,CACM,mBAAN,KCjEsW,ICOlW,EAAY,eACd,EACAZ,EACAW,GACA,EACA,KACA,KACA,MAIa,S,8BClBfb,EAAOC,QAAU,SAASD,GAoBzB,OAnBKA,EAAOgvC,kBACXhvC,EAAOivC,UAAY,aACnBjvC,EAAOmgB,MAAQ,GAEVngB,EAAOkvC,WAAUlvC,EAAOkvC,SAAW,IACxC3jC,OAAOmL,eAAe1W,EAAQ,SAAU,CACvCmvC,YAAY,EACZxxB,IAAK,WACJ,OAAO3d,EAAOovC,KAGhB7jC,OAAOmL,eAAe1W,EAAQ,KAAM,CACnCmvC,YAAY,EACZxxB,IAAK,WACJ,OAAO3d,EAAO8uC,KAGhB9uC,EAAOgvC,gBAAkB,GAEnBhvC,I,oCCpBR,IAAIE,EAAS,WAAa,IAAIC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,UAAU,CAACE,YAAY,wBAAwB,CAACF,EAAG,MAAM,CAACE,YAAY,eAAeC,MAAM,CAAE,WAAYP,EAAI+tC,QAAS,CAAC/tC,EAAImtC,GAAG,GAAG/sC,EAAG,MAAM,CAACE,YAAY,4BACtPI,EAAkB,CAAC,WAAa,IAAIV,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,MAAM,CAACE,YAAY,wBAAwB,CAACF,EAAG,KAAK,CAACJ,EAAIotC,GAAG,4BAA4BhtC,EAAG,IAAI,CAACJ,EAAIotC,GAAG,yTAAyThtC,EAAG,MAAM,CAACE,YAAY,8BAA8B,CAACF,EAAG,IAAI,CAACK,MAAM,CAAC,KAAO,2EAA2E,OAAS,WAAW,CAACL,EAAG,MAAM,CAACK,MAAM,CAAC,MAAQ,eAAe,IAAM,EAAQ,aAAiDL,EAAG,IAAI,CAACK,MAAM,CAAC,KAAO,gEAAgE,OAAS,WAAW,CAACL,EAAG,MAAM,CAACK,MAAM,CAAC,MAAQ,cAAc,IAAM,EAAQ,mBCkC/7B,GACEqQ,MAAO,CACLi9B,MAAOmB,UCrCyV,I,YCOhWvuC,EAAY,eACd,EACAZ,EACAW,GACA,EACA,KACA,KACA,MAIa,OAAAC,E,8BClBfd,EAAOC,QAAU,IAA0B,0B,uBCA3CD,EAAOC,QAAU,IAA0B,8B,oCCA3C,IAAIC,EAAS,WAAa,IAAIC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,MAAM,CAACK,MAAM,CAAC,MAAQ,6BAA6B,QAAU,sBAAsB,CAACL,EAAG,OAAO,CAACK,MAAM,CAAC,EAAI,kZACzMC,EAAkB,G,YCAlByuC,EAAS,GAKTxuC,EAAY,eACdwuC,EACApvC,EACAW,GACA,EACA,KACA,KACA,MAIa,OAAAC,E,gCCjBfd,EAAOC,QAAU,IAA0B,wC,uBCA3CD,EAAOC,QAAU,IAA0B,8B,qBCA3CD,EAAOC,QAAU,IAA0B,4B,uBCA3CD,EAAOC,QAAU,IAA0B,mC,uBCA3CD,EAAOC,QAAU,IAA0B,+B,uBCA3CD,EAAOC,QAAU,IAA0B,mC,qBCA3CD,EAAOC,QAAU,IAA0B,kC,uBCA3CD,EAAOC,QAAU,IAA0B,qD,qBCA3CD,EAAOC,QAAU,IAA0B,2B,qBCA3CD,EAAOC,QAAU,IAA0B,iC,uBCA3CD,EAAOC,QAAU,IAA0B,mC,uBCA3CD,EAAOC,QAAU,IAA0B,kC,qBCA3CD,EAAOC,QAAU,IAA0B,kC,uBCA3CD,EAAOC,QAAU,IAA0B,mC,uBCA3CD,EAAOC,QAAU,IAA0B,kC,oCCA3C,IAAIC,EAAS,WAAa,IAAIC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,MAAM,CAACE,YAAY,YAAYC,MAAM,CAAE,WAAYP,EAAIovC,SAAU3uC,MAAM,CAAC,YAAYT,EAAI+b,OAAO,CAAC3b,EAAG,MAAM,CAACE,YAAY,kBAAkBC,MAAM,CAAE,kBAAmBP,EAAIqvC,eAAgBrB,MAAQ,0BAA6BhuC,EAAIsvC,KAAU,MAAI,OAASlvC,EAAG,MAAM,CAACE,YAAY,qBAAqB,CAAE,CAAC,EAAG,EAAG,GAAGyhB,SAAS/hB,EAAI+b,MAAO,CAAC3b,EAAG,MAAM,CAACE,YAAY,oBAAoB,CAACF,EAAG,QAAQ,CAACJ,EAAIotC,GAAG,UAAUhtC,EAAG,SAAS,CAACJ,EAAIotC,GAAGptC,EAAI2tC,GAAG3tC,EAAIsvC,KAAKC,aAAanvC,EAAG,MAAM,CAACE,YAAY,kBAAkB,CAACF,EAAG,gBAAgB,CAACE,YAAY,OAAOG,MAAM,CAAC,MAAQ,QAAQL,EAAG,OAAO,CAACJ,EAAIotC,GAAG,IAAIptC,EAAI2tC,GAAG3tC,EAAIsvC,KAAKE,eAAe,IAAkB,IAAbxvC,EAAI+b,KAAY,CAAC3b,EAAG,OAAO,CAACE,YAAY,uBAAuB,CAACN,EAAIotC,GAAG,oBAAoBptC,EAAI6tC,KAAKztC,EAAG,KAAK,CAACA,EAAG,cAAc,CAACK,MAAM,CAAC,GAAKT,EAAIyvC,KAAK,CAACzvC,EAAIotC,GAAGptC,EAAI2tC,GAAG3tC,EAAIsvC,KAAK1B,WAAW,GAAiB,IAAb5tC,EAAI+b,KAAY,CAAC3b,EAAG,MAAM,CAACE,YAAY,4BAA4B,CAACF,EAAG,OAAO,CAACE,YAAY,QAAQ,CAACF,EAAG,gBAAgB,CAACK,MAAM,CAAC,MAAQ,QAAQT,EAAIotC,GAAG,IAAIptC,EAAI2tC,GAAG3tC,EAAIsvC,KAAKI,YAAY,MAAM,GAAGtvC,EAAG,OAAO,CAACE,YAAY,QAAQ,CAACF,EAAG,aAAa,CAACK,MAAM,CAAC,MAAQ,QAAQT,EAAIotC,GAAG,IAAIptC,EAAI2tC,GAAG3tC,EAAIsvC,KAAKK,YAAY,MAAM,MAAM3vC,EAAI6tC,KAAM7tC,EAAW,QAAEI,EAAG,MAAM,CAACE,YAAY,kBAAkB,CAACN,EAAIotC,GAAGptC,EAAI2tC,GAAG3tC,EAAIsvC,KAAKM,SAAS5vC,EAAI6tC,KAAM7tC,EAAI6vC,YAAc7vC,EAAI8vC,iBAAkB1vC,EAAG,cAAc,CAACE,YAAY,4CAA4CG,MAAM,CAAC,GAAKT,EAAIyvC,KAAK,CAAEzvC,EAAc,WAAE,CAACA,EAAIotC,GAAGptC,EAAI2tC,GAAG3tC,EAAI6vC,cAAc,CAAC7vC,EAAIotC,GAAGptC,EAAI2tC,GAAG3tC,EAAI8vC,qBAAqB,GAAG9vC,EAAI6tC,MAAM,MAC1gDntC,EAAkB,G,wBCmDtB,GACEqvC,WAAY,CAAd,sCAEEj/B,MAAO,CACLw+B,KAAMlkC,OACNykC,WAAY,CACV9zB,KAAM5H,QAER67B,UAAW,CACTj0B,KAAMmzB,QACNe,SAAS,GAEXb,QAAS,CACPrzB,KAAMmzB,QACNe,SAAS,GAEXl0B,KAAM,CACJA,KAAM5H,OACN+7B,OAAQ,QAGVb,cAAe,CACbtzB,KAAMmzB,QACNe,SAAS,IAIbj0B,SAAU,CACRyzB,GADJ,WAEM,IAAN,GACQU,EAAG,cACHC,EAAG,cACHC,EAAG,cACHC,EAAG,cACHC,EAAG,cACHC,EAAG,iBACHC,EAAG,gBACX,WAEM,OADAC,QAAQC,IAAI,OAAQ1wC,KAAK8b,MAClB,CACLsZ,KAAR,EACQ+Y,OAAQ,CACNC,KAAMpuC,KAAKqvC,KAAKjB,KAChBtyB,KAAoB,IAAd9b,KAAK8b,KAAa,QAAU,UAKxC+zB,iBArBJ,WAsBM,MAAO,CACLK,EAAG,WACHC,EAAG,UACHC,EAAG,WACHC,EAAG,WACHC,EAAG,WACHC,EAAG,YACHC,EAAG,YACX,cC7GiW,I,YCO7V9vC,EAAY,eACd,EACAZ,EACAW,GACA,EACA,KACA,KACA,MAIa,OAAAC,E,8BClBfd,EAAOC,QAAU,IAA0B,mC,qBCA3CD,EAAOC,QAAU,IAA0B,8B,qBCA3CD,EAAOC,QAAU,IAA0B,0B,kCCA3C,IAAIC,EAAS,WAAa,IAAIC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,UAAU,CAACE,YAAY,0BAA0BC,MAAMP,EAAI4wC,OAAO,CAACxwC,EAAG,MAAM,CAACE,YAAY,kBAAkB,CAACF,EAAG,MAAM,CAACE,YAAY,mBAAmB,CAACF,EAAG,KAAK,CAACJ,EAAIotC,GAAG,gBAAgBhtC,EAAG,IAAI,CAACJ,EAAIotC,GAAG,kEAAkEhtC,EAAG,MAAM,CAACE,YAAY,SAAS,CAACF,EAAG,QAAQ,CAACywC,IAAI,QAAQpwC,MAAM,CAAC,KAAO,QAAQ,YAAc,uBAAuBL,EAAG,IAAI,CAACE,YAAY,sBAAsBmuC,GAAG,CAAC,MAAQ,SAASC,GAAQ,OAAO1uC,EAAI8wC,iBAAiB,CAAC1wC,EAAG,MAAM,CAACJ,EAAIotC,GAAG,WAAWhtC,EAAG,mBAAmB,CAACK,MAAM,CAAC,MAAQ,SAAS,SAASL,EAAG,MAAM,CAACE,YAAY,mBAAmB,CAACF,EAAG,KAAK,CAACJ,EAAIotC,GAAG,cAAchtC,EAAG,IAAI,CAACJ,EAAIotC,GAAG,yDAAyDhtC,EAAG,kBAAkB,CAACK,MAAM,CAAC,aAAa,SAAS,GAAGL,EAAG,QAAQ,CAACK,MAAM,CAAC,OAAST,EAAI+wC,oBAAoBtC,GAAG,CAAC,gBAAgB,SAASC,GAAQ1uC,EAAI+wC,mBAAmBrC,KAAU,CAACtuC,EAAG,MAAM,CAACE,YAAY,eAAe,CAACF,EAAG,KAAK,CAACJ,EAAIotC,GAAG,gDAAgD,MACxjC1sC,EAAkB,G,wECiCtB,GACEqvC,WAAY,CAAd,2DAEEj/B,MAAO,CAAC,SAERsB,KALF,WAMI,MAAO,CACL2+B,oBAAoB,IAIxB/0B,SAAU,CACRg1B,iBADJ,WAEM,MAAO,CACb,CAAQ,KAAR,WAAQ,MAAR,YACA,CAAQ,KAAR,WAAQ,MAAR,YACA,CAAQ,KAAR,UAAQ,MAAR,cAKEC,QAAS,CACP,YADJ,WACA,iKACA,uBACA,EAFA,gCAGA,2CAHA,OAKA,uBACA,wBANA,gDCxDoV,I,YCOhVtwC,EAAY,eACd,EACAZ,EACAW,GACA,EACA,KACA,KACA,MAIa,OAAAC,E,8BClBfd,EAAOC,QAAU,IAA0B,wC,qBCA3CD,EAAOC,QAAU,IAA0B,+B,qBCA3CD,EAAOC,QAAU,IAA0B,0B,yCCA3C,IAAIC,EAAS,WAAa,IAAIC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,MAAM,CAACA,EAAG,eAAeA,EAAG,MAAM,CAACK,MAAM,CAAC,GAAK,iBAAiB,CAACL,EAAG,iBAAiB,CAACK,MAAM,CAAC,MAAQT,EAAIkxC,SAAS9wC,EAAG,SAASA,EAAG,OAAO,CAACK,MAAM,CAAC,MAAQT,EAAImxC,QAAQ/wC,EAAG,gBAAgBA,EAAG,QAAQ,CAACK,MAAM,CAAC,MAAQT,EAAIoxC,SAAShxC,EAAG,WAAWA,EAAG,cAAcA,EAAG,QAAQ,CAACK,MAAM,CAAC,OAAST,EAAIqxC,kBAAkB5C,GAAG,CAAC,gBAAgB,SAASC,GAAQ1uC,EAAIqxC,iBAAiB3C,KAAU,CAACtuC,EAAG,MAAM,CAACE,YAAY,eAAe,CAACF,EAAG,KAAK,CAACJ,EAAIotC,GAAGptC,EAAI2tC,GAAG3tC,EAAIsxC,MAAM1D,UAAUxtC,EAAG,IAAI,CAACJ,EAAIotC,GAAGptC,EAAI2tC,GAAG3tC,EAAIsxC,MAAMhc,iBAAiB,IAAI,IAC1lB50B,EAAkB,G,gDCDlB,EAAS,WAAa,IAAIV,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,MAAM,CAACE,YAAY,eAAe,CAACF,EAAG,WAAW,CAACK,MAAM,CAAC,OAAST,EAAIuxC,SAAS,OAASvxC,EAAIwxC,eAAe/C,GAAG,CAAC,gBAAgB,SAASC,GAAQ1uC,EAAIuxC,SAAS7C,MAAWtuC,EAAG,MAAM,CAACywC,IAAI,oBAAoBvwC,YAAY,uBAAuB,CAACF,EAAG,MAAM,CAACK,MAAM,CAAC,IAAM,EAAQ,QAA6B,MAAQ,SAASL,EAAG,KAAK,CAACJ,EAAIotC,GAAG,uCAAuChtC,EAAG,IAAI,CAACE,YAAY,oBAAoBG,MAAM,CAAC,KAAO,qBAAqBL,EAAG,aAAa,CAACE,YAAY,qBAAqBG,MAAM,CAAC,WAAWT,EAAIwxC,cAAc,cAAcxxC,EAAIuxC,UAAU9C,GAAG,CAAC,oBAAoB,SAASC,GAAQ1uC,EAAIuxC,SAAS7C,GAAQ,qBAAqB,SAASA,GAAQ1uC,EAAIuxC,SAAS7C,OAAY,IAC3wB,EAAkB,G,oCCkBtB,GAEE,WAAF,CACI,WAAJ,OACI,UAAJ,QAEE,KANF,WAOI,MAAJ,CACM,UAAN,EACM,eAAN,IAIE,QAAF,CAEI,kBAAJ,kCAEM,IAAN,+BAEM,GAAN,EAAM,CAJA,IAAN,EAMA,4BANA,EAMA,MANA,EAMA,OAEM,KAAN,2BAEA,KAIE,MAAF,CACI,SADJ,SACA,IACA,8CAIE,QAnCF,WAoCI,OAAJ,sDAGE,cAvCF,WAwCI,OAAJ,qDACI,SAAJ,uCC5D+V,I,YCO3V/tC,EAAY,eACd,EACA,EACA,GACA,EACA,KACA,KACA,MAIa,EAAAA,E,QClBX,EAAS,WAAa,IAAIX,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,UAAU,CAACE,YAAY,cAAc,CAACF,EAAG,QAAQ,CAACJ,EAAImtC,GAAG,GAAG/sC,EAAG,IAAI,CAACJ,EAAIotC,GAAG,iPAAiPhtC,EAAG,cAAc,CAACE,YAAY,qBAAqBG,MAAM,CAAC,GAAK,CAAE40B,KAAM,UAAW,CAACr1B,EAAIotC,GAAG,eAAe,GAAGhtC,EAAG,MAAM,CAACE,YAAY,iBAAiB,CAACN,EAAImtC,GAAG,GAAG/sC,EAAG,qBAAqB,CAACK,MAAM,CAAC,kBAAkB,cAAcT,EAAIiuC,GAAIjuC,EAAIoxC,MAAMrU,QAAO,SAAU+H,GAAQ,OAAwB,GAAjBA,EAAK2M,aAAmB,SAASvD,GAAM,OAAO9tC,EAAG,MAAM,CAACuP,IAAK,QAAWu+B,EAAO,GAAG5tC,YAAY,kBAAkB,CAACF,EAAG,YAAY,CAACK,MAAM,CAAC,KAAOytC,EAAK,KAAOA,EAAKuD,aAAa,MAAK,GAAGzxC,EAAImtC,GAAG,GAAG/sC,EAAG,qBAAqB,CAACK,MAAM,CAAC,kBAAkB,cAAcT,EAAIiuC,GAAIjuC,EAAIoxC,MAAMrU,QAAO,SAAU+H,GAAQ,OAAwB,GAAjBA,EAAK2M,aAAmB,SAASvD,GAAM,OAAO9tC,EAAG,MAAM,CAACuP,IAAK,QAAWu+B,EAAO,GAAG5tC,YAAY,kBAAkB,CAACF,EAAG,YAAY,CAACK,MAAM,CAAC,KAAOytC,EAAK,KAAO,QAAQ,MAAK,IAAI,MACxoC,EAAkB,CAAC,WAAa,IAAIluC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,SAAS,CAACA,EAAG,MAAM,CAACK,MAAM,CAAC,IAAM,EAAQ,QAAkC,MAAQ,SAASL,EAAG,KAAK,CAACJ,EAAIotC,GAAG,+BAA+B,WAAa,IAAIptC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,KAAK,CAACA,EAAG,MAAM,CAACK,MAAM,CAAC,IAAM,EAAQ,QAAiC,MAAQ,QAAQT,EAAIotC,GAAG,eAAe,WAAa,IAAIptC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,KAAK,CAACE,YAAY,2BAA2B,CAACF,EAAG,MAAM,CAACK,MAAM,CAAC,IAAM,EAAQ,QAA8B,MAAQ,QAAQT,EAAIotC,GAAG,gB,YCD9oB,EAAS,WAAa,IAAIptC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,MAAM,CAACE,YAAY,sBAAsB,CAACF,EAAG,MAAM,CAACywC,IAAI,WAAWvwC,YAAY,8BAA8BC,MAAMP,EAAI0xC,gBAAgB,CAAC1xC,EAAI2xC,GAAG,YAAY,GAAGvxC,EAAG,MAAM,CAACG,MAAM,CAAC,cAAgBP,EAAI4xC,aAAa,CAACxxC,EAAG,MAAM,CAACE,YAAY,8BAA8BG,MAAM,CAAC,gBAAgB,SAAS,CAACL,EAAG,IAAI,CAACE,YAAY,OAAOmuC,GAAG,CAAC,MAAQ,SAASC,GAAQ,OAAO1uC,EAAI6xC,MAAM,MAAM,CAACzxC,EAAG,mBAAmB,CAACK,MAAM,CAAC,SAAU,EAAK,MAAQ,SAAS,GAAGL,EAAG,IAAI,CAACE,YAAY,OAAOmuC,GAAG,CAAC,MAAQ,SAASC,GAAgC,OAAxBA,EAAOoD,iBAAwB9xC,EAAI6xC,KAAK,MAAM,CAACzxC,EAAG,mBAAmB,CAACK,MAAM,CAAC,MAAQ,SAAS,UAC5qB,EAAkB,G,YCoBtB,GACE,WAAF,CACI,gBAAJ,QAEE,MAAF,CACI,eAAJ,OACI,WAAJ,CACM,KAAN,QACM,SAAN,IAKE,QAAF,CAEI,KAFJ,SAEA,GAEM,IAAN,sBAEM,EAAN,+BCxC2V,ICOvV,EAAY,eACd,EACA,EACA,GACA,EACA,KACA,KACA,MAIa,I,QCqCf,GACEsvC,WAAY,CACVgC,SAAJ,OACIC,kBAAJ,GAEElhC,MAAO,CAAC,SAERmgC,QAAS,IC9DmV,ICO1V,EAAY,eACd,EACA,EACA,GACA,EACA,KACA,KACA,MAIa,I,QClBX,EAAS,WAAa,IAAIjxC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,UAAU,CAACE,YAAY,SAAS,CAACF,EAAG,aAAa,CAACK,MAAM,CAAC,KAAO,SAAS,CAAET,EAAe,YAAEI,EAAG,MAAM,CAACE,YAAY,eAAe,CAACF,EAAG,MAAM,CAACE,YAAY,uBAAuB,CAACF,EAAG,IAAI,CAACE,YAAY,oBAAoBmuC,GAAG,CAAC,MAAQ,WAAc,OAAQzuC,EAAIiyC,aAAc,KAAY,CAACjyC,EAAIotC,GAAG,OAAOhtC,EAAG,SAAS,CAACK,MAAM,CAAC,MAAQ,OAAO,OAAS,MAAM,IAAM,4CAA4C,YAAc,IAAI,MAAQ,0EAA0E,gBAAkB,UAAUT,EAAI6tC,OAAOztC,EAAG,MAAM,CAACE,YAAY,iBAAiB,CAACF,EAAG,MAAM,CAACE,YAAY,iBAAiB,CAACF,EAAG,KAAK,CAACJ,EAAIotC,GAAG,gCAAgChtC,EAAG,IAAI,CAACJ,EAAIotC,GAAG,obAAobhtC,EAAG,MAAM,CAACE,YAAY,iBAAiB,CAACF,EAAG,cAAc,CAACE,YAAY,uBAAuBG,MAAM,CAAC,GAAK,CAAE40B,KAAM,gBAAiB,CAACr1B,EAAIotC,GAAG,kBAAkBhtC,EAAG,IAAI,CAACE,YAAY,kDAAkDmuC,GAAG,CAAC,MAAQ,SAASC,GAAgC,OAAxBA,EAAOoD,iBAAwB,WAAe,OAAQ9xC,EAAIiyC,aAAc,EAAzC,MAA8D,CAAC7xC,EAAG,OAAO,CAACJ,EAAIotC,GAAG,oBAAoBhtC,EAAG,aAAa,CAACE,YAAY,aAAaG,MAAM,CAAC,MAAQ,SAAS,IAAI,QAAQ,IACzoD,EAAkB,G,YCqDtB,GACEsvC,WAAY,CACVmC,UAAJ,QAGE9/B,KALF,WAMI,MAAO,CACL6/B,aAAa,KC7D2U,ICO1V,EAAY,eACd,EACA,EACA,GACA,EACA,KACA,KACA,MAIa,I,QClBX,EAAS,WAAa,IAAIjyC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,MAAM,CAACE,YAAY,qBAAqB,CAACF,EAAG,MAAM,CAACE,YAAY,kBAAkB,CAACN,EAAImtC,GAAG,GAAG/sC,EAAG,KAAK,CAACJ,EAAIotC,GAAG,gIAAgIhtC,EAAG,qBAAqB,CAACK,MAAM,CAAC,kBAAkB,eAAe,eAAc,IAAQT,EAAIiuC,GAAIjuC,EAAS,OAAE,SAASmyC,GAAQ,OAAO/xC,EAAG,cAAc,CAACuP,IAAK,gBAAmBwiC,EAAS,GAAG7xC,YAAY,mBAAmBG,MAAM,CAAC,GAAK,CACxiB40B,KAAM,cACN+Y,OAAQ,CAAEC,KAAM8D,EAAO9D,SACrB,CAACjuC,EAAG,MAAM,CAACE,YAAY,0BAA0B,CAACF,EAAG,aAAc+xC,EAAY,MAAE/xC,EAAG,MAAM,CAACK,MAAM,CAAC,IAAM0xC,EAAOC,MAAM,OAAS,SAASpyC,EAAI6tC,MAAM,GAAGztC,EAAG,IAAI,CAACE,YAAY,yBAAyB,CAACN,EAAIotC,GAAGptC,EAAI2tC,GAAGwE,EAAO9c,SAASj1B,EAAG,IAAI,CAACE,YAAY,6BAA6B,CAACN,EAAIotC,GAAG,IAAIptC,EAAI2tC,GAAGwE,EAAOvC,MAAM,OAAOxvC,EAAG,MAAM,CAACE,YAAY,eAAe,CAACF,EAAG,OAAO,CAACJ,EAAIotC,GAAG,gBAAgBhtC,EAAG,mBAAmB,CAACK,MAAM,CAAC,MAAQ,SAAS,QAAO,GAAGL,EAAG,MAAM,CAACE,YAAY,4BAA4B+xC,YAAY,CAAC,aAAa,SAAS,CAACjyC,EAAG,cAAc,CAACE,YAAY,uBAAuBG,MAAM,CAAC,GAAK,CAAE40B,KAAM,eAAgB,CAACr1B,EAAIotC,GAAG,iBAAiB,IAAI,MAC7oB,EAAkB,CAAC,WAAa,IAAIptC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,KAAK,CAACA,EAAG,MAAM,CAACK,MAAM,CAAC,IAAM,EAAQ,QAA6B,MAAQ,QAAQT,EAAIotC,GAAG,+B,YCkDtM,GACE2C,WAAY,CAAd,4DACEj/B,MAAO,CAAC,SACRmgC,QAAS,ICzDkV,ICOzV,EAAY,eACd,EACA,EACA,GACA,EACA,KACA,KACA,MAIa,I,oBClBX,EAAS,WAAa,IAAIjxC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,UAAU,CAACE,YAAY,WAAW,CAACF,EAAG,MAAM,CAACE,YAAY,mBAAmB,CAACF,EAAG,KAAK,CAACJ,EAAIotC,GAAG,cAAchtC,EAAG,MAAM,CAACE,YAAY,wBAAwB,CAACF,EAAG,eAAe,CAACK,MAAM,CAAC,WAAU,MAAS,GAAGL,EAAG,MAAM,CAACE,YAAY,wBAAwB,CAACN,EAAImtC,GAAG,GAAGntC,EAAIiuC,GAAIjuC,EAAa,WAAE,SAASkuC,GAAM,OAAO9tC,EAAG,MAAM,CAACuP,IAAIu+B,EAAKN,MAAMttC,YAAY,mBAAmB,CAACF,EAAG,KAAK,CAACJ,EAAIotC,GAAGptC,EAAI2tC,GAAGO,EAAKN,UAAUxtC,EAAG,IAAI,CAACJ,EAAIotC,GAAGptC,EAAI2tC,GAAGO,EAAK0B,eAAc,QACvhB,EAAkB,CAAC,WAAa,IAAI5vC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,KAAK,CAACA,EAAG,MAAM,CAACK,MAAM,CAAC,IAAM,EAAQ,WAAsCT,EAAIotC,GAAG,iB,YCqB/L,GAEE,WAAF,CAAI,YAAJ,QAEE,SAAF,CACI,UADJ,WAEM,MAAN,CACA,CAAQ,MAAR,YAAQ,KAAR,kFACA,CAAQ,MAAR,WAAQ,KAAR,sFACA,CAAQ,MAAR,iBAAQ,KAAR,oGACA,CAAQ,MAAR,SAAQ,KAAR,uFACA,CAAQ,MAAR,sBAAQ,KAAR,iFCjCgW,ICO5V,EAAY,eACd,EACA,EACA,GACA,EACA,KACA,KACA,MAIa,I,kCCiBf,IACE/X,KAAM,OAEN0a,WAAY,CACVuC,QAAJ,EACIC,YAAJ,OACIC,cAAJ,OACIC,WAAJ,EACIC,WAAJ,OACIC,KAAJ,EACIC,MAAJ,EACIC,MAAJ,EACIC,MAAJ,SAGE1gC,KAfF,WAgBI,MAAO,CACLi/B,kBAAkB,EAClBC,MAAO,GACPF,MAAO,GACPF,MAAO,GACPC,KAAM,KAIV,QAzBF,WAyBA,wKACA,aADA,uBAEA,aAFA,uBAGA,YAHA,uBAIA,cAJA,8CAOEF,QAAS,CACP,SADJ,WACA,gLACA,qBADA,gBACA,EADA,EACA,KACA,UAFA,8CAKI,SANJ,WAMA,gLACA,0BADA,gBACA,EADA,EACA,KACA,UAFA,8CAKI,QAXJ,WAWA,gLACA,oBADA,gBACA,EADA,EACA,KACA,SAFA,8CAKI,UAhBJ,WAgBA,gLACA,sBADA,gBACA,EADA,EACA,KACA,IACA,sBACA,0BACA,uBALA,+CASE8B,aAzDF,WA0DIC,SAASC,gBAAgBC,UAAUt1B,IAAI,sBAGzCu1B,cA7DF,WA8DIH,SAASC,gBAAgBC,UAAUjZ,OAAO,uBCjGgS,MCO1U,GAAY,eACd,GACAl6B,EACAW,GACA,EACA,KACA,KACA,MAIa,gB,8BClBfb,EAAOC,QAAU,IAA0B,kC,qBCA3CD,EAAOC,QAAU,IAA0B,8B,qBCA3CD,EAAOC,QAAU,IAA0B,yB,kCCA3C,IAAIC,EAAS,WAAa,IAAIC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,MAAM,CAACK,MAAM,CAAC,MAAQ,6BAA6B,QAAU,cAAc,CAACL,EAAG,OAAO,CAACK,MAAM,CAAC,EAAI,kEAAkE,YAAY,gBAC/QC,EAAkB,GCMtB,KCPkW,I,YCO9VC,EAAY,eACd,EACAZ,EACAW,GACA,EACA,KACA,KACA,MAIa,OAAAC,E,8BClBfd,EAAOC,QAAU,IAA0B,2B,qBCA3CD,EAAOC,QAAU,IAA0B,4B,qBCA3CD,EAAOC,QAAU,IAA0B,yC,qBCA3CD,EAAOC,QAAU,IAA0B,kC,qBCA3CD,EAAOC,QAAU,IAA0B,2B,qBCA3CD,EAAOC,QAAU,IAA0B,4B,qBCA3CD,EAAOC,QAAU,IAA0B,+B,qBCA3CD,EAAOC,QAAU,IAA0B,6B,qBCA3CD,EAAOC,QAAU,IAA0B,gC,qBCA3CD,EAAOC,QAAU,IAA0B,4B,qBCA3CD,EAAOC,QAAU,IAA0B,oC,qBCA3CD,EAAOC,QAAU,IAA0B,8B,qBCA3CD,EAAOC,QAAU,IAA0B,4B,kCCA3C,IAAIC,EAAS,WAAa,IAAIC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,MAAM,CAACywC,IAAI,SAASvwC,YAAY,kBAAkBC,MAAM,CAAC,WAAYP,EAAIozC,UAAU,CAAChzC,EAAG,cAAc,CAACE,YAAY,OAAOG,MAAM,CAAC,GAAK,CAAC40B,KAAM,UAAU,CAACj1B,EAAG,MAAM,CAACK,MAAM,CAAC,IAAM,EAAQ,QAA4C,MAAQ,WAAWL,EAAG,OAAO,CAACE,YAAY,WAAWN,EAAImtC,GAAG,GAAG/sC,EAAG,OAAO,CAACE,YAAY,WAAWN,EAAImtC,GAAG,GAAG/sC,EAAG,IAAI,CAACE,YAAY,eAAemuC,GAAG,CAAC,MAAQzuC,EAAIqzC,aAAa,CAAErzC,EAAc,WAAEI,EAAG,MAAM,CAACK,MAAM,CAAC,IAAM,EAAQ,QAA8B,MAAQ,QAAQ,CAACL,EAAG,OAAO,CAACE,YAAY,iBAAiB,CAACN,EAAIotC,GAAG,UAAUhtC,EAAG,MAAM,CAACK,MAAM,CAAC,IAAM,EAAQ,QAA6B,MAAQ,UAAU,IAAI,IACxtBC,EAAkB,CAAC,WAAa,IAAIV,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,MAAM,CAACE,YAAY,4BAA4B,CAACF,EAAG,IAAI,CAACE,YAAY,uBAAuBG,MAAM,CAAC,KAAO,2CAA2C,OAAS,WAAW,CAACT,EAAIotC,GAAG,4BAA4B,WAAa,IAAIptC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,MAAM,CAACE,YAAY,OAAO,CAACF,EAAG,QAAQ,CAACE,YAAY,iBAAiB,CAACN,EAAIotC,GAAG,uBAAuBhtC,EAAG,IAAI,CAACK,MAAM,CAAC,KAAO,mBAAmB,CAACL,EAAG,MAAM,CAACK,MAAM,CAAC,IAAM,EAAQ,QAAiC,MAAQ,QAAQL,EAAG,QAAQ,CAACE,YAAY,iBAAiB,CAACN,EAAIotC,GAAG,UAAUhtC,EAAG,OAAO,CAACE,YAAY,iBAAiB,CAACN,EAAIotC,GAAG,qBC0BvtB,GAEE,MAAF,CACI,QAAJ,QACI,WAAJ,SAGE,QAAF,CACI,WADJ,WAEM,KAAN,+CCpCkW,I,YCO9VzsC,EAAY,eACd,EACAZ,EACAW,GACA,EACA,KACA,KACA,MAIa,OAAAC,E,8BClBfd,EAAOC,QAAU,IAA0B,2B,qBCA3CD,EAAOC,QAAU,IAA0B,mC,kCCA3C,IAAIC,EAAS,WAAa,IAAIC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,aAAa,CAACA,EAAG,MAAM,CAACE,YAAY,OAAOC,MAAM,CAAEC,OAAQR,EAAIQ,OAAQ,YAAaR,EAAIszC,SAAU,CAAGtzC,EAAIszC,OAA8ItzC,EAAI6tC,KAA1IztC,EAAG,IAAI,CAACE,YAAY,yBAAyBmuC,GAAG,CAAC,MAAQ,WAAc,OAAOzuC,EAAIuzC,MAAM,iBAAiB,MAAY,CAACvzC,EAAIotC,GAAG,SAAkBhtC,EAAG,MAAM,CAACE,YAAY,kBAAkB,CAACF,EAAG,MAAM,CAACK,MAAM,CAAC,IAAM,EAAQ,QAAmC,MAAQ,SAASL,EAAG,kBAAkB,CAACK,MAAM,CAAC,aAAa,QAAQL,EAAG,IAAI,CAACE,YAAY,kCAAkCG,MAAM,CAAC,KAAO,mDAAmD,OAAS,WAAW,CAACL,EAAG,MAAM,CAACE,YAAY,OAAOG,MAAM,CAAC,IAAM,EAAQ,QAAuC,MAAQ,QAAQL,EAAG,OAAO,CAACJ,EAAIotC,GAAG,0BAA0BhtC,EAAG,MAAMA,EAAG,MAAMA,EAAG,MAAMA,EAAG,cAAc,CAACE,YAAY,kCAAkCG,MAAM,CAAC,GAAK,CAAE40B,KAAM,4BAA6B,CAACj1B,EAAG,MAAM,CAACE,YAAY,OAAOG,MAAM,CAAC,IAAM,EAAQ,WAA0CT,EAAIotC,GAAG,2BAA2B,GAAGhtC,EAAG,MAAM,CAACE,YAAY,mBAAmB,CAACF,EAAG,KAAKJ,EAAImtC,GAAG,GAAG,UACxnCzsC,EAAkB,CAAC,WAAa,IAAIV,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOF,EAAIiuC,GAAIjuC,EAAS,OAAE,SAASkuC,GAAM,OAAO9tC,EAAG,KAAK,CAACuP,IAAK,aAAgBu+B,EAAS,MAAI,CAAC9tC,EAAG,cAAc,CAACG,MAAM,CAAEC,OAAQR,EAAIwzC,OAAOne,OAAS6Y,EAAKuB,GAAGpa,MAAO50B,MAAM,CAAC,GAAKytC,EAAKuB,KAAK,CAACzvC,EAAIotC,GAAGptC,EAAI2tC,GAAGO,EAAKN,WAAW,Q,YC4DzT,GACE,MAAF,oBAEE,WAAF,CAAI,eAAJ,QACE,SAAF,CACI,MADJ,WAEM,MAAN,CACA,CAAQ,GAAR,CAAU,KAAV,QAAQ,MAAR,QACA,CAAQ,GAAR,CAAU,KAAV,QAAQ,MAAR,wBACA,CACQ,GAAR,CAAU,KAAV,uBACQ,MAAR,oBAEA,CAAQ,GAAR,CAAU,KAAV,cAAQ,MAAR,aACA,CAAQ,GAAR,CAAU,KAAV,aAAQ,MAAR,UACA,CACQ,GAAR,CAAU,KAAV,qBACQ,MAAR,oBAEA,CAAQ,GAAR,CAAU,KAAV,gBAAQ,MAAR,cAKE,MAAF,CACI,OADJ,SACA,GACM,SAAN,iDAGI,OALJ,WAMM,KAAN,4BAIE,cAlCF,WAmCI,SAAJ,uCChG8U,I,YCO1UjtC,EAAY,eACd,EACAZ,EACAW,GACA,EACA,KACA,KACA,MAIa,OAAAC,E","file":"js/chunk-3b64a6ba.ac950258.js","sourcesContent":["module.exports = __webpack_public_path__ + \"img/civil.e6693f07.svg\";","module.exports = __webpack_public_path__ + \"img/articles.8031d8db.svg\";","module.exports = __webpack_public_path__ + \"img/white_icon.add1d3d0.svg\";","module.exports = __webpack_public_path__ + \"img/compliance.1f7d48c2.svg\";","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('svg',{staticClass:\"logo-icon\",class:{active: _vm.active},attrs:{\"viewBox\":\"0 0 140.947 139.606\"}},[_c('g',{attrs:{\"transform\":\"matrix(1.33333 0 0 -1.33333 -822.193 2491.136)\"}},[_c('g',[_c('path',{staticClass:\"logo-icon-path-1\",attrs:{\"d\":\"M665.78 1774.648L655.033 1764l-10.75 10.648 10.75 10.643zM722 1829.258l-38.602-38.235-11.004 10.898 38.603 38.236zM694.717 1857.35l-10.748-10.641-10.748 10.641 10.748 10.65zM666.606 1829.256l-38.6-38.233L617 1801.928l38.6 38.229z\",\"fill\":\"none\",\"stroke-width\":\".5\",\"stroke-miterlimit\":\"10\"}}),_c('path',{staticClass:\"logo-icon-path-2\",attrs:{\"d\":\"M627.746 1819.685L617 1830.33l10.746 10.646 10.75-10.646zM683.71 1764.82l-38.6 38.235 11.003 10.898 38.603-38.232zM711.254 1791.024l-10.75 10.646 10.75 10.645L722 1801.67zM683.71 1818.047l-38.6 38.235 11.005 10.899 38.601-38.229z\",\"fill\":\"none\",\"stroke-width\":\".5\",\"stroke-miterlimit\":\"10\"}})])])])}\nvar staticRenderFns = []\n\nexport { render, staticRenderFns }","\r\n\r\n\r\n","import mod from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./LogoIcon.vue?vue&type=script&lang=js&\"; export default mod; export * from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./LogoIcon.vue?vue&type=script&lang=js&\"","import { render, staticRenderFns } from \"./LogoIcon.vue?vue&type=template&id=882f4fd2&\"\nimport script from \"./LogoIcon.vue?vue&type=script&lang=js&\"\nexport * from \"./LogoIcon.vue?vue&type=script&lang=js&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n null,\n null\n \n)\n\nexport default component.exports","module.exports = __webpack_public_path__ + \"img/whatsapp.a9702bbc.svg\";","module.exports = __webpack_public_path__ + \"img/news.6cbbd78c.svg\";","module.exports = __webpack_public_path__ + \"img/diversidade.46b5c3af.svg\";","module.exports = __webpack_public_path__ + \"img/tributario.2c4a5aba.svg\";","module.exports = __webpack_public_path__ + \"img/white_icon_outlined.9576cfa8.svg\";","module.exports = __webpack_public_path__ + \"img/banner_home.1d3da2e9.svg\";","module.exports = __webpack_public_path__ + \"img/expertise_area_logo.9de78546.svg\";","module.exports = __webpack_public_path__ + \"img/logo.9c7d0931.svg\";","module.exports = __webpack_public_path__ + \"img/phone_blue.7baa2dc2.png\";","/**\n * @license\n * Lodash \n * Copyright OpenJS Foundation and other contributors \n * Released under MIT license \n * Based on Underscore.js 1.8.3 \n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n;(function() {\n\n /** Used as a safe reference for `undefined` in pre-ES5 environments. */\n var undefined;\n\n /** Used as the semantic version number. */\n var VERSION = '4.17.20';\n\n /** Used as the size to enable large array optimizations. */\n var LARGE_ARRAY_SIZE = 200;\n\n /** Error message constants. */\n var CORE_ERROR_TEXT = 'Unsupported core-js use. Try https://npms.io/search?q=ponyfill.',\n FUNC_ERROR_TEXT = 'Expected a function';\n\n /** Used to stand-in for `undefined` hash values. */\n var HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n /** Used as the maximum memoize cache size. */\n var MAX_MEMOIZE_SIZE = 500;\n\n /** Used as the internal argument placeholder. */\n var PLACEHOLDER = '__lodash_placeholder__';\n\n /** Used to compose bitmasks for cloning. */\n var CLONE_DEEP_FLAG = 1,\n CLONE_FLAT_FLAG = 2,\n CLONE_SYMBOLS_FLAG = 4;\n\n /** Used to compose bitmasks for value comparisons. */\n var COMPARE_PARTIAL_FLAG = 1,\n COMPARE_UNORDERED_FLAG = 2;\n\n /** Used to compose bitmasks for function metadata. */\n var WRAP_BIND_FLAG = 1,\n WRAP_BIND_KEY_FLAG = 2,\n WRAP_CURRY_BOUND_FLAG = 4,\n WRAP_CURRY_FLAG = 8,\n WRAP_CURRY_RIGHT_FLAG = 16,\n WRAP_PARTIAL_FLAG = 32,\n WRAP_PARTIAL_RIGHT_FLAG = 64,\n WRAP_ARY_FLAG = 128,\n WRAP_REARG_FLAG = 256,\n WRAP_FLIP_FLAG = 512;\n\n /** Used as default options for `_.truncate`. */\n var DEFAULT_TRUNC_LENGTH = 30,\n DEFAULT_TRUNC_OMISSION = '...';\n\n /** Used to detect hot functions by number of calls within a span of milliseconds. */\n var HOT_COUNT = 800,\n HOT_SPAN = 16;\n\n /** Used to indicate the type of lazy iteratees. */\n var LAZY_FILTER_FLAG = 1,\n LAZY_MAP_FLAG = 2,\n LAZY_WHILE_FLAG = 3;\n\n /** Used as references for various `Number` constants. */\n var INFINITY = 1 / 0,\n MAX_SAFE_INTEGER = 9007199254740991,\n MAX_INTEGER = 1.7976931348623157e+308,\n NAN = 0 / 0;\n\n /** Used as references for the maximum length and index of an array. */\n var MAX_ARRAY_LENGTH = 4294967295,\n MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1,\n HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;\n\n /** Used to associate wrap methods with their bit flags. */\n var wrapFlags = [\n ['ary', WRAP_ARY_FLAG],\n ['bind', WRAP_BIND_FLAG],\n ['bindKey', WRAP_BIND_KEY_FLAG],\n ['curry', WRAP_CURRY_FLAG],\n ['curryRight', WRAP_CURRY_RIGHT_FLAG],\n ['flip', WRAP_FLIP_FLAG],\n ['partial', WRAP_PARTIAL_FLAG],\n ['partialRight', WRAP_PARTIAL_RIGHT_FLAG],\n ['rearg', WRAP_REARG_FLAG]\n ];\n\n /** `Object#toString` result references. */\n var argsTag = '[object Arguments]',\n arrayTag = '[object Array]',\n asyncTag = '[object AsyncFunction]',\n boolTag = '[object Boolean]',\n dateTag = '[object Date]',\n domExcTag = '[object DOMException]',\n errorTag = '[object Error]',\n funcTag = '[object Function]',\n genTag = '[object GeneratorFunction]',\n mapTag = '[object Map]',\n numberTag = '[object Number]',\n nullTag = '[object Null]',\n objectTag = '[object Object]',\n promiseTag = '[object Promise]',\n proxyTag = '[object Proxy]',\n regexpTag = '[object RegExp]',\n setTag = '[object Set]',\n stringTag = '[object String]',\n symbolTag = '[object Symbol]',\n undefinedTag = '[object Undefined]',\n weakMapTag = '[object WeakMap]',\n weakSetTag = '[object WeakSet]';\n\n var arrayBufferTag = '[object ArrayBuffer]',\n dataViewTag = '[object DataView]',\n float32Tag = '[object Float32Array]',\n float64Tag = '[object Float64Array]',\n int8Tag = '[object Int8Array]',\n int16Tag = '[object Int16Array]',\n int32Tag = '[object Int32Array]',\n uint8Tag = '[object Uint8Array]',\n uint8ClampedTag = '[object Uint8ClampedArray]',\n uint16Tag = '[object Uint16Array]',\n uint32Tag = '[object Uint32Array]';\n\n /** Used to match empty string literals in compiled template source. */\n var reEmptyStringLeading = /\\b__p \\+= '';/g,\n reEmptyStringMiddle = /\\b(__p \\+=) '' \\+/g,\n reEmptyStringTrailing = /(__e\\(.*?\\)|\\b__t\\)) \\+\\n'';/g;\n\n /** Used to match HTML entities and HTML characters. */\n var reEscapedHtml = /&(?:amp|lt|gt|quot|#39);/g,\n reUnescapedHtml = /[&<>\"']/g,\n reHasEscapedHtml = RegExp(reEscapedHtml.source),\n reHasUnescapedHtml = RegExp(reUnescapedHtml.source);\n\n /** Used to match template delimiters. */\n var reEscape = /<%-([\\s\\S]+?)%>/g,\n reEvaluate = /<%([\\s\\S]+?)%>/g,\n reInterpolate = /<%=([\\s\\S]+?)%>/g;\n\n /** Used to match property names within property paths. */\n var reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n reIsPlainProp = /^\\w*$/,\n rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n /**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\n var reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g,\n reHasRegExpChar = RegExp(reRegExpChar.source);\n\n /** Used to match leading and trailing whitespace. */\n var reTrim = /^\\s+|\\s+$/g,\n reTrimStart = /^\\s+/,\n reTrimEnd = /\\s+$/;\n\n /** Used to match wrap detail comments. */\n var reWrapComment = /\\{(?:\\n\\/\\* \\[wrapped with .+\\] \\*\\/)?\\n?/,\n reWrapDetails = /\\{\\n\\/\\* \\[wrapped with (.+)\\] \\*/,\n reSplitDetails = /,? & /;\n\n /** Used to match words composed of alphanumeric characters. */\n var reAsciiWord = /[^\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\x7f]+/g;\n\n /** Used to match backslashes in property paths. */\n var reEscapeChar = /\\\\(\\\\)?/g;\n\n /**\n * Used to match\n * [ES template delimiters](http://ecma-international.org/ecma-262/7.0/#sec-template-literal-lexical-components).\n */\n var reEsTemplate = /\\$\\{([^\\\\}]*(?:\\\\.[^\\\\}]*)*)\\}/g;\n\n /** Used to match `RegExp` flags from their coerced string values. */\n var reFlags = /\\w*$/;\n\n /** Used to detect bad signed hexadecimal string values. */\n var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n /** Used to detect binary string values. */\n var reIsBinary = /^0b[01]+$/i;\n\n /** Used to detect host constructors (Safari). */\n var reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n /** Used to detect octal string values. */\n var reIsOctal = /^0o[0-7]+$/i;\n\n /** Used to detect unsigned integer values. */\n var reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n /** Used to match Latin Unicode letters (excluding mathematical operators). */\n var reLatin = /[\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\xff\\u0100-\\u017f]/g;\n\n /** Used to ensure capturing order of template delimiters. */\n var reNoMatch = /($^)/;\n\n /** Used to match unescaped characters in compiled string literals. */\n var reUnescapedString = /['\\n\\r\\u2028\\u2029\\\\]/g;\n\n /** Used to compose unicode character classes. */\n var rsAstralRange = '\\\\ud800-\\\\udfff',\n rsComboMarksRange = '\\\\u0300-\\\\u036f',\n reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n rsDingbatRange = '\\\\u2700-\\\\u27bf',\n rsLowerRange = 'a-z\\\\xdf-\\\\xf6\\\\xf8-\\\\xff',\n rsMathOpRange = '\\\\xac\\\\xb1\\\\xd7\\\\xf7',\n rsNonCharRange = '\\\\x00-\\\\x2f\\\\x3a-\\\\x40\\\\x5b-\\\\x60\\\\x7b-\\\\xbf',\n rsPunctuationRange = '\\\\u2000-\\\\u206f',\n rsSpaceRange = ' \\\\t\\\\x0b\\\\f\\\\xa0\\\\ufeff\\\\n\\\\r\\\\u2028\\\\u2029\\\\u1680\\\\u180e\\\\u2000\\\\u2001\\\\u2002\\\\u2003\\\\u2004\\\\u2005\\\\u2006\\\\u2007\\\\u2008\\\\u2009\\\\u200a\\\\u202f\\\\u205f\\\\u3000',\n rsUpperRange = 'A-Z\\\\xc0-\\\\xd6\\\\xd8-\\\\xde',\n rsVarRange = '\\\\ufe0e\\\\ufe0f',\n rsBreakRange = rsMathOpRange + rsNonCharRange + rsPunctuationRange + rsSpaceRange;\n\n /** Used to compose unicode capture groups. */\n var rsApos = \"['\\u2019]\",\n rsAstral = '[' + rsAstralRange + ']',\n rsBreak = '[' + rsBreakRange + ']',\n rsCombo = '[' + rsComboRange + ']',\n rsDigits = '\\\\d+',\n rsDingbat = '[' + rsDingbatRange + ']',\n rsLower = '[' + rsLowerRange + ']',\n rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']',\n rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n rsNonAstral = '[^' + rsAstralRange + ']',\n rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n rsUpper = '[' + rsUpperRange + ']',\n rsZWJ = '\\\\u200d';\n\n /** Used to compose unicode regexes. */\n var rsMiscLower = '(?:' + rsLower + '|' + rsMisc + ')',\n rsMiscUpper = '(?:' + rsUpper + '|' + rsMisc + ')',\n rsOptContrLower = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',\n rsOptContrUpper = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',\n reOptMod = rsModifier + '?',\n rsOptVar = '[' + rsVarRange + ']?',\n rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n rsOrdLower = '\\\\d*(?:1st|2nd|3rd|(?![123])\\\\dth)(?=\\\\b|[A-Z_])',\n rsOrdUpper = '\\\\d*(?:1ST|2ND|3RD|(?![123])\\\\dTH)(?=\\\\b|[a-z_])',\n rsSeq = rsOptVar + reOptMod + rsOptJoin,\n rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq,\n rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n /** Used to match apostrophes. */\n var reApos = RegExp(rsApos, 'g');\n\n /**\n * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and\n * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).\n */\n var reComboMark = RegExp(rsCombo, 'g');\n\n /** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\n var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n /** Used to match complex or compound words. */\n var reUnicodeWord = RegExp([\n rsUpper + '?' + rsLower + '+' + rsOptContrLower + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',\n rsMiscUpper + '+' + rsOptContrUpper + '(?=' + [rsBreak, rsUpper + rsMiscLower, '$'].join('|') + ')',\n rsUpper + '?' + rsMiscLower + '+' + rsOptContrLower,\n rsUpper + '+' + rsOptContrUpper,\n rsOrdUpper,\n rsOrdLower,\n rsDigits,\n rsEmoji\n ].join('|'), 'g');\n\n /** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\n var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange + rsComboRange + rsVarRange + ']');\n\n /** Used to detect strings that need a more robust regexp to match words. */\n var reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;\n\n /** Used to assign default `context` object properties. */\n var contextProps = [\n 'Array', 'Buffer', 'DataView', 'Date', 'Error', 'Float32Array', 'Float64Array',\n 'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Map', 'Math', 'Object',\n 'Promise', 'RegExp', 'Set', 'String', 'Symbol', 'TypeError', 'Uint8Array',\n 'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap',\n '_', 'clearTimeout', 'isFinite', 'parseInt', 'setTimeout'\n ];\n\n /** Used to make template sourceURLs easier to identify. */\n var templateCounter = -1;\n\n /** Used to identify `toStringTag` values of typed arrays. */\n var typedArrayTags = {};\n typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\n typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\n typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\n typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\n typedArrayTags[uint32Tag] = true;\n typedArrayTags[argsTag] = typedArrayTags[arrayTag] =\n typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\n typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\n typedArrayTags[errorTag] = typedArrayTags[funcTag] =\n typedArrayTags[mapTag] = typedArrayTags[numberTag] =\n typedArrayTags[objectTag] = typedArrayTags[regexpTag] =\n typedArrayTags[setTag] = typedArrayTags[stringTag] =\n typedArrayTags[weakMapTag] = false;\n\n /** Used to identify `toStringTag` values supported by `_.clone`. */\n var cloneableTags = {};\n cloneableTags[argsTag] = cloneableTags[arrayTag] =\n cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\n cloneableTags[boolTag] = cloneableTags[dateTag] =\n cloneableTags[float32Tag] = cloneableTags[float64Tag] =\n cloneableTags[int8Tag] = cloneableTags[int16Tag] =\n cloneableTags[int32Tag] = cloneableTags[mapTag] =\n cloneableTags[numberTag] = cloneableTags[objectTag] =\n cloneableTags[regexpTag] = cloneableTags[setTag] =\n cloneableTags[stringTag] = cloneableTags[symbolTag] =\n cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\n cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\n cloneableTags[errorTag] = cloneableTags[funcTag] =\n cloneableTags[weakMapTag] = false;\n\n /** Used to map Latin Unicode letters to basic Latin letters. */\n var deburredLetters = {\n // Latin-1 Supplement block.\n '\\xc0': 'A', '\\xc1': 'A', '\\xc2': 'A', '\\xc3': 'A', '\\xc4': 'A', '\\xc5': 'A',\n '\\xe0': 'a', '\\xe1': 'a', '\\xe2': 'a', '\\xe3': 'a', '\\xe4': 'a', '\\xe5': 'a',\n '\\xc7': 'C', '\\xe7': 'c',\n '\\xd0': 'D', '\\xf0': 'd',\n '\\xc8': 'E', '\\xc9': 'E', '\\xca': 'E', '\\xcb': 'E',\n '\\xe8': 'e', '\\xe9': 'e', '\\xea': 'e', '\\xeb': 'e',\n '\\xcc': 'I', '\\xcd': 'I', '\\xce': 'I', '\\xcf': 'I',\n '\\xec': 'i', '\\xed': 'i', '\\xee': 'i', '\\xef': 'i',\n '\\xd1': 'N', '\\xf1': 'n',\n '\\xd2': 'O', '\\xd3': 'O', '\\xd4': 'O', '\\xd5': 'O', '\\xd6': 'O', '\\xd8': 'O',\n '\\xf2': 'o', '\\xf3': 'o', '\\xf4': 'o', '\\xf5': 'o', '\\xf6': 'o', '\\xf8': 'o',\n '\\xd9': 'U', '\\xda': 'U', '\\xdb': 'U', '\\xdc': 'U',\n '\\xf9': 'u', '\\xfa': 'u', '\\xfb': 'u', '\\xfc': 'u',\n '\\xdd': 'Y', '\\xfd': 'y', '\\xff': 'y',\n '\\xc6': 'Ae', '\\xe6': 'ae',\n '\\xde': 'Th', '\\xfe': 'th',\n '\\xdf': 'ss',\n // Latin Extended-A block.\n '\\u0100': 'A', '\\u0102': 'A', '\\u0104': 'A',\n '\\u0101': 'a', '\\u0103': 'a', '\\u0105': 'a',\n '\\u0106': 'C', '\\u0108': 'C', '\\u010a': 'C', '\\u010c': 'C',\n '\\u0107': 'c', '\\u0109': 'c', '\\u010b': 'c', '\\u010d': 'c',\n '\\u010e': 'D', '\\u0110': 'D', '\\u010f': 'd', '\\u0111': 'd',\n '\\u0112': 'E', '\\u0114': 'E', '\\u0116': 'E', '\\u0118': 'E', '\\u011a': 'E',\n '\\u0113': 'e', '\\u0115': 'e', '\\u0117': 'e', '\\u0119': 'e', '\\u011b': 'e',\n '\\u011c': 'G', '\\u011e': 'G', '\\u0120': 'G', '\\u0122': 'G',\n '\\u011d': 'g', '\\u011f': 'g', '\\u0121': 'g', '\\u0123': 'g',\n '\\u0124': 'H', '\\u0126': 'H', '\\u0125': 'h', '\\u0127': 'h',\n '\\u0128': 'I', '\\u012a': 'I', '\\u012c': 'I', '\\u012e': 'I', '\\u0130': 'I',\n '\\u0129': 'i', '\\u012b': 'i', '\\u012d': 'i', '\\u012f': 'i', '\\u0131': 'i',\n '\\u0134': 'J', '\\u0135': 'j',\n '\\u0136': 'K', '\\u0137': 'k', '\\u0138': 'k',\n '\\u0139': 'L', '\\u013b': 'L', '\\u013d': 'L', '\\u013f': 'L', '\\u0141': 'L',\n '\\u013a': 'l', '\\u013c': 'l', '\\u013e': 'l', '\\u0140': 'l', '\\u0142': 'l',\n '\\u0143': 'N', '\\u0145': 'N', '\\u0147': 'N', '\\u014a': 'N',\n '\\u0144': 'n', '\\u0146': 'n', '\\u0148': 'n', '\\u014b': 'n',\n '\\u014c': 'O', '\\u014e': 'O', '\\u0150': 'O',\n '\\u014d': 'o', '\\u014f': 'o', '\\u0151': 'o',\n '\\u0154': 'R', '\\u0156': 'R', '\\u0158': 'R',\n '\\u0155': 'r', '\\u0157': 'r', '\\u0159': 'r',\n '\\u015a': 'S', '\\u015c': 'S', '\\u015e': 'S', '\\u0160': 'S',\n '\\u015b': 's', '\\u015d': 's', '\\u015f': 's', '\\u0161': 's',\n '\\u0162': 'T', '\\u0164': 'T', '\\u0166': 'T',\n '\\u0163': 't', '\\u0165': 't', '\\u0167': 't',\n '\\u0168': 'U', '\\u016a': 'U', '\\u016c': 'U', '\\u016e': 'U', '\\u0170': 'U', '\\u0172': 'U',\n '\\u0169': 'u', '\\u016b': 'u', '\\u016d': 'u', '\\u016f': 'u', '\\u0171': 'u', '\\u0173': 'u',\n '\\u0174': 'W', '\\u0175': 'w',\n '\\u0176': 'Y', '\\u0177': 'y', '\\u0178': 'Y',\n '\\u0179': 'Z', '\\u017b': 'Z', '\\u017d': 'Z',\n '\\u017a': 'z', '\\u017c': 'z', '\\u017e': 'z',\n '\\u0132': 'IJ', '\\u0133': 'ij',\n '\\u0152': 'Oe', '\\u0153': 'oe',\n '\\u0149': \"'n\", '\\u017f': 's'\n };\n\n /** Used to map characters to HTML entities. */\n var htmlEscapes = {\n '&': '&',\n '<': '<',\n '>': '>',\n '\"': '"',\n \"'\": '''\n };\n\n /** Used to map HTML entities to characters. */\n var htmlUnescapes = {\n '&': '&',\n '<': '<',\n '>': '>',\n '"': '\"',\n ''': \"'\"\n };\n\n /** Used to escape characters for inclusion in compiled string literals. */\n var stringEscapes = {\n '\\\\': '\\\\',\n \"'\": \"'\",\n '\\n': 'n',\n '\\r': 'r',\n '\\u2028': 'u2028',\n '\\u2029': 'u2029'\n };\n\n /** Built-in method references without a dependency on `root`. */\n var freeParseFloat = parseFloat,\n freeParseInt = parseInt;\n\n /** Detect free variable `global` from Node.js. */\n var freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n /** Detect free variable `self`. */\n var freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n /** Used as a reference to the global object. */\n var root = freeGlobal || freeSelf || Function('return this')();\n\n /** Detect free variable `exports`. */\n var freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n /** Detect free variable `module`. */\n var freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n /** Detect the popular CommonJS extension `module.exports`. */\n var moduleExports = freeModule && freeModule.exports === freeExports;\n\n /** Detect free variable `process` from Node.js. */\n var freeProcess = moduleExports && freeGlobal.process;\n\n /** Used to access faster Node.js helpers. */\n var nodeUtil = (function() {\n try {\n // Use `util.types` for Node.js 10+.\n var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n if (types) {\n return types;\n }\n\n // Legacy `process.binding('util')` for Node.js < 10.\n return freeProcess && freeProcess.binding && freeProcess.binding('util');\n } catch (e) {}\n }());\n\n /* Node.js helper references. */\n var nodeIsArrayBuffer = nodeUtil && nodeUtil.isArrayBuffer,\n nodeIsDate = nodeUtil && nodeUtil.isDate,\n nodeIsMap = nodeUtil && nodeUtil.isMap,\n nodeIsRegExp = nodeUtil && nodeUtil.isRegExp,\n nodeIsSet = nodeUtil && nodeUtil.isSet,\n nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n /*--------------------------------------------------------------------------*/\n\n /**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\n function apply(func, thisArg, args) {\n switch (args.length) {\n case 0: return func.call(thisArg);\n case 1: return func.call(thisArg, args[0]);\n case 2: return func.call(thisArg, args[0], args[1]);\n case 3: return func.call(thisArg, args[0], args[1], args[2]);\n }\n return func.apply(thisArg, args);\n }\n\n /**\n * A specialized version of `baseAggregator` for arrays.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform keys.\n * @param {Object} accumulator The initial aggregated object.\n * @returns {Function} Returns `accumulator`.\n */\n function arrayAggregator(array, setter, iteratee, accumulator) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n var value = array[index];\n setter(accumulator, value, iteratee(value), array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\n function arrayEach(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (iteratee(array[index], index, array) === false) {\n break;\n }\n }\n return array;\n }\n\n /**\n * A specialized version of `_.forEachRight` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\n function arrayEachRight(array, iteratee) {\n var length = array == null ? 0 : array.length;\n\n while (length--) {\n if (iteratee(array[length], length, array) === false) {\n break;\n }\n }\n return array;\n }\n\n /**\n * A specialized version of `_.every` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`.\n */\n function arrayEvery(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (!predicate(array[index], index, array)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * A specialized version of `_.filter` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\n function arrayFilter(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (predicate(value, index, array)) {\n result[resIndex++] = value;\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\n function arrayIncludes(array, value) {\n var length = array == null ? 0 : array.length;\n return !!length && baseIndexOf(array, value, 0) > -1;\n }\n\n /**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\n function arrayIncludesWith(array, value, comparator) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (comparator(value, array[index])) {\n return true;\n }\n }\n return false;\n }\n\n /**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\n function arrayMap(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length,\n result = Array(length);\n\n while (++index < length) {\n result[index] = iteratee(array[index], index, array);\n }\n return result;\n }\n\n /**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\n function arrayPush(array, values) {\n var index = -1,\n length = values.length,\n offset = array.length;\n\n while (++index < length) {\n array[offset + index] = values[index];\n }\n return array;\n }\n\n /**\n * A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the first element of `array` as\n * the initial value.\n * @returns {*} Returns the accumulated value.\n */\n function arrayReduce(array, iteratee, accumulator, initAccum) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n if (initAccum && length) {\n accumulator = array[++index];\n }\n while (++index < length) {\n accumulator = iteratee(accumulator, array[index], index, array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.reduceRight` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the last element of `array` as\n * the initial value.\n * @returns {*} Returns the accumulated value.\n */\n function arrayReduceRight(array, iteratee, accumulator, initAccum) {\n var length = array == null ? 0 : array.length;\n if (initAccum && length) {\n accumulator = array[--length];\n }\n while (length--) {\n accumulator = iteratee(accumulator, array[length], length, array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.some` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n */\n function arraySome(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (predicate(array[index], index, array)) {\n return true;\n }\n }\n return false;\n }\n\n /**\n * Gets the size of an ASCII `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\n var asciiSize = baseProperty('length');\n\n /**\n * Converts an ASCII `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function asciiToArray(string) {\n return string.split('');\n }\n\n /**\n * Splits an ASCII `string` into an array of its words.\n *\n * @private\n * @param {string} The string to inspect.\n * @returns {Array} Returns the words of `string`.\n */\n function asciiWords(string) {\n return string.match(reAsciiWord) || [];\n }\n\n /**\n * The base implementation of methods like `_.findKey` and `_.findLastKey`,\n * without support for iteratee shorthands, which iterates over `collection`\n * using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the found element or its key, else `undefined`.\n */\n function baseFindKey(collection, predicate, eachFunc) {\n var result;\n eachFunc(collection, function(value, key, collection) {\n if (predicate(value, key, collection)) {\n result = key;\n return false;\n }\n });\n return result;\n }\n\n /**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseFindIndex(array, predicate, fromIndex, fromRight) {\n var length = array.length,\n index = fromIndex + (fromRight ? 1 : -1);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (predicate(array[index], index, array)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseIndexOf(array, value, fromIndex) {\n return value === value\n ? strictIndexOf(array, value, fromIndex)\n : baseFindIndex(array, baseIsNaN, fromIndex);\n }\n\n /**\n * This function is like `baseIndexOf` except that it accepts a comparator.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseIndexOfWith(array, value, fromIndex, comparator) {\n var index = fromIndex - 1,\n length = array.length;\n\n while (++index < length) {\n if (comparator(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\n function baseIsNaN(value) {\n return value !== value;\n }\n\n /**\n * The base implementation of `_.mean` and `_.meanBy` without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {number} Returns the mean.\n */\n function baseMean(array, iteratee) {\n var length = array == null ? 0 : array.length;\n return length ? (baseSum(array, iteratee) / length) : NAN;\n }\n\n /**\n * The base implementation of `_.property` without support for deep paths.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\n function baseProperty(key) {\n return function(object) {\n return object == null ? undefined : object[key];\n };\n }\n\n /**\n * The base implementation of `_.propertyOf` without support for deep paths.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Function} Returns the new accessor function.\n */\n function basePropertyOf(object) {\n return function(key) {\n return object == null ? undefined : object[key];\n };\n }\n\n /**\n * The base implementation of `_.reduce` and `_.reduceRight`, without support\n * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} accumulator The initial value.\n * @param {boolean} initAccum Specify using the first or last element of\n * `collection` as the initial value.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the accumulated value.\n */\n function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n eachFunc(collection, function(value, index, collection) {\n accumulator = initAccum\n ? (initAccum = false, value)\n : iteratee(accumulator, value, index, collection);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.sortBy` which uses `comparer` to define the\n * sort order of `array` and replaces criteria objects with their corresponding\n * values.\n *\n * @private\n * @param {Array} array The array to sort.\n * @param {Function} comparer The function to define sort order.\n * @returns {Array} Returns `array`.\n */\n function baseSortBy(array, comparer) {\n var length = array.length;\n\n array.sort(comparer);\n while (length--) {\n array[length] = array[length].value;\n }\n return array;\n }\n\n /**\n * The base implementation of `_.sum` and `_.sumBy` without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {number} Returns the sum.\n */\n function baseSum(array, iteratee) {\n var result,\n index = -1,\n length = array.length;\n\n while (++index < length) {\n var current = iteratee(array[index]);\n if (current !== undefined) {\n result = result === undefined ? current : (result + current);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\n function baseTimes(n, iteratee) {\n var index = -1,\n result = Array(n);\n\n while (++index < n) {\n result[index] = iteratee(index);\n }\n return result;\n }\n\n /**\n * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array\n * of key-value pairs for `object` corresponding to the property names of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the key-value pairs.\n */\n function baseToPairs(object, props) {\n return arrayMap(props, function(key) {\n return [key, object[key]];\n });\n }\n\n /**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\n function baseUnary(func) {\n return function(value) {\n return func(value);\n };\n }\n\n /**\n * The base implementation of `_.values` and `_.valuesIn` which creates an\n * array of `object` property values corresponding to the property names\n * of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the array of property values.\n */\n function baseValues(object, props) {\n return arrayMap(props, function(key) {\n return object[key];\n });\n }\n\n /**\n * Checks if a `cache` value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function cacheHas(cache, key) {\n return cache.has(key);\n }\n\n /**\n * Used by `_.trim` and `_.trimStart` to get the index of the first string symbol\n * that is not found in the character symbols.\n *\n * @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the first unmatched string symbol.\n */\n function charsStartIndex(strSymbols, chrSymbols) {\n var index = -1,\n length = strSymbols.length;\n\n while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n return index;\n }\n\n /**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol\n * that is not found in the character symbols.\n *\n * @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the last unmatched string symbol.\n */\n function charsEndIndex(strSymbols, chrSymbols) {\n var index = strSymbols.length;\n\n while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n return index;\n }\n\n /**\n * Gets the number of `placeholder` occurrences in `array`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} placeholder The placeholder to search for.\n * @returns {number} Returns the placeholder count.\n */\n function countHolders(array, placeholder) {\n var length = array.length,\n result = 0;\n\n while (length--) {\n if (array[length] === placeholder) {\n ++result;\n }\n }\n return result;\n }\n\n /**\n * Used by `_.deburr` to convert Latin-1 Supplement and Latin Extended-A\n * letters to basic Latin letters.\n *\n * @private\n * @param {string} letter The matched letter to deburr.\n * @returns {string} Returns the deburred letter.\n */\n var deburrLetter = basePropertyOf(deburredLetters);\n\n /**\n * Used by `_.escape` to convert characters to HTML entities.\n *\n * @private\n * @param {string} chr The matched character to escape.\n * @returns {string} Returns the escaped character.\n */\n var escapeHtmlChar = basePropertyOf(htmlEscapes);\n\n /**\n * Used by `_.template` to escape characters for inclusion in compiled string literals.\n *\n * @private\n * @param {string} chr The matched character to escape.\n * @returns {string} Returns the escaped character.\n */\n function escapeStringChar(chr) {\n return '\\\\' + stringEscapes[chr];\n }\n\n /**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\n function getValue(object, key) {\n return object == null ? undefined : object[key];\n }\n\n /**\n * Checks if `string` contains Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n */\n function hasUnicode(string) {\n return reHasUnicode.test(string);\n }\n\n /**\n * Checks if `string` contains a word composed of Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a word is found, else `false`.\n */\n function hasUnicodeWord(string) {\n return reHasUnicodeWord.test(string);\n }\n\n /**\n * Converts `iterator` to an array.\n *\n * @private\n * @param {Object} iterator The iterator to convert.\n * @returns {Array} Returns the converted array.\n */\n function iteratorToArray(iterator) {\n var data,\n result = [];\n\n while (!(data = iterator.next()).done) {\n result.push(data.value);\n }\n return result;\n }\n\n /**\n * Converts `map` to its key-value pairs.\n *\n * @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n */\n function mapToArray(map) {\n var index = -1,\n result = Array(map.size);\n\n map.forEach(function(value, key) {\n result[++index] = [key, value];\n });\n return result;\n }\n\n /**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\n function overArg(func, transform) {\n return function(arg) {\n return func(transform(arg));\n };\n }\n\n /**\n * Replaces all `placeholder` elements in `array` with an internal placeholder\n * and returns an array of their indexes.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {*} placeholder The placeholder to replace.\n * @returns {Array} Returns the new array of placeholder indexes.\n */\n function replaceHolders(array, placeholder) {\n var index = -1,\n length = array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (value === placeholder || value === PLACEHOLDER) {\n array[index] = PLACEHOLDER;\n result[resIndex++] = index;\n }\n }\n return result;\n }\n\n /**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\n function setToArray(set) {\n var index = -1,\n result = Array(set.size);\n\n set.forEach(function(value) {\n result[++index] = value;\n });\n return result;\n }\n\n /**\n * Converts `set` to its value-value pairs.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the value-value pairs.\n */\n function setToPairs(set) {\n var index = -1,\n result = Array(set.size);\n\n set.forEach(function(value) {\n result[++index] = [value, value];\n });\n return result;\n }\n\n /**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function strictIndexOf(array, value, fromIndex) {\n var index = fromIndex - 1,\n length = array.length;\n\n while (++index < length) {\n if (array[index] === value) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * A specialized version of `_.lastIndexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function strictLastIndexOf(array, value, fromIndex) {\n var index = fromIndex + 1;\n while (index--) {\n if (array[index] === value) {\n return index;\n }\n }\n return index;\n }\n\n /**\n * Gets the number of symbols in `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the string size.\n */\n function stringSize(string) {\n return hasUnicode(string)\n ? unicodeSize(string)\n : asciiSize(string);\n }\n\n /**\n * Converts `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function stringToArray(string) {\n return hasUnicode(string)\n ? unicodeToArray(string)\n : asciiToArray(string);\n }\n\n /**\n * Used by `_.unescape` to convert HTML entities to characters.\n *\n * @private\n * @param {string} chr The matched character to unescape.\n * @returns {string} Returns the unescaped character.\n */\n var unescapeHtmlChar = basePropertyOf(htmlUnescapes);\n\n /**\n * Gets the size of a Unicode `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\n function unicodeSize(string) {\n var result = reUnicode.lastIndex = 0;\n while (reUnicode.test(string)) {\n ++result;\n }\n return result;\n }\n\n /**\n * Converts a Unicode `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function unicodeToArray(string) {\n return string.match(reUnicode) || [];\n }\n\n /**\n * Splits a Unicode `string` into an array of its words.\n *\n * @private\n * @param {string} The string to inspect.\n * @returns {Array} Returns the words of `string`.\n */\n function unicodeWords(string) {\n return string.match(reUnicodeWord) || [];\n }\n\n /*--------------------------------------------------------------------------*/\n\n /**\n * Create a new pristine `lodash` function using the `context` object.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Util\n * @param {Object} [context=root] The context object.\n * @returns {Function} Returns a new `lodash` function.\n * @example\n *\n * _.mixin({ 'foo': _.constant('foo') });\n *\n * var lodash = _.runInContext();\n * lodash.mixin({ 'bar': lodash.constant('bar') });\n *\n * _.isFunction(_.foo);\n * // => true\n * _.isFunction(_.bar);\n * // => false\n *\n * lodash.isFunction(lodash.foo);\n * // => false\n * lodash.isFunction(lodash.bar);\n * // => true\n *\n * // Create a suped-up `defer` in Node.js.\n * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;\n */\n var runInContext = (function runInContext(context) {\n context = context == null ? root : _.defaults(root.Object(), context, _.pick(root, contextProps));\n\n /** Built-in constructor references. */\n var Array = context.Array,\n Date = context.Date,\n Error = context.Error,\n Function = context.Function,\n Math = context.Math,\n Object = context.Object,\n RegExp = context.RegExp,\n String = context.String,\n TypeError = context.TypeError;\n\n /** Used for built-in method references. */\n var arrayProto = Array.prototype,\n funcProto = Function.prototype,\n objectProto = Object.prototype;\n\n /** Used to detect overreaching core-js shims. */\n var coreJsData = context['__core-js_shared__'];\n\n /** Used to resolve the decompiled source of functions. */\n var funcToString = funcProto.toString;\n\n /** Used to check objects for own properties. */\n var hasOwnProperty = objectProto.hasOwnProperty;\n\n /** Used to generate unique IDs. */\n var idCounter = 0;\n\n /** Used to detect methods masquerading as native. */\n var maskSrcKey = (function() {\n var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n return uid ? ('Symbol(src)_1.' + uid) : '';\n }());\n\n /**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\n var nativeObjectToString = objectProto.toString;\n\n /** Used to infer the `Object` constructor. */\n var objectCtorString = funcToString.call(Object);\n\n /** Used to restore the original `_` reference in `_.noConflict`. */\n var oldDash = root._;\n\n /** Used to detect if a method is native. */\n var reIsNative = RegExp('^' +\n funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n );\n\n /** Built-in value references. */\n var Buffer = moduleExports ? context.Buffer : undefined,\n Symbol = context.Symbol,\n Uint8Array = context.Uint8Array,\n allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined,\n getPrototype = overArg(Object.getPrototypeOf, Object),\n objectCreate = Object.create,\n propertyIsEnumerable = objectProto.propertyIsEnumerable,\n splice = arrayProto.splice,\n spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined,\n symIterator = Symbol ? Symbol.iterator : undefined,\n symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n var defineProperty = (function() {\n try {\n var func = getNative(Object, 'defineProperty');\n func({}, '', {});\n return func;\n } catch (e) {}\n }());\n\n /** Mocked built-ins. */\n var ctxClearTimeout = context.clearTimeout !== root.clearTimeout && context.clearTimeout,\n ctxNow = Date && Date.now !== root.Date.now && Date.now,\n ctxSetTimeout = context.setTimeout !== root.setTimeout && context.setTimeout;\n\n /* Built-in method references for those with the same name as other `lodash` methods. */\n var nativeCeil = Math.ceil,\n nativeFloor = Math.floor,\n nativeGetSymbols = Object.getOwnPropertySymbols,\n nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n nativeIsFinite = context.isFinite,\n nativeJoin = arrayProto.join,\n nativeKeys = overArg(Object.keys, Object),\n nativeMax = Math.max,\n nativeMin = Math.min,\n nativeNow = Date.now,\n nativeParseInt = context.parseInt,\n nativeRandom = Math.random,\n nativeReverse = arrayProto.reverse;\n\n /* Built-in method references that are verified to be native. */\n var DataView = getNative(context, 'DataView'),\n Map = getNative(context, 'Map'),\n Promise = getNative(context, 'Promise'),\n Set = getNative(context, 'Set'),\n WeakMap = getNative(context, 'WeakMap'),\n nativeCreate = getNative(Object, 'create');\n\n /** Used to store function metadata. */\n var metaMap = WeakMap && new WeakMap;\n\n /** Used to lookup unminified function names. */\n var realNames = {};\n\n /** Used to detect maps, sets, and weakmaps. */\n var dataViewCtorString = toSource(DataView),\n mapCtorString = toSource(Map),\n promiseCtorString = toSource(Promise),\n setCtorString = toSource(Set),\n weakMapCtorString = toSource(WeakMap);\n\n /** Used to convert symbols to primitives and strings. */\n var symbolProto = Symbol ? Symbol.prototype : undefined,\n symbolValueOf = symbolProto ? symbolProto.valueOf : undefined,\n symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a `lodash` object which wraps `value` to enable implicit method\n * chain sequences. Methods that operate on and return arrays, collections,\n * and functions can be chained together. Methods that retrieve a single value\n * or may return a primitive value will automatically end the chain sequence\n * and return the unwrapped value. Otherwise, the value must be unwrapped\n * with `_#value`.\n *\n * Explicit chain sequences, which must be unwrapped with `_#value`, may be\n * enabled using `_.chain`.\n *\n * The execution of chained methods is lazy, that is, it's deferred until\n * `_#value` is implicitly or explicitly called.\n *\n * Lazy evaluation allows several methods to support shortcut fusion.\n * Shortcut fusion is an optimization to merge iteratee calls; this avoids\n * the creation of intermediate arrays and can greatly reduce the number of\n * iteratee executions. Sections of a chain sequence qualify for shortcut\n * fusion if the section is applied to an array and iteratees accept only\n * one argument. The heuristic for whether a section qualifies for shortcut\n * fusion is subject to change.\n *\n * Chaining is supported in custom builds as long as the `_#value` method is\n * directly or indirectly included in the build.\n *\n * In addition to lodash methods, wrappers have `Array` and `String` methods.\n *\n * The wrapper `Array` methods are:\n * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift`\n *\n * The wrapper `String` methods are:\n * `replace` and `split`\n *\n * The wrapper methods that support shortcut fusion are:\n * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`,\n * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`,\n * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray`\n *\n * The chainable wrapper methods are:\n * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`,\n * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`,\n * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`,\n * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`,\n * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`,\n * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`,\n * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`,\n * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`,\n * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`,\n * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`,\n * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`,\n * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`,\n * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`,\n * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`,\n * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`,\n * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`,\n * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`,\n * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`,\n * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`,\n * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`,\n * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`,\n * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`,\n * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`,\n * `zipObject`, `zipObjectDeep`, and `zipWith`\n *\n * The wrapper methods that are **not** chainable by default are:\n * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`,\n * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `conformsTo`, `deburr`,\n * `defaultTo`, `divide`, `each`, `eachRight`, `endsWith`, `eq`, `escape`,\n * `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, `findLast`,\n * `findLastIndex`, `findLastKey`, `first`, `floor`, `forEach`, `forEachRight`,\n * `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `get`, `gt`, `gte`, `has`,\n * `hasIn`, `head`, `identity`, `includes`, `indexOf`, `inRange`, `invoke`,\n * `isArguments`, `isArray`, `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`,\n * `isBoolean`, `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`,\n * `isEqualWith`, `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`,\n * `isMap`, `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`,\n * `isNumber`, `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`,\n * `isSafeInteger`, `isSet`, `isString`, `isUndefined`, `isTypedArray`,\n * `isWeakMap`, `isWeakSet`, `join`, `kebabCase`, `last`, `lastIndexOf`,\n * `lowerCase`, `lowerFirst`, `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`,\n * `min`, `minBy`, `multiply`, `noConflict`, `noop`, `now`, `nth`, `pad`,\n * `padEnd`, `padStart`, `parseInt`, `pop`, `random`, `reduce`, `reduceRight`,\n * `repeat`, `result`, `round`, `runInContext`, `sample`, `shift`, `size`,\n * `snakeCase`, `some`, `sortedIndex`, `sortedIndexBy`, `sortedLastIndex`,\n * `sortedLastIndexBy`, `startCase`, `startsWith`, `stubArray`, `stubFalse`,\n * `stubObject`, `stubString`, `stubTrue`, `subtract`, `sum`, `sumBy`,\n * `template`, `times`, `toFinite`, `toInteger`, `toJSON`, `toLength`,\n * `toLower`, `toNumber`, `toSafeInteger`, `toString`, `toUpper`, `trim`,\n * `trimEnd`, `trimStart`, `truncate`, `unescape`, `uniqueId`, `upperCase`,\n * `upperFirst`, `value`, and `words`\n *\n * @name _\n * @constructor\n * @category Seq\n * @param {*} value The value to wrap in a `lodash` instance.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var wrapped = _([1, 2, 3]);\n *\n * // Returns an unwrapped value.\n * wrapped.reduce(_.add);\n * // => 6\n *\n * // Returns a wrapped value.\n * var squares = wrapped.map(square);\n *\n * _.isArray(squares);\n * // => false\n *\n * _.isArray(squares.value());\n * // => true\n */\n function lodash(value) {\n if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {\n if (value instanceof LodashWrapper) {\n return value;\n }\n if (hasOwnProperty.call(value, '__wrapped__')) {\n return wrapperClone(value);\n }\n }\n return new LodashWrapper(value);\n }\n\n /**\n * The base implementation of `_.create` without support for assigning\n * properties to the created object.\n *\n * @private\n * @param {Object} proto The object to inherit from.\n * @returns {Object} Returns the new object.\n */\n var baseCreate = (function() {\n function object() {}\n return function(proto) {\n if (!isObject(proto)) {\n return {};\n }\n if (objectCreate) {\n return objectCreate(proto);\n }\n object.prototype = proto;\n var result = new object;\n object.prototype = undefined;\n return result;\n };\n }());\n\n /**\n * The function whose prototype chain sequence wrappers inherit from.\n *\n * @private\n */\n function baseLodash() {\n // No operation performed.\n }\n\n /**\n * The base constructor for creating `lodash` wrapper objects.\n *\n * @private\n * @param {*} value The value to wrap.\n * @param {boolean} [chainAll] Enable explicit method chain sequences.\n */\n function LodashWrapper(value, chainAll) {\n this.__wrapped__ = value;\n this.__actions__ = [];\n this.__chain__ = !!chainAll;\n this.__index__ = 0;\n this.__values__ = undefined;\n }\n\n /**\n * By default, the template delimiters used by lodash are like those in\n * embedded Ruby (ERB) as well as ES2015 template strings. Change the\n * following template settings to use alternative delimiters.\n *\n * @static\n * @memberOf _\n * @type {Object}\n */\n lodash.templateSettings = {\n\n /**\n * Used to detect `data` property values to be HTML-escaped.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'escape': reEscape,\n\n /**\n * Used to detect code to be evaluated.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'evaluate': reEvaluate,\n\n /**\n * Used to detect `data` property values to inject.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'interpolate': reInterpolate,\n\n /**\n * Used to reference the data object in the template text.\n *\n * @memberOf _.templateSettings\n * @type {string}\n */\n 'variable': '',\n\n /**\n * Used to import variables into the compiled template.\n *\n * @memberOf _.templateSettings\n * @type {Object}\n */\n 'imports': {\n\n /**\n * A reference to the `lodash` function.\n *\n * @memberOf _.templateSettings.imports\n * @type {Function}\n */\n '_': lodash\n }\n };\n\n // Ensure wrappers are instances of `baseLodash`.\n lodash.prototype = baseLodash.prototype;\n lodash.prototype.constructor = lodash;\n\n LodashWrapper.prototype = baseCreate(baseLodash.prototype);\n LodashWrapper.prototype.constructor = LodashWrapper;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.\n *\n * @private\n * @constructor\n * @param {*} value The value to wrap.\n */\n function LazyWrapper(value) {\n this.__wrapped__ = value;\n this.__actions__ = [];\n this.__dir__ = 1;\n this.__filtered__ = false;\n this.__iteratees__ = [];\n this.__takeCount__ = MAX_ARRAY_LENGTH;\n this.__views__ = [];\n }\n\n /**\n * Creates a clone of the lazy wrapper object.\n *\n * @private\n * @name clone\n * @memberOf LazyWrapper\n * @returns {Object} Returns the cloned `LazyWrapper` object.\n */\n function lazyClone() {\n var result = new LazyWrapper(this.__wrapped__);\n result.__actions__ = copyArray(this.__actions__);\n result.__dir__ = this.__dir__;\n result.__filtered__ = this.__filtered__;\n result.__iteratees__ = copyArray(this.__iteratees__);\n result.__takeCount__ = this.__takeCount__;\n result.__views__ = copyArray(this.__views__);\n return result;\n }\n\n /**\n * Reverses the direction of lazy iteration.\n *\n * @private\n * @name reverse\n * @memberOf LazyWrapper\n * @returns {Object} Returns the new reversed `LazyWrapper` object.\n */\n function lazyReverse() {\n if (this.__filtered__) {\n var result = new LazyWrapper(this);\n result.__dir__ = -1;\n result.__filtered__ = true;\n } else {\n result = this.clone();\n result.__dir__ *= -1;\n }\n return result;\n }\n\n /**\n * Extracts the unwrapped value from its lazy wrapper.\n *\n * @private\n * @name value\n * @memberOf LazyWrapper\n * @returns {*} Returns the unwrapped value.\n */\n function lazyValue() {\n var array = this.__wrapped__.value(),\n dir = this.__dir__,\n isArr = isArray(array),\n isRight = dir < 0,\n arrLength = isArr ? array.length : 0,\n view = getView(0, arrLength, this.__views__),\n start = view.start,\n end = view.end,\n length = end - start,\n index = isRight ? end : (start - 1),\n iteratees = this.__iteratees__,\n iterLength = iteratees.length,\n resIndex = 0,\n takeCount = nativeMin(length, this.__takeCount__);\n\n if (!isArr || (!isRight && arrLength == length && takeCount == length)) {\n return baseWrapperValue(array, this.__actions__);\n }\n var result = [];\n\n outer:\n while (length-- && resIndex < takeCount) {\n index += dir;\n\n var iterIndex = -1,\n value = array[index];\n\n while (++iterIndex < iterLength) {\n var data = iteratees[iterIndex],\n iteratee = data.iteratee,\n type = data.type,\n computed = iteratee(value);\n\n if (type == LAZY_MAP_FLAG) {\n value = computed;\n } else if (!computed) {\n if (type == LAZY_FILTER_FLAG) {\n continue outer;\n } else {\n break outer;\n }\n }\n }\n result[resIndex++] = value;\n }\n return result;\n }\n\n // Ensure `LazyWrapper` is an instance of `baseLodash`.\n LazyWrapper.prototype = baseCreate(baseLodash.prototype);\n LazyWrapper.prototype.constructor = LazyWrapper;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function Hash(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\n function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function hashDelete(key) {\n var result = this.has(key) && delete this.__data__[key];\n this.size -= result ? 1 : 0;\n return result;\n }\n\n /**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function hashGet(key) {\n var data = this.__data__;\n if (nativeCreate) {\n var result = data[key];\n return result === HASH_UNDEFINED ? undefined : result;\n }\n return hasOwnProperty.call(data, key) ? data[key] : undefined;\n }\n\n /**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function hashHas(key) {\n var data = this.__data__;\n return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n }\n\n /**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\n function hashSet(key, value) {\n var data = this.__data__;\n this.size += this.has(key) ? 0 : 1;\n data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n return this;\n }\n\n // Add methods to `Hash`.\n Hash.prototype.clear = hashClear;\n Hash.prototype['delete'] = hashDelete;\n Hash.prototype.get = hashGet;\n Hash.prototype.has = hashHas;\n Hash.prototype.set = hashSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function ListCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\n function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function listCacheDelete(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n return false;\n }\n var lastIndex = data.length - 1;\n if (index == lastIndex) {\n data.pop();\n } else {\n splice.call(data, index, 1);\n }\n --this.size;\n return true;\n }\n\n /**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function listCacheGet(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n return index < 0 ? undefined : data[index][1];\n }\n\n /**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function listCacheHas(key) {\n return assocIndexOf(this.__data__, key) > -1;\n }\n\n /**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\n function listCacheSet(key, value) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n ++this.size;\n data.push([key, value]);\n } else {\n data[index][1] = value;\n }\n return this;\n }\n\n // Add methods to `ListCache`.\n ListCache.prototype.clear = listCacheClear;\n ListCache.prototype['delete'] = listCacheDelete;\n ListCache.prototype.get = listCacheGet;\n ListCache.prototype.has = listCacheHas;\n ListCache.prototype.set = listCacheSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function MapCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\n function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map || ListCache),\n 'string': new Hash\n };\n }\n\n /**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function mapCacheDelete(key) {\n var result = getMapData(this, key)['delete'](key);\n this.size -= result ? 1 : 0;\n return result;\n }\n\n /**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function mapCacheGet(key) {\n return getMapData(this, key).get(key);\n }\n\n /**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function mapCacheHas(key) {\n return getMapData(this, key).has(key);\n }\n\n /**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\n function mapCacheSet(key, value) {\n var data = getMapData(this, key),\n size = data.size;\n\n data.set(key, value);\n this.size += data.size == size ? 0 : 1;\n return this;\n }\n\n // Add methods to `MapCache`.\n MapCache.prototype.clear = mapCacheClear;\n MapCache.prototype['delete'] = mapCacheDelete;\n MapCache.prototype.get = mapCacheGet;\n MapCache.prototype.has = mapCacheHas;\n MapCache.prototype.set = mapCacheSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\n function SetCache(values) {\n var index = -1,\n length = values == null ? 0 : values.length;\n\n this.__data__ = new MapCache;\n while (++index < length) {\n this.add(values[index]);\n }\n }\n\n /**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\n function setCacheAdd(value) {\n this.__data__.set(value, HASH_UNDEFINED);\n return this;\n }\n\n /**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\n function setCacheHas(value) {\n return this.__data__.has(value);\n }\n\n // Add methods to `SetCache`.\n SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\n SetCache.prototype.has = setCacheHas;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function Stack(entries) {\n var data = this.__data__ = new ListCache(entries);\n this.size = data.size;\n }\n\n /**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\n function stackClear() {\n this.__data__ = new ListCache;\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function stackDelete(key) {\n var data = this.__data__,\n result = data['delete'](key);\n\n this.size = data.size;\n return result;\n }\n\n /**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function stackGet(key) {\n return this.__data__.get(key);\n }\n\n /**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function stackHas(key) {\n return this.__data__.has(key);\n }\n\n /**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\n function stackSet(key, value) {\n var data = this.__data__;\n if (data instanceof ListCache) {\n var pairs = data.__data__;\n if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n pairs.push([key, value]);\n this.size = ++data.size;\n return this;\n }\n data = this.__data__ = new MapCache(pairs);\n }\n data.set(key, value);\n this.size = data.size;\n return this;\n }\n\n // Add methods to `Stack`.\n Stack.prototype.clear = stackClear;\n Stack.prototype['delete'] = stackDelete;\n Stack.prototype.get = stackGet;\n Stack.prototype.has = stackHas;\n Stack.prototype.set = stackSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\n function arrayLikeKeys(value, inherited) {\n var isArr = isArray(value),\n isArg = !isArr && isArguments(value),\n isBuff = !isArr && !isArg && isBuffer(value),\n isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n skipIndexes = isArr || isArg || isBuff || isType,\n result = skipIndexes ? baseTimes(value.length, String) : [],\n length = result.length;\n\n for (var key in value) {\n if ((inherited || hasOwnProperty.call(value, key)) &&\n !(skipIndexes && (\n // Safari 9 has enumerable `arguments.length` in strict mode.\n key == 'length' ||\n // Node.js 0.10 has enumerable non-index properties on buffers.\n (isBuff && (key == 'offset' || key == 'parent')) ||\n // PhantomJS 2 has enumerable non-index properties on typed arrays.\n (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n // Skip index properties.\n isIndex(key, length)\n ))) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `_.sample` for arrays.\n *\n * @private\n * @param {Array} array The array to sample.\n * @returns {*} Returns the random element.\n */\n function arraySample(array) {\n var length = array.length;\n return length ? array[baseRandom(0, length - 1)] : undefined;\n }\n\n /**\n * A specialized version of `_.sampleSize` for arrays.\n *\n * @private\n * @param {Array} array The array to sample.\n * @param {number} n The number of elements to sample.\n * @returns {Array} Returns the random elements.\n */\n function arraySampleSize(array, n) {\n return shuffleSelf(copyArray(array), baseClamp(n, 0, array.length));\n }\n\n /**\n * A specialized version of `_.shuffle` for arrays.\n *\n * @private\n * @param {Array} array The array to shuffle.\n * @returns {Array} Returns the new shuffled array.\n */\n function arrayShuffle(array) {\n return shuffleSelf(copyArray(array));\n }\n\n /**\n * This function is like `assignValue` except that it doesn't assign\n * `undefined` values.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function assignMergeValue(object, key, value) {\n if ((value !== undefined && !eq(object[key], value)) ||\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n }\n\n /**\n * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function assignValue(object, key, value) {\n var objValue = object[key];\n if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n }\n\n /**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function assocIndexOf(array, key) {\n var length = array.length;\n while (length--) {\n if (eq(array[length][0], key)) {\n return length;\n }\n }\n return -1;\n }\n\n /**\n * Aggregates elements of `collection` on `accumulator` with keys transformed\n * by `iteratee` and values set by `setter`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform keys.\n * @param {Object} accumulator The initial aggregated object.\n * @returns {Function} Returns `accumulator`.\n */\n function baseAggregator(collection, setter, iteratee, accumulator) {\n baseEach(collection, function(value, key, collection) {\n setter(accumulator, value, iteratee(value), collection);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.assign` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\n function baseAssign(object, source) {\n return object && copyObject(source, keys(source), object);\n }\n\n /**\n * The base implementation of `_.assignIn` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\n function baseAssignIn(object, source) {\n return object && copyObject(source, keysIn(source), object);\n }\n\n /**\n * The base implementation of `assignValue` and `assignMergeValue` without\n * value checks.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function baseAssignValue(object, key, value) {\n if (key == '__proto__' && defineProperty) {\n defineProperty(object, key, {\n 'configurable': true,\n 'enumerable': true,\n 'value': value,\n 'writable': true\n });\n } else {\n object[key] = value;\n }\n }\n\n /**\n * The base implementation of `_.at` without support for individual paths.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {string[]} paths The property paths to pick.\n * @returns {Array} Returns the picked elements.\n */\n function baseAt(object, paths) {\n var index = -1,\n length = paths.length,\n result = Array(length),\n skip = object == null;\n\n while (++index < length) {\n result[index] = skip ? undefined : get(object, paths[index]);\n }\n return result;\n }\n\n /**\n * The base implementation of `_.clamp` which doesn't coerce arguments.\n *\n * @private\n * @param {number} number The number to clamp.\n * @param {number} [lower] The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the clamped number.\n */\n function baseClamp(number, lower, upper) {\n if (number === number) {\n if (upper !== undefined) {\n number = number <= upper ? number : upper;\n }\n if (lower !== undefined) {\n number = number >= lower ? number : lower;\n }\n }\n return number;\n }\n\n /**\n * The base implementation of `_.clone` and `_.cloneDeep` which tracks\n * traversed objects.\n *\n * @private\n * @param {*} value The value to clone.\n * @param {boolean} bitmask The bitmask flags.\n * 1 - Deep clone\n * 2 - Flatten inherited properties\n * 4 - Clone symbols\n * @param {Function} [customizer] The function to customize cloning.\n * @param {string} [key] The key of `value`.\n * @param {Object} [object] The parent object of `value`.\n * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n * @returns {*} Returns the cloned value.\n */\n function baseClone(value, bitmask, customizer, key, object, stack) {\n var result,\n isDeep = bitmask & CLONE_DEEP_FLAG,\n isFlat = bitmask & CLONE_FLAT_FLAG,\n isFull = bitmask & CLONE_SYMBOLS_FLAG;\n\n if (customizer) {\n result = object ? customizer(value, key, object, stack) : customizer(value);\n }\n if (result !== undefined) {\n return result;\n }\n if (!isObject(value)) {\n return value;\n }\n var isArr = isArray(value);\n if (isArr) {\n result = initCloneArray(value);\n if (!isDeep) {\n return copyArray(value, result);\n }\n } else {\n var tag = getTag(value),\n isFunc = tag == funcTag || tag == genTag;\n\n if (isBuffer(value)) {\n return cloneBuffer(value, isDeep);\n }\n if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\n result = (isFlat || isFunc) ? {} : initCloneObject(value);\n if (!isDeep) {\n return isFlat\n ? copySymbolsIn(value, baseAssignIn(result, value))\n : copySymbols(value, baseAssign(result, value));\n }\n } else {\n if (!cloneableTags[tag]) {\n return object ? value : {};\n }\n result = initCloneByTag(value, tag, isDeep);\n }\n }\n // Check for circular references and return its corresponding clone.\n stack || (stack = new Stack);\n var stacked = stack.get(value);\n if (stacked) {\n return stacked;\n }\n stack.set(value, result);\n\n if (isSet(value)) {\n value.forEach(function(subValue) {\n result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));\n });\n } else if (isMap(value)) {\n value.forEach(function(subValue, key) {\n result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\n });\n }\n\n var keysFunc = isFull\n ? (isFlat ? getAllKeysIn : getAllKeys)\n : (isFlat ? keysIn : keys);\n\n var props = isArr ? undefined : keysFunc(value);\n arrayEach(props || value, function(subValue, key) {\n if (props) {\n key = subValue;\n subValue = value[key];\n }\n // Recursively populate clone (susceptible to call stack limits).\n assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));\n });\n return result;\n }\n\n /**\n * The base implementation of `_.conforms` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property predicates to conform to.\n * @returns {Function} Returns the new spec function.\n */\n function baseConforms(source) {\n var props = keys(source);\n return function(object) {\n return baseConformsTo(object, source, props);\n };\n }\n\n /**\n * The base implementation of `_.conformsTo` which accepts `props` to check.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property predicates to conform to.\n * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n */\n function baseConformsTo(object, source, props) {\n var length = props.length;\n if (object == null) {\n return !length;\n }\n object = Object(object);\n while (length--) {\n var key = props[length],\n predicate = source[key],\n value = object[key];\n\n if ((value === undefined && !(key in object)) || !predicate(value)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * The base implementation of `_.delay` and `_.defer` which accepts `args`\n * to provide to `func`.\n *\n * @private\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @param {Array} args The arguments to provide to `func`.\n * @returns {number|Object} Returns the timer id or timeout object.\n */\n function baseDelay(func, wait, args) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n return setTimeout(function() { func.apply(undefined, args); }, wait);\n }\n\n /**\n * The base implementation of methods like `_.difference` without support\n * for excluding multiple arrays or iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Array} values The values to exclude.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n */\n function baseDifference(array, values, iteratee, comparator) {\n var index = -1,\n includes = arrayIncludes,\n isCommon = true,\n length = array.length,\n result = [],\n valuesLength = values.length;\n\n if (!length) {\n return result;\n }\n if (iteratee) {\n values = arrayMap(values, baseUnary(iteratee));\n }\n if (comparator) {\n includes = arrayIncludesWith;\n isCommon = false;\n }\n else if (values.length >= LARGE_ARRAY_SIZE) {\n includes = cacheHas;\n isCommon = false;\n values = new SetCache(values);\n }\n outer:\n while (++index < length) {\n var value = array[index],\n computed = iteratee == null ? value : iteratee(value);\n\n value = (comparator || value !== 0) ? value : 0;\n if (isCommon && computed === computed) {\n var valuesIndex = valuesLength;\n while (valuesIndex--) {\n if (values[valuesIndex] === computed) {\n continue outer;\n }\n }\n result.push(value);\n }\n else if (!includes(values, computed, comparator)) {\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.forEach` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\n var baseEach = createBaseEach(baseForOwn);\n\n /**\n * The base implementation of `_.forEachRight` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\n var baseEachRight = createBaseEach(baseForOwnRight, true);\n\n /**\n * The base implementation of `_.every` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`\n */\n function baseEvery(collection, predicate) {\n var result = true;\n baseEach(collection, function(value, index, collection) {\n result = !!predicate(value, index, collection);\n return result;\n });\n return result;\n }\n\n /**\n * The base implementation of methods like `_.max` and `_.min` which accepts a\n * `comparator` to determine the extremum value.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The iteratee invoked per iteration.\n * @param {Function} comparator The comparator used to compare values.\n * @returns {*} Returns the extremum value.\n */\n function baseExtremum(array, iteratee, comparator) {\n var index = -1,\n length = array.length;\n\n while (++index < length) {\n var value = array[index],\n current = iteratee(value);\n\n if (current != null && (computed === undefined\n ? (current === current && !isSymbol(current))\n : comparator(current, computed)\n )) {\n var computed = current,\n result = value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.fill` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to fill.\n * @param {*} value The value to fill `array` with.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns `array`.\n */\n function baseFill(array, value, start, end) {\n var length = array.length;\n\n start = toInteger(start);\n if (start < 0) {\n start = -start > length ? 0 : (length + start);\n }\n end = (end === undefined || end > length) ? length : toInteger(end);\n if (end < 0) {\n end += length;\n }\n end = start > end ? 0 : toLength(end);\n while (start < end) {\n array[start++] = value;\n }\n return array;\n }\n\n /**\n * The base implementation of `_.filter` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\n function baseFilter(collection, predicate) {\n var result = [];\n baseEach(collection, function(value, index, collection) {\n if (predicate(value, index, collection)) {\n result.push(value);\n }\n });\n return result;\n }\n\n /**\n * The base implementation of `_.flatten` with support for restricting flattening.\n *\n * @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n */\n function baseFlatten(array, depth, predicate, isStrict, result) {\n var index = -1,\n length = array.length;\n\n predicate || (predicate = isFlattenable);\n result || (result = []);\n\n while (++index < length) {\n var value = array[index];\n if (depth > 0 && predicate(value)) {\n if (depth > 1) {\n // Recursively flatten arrays (susceptible to call stack limits).\n baseFlatten(value, depth - 1, predicate, isStrict, result);\n } else {\n arrayPush(result, value);\n }\n } else if (!isStrict) {\n result[result.length] = value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\n var baseFor = createBaseFor();\n\n /**\n * This function is like `baseFor` except that it iterates over properties\n * in the opposite order.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\n var baseForRight = createBaseFor(true);\n\n /**\n * The base implementation of `_.forOwn` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\n function baseForOwn(object, iteratee) {\n return object && baseFor(object, iteratee, keys);\n }\n\n /**\n * The base implementation of `_.forOwnRight` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\n function baseForOwnRight(object, iteratee) {\n return object && baseForRight(object, iteratee, keys);\n }\n\n /**\n * The base implementation of `_.functions` which creates an array of\n * `object` function property names filtered from `props`.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Array} props The property names to filter.\n * @returns {Array} Returns the function names.\n */\n function baseFunctions(object, props) {\n return arrayFilter(props, function(key) {\n return isFunction(object[key]);\n });\n }\n\n /**\n * The base implementation of `_.get` without support for default values.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @returns {*} Returns the resolved value.\n */\n function baseGet(object, path) {\n path = castPath(path, object);\n\n var index = 0,\n length = path.length;\n\n while (object != null && index < length) {\n object = object[toKey(path[index++])];\n }\n return (index && index == length) ? object : undefined;\n }\n\n /**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function baseGetAllKeys(object, keysFunc, symbolsFunc) {\n var result = keysFunc(object);\n return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n }\n\n /**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\n function baseGetTag(value) {\n if (value == null) {\n return value === undefined ? undefinedTag : nullTag;\n }\n return (symToStringTag && symToStringTag in Object(value))\n ? getRawTag(value)\n : objectToString(value);\n }\n\n /**\n * The base implementation of `_.gt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than `other`,\n * else `false`.\n */\n function baseGt(value, other) {\n return value > other;\n }\n\n /**\n * The base implementation of `_.has` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\n function baseHas(object, key) {\n return object != null && hasOwnProperty.call(object, key);\n }\n\n /**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\n function baseHasIn(object, key) {\n return object != null && key in Object(object);\n }\n\n /**\n * The base implementation of `_.inRange` which doesn't coerce arguments.\n *\n * @private\n * @param {number} number The number to check.\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n */\n function baseInRange(number, start, end) {\n return number >= nativeMin(start, end) && number < nativeMax(start, end);\n }\n\n /**\n * The base implementation of methods like `_.intersection`, without support\n * for iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of shared values.\n */\n function baseIntersection(arrays, iteratee, comparator) {\n var includes = comparator ? arrayIncludesWith : arrayIncludes,\n length = arrays[0].length,\n othLength = arrays.length,\n othIndex = othLength,\n caches = Array(othLength),\n maxLength = Infinity,\n result = [];\n\n while (othIndex--) {\n var array = arrays[othIndex];\n if (othIndex && iteratee) {\n array = arrayMap(array, baseUnary(iteratee));\n }\n maxLength = nativeMin(array.length, maxLength);\n caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))\n ? new SetCache(othIndex && array)\n : undefined;\n }\n array = arrays[0];\n\n var index = -1,\n seen = caches[0];\n\n outer:\n while (++index < length && result.length < maxLength) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n value = (comparator || value !== 0) ? value : 0;\n if (!(seen\n ? cacheHas(seen, computed)\n : includes(result, computed, comparator)\n )) {\n othIndex = othLength;\n while (--othIndex) {\n var cache = caches[othIndex];\n if (!(cache\n ? cacheHas(cache, computed)\n : includes(arrays[othIndex], computed, comparator))\n ) {\n continue outer;\n }\n }\n if (seen) {\n seen.push(computed);\n }\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.invert` and `_.invertBy` which inverts\n * `object` with values transformed by `iteratee` and set by `setter`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform values.\n * @param {Object} accumulator The initial inverted object.\n * @returns {Function} Returns `accumulator`.\n */\n function baseInverter(object, setter, iteratee, accumulator) {\n baseForOwn(object, function(value, key, object) {\n setter(accumulator, iteratee(value), key, object);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.invoke` without support for individual\n * method arguments.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the method to invoke.\n * @param {Array} args The arguments to invoke the method with.\n * @returns {*} Returns the result of the invoked method.\n */\n function baseInvoke(object, path, args) {\n path = castPath(path, object);\n object = parent(object, path);\n var func = object == null ? object : object[toKey(last(path))];\n return func == null ? undefined : apply(func, object, args);\n }\n\n /**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\n function baseIsArguments(value) {\n return isObjectLike(value) && baseGetTag(value) == argsTag;\n }\n\n /**\n * The base implementation of `_.isArrayBuffer` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n */\n function baseIsArrayBuffer(value) {\n return isObjectLike(value) && baseGetTag(value) == arrayBufferTag;\n }\n\n /**\n * The base implementation of `_.isDate` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n */\n function baseIsDate(value) {\n return isObjectLike(value) && baseGetTag(value) == dateTag;\n }\n\n /**\n * The base implementation of `_.isEqual` which supports partial comparisons\n * and tracks traversed objects.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {boolean} bitmask The bitmask flags.\n * 1 - Unordered comparison\n * 2 - Partial comparison\n * @param {Function} [customizer] The function to customize comparisons.\n * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n */\n function baseIsEqual(value, other, bitmask, customizer, stack) {\n if (value === other) {\n return true;\n }\n if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n return value !== value && other !== other;\n }\n return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n }\n\n /**\n * A specialized version of `baseIsEqual` for arrays and objects which performs\n * deep comparisons and tracks traversed objects enabling objects with circular\n * references to be compared.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n var objIsArr = isArray(object),\n othIsArr = isArray(other),\n objTag = objIsArr ? arrayTag : getTag(object),\n othTag = othIsArr ? arrayTag : getTag(other);\n\n objTag = objTag == argsTag ? objectTag : objTag;\n othTag = othTag == argsTag ? objectTag : othTag;\n\n var objIsObj = objTag == objectTag,\n othIsObj = othTag == objectTag,\n isSameTag = objTag == othTag;\n\n if (isSameTag && isBuffer(object)) {\n if (!isBuffer(other)) {\n return false;\n }\n objIsArr = true;\n objIsObj = false;\n }\n if (isSameTag && !objIsObj) {\n stack || (stack = new Stack);\n return (objIsArr || isTypedArray(object))\n ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n }\n if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n if (objIsWrapped || othIsWrapped) {\n var objUnwrapped = objIsWrapped ? object.value() : object,\n othUnwrapped = othIsWrapped ? other.value() : other;\n\n stack || (stack = new Stack);\n return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n }\n }\n if (!isSameTag) {\n return false;\n }\n stack || (stack = new Stack);\n return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n }\n\n /**\n * The base implementation of `_.isMap` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n */\n function baseIsMap(value) {\n return isObjectLike(value) && getTag(value) == mapTag;\n }\n\n /**\n * The base implementation of `_.isMatch` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Array} matchData The property names, values, and compare flags to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n */\n function baseIsMatch(object, source, matchData, customizer) {\n var index = matchData.length,\n length = index,\n noCustomizer = !customizer;\n\n if (object == null) {\n return !length;\n }\n object = Object(object);\n while (index--) {\n var data = matchData[index];\n if ((noCustomizer && data[2])\n ? data[1] !== object[data[0]]\n : !(data[0] in object)\n ) {\n return false;\n }\n }\n while (++index < length) {\n data = matchData[index];\n var key = data[0],\n objValue = object[key],\n srcValue = data[1];\n\n if (noCustomizer && data[2]) {\n if (objValue === undefined && !(key in object)) {\n return false;\n }\n } else {\n var stack = new Stack;\n if (customizer) {\n var result = customizer(objValue, srcValue, key, object, source, stack);\n }\n if (!(result === undefined\n ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)\n : result\n )) {\n return false;\n }\n }\n }\n return true;\n }\n\n /**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n * else `false`.\n */\n function baseIsNative(value) {\n if (!isObject(value) || isMasked(value)) {\n return false;\n }\n var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n return pattern.test(toSource(value));\n }\n\n /**\n * The base implementation of `_.isRegExp` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n */\n function baseIsRegExp(value) {\n return isObjectLike(value) && baseGetTag(value) == regexpTag;\n }\n\n /**\n * The base implementation of `_.isSet` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n */\n function baseIsSet(value) {\n return isObjectLike(value) && getTag(value) == setTag;\n }\n\n /**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\n function baseIsTypedArray(value) {\n return isObjectLike(value) &&\n isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n }\n\n /**\n * The base implementation of `_.iteratee`.\n *\n * @private\n * @param {*} [value=_.identity] The value to convert to an iteratee.\n * @returns {Function} Returns the iteratee.\n */\n function baseIteratee(value) {\n // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n if (typeof value == 'function') {\n return value;\n }\n if (value == null) {\n return identity;\n }\n if (typeof value == 'object') {\n return isArray(value)\n ? baseMatchesProperty(value[0], value[1])\n : baseMatches(value);\n }\n return property(value);\n }\n\n /**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function baseKeys(object) {\n if (!isPrototype(object)) {\n return nativeKeys(object);\n }\n var result = [];\n for (var key in Object(object)) {\n if (hasOwnProperty.call(object, key) && key != 'constructor') {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function baseKeysIn(object) {\n if (!isObject(object)) {\n return nativeKeysIn(object);\n }\n var isProto = isPrototype(object),\n result = [];\n\n for (var key in object) {\n if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.lt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than `other`,\n * else `false`.\n */\n function baseLt(value, other) {\n return value < other;\n }\n\n /**\n * The base implementation of `_.map` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\n function baseMap(collection, iteratee) {\n var index = -1,\n result = isArrayLike(collection) ? Array(collection.length) : [];\n\n baseEach(collection, function(value, key, collection) {\n result[++index] = iteratee(value, key, collection);\n });\n return result;\n }\n\n /**\n * The base implementation of `_.matches` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property values to match.\n * @returns {Function} Returns the new spec function.\n */\n function baseMatches(source) {\n var matchData = getMatchData(source);\n if (matchData.length == 1 && matchData[0][2]) {\n return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n }\n return function(object) {\n return object === source || baseIsMatch(object, source, matchData);\n };\n }\n\n /**\n * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n *\n * @private\n * @param {string} path The path of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\n function baseMatchesProperty(path, srcValue) {\n if (isKey(path) && isStrictComparable(srcValue)) {\n return matchesStrictComparable(toKey(path), srcValue);\n }\n return function(object) {\n var objValue = get(object, path);\n return (objValue === undefined && objValue === srcValue)\n ? hasIn(object, path)\n : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);\n };\n }\n\n /**\n * The base implementation of `_.merge` without support for multiple sources.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} [customizer] The function to customize merged values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n */\n function baseMerge(object, source, srcIndex, customizer, stack) {\n if (object === source) {\n return;\n }\n baseFor(source, function(srcValue, key) {\n stack || (stack = new Stack);\n if (isObject(srcValue)) {\n baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n }\n else {\n var newValue = customizer\n ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\n : undefined;\n\n if (newValue === undefined) {\n newValue = srcValue;\n }\n assignMergeValue(object, key, newValue);\n }\n }, keysIn);\n }\n\n /**\n * A specialized version of `baseMerge` for arrays and objects which performs\n * deep merges and tracks traversed objects enabling objects with circular\n * references to be merged.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {string} key The key of the value to merge.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} mergeFunc The function to merge values.\n * @param {Function} [customizer] The function to customize assigned values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n */\n function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n var objValue = safeGet(object, key),\n srcValue = safeGet(source, key),\n stacked = stack.get(srcValue);\n\n if (stacked) {\n assignMergeValue(object, key, stacked);\n return;\n }\n var newValue = customizer\n ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n : undefined;\n\n var isCommon = newValue === undefined;\n\n if (isCommon) {\n var isArr = isArray(srcValue),\n isBuff = !isArr && isBuffer(srcValue),\n isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n newValue = srcValue;\n if (isArr || isBuff || isTyped) {\n if (isArray(objValue)) {\n newValue = objValue;\n }\n else if (isArrayLikeObject(objValue)) {\n newValue = copyArray(objValue);\n }\n else if (isBuff) {\n isCommon = false;\n newValue = cloneBuffer(srcValue, true);\n }\n else if (isTyped) {\n isCommon = false;\n newValue = cloneTypedArray(srcValue, true);\n }\n else {\n newValue = [];\n }\n }\n else if (isPlainObject(srcValue) || isArguments(srcValue)) {\n newValue = objValue;\n if (isArguments(objValue)) {\n newValue = toPlainObject(objValue);\n }\n else if (!isObject(objValue) || isFunction(objValue)) {\n newValue = initCloneObject(srcValue);\n }\n }\n else {\n isCommon = false;\n }\n }\n if (isCommon) {\n // Recursively merge objects and arrays (susceptible to call stack limits).\n stack.set(srcValue, newValue);\n mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n stack['delete'](srcValue);\n }\n assignMergeValue(object, key, newValue);\n }\n\n /**\n * The base implementation of `_.nth` which doesn't coerce arguments.\n *\n * @private\n * @param {Array} array The array to query.\n * @param {number} n The index of the element to return.\n * @returns {*} Returns the nth element of `array`.\n */\n function baseNth(array, n) {\n var length = array.length;\n if (!length) {\n return;\n }\n n += n < 0 ? length : 0;\n return isIndex(n, length) ? array[n] : undefined;\n }\n\n /**\n * The base implementation of `_.orderBy` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.\n * @param {string[]} orders The sort orders of `iteratees`.\n * @returns {Array} Returns the new sorted array.\n */\n function baseOrderBy(collection, iteratees, orders) {\n if (iteratees.length) {\n iteratees = arrayMap(iteratees, function(iteratee) {\n if (isArray(iteratee)) {\n return function(value) {\n return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n }\n }\n return iteratee;\n });\n } else {\n iteratees = [identity];\n }\n\n var index = -1;\n iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n\n var result = baseMap(collection, function(value, key, collection) {\n var criteria = arrayMap(iteratees, function(iteratee) {\n return iteratee(value);\n });\n return { 'criteria': criteria, 'index': ++index, 'value': value };\n });\n\n return baseSortBy(result, function(object, other) {\n return compareMultiple(object, other, orders);\n });\n }\n\n /**\n * The base implementation of `_.pick` without support for individual\n * property identifiers.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @returns {Object} Returns the new object.\n */\n function basePick(object, paths) {\n return basePickBy(object, paths, function(value, path) {\n return hasIn(object, path);\n });\n }\n\n /**\n * The base implementation of `_.pickBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n */\n function basePickBy(object, paths, predicate) {\n var index = -1,\n length = paths.length,\n result = {};\n\n while (++index < length) {\n var path = paths[index],\n value = baseGet(object, path);\n\n if (predicate(value, path)) {\n baseSet(result, castPath(path, object), value);\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `baseProperty` which supports deep paths.\n *\n * @private\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\n function basePropertyDeep(path) {\n return function(object) {\n return baseGet(object, path);\n };\n }\n\n /**\n * The base implementation of `_.pullAllBy` without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns `array`.\n */\n function basePullAll(array, values, iteratee, comparator) {\n var indexOf = comparator ? baseIndexOfWith : baseIndexOf,\n index = -1,\n length = values.length,\n seen = array;\n\n if (array === values) {\n values = copyArray(values);\n }\n if (iteratee) {\n seen = arrayMap(array, baseUnary(iteratee));\n }\n while (++index < length) {\n var fromIndex = 0,\n value = values[index],\n computed = iteratee ? iteratee(value) : value;\n\n while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) {\n if (seen !== array) {\n splice.call(seen, fromIndex, 1);\n }\n splice.call(array, fromIndex, 1);\n }\n }\n return array;\n }\n\n /**\n * The base implementation of `_.pullAt` without support for individual\n * indexes or capturing the removed elements.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {number[]} indexes The indexes of elements to remove.\n * @returns {Array} Returns `array`.\n */\n function basePullAt(array, indexes) {\n var length = array ? indexes.length : 0,\n lastIndex = length - 1;\n\n while (length--) {\n var index = indexes[length];\n if (length == lastIndex || index !== previous) {\n var previous = index;\n if (isIndex(index)) {\n splice.call(array, index, 1);\n } else {\n baseUnset(array, index);\n }\n }\n }\n return array;\n }\n\n /**\n * The base implementation of `_.random` without support for returning\n * floating-point numbers.\n *\n * @private\n * @param {number} lower The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the random number.\n */\n function baseRandom(lower, upper) {\n return lower + nativeFloor(nativeRandom() * (upper - lower + 1));\n }\n\n /**\n * The base implementation of `_.range` and `_.rangeRight` which doesn't\n * coerce arguments.\n *\n * @private\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @param {number} step The value to increment or decrement by.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the range of numbers.\n */\n function baseRange(start, end, step, fromRight) {\n var index = -1,\n length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),\n result = Array(length);\n\n while (length--) {\n result[fromRight ? length : ++index] = start;\n start += step;\n }\n return result;\n }\n\n /**\n * The base implementation of `_.repeat` which doesn't coerce arguments.\n *\n * @private\n * @param {string} string The string to repeat.\n * @param {number} n The number of times to repeat the string.\n * @returns {string} Returns the repeated string.\n */\n function baseRepeat(string, n) {\n var result = '';\n if (!string || n < 1 || n > MAX_SAFE_INTEGER) {\n return result;\n }\n // Leverage the exponentiation by squaring algorithm for a faster repeat.\n // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.\n do {\n if (n % 2) {\n result += string;\n }\n n = nativeFloor(n / 2);\n if (n) {\n string += string;\n }\n } while (n);\n\n return result;\n }\n\n /**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\n function baseRest(func, start) {\n return setToString(overRest(func, start, identity), func + '');\n }\n\n /**\n * The base implementation of `_.sample`.\n *\n * @private\n * @param {Array|Object} collection The collection to sample.\n * @returns {*} Returns the random element.\n */\n function baseSample(collection) {\n return arraySample(values(collection));\n }\n\n /**\n * The base implementation of `_.sampleSize` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to sample.\n * @param {number} n The number of elements to sample.\n * @returns {Array} Returns the random elements.\n */\n function baseSampleSize(collection, n) {\n var array = values(collection);\n return shuffleSelf(array, baseClamp(n, 0, array.length));\n }\n\n /**\n * The base implementation of `_.set`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\n function baseSet(object, path, value, customizer) {\n if (!isObject(object)) {\n return object;\n }\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n lastIndex = length - 1,\n nested = object;\n\n while (nested != null && ++index < length) {\n var key = toKey(path[index]),\n newValue = value;\n\n if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n return object;\n }\n\n if (index != lastIndex) {\n var objValue = nested[key];\n newValue = customizer ? customizer(objValue, key, nested) : undefined;\n if (newValue === undefined) {\n newValue = isObject(objValue)\n ? objValue\n : (isIndex(path[index + 1]) ? [] : {});\n }\n }\n assignValue(nested, key, newValue);\n nested = nested[key];\n }\n return object;\n }\n\n /**\n * The base implementation of `setData` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to associate metadata with.\n * @param {*} data The metadata.\n * @returns {Function} Returns `func`.\n */\n var baseSetData = !metaMap ? identity : function(func, data) {\n metaMap.set(func, data);\n return func;\n };\n\n /**\n * The base implementation of `setToString` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\n var baseSetToString = !defineProperty ? identity : function(func, string) {\n return defineProperty(func, 'toString', {\n 'configurable': true,\n 'enumerable': false,\n 'value': constant(string),\n 'writable': true\n });\n };\n\n /**\n * The base implementation of `_.shuffle`.\n *\n * @private\n * @param {Array|Object} collection The collection to shuffle.\n * @returns {Array} Returns the new shuffled array.\n */\n function baseShuffle(collection) {\n return shuffleSelf(values(collection));\n }\n\n /**\n * The base implementation of `_.slice` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\n function baseSlice(array, start, end) {\n var index = -1,\n length = array.length;\n\n if (start < 0) {\n start = -start > length ? 0 : (length + start);\n }\n end = end > length ? length : end;\n if (end < 0) {\n end += length;\n }\n length = start > end ? 0 : ((end - start) >>> 0);\n start >>>= 0;\n\n var result = Array(length);\n while (++index < length) {\n result[index] = array[index + start];\n }\n return result;\n }\n\n /**\n * The base implementation of `_.some` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n */\n function baseSome(collection, predicate) {\n var result;\n\n baseEach(collection, function(value, index, collection) {\n result = predicate(value, index, collection);\n return !result;\n });\n return !!result;\n }\n\n /**\n * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which\n * performs a binary search of `array` to determine the index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n */\n function baseSortedIndex(array, value, retHighest) {\n var low = 0,\n high = array == null ? low : array.length;\n\n if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {\n while (low < high) {\n var mid = (low + high) >>> 1,\n computed = array[mid];\n\n if (computed !== null && !isSymbol(computed) &&\n (retHighest ? (computed <= value) : (computed < value))) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return high;\n }\n return baseSortedIndexBy(array, value, identity, retHighest);\n }\n\n /**\n * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`\n * which invokes `iteratee` for `value` and each element of `array` to compute\n * their sort ranking. The iteratee is invoked with one argument; (value).\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} iteratee The iteratee invoked per element.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n */\n function baseSortedIndexBy(array, value, iteratee, retHighest) {\n var low = 0,\n high = array == null ? 0 : array.length;\n if (high === 0) {\n return 0;\n }\n\n value = iteratee(value);\n var valIsNaN = value !== value,\n valIsNull = value === null,\n valIsSymbol = isSymbol(value),\n valIsUndefined = value === undefined;\n\n while (low < high) {\n var mid = nativeFloor((low + high) / 2),\n computed = iteratee(array[mid]),\n othIsDefined = computed !== undefined,\n othIsNull = computed === null,\n othIsReflexive = computed === computed,\n othIsSymbol = isSymbol(computed);\n\n if (valIsNaN) {\n var setLow = retHighest || othIsReflexive;\n } else if (valIsUndefined) {\n setLow = othIsReflexive && (retHighest || othIsDefined);\n } else if (valIsNull) {\n setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull);\n } else if (valIsSymbol) {\n setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol);\n } else if (othIsNull || othIsSymbol) {\n setLow = false;\n } else {\n setLow = retHighest ? (computed <= value) : (computed < value);\n }\n if (setLow) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return nativeMin(high, MAX_ARRAY_INDEX);\n }\n\n /**\n * The base implementation of `_.sortedUniq` and `_.sortedUniqBy` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\n function baseSortedUniq(array, iteratee) {\n var index = -1,\n length = array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n if (!index || !eq(computed, seen)) {\n var seen = computed;\n result[resIndex++] = value === 0 ? 0 : value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.toNumber` which doesn't ensure correct\n * conversions of binary, hexadecimal, or octal string values.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n */\n function baseToNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n return +value;\n }\n\n /**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\n function baseToString(value) {\n // Exit early for strings to avoid a performance hit in some environments.\n if (typeof value == 'string') {\n return value;\n }\n if (isArray(value)) {\n // Recursively convert values (susceptible to call stack limits).\n return arrayMap(value, baseToString) + '';\n }\n if (isSymbol(value)) {\n return symbolToString ? symbolToString.call(value) : '';\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n }\n\n /**\n * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\n function baseUniq(array, iteratee, comparator) {\n var index = -1,\n includes = arrayIncludes,\n length = array.length,\n isCommon = true,\n result = [],\n seen = result;\n\n if (comparator) {\n isCommon = false;\n includes = arrayIncludesWith;\n }\n else if (length >= LARGE_ARRAY_SIZE) {\n var set = iteratee ? null : createSet(array);\n if (set) {\n return setToArray(set);\n }\n isCommon = false;\n includes = cacheHas;\n seen = new SetCache;\n }\n else {\n seen = iteratee ? [] : result;\n }\n outer:\n while (++index < length) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n value = (comparator || value !== 0) ? value : 0;\n if (isCommon && computed === computed) {\n var seenIndex = seen.length;\n while (seenIndex--) {\n if (seen[seenIndex] === computed) {\n continue outer;\n }\n }\n if (iteratee) {\n seen.push(computed);\n }\n result.push(value);\n }\n else if (!includes(seen, computed, comparator)) {\n if (seen !== result) {\n seen.push(computed);\n }\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.unset`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The property path to unset.\n * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n */\n function baseUnset(object, path) {\n path = castPath(path, object);\n object = parent(object, path);\n return object == null || delete object[toKey(last(path))];\n }\n\n /**\n * The base implementation of `_.update`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to update.\n * @param {Function} updater The function to produce the updated value.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\n function baseUpdate(object, path, updater, customizer) {\n return baseSet(object, path, updater(baseGet(object, path)), customizer);\n }\n\n /**\n * The base implementation of methods like `_.dropWhile` and `_.takeWhile`\n * without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to query.\n * @param {Function} predicate The function invoked per iteration.\n * @param {boolean} [isDrop] Specify dropping elements instead of taking them.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the slice of `array`.\n */\n function baseWhile(array, predicate, isDrop, fromRight) {\n var length = array.length,\n index = fromRight ? length : -1;\n\n while ((fromRight ? index-- : ++index < length) &&\n predicate(array[index], index, array)) {}\n\n return isDrop\n ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))\n : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));\n }\n\n /**\n * The base implementation of `wrapperValue` which returns the result of\n * performing a sequence of actions on the unwrapped `value`, where each\n * successive action is supplied the return value of the previous.\n *\n * @private\n * @param {*} value The unwrapped value.\n * @param {Array} actions Actions to perform to resolve the unwrapped value.\n * @returns {*} Returns the resolved value.\n */\n function baseWrapperValue(value, actions) {\n var result = value;\n if (result instanceof LazyWrapper) {\n result = result.value();\n }\n return arrayReduce(actions, function(result, action) {\n return action.func.apply(action.thisArg, arrayPush([result], action.args));\n }, result);\n }\n\n /**\n * The base implementation of methods like `_.xor`, without support for\n * iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of values.\n */\n function baseXor(arrays, iteratee, comparator) {\n var length = arrays.length;\n if (length < 2) {\n return length ? baseUniq(arrays[0]) : [];\n }\n var index = -1,\n result = Array(length);\n\n while (++index < length) {\n var array = arrays[index],\n othIndex = -1;\n\n while (++othIndex < length) {\n if (othIndex != index) {\n result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);\n }\n }\n }\n return baseUniq(baseFlatten(result, 1), iteratee, comparator);\n }\n\n /**\n * This base implementation of `_.zipObject` which assigns values using `assignFunc`.\n *\n * @private\n * @param {Array} props The property identifiers.\n * @param {Array} values The property values.\n * @param {Function} assignFunc The function to assign values.\n * @returns {Object} Returns the new object.\n */\n function baseZipObject(props, values, assignFunc) {\n var index = -1,\n length = props.length,\n valsLength = values.length,\n result = {};\n\n while (++index < length) {\n var value = index < valsLength ? values[index] : undefined;\n assignFunc(result, props[index], value);\n }\n return result;\n }\n\n /**\n * Casts `value` to an empty array if it's not an array like object.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Array|Object} Returns the cast array-like object.\n */\n function castArrayLikeObject(value) {\n return isArrayLikeObject(value) ? value : [];\n }\n\n /**\n * Casts `value` to `identity` if it's not a function.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Function} Returns cast function.\n */\n function castFunction(value) {\n return typeof value == 'function' ? value : identity;\n }\n\n /**\n * Casts `value` to a path array if it's not one.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {Object} [object] The object to query keys on.\n * @returns {Array} Returns the cast property path array.\n */\n function castPath(value, object) {\n if (isArray(value)) {\n return value;\n }\n return isKey(value, object) ? [value] : stringToPath(toString(value));\n }\n\n /**\n * A `baseRest` alias which can be replaced with `identity` by module\n * replacement plugins.\n *\n * @private\n * @type {Function}\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\n var castRest = baseRest;\n\n /**\n * Casts `array` to a slice if it's needed.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {number} start The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the cast slice.\n */\n function castSlice(array, start, end) {\n var length = array.length;\n end = end === undefined ? length : end;\n return (!start && end >= length) ? array : baseSlice(array, start, end);\n }\n\n /**\n * A simple wrapper around the global [`clearTimeout`](https://mdn.io/clearTimeout).\n *\n * @private\n * @param {number|Object} id The timer id or timeout object of the timer to clear.\n */\n var clearTimeout = ctxClearTimeout || function(id) {\n return root.clearTimeout(id);\n };\n\n /**\n * Creates a clone of `buffer`.\n *\n * @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n */\n function cloneBuffer(buffer, isDeep) {\n if (isDeep) {\n return buffer.slice();\n }\n var length = buffer.length,\n result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n buffer.copy(result);\n return result;\n }\n\n /**\n * Creates a clone of `arrayBuffer`.\n *\n * @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n */\n function cloneArrayBuffer(arrayBuffer) {\n var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n return result;\n }\n\n /**\n * Creates a clone of `dataView`.\n *\n * @private\n * @param {Object} dataView The data view to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned data view.\n */\n function cloneDataView(dataView, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n }\n\n /**\n * Creates a clone of `regexp`.\n *\n * @private\n * @param {Object} regexp The regexp to clone.\n * @returns {Object} Returns the cloned regexp.\n */\n function cloneRegExp(regexp) {\n var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n result.lastIndex = regexp.lastIndex;\n return result;\n }\n\n /**\n * Creates a clone of the `symbol` object.\n *\n * @private\n * @param {Object} symbol The symbol object to clone.\n * @returns {Object} Returns the cloned symbol object.\n */\n function cloneSymbol(symbol) {\n return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n }\n\n /**\n * Creates a clone of `typedArray`.\n *\n * @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n */\n function cloneTypedArray(typedArray, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n }\n\n /**\n * Compares values to sort them in ascending order.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {number} Returns the sort order indicator for `value`.\n */\n function compareAscending(value, other) {\n if (value !== other) {\n var valIsDefined = value !== undefined,\n valIsNull = value === null,\n valIsReflexive = value === value,\n valIsSymbol = isSymbol(value);\n\n var othIsDefined = other !== undefined,\n othIsNull = other === null,\n othIsReflexive = other === other,\n othIsSymbol = isSymbol(other);\n\n if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||\n (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||\n (valIsNull && othIsDefined && othIsReflexive) ||\n (!valIsDefined && othIsReflexive) ||\n !valIsReflexive) {\n return 1;\n }\n if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||\n (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||\n (othIsNull && valIsDefined && valIsReflexive) ||\n (!othIsDefined && valIsReflexive) ||\n !othIsReflexive) {\n return -1;\n }\n }\n return 0;\n }\n\n /**\n * Used by `_.orderBy` to compare multiple properties of a value to another\n * and stable sort them.\n *\n * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n * of corresponding values.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {boolean[]|string[]} orders The order to sort by for each property.\n * @returns {number} Returns the sort order indicator for `object`.\n */\n function compareMultiple(object, other, orders) {\n var index = -1,\n objCriteria = object.criteria,\n othCriteria = other.criteria,\n length = objCriteria.length,\n ordersLength = orders.length;\n\n while (++index < length) {\n var result = compareAscending(objCriteria[index], othCriteria[index]);\n if (result) {\n if (index >= ordersLength) {\n return result;\n }\n var order = orders[index];\n return result * (order == 'desc' ? -1 : 1);\n }\n }\n // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n // that causes it, under certain circumstances, to provide the same value for\n // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n // for more details.\n //\n // This also ensures a stable sort in V8 and other engines.\n // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n return object.index - other.index;\n }\n\n /**\n * Creates an array that is the composition of partially applied arguments,\n * placeholders, and provided arguments into a single array of arguments.\n *\n * @private\n * @param {Array} args The provided arguments.\n * @param {Array} partials The arguments to prepend to those provided.\n * @param {Array} holders The `partials` placeholder indexes.\n * @params {boolean} [isCurried] Specify composing for a curried function.\n * @returns {Array} Returns the new array of composed arguments.\n */\n function composeArgs(args, partials, holders, isCurried) {\n var argsIndex = -1,\n argsLength = args.length,\n holdersLength = holders.length,\n leftIndex = -1,\n leftLength = partials.length,\n rangeLength = nativeMax(argsLength - holdersLength, 0),\n result = Array(leftLength + rangeLength),\n isUncurried = !isCurried;\n\n while (++leftIndex < leftLength) {\n result[leftIndex] = partials[leftIndex];\n }\n while (++argsIndex < holdersLength) {\n if (isUncurried || argsIndex < argsLength) {\n result[holders[argsIndex]] = args[argsIndex];\n }\n }\n while (rangeLength--) {\n result[leftIndex++] = args[argsIndex++];\n }\n return result;\n }\n\n /**\n * This function is like `composeArgs` except that the arguments composition\n * is tailored for `_.partialRight`.\n *\n * @private\n * @param {Array} args The provided arguments.\n * @param {Array} partials The arguments to append to those provided.\n * @param {Array} holders The `partials` placeholder indexes.\n * @params {boolean} [isCurried] Specify composing for a curried function.\n * @returns {Array} Returns the new array of composed arguments.\n */\n function composeArgsRight(args, partials, holders, isCurried) {\n var argsIndex = -1,\n argsLength = args.length,\n holdersIndex = -1,\n holdersLength = holders.length,\n rightIndex = -1,\n rightLength = partials.length,\n rangeLength = nativeMax(argsLength - holdersLength, 0),\n result = Array(rangeLength + rightLength),\n isUncurried = !isCurried;\n\n while (++argsIndex < rangeLength) {\n result[argsIndex] = args[argsIndex];\n }\n var offset = argsIndex;\n while (++rightIndex < rightLength) {\n result[offset + rightIndex] = partials[rightIndex];\n }\n while (++holdersIndex < holdersLength) {\n if (isUncurried || argsIndex < argsLength) {\n result[offset + holders[holdersIndex]] = args[argsIndex++];\n }\n }\n return result;\n }\n\n /**\n * Copies the values of `source` to `array`.\n *\n * @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n */\n function copyArray(source, array) {\n var index = -1,\n length = source.length;\n\n array || (array = Array(length));\n while (++index < length) {\n array[index] = source[index];\n }\n return array;\n }\n\n /**\n * Copies properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n */\n function copyObject(source, props, object, customizer) {\n var isNew = !object;\n object || (object = {});\n\n var index = -1,\n length = props.length;\n\n while (++index < length) {\n var key = props[index];\n\n var newValue = customizer\n ? customizer(object[key], source[key], key, object, source)\n : undefined;\n\n if (newValue === undefined) {\n newValue = source[key];\n }\n if (isNew) {\n baseAssignValue(object, key, newValue);\n } else {\n assignValue(object, key, newValue);\n }\n }\n return object;\n }\n\n /**\n * Copies own symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\n function copySymbols(source, object) {\n return copyObject(source, getSymbols(source), object);\n }\n\n /**\n * Copies own and inherited symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\n function copySymbolsIn(source, object) {\n return copyObject(source, getSymbolsIn(source), object);\n }\n\n /**\n * Creates a function like `_.groupBy`.\n *\n * @private\n * @param {Function} setter The function to set accumulator values.\n * @param {Function} [initializer] The accumulator object initializer.\n * @returns {Function} Returns the new aggregator function.\n */\n function createAggregator(setter, initializer) {\n return function(collection, iteratee) {\n var func = isArray(collection) ? arrayAggregator : baseAggregator,\n accumulator = initializer ? initializer() : {};\n\n return func(collection, setter, getIteratee(iteratee, 2), accumulator);\n };\n }\n\n /**\n * Creates a function like `_.assign`.\n *\n * @private\n * @param {Function} assigner The function to assign values.\n * @returns {Function} Returns the new assigner function.\n */\n function createAssigner(assigner) {\n return baseRest(function(object, sources) {\n var index = -1,\n length = sources.length,\n customizer = length > 1 ? sources[length - 1] : undefined,\n guard = length > 2 ? sources[2] : undefined;\n\n customizer = (assigner.length > 3 && typeof customizer == 'function')\n ? (length--, customizer)\n : undefined;\n\n if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n customizer = length < 3 ? undefined : customizer;\n length = 1;\n }\n object = Object(object);\n while (++index < length) {\n var source = sources[index];\n if (source) {\n assigner(object, source, index, customizer);\n }\n }\n return object;\n });\n }\n\n /**\n * Creates a `baseEach` or `baseEachRight` function.\n *\n * @private\n * @param {Function} eachFunc The function to iterate over a collection.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\n function createBaseEach(eachFunc, fromRight) {\n return function(collection, iteratee) {\n if (collection == null) {\n return collection;\n }\n if (!isArrayLike(collection)) {\n return eachFunc(collection, iteratee);\n }\n var length = collection.length,\n index = fromRight ? length : -1,\n iterable = Object(collection);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (iteratee(iterable[index], index, iterable) === false) {\n break;\n }\n }\n return collection;\n };\n }\n\n /**\n * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\n function createBaseFor(fromRight) {\n return function(object, iteratee, keysFunc) {\n var index = -1,\n iterable = Object(object),\n props = keysFunc(object),\n length = props.length;\n\n while (length--) {\n var key = props[fromRight ? length : ++index];\n if (iteratee(iterable[key], key, iterable) === false) {\n break;\n }\n }\n return object;\n };\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with the optional `this`\n * binding of `thisArg`.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createBind(func, bitmask, thisArg) {\n var isBind = bitmask & WRAP_BIND_FLAG,\n Ctor = createCtor(func);\n\n function wrapper() {\n var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n return fn.apply(isBind ? thisArg : this, arguments);\n }\n return wrapper;\n }\n\n /**\n * Creates a function like `_.lowerFirst`.\n *\n * @private\n * @param {string} methodName The name of the `String` case method to use.\n * @returns {Function} Returns the new case function.\n */\n function createCaseFirst(methodName) {\n return function(string) {\n string = toString(string);\n\n var strSymbols = hasUnicode(string)\n ? stringToArray(string)\n : undefined;\n\n var chr = strSymbols\n ? strSymbols[0]\n : string.charAt(0);\n\n var trailing = strSymbols\n ? castSlice(strSymbols, 1).join('')\n : string.slice(1);\n\n return chr[methodName]() + trailing;\n };\n }\n\n /**\n * Creates a function like `_.camelCase`.\n *\n * @private\n * @param {Function} callback The function to combine each word.\n * @returns {Function} Returns the new compounder function.\n */\n function createCompounder(callback) {\n return function(string) {\n return arrayReduce(words(deburr(string).replace(reApos, '')), callback, '');\n };\n }\n\n /**\n * Creates a function that produces an instance of `Ctor` regardless of\n * whether it was invoked as part of a `new` expression or by `call` or `apply`.\n *\n * @private\n * @param {Function} Ctor The constructor to wrap.\n * @returns {Function} Returns the new wrapped function.\n */\n function createCtor(Ctor) {\n return function() {\n // Use a `switch` statement to work with class constructors. See\n // http://ecma-international.org/ecma-262/7.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist\n // for more details.\n var args = arguments;\n switch (args.length) {\n case 0: return new Ctor;\n case 1: return new Ctor(args[0]);\n case 2: return new Ctor(args[0], args[1]);\n case 3: return new Ctor(args[0], args[1], args[2]);\n case 4: return new Ctor(args[0], args[1], args[2], args[3]);\n case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]);\n case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]);\n case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]);\n }\n var thisBinding = baseCreate(Ctor.prototype),\n result = Ctor.apply(thisBinding, args);\n\n // Mimic the constructor's `return` behavior.\n // See https://es5.github.io/#x13.2.2 for more details.\n return isObject(result) ? result : thisBinding;\n };\n }\n\n /**\n * Creates a function that wraps `func` to enable currying.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {number} arity The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createCurry(func, bitmask, arity) {\n var Ctor = createCtor(func);\n\n function wrapper() {\n var length = arguments.length,\n args = Array(length),\n index = length,\n placeholder = getHolder(wrapper);\n\n while (index--) {\n args[index] = arguments[index];\n }\n var holders = (length < 3 && args[0] !== placeholder && args[length - 1] !== placeholder)\n ? []\n : replaceHolders(args, placeholder);\n\n length -= holders.length;\n if (length < arity) {\n return createRecurry(\n func, bitmask, createHybrid, wrapper.placeholder, undefined,\n args, holders, undefined, undefined, arity - length);\n }\n var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n return apply(fn, this, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a `_.find` or `_.findLast` function.\n *\n * @private\n * @param {Function} findIndexFunc The function to find the collection index.\n * @returns {Function} Returns the new find function.\n */\n function createFind(findIndexFunc) {\n return function(collection, predicate, fromIndex) {\n var iterable = Object(collection);\n if (!isArrayLike(collection)) {\n var iteratee = getIteratee(predicate, 3);\n collection = keys(collection);\n predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n }\n var index = findIndexFunc(collection, predicate, fromIndex);\n return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n };\n }\n\n /**\n * Creates a `_.flow` or `_.flowRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new flow function.\n */\n function createFlow(fromRight) {\n return flatRest(function(funcs) {\n var length = funcs.length,\n index = length,\n prereq = LodashWrapper.prototype.thru;\n\n if (fromRight) {\n funcs.reverse();\n }\n while (index--) {\n var func = funcs[index];\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n if (prereq && !wrapper && getFuncName(func) == 'wrapper') {\n var wrapper = new LodashWrapper([], true);\n }\n }\n index = wrapper ? index : length;\n while (++index < length) {\n func = funcs[index];\n\n var funcName = getFuncName(func),\n data = funcName == 'wrapper' ? getData(func) : undefined;\n\n if (data && isLaziable(data[0]) &&\n data[1] == (WRAP_ARY_FLAG | WRAP_CURRY_FLAG | WRAP_PARTIAL_FLAG | WRAP_REARG_FLAG) &&\n !data[4].length && data[9] == 1\n ) {\n wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);\n } else {\n wrapper = (func.length == 1 && isLaziable(func))\n ? wrapper[funcName]()\n : wrapper.thru(func);\n }\n }\n return function() {\n var args = arguments,\n value = args[0];\n\n if (wrapper && args.length == 1 && isArray(value)) {\n return wrapper.plant(value).value();\n }\n var index = 0,\n result = length ? funcs[index].apply(this, args) : value;\n\n while (++index < length) {\n result = funcs[index].call(this, result);\n }\n return result;\n };\n });\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with optional `this`\n * binding of `thisArg`, partial application, and currying.\n *\n * @private\n * @param {Function|string} func The function or method name to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to prepend to those provided to\n * the new function.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [partialsRight] The arguments to append to those provided\n * to the new function.\n * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createHybrid(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) {\n var isAry = bitmask & WRAP_ARY_FLAG,\n isBind = bitmask & WRAP_BIND_FLAG,\n isBindKey = bitmask & WRAP_BIND_KEY_FLAG,\n isCurried = bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG),\n isFlip = bitmask & WRAP_FLIP_FLAG,\n Ctor = isBindKey ? undefined : createCtor(func);\n\n function wrapper() {\n var length = arguments.length,\n args = Array(length),\n index = length;\n\n while (index--) {\n args[index] = arguments[index];\n }\n if (isCurried) {\n var placeholder = getHolder(wrapper),\n holdersCount = countHolders(args, placeholder);\n }\n if (partials) {\n args = composeArgs(args, partials, holders, isCurried);\n }\n if (partialsRight) {\n args = composeArgsRight(args, partialsRight, holdersRight, isCurried);\n }\n length -= holdersCount;\n if (isCurried && length < arity) {\n var newHolders = replaceHolders(args, placeholder);\n return createRecurry(\n func, bitmask, createHybrid, wrapper.placeholder, thisArg,\n args, newHolders, argPos, ary, arity - length\n );\n }\n var thisBinding = isBind ? thisArg : this,\n fn = isBindKey ? thisBinding[func] : func;\n\n length = args.length;\n if (argPos) {\n args = reorder(args, argPos);\n } else if (isFlip && length > 1) {\n args.reverse();\n }\n if (isAry && ary < length) {\n args.length = ary;\n }\n if (this && this !== root && this instanceof wrapper) {\n fn = Ctor || createCtor(fn);\n }\n return fn.apply(thisBinding, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a function like `_.invertBy`.\n *\n * @private\n * @param {Function} setter The function to set accumulator values.\n * @param {Function} toIteratee The function to resolve iteratees.\n * @returns {Function} Returns the new inverter function.\n */\n function createInverter(setter, toIteratee) {\n return function(object, iteratee) {\n return baseInverter(object, setter, toIteratee(iteratee), {});\n };\n }\n\n /**\n * Creates a function that performs a mathematical operation on two values.\n *\n * @private\n * @param {Function} operator The function to perform the operation.\n * @param {number} [defaultValue] The value used for `undefined` arguments.\n * @returns {Function} Returns the new mathematical operation function.\n */\n function createMathOperation(operator, defaultValue) {\n return function(value, other) {\n var result;\n if (value === undefined && other === undefined) {\n return defaultValue;\n }\n if (value !== undefined) {\n result = value;\n }\n if (other !== undefined) {\n if (result === undefined) {\n return other;\n }\n if (typeof value == 'string' || typeof other == 'string') {\n value = baseToString(value);\n other = baseToString(other);\n } else {\n value = baseToNumber(value);\n other = baseToNumber(other);\n }\n result = operator(value, other);\n }\n return result;\n };\n }\n\n /**\n * Creates a function like `_.over`.\n *\n * @private\n * @param {Function} arrayFunc The function to iterate over iteratees.\n * @returns {Function} Returns the new over function.\n */\n function createOver(arrayFunc) {\n return flatRest(function(iteratees) {\n iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n return baseRest(function(args) {\n var thisArg = this;\n return arrayFunc(iteratees, function(iteratee) {\n return apply(iteratee, thisArg, args);\n });\n });\n });\n }\n\n /**\n * Creates the padding for `string` based on `length`. The `chars` string\n * is truncated if the number of characters exceeds `length`.\n *\n * @private\n * @param {number} length The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padding for `string`.\n */\n function createPadding(length, chars) {\n chars = chars === undefined ? ' ' : baseToString(chars);\n\n var charsLength = chars.length;\n if (charsLength < 2) {\n return charsLength ? baseRepeat(chars, length) : chars;\n }\n var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));\n return hasUnicode(chars)\n ? castSlice(stringToArray(result), 0, length).join('')\n : result.slice(0, length);\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with the `this` binding\n * of `thisArg` and `partials` prepended to the arguments it receives.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} partials The arguments to prepend to those provided to\n * the new function.\n * @returns {Function} Returns the new wrapped function.\n */\n function createPartial(func, bitmask, thisArg, partials) {\n var isBind = bitmask & WRAP_BIND_FLAG,\n Ctor = createCtor(func);\n\n function wrapper() {\n var argsIndex = -1,\n argsLength = arguments.length,\n leftIndex = -1,\n leftLength = partials.length,\n args = Array(leftLength + argsLength),\n fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n\n while (++leftIndex < leftLength) {\n args[leftIndex] = partials[leftIndex];\n }\n while (argsLength--) {\n args[leftIndex++] = arguments[++argsIndex];\n }\n return apply(fn, isBind ? thisArg : this, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a `_.range` or `_.rangeRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new range function.\n */\n function createRange(fromRight) {\n return function(start, end, step) {\n if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {\n end = step = undefined;\n }\n // Ensure the sign of `-0` is preserved.\n start = toFinite(start);\n if (end === undefined) {\n end = start;\n start = 0;\n } else {\n end = toFinite(end);\n }\n step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);\n return baseRange(start, end, step, fromRight);\n };\n }\n\n /**\n * Creates a function that performs a relational operation on two values.\n *\n * @private\n * @param {Function} operator The function to perform the operation.\n * @returns {Function} Returns the new relational operation function.\n */\n function createRelationalOperation(operator) {\n return function(value, other) {\n if (!(typeof value == 'string' && typeof other == 'string')) {\n value = toNumber(value);\n other = toNumber(other);\n }\n return operator(value, other);\n };\n }\n\n /**\n * Creates a function that wraps `func` to continue currying.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {Function} wrapFunc The function to create the `func` wrapper.\n * @param {*} placeholder The placeholder value.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to prepend to those provided to\n * the new function.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createRecurry(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) {\n var isCurry = bitmask & WRAP_CURRY_FLAG,\n newHolders = isCurry ? holders : undefined,\n newHoldersRight = isCurry ? undefined : holders,\n newPartials = isCurry ? partials : undefined,\n newPartialsRight = isCurry ? undefined : partials;\n\n bitmask |= (isCurry ? WRAP_PARTIAL_FLAG : WRAP_PARTIAL_RIGHT_FLAG);\n bitmask &= ~(isCurry ? WRAP_PARTIAL_RIGHT_FLAG : WRAP_PARTIAL_FLAG);\n\n if (!(bitmask & WRAP_CURRY_BOUND_FLAG)) {\n bitmask &= ~(WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG);\n }\n var newData = [\n func, bitmask, thisArg, newPartials, newHolders, newPartialsRight,\n newHoldersRight, argPos, ary, arity\n ];\n\n var result = wrapFunc.apply(undefined, newData);\n if (isLaziable(func)) {\n setData(result, newData);\n }\n result.placeholder = placeholder;\n return setWrapToString(result, func, bitmask);\n }\n\n /**\n * Creates a function like `_.round`.\n *\n * @private\n * @param {string} methodName The name of the `Math` method to use when rounding.\n * @returns {Function} Returns the new round function.\n */\n function createRound(methodName) {\n var func = Math[methodName];\n return function(number, precision) {\n number = toNumber(number);\n precision = precision == null ? 0 : nativeMin(toInteger(precision), 292);\n if (precision && nativeIsFinite(number)) {\n // Shift with exponential notation to avoid floating-point issues.\n // See [MDN](https://mdn.io/round#Examples) for more details.\n var pair = (toString(number) + 'e').split('e'),\n value = func(pair[0] + 'e' + (+pair[1] + precision));\n\n pair = (toString(value) + 'e').split('e');\n return +(pair[0] + 'e' + (+pair[1] - precision));\n }\n return func(number);\n };\n }\n\n /**\n * Creates a set object of `values`.\n *\n * @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n */\n var createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n return new Set(values);\n };\n\n /**\n * Creates a `_.toPairs` or `_.toPairsIn` function.\n *\n * @private\n * @param {Function} keysFunc The function to get the keys of a given object.\n * @returns {Function} Returns the new pairs function.\n */\n function createToPairs(keysFunc) {\n return function(object) {\n var tag = getTag(object);\n if (tag == mapTag) {\n return mapToArray(object);\n }\n if (tag == setTag) {\n return setToPairs(object);\n }\n return baseToPairs(object, keysFunc(object));\n };\n }\n\n /**\n * Creates a function that either curries or invokes `func` with optional\n * `this` binding and partially applied arguments.\n *\n * @private\n * @param {Function|string} func The function or method name to wrap.\n * @param {number} bitmask The bitmask flags.\n * 1 - `_.bind`\n * 2 - `_.bindKey`\n * 4 - `_.curry` or `_.curryRight` of a bound function\n * 8 - `_.curry`\n * 16 - `_.curryRight`\n * 32 - `_.partial`\n * 64 - `_.partialRight`\n * 128 - `_.rearg`\n * 256 - `_.ary`\n * 512 - `_.flip`\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to be partially applied.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createWrap(func, bitmask, thisArg, partials, holders, argPos, ary, arity) {\n var isBindKey = bitmask & WRAP_BIND_KEY_FLAG;\n if (!isBindKey && typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n var length = partials ? partials.length : 0;\n if (!length) {\n bitmask &= ~(WRAP_PARTIAL_FLAG | WRAP_PARTIAL_RIGHT_FLAG);\n partials = holders = undefined;\n }\n ary = ary === undefined ? ary : nativeMax(toInteger(ary), 0);\n arity = arity === undefined ? arity : toInteger(arity);\n length -= holders ? holders.length : 0;\n\n if (bitmask & WRAP_PARTIAL_RIGHT_FLAG) {\n var partialsRight = partials,\n holdersRight = holders;\n\n partials = holders = undefined;\n }\n var data = isBindKey ? undefined : getData(func);\n\n var newData = [\n func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,\n argPos, ary, arity\n ];\n\n if (data) {\n mergeData(newData, data);\n }\n func = newData[0];\n bitmask = newData[1];\n thisArg = newData[2];\n partials = newData[3];\n holders = newData[4];\n arity = newData[9] = newData[9] === undefined\n ? (isBindKey ? 0 : func.length)\n : nativeMax(newData[9] - length, 0);\n\n if (!arity && bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG)) {\n bitmask &= ~(WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG);\n }\n if (!bitmask || bitmask == WRAP_BIND_FLAG) {\n var result = createBind(func, bitmask, thisArg);\n } else if (bitmask == WRAP_CURRY_FLAG || bitmask == WRAP_CURRY_RIGHT_FLAG) {\n result = createCurry(func, bitmask, arity);\n } else if ((bitmask == WRAP_PARTIAL_FLAG || bitmask == (WRAP_BIND_FLAG | WRAP_PARTIAL_FLAG)) && !holders.length) {\n result = createPartial(func, bitmask, thisArg, partials);\n } else {\n result = createHybrid.apply(undefined, newData);\n }\n var setter = data ? baseSetData : setData;\n return setWrapToString(setter(result, newData), func, bitmask);\n }\n\n /**\n * Used by `_.defaults` to customize its `_.assignIn` use to assign properties\n * of source objects to the destination object for all destination properties\n * that resolve to `undefined`.\n *\n * @private\n * @param {*} objValue The destination value.\n * @param {*} srcValue The source value.\n * @param {string} key The key of the property to assign.\n * @param {Object} object The parent object of `objValue`.\n * @returns {*} Returns the value to assign.\n */\n function customDefaultsAssignIn(objValue, srcValue, key, object) {\n if (objValue === undefined ||\n (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n return srcValue;\n }\n return objValue;\n }\n\n /**\n * Used by `_.defaultsDeep` to customize its `_.merge` use to merge source\n * objects into destination objects that are passed thru.\n *\n * @private\n * @param {*} objValue The destination value.\n * @param {*} srcValue The source value.\n * @param {string} key The key of the property to merge.\n * @param {Object} object The parent object of `objValue`.\n * @param {Object} source The parent object of `srcValue`.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n * @returns {*} Returns the value to assign.\n */\n function customDefaultsMerge(objValue, srcValue, key, object, source, stack) {\n if (isObject(objValue) && isObject(srcValue)) {\n // Recursively merge objects and arrays (susceptible to call stack limits).\n stack.set(srcValue, objValue);\n baseMerge(objValue, srcValue, undefined, customDefaultsMerge, stack);\n stack['delete'](srcValue);\n }\n return objValue;\n }\n\n /**\n * Used by `_.omit` to customize its `_.cloneDeep` use to only clone plain\n * objects.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {string} key The key of the property to inspect.\n * @returns {*} Returns the uncloned value or `undefined` to defer cloning to `_.cloneDeep`.\n */\n function customOmitClone(value) {\n return isPlainObject(value) ? undefined : value;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n */\n function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n arrLength = array.length,\n othLength = other.length;\n\n if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n return false;\n }\n // Check that cyclic values are equal.\n var arrStacked = stack.get(array);\n var othStacked = stack.get(other);\n if (arrStacked && othStacked) {\n return arrStacked == other && othStacked == array;\n }\n var index = -1,\n result = true,\n seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n stack.set(array, other);\n stack.set(other, array);\n\n // Ignore non-index properties.\n while (++index < arrLength) {\n var arrValue = array[index],\n othValue = other[index];\n\n if (customizer) {\n var compared = isPartial\n ? customizer(othValue, arrValue, index, other, array, stack)\n : customizer(arrValue, othValue, index, array, other, stack);\n }\n if (compared !== undefined) {\n if (compared) {\n continue;\n }\n result = false;\n break;\n }\n // Recursively compare arrays (susceptible to call stack limits).\n if (seen) {\n if (!arraySome(other, function(othValue, othIndex) {\n if (!cacheHas(seen, othIndex) &&\n (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n return seen.push(othIndex);\n }\n })) {\n result = false;\n break;\n }\n } else if (!(\n arrValue === othValue ||\n equalFunc(arrValue, othValue, bitmask, customizer, stack)\n )) {\n result = false;\n break;\n }\n }\n stack['delete'](array);\n stack['delete'](other);\n return result;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n *\n * **Note:** This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n switch (tag) {\n case dataViewTag:\n if ((object.byteLength != other.byteLength) ||\n (object.byteOffset != other.byteOffset)) {\n return false;\n }\n object = object.buffer;\n other = other.buffer;\n\n case arrayBufferTag:\n if ((object.byteLength != other.byteLength) ||\n !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n return false;\n }\n return true;\n\n case boolTag:\n case dateTag:\n case numberTag:\n // Coerce booleans to `1` or `0` and dates to milliseconds.\n // Invalid dates are coerced to `NaN`.\n return eq(+object, +other);\n\n case errorTag:\n return object.name == other.name && object.message == other.message;\n\n case regexpTag:\n case stringTag:\n // Coerce regexes to strings and treat strings, primitives and objects,\n // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n // for more details.\n return object == (other + '');\n\n case mapTag:\n var convert = mapToArray;\n\n case setTag:\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n convert || (convert = setToArray);\n\n if (object.size != other.size && !isPartial) {\n return false;\n }\n // Assume cyclic values are equal.\n var stacked = stack.get(object);\n if (stacked) {\n return stacked == other;\n }\n bitmask |= COMPARE_UNORDERED_FLAG;\n\n // Recursively compare objects (susceptible to call stack limits).\n stack.set(object, other);\n var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n stack['delete'](object);\n return result;\n\n case symbolTag:\n if (symbolValueOf) {\n return symbolValueOf.call(object) == symbolValueOf.call(other);\n }\n }\n return false;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n objProps = getAllKeys(object),\n objLength = objProps.length,\n othProps = getAllKeys(other),\n othLength = othProps.length;\n\n if (objLength != othLength && !isPartial) {\n return false;\n }\n var index = objLength;\n while (index--) {\n var key = objProps[index];\n if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n return false;\n }\n }\n // Check that cyclic values are equal.\n var objStacked = stack.get(object);\n var othStacked = stack.get(other);\n if (objStacked && othStacked) {\n return objStacked == other && othStacked == object;\n }\n var result = true;\n stack.set(object, other);\n stack.set(other, object);\n\n var skipCtor = isPartial;\n while (++index < objLength) {\n key = objProps[index];\n var objValue = object[key],\n othValue = other[key];\n\n if (customizer) {\n var compared = isPartial\n ? customizer(othValue, objValue, key, other, object, stack)\n : customizer(objValue, othValue, key, object, other, stack);\n }\n // Recursively compare objects (susceptible to call stack limits).\n if (!(compared === undefined\n ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n : compared\n )) {\n result = false;\n break;\n }\n skipCtor || (skipCtor = key == 'constructor');\n }\n if (result && !skipCtor) {\n var objCtor = object.constructor,\n othCtor = other.constructor;\n\n // Non `Object` object instances with different constructors are not equal.\n if (objCtor != othCtor &&\n ('constructor' in object && 'constructor' in other) &&\n !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n result = false;\n }\n }\n stack['delete'](object);\n stack['delete'](other);\n return result;\n }\n\n /**\n * A specialized version of `baseRest` which flattens the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\n function flatRest(func) {\n return setToString(overRest(func, undefined, flatten), func + '');\n }\n\n /**\n * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function getAllKeys(object) {\n return baseGetAllKeys(object, keys, getSymbols);\n }\n\n /**\n * Creates an array of own and inherited enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function getAllKeysIn(object) {\n return baseGetAllKeys(object, keysIn, getSymbolsIn);\n }\n\n /**\n * Gets metadata for `func`.\n *\n * @private\n * @param {Function} func The function to query.\n * @returns {*} Returns the metadata for `func`.\n */\n var getData = !metaMap ? noop : function(func) {\n return metaMap.get(func);\n };\n\n /**\n * Gets the name of `func`.\n *\n * @private\n * @param {Function} func The function to query.\n * @returns {string} Returns the function name.\n */\n function getFuncName(func) {\n var result = (func.name + ''),\n array = realNames[result],\n length = hasOwnProperty.call(realNames, result) ? array.length : 0;\n\n while (length--) {\n var data = array[length],\n otherFunc = data.func;\n if (otherFunc == null || otherFunc == func) {\n return data.name;\n }\n }\n return result;\n }\n\n /**\n * Gets the argument placeholder value for `func`.\n *\n * @private\n * @param {Function} func The function to inspect.\n * @returns {*} Returns the placeholder value.\n */\n function getHolder(func) {\n var object = hasOwnProperty.call(lodash, 'placeholder') ? lodash : func;\n return object.placeholder;\n }\n\n /**\n * Gets the appropriate \"iteratee\" function. If `_.iteratee` is customized,\n * this function returns the custom method, otherwise it returns `baseIteratee`.\n * If arguments are provided, the chosen function is invoked with them and\n * its result is returned.\n *\n * @private\n * @param {*} [value] The value to convert to an iteratee.\n * @param {number} [arity] The arity of the created iteratee.\n * @returns {Function} Returns the chosen function or its result.\n */\n function getIteratee() {\n var result = lodash.iteratee || iteratee;\n result = result === iteratee ? baseIteratee : result;\n return arguments.length ? result(arguments[0], arguments[1]) : result;\n }\n\n /**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\n function getMapData(map, key) {\n var data = map.__data__;\n return isKeyable(key)\n ? data[typeof key == 'string' ? 'string' : 'hash']\n : data.map;\n }\n\n /**\n * Gets the property names, values, and compare flags of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the match data of `object`.\n */\n function getMatchData(object) {\n var result = keys(object),\n length = result.length;\n\n while (length--) {\n var key = result[length],\n value = object[key];\n\n result[length] = [key, value, isStrictComparable(value)];\n }\n return result;\n }\n\n /**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\n function getNative(object, key) {\n var value = getValue(object, key);\n return baseIsNative(value) ? value : undefined;\n }\n\n /**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\n function getRawTag(value) {\n var isOwn = hasOwnProperty.call(value, symToStringTag),\n tag = value[symToStringTag];\n\n try {\n value[symToStringTag] = undefined;\n var unmasked = true;\n } catch (e) {}\n\n var result = nativeObjectToString.call(value);\n if (unmasked) {\n if (isOwn) {\n value[symToStringTag] = tag;\n } else {\n delete value[symToStringTag];\n }\n }\n return result;\n }\n\n /**\n * Creates an array of the own enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\n var getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n if (object == null) {\n return [];\n }\n object = Object(object);\n return arrayFilter(nativeGetSymbols(object), function(symbol) {\n return propertyIsEnumerable.call(object, symbol);\n });\n };\n\n /**\n * Creates an array of the own and inherited enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\n var getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {\n var result = [];\n while (object) {\n arrayPush(result, getSymbols(object));\n object = getPrototype(object);\n }\n return result;\n };\n\n /**\n * Gets the `toStringTag` of `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\n var getTag = baseGetTag;\n\n // Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\n if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n (Map && getTag(new Map) != mapTag) ||\n (Promise && getTag(Promise.resolve()) != promiseTag) ||\n (Set && getTag(new Set) != setTag) ||\n (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n getTag = function(value) {\n var result = baseGetTag(value),\n Ctor = result == objectTag ? value.constructor : undefined,\n ctorString = Ctor ? toSource(Ctor) : '';\n\n if (ctorString) {\n switch (ctorString) {\n case dataViewCtorString: return dataViewTag;\n case mapCtorString: return mapTag;\n case promiseCtorString: return promiseTag;\n case setCtorString: return setTag;\n case weakMapCtorString: return weakMapTag;\n }\n }\n return result;\n };\n }\n\n /**\n * Gets the view, applying any `transforms` to the `start` and `end` positions.\n *\n * @private\n * @param {number} start The start of the view.\n * @param {number} end The end of the view.\n * @param {Array} transforms The transformations to apply to the view.\n * @returns {Object} Returns an object containing the `start` and `end`\n * positions of the view.\n */\n function getView(start, end, transforms) {\n var index = -1,\n length = transforms.length;\n\n while (++index < length) {\n var data = transforms[index],\n size = data.size;\n\n switch (data.type) {\n case 'drop': start += size; break;\n case 'dropRight': end -= size; break;\n case 'take': end = nativeMin(end, start + size); break;\n case 'takeRight': start = nativeMax(start, end - size); break;\n }\n }\n return { 'start': start, 'end': end };\n }\n\n /**\n * Extracts wrapper details from the `source` body comment.\n *\n * @private\n * @param {string} source The source to inspect.\n * @returns {Array} Returns the wrapper details.\n */\n function getWrapDetails(source) {\n var match = source.match(reWrapDetails);\n return match ? match[1].split(reSplitDetails) : [];\n }\n\n /**\n * Checks if `path` exists on `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n */\n function hasPath(object, path, hasFunc) {\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n result = false;\n\n while (++index < length) {\n var key = toKey(path[index]);\n if (!(result = object != null && hasFunc(object, key))) {\n break;\n }\n object = object[key];\n }\n if (result || ++index != length) {\n return result;\n }\n length = object == null ? 0 : object.length;\n return !!length && isLength(length) && isIndex(key, length) &&\n (isArray(object) || isArguments(object));\n }\n\n /**\n * Initializes an array clone.\n *\n * @private\n * @param {Array} array The array to clone.\n * @returns {Array} Returns the initialized clone.\n */\n function initCloneArray(array) {\n var length = array.length,\n result = new array.constructor(length);\n\n // Add properties assigned by `RegExp#exec`.\n if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n result.index = array.index;\n result.input = array.input;\n }\n return result;\n }\n\n /**\n * Initializes an object clone.\n *\n * @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n */\n function initCloneObject(object) {\n return (typeof object.constructor == 'function' && !isPrototype(object))\n ? baseCreate(getPrototype(object))\n : {};\n }\n\n /**\n * Initializes an object clone based on its `toStringTag`.\n *\n * **Note:** This function only supports cloning values with tags of\n * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.\n *\n * @private\n * @param {Object} object The object to clone.\n * @param {string} tag The `toStringTag` of the object to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the initialized clone.\n */\n function initCloneByTag(object, tag, isDeep) {\n var Ctor = object.constructor;\n switch (tag) {\n case arrayBufferTag:\n return cloneArrayBuffer(object);\n\n case boolTag:\n case dateTag:\n return new Ctor(+object);\n\n case dataViewTag:\n return cloneDataView(object, isDeep);\n\n case float32Tag: case float64Tag:\n case int8Tag: case int16Tag: case int32Tag:\n case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n return cloneTypedArray(object, isDeep);\n\n case mapTag:\n return new Ctor;\n\n case numberTag:\n case stringTag:\n return new Ctor(object);\n\n case regexpTag:\n return cloneRegExp(object);\n\n case setTag:\n return new Ctor;\n\n case symbolTag:\n return cloneSymbol(object);\n }\n }\n\n /**\n * Inserts wrapper `details` in a comment at the top of the `source` body.\n *\n * @private\n * @param {string} source The source to modify.\n * @returns {Array} details The details to insert.\n * @returns {string} Returns the modified source.\n */\n function insertWrapDetails(source, details) {\n var length = details.length;\n if (!length) {\n return source;\n }\n var lastIndex = length - 1;\n details[lastIndex] = (length > 1 ? '& ' : '') + details[lastIndex];\n details = details.join(length > 2 ? ', ' : ' ');\n return source.replace(reWrapComment, '{\\n/* [wrapped with ' + details + '] */\\n');\n }\n\n /**\n * Checks if `value` is a flattenable `arguments` object or array.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n */\n function isFlattenable(value) {\n return isArray(value) || isArguments(value) ||\n !!(spreadableSymbol && value && value[spreadableSymbol]);\n }\n\n /**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\n function isIndex(value, length) {\n var type = typeof value;\n length = length == null ? MAX_SAFE_INTEGER : length;\n\n return !!length &&\n (type == 'number' ||\n (type != 'symbol' && reIsUint.test(value))) &&\n (value > -1 && value % 1 == 0 && value < length);\n }\n\n /**\n * Checks if the given arguments are from an iteratee call.\n *\n * @private\n * @param {*} value The potential iteratee value argument.\n * @param {*} index The potential iteratee index or key argument.\n * @param {*} object The potential iteratee object argument.\n * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n * else `false`.\n */\n function isIterateeCall(value, index, object) {\n if (!isObject(object)) {\n return false;\n }\n var type = typeof index;\n if (type == 'number'\n ? (isArrayLike(object) && isIndex(index, object.length))\n : (type == 'string' && index in object)\n ) {\n return eq(object[index], value);\n }\n return false;\n }\n\n /**\n * Checks if `value` is a property name and not a property path.\n *\n * @private\n * @param {*} value The value to check.\n * @param {Object} [object] The object to query keys on.\n * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n */\n function isKey(value, object) {\n if (isArray(value)) {\n return false;\n }\n var type = typeof value;\n if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n value == null || isSymbol(value)) {\n return true;\n }\n return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n (object != null && value in Object(object));\n }\n\n /**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\n function isKeyable(value) {\n var type = typeof value;\n return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n ? (value !== '__proto__')\n : (value === null);\n }\n\n /**\n * Checks if `func` has a lazy counterpart.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` has a lazy counterpart,\n * else `false`.\n */\n function isLaziable(func) {\n var funcName = getFuncName(func),\n other = lodash[funcName];\n\n if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) {\n return false;\n }\n if (func === other) {\n return true;\n }\n var data = getData(other);\n return !!data && func === data[0];\n }\n\n /**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\n function isMasked(func) {\n return !!maskSrcKey && (maskSrcKey in func);\n }\n\n /**\n * Checks if `func` is capable of being masked.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `func` is maskable, else `false`.\n */\n var isMaskable = coreJsData ? isFunction : stubFalse;\n\n /**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\n function isPrototype(value) {\n var Ctor = value && value.constructor,\n proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n return value === proto;\n }\n\n /**\n * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` if suitable for strict\n * equality comparisons, else `false`.\n */\n function isStrictComparable(value) {\n return value === value && !isObject(value);\n }\n\n /**\n * A specialized version of `matchesProperty` for source values suitable\n * for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\n function matchesStrictComparable(key, srcValue) {\n return function(object) {\n if (object == null) {\n return false;\n }\n return object[key] === srcValue &&\n (srcValue !== undefined || (key in Object(object)));\n };\n }\n\n /**\n * A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n *\n * @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n */\n function memoizeCapped(func) {\n var result = memoize(func, function(key) {\n if (cache.size === MAX_MEMOIZE_SIZE) {\n cache.clear();\n }\n return key;\n });\n\n var cache = result.cache;\n return result;\n }\n\n /**\n * Merges the function metadata of `source` into `data`.\n *\n * Merging metadata reduces the number of wrappers used to invoke a function.\n * This is possible because methods like `_.bind`, `_.curry`, and `_.partial`\n * may be applied regardless of execution order. Methods like `_.ary` and\n * `_.rearg` modify function arguments, making the order in which they are\n * executed important, preventing the merging of metadata. However, we make\n * an exception for a safe combined case where curried functions have `_.ary`\n * and or `_.rearg` applied.\n *\n * @private\n * @param {Array} data The destination metadata.\n * @param {Array} source The source metadata.\n * @returns {Array} Returns `data`.\n */\n function mergeData(data, source) {\n var bitmask = data[1],\n srcBitmask = source[1],\n newBitmask = bitmask | srcBitmask,\n isCommon = newBitmask < (WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG | WRAP_ARY_FLAG);\n\n var isCombo =\n ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_CURRY_FLAG)) ||\n ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_REARG_FLAG) && (data[7].length <= source[8])) ||\n ((srcBitmask == (WRAP_ARY_FLAG | WRAP_REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == WRAP_CURRY_FLAG));\n\n // Exit early if metadata can't be merged.\n if (!(isCommon || isCombo)) {\n return data;\n }\n // Use source `thisArg` if available.\n if (srcBitmask & WRAP_BIND_FLAG) {\n data[2] = source[2];\n // Set when currying a bound function.\n newBitmask |= bitmask & WRAP_BIND_FLAG ? 0 : WRAP_CURRY_BOUND_FLAG;\n }\n // Compose partial arguments.\n var value = source[3];\n if (value) {\n var partials = data[3];\n data[3] = partials ? composeArgs(partials, value, source[4]) : value;\n data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : source[4];\n }\n // Compose partial right arguments.\n value = source[5];\n if (value) {\n partials = data[5];\n data[5] = partials ? composeArgsRight(partials, value, source[6]) : value;\n data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : source[6];\n }\n // Use source `argPos` if available.\n value = source[7];\n if (value) {\n data[7] = value;\n }\n // Use source `ary` if it's smaller.\n if (srcBitmask & WRAP_ARY_FLAG) {\n data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]);\n }\n // Use source `arity` if one is not provided.\n if (data[9] == null) {\n data[9] = source[9];\n }\n // Use source `func` and merge bitmasks.\n data[0] = source[0];\n data[1] = newBitmask;\n\n return data;\n }\n\n /**\n * This function is like\n * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * except that it includes inherited enumerable properties.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function nativeKeysIn(object) {\n var result = [];\n if (object != null) {\n for (var key in Object(object)) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\n function objectToString(value) {\n return nativeObjectToString.call(value);\n }\n\n /**\n * A specialized version of `baseRest` which transforms the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @param {Function} transform The rest array transform.\n * @returns {Function} Returns the new function.\n */\n function overRest(func, start, transform) {\n start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n return function() {\n var args = arguments,\n index = -1,\n length = nativeMax(args.length - start, 0),\n array = Array(length);\n\n while (++index < length) {\n array[index] = args[start + index];\n }\n index = -1;\n var otherArgs = Array(start + 1);\n while (++index < start) {\n otherArgs[index] = args[index];\n }\n otherArgs[start] = transform(array);\n return apply(func, this, otherArgs);\n };\n }\n\n /**\n * Gets the parent value at `path` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} path The path to get the parent value of.\n * @returns {*} Returns the parent value.\n */\n function parent(object, path) {\n return path.length < 2 ? object : baseGet(object, baseSlice(path, 0, -1));\n }\n\n /**\n * Reorder `array` according to the specified indexes where the element at\n * the first index is assigned as the first element, the element at\n * the second index is assigned as the second element, and so on.\n *\n * @private\n * @param {Array} array The array to reorder.\n * @param {Array} indexes The arranged array indexes.\n * @returns {Array} Returns `array`.\n */\n function reorder(array, indexes) {\n var arrLength = array.length,\n length = nativeMin(indexes.length, arrLength),\n oldArray = copyArray(array);\n\n while (length--) {\n var index = indexes[length];\n array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined;\n }\n return array;\n }\n\n /**\n * Gets the value at `key`, unless `key` is \"__proto__\" or \"constructor\".\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\n function safeGet(object, key) {\n if (key === 'constructor' && typeof object[key] === 'function') {\n return;\n }\n\n if (key == '__proto__') {\n return;\n }\n\n return object[key];\n }\n\n /**\n * Sets metadata for `func`.\n *\n * **Note:** If this function becomes hot, i.e. is invoked a lot in a short\n * period of time, it will trip its breaker and transition to an identity\n * function to avoid garbage collection pauses in V8. See\n * [V8 issue 2070](https://bugs.chromium.org/p/v8/issues/detail?id=2070)\n * for more details.\n *\n * @private\n * @param {Function} func The function to associate metadata with.\n * @param {*} data The metadata.\n * @returns {Function} Returns `func`.\n */\n var setData = shortOut(baseSetData);\n\n /**\n * A simple wrapper around the global [`setTimeout`](https://mdn.io/setTimeout).\n *\n * @private\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @returns {number|Object} Returns the timer id or timeout object.\n */\n var setTimeout = ctxSetTimeout || function(func, wait) {\n return root.setTimeout(func, wait);\n };\n\n /**\n * Sets the `toString` method of `func` to return `string`.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\n var setToString = shortOut(baseSetToString);\n\n /**\n * Sets the `toString` method of `wrapper` to mimic the source of `reference`\n * with wrapper details in a comment at the top of the source body.\n *\n * @private\n * @param {Function} wrapper The function to modify.\n * @param {Function} reference The reference function.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @returns {Function} Returns `wrapper`.\n */\n function setWrapToString(wrapper, reference, bitmask) {\n var source = (reference + '');\n return setToString(wrapper, insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)));\n }\n\n /**\n * Creates a function that'll short out and invoke `identity` instead\n * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n * milliseconds.\n *\n * @private\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new shortable function.\n */\n function shortOut(func) {\n var count = 0,\n lastCalled = 0;\n\n return function() {\n var stamp = nativeNow(),\n remaining = HOT_SPAN - (stamp - lastCalled);\n\n lastCalled = stamp;\n if (remaining > 0) {\n if (++count >= HOT_COUNT) {\n return arguments[0];\n }\n } else {\n count = 0;\n }\n return func.apply(undefined, arguments);\n };\n }\n\n /**\n * A specialized version of `_.shuffle` which mutates and sets the size of `array`.\n *\n * @private\n * @param {Array} array The array to shuffle.\n * @param {number} [size=array.length] The size of `array`.\n * @returns {Array} Returns `array`.\n */\n function shuffleSelf(array, size) {\n var index = -1,\n length = array.length,\n lastIndex = length - 1;\n\n size = size === undefined ? length : size;\n while (++index < size) {\n var rand = baseRandom(index, lastIndex),\n value = array[rand];\n\n array[rand] = array[index];\n array[index] = value;\n }\n array.length = size;\n return array;\n }\n\n /**\n * Converts `string` to a property path array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the property path array.\n */\n var stringToPath = memoizeCapped(function(string) {\n var result = [];\n if (string.charCodeAt(0) === 46 /* . */) {\n result.push('');\n }\n string.replace(rePropName, function(match, number, quote, subString) {\n result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n });\n return result;\n });\n\n /**\n * Converts `value` to a string key if it's not a string or symbol.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {string|symbol} Returns the key.\n */\n function toKey(value) {\n if (typeof value == 'string' || isSymbol(value)) {\n return value;\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n }\n\n /**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\n function toSource(func) {\n if (func != null) {\n try {\n return funcToString.call(func);\n } catch (e) {}\n try {\n return (func + '');\n } catch (e) {}\n }\n return '';\n }\n\n /**\n * Updates wrapper `details` based on `bitmask` flags.\n *\n * @private\n * @returns {Array} details The details to modify.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @returns {Array} Returns `details`.\n */\n function updateWrapDetails(details, bitmask) {\n arrayEach(wrapFlags, function(pair) {\n var value = '_.' + pair[0];\n if ((bitmask & pair[1]) && !arrayIncludes(details, value)) {\n details.push(value);\n }\n });\n return details.sort();\n }\n\n /**\n * Creates a clone of `wrapper`.\n *\n * @private\n * @param {Object} wrapper The wrapper to clone.\n * @returns {Object} Returns the cloned wrapper.\n */\n function wrapperClone(wrapper) {\n if (wrapper instanceof LazyWrapper) {\n return wrapper.clone();\n }\n var result = new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__);\n result.__actions__ = copyArray(wrapper.__actions__);\n result.__index__ = wrapper.__index__;\n result.__values__ = wrapper.__values__;\n return result;\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an array of elements split into groups the length of `size`.\n * If `array` can't be split evenly, the final chunk will be the remaining\n * elements.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to process.\n * @param {number} [size=1] The length of each chunk\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the new array of chunks.\n * @example\n *\n * _.chunk(['a', 'b', 'c', 'd'], 2);\n * // => [['a', 'b'], ['c', 'd']]\n *\n * _.chunk(['a', 'b', 'c', 'd'], 3);\n * // => [['a', 'b', 'c'], ['d']]\n */\n function chunk(array, size, guard) {\n if ((guard ? isIterateeCall(array, size, guard) : size === undefined)) {\n size = 1;\n } else {\n size = nativeMax(toInteger(size), 0);\n }\n var length = array == null ? 0 : array.length;\n if (!length || size < 1) {\n return [];\n }\n var index = 0,\n resIndex = 0,\n result = Array(nativeCeil(length / size));\n\n while (index < length) {\n result[resIndex++] = baseSlice(array, index, (index += size));\n }\n return result;\n }\n\n /**\n * Creates an array with all falsey values removed. The values `false`, `null`,\n * `0`, `\"\"`, `undefined`, and `NaN` are falsey.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to compact.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.compact([0, 1, false, 2, '', 3]);\n * // => [1, 2, 3]\n */\n function compact(array) {\n var index = -1,\n length = array == null ? 0 : array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (value) {\n result[resIndex++] = value;\n }\n }\n return result;\n }\n\n /**\n * Creates a new array concatenating `array` with any additional arrays\n * and/or values.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to concatenate.\n * @param {...*} [values] The values to concatenate.\n * @returns {Array} Returns the new concatenated array.\n * @example\n *\n * var array = [1];\n * var other = _.concat(array, 2, [3], [[4]]);\n *\n * console.log(other);\n * // => [1, 2, 3, [4]]\n *\n * console.log(array);\n * // => [1]\n */\n function concat() {\n var length = arguments.length;\n if (!length) {\n return [];\n }\n var args = Array(length - 1),\n array = arguments[0],\n index = length;\n\n while (index--) {\n args[index - 1] = arguments[index];\n }\n return arrayPush(isArray(array) ? copyArray(array) : [array], baseFlatten(args, 1));\n }\n\n /**\n * Creates an array of `array` values not included in the other given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * **Note:** Unlike `_.pullAll`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.without, _.xor\n * @example\n *\n * _.difference([2, 1], [2, 3]);\n * // => [1]\n */\n var difference = baseRest(function(array, values) {\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n : [];\n });\n\n /**\n * This method is like `_.difference` except that it accepts `iteratee` which\n * is invoked for each element of `array` and `values` to generate the criterion\n * by which they're compared. The order and references of result values are\n * determined by the first array. The iteratee is invoked with one argument:\n * (value).\n *\n * **Note:** Unlike `_.pullAllBy`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x');\n * // => [{ 'x': 2 }]\n */\n var differenceBy = baseRest(function(array, values) {\n var iteratee = last(values);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), getIteratee(iteratee, 2))\n : [];\n });\n\n /**\n * This method is like `_.difference` except that it accepts `comparator`\n * which is invoked to compare elements of `array` to `values`. The order and\n * references of result values are determined by the first array. The comparator\n * is invoked with two arguments: (arrVal, othVal).\n *\n * **Note:** Unlike `_.pullAllWith`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n *\n * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }]\n */\n var differenceWith = baseRest(function(array, values) {\n var comparator = last(values);\n if (isArrayLikeObject(comparator)) {\n comparator = undefined;\n }\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined, comparator)\n : [];\n });\n\n /**\n * Creates a slice of `array` with `n` elements dropped from the beginning.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.drop([1, 2, 3]);\n * // => [2, 3]\n *\n * _.drop([1, 2, 3], 2);\n * // => [3]\n *\n * _.drop([1, 2, 3], 5);\n * // => []\n *\n * _.drop([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\n function drop(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n return baseSlice(array, n < 0 ? 0 : n, length);\n }\n\n /**\n * Creates a slice of `array` with `n` elements dropped from the end.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.dropRight([1, 2, 3]);\n * // => [1, 2]\n *\n * _.dropRight([1, 2, 3], 2);\n * // => [1]\n *\n * _.dropRight([1, 2, 3], 5);\n * // => []\n *\n * _.dropRight([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\n function dropRight(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n n = length - n;\n return baseSlice(array, 0, n < 0 ? 0 : n);\n }\n\n /**\n * Creates a slice of `array` excluding elements dropped from the end.\n * Elements are dropped until `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.dropRightWhile(users, function(o) { return !o.active; });\n * // => objects for ['barney']\n *\n * // The `_.matches` iteratee shorthand.\n * _.dropRightWhile(users, { 'user': 'pebbles', 'active': false });\n * // => objects for ['barney', 'fred']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.dropRightWhile(users, ['active', false]);\n * // => objects for ['barney']\n *\n * // The `_.property` iteratee shorthand.\n * _.dropRightWhile(users, 'active');\n * // => objects for ['barney', 'fred', 'pebbles']\n */\n function dropRightWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), true, true)\n : [];\n }\n\n /**\n * Creates a slice of `array` excluding elements dropped from the beginning.\n * Elements are dropped until `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.dropWhile(users, function(o) { return !o.active; });\n * // => objects for ['pebbles']\n *\n * // The `_.matches` iteratee shorthand.\n * _.dropWhile(users, { 'user': 'barney', 'active': false });\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.dropWhile(users, ['active', false]);\n * // => objects for ['pebbles']\n *\n * // The `_.property` iteratee shorthand.\n * _.dropWhile(users, 'active');\n * // => objects for ['barney', 'fred', 'pebbles']\n */\n function dropWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), true)\n : [];\n }\n\n /**\n * Fills elements of `array` with `value` from `start` up to, but not\n * including, `end`.\n *\n * **Note:** This method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Array\n * @param {Array} array The array to fill.\n * @param {*} value The value to fill `array` with.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _.fill(array, 'a');\n * console.log(array);\n * // => ['a', 'a', 'a']\n *\n * _.fill(Array(3), 2);\n * // => [2, 2, 2]\n *\n * _.fill([4, 6, 8, 10], '*', 1, 3);\n * // => [4, '*', '*', 10]\n */\n function fill(array, value, start, end) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n if (start && typeof start != 'number' && isIterateeCall(array, value, start)) {\n start = 0;\n end = length;\n }\n return baseFill(array, value, start, end);\n }\n\n /**\n * This method is like `_.find` except that it returns the index of the first\n * element `predicate` returns truthy for instead of the element itself.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.findIndex(users, function(o) { return o.user == 'barney'; });\n * // => 0\n *\n * // The `_.matches` iteratee shorthand.\n * _.findIndex(users, { 'user': 'fred', 'active': false });\n * // => 1\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findIndex(users, ['active', false]);\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.findIndex(users, 'active');\n * // => 2\n */\n function findIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = fromIndex == null ? 0 : toInteger(fromIndex);\n if (index < 0) {\n index = nativeMax(length + index, 0);\n }\n return baseFindIndex(array, getIteratee(predicate, 3), index);\n }\n\n /**\n * This method is like `_.findIndex` except that it iterates over elements\n * of `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=array.length-1] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.findLastIndex(users, function(o) { return o.user == 'pebbles'; });\n * // => 2\n *\n * // The `_.matches` iteratee shorthand.\n * _.findLastIndex(users, { 'user': 'barney', 'active': true });\n * // => 0\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findLastIndex(users, ['active', false]);\n * // => 2\n *\n * // The `_.property` iteratee shorthand.\n * _.findLastIndex(users, 'active');\n * // => 0\n */\n function findLastIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = length - 1;\n if (fromIndex !== undefined) {\n index = toInteger(fromIndex);\n index = fromIndex < 0\n ? nativeMax(length + index, 0)\n : nativeMin(index, length - 1);\n }\n return baseFindIndex(array, getIteratee(predicate, 3), index, true);\n }\n\n /**\n * Flattens `array` a single level deep.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n */\n function flatten(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, 1) : [];\n }\n\n /**\n * Recursively flattens `array`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flattenDeep([1, [2, [3, [4]], 5]]);\n * // => [1, 2, 3, 4, 5]\n */\n function flattenDeep(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, INFINITY) : [];\n }\n\n /**\n * Recursively flatten `array` up to `depth` times.\n *\n * @static\n * @memberOf _\n * @since 4.4.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @param {number} [depth=1] The maximum recursion depth.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * var array = [1, [2, [3, [4]], 5]];\n *\n * _.flattenDepth(array, 1);\n * // => [1, 2, [3, [4]], 5]\n *\n * _.flattenDepth(array, 2);\n * // => [1, 2, 3, [4], 5]\n */\n function flattenDepth(array, depth) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n depth = depth === undefined ? 1 : toInteger(depth);\n return baseFlatten(array, depth);\n }\n\n /**\n * The inverse of `_.toPairs`; this method returns an object composed\n * from key-value `pairs`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} pairs The key-value pairs.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.fromPairs([['a', 1], ['b', 2]]);\n * // => { 'a': 1, 'b': 2 }\n */\n function fromPairs(pairs) {\n var index = -1,\n length = pairs == null ? 0 : pairs.length,\n result = {};\n\n while (++index < length) {\n var pair = pairs[index];\n result[pair[0]] = pair[1];\n }\n return result;\n }\n\n /**\n * Gets the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias first\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the first element of `array`.\n * @example\n *\n * _.head([1, 2, 3]);\n * // => 1\n *\n * _.head([]);\n * // => undefined\n */\n function head(array) {\n return (array && array.length) ? array[0] : undefined;\n }\n\n /**\n * Gets the index at which the first occurrence of `value` is found in `array`\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. If `fromIndex` is negative, it's used as the\n * offset from the end of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.indexOf([1, 2, 1, 2], 2);\n * // => 1\n *\n * // Search from the `fromIndex`.\n * _.indexOf([1, 2, 1, 2], 2, 2);\n * // => 3\n */\n function indexOf(array, value, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = fromIndex == null ? 0 : toInteger(fromIndex);\n if (index < 0) {\n index = nativeMax(length + index, 0);\n }\n return baseIndexOf(array, value, index);\n }\n\n /**\n * Gets all but the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.initial([1, 2, 3]);\n * // => [1, 2]\n */\n function initial(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseSlice(array, 0, -1) : [];\n }\n\n /**\n * Creates an array of unique values that are included in all given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersection([2, 1], [2, 3]);\n * // => [2]\n */\n var intersection = baseRest(function(arrays) {\n var mapped = arrayMap(arrays, castArrayLikeObject);\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped)\n : [];\n });\n\n /**\n * This method is like `_.intersection` except that it accepts `iteratee`\n * which is invoked for each element of each `arrays` to generate the criterion\n * by which they're compared. The order and references of result values are\n * determined by the first array. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [2.1]\n *\n * // The `_.property` iteratee shorthand.\n * _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }]\n */\n var intersectionBy = baseRest(function(arrays) {\n var iteratee = last(arrays),\n mapped = arrayMap(arrays, castArrayLikeObject);\n\n if (iteratee === last(mapped)) {\n iteratee = undefined;\n } else {\n mapped.pop();\n }\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped, getIteratee(iteratee, 2))\n : [];\n });\n\n /**\n * This method is like `_.intersection` except that it accepts `comparator`\n * which is invoked to compare elements of `arrays`. The order and references\n * of result values are determined by the first array. The comparator is\n * invoked with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.intersectionWith(objects, others, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }]\n */\n var intersectionWith = baseRest(function(arrays) {\n var comparator = last(arrays),\n mapped = arrayMap(arrays, castArrayLikeObject);\n\n comparator = typeof comparator == 'function' ? comparator : undefined;\n if (comparator) {\n mapped.pop();\n }\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped, undefined, comparator)\n : [];\n });\n\n /**\n * Converts all elements in `array` into a string separated by `separator`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to convert.\n * @param {string} [separator=','] The element separator.\n * @returns {string} Returns the joined string.\n * @example\n *\n * _.join(['a', 'b', 'c'], '~');\n * // => 'a~b~c'\n */\n function join(array, separator) {\n return array == null ? '' : nativeJoin.call(array, separator);\n }\n\n /**\n * Gets the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the last element of `array`.\n * @example\n *\n * _.last([1, 2, 3]);\n * // => 3\n */\n function last(array) {\n var length = array == null ? 0 : array.length;\n return length ? array[length - 1] : undefined;\n }\n\n /**\n * This method is like `_.indexOf` except that it iterates over elements of\n * `array` from right to left.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=array.length-1] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.lastIndexOf([1, 2, 1, 2], 2);\n * // => 3\n *\n * // Search from the `fromIndex`.\n * _.lastIndexOf([1, 2, 1, 2], 2, 2);\n * // => 1\n */\n function lastIndexOf(array, value, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = length;\n if (fromIndex !== undefined) {\n index = toInteger(fromIndex);\n index = index < 0 ? nativeMax(length + index, 0) : nativeMin(index, length - 1);\n }\n return value === value\n ? strictLastIndexOf(array, value, index)\n : baseFindIndex(array, baseIsNaN, index, true);\n }\n\n /**\n * Gets the element at index `n` of `array`. If `n` is negative, the nth\n * element from the end is returned.\n *\n * @static\n * @memberOf _\n * @since 4.11.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=0] The index of the element to return.\n * @returns {*} Returns the nth element of `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'd'];\n *\n * _.nth(array, 1);\n * // => 'b'\n *\n * _.nth(array, -2);\n * // => 'c';\n */\n function nth(array, n) {\n return (array && array.length) ? baseNth(array, toInteger(n)) : undefined;\n }\n\n /**\n * Removes all given values from `array` using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove`\n * to remove elements from an array by predicate.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {...*} [values] The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pull(array, 'a', 'c');\n * console.log(array);\n * // => ['b', 'b']\n */\n var pull = baseRest(pullAll);\n\n /**\n * This method is like `_.pull` except that it accepts an array of values to remove.\n *\n * **Note:** Unlike `_.difference`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pullAll(array, ['a', 'c']);\n * console.log(array);\n * // => ['b', 'b']\n */\n function pullAll(array, values) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values)\n : array;\n }\n\n /**\n * This method is like `_.pullAll` except that it accepts `iteratee` which is\n * invoked for each element of `array` and `values` to generate the criterion\n * by which they're compared. The iteratee is invoked with one argument: (value).\n *\n * **Note:** Unlike `_.differenceBy`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }];\n *\n * _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x');\n * console.log(array);\n * // => [{ 'x': 2 }]\n */\n function pullAllBy(array, values, iteratee) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values, getIteratee(iteratee, 2))\n : array;\n }\n\n /**\n * This method is like `_.pullAll` except that it accepts `comparator` which\n * is invoked to compare elements of `array` to `values`. The comparator is\n * invoked with two arguments: (arrVal, othVal).\n *\n * **Note:** Unlike `_.differenceWith`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }];\n *\n * _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual);\n * console.log(array);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }]\n */\n function pullAllWith(array, values, comparator) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values, undefined, comparator)\n : array;\n }\n\n /**\n * Removes elements from `array` corresponding to `indexes` and returns an\n * array of removed elements.\n *\n * **Note:** Unlike `_.at`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {...(number|number[])} [indexes] The indexes of elements to remove.\n * @returns {Array} Returns the new array of removed elements.\n * @example\n *\n * var array = ['a', 'b', 'c', 'd'];\n * var pulled = _.pullAt(array, [1, 3]);\n *\n * console.log(array);\n * // => ['a', 'c']\n *\n * console.log(pulled);\n * // => ['b', 'd']\n */\n var pullAt = flatRest(function(array, indexes) {\n var length = array == null ? 0 : array.length,\n result = baseAt(array, indexes);\n\n basePullAt(array, arrayMap(indexes, function(index) {\n return isIndex(index, length) ? +index : index;\n }).sort(compareAscending));\n\n return result;\n });\n\n /**\n * Removes all elements from `array` that `predicate` returns truthy for\n * and returns an array of the removed elements. The predicate is invoked\n * with three arguments: (value, index, array).\n *\n * **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull`\n * to pull elements from an array by value.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new array of removed elements.\n * @example\n *\n * var array = [1, 2, 3, 4];\n * var evens = _.remove(array, function(n) {\n * return n % 2 == 0;\n * });\n *\n * console.log(array);\n * // => [1, 3]\n *\n * console.log(evens);\n * // => [2, 4]\n */\n function remove(array, predicate) {\n var result = [];\n if (!(array && array.length)) {\n return result;\n }\n var index = -1,\n indexes = [],\n length = array.length;\n\n predicate = getIteratee(predicate, 3);\n while (++index < length) {\n var value = array[index];\n if (predicate(value, index, array)) {\n result.push(value);\n indexes.push(index);\n }\n }\n basePullAt(array, indexes);\n return result;\n }\n\n /**\n * Reverses `array` so that the first element becomes the last, the second\n * element becomes the second to last, and so on.\n *\n * **Note:** This method mutates `array` and is based on\n * [`Array#reverse`](https://mdn.io/Array/reverse).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _.reverse(array);\n * // => [3, 2, 1]\n *\n * console.log(array);\n * // => [3, 2, 1]\n */\n function reverse(array) {\n return array == null ? array : nativeReverse.call(array);\n }\n\n /**\n * Creates a slice of `array` from `start` up to, but not including, `end`.\n *\n * **Note:** This method is used instead of\n * [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are\n * returned.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\n function slice(array, start, end) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n if (end && typeof end != 'number' && isIterateeCall(array, start, end)) {\n start = 0;\n end = length;\n }\n else {\n start = start == null ? 0 : toInteger(start);\n end = end === undefined ? length : toInteger(end);\n }\n return baseSlice(array, start, end);\n }\n\n /**\n * Uses a binary search to determine the lowest index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * _.sortedIndex([30, 50], 40);\n * // => 1\n */\n function sortedIndex(array, value) {\n return baseSortedIndex(array, value);\n }\n\n /**\n * This method is like `_.sortedIndex` except that it accepts `iteratee`\n * which is invoked for `value` and each element of `array` to compute their\n * sort ranking. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * var objects = [{ 'x': 4 }, { 'x': 5 }];\n *\n * _.sortedIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.sortedIndexBy(objects, { 'x': 4 }, 'x');\n * // => 0\n */\n function sortedIndexBy(array, value, iteratee) {\n return baseSortedIndexBy(array, value, getIteratee(iteratee, 2));\n }\n\n /**\n * This method is like `_.indexOf` except that it performs a binary\n * search on a sorted `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.sortedIndexOf([4, 5, 5, 5, 6], 5);\n * // => 1\n */\n function sortedIndexOf(array, value) {\n var length = array == null ? 0 : array.length;\n if (length) {\n var index = baseSortedIndex(array, value);\n if (index < length && eq(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * This method is like `_.sortedIndex` except that it returns the highest\n * index at which `value` should be inserted into `array` in order to\n * maintain its sort order.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * _.sortedLastIndex([4, 5, 5, 5, 6], 5);\n * // => 4\n */\n function sortedLastIndex(array, value) {\n return baseSortedIndex(array, value, true);\n }\n\n /**\n * This method is like `_.sortedLastIndex` except that it accepts `iteratee`\n * which is invoked for `value` and each element of `array` to compute their\n * sort ranking. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * var objects = [{ 'x': 4 }, { 'x': 5 }];\n *\n * _.sortedLastIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n * // => 1\n *\n * // The `_.property` iteratee shorthand.\n * _.sortedLastIndexBy(objects, { 'x': 4 }, 'x');\n * // => 1\n */\n function sortedLastIndexBy(array, value, iteratee) {\n return baseSortedIndexBy(array, value, getIteratee(iteratee, 2), true);\n }\n\n /**\n * This method is like `_.lastIndexOf` except that it performs a binary\n * search on a sorted `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.sortedLastIndexOf([4, 5, 5, 5, 6], 5);\n * // => 3\n */\n function sortedLastIndexOf(array, value) {\n var length = array == null ? 0 : array.length;\n if (length) {\n var index = baseSortedIndex(array, value, true) - 1;\n if (eq(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * This method is like `_.uniq` except that it's designed and optimized\n * for sorted arrays.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.sortedUniq([1, 1, 2]);\n * // => [1, 2]\n */\n function sortedUniq(array) {\n return (array && array.length)\n ? baseSortedUniq(array)\n : [];\n }\n\n /**\n * This method is like `_.uniqBy` except that it's designed and optimized\n * for sorted arrays.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor);\n * // => [1.1, 2.3]\n */\n function sortedUniqBy(array, iteratee) {\n return (array && array.length)\n ? baseSortedUniq(array, getIteratee(iteratee, 2))\n : [];\n }\n\n /**\n * Gets all but the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.tail([1, 2, 3]);\n * // => [2, 3]\n */\n function tail(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseSlice(array, 1, length) : [];\n }\n\n /**\n * Creates a slice of `array` with `n` elements taken from the beginning.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to take.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.take([1, 2, 3]);\n * // => [1]\n *\n * _.take([1, 2, 3], 2);\n * // => [1, 2]\n *\n * _.take([1, 2, 3], 5);\n * // => [1, 2, 3]\n *\n * _.take([1, 2, 3], 0);\n * // => []\n */\n function take(array, n, guard) {\n if (!(array && array.length)) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n return baseSlice(array, 0, n < 0 ? 0 : n);\n }\n\n /**\n * Creates a slice of `array` with `n` elements taken from the end.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to take.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.takeRight([1, 2, 3]);\n * // => [3]\n *\n * _.takeRight([1, 2, 3], 2);\n * // => [2, 3]\n *\n * _.takeRight([1, 2, 3], 5);\n * // => [1, 2, 3]\n *\n * _.takeRight([1, 2, 3], 0);\n * // => []\n */\n function takeRight(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n n = length - n;\n return baseSlice(array, n < 0 ? 0 : n, length);\n }\n\n /**\n * Creates a slice of `array` with elements taken from the end. Elements are\n * taken until `predicate` returns falsey. The predicate is invoked with\n * three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.takeRightWhile(users, function(o) { return !o.active; });\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.matches` iteratee shorthand.\n * _.takeRightWhile(users, { 'user': 'pebbles', 'active': false });\n * // => objects for ['pebbles']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.takeRightWhile(users, ['active', false]);\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.property` iteratee shorthand.\n * _.takeRightWhile(users, 'active');\n * // => []\n */\n function takeRightWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), false, true)\n : [];\n }\n\n /**\n * Creates a slice of `array` with elements taken from the beginning. Elements\n * are taken until `predicate` returns falsey. The predicate is invoked with\n * three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.takeWhile(users, function(o) { return !o.active; });\n * // => objects for ['barney', 'fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.takeWhile(users, { 'user': 'barney', 'active': false });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.takeWhile(users, ['active', false]);\n * // => objects for ['barney', 'fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.takeWhile(users, 'active');\n * // => []\n */\n function takeWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3))\n : [];\n }\n\n /**\n * Creates an array of unique values, in order, from all given arrays using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.union([2], [1, 2]);\n * // => [2, 1]\n */\n var union = baseRest(function(arrays) {\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n });\n\n /**\n * This method is like `_.union` except that it accepts `iteratee` which is\n * invoked for each element of each `arrays` to generate the criterion by\n * which uniqueness is computed. Result values are chosen from the first\n * array in which the value occurs. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.unionBy([2.1], [1.2, 2.3], Math.floor);\n * // => [2.1, 1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }, { 'x': 2 }]\n */\n var unionBy = baseRest(function(arrays) {\n var iteratee = last(arrays);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), getIteratee(iteratee, 2));\n });\n\n /**\n * This method is like `_.union` except that it accepts `comparator` which\n * is invoked to compare elements of `arrays`. Result values are chosen from\n * the first array in which the value occurs. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.unionWith(objects, others, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\n var unionWith = baseRest(function(arrays) {\n var comparator = last(arrays);\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), undefined, comparator);\n });\n\n /**\n * Creates a duplicate-free version of an array, using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons, in which only the first occurrence of each element\n * is kept. The order of result values is determined by the order they occur\n * in the array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniq([2, 1, 2]);\n * // => [2, 1]\n */\n function uniq(array) {\n return (array && array.length) ? baseUniq(array) : [];\n }\n\n /**\n * This method is like `_.uniq` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * uniqueness is computed. The order of result values is determined by the\n * order they occur in the array. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniqBy([2.1, 1.2, 2.3], Math.floor);\n * // => [2.1, 1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }, { 'x': 2 }]\n */\n function uniqBy(array, iteratee) {\n return (array && array.length) ? baseUniq(array, getIteratee(iteratee, 2)) : [];\n }\n\n /**\n * This method is like `_.uniq` except that it accepts `comparator` which\n * is invoked to compare elements of `array`. The order of result values is\n * determined by the order they occur in the array.The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.uniqWith(objects, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]\n */\n function uniqWith(array, comparator) {\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return (array && array.length) ? baseUniq(array, undefined, comparator) : [];\n }\n\n /**\n * This method is like `_.zip` except that it accepts an array of grouped\n * elements and creates an array regrouping the elements to their pre-zip\n * configuration.\n *\n * @static\n * @memberOf _\n * @since 1.2.0\n * @category Array\n * @param {Array} array The array of grouped elements to process.\n * @returns {Array} Returns the new array of regrouped elements.\n * @example\n *\n * var zipped = _.zip(['a', 'b'], [1, 2], [true, false]);\n * // => [['a', 1, true], ['b', 2, false]]\n *\n * _.unzip(zipped);\n * // => [['a', 'b'], [1, 2], [true, false]]\n */\n function unzip(array) {\n if (!(array && array.length)) {\n return [];\n }\n var length = 0;\n array = arrayFilter(array, function(group) {\n if (isArrayLikeObject(group)) {\n length = nativeMax(group.length, length);\n return true;\n }\n });\n return baseTimes(length, function(index) {\n return arrayMap(array, baseProperty(index));\n });\n }\n\n /**\n * This method is like `_.unzip` except that it accepts `iteratee` to specify\n * how regrouped values should be combined. The iteratee is invoked with the\n * elements of each group: (...group).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Array\n * @param {Array} array The array of grouped elements to process.\n * @param {Function} [iteratee=_.identity] The function to combine\n * regrouped values.\n * @returns {Array} Returns the new array of regrouped elements.\n * @example\n *\n * var zipped = _.zip([1, 2], [10, 20], [100, 200]);\n * // => [[1, 10, 100], [2, 20, 200]]\n *\n * _.unzipWith(zipped, _.add);\n * // => [3, 30, 300]\n */\n function unzipWith(array, iteratee) {\n if (!(array && array.length)) {\n return [];\n }\n var result = unzip(array);\n if (iteratee == null) {\n return result;\n }\n return arrayMap(result, function(group) {\n return apply(iteratee, undefined, group);\n });\n }\n\n /**\n * Creates an array excluding all given values using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * **Note:** Unlike `_.pull`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...*} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.difference, _.xor\n * @example\n *\n * _.without([2, 1, 2, 3], 1, 2);\n * // => [3]\n */\n var without = baseRest(function(array, values) {\n return isArrayLikeObject(array)\n ? baseDifference(array, values)\n : [];\n });\n\n /**\n * Creates an array of unique values that is the\n * [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)\n * of the given arrays. The order of result values is determined by the order\n * they occur in the arrays.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.difference, _.without\n * @example\n *\n * _.xor([2, 1], [2, 3]);\n * // => [1, 3]\n */\n var xor = baseRest(function(arrays) {\n return baseXor(arrayFilter(arrays, isArrayLikeObject));\n });\n\n /**\n * This method is like `_.xor` except that it accepts `iteratee` which is\n * invoked for each element of each `arrays` to generate the criterion by\n * which by which they're compared. The order of result values is determined\n * by the order they occur in the arrays. The iteratee is invoked with one\n * argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.xorBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [1.2, 3.4]\n *\n * // The `_.property` iteratee shorthand.\n * _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 2 }]\n */\n var xorBy = baseRest(function(arrays) {\n var iteratee = last(arrays);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return baseXor(arrayFilter(arrays, isArrayLikeObject), getIteratee(iteratee, 2));\n });\n\n /**\n * This method is like `_.xor` except that it accepts `comparator` which is\n * invoked to compare elements of `arrays`. The order of result values is\n * determined by the order they occur in the arrays. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.xorWith(objects, others, _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\n var xorWith = baseRest(function(arrays) {\n var comparator = last(arrays);\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);\n });\n\n /**\n * Creates an array of grouped elements, the first of which contains the\n * first elements of the given arrays, the second of which contains the\n * second elements of the given arrays, and so on.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to process.\n * @returns {Array} Returns the new array of grouped elements.\n * @example\n *\n * _.zip(['a', 'b'], [1, 2], [true, false]);\n * // => [['a', 1, true], ['b', 2, false]]\n */\n var zip = baseRest(unzip);\n\n /**\n * This method is like `_.fromPairs` except that it accepts two arrays,\n * one of property identifiers and one of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 0.4.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObject(['a', 'b'], [1, 2]);\n * // => { 'a': 1, 'b': 2 }\n */\n function zipObject(props, values) {\n return baseZipObject(props || [], values || [], assignValue);\n }\n\n /**\n * This method is like `_.zipObject` except that it supports property paths.\n *\n * @static\n * @memberOf _\n * @since 4.1.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]);\n * // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } }\n */\n function zipObjectDeep(props, values) {\n return baseZipObject(props || [], values || [], baseSet);\n }\n\n /**\n * This method is like `_.zip` except that it accepts `iteratee` to specify\n * how grouped values should be combined. The iteratee is invoked with the\n * elements of each group: (...group).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Array\n * @param {...Array} [arrays] The arrays to process.\n * @param {Function} [iteratee=_.identity] The function to combine\n * grouped values.\n * @returns {Array} Returns the new array of grouped elements.\n * @example\n *\n * _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) {\n * return a + b + c;\n * });\n * // => [111, 222]\n */\n var zipWith = baseRest(function(arrays) {\n var length = arrays.length,\n iteratee = length > 1 ? arrays[length - 1] : undefined;\n\n iteratee = typeof iteratee == 'function' ? (arrays.pop(), iteratee) : undefined;\n return unzipWith(arrays, iteratee);\n });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a `lodash` wrapper instance that wraps `value` with explicit method\n * chain sequences enabled. The result of such sequences must be unwrapped\n * with `_#value`.\n *\n * @static\n * @memberOf _\n * @since 1.3.0\n * @category Seq\n * @param {*} value The value to wrap.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 40 },\n * { 'user': 'pebbles', 'age': 1 }\n * ];\n *\n * var youngest = _\n * .chain(users)\n * .sortBy('age')\n * .map(function(o) {\n * return o.user + ' is ' + o.age;\n * })\n * .head()\n * .value();\n * // => 'pebbles is 1'\n */\n function chain(value) {\n var result = lodash(value);\n result.__chain__ = true;\n return result;\n }\n\n /**\n * This method invokes `interceptor` and returns `value`. The interceptor\n * is invoked with one argument; (value). The purpose of this method is to\n * \"tap into\" a method chain sequence in order to modify intermediate results.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @param {*} value The value to provide to `interceptor`.\n * @param {Function} interceptor The function to invoke.\n * @returns {*} Returns `value`.\n * @example\n *\n * _([1, 2, 3])\n * .tap(function(array) {\n * // Mutate input array.\n * array.pop();\n * })\n * .reverse()\n * .value();\n * // => [2, 1]\n */\n function tap(value, interceptor) {\n interceptor(value);\n return value;\n }\n\n /**\n * This method is like `_.tap` except that it returns the result of `interceptor`.\n * The purpose of this method is to \"pass thru\" values replacing intermediate\n * results in a method chain sequence.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Seq\n * @param {*} value The value to provide to `interceptor`.\n * @param {Function} interceptor The function to invoke.\n * @returns {*} Returns the result of `interceptor`.\n * @example\n *\n * _(' abc ')\n * .chain()\n * .trim()\n * .thru(function(value) {\n * return [value];\n * })\n * .value();\n * // => ['abc']\n */\n function thru(value, interceptor) {\n return interceptor(value);\n }\n\n /**\n * This method is the wrapper version of `_.at`.\n *\n * @name at\n * @memberOf _\n * @since 1.0.0\n * @category Seq\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n *\n * _(object).at(['a[0].b.c', 'a[1]']).value();\n * // => [3, 4]\n */\n var wrapperAt = flatRest(function(paths) {\n var length = paths.length,\n start = length ? paths[0] : 0,\n value = this.__wrapped__,\n interceptor = function(object) { return baseAt(object, paths); };\n\n if (length > 1 || this.__actions__.length ||\n !(value instanceof LazyWrapper) || !isIndex(start)) {\n return this.thru(interceptor);\n }\n value = value.slice(start, +start + (length ? 1 : 0));\n value.__actions__.push({\n 'func': thru,\n 'args': [interceptor],\n 'thisArg': undefined\n });\n return new LodashWrapper(value, this.__chain__).thru(function(array) {\n if (length && !array.length) {\n array.push(undefined);\n }\n return array;\n });\n });\n\n /**\n * Creates a `lodash` wrapper instance with explicit method chain sequences enabled.\n *\n * @name chain\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 40 }\n * ];\n *\n * // A sequence without explicit chaining.\n * _(users).head();\n * // => { 'user': 'barney', 'age': 36 }\n *\n * // A sequence with explicit chaining.\n * _(users)\n * .chain()\n * .head()\n * .pick('user')\n * .value();\n * // => { 'user': 'barney' }\n */\n function wrapperChain() {\n return chain(this);\n }\n\n /**\n * Executes the chain sequence and returns the wrapped result.\n *\n * @name commit\n * @memberOf _\n * @since 3.2.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var array = [1, 2];\n * var wrapped = _(array).push(3);\n *\n * console.log(array);\n * // => [1, 2]\n *\n * wrapped = wrapped.commit();\n * console.log(array);\n * // => [1, 2, 3]\n *\n * wrapped.last();\n * // => 3\n *\n * console.log(array);\n * // => [1, 2, 3]\n */\n function wrapperCommit() {\n return new LodashWrapper(this.value(), this.__chain__);\n }\n\n /**\n * Gets the next value on a wrapped object following the\n * [iterator protocol](https://mdn.io/iteration_protocols#iterator).\n *\n * @name next\n * @memberOf _\n * @since 4.0.0\n * @category Seq\n * @returns {Object} Returns the next iterator value.\n * @example\n *\n * var wrapped = _([1, 2]);\n *\n * wrapped.next();\n * // => { 'done': false, 'value': 1 }\n *\n * wrapped.next();\n * // => { 'done': false, 'value': 2 }\n *\n * wrapped.next();\n * // => { 'done': true, 'value': undefined }\n */\n function wrapperNext() {\n if (this.__values__ === undefined) {\n this.__values__ = toArray(this.value());\n }\n var done = this.__index__ >= this.__values__.length,\n value = done ? undefined : this.__values__[this.__index__++];\n\n return { 'done': done, 'value': value };\n }\n\n /**\n * Enables the wrapper to be iterable.\n *\n * @name Symbol.iterator\n * @memberOf _\n * @since 4.0.0\n * @category Seq\n * @returns {Object} Returns the wrapper object.\n * @example\n *\n * var wrapped = _([1, 2]);\n *\n * wrapped[Symbol.iterator]() === wrapped;\n * // => true\n *\n * Array.from(wrapped);\n * // => [1, 2]\n */\n function wrapperToIterator() {\n return this;\n }\n\n /**\n * Creates a clone of the chain sequence planting `value` as the wrapped value.\n *\n * @name plant\n * @memberOf _\n * @since 3.2.0\n * @category Seq\n * @param {*} value The value to plant.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var wrapped = _([1, 2]).map(square);\n * var other = wrapped.plant([3, 4]);\n *\n * other.value();\n * // => [9, 16]\n *\n * wrapped.value();\n * // => [1, 4]\n */\n function wrapperPlant(value) {\n var result,\n parent = this;\n\n while (parent instanceof baseLodash) {\n var clone = wrapperClone(parent);\n clone.__index__ = 0;\n clone.__values__ = undefined;\n if (result) {\n previous.__wrapped__ = clone;\n } else {\n result = clone;\n }\n var previous = clone;\n parent = parent.__wrapped__;\n }\n previous.__wrapped__ = value;\n return result;\n }\n\n /**\n * This method is the wrapper version of `_.reverse`.\n *\n * **Note:** This method mutates the wrapped array.\n *\n * @name reverse\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _(array).reverse().value()\n * // => [3, 2, 1]\n *\n * console.log(array);\n * // => [3, 2, 1]\n */\n function wrapperReverse() {\n var value = this.__wrapped__;\n if (value instanceof LazyWrapper) {\n var wrapped = value;\n if (this.__actions__.length) {\n wrapped = new LazyWrapper(this);\n }\n wrapped = wrapped.reverse();\n wrapped.__actions__.push({\n 'func': thru,\n 'args': [reverse],\n 'thisArg': undefined\n });\n return new LodashWrapper(wrapped, this.__chain__);\n }\n return this.thru(reverse);\n }\n\n /**\n * Executes the chain sequence to resolve the unwrapped value.\n *\n * @name value\n * @memberOf _\n * @since 0.1.0\n * @alias toJSON, valueOf\n * @category Seq\n * @returns {*} Returns the resolved unwrapped value.\n * @example\n *\n * _([1, 2, 3]).value();\n * // => [1, 2, 3]\n */\n function wrapperValue() {\n return baseWrapperValue(this.__wrapped__, this.__actions__);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The corresponding value of\n * each key is the number of times the key was returned by `iteratee`. The\n * iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * _.countBy([6.1, 4.2, 6.3], Math.floor);\n * // => { '4': 1, '6': 2 }\n *\n * // The `_.property` iteratee shorthand.\n * _.countBy(['one', 'two', 'three'], 'length');\n * // => { '3': 2, '5': 1 }\n */\n var countBy = createAggregator(function(result, value, key) {\n if (hasOwnProperty.call(result, key)) {\n ++result[key];\n } else {\n baseAssignValue(result, key, 1);\n }\n });\n\n /**\n * Checks if `predicate` returns truthy for **all** elements of `collection`.\n * Iteration is stopped once `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index|key, collection).\n *\n * **Note:** This method returns `true` for\n * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because\n * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of\n * elements of empty collections.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`.\n * @example\n *\n * _.every([true, 1, null, 'yes'], Boolean);\n * // => false\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.every(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.every(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.every(users, 'active');\n * // => false\n */\n function every(collection, predicate, guard) {\n var func = isArray(collection) ? arrayEvery : baseEvery;\n if (guard && isIterateeCall(collection, predicate, guard)) {\n predicate = undefined;\n }\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Iterates over elements of `collection`, returning an array of all elements\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * **Note:** Unlike `_.remove`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.reject\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n *\n * _.filter(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.filter(users, { 'age': 36, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.filter(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.filter(users, 'active');\n * // => objects for ['barney']\n *\n * // Combining several predicates using `_.overEvery` or `_.overSome`.\n * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));\n * // => objects for ['fred', 'barney']\n */\n function filter(collection, predicate) {\n var func = isArray(collection) ? arrayFilter : baseFilter;\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Iterates over elements of `collection`, returning the first element\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false },\n * { 'user': 'pebbles', 'age': 1, 'active': true }\n * ];\n *\n * _.find(users, function(o) { return o.age < 40; });\n * // => object for 'barney'\n *\n * // The `_.matches` iteratee shorthand.\n * _.find(users, { 'age': 1, 'active': true });\n * // => object for 'pebbles'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.find(users, ['active', false]);\n * // => object for 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.find(users, 'active');\n * // => object for 'barney'\n */\n var find = createFind(findIndex);\n\n /**\n * This method is like `_.find` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=collection.length-1] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * _.findLast([1, 2, 3, 4], function(n) {\n * return n % 2 == 1;\n * });\n * // => 3\n */\n var findLast = createFind(findLastIndex);\n\n /**\n * Creates a flattened array of values by running each element in `collection`\n * thru `iteratee` and flattening the mapped results. The iteratee is invoked\n * with three arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [n, n];\n * }\n *\n * _.flatMap([1, 2], duplicate);\n * // => [1, 1, 2, 2]\n */\n function flatMap(collection, iteratee) {\n return baseFlatten(map(collection, iteratee), 1);\n }\n\n /**\n * This method is like `_.flatMap` except that it recursively flattens the\n * mapped results.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [[[n, n]]];\n * }\n *\n * _.flatMapDeep([1, 2], duplicate);\n * // => [1, 1, 2, 2]\n */\n function flatMapDeep(collection, iteratee) {\n return baseFlatten(map(collection, iteratee), INFINITY);\n }\n\n /**\n * This method is like `_.flatMap` except that it recursively flattens the\n * mapped results up to `depth` times.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {number} [depth=1] The maximum recursion depth.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [[[n, n]]];\n * }\n *\n * _.flatMapDepth([1, 2], duplicate, 2);\n * // => [[1, 1], [2, 2]]\n */\n function flatMapDepth(collection, iteratee, depth) {\n depth = depth === undefined ? 1 : toInteger(depth);\n return baseFlatten(map(collection, iteratee), depth);\n }\n\n /**\n * Iterates over elements of `collection` and invokes `iteratee` for each element.\n * The iteratee is invoked with three arguments: (value, index|key, collection).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * **Note:** As with other \"Collections\" methods, objects with a \"length\"\n * property are iterated like arrays. To avoid this behavior use `_.forIn`\n * or `_.forOwn` for object iteration.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias each\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEachRight\n * @example\n *\n * _.forEach([1, 2], function(value) {\n * console.log(value);\n * });\n * // => Logs `1` then `2`.\n *\n * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\n function forEach(collection, iteratee) {\n var func = isArray(collection) ? arrayEach : baseEach;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.forEach` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @alias eachRight\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEach\n * @example\n *\n * _.forEachRight([1, 2], function(value) {\n * console.log(value);\n * });\n * // => Logs `2` then `1`.\n */\n function forEachRight(collection, iteratee) {\n var func = isArray(collection) ? arrayEachRight : baseEachRight;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The order of grouped values\n * is determined by the order they occur in `collection`. The corresponding\n * value of each key is an array of elements responsible for generating the\n * key. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * _.groupBy([6.1, 4.2, 6.3], Math.floor);\n * // => { '4': [4.2], '6': [6.1, 6.3] }\n *\n * // The `_.property` iteratee shorthand.\n * _.groupBy(['one', 'two', 'three'], 'length');\n * // => { '3': ['one', 'two'], '5': ['three'] }\n */\n var groupBy = createAggregator(function(result, value, key) {\n if (hasOwnProperty.call(result, key)) {\n result[key].push(value);\n } else {\n baseAssignValue(result, key, [value]);\n }\n });\n\n /**\n * Checks if `value` is in `collection`. If `collection` is a string, it's\n * checked for a substring of `value`, otherwise\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * is used for equality comparisons. If `fromIndex` is negative, it's used as\n * the offset from the end of `collection`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {boolean} Returns `true` if `value` is found, else `false`.\n * @example\n *\n * _.includes([1, 2, 3], 1);\n * // => true\n *\n * _.includes([1, 2, 3], 1, 2);\n * // => false\n *\n * _.includes({ 'a': 1, 'b': 2 }, 1);\n * // => true\n *\n * _.includes('abcd', 'bc');\n * // => true\n */\n function includes(collection, value, fromIndex, guard) {\n collection = isArrayLike(collection) ? collection : values(collection);\n fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;\n\n var length = collection.length;\n if (fromIndex < 0) {\n fromIndex = nativeMax(length + fromIndex, 0);\n }\n return isString(collection)\n ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)\n : (!!length && baseIndexOf(collection, value, fromIndex) > -1);\n }\n\n /**\n * Invokes the method at `path` of each element in `collection`, returning\n * an array of the results of each invoked method. Any additional arguments\n * are provided to each invoked method. If `path` is a function, it's invoked\n * for, and `this` bound to, each element in `collection`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Array|Function|string} path The path of the method to invoke or\n * the function invoked per iteration.\n * @param {...*} [args] The arguments to invoke each method with.\n * @returns {Array} Returns the array of results.\n * @example\n *\n * _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort');\n * // => [[1, 5, 7], [1, 2, 3]]\n *\n * _.invokeMap([123, 456], String.prototype.split, '');\n * // => [['1', '2', '3'], ['4', '5', '6']]\n */\n var invokeMap = baseRest(function(collection, path, args) {\n var index = -1,\n isFunc = typeof path == 'function',\n result = isArrayLike(collection) ? Array(collection.length) : [];\n\n baseEach(collection, function(value) {\n result[++index] = isFunc ? apply(path, value, args) : baseInvoke(value, path, args);\n });\n return result;\n });\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The corresponding value of\n * each key is the last element responsible for generating the key. The\n * iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * var array = [\n * { 'dir': 'left', 'code': 97 },\n * { 'dir': 'right', 'code': 100 }\n * ];\n *\n * _.keyBy(array, function(o) {\n * return String.fromCharCode(o.code);\n * });\n * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }\n *\n * _.keyBy(array, 'dir');\n * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }\n */\n var keyBy = createAggregator(function(result, value, key) {\n baseAssignValue(result, key, value);\n });\n\n /**\n * Creates an array of values by running each element in `collection` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n *\n * The guarded methods are:\n * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * _.map([4, 8], square);\n * // => [16, 64]\n *\n * _.map({ 'a': 4, 'b': 8 }, square);\n * // => [16, 64] (iteration order is not guaranteed)\n *\n * var users = [\n * { 'user': 'barney' },\n * { 'user': 'fred' }\n * ];\n *\n * // The `_.property` iteratee shorthand.\n * _.map(users, 'user');\n * // => ['barney', 'fred']\n */\n function map(collection, iteratee) {\n var func = isArray(collection) ? arrayMap : baseMap;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.sortBy` except that it allows specifying the sort\n * orders of the iteratees to sort by. If `orders` is unspecified, all values\n * are sorted in ascending order. Otherwise, specify an order of \"desc\" for\n * descending or \"asc\" for ascending sort order of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]]\n * The iteratees to sort by.\n * @param {string[]} [orders] The sort orders of `iteratees`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n * { 'user': 'fred', 'age': 48 },\n * { 'user': 'barney', 'age': 34 },\n * { 'user': 'fred', 'age': 40 },\n * { 'user': 'barney', 'age': 36 }\n * ];\n *\n * // Sort by `user` in ascending order and by `age` in descending order.\n * _.orderBy(users, ['user', 'age'], ['asc', 'desc']);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]\n */\n function orderBy(collection, iteratees, orders, guard) {\n if (collection == null) {\n return [];\n }\n if (!isArray(iteratees)) {\n iteratees = iteratees == null ? [] : [iteratees];\n }\n orders = guard ? undefined : orders;\n if (!isArray(orders)) {\n orders = orders == null ? [] : [orders];\n }\n return baseOrderBy(collection, iteratees, orders);\n }\n\n /**\n * Creates an array of elements split into two groups, the first of which\n * contains elements `predicate` returns truthy for, the second of which\n * contains elements `predicate` returns falsey for. The predicate is\n * invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the array of grouped elements.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': true },\n * { 'user': 'pebbles', 'age': 1, 'active': false }\n * ];\n *\n * _.partition(users, function(o) { return o.active; });\n * // => objects for [['fred'], ['barney', 'pebbles']]\n *\n * // The `_.matches` iteratee shorthand.\n * _.partition(users, { 'age': 1, 'active': false });\n * // => objects for [['pebbles'], ['barney', 'fred']]\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.partition(users, ['active', false]);\n * // => objects for [['barney', 'pebbles'], ['fred']]\n *\n * // The `_.property` iteratee shorthand.\n * _.partition(users, 'active');\n * // => objects for [['fred'], ['barney', 'pebbles']]\n */\n var partition = createAggregator(function(result, value, key) {\n result[key ? 0 : 1].push(value);\n }, function() { return [[], []]; });\n\n /**\n * Reduces `collection` to a value which is the accumulated result of running\n * each element in `collection` thru `iteratee`, where each successive\n * invocation is supplied the return value of the previous. If `accumulator`\n * is not given, the first element of `collection` is used as the initial\n * value. The iteratee is invoked with four arguments:\n * (accumulator, value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.reduce`, `_.reduceRight`, and `_.transform`.\n *\n * The guarded methods are:\n * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n * and `sortBy`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduceRight\n * @example\n *\n * _.reduce([1, 2], function(sum, n) {\n * return sum + n;\n * }, 0);\n * // => 3\n *\n * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n * (result[value] || (result[value] = [])).push(key);\n * return result;\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n */\n function reduce(collection, iteratee, accumulator) {\n var func = isArray(collection) ? arrayReduce : baseReduce,\n initAccum = arguments.length < 3;\n\n return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n }\n\n /**\n * This method is like `_.reduce` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduce\n * @example\n *\n * var array = [[0, 1], [2, 3], [4, 5]];\n *\n * _.reduceRight(array, function(flattened, other) {\n * return flattened.concat(other);\n * }, []);\n * // => [4, 5, 2, 3, 0, 1]\n */\n function reduceRight(collection, iteratee, accumulator) {\n var func = isArray(collection) ? arrayReduceRight : baseReduce,\n initAccum = arguments.length < 3;\n\n return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEachRight);\n }\n\n /**\n * The opposite of `_.filter`; this method returns the elements of `collection`\n * that `predicate` does **not** return truthy for.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.filter\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': true }\n * ];\n *\n * _.reject(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.reject(users, { 'age': 40, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.reject(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.reject(users, 'active');\n * // => objects for ['barney']\n */\n function reject(collection, predicate) {\n var func = isArray(collection) ? arrayFilter : baseFilter;\n return func(collection, negate(getIteratee(predicate, 3)));\n }\n\n /**\n * Gets a random element from `collection`.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to sample.\n * @returns {*} Returns the random element.\n * @example\n *\n * _.sample([1, 2, 3, 4]);\n * // => 2\n */\n function sample(collection) {\n var func = isArray(collection) ? arraySample : baseSample;\n return func(collection);\n }\n\n /**\n * Gets `n` random elements at unique keys from `collection` up to the\n * size of `collection`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to sample.\n * @param {number} [n=1] The number of elements to sample.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the random elements.\n * @example\n *\n * _.sampleSize([1, 2, 3], 2);\n * // => [3, 1]\n *\n * _.sampleSize([1, 2, 3], 4);\n * // => [2, 3, 1]\n */\n function sampleSize(collection, n, guard) {\n if ((guard ? isIterateeCall(collection, n, guard) : n === undefined)) {\n n = 1;\n } else {\n n = toInteger(n);\n }\n var func = isArray(collection) ? arraySampleSize : baseSampleSize;\n return func(collection, n);\n }\n\n /**\n * Creates an array of shuffled values, using a version of the\n * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to shuffle.\n * @returns {Array} Returns the new shuffled array.\n * @example\n *\n * _.shuffle([1, 2, 3, 4]);\n * // => [4, 1, 3, 2]\n */\n function shuffle(collection) {\n var func = isArray(collection) ? arrayShuffle : baseShuffle;\n return func(collection);\n }\n\n /**\n * Gets the size of `collection` by returning its length for array-like\n * values or the number of own enumerable string keyed properties for objects.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @returns {number} Returns the collection size.\n * @example\n *\n * _.size([1, 2, 3]);\n * // => 3\n *\n * _.size({ 'a': 1, 'b': 2 });\n * // => 2\n *\n * _.size('pebbles');\n * // => 7\n */\n function size(collection) {\n if (collection == null) {\n return 0;\n }\n if (isArrayLike(collection)) {\n return isString(collection) ? stringSize(collection) : collection.length;\n }\n var tag = getTag(collection);\n if (tag == mapTag || tag == setTag) {\n return collection.size;\n }\n return baseKeys(collection).length;\n }\n\n /**\n * Checks if `predicate` returns truthy for **any** element of `collection`.\n * Iteration is stopped once `predicate` returns truthy. The predicate is\n * invoked with three arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n * @example\n *\n * _.some([null, 0, 'yes', false], Boolean);\n * // => true\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.some(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.some(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.some(users, 'active');\n * // => true\n */\n function some(collection, predicate, guard) {\n var func = isArray(collection) ? arraySome : baseSome;\n if (guard && isIterateeCall(collection, predicate, guard)) {\n predicate = undefined;\n }\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Creates an array of elements, sorted in ascending order by the results of\n * running each element in a collection thru each iteratee. This method\n * performs a stable sort, that is, it preserves the original sort order of\n * equal elements. The iteratees are invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {...(Function|Function[])} [iteratees=[_.identity]]\n * The iteratees to sort by.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n * { 'user': 'fred', 'age': 48 },\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 30 },\n * { 'user': 'barney', 'age': 34 }\n * ];\n *\n * _.sortBy(users, [function(o) { return o.user; }]);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]\n *\n * _.sortBy(users, ['user', 'age']);\n * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]\n */\n var sortBy = baseRest(function(collection, iteratees) {\n if (collection == null) {\n return [];\n }\n var length = iteratees.length;\n if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {\n iteratees = [];\n } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {\n iteratees = [iteratees[0]];\n }\n return baseOrderBy(collection, baseFlatten(iteratees, 1), []);\n });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n * console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\n var now = ctxNow || function() {\n return root.Date.now();\n };\n\n /*------------------------------------------------------------------------*/\n\n /**\n * The opposite of `_.before`; this method creates a function that invokes\n * `func` once it's called `n` or more times.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {number} n The number of calls before `func` is invoked.\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * var saves = ['profile', 'settings'];\n *\n * var done = _.after(saves.length, function() {\n * console.log('done saving!');\n * });\n *\n * _.forEach(saves, function(type) {\n * asyncSave({ 'type': type, 'complete': done });\n * });\n * // => Logs 'done saving!' after the two async saves have completed.\n */\n function after(n, func) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n n = toInteger(n);\n return function() {\n if (--n < 1) {\n return func.apply(this, arguments);\n }\n };\n }\n\n /**\n * Creates a function that invokes `func`, with up to `n` arguments,\n * ignoring any additional arguments.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to cap arguments for.\n * @param {number} [n=func.length] The arity cap.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new capped function.\n * @example\n *\n * _.map(['6', '8', '10'], _.ary(parseInt, 1));\n * // => [6, 8, 10]\n */\n function ary(func, n, guard) {\n n = guard ? undefined : n;\n n = (func && n == null) ? func.length : n;\n return createWrap(func, WRAP_ARY_FLAG, undefined, undefined, undefined, undefined, n);\n }\n\n /**\n * Creates a function that invokes `func`, with the `this` binding and arguments\n * of the created function, while it's called less than `n` times. Subsequent\n * calls to the created function return the result of the last `func` invocation.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {number} n The number of calls at which `func` is no longer invoked.\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * jQuery(element).on('click', _.before(5, addContactToList));\n * // => Allows adding up to 4 contacts to the list.\n */\n function before(n, func) {\n var result;\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n n = toInteger(n);\n return function() {\n if (--n > 0) {\n result = func.apply(this, arguments);\n }\n if (n <= 1) {\n func = undefined;\n }\n return result;\n };\n }\n\n /**\n * Creates a function that invokes `func` with the `this` binding of `thisArg`\n * and `partials` prepended to the arguments it receives.\n *\n * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds,\n * may be used as a placeholder for partially applied arguments.\n *\n * **Note:** Unlike native `Function#bind`, this method doesn't set the \"length\"\n * property of bound functions.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to bind.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new bound function.\n * @example\n *\n * function greet(greeting, punctuation) {\n * return greeting + ' ' + this.user + punctuation;\n * }\n *\n * var object = { 'user': 'fred' };\n *\n * var bound = _.bind(greet, object, 'hi');\n * bound('!');\n * // => 'hi fred!'\n *\n * // Bound with placeholders.\n * var bound = _.bind(greet, object, _, '!');\n * bound('hi');\n * // => 'hi fred!'\n */\n var bind = baseRest(function(func, thisArg, partials) {\n var bitmask = WRAP_BIND_FLAG;\n if (partials.length) {\n var holders = replaceHolders(partials, getHolder(bind));\n bitmask |= WRAP_PARTIAL_FLAG;\n }\n return createWrap(func, bitmask, thisArg, partials, holders);\n });\n\n /**\n * Creates a function that invokes the method at `object[key]` with `partials`\n * prepended to the arguments it receives.\n *\n * This method differs from `_.bind` by allowing bound functions to reference\n * methods that may be redefined or don't yet exist. See\n * [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)\n * for more details.\n *\n * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * @static\n * @memberOf _\n * @since 0.10.0\n * @category Function\n * @param {Object} object The object to invoke the method on.\n * @param {string} key The key of the method.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new bound function.\n * @example\n *\n * var object = {\n * 'user': 'fred',\n * 'greet': function(greeting, punctuation) {\n * return greeting + ' ' + this.user + punctuation;\n * }\n * };\n *\n * var bound = _.bindKey(object, 'greet', 'hi');\n * bound('!');\n * // => 'hi fred!'\n *\n * object.greet = function(greeting, punctuation) {\n * return greeting + 'ya ' + this.user + punctuation;\n * };\n *\n * bound('!');\n * // => 'hiya fred!'\n *\n * // Bound with placeholders.\n * var bound = _.bindKey(object, 'greet', _, '!');\n * bound('hi');\n * // => 'hiya fred!'\n */\n var bindKey = baseRest(function(object, key, partials) {\n var bitmask = WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG;\n if (partials.length) {\n var holders = replaceHolders(partials, getHolder(bindKey));\n bitmask |= WRAP_PARTIAL_FLAG;\n }\n return createWrap(key, bitmask, object, partials, holders);\n });\n\n /**\n * Creates a function that accepts arguments of `func` and either invokes\n * `func` returning its result, if at least `arity` number of arguments have\n * been provided, or returns a function that accepts the remaining `func`\n * arguments, and so on. The arity of `func` may be specified if `func.length`\n * is not sufficient.\n *\n * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds,\n * may be used as a placeholder for provided arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of curried functions.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Function\n * @param {Function} func The function to curry.\n * @param {number} [arity=func.length] The arity of `func`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new curried function.\n * @example\n *\n * var abc = function(a, b, c) {\n * return [a, b, c];\n * };\n *\n * var curried = _.curry(abc);\n *\n * curried(1)(2)(3);\n * // => [1, 2, 3]\n *\n * curried(1, 2)(3);\n * // => [1, 2, 3]\n *\n * curried(1, 2, 3);\n * // => [1, 2, 3]\n *\n * // Curried with placeholders.\n * curried(1)(_, 3)(2);\n * // => [1, 2, 3]\n */\n function curry(func, arity, guard) {\n arity = guard ? undefined : arity;\n var result = createWrap(func, WRAP_CURRY_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n result.placeholder = curry.placeholder;\n return result;\n }\n\n /**\n * This method is like `_.curry` except that arguments are applied to `func`\n * in the manner of `_.partialRight` instead of `_.partial`.\n *\n * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for provided arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of curried functions.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to curry.\n * @param {number} [arity=func.length] The arity of `func`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new curried function.\n * @example\n *\n * var abc = function(a, b, c) {\n * return [a, b, c];\n * };\n *\n * var curried = _.curryRight(abc);\n *\n * curried(3)(2)(1);\n * // => [1, 2, 3]\n *\n * curried(2, 3)(1);\n * // => [1, 2, 3]\n *\n * curried(1, 2, 3);\n * // => [1, 2, 3]\n *\n * // Curried with placeholders.\n * curried(3)(1, _)(2);\n * // => [1, 2, 3]\n */\n function curryRight(func, arity, guard) {\n arity = guard ? undefined : arity;\n var result = createWrap(func, WRAP_CURRY_RIGHT_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n result.placeholder = curryRight.placeholder;\n return result;\n }\n\n /**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n * Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n * The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n * Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n * 'leading': true,\n * 'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\n function debounce(func, wait, options) {\n var lastArgs,\n lastThis,\n maxWait,\n result,\n timerId,\n lastCallTime,\n lastInvokeTime = 0,\n leading = false,\n maxing = false,\n trailing = true;\n\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n wait = toNumber(wait) || 0;\n if (isObject(options)) {\n leading = !!options.leading;\n maxing = 'maxWait' in options;\n maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n trailing = 'trailing' in options ? !!options.trailing : trailing;\n }\n\n function invokeFunc(time) {\n var args = lastArgs,\n thisArg = lastThis;\n\n lastArgs = lastThis = undefined;\n lastInvokeTime = time;\n result = func.apply(thisArg, args);\n return result;\n }\n\n function leadingEdge(time) {\n // Reset any `maxWait` timer.\n lastInvokeTime = time;\n // Start the timer for the trailing edge.\n timerId = setTimeout(timerExpired, wait);\n // Invoke the leading edge.\n return leading ? invokeFunc(time) : result;\n }\n\n function remainingWait(time) {\n var timeSinceLastCall = time - lastCallTime,\n timeSinceLastInvoke = time - lastInvokeTime,\n timeWaiting = wait - timeSinceLastCall;\n\n return maxing\n ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n : timeWaiting;\n }\n\n function shouldInvoke(time) {\n var timeSinceLastCall = time - lastCallTime,\n timeSinceLastInvoke = time - lastInvokeTime;\n\n // Either this is the first call, activity has stopped and we're at the\n // trailing edge, the system time has gone backwards and we're treating\n // it as the trailing edge, or we've hit the `maxWait` limit.\n return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n }\n\n function timerExpired() {\n var time = now();\n if (shouldInvoke(time)) {\n return trailingEdge(time);\n }\n // Restart the timer.\n timerId = setTimeout(timerExpired, remainingWait(time));\n }\n\n function trailingEdge(time) {\n timerId = undefined;\n\n // Only invoke if we have `lastArgs` which means `func` has been\n // debounced at least once.\n if (trailing && lastArgs) {\n return invokeFunc(time);\n }\n lastArgs = lastThis = undefined;\n return result;\n }\n\n function cancel() {\n if (timerId !== undefined) {\n clearTimeout(timerId);\n }\n lastInvokeTime = 0;\n lastArgs = lastCallTime = lastThis = timerId = undefined;\n }\n\n function flush() {\n return timerId === undefined ? result : trailingEdge(now());\n }\n\n function debounced() {\n var time = now(),\n isInvoking = shouldInvoke(time);\n\n lastArgs = arguments;\n lastThis = this;\n lastCallTime = time;\n\n if (isInvoking) {\n if (timerId === undefined) {\n return leadingEdge(lastCallTime);\n }\n if (maxing) {\n // Handle invocations in a tight loop.\n clearTimeout(timerId);\n timerId = setTimeout(timerExpired, wait);\n return invokeFunc(lastCallTime);\n }\n }\n if (timerId === undefined) {\n timerId = setTimeout(timerExpired, wait);\n }\n return result;\n }\n debounced.cancel = cancel;\n debounced.flush = flush;\n return debounced;\n }\n\n /**\n * Defers invoking the `func` until the current call stack has cleared. Any\n * additional arguments are provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to defer.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {number} Returns the timer id.\n * @example\n *\n * _.defer(function(text) {\n * console.log(text);\n * }, 'deferred');\n * // => Logs 'deferred' after one millisecond.\n */\n var defer = baseRest(function(func, args) {\n return baseDelay(func, 1, args);\n });\n\n /**\n * Invokes `func` after `wait` milliseconds. Any additional arguments are\n * provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {number} Returns the timer id.\n * @example\n *\n * _.delay(function(text) {\n * console.log(text);\n * }, 1000, 'later');\n * // => Logs 'later' after one second.\n */\n var delay = baseRest(function(func, wait, args) {\n return baseDelay(func, toNumber(wait) || 0, args);\n });\n\n /**\n * Creates a function that invokes `func` with arguments reversed.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to flip arguments for.\n * @returns {Function} Returns the new flipped function.\n * @example\n *\n * var flipped = _.flip(function() {\n * return _.toArray(arguments);\n * });\n *\n * flipped('a', 'b', 'c', 'd');\n * // => ['d', 'c', 'b', 'a']\n */\n function flip(func) {\n return createWrap(func, WRAP_FLIP_FLAG);\n }\n\n /**\n * Creates a function that memoizes the result of `func`. If `resolver` is\n * provided, it determines the cache key for storing the result based on the\n * arguments provided to the memoized function. By default, the first argument\n * provided to the memoized function is used as the map cache key. The `func`\n * is invoked with the `this` binding of the memoized function.\n *\n * **Note:** The cache is exposed as the `cache` property on the memoized\n * function. Its creation may be customized by replacing the `_.memoize.Cache`\n * constructor with one whose instances implement the\n * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to have its output memoized.\n * @param {Function} [resolver] The function to resolve the cache key.\n * @returns {Function} Returns the new memoized function.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n * var other = { 'c': 3, 'd': 4 };\n *\n * var values = _.memoize(_.values);\n * values(object);\n * // => [1, 2]\n *\n * values(other);\n * // => [3, 4]\n *\n * object.a = 2;\n * values(object);\n * // => [1, 2]\n *\n * // Modify the result cache.\n * values.cache.set(object, ['a', 'b']);\n * values(object);\n * // => ['a', 'b']\n *\n * // Replace `_.memoize.Cache`.\n * _.memoize.Cache = WeakMap;\n */\n function memoize(func, resolver) {\n if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n var memoized = function() {\n var args = arguments,\n key = resolver ? resolver.apply(this, args) : args[0],\n cache = memoized.cache;\n\n if (cache.has(key)) {\n return cache.get(key);\n }\n var result = func.apply(this, args);\n memoized.cache = cache.set(key, result) || cache;\n return result;\n };\n memoized.cache = new (memoize.Cache || MapCache);\n return memoized;\n }\n\n // Expose `MapCache`.\n memoize.Cache = MapCache;\n\n /**\n * Creates a function that negates the result of the predicate `func`. The\n * `func` predicate is invoked with the `this` binding and arguments of the\n * created function.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} predicate The predicate to negate.\n * @returns {Function} Returns the new negated function.\n * @example\n *\n * function isEven(n) {\n * return n % 2 == 0;\n * }\n *\n * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));\n * // => [1, 3, 5]\n */\n function negate(predicate) {\n if (typeof predicate != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n return function() {\n var args = arguments;\n switch (args.length) {\n case 0: return !predicate.call(this);\n case 1: return !predicate.call(this, args[0]);\n case 2: return !predicate.call(this, args[0], args[1]);\n case 3: return !predicate.call(this, args[0], args[1], args[2]);\n }\n return !predicate.apply(this, args);\n };\n }\n\n /**\n * Creates a function that is restricted to invoking `func` once. Repeat calls\n * to the function return the value of the first invocation. The `func` is\n * invoked with the `this` binding and arguments of the created function.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * var initialize = _.once(createApplication);\n * initialize();\n * initialize();\n * // => `createApplication` is invoked once\n */\n function once(func) {\n return before(2, func);\n }\n\n /**\n * Creates a function that invokes `func` with its arguments transformed.\n *\n * @static\n * @since 4.0.0\n * @memberOf _\n * @category Function\n * @param {Function} func The function to wrap.\n * @param {...(Function|Function[])} [transforms=[_.identity]]\n * The argument transforms.\n * @returns {Function} Returns the new function.\n * @example\n *\n * function doubled(n) {\n * return n * 2;\n * }\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var func = _.overArgs(function(x, y) {\n * return [x, y];\n * }, [square, doubled]);\n *\n * func(9, 3);\n * // => [81, 6]\n *\n * func(10, 5);\n * // => [100, 10]\n */\n var overArgs = castRest(function(func, transforms) {\n transforms = (transforms.length == 1 && isArray(transforms[0]))\n ? arrayMap(transforms[0], baseUnary(getIteratee()))\n : arrayMap(baseFlatten(transforms, 1), baseUnary(getIteratee()));\n\n var funcsLength = transforms.length;\n return baseRest(function(args) {\n var index = -1,\n length = nativeMin(args.length, funcsLength);\n\n while (++index < length) {\n args[index] = transforms[index].call(this, args[index]);\n }\n return apply(func, this, args);\n });\n });\n\n /**\n * Creates a function that invokes `func` with `partials` prepended to the\n * arguments it receives. This method is like `_.bind` except it does **not**\n * alter the `this` binding.\n *\n * The `_.partial.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of partially\n * applied functions.\n *\n * @static\n * @memberOf _\n * @since 0.2.0\n * @category Function\n * @param {Function} func The function to partially apply arguments to.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new partially applied function.\n * @example\n *\n * function greet(greeting, name) {\n * return greeting + ' ' + name;\n * }\n *\n * var sayHelloTo = _.partial(greet, 'hello');\n * sayHelloTo('fred');\n * // => 'hello fred'\n *\n * // Partially applied with placeholders.\n * var greetFred = _.partial(greet, _, 'fred');\n * greetFred('hi');\n * // => 'hi fred'\n */\n var partial = baseRest(function(func, partials) {\n var holders = replaceHolders(partials, getHolder(partial));\n return createWrap(func, WRAP_PARTIAL_FLAG, undefined, partials, holders);\n });\n\n /**\n * This method is like `_.partial` except that partially applied arguments\n * are appended to the arguments it receives.\n *\n * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of partially\n * applied functions.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Function\n * @param {Function} func The function to partially apply arguments to.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new partially applied function.\n * @example\n *\n * function greet(greeting, name) {\n * return greeting + ' ' + name;\n * }\n *\n * var greetFred = _.partialRight(greet, 'fred');\n * greetFred('hi');\n * // => 'hi fred'\n *\n * // Partially applied with placeholders.\n * var sayHelloTo = _.partialRight(greet, 'hello', _);\n * sayHelloTo('fred');\n * // => 'hello fred'\n */\n var partialRight = baseRest(function(func, partials) {\n var holders = replaceHolders(partials, getHolder(partialRight));\n return createWrap(func, WRAP_PARTIAL_RIGHT_FLAG, undefined, partials, holders);\n });\n\n /**\n * Creates a function that invokes `func` with arguments arranged according\n * to the specified `indexes` where the argument value at the first index is\n * provided as the first argument, the argument value at the second index is\n * provided as the second argument, and so on.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to rearrange arguments for.\n * @param {...(number|number[])} indexes The arranged argument indexes.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var rearged = _.rearg(function(a, b, c) {\n * return [a, b, c];\n * }, [2, 0, 1]);\n *\n * rearged('b', 'c', 'a')\n * // => ['a', 'b', 'c']\n */\n var rearg = flatRest(function(func, indexes) {\n return createWrap(func, WRAP_REARG_FLAG, undefined, undefined, undefined, indexes);\n });\n\n /**\n * Creates a function that invokes `func` with the `this` binding of the\n * created function and arguments from `start` and beyond provided as\n * an array.\n *\n * **Note:** This method is based on the\n * [rest parameter](https://mdn.io/rest_parameters).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var say = _.rest(function(what, names) {\n * return what + ' ' + _.initial(names).join(', ') +\n * (_.size(names) > 1 ? ', & ' : '') + _.last(names);\n * });\n *\n * say('hello', 'fred', 'barney', 'pebbles');\n * // => 'hello fred, barney, & pebbles'\n */\n function rest(func, start) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n start = start === undefined ? start : toInteger(start);\n return baseRest(func, start);\n }\n\n /**\n * Creates a function that invokes `func` with the `this` binding of the\n * create function and an array of arguments much like\n * [`Function#apply`](http://www.ecma-international.org/ecma-262/7.0/#sec-function.prototype.apply).\n *\n * **Note:** This method is based on the\n * [spread operator](https://mdn.io/spread_operator).\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Function\n * @param {Function} func The function to spread arguments over.\n * @param {number} [start=0] The start position of the spread.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var say = _.spread(function(who, what) {\n * return who + ' says ' + what;\n * });\n *\n * say(['fred', 'hello']);\n * // => 'fred says hello'\n *\n * var numbers = Promise.all([\n * Promise.resolve(40),\n * Promise.resolve(36)\n * ]);\n *\n * numbers.then(_.spread(function(x, y) {\n * return x + y;\n * }));\n * // => a Promise of 76\n */\n function spread(func, start) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n start = start == null ? 0 : nativeMax(toInteger(start), 0);\n return baseRest(function(args) {\n var array = args[start],\n otherArgs = castSlice(args, 0, start);\n\n if (array) {\n arrayPush(otherArgs, array);\n }\n return apply(func, this, otherArgs);\n });\n }\n\n /**\n * Creates a throttled function that only invokes `func` at most once per\n * every `wait` milliseconds. The throttled function comes with a `cancel`\n * method to cancel delayed `func` invocations and a `flush` method to\n * immediately invoke them. Provide `options` to indicate whether `func`\n * should be invoked on the leading and/or trailing edge of the `wait`\n * timeout. The `func` is invoked with the last arguments provided to the\n * throttled function. Subsequent calls to the throttled function return the\n * result of the last `func` invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the throttled function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.throttle` and `_.debounce`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to throttle.\n * @param {number} [wait=0] The number of milliseconds to throttle invocations to.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=true]\n * Specify invoking on the leading edge of the timeout.\n * @param {boolean} [options.trailing=true]\n * Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new throttled function.\n * @example\n *\n * // Avoid excessively updating the position while scrolling.\n * jQuery(window).on('scroll', _.throttle(updatePosition, 100));\n *\n * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.\n * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });\n * jQuery(element).on('click', throttled);\n *\n * // Cancel the trailing throttled invocation.\n * jQuery(window).on('popstate', throttled.cancel);\n */\n function throttle(func, wait, options) {\n var leading = true,\n trailing = true;\n\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n if (isObject(options)) {\n leading = 'leading' in options ? !!options.leading : leading;\n trailing = 'trailing' in options ? !!options.trailing : trailing;\n }\n return debounce(func, wait, {\n 'leading': leading,\n 'maxWait': wait,\n 'trailing': trailing\n });\n }\n\n /**\n * Creates a function that accepts up to one argument, ignoring any\n * additional arguments.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n * @example\n *\n * _.map(['6', '8', '10'], _.unary(parseInt));\n * // => [6, 8, 10]\n */\n function unary(func) {\n return ary(func, 1);\n }\n\n /**\n * Creates a function that provides `value` to `wrapper` as its first\n * argument. Any additional arguments provided to the function are appended\n * to those provided to the `wrapper`. The wrapper is invoked with the `this`\n * binding of the created function.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {*} value The value to wrap.\n * @param {Function} [wrapper=identity] The wrapper function.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var p = _.wrap(_.escape, function(func, text) {\n * return '

' + func(text) + '

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

fred, barney, & pebbles

'\n */\n function wrap(value, wrapper) {\n return partial(castFunction(wrapper), value);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Casts `value` as an array if it's not one.\n *\n * @static\n * @memberOf _\n * @since 4.4.0\n * @category Lang\n * @param {*} value The value to inspect.\n * @returns {Array} Returns the cast array.\n * @example\n *\n * _.castArray(1);\n * // => [1]\n *\n * _.castArray({ 'a': 1 });\n * // => [{ 'a': 1 }]\n *\n * _.castArray('abc');\n * // => ['abc']\n *\n * _.castArray(null);\n * // => [null]\n *\n * _.castArray(undefined);\n * // => [undefined]\n *\n * _.castArray();\n * // => []\n *\n * var array = [1, 2, 3];\n * console.log(_.castArray(array) === array);\n * // => true\n */\n function castArray() {\n if (!arguments.length) {\n return [];\n }\n var value = arguments[0];\n return isArray(value) ? value : [value];\n }\n\n /**\n * Creates a shallow clone of `value`.\n *\n * **Note:** This method is loosely based on the\n * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n * and supports cloning arrays, array buffers, booleans, date objects, maps,\n * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n * arrays. The own enumerable properties of `arguments` objects are cloned\n * as plain objects. An empty object is returned for uncloneable values such\n * as error objects, functions, DOM nodes, and WeakMaps.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to clone.\n * @returns {*} Returns the cloned value.\n * @see _.cloneDeep\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var shallow = _.clone(objects);\n * console.log(shallow[0] === objects[0]);\n * // => true\n */\n function clone(value) {\n return baseClone(value, CLONE_SYMBOLS_FLAG);\n }\n\n /**\n * This method is like `_.clone` except that it accepts `customizer` which\n * is invoked to produce the cloned value. If `customizer` returns `undefined`,\n * cloning is handled by the method instead. The `customizer` is invoked with\n * up to four arguments; (value [, index|key, object, stack]).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to clone.\n * @param {Function} [customizer] The function to customize cloning.\n * @returns {*} Returns the cloned value.\n * @see _.cloneDeepWith\n * @example\n *\n * function customizer(value) {\n * if (_.isElement(value)) {\n * return value.cloneNode(false);\n * }\n * }\n *\n * var el = _.cloneWith(document.body, customizer);\n *\n * console.log(el === document.body);\n * // => false\n * console.log(el.nodeName);\n * // => 'BODY'\n * console.log(el.childNodes.length);\n * // => 0\n */\n function cloneWith(value, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return baseClone(value, CLONE_SYMBOLS_FLAG, customizer);\n }\n\n /**\n * This method is like `_.clone` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @returns {*} Returns the deep cloned value.\n * @see _.clone\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n */\n function cloneDeep(value) {\n return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n }\n\n /**\n * This method is like `_.cloneWith` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @param {Function} [customizer] The function to customize cloning.\n * @returns {*} Returns the deep cloned value.\n * @see _.cloneWith\n * @example\n *\n * function customizer(value) {\n * if (_.isElement(value)) {\n * return value.cloneNode(true);\n * }\n * }\n *\n * var el = _.cloneDeepWith(document.body, customizer);\n *\n * console.log(el === document.body);\n * // => false\n * console.log(el.nodeName);\n * // => 'BODY'\n * console.log(el.childNodes.length);\n * // => 20\n */\n function cloneDeepWith(value, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG, customizer);\n }\n\n /**\n * Checks if `object` conforms to `source` by invoking the predicate\n * properties of `source` with the corresponding property values of `object`.\n *\n * **Note:** This method is equivalent to `_.conforms` when `source` is\n * partially applied.\n *\n * @static\n * @memberOf _\n * @since 4.14.0\n * @category Lang\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property predicates to conform to.\n * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n *\n * _.conformsTo(object, { 'b': function(n) { return n > 1; } });\n * // => true\n *\n * _.conformsTo(object, { 'b': function(n) { return n > 2; } });\n * // => false\n */\n function conformsTo(object, source) {\n return source == null || baseConformsTo(object, source, keys(source));\n }\n\n /**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\n function eq(value, other) {\n return value === other || (value !== value && other !== other);\n }\n\n /**\n * Checks if `value` is greater than `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than `other`,\n * else `false`.\n * @see _.lt\n * @example\n *\n * _.gt(3, 1);\n * // => true\n *\n * _.gt(3, 3);\n * // => false\n *\n * _.gt(1, 3);\n * // => false\n */\n var gt = createRelationalOperation(baseGt);\n\n /**\n * Checks if `value` is greater than or equal to `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than or equal to\n * `other`, else `false`.\n * @see _.lte\n * @example\n *\n * _.gte(3, 1);\n * // => true\n *\n * _.gte(3, 3);\n * // => true\n *\n * _.gte(1, 3);\n * // => false\n */\n var gte = createRelationalOperation(function(value, other) {\n return value >= other;\n });\n\n /**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n * else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\n var isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n !propertyIsEnumerable.call(value, 'callee');\n };\n\n /**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\n var isArray = Array.isArray;\n\n /**\n * Checks if `value` is classified as an `ArrayBuffer` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n * @example\n *\n * _.isArrayBuffer(new ArrayBuffer(2));\n * // => true\n *\n * _.isArrayBuffer(new Array(2));\n * // => false\n */\n var isArrayBuffer = nodeIsArrayBuffer ? baseUnary(nodeIsArrayBuffer) : baseIsArrayBuffer;\n\n /**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\n function isArrayLike(value) {\n return value != null && isLength(value.length) && !isFunction(value);\n }\n\n /**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n * else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\n function isArrayLikeObject(value) {\n return isObjectLike(value) && isArrayLike(value);\n }\n\n /**\n * Checks if `value` is classified as a boolean primitive or object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a boolean, else `false`.\n * @example\n *\n * _.isBoolean(false);\n * // => true\n *\n * _.isBoolean(null);\n * // => false\n */\n function isBoolean(value) {\n return value === true || value === false ||\n (isObjectLike(value) && baseGetTag(value) == boolTag);\n }\n\n /**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\n var isBuffer = nativeIsBuffer || stubFalse;\n\n /**\n * Checks if `value` is classified as a `Date` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n * @example\n *\n * _.isDate(new Date);\n * // => true\n *\n * _.isDate('Mon April 23 2012');\n * // => false\n */\n var isDate = nodeIsDate ? baseUnary(nodeIsDate) : baseIsDate;\n\n /**\n * Checks if `value` is likely a DOM element.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a DOM element, else `false`.\n * @example\n *\n * _.isElement(document.body);\n * // => true\n *\n * _.isElement('');\n * // => false\n */\n function isElement(value) {\n return isObjectLike(value) && value.nodeType === 1 && !isPlainObject(value);\n }\n\n /**\n * Checks if `value` is an empty object, collection, map, or set.\n *\n * Objects are considered empty if they have no own enumerable string keyed\n * properties.\n *\n * Array-like values such as `arguments` objects, arrays, buffers, strings, or\n * jQuery-like collections are considered empty if they have a `length` of `0`.\n * Similarly, maps and sets are considered empty if they have a `size` of `0`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is empty, else `false`.\n * @example\n *\n * _.isEmpty(null);\n * // => true\n *\n * _.isEmpty(true);\n * // => true\n *\n * _.isEmpty(1);\n * // => true\n *\n * _.isEmpty([1, 2, 3]);\n * // => false\n *\n * _.isEmpty({ 'a': 1 });\n * // => false\n */\n function isEmpty(value) {\n if (value == null) {\n return true;\n }\n if (isArrayLike(value) &&\n (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||\n isBuffer(value) || isTypedArray(value) || isArguments(value))) {\n return !value.length;\n }\n var tag = getTag(value);\n if (tag == mapTag || tag == setTag) {\n return !value.size;\n }\n if (isPrototype(value)) {\n return !baseKeys(value).length;\n }\n for (var key in value) {\n if (hasOwnProperty.call(value, key)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * Performs a deep comparison between two values to determine if they are\n * equivalent.\n *\n * **Note:** This method supports comparing arrays, array buffers, booleans,\n * date objects, error objects, maps, numbers, `Object` objects, regexes,\n * sets, strings, symbols, and typed arrays. `Object` objects are compared\n * by their own, not inherited, enumerable properties. Functions and DOM\n * nodes are compared by strict equality, i.e. `===`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.isEqual(object, other);\n * // => true\n *\n * object === other;\n * // => false\n */\n function isEqual(value, other) {\n return baseIsEqual(value, other);\n }\n\n /**\n * This method is like `_.isEqual` except that it accepts `customizer` which\n * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n * are handled by the method instead. The `customizer` is invoked with up to\n * six arguments: (objValue, othValue [, index|key, object, other, stack]).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * function isGreeting(value) {\n * return /^h(?:i|ello)$/.test(value);\n * }\n *\n * function customizer(objValue, othValue) {\n * if (isGreeting(objValue) && isGreeting(othValue)) {\n * return true;\n * }\n * }\n *\n * var array = ['hello', 'goodbye'];\n * var other = ['hi', 'goodbye'];\n *\n * _.isEqualWith(array, other, customizer);\n * // => true\n */\n function isEqualWith(value, other, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n var result = customizer ? customizer(value, other) : undefined;\n return result === undefined ? baseIsEqual(value, other, undefined, customizer) : !!result;\n }\n\n /**\n * Checks if `value` is an `Error`, `EvalError`, `RangeError`, `ReferenceError`,\n * `SyntaxError`, `TypeError`, or `URIError` object.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an error object, else `false`.\n * @example\n *\n * _.isError(new Error);\n * // => true\n *\n * _.isError(Error);\n * // => false\n */\n function isError(value) {\n if (!isObjectLike(value)) {\n return false;\n }\n var tag = baseGetTag(value);\n return tag == errorTag || tag == domExcTag ||\n (typeof value.message == 'string' && typeof value.name == 'string' && !isPlainObject(value));\n }\n\n /**\n * Checks if `value` is a finite primitive number.\n *\n * **Note:** This method is based on\n * [`Number.isFinite`](https://mdn.io/Number/isFinite).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a finite number, else `false`.\n * @example\n *\n * _.isFinite(3);\n * // => true\n *\n * _.isFinite(Number.MIN_VALUE);\n * // => true\n *\n * _.isFinite(Infinity);\n * // => false\n *\n * _.isFinite('3');\n * // => false\n */\n function isFinite(value) {\n return typeof value == 'number' && nativeIsFinite(value);\n }\n\n /**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\n function isFunction(value) {\n if (!isObject(value)) {\n return false;\n }\n // The use of `Object#toString` avoids issues with the `typeof` operator\n // in Safari 9 which returns 'object' for typed arrays and other constructors.\n var tag = baseGetTag(value);\n return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n }\n\n /**\n * Checks if `value` is an integer.\n *\n * **Note:** This method is based on\n * [`Number.isInteger`](https://mdn.io/Number/isInteger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an integer, else `false`.\n * @example\n *\n * _.isInteger(3);\n * // => true\n *\n * _.isInteger(Number.MIN_VALUE);\n * // => false\n *\n * _.isInteger(Infinity);\n * // => false\n *\n * _.isInteger('3');\n * // => false\n */\n function isInteger(value) {\n return typeof value == 'number' && value == toInteger(value);\n }\n\n /**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\n function isLength(value) {\n return typeof value == 'number' &&\n value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n }\n\n /**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\n function isObject(value) {\n var type = typeof value;\n return value != null && (type == 'object' || type == 'function');\n }\n\n /**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\n function isObjectLike(value) {\n return value != null && typeof value == 'object';\n }\n\n /**\n * Checks if `value` is classified as a `Map` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n * @example\n *\n * _.isMap(new Map);\n * // => true\n *\n * _.isMap(new WeakMap);\n * // => false\n */\n var isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\n /**\n * Performs a partial deep comparison between `object` and `source` to\n * determine if `object` contains equivalent property values.\n *\n * **Note:** This method is equivalent to `_.matches` when `source` is\n * partially applied.\n *\n * Partial comparisons will match empty array and empty object `source`\n * values against any array or object value, respectively. See `_.isEqual`\n * for a list of supported value comparisons.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n *\n * _.isMatch(object, { 'b': 2 });\n * // => true\n *\n * _.isMatch(object, { 'b': 1 });\n * // => false\n */\n function isMatch(object, source) {\n return object === source || baseIsMatch(object, source, getMatchData(source));\n }\n\n /**\n * This method is like `_.isMatch` except that it accepts `customizer` which\n * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n * are handled by the method instead. The `customizer` is invoked with five\n * arguments: (objValue, srcValue, index|key, object, source).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n * @example\n *\n * function isGreeting(value) {\n * return /^h(?:i|ello)$/.test(value);\n * }\n *\n * function customizer(objValue, srcValue) {\n * if (isGreeting(objValue) && isGreeting(srcValue)) {\n * return true;\n * }\n * }\n *\n * var object = { 'greeting': 'hello' };\n * var source = { 'greeting': 'hi' };\n *\n * _.isMatchWith(object, source, customizer);\n * // => true\n */\n function isMatchWith(object, source, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return baseIsMatch(object, source, getMatchData(source), customizer);\n }\n\n /**\n * Checks if `value` is `NaN`.\n *\n * **Note:** This method is based on\n * [`Number.isNaN`](https://mdn.io/Number/isNaN) and is not the same as\n * global [`isNaN`](https://mdn.io/isNaN) which returns `true` for\n * `undefined` and other non-number values.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n * @example\n *\n * _.isNaN(NaN);\n * // => true\n *\n * _.isNaN(new Number(NaN));\n * // => true\n *\n * isNaN(undefined);\n * // => true\n *\n * _.isNaN(undefined);\n * // => false\n */\n function isNaN(value) {\n // An `NaN` primitive is the only value that is not equal to itself.\n // Perform the `toStringTag` check first to avoid errors with some\n // ActiveX objects in IE.\n return isNumber(value) && value != +value;\n }\n\n /**\n * Checks if `value` is a pristine native function.\n *\n * **Note:** This method can't reliably detect native functions in the presence\n * of the core-js package because core-js circumvents this kind of detection.\n * Despite multiple requests, the core-js maintainer has made it clear: any\n * attempt to fix the detection will be obstructed. As a result, we're left\n * with little choice but to throw an error. Unfortunately, this also affects\n * packages, like [babel-polyfill](https://www.npmjs.com/package/babel-polyfill),\n * which rely on core-js.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n * else `false`.\n * @example\n *\n * _.isNative(Array.prototype.push);\n * // => true\n *\n * _.isNative(_);\n * // => false\n */\n function isNative(value) {\n if (isMaskable(value)) {\n throw new Error(CORE_ERROR_TEXT);\n }\n return baseIsNative(value);\n }\n\n /**\n * Checks if `value` is `null`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `null`, else `false`.\n * @example\n *\n * _.isNull(null);\n * // => true\n *\n * _.isNull(void 0);\n * // => false\n */\n function isNull(value) {\n return value === null;\n }\n\n /**\n * Checks if `value` is `null` or `undefined`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is nullish, else `false`.\n * @example\n *\n * _.isNil(null);\n * // => true\n *\n * _.isNil(void 0);\n * // => true\n *\n * _.isNil(NaN);\n * // => false\n */\n function isNil(value) {\n return value == null;\n }\n\n /**\n * Checks if `value` is classified as a `Number` primitive or object.\n *\n * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are\n * classified as numbers, use the `_.isFinite` method.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a number, else `false`.\n * @example\n *\n * _.isNumber(3);\n * // => true\n *\n * _.isNumber(Number.MIN_VALUE);\n * // => true\n *\n * _.isNumber(Infinity);\n * // => true\n *\n * _.isNumber('3');\n * // => false\n */\n function isNumber(value) {\n return typeof value == 'number' ||\n (isObjectLike(value) && baseGetTag(value) == numberTag);\n }\n\n /**\n * Checks if `value` is a plain object, that is, an object created by the\n * `Object` constructor or one with a `[[Prototype]]` of `null`.\n *\n * @static\n * @memberOf _\n * @since 0.8.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * }\n *\n * _.isPlainObject(new Foo);\n * // => false\n *\n * _.isPlainObject([1, 2, 3]);\n * // => false\n *\n * _.isPlainObject({ 'x': 0, 'y': 0 });\n * // => true\n *\n * _.isPlainObject(Object.create(null));\n * // => true\n */\n function isPlainObject(value) {\n if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\n return false;\n }\n var proto = getPrototype(value);\n if (proto === null) {\n return true;\n }\n var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n funcToString.call(Ctor) == objectCtorString;\n }\n\n /**\n * Checks if `value` is classified as a `RegExp` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n * @example\n *\n * _.isRegExp(/abc/);\n * // => true\n *\n * _.isRegExp('/abc/');\n * // => false\n */\n var isRegExp = nodeIsRegExp ? baseUnary(nodeIsRegExp) : baseIsRegExp;\n\n /**\n * Checks if `value` is a safe integer. An integer is safe if it's an IEEE-754\n * double precision number which isn't the result of a rounded unsafe integer.\n *\n * **Note:** This method is based on\n * [`Number.isSafeInteger`](https://mdn.io/Number/isSafeInteger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a safe integer, else `false`.\n * @example\n *\n * _.isSafeInteger(3);\n * // => true\n *\n * _.isSafeInteger(Number.MIN_VALUE);\n * // => false\n *\n * _.isSafeInteger(Infinity);\n * // => false\n *\n * _.isSafeInteger('3');\n * // => false\n */\n function isSafeInteger(value) {\n return isInteger(value) && value >= -MAX_SAFE_INTEGER && value <= MAX_SAFE_INTEGER;\n }\n\n /**\n * Checks if `value` is classified as a `Set` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n * @example\n *\n * _.isSet(new Set);\n * // => true\n *\n * _.isSet(new WeakSet);\n * // => false\n */\n var isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\n\n /**\n * Checks if `value` is classified as a `String` primitive or object.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n * @example\n *\n * _.isString('abc');\n * // => true\n *\n * _.isString(1);\n * // => false\n */\n function isString(value) {\n return typeof value == 'string' ||\n (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n }\n\n /**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\n function isSymbol(value) {\n return typeof value == 'symbol' ||\n (isObjectLike(value) && baseGetTag(value) == symbolTag);\n }\n\n /**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\n var isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\n /**\n * Checks if `value` is `undefined`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.\n * @example\n *\n * _.isUndefined(void 0);\n * // => true\n *\n * _.isUndefined(null);\n * // => false\n */\n function isUndefined(value) {\n return value === undefined;\n }\n\n /**\n * Checks if `value` is classified as a `WeakMap` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a weak map, else `false`.\n * @example\n *\n * _.isWeakMap(new WeakMap);\n * // => true\n *\n * _.isWeakMap(new Map);\n * // => false\n */\n function isWeakMap(value) {\n return isObjectLike(value) && getTag(value) == weakMapTag;\n }\n\n /**\n * Checks if `value` is classified as a `WeakSet` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a weak set, else `false`.\n * @example\n *\n * _.isWeakSet(new WeakSet);\n * // => true\n *\n * _.isWeakSet(new Set);\n * // => false\n */\n function isWeakSet(value) {\n return isObjectLike(value) && baseGetTag(value) == weakSetTag;\n }\n\n /**\n * Checks if `value` is less than `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than `other`,\n * else `false`.\n * @see _.gt\n * @example\n *\n * _.lt(1, 3);\n * // => true\n *\n * _.lt(3, 3);\n * // => false\n *\n * _.lt(3, 1);\n * // => false\n */\n var lt = createRelationalOperation(baseLt);\n\n /**\n * Checks if `value` is less than or equal to `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than or equal to\n * `other`, else `false`.\n * @see _.gte\n * @example\n *\n * _.lte(1, 3);\n * // => true\n *\n * _.lte(3, 3);\n * // => true\n *\n * _.lte(3, 1);\n * // => false\n */\n var lte = createRelationalOperation(function(value, other) {\n return value <= other;\n });\n\n /**\n * Converts `value` to an array.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {Array} Returns the converted array.\n * @example\n *\n * _.toArray({ 'a': 1, 'b': 2 });\n * // => [1, 2]\n *\n * _.toArray('abc');\n * // => ['a', 'b', 'c']\n *\n * _.toArray(1);\n * // => []\n *\n * _.toArray(null);\n * // => []\n */\n function toArray(value) {\n if (!value) {\n return [];\n }\n if (isArrayLike(value)) {\n return isString(value) ? stringToArray(value) : copyArray(value);\n }\n if (symIterator && value[symIterator]) {\n return iteratorToArray(value[symIterator]());\n }\n var tag = getTag(value),\n func = tag == mapTag ? mapToArray : (tag == setTag ? setToArray : values);\n\n return func(value);\n }\n\n /**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\n function toFinite(value) {\n if (!value) {\n return value === 0 ? value : 0;\n }\n value = toNumber(value);\n if (value === INFINITY || value === -INFINITY) {\n var sign = (value < 0 ? -1 : 1);\n return sign * MAX_INTEGER;\n }\n return value === value ? value : 0;\n }\n\n /**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\n function toInteger(value) {\n var result = toFinite(value),\n remainder = result % 1;\n\n return result === result ? (remainder ? result - remainder : result) : 0;\n }\n\n /**\n * Converts `value` to an integer suitable for use as the length of an\n * array-like object.\n *\n * **Note:** This method is based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toLength(3.2);\n * // => 3\n *\n * _.toLength(Number.MIN_VALUE);\n * // => 0\n *\n * _.toLength(Infinity);\n * // => 4294967295\n *\n * _.toLength('3.2');\n * // => 3\n */\n function toLength(value) {\n return value ? baseClamp(toInteger(value), 0, MAX_ARRAY_LENGTH) : 0;\n }\n\n /**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\n function toNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n if (isObject(value)) {\n var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n value = isObject(other) ? (other + '') : other;\n }\n if (typeof value != 'string') {\n return value === 0 ? value : +value;\n }\n value = value.replace(reTrim, '');\n var isBinary = reIsBinary.test(value);\n return (isBinary || reIsOctal.test(value))\n ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n : (reIsBadHex.test(value) ? NAN : +value);\n }\n\n /**\n * Converts `value` to a plain object flattening inherited enumerable string\n * keyed properties of `value` to own properties of the plain object.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {Object} Returns the converted plain object.\n * @example\n *\n * function Foo() {\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.assign({ 'a': 1 }, new Foo);\n * // => { 'a': 1, 'b': 2 }\n *\n * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));\n * // => { 'a': 1, 'b': 2, 'c': 3 }\n */\n function toPlainObject(value) {\n return copyObject(value, keysIn(value));\n }\n\n /**\n * Converts `value` to a safe integer. A safe integer can be compared and\n * represented correctly.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toSafeInteger(3.2);\n * // => 3\n *\n * _.toSafeInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toSafeInteger(Infinity);\n * // => 9007199254740991\n *\n * _.toSafeInteger('3.2');\n * // => 3\n */\n function toSafeInteger(value) {\n return value\n ? baseClamp(toInteger(value), -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER)\n : (value === 0 ? value : 0);\n }\n\n /**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\n function toString(value) {\n return value == null ? '' : baseToString(value);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Assigns own enumerable string keyed properties of source objects to the\n * destination object. Source objects are applied from left to right.\n * Subsequent sources overwrite property assignments of previous sources.\n *\n * **Note:** This method mutates `object` and is loosely based on\n * [`Object.assign`](https://mdn.io/Object/assign).\n *\n * @static\n * @memberOf _\n * @since 0.10.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.assignIn\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * }\n *\n * function Bar() {\n * this.c = 3;\n * }\n *\n * Foo.prototype.b = 2;\n * Bar.prototype.d = 4;\n *\n * _.assign({ 'a': 0 }, new Foo, new Bar);\n * // => { 'a': 1, 'c': 3 }\n */\n var assign = createAssigner(function(object, source) {\n if (isPrototype(source) || isArrayLike(source)) {\n copyObject(source, keys(source), object);\n return;\n }\n for (var key in source) {\n if (hasOwnProperty.call(source, key)) {\n assignValue(object, key, source[key]);\n }\n }\n });\n\n /**\n * This method is like `_.assign` except that it iterates over own and\n * inherited source properties.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias extend\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.assign\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * }\n *\n * function Bar() {\n * this.c = 3;\n * }\n *\n * Foo.prototype.b = 2;\n * Bar.prototype.d = 4;\n *\n * _.assignIn({ 'a': 0 }, new Foo, new Bar);\n * // => { 'a': 1, 'b': 2, 'c': 3, 'd': 4 }\n */\n var assignIn = createAssigner(function(object, source) {\n copyObject(source, keysIn(source), object);\n });\n\n /**\n * This method is like `_.assignIn` except that it accepts `customizer`\n * which is invoked to produce the assigned values. If `customizer` returns\n * `undefined`, assignment is handled by the method instead. The `customizer`\n * is invoked with five arguments: (objValue, srcValue, key, object, source).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias extendWith\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} sources The source objects.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @see _.assignWith\n * @example\n *\n * function customizer(objValue, srcValue) {\n * return _.isUndefined(objValue) ? srcValue : objValue;\n * }\n *\n * var defaults = _.partialRight(_.assignInWith, customizer);\n *\n * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\n var assignInWith = createAssigner(function(object, source, srcIndex, customizer) {\n copyObject(source, keysIn(source), object, customizer);\n });\n\n /**\n * This method is like `_.assign` except that it accepts `customizer`\n * which is invoked to produce the assigned values. If `customizer` returns\n * `undefined`, assignment is handled by the method instead. The `customizer`\n * is invoked with five arguments: (objValue, srcValue, key, object, source).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} sources The source objects.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @see _.assignInWith\n * @example\n *\n * function customizer(objValue, srcValue) {\n * return _.isUndefined(objValue) ? srcValue : objValue;\n * }\n *\n * var defaults = _.partialRight(_.assignWith, customizer);\n *\n * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\n var assignWith = createAssigner(function(object, source, srcIndex, customizer) {\n copyObject(source, keys(source), object, customizer);\n });\n\n /**\n * Creates an array of values corresponding to `paths` of `object`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Array} Returns the picked values.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n *\n * _.at(object, ['a[0].b.c', 'a[1]']);\n * // => [3, 4]\n */\n var at = flatRest(baseAt);\n\n /**\n * Creates an object that inherits from the `prototype` object. If a\n * `properties` object is given, its own enumerable string keyed properties\n * are assigned to the created object.\n *\n * @static\n * @memberOf _\n * @since 2.3.0\n * @category Object\n * @param {Object} prototype The object to inherit from.\n * @param {Object} [properties] The properties to assign to the object.\n * @returns {Object} Returns the new object.\n * @example\n *\n * function Shape() {\n * this.x = 0;\n * this.y = 0;\n * }\n *\n * function Circle() {\n * Shape.call(this);\n * }\n *\n * Circle.prototype = _.create(Shape.prototype, {\n * 'constructor': Circle\n * });\n *\n * var circle = new Circle;\n * circle instanceof Circle;\n * // => true\n *\n * circle instanceof Shape;\n * // => true\n */\n function create(prototype, properties) {\n var result = baseCreate(prototype);\n return properties == null ? result : baseAssign(result, properties);\n }\n\n /**\n * Assigns own and inherited enumerable string keyed properties of source\n * objects to the destination object for all destination properties that\n * resolve to `undefined`. Source objects are applied from left to right.\n * Once a property is set, additional values of the same property are ignored.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.defaultsDeep\n * @example\n *\n * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\n var defaults = baseRest(function(object, sources) {\n object = Object(object);\n\n var index = -1;\n var length = sources.length;\n var guard = length > 2 ? sources[2] : undefined;\n\n if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n length = 1;\n }\n\n while (++index < length) {\n var source = sources[index];\n var props = keysIn(source);\n var propsIndex = -1;\n var propsLength = props.length;\n\n while (++propsIndex < propsLength) {\n var key = props[propsIndex];\n var value = object[key];\n\n if (value === undefined ||\n (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n object[key] = source[key];\n }\n }\n }\n\n return object;\n });\n\n /**\n * This method is like `_.defaults` except that it recursively assigns\n * default properties.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 3.10.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.defaults\n * @example\n *\n * _.defaultsDeep({ 'a': { 'b': 2 } }, { 'a': { 'b': 1, 'c': 3 } });\n * // => { 'a': { 'b': 2, 'c': 3 } }\n */\n var defaultsDeep = baseRest(function(args) {\n args.push(undefined, customDefaultsMerge);\n return apply(mergeWith, undefined, args);\n });\n\n /**\n * This method is like `_.find` except that it returns the key of the first\n * element `predicate` returns truthy for instead of the element itself.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Object\n * @param {Object} object The object to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {string|undefined} Returns the key of the matched element,\n * else `undefined`.\n * @example\n *\n * var users = {\n * 'barney': { 'age': 36, 'active': true },\n * 'fred': { 'age': 40, 'active': false },\n * 'pebbles': { 'age': 1, 'active': true }\n * };\n *\n * _.findKey(users, function(o) { return o.age < 40; });\n * // => 'barney' (iteration order is not guaranteed)\n *\n * // The `_.matches` iteratee shorthand.\n * _.findKey(users, { 'age': 1, 'active': true });\n * // => 'pebbles'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findKey(users, ['active', false]);\n * // => 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.findKey(users, 'active');\n * // => 'barney'\n */\n function findKey(object, predicate) {\n return baseFindKey(object, getIteratee(predicate, 3), baseForOwn);\n }\n\n /**\n * This method is like `_.findKey` except that it iterates over elements of\n * a collection in the opposite order.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Object\n * @param {Object} object The object to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {string|undefined} Returns the key of the matched element,\n * else `undefined`.\n * @example\n *\n * var users = {\n * 'barney': { 'age': 36, 'active': true },\n * 'fred': { 'age': 40, 'active': false },\n * 'pebbles': { 'age': 1, 'active': true }\n * };\n *\n * _.findLastKey(users, function(o) { return o.age < 40; });\n * // => returns 'pebbles' assuming `_.findKey` returns 'barney'\n *\n * // The `_.matches` iteratee shorthand.\n * _.findLastKey(users, { 'age': 36, 'active': true });\n * // => 'barney'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findLastKey(users, ['active', false]);\n * // => 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.findLastKey(users, 'active');\n * // => 'pebbles'\n */\n function findLastKey(object, predicate) {\n return baseFindKey(object, getIteratee(predicate, 3), baseForOwnRight);\n }\n\n /**\n * Iterates over own and inherited enumerable string keyed properties of an\n * object and invokes `iteratee` for each property. The iteratee is invoked\n * with three arguments: (value, key, object). Iteratee functions may exit\n * iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forInRight\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forIn(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).\n */\n function forIn(object, iteratee) {\n return object == null\n ? object\n : baseFor(object, getIteratee(iteratee, 3), keysIn);\n }\n\n /**\n * This method is like `_.forIn` except that it iterates over properties of\n * `object` in the opposite order.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forIn\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forInRight(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'c', 'b', then 'a' assuming `_.forIn` logs 'a', 'b', then 'c'.\n */\n function forInRight(object, iteratee) {\n return object == null\n ? object\n : baseForRight(object, getIteratee(iteratee, 3), keysIn);\n }\n\n /**\n * Iterates over own enumerable string keyed properties of an object and\n * invokes `iteratee` for each property. The iteratee is invoked with three\n * arguments: (value, key, object). Iteratee functions may exit iteration\n * early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forOwnRight\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forOwn(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\n function forOwn(object, iteratee) {\n return object && baseForOwn(object, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.forOwn` except that it iterates over properties of\n * `object` in the opposite order.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forOwn\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forOwnRight(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'.\n */\n function forOwnRight(object, iteratee) {\n return object && baseForOwnRight(object, getIteratee(iteratee, 3));\n }\n\n /**\n * Creates an array of function property names from own enumerable properties\n * of `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to inspect.\n * @returns {Array} Returns the function names.\n * @see _.functionsIn\n * @example\n *\n * function Foo() {\n * this.a = _.constant('a');\n * this.b = _.constant('b');\n * }\n *\n * Foo.prototype.c = _.constant('c');\n *\n * _.functions(new Foo);\n * // => ['a', 'b']\n */\n function functions(object) {\n return object == null ? [] : baseFunctions(object, keys(object));\n }\n\n /**\n * Creates an array of function property names from own and inherited\n * enumerable properties of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to inspect.\n * @returns {Array} Returns the function names.\n * @see _.functions\n * @example\n *\n * function Foo() {\n * this.a = _.constant('a');\n * this.b = _.constant('b');\n * }\n *\n * Foo.prototype.c = _.constant('c');\n *\n * _.functionsIn(new Foo);\n * // => ['a', 'b', 'c']\n */\n function functionsIn(object) {\n return object == null ? [] : baseFunctions(object, keysIn(object));\n }\n\n /**\n * Gets the value at `path` of `object`. If the resolved value is\n * `undefined`, the `defaultValue` is returned in its place.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.get(object, 'a[0].b.c');\n * // => 3\n *\n * _.get(object, ['a', '0', 'b', 'c']);\n * // => 3\n *\n * _.get(object, 'a.b.c', 'default');\n * // => 'default'\n */\n function get(object, path, defaultValue) {\n var result = object == null ? undefined : baseGet(object, path);\n return result === undefined ? defaultValue : result;\n }\n\n /**\n * Checks if `path` is a direct property of `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = { 'a': { 'b': 2 } };\n * var other = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.has(object, 'a');\n * // => true\n *\n * _.has(object, 'a.b');\n * // => true\n *\n * _.has(object, ['a', 'b']);\n * // => true\n *\n * _.has(other, 'a');\n * // => false\n */\n function has(object, path) {\n return object != null && hasPath(object, path, baseHas);\n }\n\n /**\n * Checks if `path` is a direct or inherited property of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.hasIn(object, 'a');\n * // => true\n *\n * _.hasIn(object, 'a.b');\n * // => true\n *\n * _.hasIn(object, ['a', 'b']);\n * // => true\n *\n * _.hasIn(object, 'b');\n * // => false\n */\n function hasIn(object, path) {\n return object != null && hasPath(object, path, baseHasIn);\n }\n\n /**\n * Creates an object composed of the inverted keys and values of `object`.\n * If `object` contains duplicate values, subsequent values overwrite\n * property assignments of previous values.\n *\n * @static\n * @memberOf _\n * @since 0.7.0\n * @category Object\n * @param {Object} object The object to invert.\n * @returns {Object} Returns the new inverted object.\n * @example\n *\n * var object = { 'a': 1, 'b': 2, 'c': 1 };\n *\n * _.invert(object);\n * // => { '1': 'c', '2': 'b' }\n */\n var invert = createInverter(function(result, value, key) {\n if (value != null &&\n typeof value.toString != 'function') {\n value = nativeObjectToString.call(value);\n }\n\n result[value] = key;\n }, constant(identity));\n\n /**\n * This method is like `_.invert` except that the inverted object is generated\n * from the results of running each element of `object` thru `iteratee`. The\n * corresponding inverted value of each inverted key is an array of keys\n * responsible for generating the inverted value. The iteratee is invoked\n * with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.1.0\n * @category Object\n * @param {Object} object The object to invert.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Object} Returns the new inverted object.\n * @example\n *\n * var object = { 'a': 1, 'b': 2, 'c': 1 };\n *\n * _.invertBy(object);\n * // => { '1': ['a', 'c'], '2': ['b'] }\n *\n * _.invertBy(object, function(value) {\n * return 'group' + value;\n * });\n * // => { 'group1': ['a', 'c'], 'group2': ['b'] }\n */\n var invertBy = createInverter(function(result, value, key) {\n if (value != null &&\n typeof value.toString != 'function') {\n value = nativeObjectToString.call(value);\n }\n\n if (hasOwnProperty.call(result, value)) {\n result[value].push(key);\n } else {\n result[value] = [key];\n }\n }, getIteratee);\n\n /**\n * Invokes the method at `path` of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the method to invoke.\n * @param {...*} [args] The arguments to invoke the method with.\n * @returns {*} Returns the result of the invoked method.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': [1, 2, 3, 4] } }] };\n *\n * _.invoke(object, 'a[0].b.c.slice', 1, 3);\n * // => [2, 3]\n */\n var invoke = baseRest(baseInvoke);\n\n /**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\n function keys(object) {\n return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n }\n\n /**\n * Creates an array of the own and inherited enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keysIn(new Foo);\n * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n */\n function keysIn(object) {\n return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n }\n\n /**\n * The opposite of `_.mapValues`; this method creates an object with the\n * same values as `object` and keys generated by running each own enumerable\n * string keyed property of `object` thru `iteratee`. The iteratee is invoked\n * with three arguments: (value, key, object).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns the new mapped object.\n * @see _.mapValues\n * @example\n *\n * _.mapKeys({ 'a': 1, 'b': 2 }, function(value, key) {\n * return key + value;\n * });\n * // => { 'a1': 1, 'b2': 2 }\n */\n function mapKeys(object, iteratee) {\n var result = {};\n iteratee = getIteratee(iteratee, 3);\n\n baseForOwn(object, function(value, key, object) {\n baseAssignValue(result, iteratee(value, key, object), value);\n });\n return result;\n }\n\n /**\n * Creates an object with the same keys as `object` and values generated\n * by running each own enumerable string keyed property of `object` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, key, object).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns the new mapped object.\n * @see _.mapKeys\n * @example\n *\n * var users = {\n * 'fred': { 'user': 'fred', 'age': 40 },\n * 'pebbles': { 'user': 'pebbles', 'age': 1 }\n * };\n *\n * _.mapValues(users, function(o) { return o.age; });\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n *\n * // The `_.property` iteratee shorthand.\n * _.mapValues(users, 'age');\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n */\n function mapValues(object, iteratee) {\n var result = {};\n iteratee = getIteratee(iteratee, 3);\n\n baseForOwn(object, function(value, key, object) {\n baseAssignValue(result, key, iteratee(value, key, object));\n });\n return result;\n }\n\n /**\n * This method is like `_.assign` except that it recursively merges own and\n * inherited enumerable string keyed properties of source objects into the\n * destination object. Source properties that resolve to `undefined` are\n * skipped if a destination value exists. Array and plain object properties\n * are merged recursively. Other objects and value types are overridden by\n * assignment. Source objects are applied from left to right. Subsequent\n * sources overwrite property assignments of previous sources.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {\n * 'a': [{ 'b': 2 }, { 'd': 4 }]\n * };\n *\n * var other = {\n * 'a': [{ 'c': 3 }, { 'e': 5 }]\n * };\n *\n * _.merge(object, other);\n * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }\n */\n var merge = createAssigner(function(object, source, srcIndex) {\n baseMerge(object, source, srcIndex);\n });\n\n /**\n * This method is like `_.merge` except that it accepts `customizer` which\n * is invoked to produce the merged values of the destination and source\n * properties. If `customizer` returns `undefined`, merging is handled by the\n * method instead. The `customizer` is invoked with six arguments:\n * (objValue, srcValue, key, object, source, stack).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} sources The source objects.\n * @param {Function} customizer The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @example\n *\n * function customizer(objValue, srcValue) {\n * if (_.isArray(objValue)) {\n * return objValue.concat(srcValue);\n * }\n * }\n *\n * var object = { 'a': [1], 'b': [2] };\n * var other = { 'a': [3], 'b': [4] };\n *\n * _.mergeWith(object, other, customizer);\n * // => { 'a': [1, 3], 'b': [2, 4] }\n */\n var mergeWith = createAssigner(function(object, source, srcIndex, customizer) {\n baseMerge(object, source, srcIndex, customizer);\n });\n\n /**\n * The opposite of `_.pick`; this method creates an object composed of the\n * own and inherited enumerable property paths of `object` that are not omitted.\n *\n * **Note:** This method is considerably slower than `_.pick`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to omit.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.omit(object, ['a', 'c']);\n * // => { 'b': '2' }\n */\n var omit = flatRest(function(object, paths) {\n var result = {};\n if (object == null) {\n return result;\n }\n var isDeep = false;\n paths = arrayMap(paths, function(path) {\n path = castPath(path, object);\n isDeep || (isDeep = path.length > 1);\n return path;\n });\n copyObject(object, getAllKeysIn(object), result);\n if (isDeep) {\n result = baseClone(result, CLONE_DEEP_FLAG | CLONE_FLAT_FLAG | CLONE_SYMBOLS_FLAG, customOmitClone);\n }\n var length = paths.length;\n while (length--) {\n baseUnset(result, paths[length]);\n }\n return result;\n });\n\n /**\n * The opposite of `_.pickBy`; this method creates an object composed of\n * the own and inherited enumerable string keyed properties of `object` that\n * `predicate` doesn't return truthy for. The predicate is invoked with two\n * arguments: (value, key).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The source object.\n * @param {Function} [predicate=_.identity] The function invoked per property.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.omitBy(object, _.isNumber);\n * // => { 'b': '2' }\n */\n function omitBy(object, predicate) {\n return pickBy(object, negate(getIteratee(predicate)));\n }\n\n /**\n * Creates an object composed of the picked `object` properties.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pick(object, ['a', 'c']);\n * // => { 'a': 1, 'c': 3 }\n */\n var pick = flatRest(function(object, paths) {\n return object == null ? {} : basePick(object, paths);\n });\n\n /**\n * Creates an object composed of the `object` properties `predicate` returns\n * truthy for. The predicate is invoked with two arguments: (value, key).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The source object.\n * @param {Function} [predicate=_.identity] The function invoked per property.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pickBy(object, _.isNumber);\n * // => { 'a': 1, 'c': 3 }\n */\n function pickBy(object, predicate) {\n if (object == null) {\n return {};\n }\n var props = arrayMap(getAllKeysIn(object), function(prop) {\n return [prop];\n });\n predicate = getIteratee(predicate);\n return basePickBy(object, props, function(value, path) {\n return predicate(value, path[0]);\n });\n }\n\n /**\n * This method is like `_.get` except that if the resolved value is a\n * function it's invoked with the `this` binding of its parent object and\n * its result is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to resolve.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c1': 3, 'c2': _.constant(4) } }] };\n *\n * _.result(object, 'a[0].b.c1');\n * // => 3\n *\n * _.result(object, 'a[0].b.c2');\n * // => 4\n *\n * _.result(object, 'a[0].b.c3', 'default');\n * // => 'default'\n *\n * _.result(object, 'a[0].b.c3', _.constant('default'));\n * // => 'default'\n */\n function result(object, path, defaultValue) {\n path = castPath(path, object);\n\n var index = -1,\n length = path.length;\n\n // Ensure the loop is entered when path is empty.\n if (!length) {\n length = 1;\n object = undefined;\n }\n while (++index < length) {\n var value = object == null ? undefined : object[toKey(path[index])];\n if (value === undefined) {\n index = length;\n value = defaultValue;\n }\n object = isFunction(value) ? value.call(object) : value;\n }\n return object;\n }\n\n /**\n * Sets the value at `path` of `object`. If a portion of `path` doesn't exist,\n * it's created. Arrays are created for missing index properties while objects\n * are created for all other missing properties. Use `_.setWith` to customize\n * `path` creation.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.set(object, 'a[0].b.c', 4);\n * console.log(object.a[0].b.c);\n * // => 4\n *\n * _.set(object, ['x', '0', 'y', 'z'], 5);\n * console.log(object.x[0].y.z);\n * // => 5\n */\n function set(object, path, value) {\n return object == null ? object : baseSet(object, path, value);\n }\n\n /**\n * This method is like `_.set` except that it accepts `customizer` which is\n * invoked to produce the objects of `path`. If `customizer` returns `undefined`\n * path creation is handled by the method instead. The `customizer` is invoked\n * with three arguments: (nsValue, key, nsObject).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {};\n *\n * _.setWith(object, '[0][1]', 'a', Object);\n * // => { '0': { '1': 'a' } }\n */\n function setWith(object, path, value, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return object == null ? object : baseSet(object, path, value, customizer);\n }\n\n /**\n * Creates an array of own enumerable string keyed-value pairs for `object`\n * which can be consumed by `_.fromPairs`. If `object` is a map or set, its\n * entries are returned.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias entries\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the key-value pairs.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.toPairs(new Foo);\n * // => [['a', 1], ['b', 2]] (iteration order is not guaranteed)\n */\n var toPairs = createToPairs(keys);\n\n /**\n * Creates an array of own and inherited enumerable string keyed-value pairs\n * for `object` which can be consumed by `_.fromPairs`. If `object` is a map\n * or set, its entries are returned.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias entriesIn\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the key-value pairs.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.toPairsIn(new Foo);\n * // => [['a', 1], ['b', 2], ['c', 3]] (iteration order is not guaranteed)\n */\n var toPairsIn = createToPairs(keysIn);\n\n /**\n * An alternative to `_.reduce`; this method transforms `object` to a new\n * `accumulator` object which is the result of running each of its own\n * enumerable string keyed properties thru `iteratee`, with each invocation\n * potentially mutating the `accumulator` object. If `accumulator` is not\n * provided, a new object with the same `[[Prototype]]` will be used. The\n * iteratee is invoked with four arguments: (accumulator, value, key, object).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 1.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The custom accumulator value.\n * @returns {*} Returns the accumulated value.\n * @example\n *\n * _.transform([2, 3, 4], function(result, n) {\n * result.push(n *= n);\n * return n % 2 == 0;\n * }, []);\n * // => [4, 9]\n *\n * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n * (result[value] || (result[value] = [])).push(key);\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] }\n */\n function transform(object, iteratee, accumulator) {\n var isArr = isArray(object),\n isArrLike = isArr || isBuffer(object) || isTypedArray(object);\n\n iteratee = getIteratee(iteratee, 4);\n if (accumulator == null) {\n var Ctor = object && object.constructor;\n if (isArrLike) {\n accumulator = isArr ? new Ctor : [];\n }\n else if (isObject(object)) {\n accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};\n }\n else {\n accumulator = {};\n }\n }\n (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {\n return iteratee(accumulator, value, index, object);\n });\n return accumulator;\n }\n\n /**\n * Removes the property at `path` of `object`.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to unset.\n * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 7 } }] };\n * _.unset(object, 'a[0].b.c');\n * // => true\n *\n * console.log(object);\n * // => { 'a': [{ 'b': {} }] };\n *\n * _.unset(object, ['a', '0', 'b', 'c']);\n * // => true\n *\n * console.log(object);\n * // => { 'a': [{ 'b': {} }] };\n */\n function unset(object, path) {\n return object == null ? true : baseUnset(object, path);\n }\n\n /**\n * This method is like `_.set` except that accepts `updater` to produce the\n * value to set. Use `_.updateWith` to customize `path` creation. The `updater`\n * is invoked with one argument: (value).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {Function} updater The function to produce the updated value.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.update(object, 'a[0].b.c', function(n) { return n * n; });\n * console.log(object.a[0].b.c);\n * // => 9\n *\n * _.update(object, 'x[0].y.z', function(n) { return n ? n + 1 : 0; });\n * console.log(object.x[0].y.z);\n * // => 0\n */\n function update(object, path, updater) {\n return object == null ? object : baseUpdate(object, path, castFunction(updater));\n }\n\n /**\n * This method is like `_.update` except that it accepts `customizer` which is\n * invoked to produce the objects of `path`. If `customizer` returns `undefined`\n * path creation is handled by the method instead. The `customizer` is invoked\n * with three arguments: (nsValue, key, nsObject).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {Function} updater The function to produce the updated value.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {};\n *\n * _.updateWith(object, '[0][1]', _.constant('a'), Object);\n * // => { '0': { '1': 'a' } }\n */\n function updateWith(object, path, updater, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return object == null ? object : baseUpdate(object, path, castFunction(updater), customizer);\n }\n\n /**\n * Creates an array of the own enumerable string keyed property values of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property values.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.values(new Foo);\n * // => [1, 2] (iteration order is not guaranteed)\n *\n * _.values('hi');\n * // => ['h', 'i']\n */\n function values(object) {\n return object == null ? [] : baseValues(object, keys(object));\n }\n\n /**\n * Creates an array of the own and inherited enumerable string keyed property\n * values of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property values.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.valuesIn(new Foo);\n * // => [1, 2, 3] (iteration order is not guaranteed)\n */\n function valuesIn(object) {\n return object == null ? [] : baseValues(object, keysIn(object));\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Clamps `number` within the inclusive `lower` and `upper` bounds.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Number\n * @param {number} number The number to clamp.\n * @param {number} [lower] The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the clamped number.\n * @example\n *\n * _.clamp(-10, -5, 5);\n * // => -5\n *\n * _.clamp(10, -5, 5);\n * // => 5\n */\n function clamp(number, lower, upper) {\n if (upper === undefined) {\n upper = lower;\n lower = undefined;\n }\n if (upper !== undefined) {\n upper = toNumber(upper);\n upper = upper === upper ? upper : 0;\n }\n if (lower !== undefined) {\n lower = toNumber(lower);\n lower = lower === lower ? lower : 0;\n }\n return baseClamp(toNumber(number), lower, upper);\n }\n\n /**\n * Checks if `n` is between `start` and up to, but not including, `end`. If\n * `end` is not specified, it's set to `start` with `start` then set to `0`.\n * If `start` is greater than `end` the params are swapped to support\n * negative ranges.\n *\n * @static\n * @memberOf _\n * @since 3.3.0\n * @category Number\n * @param {number} number The number to check.\n * @param {number} [start=0] The start of the range.\n * @param {number} end The end of the range.\n * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n * @see _.range, _.rangeRight\n * @example\n *\n * _.inRange(3, 2, 4);\n * // => true\n *\n * _.inRange(4, 8);\n * // => true\n *\n * _.inRange(4, 2);\n * // => false\n *\n * _.inRange(2, 2);\n * // => false\n *\n * _.inRange(1.2, 2);\n * // => true\n *\n * _.inRange(5.2, 4);\n * // => false\n *\n * _.inRange(-3, -2, -6);\n * // => true\n */\n function inRange(number, start, end) {\n start = toFinite(start);\n if (end === undefined) {\n end = start;\n start = 0;\n } else {\n end = toFinite(end);\n }\n number = toNumber(number);\n return baseInRange(number, start, end);\n }\n\n /**\n * Produces a random number between the inclusive `lower` and `upper` bounds.\n * If only one argument is provided a number between `0` and the given number\n * is returned. If `floating` is `true`, or either `lower` or `upper` are\n * floats, a floating-point number is returned instead of an integer.\n *\n * **Note:** JavaScript follows the IEEE-754 standard for resolving\n * floating-point values which can produce unexpected results.\n *\n * @static\n * @memberOf _\n * @since 0.7.0\n * @category Number\n * @param {number} [lower=0] The lower bound.\n * @param {number} [upper=1] The upper bound.\n * @param {boolean} [floating] Specify returning a floating-point number.\n * @returns {number} Returns the random number.\n * @example\n *\n * _.random(0, 5);\n * // => an integer between 0 and 5\n *\n * _.random(5);\n * // => also an integer between 0 and 5\n *\n * _.random(5, true);\n * // => a floating-point number between 0 and 5\n *\n * _.random(1.2, 5.2);\n * // => a floating-point number between 1.2 and 5.2\n */\n function random(lower, upper, floating) {\n if (floating && typeof floating != 'boolean' && isIterateeCall(lower, upper, floating)) {\n upper = floating = undefined;\n }\n if (floating === undefined) {\n if (typeof upper == 'boolean') {\n floating = upper;\n upper = undefined;\n }\n else if (typeof lower == 'boolean') {\n floating = lower;\n lower = undefined;\n }\n }\n if (lower === undefined && upper === undefined) {\n lower = 0;\n upper = 1;\n }\n else {\n lower = toFinite(lower);\n if (upper === undefined) {\n upper = lower;\n lower = 0;\n } else {\n upper = toFinite(upper);\n }\n }\n if (lower > upper) {\n var temp = lower;\n lower = upper;\n upper = temp;\n }\n if (floating || lower % 1 || upper % 1) {\n var rand = nativeRandom();\n return nativeMin(lower + (rand * (upper - lower + freeParseFloat('1e-' + ((rand + '').length - 1)))), upper);\n }\n return baseRandom(lower, upper);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Converts `string` to [camel case](https://en.wikipedia.org/wiki/CamelCase).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the camel cased string.\n * @example\n *\n * _.camelCase('Foo Bar');\n * // => 'fooBar'\n *\n * _.camelCase('--foo-bar--');\n * // => 'fooBar'\n *\n * _.camelCase('__FOO_BAR__');\n * // => 'fooBar'\n */\n var camelCase = createCompounder(function(result, word, index) {\n word = word.toLowerCase();\n return result + (index ? capitalize(word) : word);\n });\n\n /**\n * Converts the first character of `string` to upper case and the remaining\n * to lower case.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to capitalize.\n * @returns {string} Returns the capitalized string.\n * @example\n *\n * _.capitalize('FRED');\n * // => 'Fred'\n */\n function capitalize(string) {\n return upperFirst(toString(string).toLowerCase());\n }\n\n /**\n * Deburrs `string` by converting\n * [Latin-1 Supplement](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)\n * and [Latin Extended-A](https://en.wikipedia.org/wiki/Latin_Extended-A)\n * letters to basic Latin letters and removing\n * [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to deburr.\n * @returns {string} Returns the deburred string.\n * @example\n *\n * _.deburr('déjà vu');\n * // => 'deja vu'\n */\n function deburr(string) {\n string = toString(string);\n return string && string.replace(reLatin, deburrLetter).replace(reComboMark, '');\n }\n\n /**\n * Checks if `string` ends with the given target string.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to inspect.\n * @param {string} [target] The string to search for.\n * @param {number} [position=string.length] The position to search up to.\n * @returns {boolean} Returns `true` if `string` ends with `target`,\n * else `false`.\n * @example\n *\n * _.endsWith('abc', 'c');\n * // => true\n *\n * _.endsWith('abc', 'b');\n * // => false\n *\n * _.endsWith('abc', 'b', 2);\n * // => true\n */\n function endsWith(string, target, position) {\n string = toString(string);\n target = baseToString(target);\n\n var length = string.length;\n position = position === undefined\n ? length\n : baseClamp(toInteger(position), 0, length);\n\n var end = position;\n position -= target.length;\n return position >= 0 && string.slice(position, end) == target;\n }\n\n /**\n * Converts the characters \"&\", \"<\", \">\", '\"', and \"'\" in `string` to their\n * corresponding HTML entities.\n *\n * **Note:** No other characters are escaped. To escape additional\n * characters use a third-party library like [_he_](https://mths.be/he).\n *\n * Though the \">\" character is escaped for symmetry, characters like\n * \">\" and \"/\" don't need escaping in HTML and have no special meaning\n * unless they're part of a tag or unquoted attribute value. See\n * [Mathias Bynens's article](https://mathiasbynens.be/notes/ambiguous-ampersands)\n * (under \"semi-related fun fact\") for more details.\n *\n * When working with HTML you should always\n * [quote attribute values](http://wonko.com/post/html-escaping) to reduce\n * XSS vectors.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category String\n * @param {string} [string=''] The string to escape.\n * @returns {string} Returns the escaped string.\n * @example\n *\n * _.escape('fred, barney, & pebbles');\n * // => 'fred, barney, & pebbles'\n */\n function escape(string) {\n string = toString(string);\n return (string && reHasUnescapedHtml.test(string))\n ? string.replace(reUnescapedHtml, escapeHtmlChar)\n : string;\n }\n\n /**\n * Escapes the `RegExp` special characters \"^\", \"$\", \"\\\", \".\", \"*\", \"+\",\n * \"?\", \"(\", \")\", \"[\", \"]\", \"{\", \"}\", and \"|\" in `string`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to escape.\n * @returns {string} Returns the escaped string.\n * @example\n *\n * _.escapeRegExp('[lodash](https://lodash.com/)');\n * // => '\\[lodash\\]\\(https://lodash\\.com/\\)'\n */\n function escapeRegExp(string) {\n string = toString(string);\n return (string && reHasRegExpChar.test(string))\n ? string.replace(reRegExpChar, '\\\\$&')\n : string;\n }\n\n /**\n * Converts `string` to\n * [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the kebab cased string.\n * @example\n *\n * _.kebabCase('Foo Bar');\n * // => 'foo-bar'\n *\n * _.kebabCase('fooBar');\n * // => 'foo-bar'\n *\n * _.kebabCase('__FOO_BAR__');\n * // => 'foo-bar'\n */\n var kebabCase = createCompounder(function(result, word, index) {\n return result + (index ? '-' : '') + word.toLowerCase();\n });\n\n /**\n * Converts `string`, as space separated words, to lower case.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the lower cased string.\n * @example\n *\n * _.lowerCase('--Foo-Bar--');\n * // => 'foo bar'\n *\n * _.lowerCase('fooBar');\n * // => 'foo bar'\n *\n * _.lowerCase('__FOO_BAR__');\n * // => 'foo bar'\n */\n var lowerCase = createCompounder(function(result, word, index) {\n return result + (index ? ' ' : '') + word.toLowerCase();\n });\n\n /**\n * Converts the first character of `string` to lower case.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.lowerFirst('Fred');\n * // => 'fred'\n *\n * _.lowerFirst('FRED');\n * // => 'fRED'\n */\n var lowerFirst = createCaseFirst('toLowerCase');\n\n /**\n * Pads `string` on the left and right sides if it's shorter than `length`.\n * Padding characters are truncated if they can't be evenly divided by `length`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * _.pad('abc', 8);\n * // => ' abc '\n *\n * _.pad('abc', 8, '_-');\n * // => '_-abc_-_'\n *\n * _.pad('abc', 3);\n * // => 'abc'\n */\n function pad(string, length, chars) {\n string = toString(string);\n length = toInteger(length);\n\n var strLength = length ? stringSize(string) : 0;\n if (!length || strLength >= length) {\n return string;\n }\n var mid = (length - strLength) / 2;\n return (\n createPadding(nativeFloor(mid), chars) +\n string +\n createPadding(nativeCeil(mid), chars)\n );\n }\n\n /**\n * Pads `string` on the right side if it's shorter than `length`. Padding\n * characters are truncated if they exceed `length`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * _.padEnd('abc', 6);\n * // => 'abc '\n *\n * _.padEnd('abc', 6, '_-');\n * // => 'abc_-_'\n *\n * _.padEnd('abc', 3);\n * // => 'abc'\n */\n function padEnd(string, length, chars) {\n string = toString(string);\n length = toInteger(length);\n\n var strLength = length ? stringSize(string) : 0;\n return (length && strLength < length)\n ? (string + createPadding(length - strLength, chars))\n : string;\n }\n\n /**\n * Pads `string` on the left side if it's shorter than `length`. Padding\n * characters are truncated if they exceed `length`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * _.padStart('abc', 6);\n * // => ' abc'\n *\n * _.padStart('abc', 6, '_-');\n * // => '_-_abc'\n *\n * _.padStart('abc', 3);\n * // => 'abc'\n */\n function padStart(string, length, chars) {\n string = toString(string);\n length = toInteger(length);\n\n var strLength = length ? stringSize(string) : 0;\n return (length && strLength < length)\n ? (createPadding(length - strLength, chars) + string)\n : string;\n }\n\n /**\n * Converts `string` to an integer of the specified radix. If `radix` is\n * `undefined` or `0`, a `radix` of `10` is used unless `value` is a\n * hexadecimal, in which case a `radix` of `16` is used.\n *\n * **Note:** This method aligns with the\n * [ES5 implementation](https://es5.github.io/#x15.1.2.2) of `parseInt`.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category String\n * @param {string} string The string to convert.\n * @param {number} [radix=10] The radix to interpret `value` by.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.parseInt('08');\n * // => 8\n *\n * _.map(['6', '08', '10'], _.parseInt);\n * // => [6, 8, 10]\n */\n function parseInt(string, radix, guard) {\n if (guard || radix == null) {\n radix = 0;\n } else if (radix) {\n radix = +radix;\n }\n return nativeParseInt(toString(string).replace(reTrimStart, ''), radix || 0);\n }\n\n /**\n * Repeats the given string `n` times.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to repeat.\n * @param {number} [n=1] The number of times to repeat the string.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {string} Returns the repeated string.\n * @example\n *\n * _.repeat('*', 3);\n * // => '***'\n *\n * _.repeat('abc', 2);\n * // => 'abcabc'\n *\n * _.repeat('abc', 0);\n * // => ''\n */\n function repeat(string, n, guard) {\n if ((guard ? isIterateeCall(string, n, guard) : n === undefined)) {\n n = 1;\n } else {\n n = toInteger(n);\n }\n return baseRepeat(toString(string), n);\n }\n\n /**\n * Replaces matches for `pattern` in `string` with `replacement`.\n *\n * **Note:** This method is based on\n * [`String#replace`](https://mdn.io/String/replace).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to modify.\n * @param {RegExp|string} pattern The pattern to replace.\n * @param {Function|string} replacement The match replacement.\n * @returns {string} Returns the modified string.\n * @example\n *\n * _.replace('Hi Fred', 'Fred', 'Barney');\n * // => 'Hi Barney'\n */\n function replace() {\n var args = arguments,\n string = toString(args[0]);\n\n return args.length < 3 ? string : string.replace(args[1], args[2]);\n }\n\n /**\n * Converts `string` to\n * [snake case](https://en.wikipedia.org/wiki/Snake_case).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the snake cased string.\n * @example\n *\n * _.snakeCase('Foo Bar');\n * // => 'foo_bar'\n *\n * _.snakeCase('fooBar');\n * // => 'foo_bar'\n *\n * _.snakeCase('--FOO-BAR--');\n * // => 'foo_bar'\n */\n var snakeCase = createCompounder(function(result, word, index) {\n return result + (index ? '_' : '') + word.toLowerCase();\n });\n\n /**\n * Splits `string` by `separator`.\n *\n * **Note:** This method is based on\n * [`String#split`](https://mdn.io/String/split).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to split.\n * @param {RegExp|string} separator The separator pattern to split by.\n * @param {number} [limit] The length to truncate results to.\n * @returns {Array} Returns the string segments.\n * @example\n *\n * _.split('a-b-c', '-', 2);\n * // => ['a', 'b']\n */\n function split(string, separator, limit) {\n if (limit && typeof limit != 'number' && isIterateeCall(string, separator, limit)) {\n separator = limit = undefined;\n }\n limit = limit === undefined ? MAX_ARRAY_LENGTH : limit >>> 0;\n if (!limit) {\n return [];\n }\n string = toString(string);\n if (string && (\n typeof separator == 'string' ||\n (separator != null && !isRegExp(separator))\n )) {\n separator = baseToString(separator);\n if (!separator && hasUnicode(string)) {\n return castSlice(stringToArray(string), 0, limit);\n }\n }\n return string.split(separator, limit);\n }\n\n /**\n * Converts `string` to\n * [start case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage).\n *\n * @static\n * @memberOf _\n * @since 3.1.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the start cased string.\n * @example\n *\n * _.startCase('--foo-bar--');\n * // => 'Foo Bar'\n *\n * _.startCase('fooBar');\n * // => 'Foo Bar'\n *\n * _.startCase('__FOO_BAR__');\n * // => 'FOO BAR'\n */\n var startCase = createCompounder(function(result, word, index) {\n return result + (index ? ' ' : '') + upperFirst(word);\n });\n\n /**\n * Checks if `string` starts with the given target string.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to inspect.\n * @param {string} [target] The string to search for.\n * @param {number} [position=0] The position to search from.\n * @returns {boolean} Returns `true` if `string` starts with `target`,\n * else `false`.\n * @example\n *\n * _.startsWith('abc', 'a');\n * // => true\n *\n * _.startsWith('abc', 'b');\n * // => false\n *\n * _.startsWith('abc', 'b', 1);\n * // => true\n */\n function startsWith(string, target, position) {\n string = toString(string);\n position = position == null\n ? 0\n : baseClamp(toInteger(position), 0, string.length);\n\n target = baseToString(target);\n return string.slice(position, position + target.length) == target;\n }\n\n /**\n * Creates a compiled template function that can interpolate data properties\n * in \"interpolate\" delimiters, HTML-escape interpolated data properties in\n * \"escape\" delimiters, and execute JavaScript in \"evaluate\" delimiters. Data\n * properties may be accessed as free variables in the template. If a setting\n * object is given, it takes precedence over `_.templateSettings` values.\n *\n * **Note:** In the development build `_.template` utilizes\n * [sourceURLs](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl)\n * for easier debugging.\n *\n * For more information on precompiling templates see\n * [lodash's custom builds documentation](https://lodash.com/custom-builds).\n *\n * For more information on Chrome extension sandboxes see\n * [Chrome's extensions documentation](https://developer.chrome.com/extensions/sandboxingEval).\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category String\n * @param {string} [string=''] The template string.\n * @param {Object} [options={}] The options object.\n * @param {RegExp} [options.escape=_.templateSettings.escape]\n * The HTML \"escape\" delimiter.\n * @param {RegExp} [options.evaluate=_.templateSettings.evaluate]\n * The \"evaluate\" delimiter.\n * @param {Object} [options.imports=_.templateSettings.imports]\n * An object to import into the template as free variables.\n * @param {RegExp} [options.interpolate=_.templateSettings.interpolate]\n * The \"interpolate\" delimiter.\n * @param {string} [options.sourceURL='lodash.templateSources[n]']\n * The sourceURL of the compiled template.\n * @param {string} [options.variable='obj']\n * The data object variable name.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the compiled template function.\n * @example\n *\n * // Use the \"interpolate\" delimiter to create a compiled template.\n * var compiled = _.template('hello <%= user %>!');\n * compiled({ 'user': 'fred' });\n * // => 'hello fred!'\n *\n * // Use the HTML \"escape\" delimiter to escape data property values.\n * var compiled = _.template('<%- value %>');\n * compiled({ 'value': '\r\n","import mod from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./CalendarIcon.vue?vue&type=script&lang=js&\"; export default mod; export * from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./CalendarIcon.vue?vue&type=script&lang=js&\"","import { render, staticRenderFns } from \"./CalendarIcon.vue?vue&type=template&id=896828b2&\"\nimport script from \"./CalendarIcon.vue?vue&type=script&lang=js&\"\nexport * from \"./CalendarIcon.vue?vue&type=script&lang=js&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n null,\n null\n \n)\n\nexport default component.exports","module.exports = __webpack_public_path__ + \"img/map.1426558d.svg\";","module.exports = __webpack_public_path__ + \"img/icon.7f8d33da.svg\";","module.exports = __webpack_public_path__ + \"img/icon_base.d8caffb2.svg\";","module.exports = __webpack_public_path__ + \"img/seniors.546e36e6.svg\";","module.exports = __webpack_public_path__ + \"img/family.77e3f707.svg\";","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('div',{staticClass:\"contact-info\",class:{ 'is-dark': _vm.isDark }},[_vm._m(0),_vm._m(1),_vm._m(2)])}\nvar staticRenderFns = [function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('div',{staticClass:\"contact-info-item\"},[_c('h4',[_c('img',{attrs:{\"src\":require(\"@/assets/img/phone_blue.png\"),\"width\":\"26\"}}),_vm._v(\" TELEFONE/WHATSAPP \")]),_c('p',[_c('span',{staticClass:\"big\"},[_vm._v(\"(11) 3376-0100\")]),_vm._v(\" - Matriz\"),_c('br'),_vm._v(\"Atendimento de segunda a sexta das 8h às 17h \")])])},function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('div',{staticClass:\"contact-info-item\"},[_c('h4',[_c('img',{attrs:{\"src\":require(\"@/assets/img/svg/email.svg\"),\"width\":\"20\"}}),_vm._v(\"E-MAIL\")]),_c('p',[_c('span',{staticClass:\"big\"},[_vm._v(\"atendimento@crivelli.com.br\")])])])},function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('div',{staticClass:\"contact-info-item\"},[_c('h4',[_vm._v(\"BAIXE NOSSO APLICATIVO\")]),_c('a',{staticClass:\"icon-app\",attrs:{\"href\":\"https://play.google.com/store/apps/details?id=br.com.appfactory.crivelli\",\"target\":\"_blank\"}},[_c('img',{attrs:{\"title\":\"Google Store\",\"src\":require(\"@/assets/img/svg/download_google_app.svg\")}})]),_c('a',{staticClass:\"icon-app\",attrs:{\"href\":\"https://apps.apple.com/br/app/crivelli-advogados/id1271369437\",\"target\":\"_blank\"}},[_c('img',{attrs:{\"title\":\"Apple Store\",\"src\":require(\"@/assets/img/svg/download_apple_store.svg\")}})])])}]\n\nexport { render, staticRenderFns }","\r\n\r\n\r\n\r\n\r\n","import mod from \"-!../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../node_modules/thread-loader/dist/cjs.js!../../node_modules/babel-loader/lib/index.js!../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../node_modules/vue-loader/lib/index.js??vue-loader-options!./ContactInfo.vue?vue&type=script&lang=js&\"; export default mod; export * from \"-!../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../node_modules/thread-loader/dist/cjs.js!../../node_modules/babel-loader/lib/index.js!../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../node_modules/vue-loader/lib/index.js??vue-loader-options!./ContactInfo.vue?vue&type=script&lang=js&\"","import { render, staticRenderFns } from \"./ContactInfo.vue?vue&type=template&id=211dd1e1&\"\nimport script from \"./ContactInfo.vue?vue&type=script&lang=js&\"\nexport * from \"./ContactInfo.vue?vue&type=script&lang=js&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n null,\n null\n \n)\n\nexport default component.exports","module.exports = __webpack_public_path__ + \"img/youtube.8d087817.svg\";","var map = {\n\t\"./arrow-left.svg\": \"76d5\",\n\t\"./articles.svg\": \"0476\",\n\t\"./banner_home.svg\": \"1c88\",\n\t\"./bg_app.svg\": \"d197\",\n\t\"./bg_app_small.svg\": \"30b0\",\n\t\"./blue_logo.svg\": \"6a91\",\n\t\"./blue_whatsapp.svg\": \"c13b\",\n\t\"./brasil.svg\": \"8228\",\n\t\"./brasil.svg.2020_08_12_22_43_13.0.svg\": \"809a\",\n\t\"./chevron.svg\": \"da5b\",\n\t\"./civil.svg\": \"0325\",\n\t\"./close.svg\": \"58a4\",\n\t\"./compliance.svg\": \"0ab6\",\n\t\"./dike_logo.svg\": \"ab78\",\n\t\"./diversidade.svg\": \"1329\",\n\t\"./download_apple_store.svg\": \"cd00\",\n\t\"./download_google_app.svg\": \"6c24\",\n\t\"./email.svg\": \"b267\",\n\t\"./events.svg\": \"f4c2\",\n\t\"./expertise_area_logo.svg\": \"1e58\",\n\t\"./facebook.svg\": \"34ad\",\n\t\"./familia.svg\": \"7354\",\n\t\"./family.svg\": \"4809\",\n\t\"./icon.svg\": \"3d9a\",\n\t\"./icon_base.svg\": \"425e\",\n\t\"./instagram.svg\": \"c1c5\",\n\t\"./linkedin.svg\": \"d61f\",\n\t\"./linkedin_square.svg\": \"dcc5\",\n\t\"./logo.svg\": \"1ea0\",\n\t\"./logo_icon_left.svg\": \"faa6\",\n\t\"./logo_icone_esquerda.svg\": \"b4a4\",\n\t\"./map.svg\": \"38f6\",\n\t\"./map_marker.svg\": \"b6d7\",\n\t\"./medical.svg\": \"c726\",\n\t\"./menu.svg\": \"c399\",\n\t\"./mobile_qr_code.svg\": \"a60d\",\n\t\"./most_read.svg\": \"70ab\",\n\t\"./mouse.svg\": \"6610\",\n\t\"./news.svg\": \"1161\",\n\t\"./outlined_icon.svg\": \"7912\",\n\t\"./podcast.svg\": \"e5a4\",\n\t\"./search.svg\": \"c6a2\",\n\t\"./seniors.svg\": \"45f1\",\n\t\"./societario.svg\": \"d555\",\n\t\"./tributario.svg\": \"1899\",\n\t\"./video.svg\": \"b91c\",\n\t\"./whatsapp.svg\": \"0bb3\",\n\t\"./white_calendar.svg\": \"76e4\",\n\t\"./white_civil.svg\": \"d905\",\n\t\"./white_facebook.svg\": \"98ad\",\n\t\"./white_family.svg\": \"8745\",\n\t\"./white_icon.svg\": \"07c6\",\n\t\"./white_icon_outlined.svg\": \"1a4a\",\n\t\"./white_linkedin.svg\": \"8e71\",\n\t\"./white_logo.svg\": \"8181\",\n\t\"./white_medical.svg\": \"9820\",\n\t\"./white_seniors.svg\": \"9dc1\",\n\t\"./white_whatsapp.svg\": \"73e5\",\n\t\"./white_workers.svg\": \"cddd\",\n\t\"./white_youtube.svg\": \"963d\",\n\t\"./workers.svg\": \"d24d\",\n\t\"./youtube.svg\": \"5352\"\n};\n\n\nfunction webpackContext(req) {\n\tvar id = webpackContextResolve(req);\n\treturn __webpack_require__(id);\n}\nfunction webpackContextResolve(req) {\n\tif(!__webpack_require__.o(map, req)) {\n\t\tvar e = new Error(\"Cannot find module '\" + req + \"'\");\n\t\te.code = 'MODULE_NOT_FOUND';\n\t\tthrow e;\n\t}\n\treturn map[req];\n}\nwebpackContext.keys = function webpackContextKeys() {\n\treturn Object.keys(map);\n};\nwebpackContext.resolve = webpackContextResolve;\nmodule.exports = webpackContext;\nwebpackContext.id = \"57ae\";","module.exports = __webpack_public_path__ + \"img/close.a0aea2b0.svg\";","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('section',{staticClass:\"site-section expertise-area\"},[_c('div',{staticClass:\"site-container\"},[(_vm.showTitle)?_c('h2',[_c('img',{attrs:{\"src\":require(\"@/assets/img/svg/icon.svg\"),\"alt\":\"Crivelli\",\"width\":\"25\"}}),_vm._v(_vm._s(_vm.title))]):_vm._e(),_c('div',{staticClass:\"expertise-area-box-wrapper\"},[_c('div',{staticClass:\"expertise-area-box\",class:{'mobile-direction-v' : _vm.mobileVertical, 'is-small' : _vm.small},style:({transform: _vm.transform})},_vm._l((_vm.items),function(item){return _c('div',{key:(\"eai-\" + (item.icon)),staticClass:\"expertise-area-item\"},[(item.icon != null)?_c('img',{staticClass:\"icon\",attrs:{\"src\":require((\"@/assets/img/svg/\" + (item.icon) + \".svg\"))}}):_vm._e(),_c('h4',[_vm._v(_vm._s(item.title))]),_c('router-link',{attrs:{\"to\":{name: 'expertise_area_detail', params: {slug: item.slug}}}},[_vm._v(\"Saiba Mais \"),_c('arrow-horizontal')],1)],1)}),0)]),(!_vm.mobileVertical)?_c('div',{staticClass:\"show-mobile\"},[_c('bullets',{attrs:{\"items\":Object.keys(_vm.items).map(Number),\"current\":_vm.mobileCurrentIndex},on:{\"update:current\":function($event){_vm.mobileCurrentIndex=$event}}})],1):_vm._e()])])}\nvar staticRenderFns = []\n\nexport { render, staticRenderFns }","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('div',{staticClass:\"bullets\"},_vm._l((_vm.items),function(i){return _c('a',{key:(\"bullet-\" + i),staticClass:\"bullet-item\",class:{active: i == _vm.current},on:{\"click\":function($event){return _vm.select(i)}}})}),0)}\nvar staticRenderFns = []\n\nexport { render, staticRenderFns }","\r\n\r\n\r\n\r\n\r\n","import mod from \"-!../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../node_modules/thread-loader/dist/cjs.js!../../node_modules/babel-loader/lib/index.js!../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../node_modules/vue-loader/lib/index.js??vue-loader-options!./Bullets.vue?vue&type=script&lang=js&\"; export default mod; export * from \"-!../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../node_modules/thread-loader/dist/cjs.js!../../node_modules/babel-loader/lib/index.js!../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../node_modules/vue-loader/lib/index.js??vue-loader-options!./Bullets.vue?vue&type=script&lang=js&\"","import { render, staticRenderFns } from \"./Bullets.vue?vue&type=template&id=32b26ff4&\"\nimport script from \"./Bullets.vue?vue&type=script&lang=js&\"\nexport * from \"./Bullets.vue?vue&type=script&lang=js&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n null,\n null\n \n)\n\nexport default component.exports","\r\n\r\n\r\n","import mod from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./ExpertiseArea.vue?vue&type=script&lang=js&\"; export default mod; export * from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./ExpertiseArea.vue?vue&type=script&lang=js&\"","import { render, staticRenderFns } from \"./ExpertiseArea.vue?vue&type=template&id=e5164a6c&\"\nimport script from \"./ExpertiseArea.vue?vue&type=script&lang=js&\"\nexport * from \"./ExpertiseArea.vue?vue&type=script&lang=js&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n null,\n null\n \n)\n\nexport default component.exports","module.exports = function(module) {\n\tif (!module.webpackPolyfill) {\n\t\tmodule.deprecate = function() {};\n\t\tmodule.paths = [];\n\t\t// module.parent = undefined by default\n\t\tif (!module.children) module.children = [];\n\t\tObject.defineProperty(module, \"loaded\", {\n\t\t\tenumerable: true,\n\t\t\tget: function() {\n\t\t\t\treturn module.l;\n\t\t\t}\n\t\t});\n\t\tObject.defineProperty(module, \"id\", {\n\t\t\tenumerable: true,\n\t\t\tget: function() {\n\t\t\t\treturn module.i;\n\t\t\t}\n\t\t});\n\t\tmodule.webpackPolyfill = 1;\n\t}\n\treturn module;\n};\n","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('section',{staticClass:\"download-app-section\"},[_c('div',{staticClass:\"download-app\",class:{ 'is-small': _vm.small }},[_vm._m(0),_c('div',{staticClass:\"download-app-image\"})])])}\nvar staticRenderFns = [function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('div',{staticClass:\"download-app-content\"},[_c('h3',[_vm._v(\"Baixe nosso Aplicativo\")]),_c('p',[_vm._v(\" Acompanhe seu processo em tempo real pela linha do tempo e com os comentários de seu advogado. Envie e receba documentos de seu processo e se mantenha atualizado sobre seus direitos recebendo os conteúdos exclusivos de Diké, o portal informativo da Crivelli Advogados Associados. Baixe o aplicativo agora! \")]),_c('div',{staticClass:\"download-app-content-logos\"},[_c('a',{attrs:{\"href\":\"https://play.google.com/store/apps/details?id=br.com.appfactory.crivelli\",\"target\":\"_blank\"}},[_c('img',{attrs:{\"title\":\"Google Store\",\"src\":require(\"@/assets/img/svg/download_google_app.svg\")}})]),_c('a',{attrs:{\"href\":\"https://apps.apple.com/br/app/crivelli-advogados/id1271369437\",\"target\":\"_blank\"}},[_c('img',{attrs:{\"title\":\"Apple Store\",\"src\":require(\"@/assets/img/svg/download_apple_store.svg\")}})])])])}]\n\nexport { render, staticRenderFns }","\r\n\r\n\r\n\r\n\r\n","import mod from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./DownloadApp.vue?vue&type=script&lang=js&\"; export default mod; export * from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./DownloadApp.vue?vue&type=script&lang=js&\"","import { render, staticRenderFns } from \"./DownloadApp.vue?vue&type=template&id=71942f2b&\"\nimport script from \"./DownloadApp.vue?vue&type=script&lang=js&\"\nexport * from \"./DownloadApp.vue?vue&type=script&lang=js&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n null,\n null\n \n)\n\nexport default component.exports","module.exports = __webpack_public_path__ + \"img/mouse.6bbbe120.svg\";","module.exports = __webpack_public_path__ + \"img/blue_logo.b72c7d05.svg\";","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('svg',{attrs:{\"xmlns\":\"http://www.w3.org/2000/svg\",\"viewBox\":\"0 0 23.994 23.994\"}},[_c('path',{attrs:{\"d\":\"M11.996 0C5.37 0 0 5.37 0 11.996c0 6.627 5.37 11.998 11.996 11.998s11.998-5.371 11.998-11.998C23.987 5.375 18.62.006 11.996 0zm0 1.713c5.68 0 10.283 4.604 10.283 10.283-.007 5.677-4.606 10.277-10.283 10.283-5.679 0-10.283-4.603-10.283-10.283 0-5.679 4.604-10.283 10.283-10.283zm0 2.57a.856.856 0 00-.855.858v6h-6a.856.856 0 000 1.713h6.855a.858.858 0 00.858-.858V5.141a.858.858 0 00-.858-.858z\"}})])}\nvar staticRenderFns = []\n\nexport { render, staticRenderFns }","import { render, staticRenderFns } from \"./ClockIcon.vue?vue&type=template&id=55cf163e&\"\nvar script = {}\n\n\n/* normalize component */\nimport normalizer from \"!../../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n null,\n null\n \n)\n\nexport default component.exports","module.exports = __webpack_public_path__ + \"img/download_google_app.8ed02a49.svg\";","module.exports = __webpack_public_path__ + \"img/most_read.e4d8ae80.svg\";","module.exports = __webpack_public_path__ + \"img/familia.63757a04.svg\";","module.exports = __webpack_public_path__ + \"img/white_whatsapp.da9e28b5.svg\";","module.exports = __webpack_public_path__ + \"img/arrow-left.6aa468c5.svg\";","module.exports = __webpack_public_path__ + \"img/white_calendar.1afe1964.svg\";","module.exports = __webpack_public_path__ + \"img/outlined_icon.7355ffdd.svg\";","module.exports = __webpack_public_path__ + \"img/brasil.svg.2020_08_12_22_43_13.0.cb82366c.svg\";","module.exports = __webpack_public_path__ + \"img/brasil.100681cf.svg\";","module.exports = __webpack_public_path__ + \"img/white_family.1402b3ff.svg\";","module.exports = __webpack_public_path__ + \"img/white_linkedin.7c588245.svg\";","module.exports = __webpack_public_path__ + \"img/white_youtube.a490f95d.svg\";","module.exports = __webpack_public_path__ + \"img/white_medical.c5b5b7d5.svg\";","module.exports = __webpack_public_path__ + \"img/white_facebook.816b8039.svg\";","module.exports = __webpack_public_path__ + \"img/white_seniors.37adafb9.svg\";","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('div',{staticClass:\"post-card\",class:{ 'is-large': _vm.isLarge },attrs:{\"data-type\":_vm.type}},[_c('div',{staticClass:\"post-card-cover\",class:{ 'is-square-cover': _vm.isSquareCover },style:((\"background-image: url('\" + (_vm.post.image) + \"')\"))}),_c('div',{staticClass:\"post-card-content\"},[([0, 1, 5].includes(_vm.type))?[_c('div',{staticClass:\"post-card-author\"},[_c('small',[_vm._v(\"Por \")]),_c('strong',[_vm._v(_vm._s(_vm.post.author))])]),_c('div',{staticClass:\"post-card-date\"},[_c('calendar-icon',{staticClass:\"icon\",attrs:{\"width\":\"15\"}}),_c('span',[_vm._v(\" \"+_vm._s(_vm.post.posted_at))])],1)]:(_vm.type === 6)?[_c('span',{staticClass:\"post-card-event-tag\"},[_vm._v(\"Evento Online\")])]:_vm._e(),_c('h4',[_c('router-link',{attrs:{\"to\":_vm.to}},[_vm._v(_vm._s(_vm.post.title))])],1),(_vm.type === 6)?[_c('div',{staticClass:\"post-card-event-datetime\"},[_c('span',{staticClass:\"item\"},[_c('calendar-icon',{attrs:{\"width\":\"15\"}}),_vm._v(\" \"+_vm._s(_vm.post.event_date)+\" \")],1),_c('span',{staticClass:\"item\"},[_c('clock-icon',{attrs:{\"width\":\"15\"}}),_vm._v(\" \"+_vm._s(_vm.post.event_hour)+\" \")],1)])]:_vm._e(),(_vm.isLarge)?_c('div',{staticClass:\"post-card-text\"},[_vm._v(_vm._s(_vm.post.text))]):_vm._e(),(_vm.buttonText || _vm.buttonTextOfType)?_c('router-link',{staticClass:\"button button-orange is-outlined is-small\",attrs:{\"to\":_vm.to}},[(_vm.buttonText)?[_vm._v(_vm._s(_vm.buttonText))]:[_vm._v(_vm._s(_vm.buttonTextOfType))]],2):_vm._e()],2)])}\nvar staticRenderFns = []\n\nexport { render, staticRenderFns }","\r\n\r\n\r\n\r\n\r\n","import mod from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./PostCard.vue?vue&type=script&lang=js&\"; export default mod; export * from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./PostCard.vue?vue&type=script&lang=js&\"","import { render, staticRenderFns } from \"./PostCard.vue?vue&type=template&id=5dfaec5d&\"\nimport script from \"./PostCard.vue?vue&type=script&lang=js&\"\nexport * from \"./PostCard.vue?vue&type=script&lang=js&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n null,\n null\n \n)\n\nexport default component.exports","module.exports = __webpack_public_path__ + \"img/mobile_qr_code.cc4a2192.svg\";","module.exports = __webpack_public_path__ + \"img/dike_logo.bbccc975.svg\";","module.exports = __webpack_public_path__ + \"img/email.91c1c2c9.svg\";","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('section',{staticClass:\"site-section newsletter\",class:_vm.theme},[_c('div',{staticClass:\"site-container\"},[_c('div',{staticClass:\"newsletter-item\"},[_c('h4',[_vm._v(\"Newsletter\")]),_c('p',[_vm._v(\"Cadastre seu e-mail e receba informações sobre seus direitos\")]),_c('div',{staticClass:\"input\"},[_c('input',{ref:\"email\",attrs:{\"type\":\"email\",\"placeholder\":\"Digite seu e-mail\"}}),_c('a',{staticClass:\"control text-orange\",on:{\"click\":function($event){return _vm.submitEmail()}}},[_c('div',[_vm._v(\"ENVIAR \"),_c('arrow-horizontal',{attrs:{\"width\":\"18\"}})],1)])])]),_c('div',{staticClass:\"newsletter-item\"},[_c('h4',[_vm._v(\"Siga-nos\")]),_c('p',[_vm._v(\"Siga-nos através da rede social de sua preferência.\")]),_c('social-networks',{attrs:{\"icon-width\":\"35\"}})],1),_c('modal',{attrs:{\"active\":_vm.modalContactIsOpen},on:{\"update:active\":function($event){_vm.modalContactIsOpen=$event}}},[_c('div',{staticClass:\"text-center\"},[_c('h3',[_vm._v(\"Sua mensagem foi enviada com sucesso!\")])])])],1)])}\nvar staticRenderFns = []\n\nexport { render, staticRenderFns }","\r\n\r\n\r\n\r\n\r\n","import mod from \"-!../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../node_modules/thread-loader/dist/cjs.js!../../node_modules/babel-loader/lib/index.js!../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../node_modules/vue-loader/lib/index.js??vue-loader-options!./Newsletter.vue?vue&type=script&lang=js&\"; export default mod; export * from \"-!../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../node_modules/thread-loader/dist/cjs.js!../../node_modules/babel-loader/lib/index.js!../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../node_modules/vue-loader/lib/index.js??vue-loader-options!./Newsletter.vue?vue&type=script&lang=js&\"","import { render, staticRenderFns } from \"./Newsletter.vue?vue&type=template&id=12e3feea&\"\nimport script from \"./Newsletter.vue?vue&type=script&lang=js&\"\nexport * from \"./Newsletter.vue?vue&type=script&lang=js&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n null,\n null\n \n)\n\nexport default component.exports","module.exports = __webpack_public_path__ + \"img/logo_icone_esquerda.60236e25.svg\";","module.exports = __webpack_public_path__ + \"img/map_marker.1e132c82.svg\";","module.exports = __webpack_public_path__ + \"img/video.54035297.svg\";","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('div',[_c('home-banner'),_c('div',{attrs:{\"id\":\"main-content\"}},[_c('expertise-area',{attrs:{\"items\":_vm.areas}}),_c('story'),_c('team',{attrs:{\"items\":_vm.team}}),_c('download-app'),_c('posts',{attrs:{\"posts\":_vm.posts}}),_c('contact'),_c('newsletter'),_c('modal',{attrs:{\"active\":_vm.modalAlertIsOpen},on:{\"update:active\":function($event){_vm.modalAlertIsOpen=$event}}},[_c('div',{staticClass:\"text-center\"},[_c('h3',[_vm._v(_vm._s(_vm.alert.title))]),_c('p',[_vm._v(_vm._s(_vm.alert.message))])])])],1)],1)}\nvar staticRenderFns = []\n\nexport { render, staticRenderFns }","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('div',{staticClass:\"home-banner\"},[_c('app-menu',{attrs:{\"active\":_vm.menuOpen,\"bottom\":_vm.isFixedNavbar},on:{\"update:active\":function($event){_vm.menuOpen=$event}}}),_c('div',{ref:\"homeBannerContent\",staticClass:\"home-banner-content\"},[_c('img',{attrs:{\"src\":require(\"@/assets/img/svg/logo.svg\"),\"width\":\"190\"}}),_c('h2',[_vm._v(\"Qualidade, transparência e ética.\")]),_c('a',{staticClass:\"home-banner-mouse\",attrs:{\"href\":\"#main-content\"}})]),_c('top-navbar',{staticClass:\"home-banner-navbar\",attrs:{\"is-fixed\":_vm.isFixedNavbar,\"menu-opened\":_vm.menuOpen},on:{\"update:menuOpened\":function($event){_vm.menuOpen=$event},\"update:menu-opened\":function($event){_vm.menuOpen=$event}}})],1)}\nvar staticRenderFns = []\n\nexport { render, staticRenderFns }","\r\n\r\n\r\n\r\n\r\n","import mod from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./Banner.vue?vue&type=script&lang=js&\"; export default mod; export * from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./Banner.vue?vue&type=script&lang=js&\"","import { render, staticRenderFns } from \"./Banner.vue?vue&type=template&id=26a7b59d&\"\nimport script from \"./Banner.vue?vue&type=script&lang=js&\"\nexport * from \"./Banner.vue?vue&type=script&lang=js&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n null,\n null\n \n)\n\nexport default component.exports","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('section',{staticClass:\"home-posts\"},[_c('aside',[_vm._m(0),_c('p',[_vm._v(\" Diké é o portal de informações da Crivelli Advogados Associados. Divulga diariamente conteúdos sobre os seus direitos, com análises, reflexões e informações de cunho jurídico. Vídeos, entrevistas, textos, podcasts e eventos. Confira! \")]),_c('router-link',{staticClass:\"button button-blue\",attrs:{\"to\":{ name: 'blog' }}},[_vm._v(\"Confira!\")])],1),_c('div',{staticClass:\"posts-wrapper\"},[_vm._m(1),_c('scrollable-content',{attrs:{\"container-class\":\"post-list\"}},_vm._l((_vm.posts.filter(function (prop) { return prop.category != 1; })),function(item){return _c('div',{key:(\"post-\" + (item.id)),staticClass:\"post-list-item\"},[_c('post-card',{attrs:{\"post\":item,\"type\":item.category}})],1)}),0),_vm._m(2),_c('scrollable-content',{attrs:{\"container-class\":\"post-list\"}},_vm._l((_vm.posts.filter(function (prop) { return prop.category == 1; })),function(item){return _c('div',{key:(\"post-\" + (item.id)),staticClass:\"post-list-item\"},[_c('post-card',{attrs:{\"post\":item,\"type\":\"1\"}})],1)}),0)],1)])}\nvar staticRenderFns = [function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('header',[_c('img',{attrs:{\"src\":require(\"@/assets/img/svg/dike_logo.png\"),\"width\":\"230\"}}),_c('h4',[_vm._v(\"Entenda seus direitos.\")])])},function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('h3',[_c('img',{attrs:{\"src\":require(\"@/assets/img/svg/articles.svg\"),\"width\":\"15\"}}),_vm._v(\" ARTIGOS\")])},function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('h3',{staticClass:\"title-with-icon m-t m-b\"},[_c('img',{attrs:{\"src\":require(\"@/assets/img/svg/video.svg\"),\"width\":\"15\"}}),_vm._v(\" VÍDEOS \")])}]\n\nexport { render, staticRenderFns }","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('div',{staticClass:\"scrollable-content\"},[_c('div',{ref:\"scroller\",staticClass:\"scrollable-content-scroller\",class:_vm.containerClass},[_vm._t(\"default\")],2),_c('div',{class:{'show-mobile' : _vm.showMobile}},[_c('div',{staticClass:\"scrollable-content-controls\",attrs:{\"aria-controls\":\"true\"}},[_c('a',{staticClass:\"link\",on:{\"click\":function($event){return _vm.move(-1)}}},[_c('arrow-horizontal',{attrs:{\"reverse\":true,\"width\":\"50\"}})],1),_c('a',{staticClass:\"link\",on:{\"click\":function($event){$event.preventDefault();return _vm.move(1)}}},[_c('arrow-horizontal',{attrs:{\"width\":\"50\"}})],1)])])])}\nvar staticRenderFns = []\n\nexport { render, staticRenderFns }","\r\n\r\n\r\n","import mod from \"-!../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../node_modules/thread-loader/dist/cjs.js!../../node_modules/babel-loader/lib/index.js!../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../node_modules/vue-loader/lib/index.js??vue-loader-options!./ScrollableContent.vue?vue&type=script&lang=js&\"; export default mod; export * from \"-!../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../node_modules/thread-loader/dist/cjs.js!../../node_modules/babel-loader/lib/index.js!../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../node_modules/vue-loader/lib/index.js??vue-loader-options!./ScrollableContent.vue?vue&type=script&lang=js&\"","import { render, staticRenderFns } from \"./ScrollableContent.vue?vue&type=template&id=2dd4afc8&\"\nimport script from \"./ScrollableContent.vue?vue&type=script&lang=js&\"\nexport * from \"./ScrollableContent.vue?vue&type=script&lang=js&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n null,\n null\n \n)\n\nexport default component.exports","\r\n\r\n\r\n\r\n\r\n","import mod from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./Posts.vue?vue&type=script&lang=js&\"; export default mod; export * from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./Posts.vue?vue&type=script&lang=js&\"","import { render, staticRenderFns } from \"./Posts.vue?vue&type=template&id=7b8d7c98&\"\nimport script from \"./Posts.vue?vue&type=script&lang=js&\"\nexport * from \"./Posts.vue?vue&type=script&lang=js&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n null,\n null\n \n)\n\nexport default component.exports","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('section',{staticClass:\"story\"},[_c('transition',{attrs:{\"name\":\"fade\"}},[(_vm.modalOpened)?_c('div',{staticClass:\"story-modal\"},[_c('div',{staticClass:\"story-modal-content\"},[_c('a',{staticClass:\"story-modal-close\",on:{\"click\":function () { return (_vm.modalOpened = false); }}},[_vm._v(\"×\")]),_c('iframe',{attrs:{\"width\":\"100%\",\"height\":\"350\",\"src\":\"https://www.youtube.com/embed/jxD7hNHj_j0\",\"frameborder\":\"0\",\"allow\":\"accelerometer; autoplay; encrypted-media; gyroscope; picture-in-picture\",\"allowfullscreen\":\"\"}})])]):_vm._e()]),_c('div',{staticClass:\"story-overlay\"},[_c('div',{staticClass:\"story-content\"},[_c('h1',[_vm._v(\"Conheça Crivelli Advogados\")]),_c('p',[_vm._v(\" A Crivelli Advogados Associados conta com mais de 35 anos de experiência, sempre pautada por um posicionamento de vanguarda na advocacia, alicerçada no objetivo de construir uma sociedade mais justa e igualitária. Nossa marca é um compromisso de se reinventar todo dia para oferecer uma advocacia diferenciada, técnica, combativa e crítica à altura dos desafios das novas tecnologias para a advocacia e para o mundo do trabalho. \")]),_c('div',{staticClass:\"story-buttons\"},[_c('router-link',{staticClass:\"button button-orange\",attrs:{\"to\":{ name: 'page_about' }}},[_vm._v(\"VER HISTÓRIA\")]),_c('a',{staticClass:\"button button-orange is-transparent is-outlined\",on:{\"click\":function($event){$event.preventDefault();return (function () { return (_vm.modalOpened = true); })($event)}}},[_c('span',[_vm._v(\"ASSISTIR VÍDEO\")]),_c('video-icon',{staticClass:\"icon right\",attrs:{\"width\":\"20\"}})],1)],1)])])],1)}\nvar staticRenderFns = []\n\nexport { render, staticRenderFns }","\r\n\r\n\r\n\r\n\r\n","import mod from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./Story.vue?vue&type=script&lang=js&\"; export default mod; export * from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./Story.vue?vue&type=script&lang=js&\"","import { render, staticRenderFns } from \"./Story.vue?vue&type=template&id=2d3a39ed&\"\nimport script from \"./Story.vue?vue&type=script&lang=js&\"\nexport * from \"./Story.vue?vue&type=script&lang=js&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n null,\n null\n \n)\n\nexport default component.exports","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('div',{staticClass:\"site-section team\"},[_c('div',{staticClass:\"site-container\"},[_vm._m(0),_c('h3',[_vm._v(\" Especialistas nas áreas trabalhista, previdenciária, sindical, civil e direito médico com mais de 30 anos de experiência \")]),_c('scrollable-content',{attrs:{\"container-class\":\"team-members\",\"show-mobile\":false}},_vm._l((_vm.items),function(member){return _c('router-link',{key:(\"team-member-i\" + (member.id)),staticClass:\"team-member-item\",attrs:{\"to\":{\n name: 'team_detail',\n params: { slug: member.slug },\n }}},[_c('div',{staticClass:\"team-member-item-image\"},[_c('logo-icon'),(member.image)?_c('img',{attrs:{\"src\":member.image,\"height\":\"150\"}}):_vm._e()],1),_c('p',{staticClass:\"team-member-item-name\"},[_vm._v(_vm._s(member.name))]),_c('p',{staticClass:\"team-member-item-position\"},[_vm._v(\" \"+_vm._s(member.text)+\" \")]),_c('div',{staticClass:\"text-center\"},[_c('span',[_vm._v(\"VER PERFIL\")]),_c('arrow-horizontal',{attrs:{\"width\":\"20\"}})],1)])}),1),_c('div',{staticClass:\"text-center hidden-mobile\",staticStyle:{\"margin-top\":\"2rem\"}},[_c('router-link',{staticClass:\"button button-orange\",attrs:{\"to\":{ name: 'page_team' }}},[_vm._v(\"VER EQUIPE\")])],1)],1)])}\nvar staticRenderFns = [function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('h2',[_c('img',{attrs:{\"src\":require(\"@/assets/img/svg/icon.svg\"),\"width\":\"25\"}}),_vm._v(\" Conheça nossos sócios \")])}]\n\nexport { render, staticRenderFns }","\r\n\r\n\r\n","import mod from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./Team.vue?vue&type=script&lang=js&\"; export default mod; export * from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./Team.vue?vue&type=script&lang=js&\"","import { render, staticRenderFns } from \"./Team.vue?vue&type=template&id=562ecb3c&\"\nimport script from \"./Team.vue?vue&type=script&lang=js&\"\nexport * from \"./Team.vue?vue&type=script&lang=js&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n null,\n null\n \n)\n\nexport default component.exports","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('section',{staticClass:\"contact\"},[_c('div',{staticClass:\"contact-content\"},[_c('h2',[_vm._v(\"Contatos\")]),_c('div',{staticClass:\"contact-content-item\"},[_c('contact-info',{attrs:{\"is-dark\":true}})],1),_c('div',{staticClass:\"contact-content-item\"},[_vm._m(0),_vm._l((_vm.addresses),function(item){return _c('div',{key:item.title,staticClass:\"contact-address\"},[_c('h5',[_vm._v(_vm._s(item.title))]),_c('p',[_vm._v(_vm._s(item.text))])])})],2)])])}\nvar staticRenderFns = [function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('h4',[_c('img',{attrs:{\"src\":require(\"@/assets/img/svg/map_marker.svg\")}}),_vm._v(\"ENDEREÇOS\")])}]\n\nexport { render, staticRenderFns }","\r\n\r\n\r\n\r\n\r\n","import mod from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./Contact.vue?vue&type=script&lang=js&\"; export default mod; export * from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./Contact.vue?vue&type=script&lang=js&\"","import { render, staticRenderFns } from \"./Contact.vue?vue&type=template&id=f1539c06&\"\nimport script from \"./Contact.vue?vue&type=script&lang=js&\"\nexport * from \"./Contact.vue?vue&type=script&lang=js&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n null,\n null\n \n)\n\nexport default component.exports","\r\n\r\n\r\n\r\n","import mod from \"-!../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../node_modules/thread-loader/dist/cjs.js!../../node_modules/babel-loader/lib/index.js!../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../node_modules/vue-loader/lib/index.js??vue-loader-options!./Home.vue?vue&type=script&lang=js&\"; export default mod; export * from \"-!../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../node_modules/thread-loader/dist/cjs.js!../../node_modules/babel-loader/lib/index.js!../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../node_modules/vue-loader/lib/index.js??vue-loader-options!./Home.vue?vue&type=script&lang=js&\"","import { render, staticRenderFns } from \"./Home.vue?vue&type=template&id=28c32a6c&\"\nimport script from \"./Home.vue?vue&type=script&lang=js&\"\nexport * from \"./Home.vue?vue&type=script&lang=js&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n null,\n null\n \n)\n\nexport default component.exports","module.exports = __webpack_public_path__ + \"img/blue_whatsapp.24db96ab.svg\";","module.exports = __webpack_public_path__ + \"img/instagram.e4a301fd.svg\";","module.exports = __webpack_public_path__ + \"img/menu.80581016.svg\";","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('svg',{attrs:{\"xmlns\":\"http://www.w3.org/2000/svg\",\"viewBox\":\"0 0 20 20\"}},[_c('path',{attrs:{\"d\":\"M10 20a10 10 0 110-20 10 10 0 010 20zm6.95-10L6.44 4.745v10.51z\",\"clip-rule\":\"evenodd\"}})])}\nvar staticRenderFns = []\n\nexport { render, staticRenderFns }","\r\n\r\n\r\n","import mod from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./VideoIcon.vue?vue&type=script&lang=js&\"; export default mod; export * from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./VideoIcon.vue?vue&type=script&lang=js&\"","import { render, staticRenderFns } from \"./VideoIcon.vue?vue&type=template&id=38444c84&\"\nimport script from \"./VideoIcon.vue?vue&type=script&lang=js&\"\nexport * from \"./VideoIcon.vue?vue&type=script&lang=js&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n null,\n null\n \n)\n\nexport default component.exports","module.exports = __webpack_public_path__ + \"img/search.2095481f.svg\";","module.exports = __webpack_public_path__ + \"img/medical.81888df9.svg\";","module.exports = __webpack_public_path__ + \"img/download_apple_store.ceb332de.svg\";","module.exports = __webpack_public_path__ + \"img/white_workers.684300d8.svg\";","module.exports = __webpack_public_path__ + \"img/bg_app.9127225d.svg\";","module.exports = __webpack_public_path__ + \"img/workers.9383eaa5.svg\";","module.exports = __webpack_public_path__ + \"img/societario.21014608.svg\";","module.exports = __webpack_public_path__ + \"img/linkedin.d8eac7f1.svg\";","module.exports = __webpack_public_path__ + \"img/white_civil.d44828f6.svg\";","module.exports = __webpack_public_path__ + \"img/chevron.16019ed4.svg\";","module.exports = __webpack_public_path__ + \"img/linkedin_square.2df0a646.svg\";","module.exports = __webpack_public_path__ + \"img/dike_logo.5d736424.png\";","module.exports = __webpack_public_path__ + \"img/podcast.cba149d4.svg\";","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('nav',{ref:\"navbar\",staticClass:\"page-top-navbar\",class:{'is-fixed': _vm.isFixed}},[_c('router-link',{staticClass:\"logo\",attrs:{\"to\":{name: 'home'}}},[_c('img',{attrs:{\"src\":require(\"@/assets/img/svg/logo_icone_esquerda.svg\"),\"width\":\"200\"}})]),_c('span',{staticClass:\"flex-1\"}),_vm._m(0),_c('span',{staticClass:\"flex-1\"}),_vm._m(1),_c('a',{staticClass:\"menu-control\",on:{\"click\":_vm.toggleMenu}},[(_vm.menuOpened)?_c('img',{attrs:{\"src\":require(\"@/assets/img/svg/close.svg\"),\"width\":\"45\"}}):[_c('span',{staticClass:\"hidden-mobile\"},[_vm._v(\"Menu\")]),_c('img',{attrs:{\"src\":require(\"@/assets/img/svg/menu.svg\"),\"width\":\"50\"}})]],2)],1)}\nvar staticRenderFns = [function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('div',{staticClass:\"flex-1 top-button-center\"},[_c('a',{staticClass:\"button button-orange\",attrs:{\"href\":\"http://www.contatoseguro.com.br/crivelli\",\"target\":\"_blank\"}},[_vm._v(\" Canal de Denúncia \")])])},function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('div',{staticClass:\"tel\"},[_c('label',{staticClass:\"hidden-mobile\"},[_vm._v(\"Precisa de Ajuda?\")]),_c('a',{attrs:{\"href\":\"tel:1133760110\"}},[_c('img',{attrs:{\"src\":require(\"@/assets/img/svg/whatsapp.svg\"),\"width\":\"30\"}}),_c('small',{staticClass:\"hidden-mobile\"},[_vm._v(\"(11)\")]),_c('span',{staticClass:\"hidden-mobile\"},[_vm._v(\"3376-0100\")])])])}]\n\nexport { render, staticRenderFns }","\r\n\r\n\r\n\r\n\r\n","import mod from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./TopNavbar.vue?vue&type=script&lang=js&\"; export default mod; export * from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./TopNavbar.vue?vue&type=script&lang=js&\"","import { render, staticRenderFns } from \"./TopNavbar.vue?vue&type=template&id=e4962378&\"\nimport script from \"./TopNavbar.vue?vue&type=script&lang=js&\"\nexport * from \"./TopNavbar.vue?vue&type=script&lang=js&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n null,\n null\n \n)\n\nexport default component.exports","module.exports = __webpack_public_path__ + \"img/events.8ffc4e59.svg\";","module.exports = __webpack_public_path__ + \"img/logo_icon_left.9b2e3c9e.svg\";","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('transition',[_c('div',{staticClass:\"menu\",class:{ active: _vm.active, 'is-bottom': _vm.bottom }},[(!_vm.bottom)?_c('a',{staticClass:\"menu-close show-mobile\",on:{\"click\":function () { return _vm.$emit('update:active', false); }}},[_vm._v(\" × \")]):_vm._e(),_c('div',{staticClass:\"menu-side-left\"},[_c('img',{attrs:{\"src\":require(\"@/assets/img/svg/white_logo.svg\"),\"width\":\"196\"}}),_c('social-networks',{attrs:{\"icon-width\":\"25\"}}),_c('a',{staticClass:\"button button-white is-outlined\",attrs:{\"href\":\"https://api.whatsapp.com/send?phone=551133760100\",\"target\":\"_blank\"}},[_c('img',{staticClass:\"icon\",attrs:{\"src\":require(\"@/assets/img/svg/white_whatsapp.svg\"),\"width\":\"30\"}}),_c('span',[_vm._v(\"ENVIE UMA MENSAGEM\")])]),_c('br'),_c('br'),_c('br'),_c('router-link',{staticClass:\"button button-white is-outlined\",attrs:{\"to\":{ name: 'page_online_scheduling' }}},[_c('img',{staticClass:\"icon\",attrs:{\"src\":require(\"@/assets/img/svg/white_calendar.svg\")}}),_vm._v(\" AGENDAMENTO ONLINE \")])],1),_c('div',{staticClass:\"menu-side-right\"},[_c('ul',_vm._m(0),0)])])])}\nvar staticRenderFns = [function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _vm._l((_vm.links),function(item){return _c('li',{key:(\"menu-link-\" + (item.name))},[_c('router-link',{class:{ active: _vm.$route.name === item.to.name },attrs:{\"to\":item.to}},[_vm._v(_vm._s(item.title))])],1)})}]\n\nexport { render, staticRenderFns }","\r\n\r\n\r\n","import mod from \"-!../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../node_modules/thread-loader/dist/cjs.js!../../node_modules/babel-loader/lib/index.js!../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../node_modules/vue-loader/lib/index.js??vue-loader-options!./Menu.vue?vue&type=script&lang=js&\"; export default mod; export * from \"-!../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../node_modules/thread-loader/dist/cjs.js!../../node_modules/babel-loader/lib/index.js!../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../node_modules/vue-loader/lib/index.js??vue-loader-options!./Menu.vue?vue&type=script&lang=js&\"","import { render, staticRenderFns } from \"./Menu.vue?vue&type=template&id=28dea9b9&\"\nimport script from \"./Menu.vue?vue&type=script&lang=js&\"\nexport * from \"./Menu.vue?vue&type=script&lang=js&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n null,\n null\n \n)\n\nexport default component.exports"],"sourceRoot":""}