{"version":3,"sources":["webpack:///webpack/bootstrap","webpack:///./output/.fable/fable-library.3.2.11/Reflection.js","webpack:///./output/.fable/fable-library.3.2.11/List.js","webpack:///./output/.fable/fable-library.3.2.11/lib/long.js","webpack:///./output/.fable/fable-library.3.2.11/Long.js","webpack:///./output/.fable/fable-library.3.2.11/Util.js","webpack:///./output/.fable/fable-library.3.2.11/RegExp.js","webpack:///./output/.fable/fable-library.3.2.11/String.js","webpack:///./output/.fable/fable-library.3.2.11/Seq.js","webpack:///./output/.fable/fable-library.3.2.11/Array.js","webpack:///./output/.fable/fable-library.3.2.11/Option.js","webpack:///./output/.fable/fable-library.3.2.11/Types.js","webpack:///./output/.fable/fable-library.3.2.11/Map.js","webpack:///./output/.fable/fable-library.3.2.11/Numeric.js","webpack:///./output/.fable/fable-library.3.2.11/Date.js","webpack:///./output/.fable/Fable.Parsimmon.4.1.0/Parsimmon.js","webpack:///./output/.fable/fable-library.3.2.11/MapUtil.js","webpack:///./output/.fable/fable-library.3.2.11/Int32.js","webpack:///./output/.fable/fable-library.3.2.11/lib/big.js","webpack:///./output/.fable/fable-library.3.2.11/Decimal.js","webpack:///./output/.fable/Fable.Parsimmon.4.1.0/Parsimmon.fs","webpack:///./output/.fable/Fable.SimpleJson.3.21.0/Parser.fs","webpack:///./output/.fable/Fable.SimpleJson.3.21.0/SimpleJson.fs","webpack:///./output/.fable/Fable.SimpleJson.3.21.0/TypeCheck.fs","webpack:///./output/.fable/fable-library.3.2.11/BitConverter.js","webpack:///./output/.fable/Fable.SimpleJson.3.21.0/TypeInfo.Converter.fs","webpack:///./output/.fable/fable-library.3.2.11/BigInt/n.js","webpack:///./output/.fable/fable-library.3.2.11/BigInt/z.js","webpack:///./output/.fable/fable-library.3.2.11/BigInt.js","webpack:///./output/.fable/fable-library.3.2.11/MutableMap.js","webpack:///./output/.fable/Fable.SimpleJson.3.21.0/Json.Converter.fs","webpack:///./output/.fable/fable-library.3.2.11/DateOffset.js","webpack:///./output/.fable/fable-library.3.2.11/Double.js","webpack:///./output/.fable/fable-library.3.2.11/FSharp.Collections.js","webpack:///./output/.fable/fable-library.3.2.11/FSharp.Core.js","webpack:///./output/.fable/fable-library.3.2.11/Set.js","webpack:///./output/.fable/fable-library.3.2.11/Guid.js","webpack:///./output/.fable/fable-library.3.2.11/MutableSet.js","webpack:///./output/.fable/fable-library.3.2.11/Encoding.js","webpack:///./output/.fable/Fable.SimpleJson.3.21.0/quote.js","webpack:///./output/.fable/fable-library.3.2.11/AsyncBuilder.js","webpack:///./output/.fable/fable-library.3.2.11/Choice.js","webpack:///./output/.fable/fable-library.3.2.11/Async.js","webpack:///./output/.fable/fable-library.3.2.11/Observable.js","webpack:///./output/.fable/fable-library.3.2.11/Event.js","webpack:///./output/.fable/fable-library.3.2.11/Timer.js","webpack:///./output/.fable/Fable.Elmish.3.1.0/prelude.fs","webpack:///./output/.fable/Fable.Elmish.3.1.0/cmd.fs","webpack:///./output/.fable/fable-library.3.2.11/Range.js","webpack:///./output/.fable/Fable.Elmish.3.1.0/ring.fs","webpack:///./output/.fable/Fable.Elmish.3.1.0/program.fs","webpack:///./output/.fable/Fable.Elmish.React.3.0.1/common.fs","webpack:///./output/.fable/Fable.Elmish.React.3.0.1/react.fs","webpack:///./output/.fable/Fable.Remoting.Client.7.16.0/Types.fs","webpack:///./output/.fable/fable-library.3.2.11/TimeSpan.js","webpack:///./output/.fable/Fable.Remoting.Client.7.16.0/Extensions.fs","webpack:///./output/.fable/Fable.Remoting.Client.7.16.0/Http.fs","webpack:///./output/.fable/Fable.Remoting.Client.7.16.0/Proxy.fs","webpack:///./output/.fable/Feliz.Bulma.2.15.0/ElementBuilders.fs","webpack:///./output/.fable/Fable.Remoting.Client.7.16.0/Remoting.fs","webpack:///./Index.fs","webpack:///../Shared/Shared.fs","webpack:///./App.fs"],"names":["webpackJsonpCallback","data","moduleId","chunkId","chunkIds","moreModules","executeModules","i","resolves","length","Object","prototype","hasOwnProperty","call","installedChunks","push","modules","parentJsonpFunction","shift","deferredModules","apply","checkDeferredModules","result","deferredModule","fulfilled","j","depId","splice","__webpack_require__","s","installedModules","0","exports","module","l","m","c","d","name","getter","o","defineProperty","enumerable","get","r","Symbol","toStringTag","value","t","mode","__esModule","ns","create","key","bind","n","object","property","p","jsonpArray","window","oldJsonpFunction","slice","CaseInfo","declaringType","tag","fields","this","TypeInfo","fullname","generics","construct","parent","cases","enumCases","fullName","getHashCode","other","equals","getGenerics","fullnameHash","genHashes","map","t1","t2","getRecordElements","k1","v1","k2","v2","class_type","record_type","undefined","union_type","caseNames","tuple_type","lambda_type","argType","returnType","option_type","generic","list_type","array_type","obj_type","unit_type","string_type","bool_type","int8_type","uint8_type","int16_type","uint16_type","int32_type","uint32_type","float32_type","float64_type","info","Array","isArray","lastIndexOf","substr","gen","x","join","endsWith","getElementType","_a","isGenericType","isEnum","getGenericTypeDefinition","getEnumUnderlyingType","getUnionCases","Error","getTupleElements","isTuple","getFunctionElements","isFunction","isUnion","isRecord","startsWith","getUnionFields","v","case_","getUnionCaseFields","uci","getRecordField","field","makeUnion","values","expectedLength","makeRecord","reduce","obj","_t","makeTuple","FSharpList","head","tail","super","xs","xs_1_mut","ys_1_mut","loop","xs_1","ys_1","matchValue","xt","yt","i_mut","h_mut","h","_key","from","ListEnumerator$1","ListEnumerator$1_$ctor_3002E699","iterator","GetEnumerator","it","current","__","FSharpList_get_Empty","FSharpList_Cons_305B8EAC","FSharpList__get_IsEmpty","FSharpList__get_Length","FSharpList__get_Head","FSharpList__get_Tail","empty","cons","singleton","isEmpty","tryHead","toArray","len","res","fold","folder","state","acc","reverse","iterate","action","unitVar0","ofArrayWithTail","tail_1","ofArray","ofSeq","xs_3","root","node","enumerator","Dispose","xs_5","t_2","concat","lists","forEach","xs_6","mapping","tryPick","f","tryFind","tryItem","choose","skipWhile","predicate_mut","xs_mut","predicate","wasm","WebAssembly","Instance","Module","Uint8Array","e","Long","low","high","unsigned","isLong","GetHashCode","h1","Equals","CompareTo","compare","toString","radix","toJSON","multiply","y","toPrecision","sd","String","toExponential","dp","toFixed","toHex","fromBytes","toBytes","__isLong__","INT_CACHE","UINT_CACHE","fromInt","cachedObj","cache","fromBits","fromNumber","isNaN","UZERO","ZERO","TWO_PWR_64_DBL","MAX_UNSIGNED_VALUE","TWO_PWR_63_DBL","MIN_VALUE","MAX_VALUE","negate","TWO_PWR_32_DBL","lowBits","highBits","pow_dbl","Math","pow","fromString","str","RangeError","indexOf","substring","radixToPower","size","min","parseInt","add","fromValue","val","TWO_PWR_16_DBL","TWO_PWR_24","ONE","UONE","NEG_ONE","toInt","$this","toNumber","isZero","radixLong","div","divide","rem1","subtract","rem","remDiv","digits","isOdd","lessThan","greaterThan","greaterThanOrEqual","thisNeg","otherNeg","not","addend","a48","a32","a16","a00","b48","b32","b16","c48","c32","c16","c00","subtrahend","multiplier","mul","get_high","b00","divisor","approx","div_u","div_s","toUnsigned","shiftRightUnsigned","shiftLeft","shiftRight","max","floor","log2","ceil","log","LN2","delta","approxRes","approxRem","numBits","le","hi","lo","toBytesLE","toBytesBE","bytes","fromBytesLE","fromBytesBE","op_Addition","op_Subtraction","op_Multiply","op_Division","op_Modulus","rem_u","rem_s","op_UnaryNegation","op_LeftShift","op_BitwiseAnd","fromInteger","kind","xh","parse","style","_bitsize","lessOrEqual","padStart","isNegative","sign","maxValue","getMaxValue","toUpperCase","tryParse","bitsize","defValue","contents","unixEpochMillisecondsToTicks","ms","offset","ticksToUnixEpochMilliseconds","ticks","isIterable","isArrayLike","ArrayBuffer","isView","isHashable","isDisposable","sameConstructor","getPrototypeOf","constructor","Enumerator","iter","cur","next","done","getEnumerator","toIterator","en","hasNext","Lazy","factory","isValueCreated","createdValue","padWithZeros","padLeftAndRightWithZeros","lengthLeft","lengthRight","dateOffset","date","date1","getTimezoneOffset","int32ToString","ObjectRef","idMap","has","set","count","stringHash","charCodeAt","numberHash","combineHashCodes","hashes","h2","physicalHash","id","structuralHash","arrayHash","Date","getTime","dateHash","safeHash","equalArraysWith","eq","equalArrays","isEquatable","compareDates","xKeys","keys","yKeys","sort","equalObjects","xtime","ytime","comparePrimitives","compareArrays","comp","compareArraysWith","isComparable","compareObjects","comparer","createObj","kv","clear","col","WeakMap","uncurry","arity","uncurriedFn","a1","a2","a3","a4","a5","a6","a7","a8","curry","partialApply","args","replace","fsFormatRegExp","interpolateRegExp","formatRegExp","isLessThan","printf","input","cont","lastIndex","strParts","matches","strIdx","match","exec","matchIndex","index","createPrinter","_strParts","_matches","_result","padArg","arg","flags","_padLength","precision","format","padLength","formatReplacement","interpolate","valIdx","continuePrint","toText","toFail","rep","toLowerCase","zeroFlag","minusFlag","ch","padLeft","_","idx","pattern","intPart","decimalPart","abs","search","isNullOrEmpty","isNullOrWhiteSpace","test","delimiter","notSupported","fromBase64String","b64Encoded","binary","atob","isRight","splitters","removeEmpty","split","arguments","splits","reg","RegExp","trim","chars","trimEnd","startIndex","SR_notEnoughElements","Enumerator_notStarted","Enumerator_alreadyFinished","Enumerator_Seq","Enumerator_FromFunctions$1","dispose","Enumerator_noReset","Enumerator_FromFunctions$1_$ctor_58C54629","Enumerator_enumerateThenFinally","Enumerator_generateWhileSome","openf","compute","closef","started","curr","x_1","finish","matchValue_1","indexNotFound","checkNonNull","argName","mkSeq","Enumerator_Seq_$ctor_673A07F2","delay","generator","sources","outerOpt","innerOpt","finished","inner","outer","copyOfStruct","inner_1","outer_1","Enumerator_concat","unfold","st_1","Enumerator_unfold","toList","generate","generateIndexed","append","ys","compareWith","e1","e2","b1","b2","forAll","found","exists","iterateIndexed","e_1","chooser","pick","acc_mut","skip","take","collect","Helpers_allocateArrayFromCons","differentLengths","fill","target","targetIndex","start","last","array","mapIndexed","source","mapFold","patternInput","mapFoldBack","arrays","arrays_1","totalIdx","totalLength","idx_1","arr_2","ar","initialize","initializer","pairwise","copy","scanBack","find","tryFindBack","tryFindIndexBack","delegateArg0","delegateArg1","permute","checkFlags","every","zip","array1","array2","chunkBySize","chunkSize","start_1","equalsWith","length1","length2","foldBack","reduceRight","foldBack2","foldBackIndexed2","_arg1","windowed","windowSize","splitInto","chunks","chunks_1","minChunkSize","chunksWithExtraItem","y_1","transpose","lenInner","a","Some","some","defaultArg","opt","defaultValue","callStack","self","seqToString","entries","k","Union","fieldStr","withParens","unionToString","recordToJSON","recordToString","recordGetHashCode","recordEquals","thisNames","recordCompareTo","Record","FSharpRef","contentsOrGetter","setter","Exception","message","MapTreeLeaf$2","MapTreeLeaf$2_$ctor_5BDDA1","MapTreeLeaf$2__get_Key","MapTreeLeaf$2__get_Value","MapTreeNode$2","left","right","MapTreeNode$2_$ctor_499A11FD","MapTreeNode$2__get_Left","MapTreeNode$2__get_Right","MapTreeNode$2__get_Height","MapTreeModule_size","MapTreeModule_sizeAux","m_mut","m2","MapTreeModule_mk","hl","hr","m2_1","m_2","MapTreeModule_rebalance","m2_2","m_3","m2_3","t1h","t2h","matchValue_2","matchValue_3","MapTreeModule_add","Compare","MapTreeModule_empty","MapTreeModule_tryFind","comparer_mut","k_mut","MapTreeModule_spliceOutSuccessor","MapTreeModule_iter","MapTreeModule_iterOpt","f_mut","MapTreeModule_copyToArray","arr","MapTreeModule_ofArray","forLoopVar","MapTreeModule_ofSeq","tupledArg","MapTreeModule_ofList","ie","e_mut","MapTreeModule_mkFromEnumerator","MapTreeModule_MapIterator$2","stack","MapTreeModule_collapseLHS","stack_mut","rest","MapTreeModule_mkIterator","MapTreeModule_current","MapTreeModule_alreadyFinished","MapTreeModule_notStarted","MapTreeModule_mkIEnumerator","MapTreeModule_moveNext","FSharpMap","tree","this$","combineHash","activePatternResult5329","FSharpMap__ComputeHashCode","that","m1","e1c","e2c","kvp1","kvp2","FSharpMap__ContainsKey","FSharpMap__get_Item","FSharpMap__get_Count","thisArg","FSharpMap_$ctor","FSharpMap_Create","MapTreeModule_find","MapTreeModule_mem","FSharpMap__Remove","MapTreeModule_remove","FSharpMap__ToList","m_1_mut","m_1","MapTreeModule_toList","FSharpMap__ToArray","MapTreeModule_toArray","table","FSharpMap__TryFind","remove","containsKey","ofList","elements","symbol","isNumeric","Number","offsetRegex","dateOffsetToString","isMinus","hours","minutes","dateToHalfUTCString","half","toISOString","dateToStringWithCustomFormat","utc","NaN","getUTCFullYear","getFullYear","getUTCMonth","getMonth","getUTCDate","getDate","getUTCHours","getHours","getUTCMinutes","getMinutes","getUTCSeconds","getSeconds","getUTCMilliseconds","getMilliseconds","dateToStringWithOffset","_b","_c","dateWithOffset","dateToISOStringWithOffset","dateToStringWithKind","toUTCString","toLocaleString","toLocaleDateString","toLocaleTimeString","printOffset","dateToISOString","_provider","DateTime","fromTicks","parseRaw","baseDate","timeInSeconds","timeParts","parseFloat","offsetParts","offsetInMinutes","detectUTC","year","month","day","dateValue","UTC","setFullYear","isLeapYear","daysInMonth","Parsimmon","times","seed","elem","bufferExists","Buffer","isParser","isBuffer","makeSuccess","status","furthest","expected","makeFailure","mergeReplies","union","makeLineColumnIndex","line","column","lines","assertParser","charAt","assertNumber","assertRegexp","assertFunction","assertString","repeat","string","amount","leftPad","pad","char","rangeFromIndexAndOffsets","before","after","to","formatGot","error","lineWithErrorIndex","lineRange","lastLineNumberLabelLength","verticalMarkerLength","byteLineWithErrorIndex","columnByteIndex","byteRange","bytesPerLine","bytesAfter","byteLines","byteRow","byteValue","chunkIndex","toChunks","byteRangeToRange","byteLine","inputLines","lineWithErrorCurrentIndex","lineSource","lineNumberLabel","isLineWithError","prefix","re","anchoredRegexp","seq","parsers","numParsers","accum","seqMap","mapper","pop","results","alt","fail","sepBy1","parser","separator","then","many","rs","regexp","group","anchored","fullMatch","groupMatch","succeed","lookahead","oneOf","desc","noneOf","takeWhile","lazy","eof","msg","err","type","or","alternative","wrap","leftParser","rightParser","middle","thru","wrapper","tieWith","assertArray","tie","prevResult","atMost","atLeast","init","fn","contramap","promap","g","mark","end","sepBy","notFollowedBy","text","reply","fallback","ap","chain","of","any","all","digit","letter","letters","optWhitespace","whitespace","cr","lf","newline","tryGetValue","addToSet","addToDict","dict","getItemFromDict","NumberStyles","getRange","isValid","getInvalidDigits","AllowHexSpecifier","getRadix","regexMatch","validResponse","umin","umax","op_UnaryNegation_Int32","P","cmp","_this","NAME","INVALID","INVALID_DP","NUMERIC","nl","round","Big","DP","RM","rm","more","xc","findIndex","xci","unshift","stringify","doExponential","isNonzero","isneg","yc","b","bl","bt","ri","bz","ai","al","rl","q","qc","qi","gt","gte","lt","lte","minus","sub","xlty","plus","xe","ye","mod","ygtx","one","prec","sqrt","NE","PE","strict","valueOf","_Big_","normalize","TypeError","setInt32Bits","hexDigits","bits","fromIntArray","mid","signExp","fromParts","scale","bitSize","decDigits","hex","dec","decCount","carry","hexToDecimal","big","content","others","skipped","ps","List","strings","jint","digitsLeft","jfloat","arg0","negativeJFloat","negJint","escape","anyCharSnippet","otherParser","tuple","stringLiteral","withWhitespace","jnull","jbool","jnumber","jstring","jvalue","comma","Map","number","arg10","arg20","jsObject","jsonValue","activePatternResult2797","activePatternResult2796","activePatternResult2795","activePatternResult2793","activePatternResult2792","isLittleEndian","getBytesInt32","DataView","buffer","byteOffset","byteLength","setInt32","toInt16","getInt16","toInt32","getInt32","toInt64","view","toUInt16","getUint16","toUInt32","getUint32","toUInt64","toSingle","getFloat32","toDouble","getFloat64","typeDef","flattenFuncTypes","Value","resolvedType","activePatternResult2712","primType","activePatternResult2711","types","createTypeInfo","lazyToDelayed","activePatternResult2710","activePatternResult2709","prop","activePatternResult2708","elemType","activePatternResult2707","activePatternResult2706","activePatternResult2705","activePatternResult2704","activePatternResult2703","activePatternResult2702","activePatternResult2701","activePatternResult2700","activePatternResult2699","genArgs","keyType","valueType","activePatternResult2698","activePatternResult2697","activePatternResult2696","activePatternResult2695","outArg","typeInfoCache","ti","_createTypeInfo","case","bound","BigNatModule_FFT_pow32","x_mut","n_mut","BigNatModule_FFT_maxTwoPower","Int32Array","BigNatModule_bound","BigNatModule_coeff","BigNatModule_coeff64","BigNatModule_setCoeff","BigNatModule_pow64","BigNatModule_pow32","BigNatModule_maxInt","BigNatModule_baseNi64","BigNatModule_baseMaski64","BigNatModule_divbase","BigNatModule_modbase","BigNatModule_createN","BigNatModule_normN","na_mut","na","findLeastBound","BigNatModule_embed","r_1","BigNatModule_eval32","BigNatModule_one","BigNatModule_zero","BigNatModule_degree","BigNatModule_add","rbound","c_mut","p_mut","q_mut","r_mut","z","i_1","z_1","i_2","BigNatModule_addP","BigNatModule_sub","BigNatModule_subP","BigNatModule_isZero","BigNatModule_equal","pa_mut","qa_mut","pa","qa","check","BigNatModule_compare","BigNatModule_lt","BigNatModule_gte","BigNatModule_mulSchoolBookCarry","rak","BigNatModule_mulSchoolBookOneSmall","bp","q_1","BigNatModule_mulSchoolBook","pSmall","qSmall","BigNatModule_mulSchoolBookBothSmall","ra","pai","qaj","BigNatModule_mulSchoolBookNeitherSmall","bigL","twoToBigL","bigK","bigN","BigNatModule_mkEncoding","BigNatModule_table","BigNatModule_mul","BigNatModule_scaleSubInPlace","patternInput_1","ad","a_1","f_1","zLo","zHi","BigNatModule_scaleAddInPlace","BigNatModule_removeFactor","degx","dega","xa","aa","pn","qn","qai","BigNatModule_divmod","BigNatModule_copyN","Invariant","BigNatModule_two","BigNatModule_toFloat","evalFloat","BigNatModule_ofInt32","BigNatModule_ofInt64","BigNatModule_embed64","BigNatModule_toString","degn","isLeading_mut","digits_mut","n_1_mut","_arg1_mut","isLeading","n_1","n_2","prior_1","nL","nH","digits_4","prior_mut","ten2k_mut","prior","ten2k","route","BigNatModule_ofString","ten","build","BigNatModule_isSmall","BigNatModule_getSmall","signInt","BigInteger__get_SignInt","BigInteger__get_V","BigInteger_op_Equality_56F059C0","BigNatModule_hash","BigInteger_op_LessThan_56F059C0","nn","BigInteger_$ctor_Z2BE94A1","BigInteger_nat_Z67CCE57D","smallLim","smallPosTab","BigInteger_create_Z2BE94A1","BigInteger_posn_Z67CCE57D","BigInteger_negn_Z67CCE57D","pattern_matching_result","BigInteger_$ctor_Z524259A4","BigInteger_$ctor_Z524259C1","BigInteger_get_One","BigInteger_get_Two","two","BigInteger_get_Zero","zero","BigInteger_op_UnaryNegation_Z665282C2","BigInteger_subnn_6A57060","nx","ny","BigInteger_addnn_6A57060","BigInteger__get_IsZero","BigInteger__get_IsOne","BigInteger_op_Addition_56F059C0","BigInteger_op_Multiply_56F059C0","BigInteger_op_LeftShift_62E082A2","BigInteger_Pow_62E082A2","yval","x_1_mut","power","ndiv2","BigNatModule_pow","BigInteger__get_ToDouble","BigInteger_Parse_Z721C83C5","text_1","arg00","fromZero","fromInt64","fromInt32","toDecimal","Decimal","BigInteger__get_ToDecimal","arg01","flipTwosComplement","currByte","lowBitFound","fromByteArray","isPositive","accumUInt32_mut","currIndex_mut","bytesRemaining_mut","lowBitFound_mut","accumUInt32","currIndex","bytesRemaining","value_2","bytesToProcess","patternInput_2","patternInput_3","Dictionary","pairs","hashMap","pair","Dictionary__Add_5BDDA1","item","Dictionary__Clear","Dictionary__TryFind_2B595","arrayIndex","Dictionary__get_Count","Dictionary__Remove_2B595","Dictionary__ContainsKey_2B595","Dictionary__get_Item_2B595","Dictionary__set_Item_5BDDA1","Dictionary__TryFindIndex_2B595","json","activePatternResult2875","activePatternResult2870","activePatternResult2874","activePatternResult2872","leftMap","rightMap","linkedList","foundCase","testExpr","typeInfo","getlElemType","getElemType","genericJson","getTypes","optionalTypeDelayed","underlyingType","originalType","insideBrowser","unionType","caseName","activePatternResult2904","expectedCases","CaseTypes","arg30","_arg2","caseInfo","caseType","foundDiscriminatorKey","keyword","discriminatorValueJson","discriminatorValue","foundUnionCase","unexpectedJson","expectedType","caseIndex","fieldValues","_arg3","caseTypes","_arg4","getFields","serializedRecord","caseValue","elementTypeDelayed","tupleTypesDelayed","tuples","getType","items","_arg5","otherwise","_arg6","_arg7","foundCaseName","elementType","recordType","fieldType","fieldName","_arg8","dictKeys","recordFields","keyValuePair","output","hashset","inputJson","PropertyInfo","FieldType","FieldName","element","usedCase","serializedFields","serializedValues","serializedKey","serializedValue","tupleTypes","DateTimeOffset","checkOffsetInRange","offsetMatch","ComparisonIdentity_Structural","LanguagePrimitives_FastGenericComparer","Operators_NullArg","SetTreeLeaf$1","SetTreeLeaf$1_$ctor_2B595","SetTreeLeaf$1__get_Key","SetTreeNode$1","SetTreeNode$1_$ctor_Z6E7BE5F7","SetTreeNode$1__get_Left","SetTreeNode$1__get_Right","SetTreeNode$1__get_Height","SetTreeModule_count","SetTreeModule_countAux","t_mut","SetTreeModule_mk","t2_1","SetTreeModule_rebalance","t2_3","t_3","t2_4","t2_2","SetTreeModule_add","c_1","SetTreeModule_empty","SetTreeModule_mem","SetTreeModule_iter","SetTreeModule_SetIterator$1","SetTreeModule_collapseLHS","x2","SetTreeModule_mkIterator","SetTreeModule_current","SetTreeModule_alreadyFinished","SetTreeModule_notStarted","SetTreeModule_mkIEnumerator","SetTreeModule_moveNext","SetTreeModule_compare","l1_mut","l2_mut","SetTreeModule_compareStacks","l1","l2","x1_3","x2_3","t1_6","x1_4","t2_6","x2_4","matchValue_4","pattern_matching_result_1","t1_7","x1_5","t2_7","x2_5","c_3","c_2","matchValue_5","pattern_matching_result_2","t1_8","x1_6","t2_8","x2_6","pattern_matching_result_3","t1_2","x1","x2_1","pattern_matching_result_4","t1_4","x1_2","x2_2","SetTreeModule_copyToArray","SetTreeModule_ofArray","SetTreeModule_ofSeq","SetTreeModule_ofList","SetTreeModule_mkFromEnumerator","FSharpSet","FSharpSet__ComputeHashCode","FSharpSet__get_Comparer","FSharpSet__get_Tree","FSharpSet__get_Count","FSharpSet__Contains","FSharpSet_$ctor","set$","FSharpSet_Empty","FSharpSet__Add","guidRegex","guidRegexNoHyphen","guidRegexHex","hyphenateGuid","wsTrimAndLowered","_byteToHex","_hexToByte","_convertMapsInitialized","initConvertMaps","arrayToGuid","buf","HashSet","HashSet__Add_2B595","HashSet__Clear","HashSet__Contains_2B595","HashSet__get_Count","HashSet__Remove_2B595","HashSet__TryFindIndex_2B595","v_1","code","setUint16","utf16le_encode","subarray","TextDecoder","decode","fromCharCode","utf16le_decode","_UTF8","TextEncoder","encode","pos","nextCode","utf8_encode","decodeUtf8","i1","fromCodePoint","utf8_decode","get_UTF8","quote","inputText","escapable","meta","CancellationToken","cancelled","_id","_cancelled","_listeners","listener","delete","$","addListener","removeListener","OperationCanceledError","setPrototypeOf","Trampoline","callCount","maxTrampolineCallCount","setTimeout","protectedCont","ctx","cancelToken","isCancelled","onCancel","trampoline","incrementAndCheck","hijack","onError","protectedBind","computation","binder","onSuccess","ex","protectedReturn","computation1","computation2","Bind","sequence","body","While","Delay","compensation","catchHandler","ex2","resource","TryFinally","guard","Return","emptyContinuation","_x","defaultCancellationToken","catchAsync","work","Choice_makeChoice1Of2","fromContinuations","startImmediate","cancellationToken","startWithContinuations","continuation","exceptionContinuation","cancellationContinuation","Observer","onNext","onCompleted","OnNext","OnError","_e","OnCompleted","Event","delegates","_addHandler","senderOrValue","valueOrUndefined","sender","handler","_removeHandler","callback","interval","_enabled","_isDisposed","_intervalId","_timeoutId","Interval","AutoReset","_elapsed","setInterval","Enabled","Trigger","clearTimeout","clearInterval","console","returnVal","Subscribe","Elapsed","dispatch","cmd","cmds","integralRangeStep","step","stop","stepFn","stepComparedWithZero","stepGreaterThanZero","comparedWithLast","makeRangeStepFunction","rangeDouble","wix","rix","rix'","wix'","ix","Seq","setState","program","model","rb","reentered","syncDispatch","nextMsg","update","model'","subscribe","props","nextProps","_nextState","equal","lazyView2With","placeholderId","document","getElementById","response","errorMsg","reponseText","url","headers","req","preparation","resultMapper","token","xhr","XMLHttpRequest","Url","WithCredentials","readyState","RequestBody","sendAndRead","responseText","options","typeName","func","funcArgs","argumentCount","returnTypeAsync","binaryInput","baseUrl","RouteBuilder","BaseUrl","funcNeedParameters","contentType","inputArgumentTypes","CustomHeaders","Authorization","executeRequest","onOk","CustomResponseSerialization","serializer","typ","Reflection","requestBody","statusCode","blob","Blob","reader","arg1","arg2","arg3","arg4","arg5","arg6","arg7","inputArguments","cn","classes","resolver","schemaType","fieldTypes","delegateArg2","delegateArg3","delegateArg4","delegateArg5","delegateArg6","delegateArg7","builder","methodName","clo1","clo2","task","api","getTables","ofSuccess","fileName","binaryData","dataUrl","anchor","elms","color","heading","ev","kp","bullet","bulletLine","containerBox","tc","Status"],"mappings":"aACE,SAASA,EAAqBC,GAQ7B,IAPA,IAMIC,EAAUC,EANVC,EAAWH,EAAK,GAChBI,EAAcJ,EAAK,GACnBK,EAAiBL,EAAK,GAIHM,EAAI,EAAGC,EAAW,GACpCD,EAAIH,EAASK,OAAQF,IACzBJ,EAAUC,EAASG,GAChBG,OAAOC,UAAUC,eAAeC,KAAKC,EAAiBX,IAAYW,EAAgBX,IACpFK,EAASO,KAAKD,EAAgBX,GAAS,IAExCW,EAAgBX,GAAW,EAE5B,IAAID,KAAYG,EACZK,OAAOC,UAAUC,eAAeC,KAAKR,EAAaH,KACpDc,EAAQd,GAAYG,EAAYH,IAKlC,IAFGe,GAAqBA,EAAoBhB,GAEtCO,EAASC,QACdD,EAASU,OAATV,GAOD,OAHAW,EAAgBJ,KAAKK,MAAMD,EAAiBb,GAAkB,IAGvDe,IAER,SAASA,IAER,IADA,IAAIC,EACIf,EAAI,EAAGA,EAAIY,EAAgBV,OAAQF,IAAK,CAG/C,IAFA,IAAIgB,EAAiBJ,EAAgBZ,GACjCiB,GAAY,EACRC,EAAI,EAAGA,EAAIF,EAAed,OAAQgB,IAAK,CAC9C,IAAIC,EAAQH,EAAeE,GACG,IAA3BX,EAAgBY,KAAcF,GAAY,GAE3CA,IACFL,EAAgBQ,OAAOpB,IAAK,GAC5Be,EAASM,EAAoBA,EAAoBC,EAAIN,EAAe,KAItE,OAAOD,EAIR,IAAIQ,EAAmB,GAKnBhB,EAAkB,CACrBiB,EAAG,GAGAZ,EAAkB,GAGtB,SAASS,EAAoB1B,GAG5B,GAAG4B,EAAiB5B,GACnB,OAAO4B,EAAiB5B,GAAU8B,QAGnC,IAAIC,EAASH,EAAiB5B,GAAY,CACzCK,EAAGL,EACHgC,GAAG,EACHF,QAAS,IAUV,OANAhB,EAAQd,GAAUW,KAAKoB,EAAOD,QAASC,EAAQA,EAAOD,QAASJ,GAG/DK,EAAOC,GAAI,EAGJD,EAAOD,QAKfJ,EAAoBO,EAAInB,EAGxBY,EAAoBQ,EAAIN,EAGxBF,EAAoBS,EAAI,SAASL,EAASM,EAAMC,GAC3CX,EAAoBY,EAAER,EAASM,IAClC5B,OAAO+B,eAAeT,EAASM,EAAM,CAAEI,YAAY,EAAMC,IAAKJ,KAKhEX,EAAoBgB,EAAI,SAASZ,GACX,oBAAXa,QAA0BA,OAAOC,aAC1CpC,OAAO+B,eAAeT,EAASa,OAAOC,YAAa,CAAEC,MAAO,WAE7DrC,OAAO+B,eAAeT,EAAS,aAAc,CAAEe,OAAO,KAQvDnB,EAAoBoB,EAAI,SAASD,EAAOE,GAEvC,GADU,EAAPA,IAAUF,EAAQnB,EAAoBmB,IAC/B,EAAPE,EAAU,OAAOF,EACpB,GAAW,EAAPE,GAA8B,iBAAVF,GAAsBA,GAASA,EAAMG,WAAY,OAAOH,EAChF,IAAII,EAAKzC,OAAO0C,OAAO,MAGvB,GAFAxB,EAAoBgB,EAAEO,GACtBzC,OAAO+B,eAAeU,EAAI,UAAW,CAAET,YAAY,EAAMK,MAAOA,IACtD,EAAPE,GAA4B,iBAATF,EAAmB,IAAI,IAAIM,KAAON,EAAOnB,EAAoBS,EAAEc,EAAIE,EAAK,SAASA,GAAO,OAAON,EAAMM,IAAQC,KAAK,KAAMD,IAC9I,OAAOF,GAIRvB,EAAoB2B,EAAI,SAAStB,GAChC,IAAIM,EAASN,GAAUA,EAAOiB,WAC7B,WAAwB,OAAOjB,EAAgB,SAC/C,WAA8B,OAAOA,GAEtC,OADAL,EAAoBS,EAAEE,EAAQ,IAAKA,GAC5BA,GAIRX,EAAoBY,EAAI,SAASgB,EAAQC,GAAY,OAAO/C,OAAOC,UAAUC,eAAeC,KAAK2C,EAAQC,IAGzG7B,EAAoB8B,EAAI,GAExB,IAAIC,EAAaC,OAAqB,aAAIA,OAAqB,cAAK,GAChEC,EAAmBF,EAAW5C,KAAKuC,KAAKK,GAC5CA,EAAW5C,KAAOf,EAClB2D,EAAaA,EAAWG,QACxB,IAAI,IAAIvD,EAAI,EAAGA,EAAIoD,EAAWlD,OAAQF,IAAKP,EAAqB2D,EAAWpD,IAC3E,IAAIU,EAAsB4C,EAI1B1C,EAAgBJ,KAAK,CAAC,GAAG,IAElBM,I,+BCvJT,0+CAEO,MAAM0C,EACT,YAAYC,EAAeC,EAAK3B,EAAM4B,GAClCC,KAAKH,cAAgBA,EACrBG,KAAKF,IAAMA,EACXE,KAAK7B,KAAOA,EACZ6B,KAAKD,OAASA,GAGf,MAAME,EACT,YAAYC,EAAUC,EAAUC,EAAWC,EAAQN,EAAQO,EAAOC,GAC9DP,KAAKE,SAAWA,EAChBF,KAAKG,SAAWA,EAChBH,KAAKI,UAAYA,EACjBJ,KAAKK,OAASA,EACdL,KAAKD,OAASA,EACdC,KAAKM,MAAQA,EACbN,KAAKO,UAAYA,EAErB,WACI,OAAOC,EAASR,MAEpB,cACI,OAAOS,EAAYT,MAEvB,OAAOU,GACH,OAAOC,EAAOX,KAAMU,IAGrB,SAASE,EAAY/B,GACxB,OAAqB,MAAdA,EAAEsB,SAAmBtB,EAAEsB,SAAW,GAEtC,SAASM,EAAY5B,GACxB,MAAMgC,EAAe,YAAWhC,EAAEqB,UAC5BY,EAAYF,EAAY/B,GAAGkC,IAAIN,GACrC,OAAO,YAAiB,CAACI,KAAiBC,IAEvC,SAASH,EAAOK,EAAIC,GACvB,MAAoB,KAAhBD,EAAGd,SACoB,KAAhBe,EAAGf,UACH,YAAgBgB,EAAkBF,GAAKE,EAAkBD,GAAK,EAAEE,EAAIC,IAAMC,EAAIC,KAAQH,IAAOE,GAAMV,EAAOS,EAAIE,IAG9GN,EAAGd,WAAae,EAAGf,UACnB,YAAgBU,EAAYI,GAAKJ,EAAYK,GAAKN,GAG1D,SAASY,EAAWrB,EAAUC,EAAUC,EAAWC,GACtD,OAAO,IAAIJ,EAASC,EAAUC,EAAUC,EAAWC,GAEhD,SAASmB,EAAYtB,EAAUC,EAAUC,EAAWL,GACvD,OAAO,IAAIE,EAASC,EAAUC,EAAUC,OAAWqB,EAAW1B,GAK3D,SAAS2B,EAAWxB,EAAUC,EAAUC,EAAWE,GACtD,MAAMzB,EAAI,IAAIoB,EAASC,EAAUC,EAAUC,OAAWqB,OAAWA,EAAW,KACxE,MAAME,EAAYvB,EAAU5D,UAAU8D,QACtC,OAAOA,IAAQS,IAAI,CAAChB,EAAQ3D,IAAM,IAAIwD,EAASf,EAAGzC,EAAGuF,EAAUvF,GAAI2D,MAEvE,OAAOlB,EAEJ,SAAS+C,KAAczB,GAC1B,OAAO,IAAIF,EAAS,gBAAkBE,EAAS7D,OAAQ6D,GAKpD,SAAS0B,EAAYC,EAASC,GACjC,OAAO,IAAI9B,EAAS,qCAAsC,CAAC6B,EAASC,IAEjE,SAASC,EAAYC,GACxB,OAAO,IAAIhC,EAAS,uCAAwC,CAACgC,IAE1D,SAASC,EAAUD,GACtB,OAAO,IAAIhC,EAAS,4CAA6C,CAACgC,IAE/D,SAASE,EAAWF,GACvB,OAAO,IAAIhC,EAASgC,EAAQ/B,SAAW,KAAM,CAAC+B,IAK3C,MAAMG,EAAW,IAAInC,EAAS,iBACxBoC,EAAY,IAAIpC,EAAS,8BAEzBqC,GADY,IAAIrC,EAAS,eACX,IAAIA,EAAS,kBAC3BsC,EAAY,IAAItC,EAAS,kBACzBuC,EAAY,IAAIvC,EAAS,gBACzBwC,EAAa,IAAIxC,EAAS,eAC1ByC,EAAa,IAAIzC,EAAS,gBAC1B0C,EAAc,IAAI1C,EAAS,iBAC3B2C,EAAa,IAAI3C,EAAS,gBAC1B4C,EAAc,IAAI5C,EAAS,iBAC3B6C,EAAe,IAAI7C,EAAS,iBAC5B8C,EAAe,IAAI9C,EAAS,iBACb,IAAIA,EAAS,kBAClC,SAAS9B,EAAK6E,GACjB,GAAIC,MAAMC,QAAQF,GACd,OAAOA,EAAK,GAEX,GAAIA,aAAgBpD,EACrB,OAAOoD,EAAK7E,KAEX,CACD,MAAM/B,EAAI4G,EAAK9C,SAASiD,YAAY,KACpC,OAAc,IAAP/G,EAAW4G,EAAK9C,SAAW8C,EAAK9C,SAASkD,OAAOhH,EAAI,IAG5D,SAASoE,EAAS3B,GACrB,MAAMwE,EAAoB,MAAdxE,EAAEsB,UAAqB+C,EAAQrE,GAAkB,GAAbA,EAAEsB,SAClD,OAAIkD,EAAI/G,OAAS,EACNuC,EAAEqB,SAAW,IAAMmD,EAAItC,IAAKuC,GAAM9C,EAAS8C,IAAIC,KAAK,KAAO,IAG3D1E,EAAEqB,SAOV,SAASgD,EAAQrE,GACpB,OAAOA,EAAEqB,SAASsD,SAAS,MAExB,SAASC,EAAe5E,GAC3B,IAAI6E,EACJ,OAAOR,EAAQrE,GAA2B,QAArB6E,EAAK7E,EAAEsB,gBAA6B,IAAPuD,OAAgB,EAASA,EAAG,QAAKjC,EAEhF,SAASkC,EAAc9E,GAC1B,OAAqB,MAAdA,EAAEsB,UAAoBtB,EAAEsB,SAAS7D,OAAS,EAE9C,SAASsH,EAAO/E,GACnB,OAAsB,MAAfA,EAAE0B,WAAqB1B,EAAE0B,UAAUjE,OAAS,EAUhD,SAASuH,EAAyBhF,GACrC,OAAqB,MAAdA,EAAEsB,SAAmBtB,EAAI,IAAIoB,EAASpB,EAAEqB,SAAUrB,EAAEsB,SAASY,IAAI,IAAMqB,IAE3E,SAAS0B,EAAsBjF,GAClC,IAAI6E,EACJ,OAA6B,QAArBA,EAAK7E,EAAEsB,gBAA6B,IAAPuD,OAAgB,EAASA,EAAG,GAsE9D,SAASK,EAAclF,GAC1B,GAAe,MAAXA,EAAEyB,MACF,OAAOzB,EAAEyB,QAGT,MAAM,IAAI0D,MAASnF,EAAEqB,SAAL,4BAGjB,SAASgB,EAAkBrC,GAC9B,GAAgB,MAAZA,EAAEkB,OACF,OAAOlB,EAAEkB,SAGT,MAAM,IAAIiE,MAASnF,EAAEqB,SAAL,6BAGjB,SAAS+D,EAAiBpF,GAC7B,GAAIqF,EAAQrF,IAAoB,MAAdA,EAAEsB,SAChB,OAAOtB,EAAEsB,SAGT,MAAM,IAAI6D,MAASnF,EAAEqB,SAAL,wBAGjB,SAASiE,EAAoBtF,GAChC,GAAIuF,EAAWvF,IAAoB,MAAdA,EAAEsB,SAAkB,CACrC,MAAMkD,EAAMxE,EAAEsB,SACd,MAAO,CAACkD,EAAI,GAAIA,EAAI,IAGpB,MAAM,IAAIW,MAASnF,EAAEqB,SAAL,+BAGjB,SAASmE,EAAQxF,GACpB,OAAOA,aAAaoB,EAAsB,MAAXpB,EAAEyB,MAAgBzB,aAAa,IAE3D,SAASyF,EAASzF,GACrB,OAAOA,aAAaoB,EAAuB,MAAZpB,EAAEkB,OAAiBlB,aAAa,IAE5D,SAASqF,EAAQrF,GACpB,OAAOA,EAAEqB,SAASqE,WAAW,kBAAoBrB,EAAQrE,GAGtD,SAASuF,EAAWvF,GACvB,MAAsB,uCAAfA,EAAEqB,SAGN,SAASsE,EAAeC,EAAG5F,GAC9B,MACM6F,EADQX,EAAclF,GACR4F,EAAE3E,KACtB,GAAa,MAAT4E,EACA,MAAM,IAAIV,MAAM,oBAAoBS,EAAEtG,sBAE1C,MAAO,CAACuG,EAAOD,EAAE1E,QAEd,SAAS4E,EAAmBC,GAC/B,OAAqB,MAAdA,EAAI7E,OAAiB,GAAK6E,EAAI7E,OAQlC,SAAS8E,EAAeJ,EAAGK,GAC9B,OAAOL,EAAEK,EAAM,IAQZ,SAASC,EAAUH,EAAKI,GAC3B,MAAMC,GAAkBL,EAAI7E,QAAU,IAAIzD,OAC1C,GAAI0I,EAAO1I,SAAW2I,EAClB,MAAM,IAAIjB,MAAM,+BAA+BiB,aAA0BD,EAAO1I,UAEpF,OAAsC,MAA/BsI,EAAI/E,cAAcO,UACnB,IAAIwE,EAAI/E,cAAcO,UAAUwE,EAAI9E,OAAQkF,GAC5C,GAEH,SAASE,EAAWrG,EAAGmG,GAC1B,MAAMjF,EAASmB,EAAkBrC,GACjC,GAAIkB,EAAOzD,SAAW0I,EAAO1I,OACzB,MAAM,IAAI0H,MAAM,+BAA+BjE,EAAOzD,kBAAkB0I,EAAO1I,UAEnF,OAAsB,MAAfuC,EAAEuB,UACH,IAAIvB,EAAEuB,aAAa4E,GACnBjF,EAAOoF,OAAO,CAACC,GAAMlG,EAAKmG,GAAKjJ,KAC7BgJ,EAAIlG,GAAO8F,EAAO5I,GACXgJ,GACR,IAEJ,SAASE,EAAUN,EAAQK,GAC9B,OAAOL,I,6BC3TX,4zBAuBO,MAAMO,UAAmB,IAC5B,YAAYC,EAAMC,GACdC,QACA1F,KAAKwF,KAAOA,EACZxF,KAAKyF,KAAOA,EAEhB,WAEI,MAAQ,IAAM,YAAK,KADRzF,MACqB,IAEpC,OAAOU,GACH,MAAMiF,EAAK3F,KACX,GAAI2F,IAAOjF,EACP,OAAO,EAkCP,MA/Ba,EAACkF,EAAUC,KACpBC,EACA,OAAa,CACT,MAAMC,EAAOH,EAAUI,EAAOH,EACxBI,EAAa,CAACF,EAAKN,KAAMO,EAAKP,MACpC,GAAqB,MAAjBQ,EAAW,GAAY,CACvB,GAAqB,MAAjBA,EAAW,GAAY,CACvB,MAAMC,EAAKD,EAAW,GAChBE,EAAKF,EAAW,GACtB,GAAI,YAAOF,EAAKP,KAAMQ,EAAKR,MAAO,CAC9BI,EAAWM,EACXL,EAAWM,EACX,SAASL,EAGT,OAAO,EAIX,OAAO,EAGV,OAAqB,MAAjBG,EAAW,KASrBH,CAAKH,EAAIjF,GAGxB,cAyBI,OAAwB,EAvBX,EAAC0F,EAAOC,EAAOT,KAExB,OAAa,CACT,MAAMxJ,EAAIgK,EAAOE,EAAID,EAAON,EAAOH,EAC7BK,EAAaF,EAAKN,KACxB,GAAkB,MAAdQ,EAaA,OAAW,EAAJK,EAbX,CACI,MAAMzH,EAAIoH,EACV,GAAI7J,EAAI,GACJ,OAAW,EAAJkK,EAGPF,EAAShK,EAAI,EACbiK,GAAWC,GAAK,GAAK,YAAeP,EAAKP,MAAU,IAAMpJ,EACzDwJ,EAAW/G,KAUpBiH,CAAK,EAAG,EAxBJ9F,MA0Bf,OAAOuG,GAEH,OAAOtD,MAAMuD,KADCxG,MAGlB,UAAUU,GAkCN,OAAyB,EAhCZ,EAACkF,EAAUC,KACpBC,EACA,OAAa,CACT,MAAMC,EAAOH,EAAUI,EAAOH,EACxBI,EAAa,CAACF,EAAKN,KAAMO,EAAKP,MACpC,GAAqB,MAAjBQ,EAAW,GAAY,CACvB,GAAqB,MAAjBA,EAAW,GAAY,CACvB,MAAMC,EAAKD,EAAW,GAChBE,EAAKF,EAAW,GAChBhI,EAAoC,EAAhC,YAAQ8H,EAAKP,KAAMQ,EAAKR,MAClC,GAAU,IAANvH,EAAS,CACT2H,EAAWM,EACXL,EAAWM,EACX,SAASL,EAGT,OAAW,EAAJ7H,EAIX,OAAO,EAGV,OAAqB,MAAjBgI,EAAW,IACR,EAGD,IAKZH,CAjCI9F,KAiCKU,GAEpB,gBAEI,OAuDD,SAAyCiF,GAC5C,OAAO,IAAIc,EAAiBd,GAxDjBe,CADI1G,MAGf,CAACtB,OAAOiI,YACJ,OAAO,YAAW3G,KAAK4G,iBAE3B,iDAEI,OAAO,YADI5G,OASZ,MAAMyG,EACT,YAAYd,GACR3F,KAAK2F,GAAKA,EACV3F,KAAK6G,GAAK7G,KAAK2F,GACf3F,KAAK8G,QAAU,KAEnB,yDAEI,OADW9G,KACD8G,QAEd,+CAEI,OADW9G,KACD8G,QAEd,4CACI,MAAMC,EAAK/G,KACLiG,EAAac,EAAGF,GAAGpB,KACzB,GAAkB,MAAdQ,EAAoB,CACpB,MAAMpH,EAAIoH,EAGV,OAFAc,EAAGD,QAAUC,EAAGF,GAAGrB,KACnBuB,EAAGF,GAAKhI,GACD,EAGP,OAAO,EAGf,yCACemB,KACR6G,GADQ7G,KACA2F,GADA3F,KAER8G,QAAU,KAEjB,YAYG,SAASE,IACZ,OAAO,IAAIzB,EAAW,UAAM,GAGzB,SAAS0B,EAAyB3D,EAAGqC,GACxC,OAAO,IAAIJ,EAAWjC,EAAGqC,GAGtB,SAASuB,EAAwBvB,GACpC,OAAkB,MAAXA,EAAGF,KAGP,SAAS0B,EAAuBxB,GAiBnC,OAAqB,EAhBR,EAACS,EAAOR,KAEjB,OAAa,CACT,MAAMxJ,EAAIgK,EACJH,EADkBL,EACAH,KACxB,GAAkB,MAAdQ,EAMA,OAAW,EAAJ7J,EALPgK,EAAShK,EAAI,EACbwJ,EAAWK,IAShBH,CAAK,EAAGH,GAGZ,SAASyB,EAAqBzB,GAEjC,GAAkB,MADCA,EAAGF,KAElB,OAAOE,EAAGH,KAGV,MAAM,IAAKxB,MAAM,yCAIlB,SAASqD,EAAqB1B,GACjC,MAAMM,EAAaN,EAAGF,KACtB,GAAkB,MAAdQ,EACA,OAAOA,EAGP,MAAM,IAAKjC,MAAM,yCA6BlB,SAASsD,IACZ,OAAON,IAGJ,SAASO,EAAKjE,EAAGqC,GACpB,OAAOsB,EAAyB3D,EAAGqC,GAGhC,SAAS6B,EAAUlE,GACtB,OAAO2D,EAAyB3D,EAAG0D,KAGhC,SAASS,EAAQ9B,GACpB,OAAOuB,EAAwBvB,GAG5B,SAASrJ,EAAOqJ,GACnB,OAAOwB,EAAuBxB,GAG3B,SAASH,EAAKG,GACjB,OAAOyB,EAAqBzB,GAGzB,SAAS+B,EAAQ/B,GACpB,OAAIuB,EAAwBvB,QACxB,EAGO,YAAKyB,EAAqBzB,IAIlC,SAASF,EAAKE,GACjB,OAAO0B,EAAqB1B,GAoEzB,SAASgC,EAAQhC,GACpB,MAAMiC,EAAmC,EAA7BT,EAAuBxB,GAC7BkC,EAAM,YAAK,IAAI5E,MAAM2E,GAAM,EAAGA,EAAK,MAezC,MAda,EAACxB,EAAOR,KAEjB,OAAa,CACT,MAAMxJ,EAAIgK,EAAOL,EAAOH,EACxB,GAAKsB,EAAwBnB,GAM7B,MALI8B,EAAIzL,GAAKgL,EAAqBrB,GAC9BK,EAAShK,EAAI,EACbwJ,EAAWyB,EAAqBtB,KAM5CD,CAAK,EAAGH,GACDkC,EAGJ,SAASC,EAAKC,EAAQC,EAAOrC,GAChC,IAAIsC,EAAMD,EACNjC,EAAOJ,EACX,MAAQuB,EAAwBnB,IAC5BkC,EAAMF,EAAOE,EAAKb,EAAqBrB,IACvCA,EAAOsB,EAAqBtB,GAEhC,OAAOkC,EAGJ,SAASC,EAAQvC,GACpB,OAAOmC,EAAK,CAACG,EAAK3E,IAAM2D,EAAyB3D,EAAG2E,GAAMjB,IAAwBrB,GAoE/E,SAASwC,EAAQC,EAAQzC,GAC5BmC,EAAK,CAACO,EAAU/E,KACZ8E,EAAO9E,SACR,EAAQqC,GA2BR,SAAS2C,EAAgB3C,EAAI4C,GAChC,IAAIV,EAAMU,EACV,IAAK,IAAInM,EAAIuJ,EAAGrJ,OAAS,EAAGF,GAAK,EAAGA,IAChCyL,EAAMZ,EAAyBtB,EAAGvJ,GAAIyL,GAE1C,OAAOA,EAGJ,SAASW,EAAQ7C,GACpB,OAAO2C,EAAgB3C,EAAIqB,KAGxB,SAASyB,EAAM9C,GAClB,IAAI+C,EAAM7J,EACV,GAAI,YAAY8G,GACZ,OAAO6C,EAAQ7C,GAEd,GAAIA,aAAcJ,EACnB,OAAOI,EAEN,CACD,MAAMgD,EAAO3B,IACb,IAAI4B,EAAOD,EACX,MAAME,EAAa,YAAclD,GACjC,IACI,KAAOkD,EAAW,8CAA8C,CAC5D,MAAMvF,EAAIuF,EAAW,0DACZH,EAAOE,EAAO/J,EAAI,IAAK0G,EAAWjC,OAAG,GAAWoF,EAAKjD,KAAO5G,EAArE+J,EAAwE/J,GAGhF,QACIgK,EAAWC,UAEf,MAAMC,EAAOH,EACPI,EAAMhC,IAEZ,OADA+B,EAAKtD,KAAOuD,EACL3B,EAAqBsB,IAI7B,SAASM,EAAOC,GACnB,MAAMP,EAAO3B,IACb,IAAI4B,EAAOD,EACX,MAAMP,EAAUzC,IACZiD,EAAOd,EAAK,CAACG,EAAK3E,KACd,MAAMzE,EAAI,IAAI0G,EAAWjC,OAAG,GAE5B,OADA2E,EAAIxC,KAAO5G,EACJA,GACR+J,EAAMjD,IAEb,GAAI,YAAYuD,GACZA,EAAMC,QAAQf,QAEb,GAAIc,aAAiB3D,EACtB4C,EAAQC,EAAQc,OAEf,CACD,MAAML,EAAa,YAAcK,GACjC,IACI,KAAOL,EAAW,8CACdT,EAAOS,EAAW,2DAG1B,QACIA,EAAWC,WAGnB,MAAMM,EAAOR,EACPI,EAAMhC,IAEZ,OADAoC,EAAK3D,KAAOuD,EACL3B,EAAqBsB,GA8DzB,SAAS5H,EAAIsI,EAAS1D,GACzB,MAAMgD,EAAO3B,IACP4B,EAAOd,EAAK,CAACG,EAAK3E,KACpB,MAAMzE,EAAI,IAAI0G,EAAW8D,EAAQ/F,QAAI,GAErC,OADA2E,EAAIxC,KAAO5G,EACJA,GACR8J,EAAMhD,GACHqD,EAAMhC,IAEZ,OADA4B,EAAKnD,KAAOuD,EACL3B,EAAqBsB,GAuFzB,SAASW,EAAQC,EAAG5D,GAqBvB,MApBa,CAACC,IACVE,EACA,OAAa,CACT,MAAMC,EAAOH,EACb,GAAIsB,EAAwBnB,GACxB,OAEC,CACD,MAAME,EAAasD,EAAEnC,EAAqBrB,IAC1C,GAAkB,MAAdE,EAAoB,CACpBL,EAAWyB,EAAqBtB,GAChC,SAASD,EAGT,OAAOG,KAMhBH,CAAKH,GAaT,SAAS6D,EAAQD,EAAG5D,GACvB,OAAO2D,EAAShG,GAAOiG,EAAEjG,GAAK,YAAKA,QAAK,EAAWqC,GAyEhD,SAAS8D,EAAQrK,EAAGuG,GAmBvB,MAlBa,EAACS,EAAOR,KAEjB,OAAa,CACT,MAAMxJ,EAAIgK,EAAOL,EAAOH,EACxB,GAAIsB,EAAwBnB,GACxB,OAEC,GAAI3J,IAAMgD,EACX,OAAO,YAAKgI,EAAqBrB,IAGjCK,EAAShK,EAAI,EACbwJ,EAAWyB,EAAqBtB,KAMrCD,CAAK,EAAGH,GA2CZ,SAAS+D,EAAOH,EAAG5D,GACtB,MAAMgD,EAAO3B,IACP4B,EAAOd,EAAK,CAACG,EAAK3E,KACpB,MAAM2C,EAAasD,EAAEjG,GACrB,GAAkB,MAAd2C,EACA,OAAOgC,EAEN,CACD,MAAMpJ,EAAI,IAAI0G,EAAW,YAAQU,QAAa,GAE9C,OADAgC,EAAIxC,KAAO5G,EACJA,IAEZ8J,EAAMhD,GACHqD,EAAMhC,IAEZ,OADA4B,EAAKnD,KAAOuD,EACL3B,EAAqBsB,GAwBzB,SAASxD,EAAOoE,EAAG5D,GACtB,GAAIuB,EAAwBvB,GACxB,MAAM,IAAK3B,MA36BiB,kBA86B5B,OAAO8D,EAAKyB,EAAG/D,EAAKG,GAAKF,EAAKE,IA4L/B,SAASgE,EAAUC,EAAeC,GAErC,OAAa,CACT,MAAMC,EAAYF,EAAejE,EAAKkE,EACtC,GAAI3C,EAAwBvB,GACxB,OAAOA,EAEN,IAAKmE,EAAU1C,EAAqBzB,IACrC,OAAOA,EAGPiE,EAAgBE,EAChBD,EAASxC,EAAqB1B,M,27BCxnCtCoE,EAAO,KACX,IACIA,EAAO,IAAIC,YAAYC,SAAS,IAAID,YAAYE,OAAO,IAAIC,WAAW,CAClE,EAAG,GAAI,IAAK,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,IAAK,IAAK,IAAK,EAAG,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,IAAK,IAAK,EAAG,EAAG,EAAG,IAAK,IAAK,IAAK,GAAI,IAAK,EAAG,EAAG,EAAG,IAAK,IAAK,IAAK,GAAI,IAAK,EAAG,EAAG,EAAG,IAAK,IAAK,IAAK,GAAI,IAAK,EAAG,EAAG,EAAG,IAAK,IAAK,IAAK,GAAI,IAAK,EAAG,EAAG,EAAG,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,IAAK,EAAG,EAAG,GAAI,IAAK,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,EAAG,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,GAAI,EAAG,IAAK,GAAI,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,EAAG,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,GAAI,EAAG,IAAK,GAAI,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,EAAG,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,GAAI,EAAG,IAAK,GAAI,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,EAAG,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,GAAI,EAAG,IAAK,GAAI,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,EAAG,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,GAAI,EAAG,IAAK,MACznC,IAAItM,QAEb,MAAOuM,IAaA,SAASC,EAAKC,EAAKC,EAAMC,GAK5BxK,KAAKsK,IAAY,EAANA,EAKXtK,KAAKuK,KAAc,EAAPA,EAKZvK,KAAKwK,WAAaA,EAoDf,SAASC,EAAOrF,GACnB,OAAsC,KAA9BA,GAAOA,EAAgB,YAnDnCiF,EAAK7N,UAAUkO,YAAc,WACzB,IAAIC,EAAK3K,KAAKwK,SAAW,EAAI,EAG7B,OAFAG,GAAOA,GAAM,GAAKA,EAAM3K,KAAKuK,KAC7BI,GAAOA,GAAM,GAAKA,EAAM3K,KAAKsK,IACtBK,GAEXN,EAAK7N,UAAUoO,OAAS,SAAUtH,GAAK,OAAO3C,EAAOX,KAAMsD,IAC3D+G,EAAK7N,UAAUqO,UAAY,SAAUvH,GAAK,OAAOwH,EAAQ9K,KAAMsD,IAC/D+G,EAAK7N,UAAUuO,SAAW,SAAUC,GAAS,OAAO,EAAShL,KAAMgL,IACnEX,EAAK7N,UAAUyO,OAAS,WAAc,OAAO,EAASjL,OACtDqK,EAAK7N,UAAU,KAAU,WACrB,MAAM8G,EAAItD,KACV,MAAO,CACHkL,SAAUC,GAAKD,EAAS5H,EAAG6H,GAC3BC,YAAaC,GAAMC,OAAOhI,IAAK,GAAI8H,YAAYC,GAAIjI,OAAO,GAC1DmI,cAAeC,GAAMF,OAAOhI,IAAK,GAAIiI,cAAcC,GAAIpI,OAAO,GAC9DqI,QAASD,GAAMF,OAAOhI,IAAK,GAAImI,QAAQD,GAAIpI,OAAO,GAClDsI,MAAO,IAAM,EAASpI,EAAEkH,SAAWlH,EAAIqI,EAAUC,EAAQtI,IAAI,GAAO,MAyB5E+G,EAAK7N,UAAUqP,WACftP,OAAO+B,eAAe+L,EAAK7N,UAAW,aAAc,CAAEoC,OAAO,IAsB7D,IAAIkN,EAAY,GAMZC,EAAa,GAOV,SAASC,EAAQpN,EAAO4L,GAC3B,IAAIpF,EAAK6G,EAAWC,EACpB,OAAI1B,GAEI0B,EAAS,IADbtN,KAAW,IACgBA,EAAQ,OAC/BqN,EAAYF,EAAWnN,IAEZqN,GAEf7G,EAAM+G,EAASvN,GAAgB,EAARA,GAAa,GAAK,EAAI,GAAG,GAC5CsN,IACAH,EAAWnN,GAASwG,GACjBA,IAIH8G,GAAU,MADdtN,GAAS,IACqBA,EAAQ,OAClCqN,EAAYH,EAAUlN,IAEXqN,GAEf7G,EAAM+G,EAASvN,EAAOA,EAAQ,GAAK,EAAI,GAAG,GACtCsN,IACAJ,EAAUlN,GAASwG,GAChBA,GAiBR,SAASgH,EAAWxN,EAAO4L,GAC9B,GAAI6B,MAAMzN,GACN,OAAO4L,EAAW8B,EAAQC,EAC9B,GAAI/B,EAAU,CACV,GAAI5L,EAAQ,EACR,OAAO0N,EACX,GAAI1N,GAAS4N,EACT,OAAOC,MAEV,CACD,GAAI7N,IAAU8N,EACV,OAAOC,EACX,GAAI/N,EAAQ,GAAK8N,EACb,OAAOE,EAEf,OAAIhO,EAAQ,EACDiO,EAAOT,GAAYxN,EAAO4L,IAC9B2B,EAAUvN,EAAQkO,EAAkB,EAAIlO,EAAQkO,EAAkB,EAAGtC,GAiBzE,SAAS2B,EAASY,EAASC,EAAUxC,GACxC,OAAO,IAAIH,EAAK0C,EAASC,EAAUxC,GAmBvC,IAAIyC,EAAUC,KAAKC,IAQZ,SAASC,EAAWC,EAAK7C,EAAUQ,GACtC,GAAmB,IAAfqC,EAAI/Q,OACJ,MAAM0H,MAAM,gBAChB,GAAY,QAARqJ,GAAyB,aAARA,GAA8B,cAARA,GAA+B,cAARA,EAC9D,OAAOd,EAUX,GATwB,iBAAb/B,GAEPQ,EAAQR,EACJA,GAAW,GAGfA,IAAaA,GAEjBQ,EAAQA,GAAS,IACL,GAAK,GAAKA,EAClB,MAAMsC,WAAW,SACrB,IAAI/N,EAAI8N,EAAIE,QAAQ,KACpB,GAAIhO,EAAI,EACJ,MAAMyE,MAAM,mBACX,GAAU,IAANzE,EACL,OAAOsN,EAAOO,EAAWC,EAAIG,UAAU,GAAIhD,EAAUQ,IAMzD,IAFA,IAAIyC,EAAerB,EAAWa,EAAQjC,EAAO,IACzC7N,EAASoP,EACJnQ,EAAI,EAAGA,EAAIiR,EAAI/Q,OAAQF,GAAK,EAAG,CACpC,IAAIsR,EAAOR,KAAKS,IAAI,EAAGN,EAAI/Q,OAASF,GAAIwC,EAAQgP,SAASP,EAAIG,UAAUpR,EAAGA,EAAIsR,GAAO1C,GACrF,GAAI0C,EAAO,EAEPvQ,EAAS0Q,EAAI3C,EAAS/N,EADViP,EAAWa,EAAQjC,EAAO0C,KACAtB,EAAWxN,SAIjDzB,EAAS0Q,EADT1Q,EAAS+N,EAAS/N,EAAQsQ,GACLrB,EAAWxN,IAIxC,OADAzB,EAAOqN,SAAWA,EACXrN,EAkBJ,SAAS2Q,EAAUC,EAAKvD,GAC3B,MAAmB,iBAARuD,EACA3B,EAAW2B,EAAKvD,GACR,iBAARuD,EACAX,EAAWW,EAAKvD,GAEpB2B,EAAS4B,EAAIzD,IAAKyD,EAAIxD,KAA0B,kBAAbC,EAAyBA,EAAWuD,EAAIvD,UAiBtF,IAYIsC,EAAiBkB,WAMjBxB,EAAiBM,EAAiBA,EAMlCJ,EAAiBF,EAAiB,EAMlCyB,EAAajC,EAxBI,GAAK,IA6BfO,EAAOP,EAAQ,GAUfM,EAAQN,EAAQ,GAAG,GAUnBkC,EAAMlC,EAAQ,GAUdmC,EAAOnC,EAAQ,GAAG,GAUlBoC,EAAUpC,GAAS,GAUnBY,EAAYT,GAAS,EAAgB,YAAgB,GAUrDM,EAAqBN,GAAS,GAAgB,GAAgB,GAU9DQ,EAAYR,EAAS,GAAG,YAAgB,GAgB5C,SAASkC,EAAMC,GAClB,OAAOA,EAAM9D,SAAW8D,EAAMhE,MAAQ,EAAIgE,EAAMhE,IAQ7C,SAASiE,EAASD,GACrB,OAAIA,EAAM9D,UACG8D,EAAM/D,OAAS,GAAKuC,GAAmBwB,EAAMhE,MAAQ,GAC3DgE,EAAM/D,KAAOuC,GAAkBwB,EAAMhE,MAAQ,GAWjD,SAAS,EAASgE,EAAOtD,GAE5B,IADAA,EAAQA,GAAS,IACL,GAAK,GAAKA,EAClB,MAAMsC,WAAW,SACrB,GAAIkB,EAAOF,GACP,MAAO,IACX,GAAI,EAAWA,GAAQ,CACnB,GAAI3N,EAAO2N,EAAO3B,GAAY,CAG1B,IAAI8B,EAAYrC,EAAWpB,GAAQ0D,EAAMC,EAAOL,EAAOG,GAAYG,EAAOC,EAAS3D,EAASwD,EAAKD,GAAYH,GAC7G,OAAO,EAASI,EAAK1D,GAASqD,EAAMO,GAAM7D,SAASC,GAGnD,MAAO,IAAM,EAAS6B,EAAOyB,GAAQtD,GAM7C,IAFA,IAAIyC,EAAerB,EAAWa,EAAQjC,EAAO,GAAIsD,EAAM9D,UAAWsE,EAAMR,EACpEnR,EAAS,KACA,CACT,IAAI4R,EAASJ,EAAOG,EAAKrB,GAAoFuB,GAA5DX,EAAMQ,EAASC,EAAK5D,EAAS6D,EAAQtB,OAAoB,GAAmB1C,SAASC,GAEtI,GAAIwD,EADJM,EAAMC,GAEF,OAAOC,EAAS7R,EAEhB,KAAO6R,EAAO1S,OAAS,GACnB0S,EAAS,IAAMA,EACnB7R,EAAS,GAAK6R,EAAS7R,GA6D5B,SAASqR,EAAOF,GACnB,OAAsB,IAAfA,EAAM/D,MAA4B,IAAd+D,EAAMhE,IAa9B,SAAS,EAAWgE,GACvB,OAAQA,EAAM9D,UAAY8D,EAAM/D,KAAO,EAiBpC,SAAS0E,EAAMX,GAClB,OAA2B,IAAP,EAAZA,EAAMhE,KAkBX,SAAS3J,EAAO2N,EAAO5N,GAG1B,OAFK+J,EAAO/J,KACRA,EAAQoN,EAAUpN,KAClB4N,EAAM9D,WAAa9J,EAAM8J,UAAa8D,EAAM/D,OAAS,IAAQ,GAAM7J,EAAM6J,OAAS,IAAQ,KAEvF+D,EAAM/D,OAAS7J,EAAM6J,MAAQ+D,EAAMhE,MAAQ5J,EAAM4J,KAwCrD,SAAS4E,EAASZ,EAAO5N,GAC5B,OAAOoK,EAAQwD,EAAuB5N,GAAS,EAwC5C,SAASyO,EAAYb,EAAO5N,GAC/B,OAAOoK,EAAQwD,EAAuB5N,GAAS,EAgB5C,SAAS0O,EAAmBd,EAAO5N,GACtC,OAAOoK,EAAQwD,EAAuB5N,IAAU,EAwB7C,SAASoK,EAAQwD,EAAO5N,GAG3B,GAFK+J,EAAO/J,KACRA,EAAQoN,EAAUpN,IAClBC,EAAO2N,EAAO5N,GACd,OAAO,EACX,IAAI2O,EAAU,EAAWf,GAAQgB,EAAW,EAAW5O,GACvD,OAAI2O,IAAYC,GACJ,GACPD,GAAWC,EACL,EAENhB,EAAM9D,SAGH9J,EAAM6J,OAAS,EAAM+D,EAAM/D,OAAS,GAAO7J,EAAM6J,OAAS+D,EAAM/D,MAAS7J,EAAM4J,MAAQ,EAAMgE,EAAMhE,MAAQ,GAAO,EAAI,EAFnH,EAAWuE,EAASP,EAAO5N,KAAW,EAAI,EAkBlD,SAASmM,EAAOyB,GACnB,OAAKA,EAAM9D,UAAY7J,EAAO2N,EAAO3B,GAC1BA,EACJkB,EAAI0B,EAAIjB,GAAQJ,GAepB,SAASL,EAAIS,EAAOkB,GAClB/E,EAAO+E,KACRA,EAAS1B,EAAU0B,IAEvB,IAAIC,EAAMnB,EAAM/D,OAAS,GACrBmF,EAAmB,MAAbpB,EAAM/D,KACZoF,EAAMrB,EAAMhE,MAAQ,GACpBsF,EAAkB,MAAZtB,EAAMhE,IACZuF,EAAML,EAAOjF,OAAS,GACtBuF,EAAoB,MAAdN,EAAOjF,KACbwF,EAAMP,EAAOlF,MAAQ,GAErB0F,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAYrC,OAVAD,IADAC,GAAOP,GAFgB,MAAbJ,EAAOlF,QAGF,GAGf2F,IADAC,GAAOP,EAAMI,KACE,GAGfC,IADAC,GAAOP,EAAMI,KACE,GAEfE,GAAOP,EAAMI,EAEN1D,GANP+D,GAAO,QAMiB,IATxBC,GAAO,QAQPH,GAAO,QACoC,IAH3CC,GAAO,OAG+C3B,EAAM9D,UASzD,SAASqE,EAASP,EAAO8B,GAG5B,OAFK3F,EAAO2F,KACRA,EAAatC,EAAUsC,IACpBvC,EAAIS,EAAOzB,EAAOuD,IAgBtB,SAASlF,EAASoD,EAAO+B,GAC5B,GAAI7B,EAAOF,GACP,OAAOA,EAAM9D,SAAW8B,EAAQC,EAIpC,GAHK9B,EAAO4F,KACRA,EAAavC,EAAUuC,IAEvBtG,EAEA,OAAOoC,EADGpC,EAAKuG,IAAIhC,EAAMhE,IAAKgE,EAAM/D,KAAM8F,EAAW/F,IAAK+F,EAAW9F,MAChDR,EAAKwG,WAAYjC,EAAM9D,UAEhD,GAAIgE,EAAO6B,GACP,OAAO/B,EAAM9D,SAAW8B,EAAQC,EACpC,GAAI5L,EAAO2N,EAAO3B,GACd,OAAOsC,EAAMoB,GAAc1D,EAAYJ,EAC3C,GAAI5L,EAAO0P,EAAY1D,GACnB,OAAOsC,EAAMX,GAAS3B,EAAYJ,EACtC,GAAI,EAAW+B,GACX,OAAI,EAAW+B,GACJnF,EAAS2B,EAAOyB,GAAQzB,EAAOwD,IAE/BxD,EAAO3B,EAAS2B,EAAOyB,GAAQ+B,IAEzC,GAAI,EAAWA,GAChB,OAAOxD,EAAO3B,EAASoD,EAAOzB,EAAOwD,KAEzC,GAAInB,EAASZ,EAAOL,IAAeiB,EAASmB,EAAYpC,GACpD,OAAO7B,EAAWmC,EAASD,GAASC,EAAS8B,GAAa/B,EAAM9D,UAGpE,IAAIiF,EAAMnB,EAAM/D,OAAS,GACrBmF,EAAmB,MAAbpB,EAAM/D,KACZoF,EAAMrB,EAAMhE,MAAQ,GACpBsF,EAAkB,MAAZtB,EAAMhE,IACZuF,EAAMQ,EAAW9F,OAAS,GAC1BuF,EAAwB,MAAlBO,EAAW9F,KACjBwF,EAAMM,EAAW/F,MAAQ,GACzBkG,EAAuB,MAAjBH,EAAW/F,IACjB0F,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAqBrC,OAnBAD,IADAC,GAAOP,EAAMY,KACE,GAGfP,IADAC,GAAOP,EAAMa,KACE,GACfN,GAAO,MAEPD,IADAC,GAAON,EAAMG,KACE,GAGfC,IADAC,GAAOP,EAAMc,KACE,GACfP,GAAO,MAEPD,IADAC,GAAON,EAAMI,KACE,GACfE,GAAO,MAEPD,IADAC,GAAOL,EAAME,KACE,GAEfE,GAAOP,EAAMe,EAAMd,EAAMK,EAAMJ,EAAMG,EAAMF,EAAMC,EAE1C1D,GAZP+D,GAAO,QAYiB,IAlBxBC,GAAO,QAiBPH,GAAO,QACoC,IAH3CC,GAAO,OAG+C3B,EAAM9D,UAiBzD,SAASmE,EAAOL,EAAOmC,GAG1B,GAFKhG,EAAOgG,KACRA,EAAU3C,EAAU2C,IACpBjC,EAAOiC,GACP,MAAMzM,MAAM,oBAYZ,IAKA0M,EAAQ5B,EAAKjH,EAfjB,GAAIkC,EAIA,OAAKuE,EAAM9D,WACS,aAAhB8D,EAAM/D,OACW,IAAjBkG,EAAQnG,MAAgC,IAAlBmG,EAAQlG,KAK3B4B,GADImC,EAAM9D,SAAWT,EAAK4G,MAAQ5G,EAAK6G,OAAOtC,EAAMhE,IAAKgE,EAAM/D,KAAMkG,EAAQnG,IAAKmG,EAAQlG,MAC5ER,EAAKwG,WAAYjC,EAAM9D,UAHjC8D,EAKf,GAAIE,EAAOF,GACP,OAAOA,EAAM9D,SAAW8B,EAAQC,EAEpC,GAAK+B,EAAM9D,SAiCN,CAKD,GAFKiG,EAAQjG,WACTiG,EA0RL,SAAoBnC,GACvB,OAAIA,EAAM9D,SACC8D,EACJnC,EAASmC,EAAMhE,IAAKgE,EAAM/D,MAAM,GA7RrBsG,CAAWJ,IACrBtB,EAAYsB,EAASnC,GACrB,OAAOhC,EACX,GAAI6C,EAAYsB,EAASK,EAAmBxC,EAAO,IAC/C,OAAOH,EACXtG,EAAMyE,MA1CW,CAGjB,GAAI3L,EAAO2N,EAAO3B,GACd,OAAIhM,EAAO8P,EAASvC,IAAQvN,EAAO8P,EAASrC,GACjCzB,EACFhM,EAAO8P,EAAS9D,GACduB,EAKHvN,EADJ+P,EAASK,EAAUpC,EADJqC,EAAW1C,EAAO,GACGmC,GAAU,GAC3BlE,GACR,EAAWkE,GAAWvC,EAAME,EAInCvG,EAAMgG,EAAI6C,EAAQ/B,EADlBG,EAAMD,EAASP,EAAOpD,EAASuF,EAASC,IACVD,IAKrC,GAAI9P,EAAO8P,EAAS9D,GACrB,OAAO2B,EAAM9D,SAAW8B,EAAQC,EACpC,GAAI,EAAW+B,GACX,OAAI,EAAWmC,GACJ9B,EAAO9B,EAAOyB,GAAQzB,EAAO4D,IACjC5D,EAAO8B,EAAO9B,EAAOyB,GAAQmC,IAEnC,GAAI,EAAWA,GAChB,OAAO5D,EAAO8B,EAAOL,EAAOzB,EAAO4D,KACvC5I,EAAM0E,EAmBV,IADAuC,EAAMR,EACCc,EAAmBN,EAAK2B,IAAU,CAGrCC,EAASxD,KAAK+D,IAAI,EAAG/D,KAAKgE,MAAM3C,EAASO,GAAOP,EAASkC,KAOzD,IAJA,IAAIU,EAAOjE,KAAKkE,KAAKlE,KAAKmE,IAAIX,GAAUxD,KAAKoE,KAAMC,EAASJ,GAAQ,GAAM,EAAIlE,EAAQ,EAAGkE,EAAO,IAGhGK,EAAYpF,EAAWsE,GAASe,EAAYvG,EAASsG,EAAWf,GACzD,EAAWgB,IAActC,EAAYsC,EAAW3C,IAGnD2C,EAAYvG,EADZsG,EAAYpF,EADZsE,GAAUa,EACqBjD,EAAM9D,UACLiG,GAIhCjC,EAAOgD,KACPA,EAAYtD,GAChBrG,EAAMgG,EAAIhG,EAAK2J,GACf1C,EAAMD,EAASC,EAAK2C,GAExB,OAAO5J,EA8CJ,SAAS0H,EAAIjB,GAChB,OAAOnC,GAAUmC,EAAMhE,KAAMgE,EAAM/D,KAAM+D,EAAM9D,UA6C5C,SAASuG,EAAUzC,EAAOoD,GAG7B,OAFIjH,EAAOiH,KACPA,EAAUrD,EAAMqD,IACI,IAAnBA,GAAW,IACLpD,EACFoD,EAAU,GACRvF,EAASmC,EAAMhE,KAAOoH,EAAUpD,EAAM/D,MAAQmH,EAAYpD,EAAMhE,MAAS,GAAKoH,EAAWpD,EAAM9D,UAE/F2B,EAAS,EAAGmC,EAAMhE,KAAQoH,EAAU,GAAKpD,EAAM9D,UAgBvD,SAASwG,EAAW1C,EAAOoD,GAG9B,OAFIjH,EAAOiH,KACPA,EAAUrD,EAAMqD,IACI,IAAnBA,GAAW,IACLpD,EACFoD,EAAU,GACRvF,EAAUmC,EAAMhE,MAAQoH,EAAYpD,EAAM/D,MAAS,GAAKmH,EAAWpD,EAAM/D,MAAQmH,EAASpD,EAAM9D,UAEhG2B,EAASmC,EAAM/D,MAASmH,EAAU,GAAKpD,EAAM/D,MAAQ,EAAI,GAAK,EAAG+D,EAAM9D,UAgB/E,SAASsG,EAAmBxC,EAAOoD,GAItC,GAHIjH,EAAOiH,KACPA,EAAUrD,EAAMqD,IAEJ,KADhBA,GAAW,IAEP,OAAOpD,EAEP,IAAI/D,EAAO+D,EAAM/D,KACjB,OAAImH,EAAU,GAEHvF,EADGmC,EAAMhE,MACSoH,EAAYnH,GAAS,GAAKmH,EAAWnH,IAASmH,EAASpD,EAAM9D,UAG/E2B,EADU,KAAZuF,EACWnH,EAEAA,IAAUmH,EAAU,GAFd,EAAGpD,EAAM9D,UA0GpC,SAASoB,EAAQ0C,EAAOqD,GAC3B,OAAOA,EAQJ,SAAmBrD,GACtB,IAAIsD,EAAKtD,EAAM/D,KAAMsH,EAAKvD,EAAMhE,IAChC,MAAO,CACE,IAALuH,EACAA,IAAO,EAAI,IACXA,IAAO,GAAK,IACZA,IAAO,GACF,IAALD,EACAA,IAAO,EAAI,IACXA,IAAO,GAAK,IACZA,IAAO,IAlBCE,CAAUxD,GA2BnB,SAAmBA,GACtB,IAAIsD,EAAKtD,EAAM/D,KAAMsH,EAAKvD,EAAMhE,IAChC,MAAO,CACHsH,IAAO,GACPA,IAAO,GAAK,IACZA,IAAO,EAAI,IACN,IAALA,EACAC,IAAO,GACPA,IAAO,GAAK,IACZA,IAAO,EAAI,IACN,IAALA,GArC2BE,CAAUzD,GAgDtC,SAAS3C,EAAUqG,EAAOxH,EAAUmH,GACvC,OAAOA,EASJ,SAAqBK,EAAOxH,GAC/B,OAAO,IAAIH,EAAK2H,EAAM,GAClBA,EAAM,IAAM,EACZA,EAAM,IAAM,GACZA,EAAM,IAAM,GAAIA,EAAM,GACtBA,EAAM,IAAM,EACZA,EAAM,IAAM,GACZA,EAAM,IAAM,GAAIxH,GAhBRyH,CAAYD,EAAOxH,GAyB5B,SAAqBwH,EAAOxH,GAC/B,OAAO,IAAIH,EAAK2H,EAAM,IAAM,GACxBA,EAAM,IAAM,GACZA,EAAM,IAAM,EACZA,EAAM,GAAIA,EAAM,IAAM,GACtBA,EAAM,IAAM,GACZA,EAAM,IAAM,EACZA,EAAM,GAAIxH,GAhC6B0H,CAAYF,EAAOxH,GC1wC3D,MAEM2H,EAAc,EACdC,EAAiB,EACjBC,EAAc,EACdC,EAAc,EACdC,GD+9BN,SAAgBjE,EAAOmC,GAI1B,OAHKhG,EAAOgG,KACRA,EAAU3C,EAAU2C,IAEpB1G,EAEOoC,GADImC,EAAM9D,SAAWT,EAAKyI,MAAQzI,EAAK0I,OAAOnE,EAAMhE,IAAKgE,EAAM/D,KAAMkG,EAAQnG,IAAKmG,EAAQlG,MAC5ER,EAAKwG,WAAYjC,EAAM9D,UAEzCqE,EAASP,EAAOpD,EAASyD,EAAOL,EAAOmC,GAAUA,KCt+B/CiC,GAAmB,EACnBC,GAAe,EAGfC,GDkgCN,SAAatE,EAAO5N,GAGvB,OAFK+J,EAAO/J,KACRA,EAAQoN,EAAUpN,IACfyL,EAASmC,EAAMhE,IAAM5J,EAAM4J,IAAKgE,EAAM/D,KAAO7J,EAAM6J,KAAM+D,EAAM9D,WC3/B7D,GAAS,EACT,GAAU,EACV,GAAU,EACV,GAAW,EAEX,GAAa,EAEb,GAAY,EACZ,GAAQ,EAER,GAAW,EACX,GAAW,EACX,GDmdN,SAAoB8D,GACvB,OAAOA,EAAMhE,KCndJ,GDgcN,SAAqBgE,GACxB,OAAOA,EAAM/D,MChcJ,GD0dN,SAA4B+D,GAC/B,OAAOA,EAAMhE,MAAQ,GC1dZ,GDucN,SAA6BgE,GAChC,OAAOA,EAAM/D,OAAS,GC7anB,SAASsI,GAAYjU,EAAO4L,EAAUsI,GACzC,IAAIxP,EAAI1E,EACJmU,EAAK,EACT,OAAQD,GACJ,KAAK,EACDxP,EAAI1E,GAAS,IAAM,GACnBmU,EAAKzP,EACL,MACJ,KAAK,EACDA,EAAI1E,GAAS,KAAO,GACpB,MACJ,KAAK,EACD0E,EAAI1E,GAAS,IAAM,GACnBmU,EAAKzP,EACL,MACJ,KAAK,EACDA,EAAI1E,GAAS,KAAO,GACpB,MACJ,KAAK,EACD0E,EAAI1E,GAAS,EACbmU,EAAKzP,EACL,MACJ,KAAK,EACDA,EAAI1E,IAAU,EAGtB,OAAO,EAAiB0E,EAAGyP,GAAM,GAAIvI,GAElC,SAASwI,GAAM3F,EAAK4F,EAAOzI,EAAU0I,EAAUlI,GAClD,MAAMnD,EAAM,YAAQwF,EAAK4F,EAAOjI,GAChC,GAAW,MAAPnD,EAAa,CACb,MAAMsL,EAAc,CAAC7P,EAAG6H,KACpB,MAAMvD,EAAMsF,KAAK+D,IAAI3N,EAAEhH,OAAQ6O,EAAE7O,QACjC,OAAOgH,EAAE8P,SAASxL,EAAK,MAAQuD,EAAEiI,SAASxL,EAAK,MAE7CyL,EAA0B,MAAbxL,EAAIyL,KACjBC,EA9Dd,SAAqB/I,EAAUQ,EAAOqI,GAClC,OAAQrI,GACJ,KAAK,EAAG,OAAOR,EACX,mEACC6I,EAAa,mEACR,kEACV,KAAK,EAAG,OAAO7I,EACX,yBACC6I,EAAa,yBAA2B,wBAC7C,KAAK,GAAI,OAAO7I,EACZ,uBACC6I,EAAa,sBAAwB,sBAC1C,KAAK,GAAI,OAAO7I,EACZ,mBACC6I,EAAa,mBAAqB,mBACvC,QAAS,MAAM,IAAIrP,MAAM,mBA+CRwP,CAAYhJ,GAA0B,KAAd3C,EAAImD,MAAcnD,EAAImD,MAAOqI,GACtE,GAAIF,EAAYtL,EAAImH,OAAOyE,cAAeF,GAEtC,OAAO,EADPlG,EAAMgG,EAAaxL,EAAIyL,KAAOzL,EAAImH,OAASnH,EAAImH,OAChBxE,EAAU3C,EAAImD,OAGrD,MAAM,IAAIhH,MAAM,6CAEb,SAAS0P,GAASrG,EAAK4F,EAAOzI,EAAUmJ,EAASC,GACpD,IAEI,OADAA,EAASC,SAAWb,GAAM3F,EAAK4F,EAAOzI,IAC/B,EAEX,MAAO9G,GACH,OAAO,GAGR,SAASoQ,GAA6BC,EAAIC,GAC7C,OAAO3B,EAAYF,EAAYA,EAAY,EAAmB4B,GAAK,aAAiBC,GAAS,KAE1F,SAASC,GAA6BC,GACzC,OAAO,EAAiB9B,EAAeE,EAAY4B,EAAO,KAAQ,gB,6BC1H/D,SAASC,EAAW7Q,GACvB,OAAY,MAALA,GAA0B,iBAANA,GAAkB5E,OAAOiI,YAAYrD,EAE7D,SAAS8Q,EAAY9Q,GACxB,OAAOL,MAAMC,QAAQI,IAAM+Q,YAAYC,OAAOhR,GAWlD,SAASiR,EAAWjR,GAChB,MAAgC,mBAAlBA,EAAEoH,YAEb,SAAS8J,EAAalR,GACzB,OAAY,MAALA,GAAkC,mBAAdA,EAAEwF,QAE1B,SAAS2L,EAAgBnR,EAAG6H,GAC/B,OAAO5O,OAAOmY,eAAepR,GAAGqR,cAAgBpY,OAAOmY,eAAevJ,GAAGwJ,YAvB7E,8hCAyBO,MAAMC,EACT,YAAYC,GACR7U,KAAK6U,KAAOA,EAEhB,yDACI,OAAO7U,KAAK8G,QAEhB,+CACI,OAAO9G,KAAK8G,QAEhB,4CACI,MAAMgO,EAAM9U,KAAK6U,KAAKE,OAEtB,OADA/U,KAAK8G,QAAUgO,EAAIlW,OACXkW,EAAIE,KAEhB,yCACI,MAAM,IAAIhR,MAAM,gCAEpB,YAIG,SAASiR,EAAc5W,GAC1B,MAAkC,mBAApBA,EAAEuI,cACVvI,EAAEuI,gBACF,IAAIgO,EAAWvW,EAAEK,OAAOiI,aAE3B,SAASuO,EAAWC,GACvB,MAAO,CACH,CAACzW,OAAOiI,YAAc,OAAO3G,MAC7B,OACI,MAAMoV,EAAUD,EAAG,6CAEnB,MAAO,CAAEH,MAAOI,EAASxW,MADTwW,EAAUD,EAAG,qDAAkD1T,KA4CpF,MAAM4T,EACT,YAAYC,GACRtV,KAAKsV,QAAUA,EACftV,KAAKuV,gBAAiB,EAE1B,YAKI,OAJKvV,KAAKuV,iBACNvV,KAAKwV,aAAexV,KAAKsV,UACzBtV,KAAKuV,gBAAiB,GAEnBvV,KAAKwV,aAEhB,qBACI,OAAOxV,KAAKuV,gBAMb,SAASE,EAAarZ,EAAGE,GAC5B,IAAI+Q,EAAMjR,EAAE2O,SAAS,IACrB,KAAOsC,EAAI/Q,OAASA,GAChB+Q,EAAM,IAAMA,EAEhB,OAAOA,EAEJ,SAASqI,EAAyBtZ,EAAGuZ,EAAYC,GACpD,IAAIvI,EAAMjR,EAAE2O,SAAS,IACrB,KAAOsC,EAAI/Q,OAASqZ,GAChBtI,EAAM,IAAMA,EAEhB,KAAOA,EAAI/Q,OAASsZ,GAChBvI,GAAY,IAEhB,OAAOA,EAEJ,SAASwI,EAAWC,GACvB,MAAMC,EAAQD,EACd,MAA+B,iBAAjBC,EAAM/B,OACd+B,EAAM/B,OACS,IAAd8B,EAAKhD,KACF,GAAgC,IAA5BgD,EAAKE,oBAMhB,SAASC,EAAc7Z,EAAG4O,GAE7B,OADA5O,EAAIA,EAAI,GAAc,MAAT4O,GAA2B,KAAVA,EAAe,WAAa5O,EAAI,EAAIA,GACzD2O,SAASC,GAEf,MAAMkL,EACT,UAAU7X,GAIN,OAHK6X,EAAUC,MAAMC,IAAI/X,IACrB6X,EAAUC,MAAME,IAAIhY,IAAK6X,EAAUI,OAEhCJ,EAAUC,MAAM3X,IAAIH,IAK5B,SAASkY,EAAW7Y,GACvB,IAAItB,EAAI,EACJkK,EAAI,KACR,MAAMsB,EAAMlK,EAAEpB,OACd,KAAOF,EAAIwL,GACPtB,EAAS,GAAJA,EAAU5I,EAAE8Y,WAAWpa,KAEhC,OAAOkK,EAEJ,SAASmQ,EAAWnT,GACvB,OAAW,WAAJA,EAAiB,EAGrB,SAASoT,EAAiBC,GAC7B,OAAsB,IAAlBA,EAAOra,OACA,EAEJqa,EAAOxR,OAAO,CAACwF,EAAIiM,KACbjM,GAAM,GAAKA,EAAMiM,GAG3B,SAASC,EAAavT,GACzB,GAAS,MAALA,EACA,OAAO,EAEX,cAAeA,GACX,IAAK,UACD,OAAOA,EAAI,EAAI,EACnB,IAAK,SACD,OAAOmT,EAAWnT,GACtB,IAAK,SACD,OAAOiT,EAAWjT,GACtB,QACI,OAAOmT,EAAWP,EAAUY,GAAGxT,KAyBpC,SAASyT,EAAezT,GAC3B,GAAS,MAALA,EACA,OAAO,EAEX,cAAeA,GACX,IAAK,UACD,OAAOA,EAAI,EAAI,EACnB,IAAK,SACD,OAAOmT,EAAWnT,GACtB,IAAK,SACD,OAAOiT,EAAWjT,GACtB,QACI,GAAIiR,EAAWjR,GACX,OAAOA,EAAEoH,cAER,GAAI0J,EAAY9Q,GACjB,OAxBT,SAAmBA,GACtB,MAAMsE,EAAMtE,EAAEhH,OACRqa,EAAS,IAAI1T,MAAM2E,GACzB,IAAK,IAAIxL,EAAI,EAAGA,EAAIwL,EAAKxL,IACrBua,EAAOva,GAAK2a,EAAezT,EAAElH,IAEjC,OAAOsa,EAAiBC,GAkBLK,CAAU1T,GAEhB,GAAIA,aAAa2T,KAClB,OA9BT,SAAkB3T,GACrB,OAAOA,EAAE4T,UA6BUC,CAAS7T,GAEf,GAAI/G,OAAOmY,eAAepR,GAAGqR,cAAgBpY,OAAQ,CAGtD,OAAOma,EADQna,OAAOyI,OAAO1B,GAAGvC,IAAK0D,GAAMsS,EAAetS,KAK1D,OAAOgS,EAAWP,EAAUY,GAAGxT,KAWxC,SAAS8T,EAAS9T,GACrB,OAAY,MAALA,EAAY,EAAIiR,EAAWjR,GAAKA,EAAEoH,cAAgB+L,EAAWP,EAAUY,GAAGxT,IAE9E,SAAS+T,EAAgB/T,EAAG6H,EAAGmM,GAClC,GAAS,MAALhU,EACA,OAAY,MAAL6H,EAEX,GAAS,MAALA,EACA,OAAO,EAEX,GAAI7H,EAAEhH,SAAW6O,EAAE7O,OACf,OAAO,EAEX,IAAK,IAAIF,EAAI,EAAGA,EAAIkH,EAAEhH,OAAQF,IAC1B,IAAKkb,EAAGhU,EAAElH,GAAI+O,EAAE/O,IACZ,OAAO,EAGf,OAAO,EAEJ,SAASmb,EAAYjU,EAAG6H,GAC3B,OAAOkM,EAAgB/T,EAAG6H,EAAGxK,GAiB1B,SAASA,EAAO2C,EAAG6H,GACtB,OAAI7H,IAAM6H,IAGI,MAAL7H,EACO,MAAL6H,EAEG,MAALA,IAGa,iBAAN7H,IAtSpB,SAAqBA,GACjB,MAA2B,mBAAbA,EAAEsH,OAwSP4M,CAAYlU,GACVA,EAAEsH,OAAOO,GAEXiJ,EAAY9Q,GACV8Q,EAAYjJ,IAAMoM,EAAYjU,EAAG6H,GAEnC7H,aAAa2T,KACV9L,aAAa8L,MAAgC,IAAvBQ,EAAanU,EAAG6H,GAGvC5O,OAAOmY,eAAepR,GAAGqR,cAAgBpY,QAtCxD,SAAsB+G,EAAG6H,GACrB,MAAMuM,EAAQnb,OAAOob,KAAKrU,GACpBsU,EAAQrb,OAAOob,KAAKxM,GAC1B,GAAIuM,EAAMpb,SAAWsb,EAAMtb,OACvB,OAAO,EAEXob,EAAMG,OACND,EAAMC,OACN,IAAK,IAAIzb,EAAI,EAAGA,EAAIsb,EAAMpb,OAAQF,IAC9B,GAAIsb,EAAMtb,KAAOwb,EAAMxb,KAAOuE,EAAO2C,EAAEoU,EAAMtb,IAAK+O,EAAEyM,EAAMxb,KACtD,OAAO,EAGf,OAAO,EAyBuD0b,CAAaxU,EAAG6H,MAG3E,SAASsM,EAAanU,EAAG6H,GAC5B,IAAI4M,EACAC,EAUJ,MARI,WAAY1U,GAAK,WAAY6H,GAC7B4M,EAAQzU,EAAE4T,UACVc,EAAQ7M,EAAE+L,YAGVa,EAAQzU,EAAE4T,UAAYrB,EAAWvS,GACjC0U,EAAQ7M,EAAE+L,UAAYrB,EAAW1K,IAE9B4M,IAAUC,EAAQ,EAAKD,EAAQC,GAAS,EAAI,EAEhD,SAASC,EAAkB3U,EAAG6H,GACjC,OAAO7H,IAAM6H,EAAI,EAAK7H,EAAI6H,GAAK,EAAI,EAoBhC,SAAS+M,EAAc5U,EAAG6H,GAC7B,OAnBG,SAA2B7H,EAAG6H,EAAGgN,GACpC,GAAS,MAAL7U,EACA,OAAY,MAAL6H,EAAY,EAAI,EAE3B,GAAS,MAALA,EACA,OAAQ,EAEZ,GAAI7H,EAAEhH,SAAW6O,EAAE7O,OACf,OAAOgH,EAAEhH,OAAS6O,EAAE7O,QAAU,EAAI,EAEtC,IAAK,IAAIF,EAAI,EAAGkB,EAAI,EAAGlB,EAAIkH,EAAEhH,OAAQF,IAEjC,GADAkB,EAAI6a,EAAK7U,EAAElH,GAAI+O,EAAE/O,IACP,IAANkB,EACA,OAAOA,EAGf,OAAO,EAGA8a,CAAkB9U,EAAG6H,EAAGL,GAwB5B,SAASA,EAAQxH,EAAG6H,GACvB,OAAI7H,IAAM6H,EACC,EAEG,MAAL7H,EACO,MAAL6H,EAAY,GAAK,EAEd,MAALA,EACE,EAEW,iBAAN7H,EACLA,EAAI6H,GAAK,EAAI,EAhY5B,SAAsB7H,GAClB,MAA8B,mBAAhBA,EAAEuH,UAiYPwN,CAAa/U,GACXA,EAAEuH,UAAUM,GAEdiJ,EAAY9Q,GACV8Q,EAAYjJ,GAAK+M,EAAc5U,EAAG6H,IAAM,EAE1C7H,aAAa2T,KACX9L,aAAa8L,KAAOQ,EAAanU,EAAG6H,IAAM,EAG1C5O,OAAOmY,eAAepR,GAAGqR,cAAgBpY,OA7CxD,SAAwB+G,EAAG6H,GACvB,MAAMuM,EAAQnb,OAAOob,KAAKrU,GACpBsU,EAAQrb,OAAOob,KAAKxM,GAC1B,GAAIuM,EAAMpb,SAAWsb,EAAMtb,OACvB,OAAOob,EAAMpb,OAASsb,EAAMtb,QAAU,EAAI,EAE9Cob,EAAMG,OACND,EAAMC,OACN,IAAK,IAAIzb,EAAI,EAAGkB,EAAI,EAAGlB,EAAIsb,EAAMpb,OAAQF,IAAK,CAC1C,MAAM8C,EAAMwY,EAAMtb,GAClB,GAAI8C,IAAQ0Y,EAAMxb,GACd,OAAO8C,EAAM0Y,EAAMxb,IAAM,EAAI,EAI7B,GADAkB,EAAIwN,EAAQxH,EAAEpE,GAAMiM,EAAEjM,IACZ,IAAN5B,EACA,OAAOA,EAInB,OAAO,EAyBsDgb,CAAehV,EAAG6H,IAAM,EAGlF,SAASwC,EAAI4K,EAAUjV,EAAG6H,GAC7B,OAAOoN,EAASjV,EAAG6H,GAAK,EAAI7H,EAAI6H,EAE7B,SAAS8F,EAAIsH,EAAUjV,EAAG6H,GAC7B,OAAOoN,EAASjV,EAAG6H,GAAK,EAAI7H,EAAI6H,EAiB7B,SAASqN,EAAUzY,GACtB,MAAMqF,EAAM,GACZ,IAAK,MAAMqT,KAAM1Y,EACbqF,EAAIqT,EAAG,IAAMA,EAAG,GAEpB,OAAOrT,EAmEJ,SAASsT,EAAMC,GACdvE,EAAYuE,GACZA,EAAInb,OAAO,GAGXmb,EAAID,QA3VZxC,EAAUC,MAAQ,IAAIyC,QACtB1C,EAAUI,MAAQ,EA8VX,SAASuC,EAAQC,EAAOvP,GAE3B,GAAS,MAALA,GAAaA,EAAEjN,OAAS,EACxB,OAAOiN,EAEX,IAAIwP,EACJ,OAAQD,GACJ,KAAK,EACDC,EAAc,CAACC,EAAIC,IAAO1P,EAAEyP,EAAFzP,CAAM0P,GAChC,MACJ,KAAK,EACDF,EAAc,CAACC,EAAIC,EAAIC,IAAO3P,EAAEyP,EAAFzP,CAAM0P,EAAN1P,CAAU2P,GACxC,MACJ,KAAK,EACDH,EAAc,CAACC,EAAIC,EAAIC,EAAIC,IAAO5P,EAAEyP,EAAFzP,CAAM0P,EAAN1P,CAAU2P,EAAV3P,CAAc4P,GAChD,MACJ,KAAK,EACDJ,EAAc,CAACC,EAAIC,EAAIC,EAAIC,EAAIC,IAAO7P,EAAEyP,EAAFzP,CAAM0P,EAAN1P,CAAU2P,EAAV3P,CAAc4P,EAAd5P,CAAkB6P,GACxD,MACJ,KAAK,EACDL,EAAc,CAACC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,IAAO9P,EAAEyP,EAAFzP,CAAM0P,EAAN1P,CAAU2P,EAAV3P,CAAc4P,EAAd5P,CAAkB6P,EAAlB7P,CAAsB8P,GAChE,MACJ,KAAK,EACDN,EAAc,CAACC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,IAAO/P,EAAEyP,EAAFzP,CAAM0P,EAAN1P,CAAU2P,EAAV3P,CAAc4P,EAAd5P,CAAkB6P,EAAlB7P,CAAsB8P,EAAtB9P,CAA0B+P,GACxE,MACJ,KAAK,EACDP,EAAc,CAACC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,IAAOhQ,EAAEyP,EAAFzP,CAAM0P,EAAN1P,CAAU2P,EAAV3P,CAAc4P,EAAd5P,CAAkB6P,EAAlB7P,CAAsB8P,EAAtB9P,CAA0B+P,EAA1B/P,CAA8BgQ,GAChF,MACJ,QACI,MAAM,IAAIvV,MAAM,qDAAuD8U,GAG/E,OADAC,EAAuB,YAAIxP,EACpBwP,EAEJ,SAASS,EAAMV,EAAOvP,GACzB,GAAS,MAALA,GAA0B,IAAbA,EAAEjN,OACf,OAAOiN,EAEX,GAvCgB,gBAuCGA,EACf,OAAOA,EAAa,YAExB,OAAQuP,GACJ,KAAK,EACD,OAAQE,GAAQC,GAAO1P,EAAEyP,EAAIC,GACjC,KAAK,EACD,OAAQD,GAAQC,GAAQC,GAAO3P,EAAEyP,EAAIC,EAAIC,GAC7C,KAAK,EACD,OAAQF,GAAQC,GAAQC,GAAQC,GAAO5P,EAAEyP,EAAIC,EAAIC,EAAIC,GACzD,KAAK,EACD,OAAQH,GAAQC,GAAQC,GAAQC,GAAQC,GAAO7P,EAAEyP,EAAIC,EAAIC,EAAIC,EAAIC,GACrE,KAAK,EACD,OAAQJ,GAAQC,GAAQC,GAAQC,GAAQC,GAAQC,GAAO9P,EAAEyP,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GACjF,KAAK,EACD,OAAQL,GAAQC,GAAQC,GAAQC,GAAQC,GAAQC,GAAQC,GAAO/P,EAAEyP,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GAC7F,KAAK,EACD,OAAQN,GAAQC,GAAQC,GAAQC,GAAQC,GAAQC,GAAQC,GAAQC,GAAOhQ,EAAEyP,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GACzG,QACI,MAAM,IAAIvV,MAAM,mDAAqD8U,IAQ1E,SAASW,EAAaX,EAAOvP,EAAGmQ,GACnC,GAAS,MAALnQ,EAAJ,CAGK,GAtEW,gBAsEQA,EAAG,CACvBA,EAAIA,EAAa,YACjB,IAAK,IAAInN,EAAI,EAAGA,EAAIsd,EAAKpd,OAAQF,IAC7BmN,EAAIA,EAAEmQ,EAAKtd,IAEf,OAAOmN,EAGP,OAAQuP,GACJ,KAAK,EAID,OAAQE,GAAOzP,EAAEtM,WAAMwE,EAAWiY,EAAKzQ,OAAO,CAAC+P,KACnD,KAAK,EACD,OAAQA,GAAQC,GAAO1P,EAAEtM,WAAMwE,EAAWiY,EAAKzQ,OAAO,CAAC+P,EAAIC,KAC/D,KAAK,EACD,OAAQD,GAAQC,GAAQC,GAAO3P,EAAEtM,WAAMwE,EAAWiY,EAAKzQ,OAAO,CAAC+P,EAAIC,EAAIC,KAC3E,KAAK,EACD,OAAQF,GAAQC,GAAQC,GAAQC,GAAO5P,EAAEtM,WAAMwE,EAAWiY,EAAKzQ,OAAO,CAAC+P,EAAIC,EAAIC,EAAIC,KACvF,KAAK,EACD,OAAQH,GAAQC,GAAQC,GAAQC,GAAQC,GAAO7P,EAAEtM,WAAMwE,EAAWiY,EAAKzQ,OAAO,CAAC+P,EAAIC,EAAIC,EAAIC,EAAIC,KACnG,KAAK,EACD,OAAQJ,GAAQC,GAAQC,GAAQC,GAAQC,GAAQC,GAAO9P,EAAEtM,WAAMwE,EAAWiY,EAAKzQ,OAAO,CAAC+P,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,KAC/G,KAAK,EACD,OAAQL,GAAQC,GAAQC,GAAQC,GAAQC,GAAQC,GAAQC,GAAO/P,EAAEtM,WAAMwE,EAAWiY,EAAKzQ,OAAO,CAAC+P,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,KAC3H,KAAK,EACD,OAAQN,GAAQC,GAAQC,GAAQC,GAAQC,GAAQC,GAAQC,GAAQC,GAAOhQ,EAAEtM,WAAMwE,EAAWiY,EAAKzQ,OAAO,CAAC+P,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,KACvI,QACI,MAAM,IAAIvV,MAAM,6DAA+D8U,O,6gBCjlBxF,SAAS,EAAOzL,GACnB,OAAOA,EAAIsM,QAAQ,sCAAuC,Q,WCb9D,MAAMC,EAAiB,gDACjBC,EAAoB,wDACpBC,EAAe,wDACrB,SAASC,EAAWzW,EAAG6H,GACnB,OAAO,YAAe7H,EAAG6H,GAAK,EAiF3B,SAAS6O,EAAOC,GACnB,MAAO,CACHA,QACAC,MAiJiB7M,EAjJF4M,EAkJXC,IACJN,EAAeO,UAAY,EAC3B,MAAMC,EAAW,GACXC,EAAU,GAChB,IAAIC,EAAS,EACTC,EAAQX,EAAeY,KAAKnN,GAChC,KAAOkN,GAAO,CAGV,MAAME,EAAaF,EAAMG,OAASH,EAAM,IAAM,IAAIje,OAClD8d,EAASxd,KAAKyQ,EAAIG,UAAU8M,EAAQG,GAAYd,QAAQ,MAAO,MAC/DU,EAAQzd,KAAK2d,GACbD,EAASV,EAAeO,UAExBP,EAAeO,WAAa,EAC5BI,EAAQX,EAAeY,KAAKnN,GAEhC,OAAwB,IAApB+M,EAAS9d,OACF4d,EAAK7M,EAAIsM,QAAQ,MAAO,OAG/BS,EAASxd,KAAKyQ,EAAIG,UAAU8M,GAAQX,QAAQ,MAAO,MAxD/D,SAASgB,EAAcT,EAAMU,EAAWC,EAAUC,EAAU,GAAIC,GAAS,GACrE,MAAO,IAAIrB,KAEP,IAAIvc,EAAS2d,EACb,MAAMV,EAAWQ,EAAUjb,QACrB0a,EAAUQ,EAASlb,QACzB,IAAK,MAAMqb,KAAOtB,EAAM,CACpB,MAAO,CAAE,CAAEuB,EAAOC,EAAYC,EAAWC,GAAUf,EAAQ,GAC3D,IAAIgB,EAAYH,EAChB,GAAIH,GAAU,EACVM,EAAYN,EACZA,GAAU,OAET,GAAkB,MAAdM,EAAmB,CACxB,GAAIL,EAAM,EACN,MAAM,IAAIhX,MAAM,gCAEpB+W,EAASC,EACT,SAEJ7d,GAAUid,EAAS,GACnBjd,GAAUme,EAAkBN,EAAKC,EAAOI,EAAWF,EAAWC,GAC9DhB,EAAS5c,OAAO,EAAG,GACnB6c,EAAQ7c,OAAO,EAAG,GAEtB,OAAuB,IAAnB6c,EAAQ/d,QACRa,GAAUid,EAAS,GACZF,EAAK/c,IAGLwd,EAAcT,EAAME,EAAUC,EAASld,EAAQ4d,IA2B/CJ,CAAcT,EAAME,EAAUC,OAvB1C,IAAkBhN,EA9IlB,SAASkO,EAAYlO,EAAKrI,GAC7B,IAAIwW,EAAS,EACTlB,EAAS,EACTnd,EAAS,GACb0c,EAAkBM,UAAY,EAC9B,IAAII,EAAQV,EAAkBW,KAAKnN,GACnC,KAAOkN,GAAO,CAGV,MAAME,EAAaF,EAAMG,OAASH,EAAM,IAAM,IAAIje,OAClDa,GAAUkQ,EAAIG,UAAU8M,EAAQG,GAAYd,QAAQ,MAAO,KAC3D,MAAO,CAAE,CAAEsB,EAAOI,EAAWF,EAAWC,GAAUb,EAClDpd,GAAUme,EAAkBtW,EAAOwW,KAAWP,EAAOI,EAAWF,EAAWC,GAC3Ed,EAAST,EAAkBM,UAE3BN,EAAkBM,WAAa,EAC/BI,EAAQV,EAAkBW,KAAKnN,GAGnC,OADAlQ,GAAUkQ,EAAIG,UAAU8M,GAAQX,QAAQ,MAAO,KACxCxc,EAEX,SAASse,EAAcvB,EAAMc,GACzB,MAAsB,iBAARA,EAAmBd,EAAKc,GAAOA,EAAId,KAAKA,GASnD,SAASwB,EAAOV,GACnB,OAAOS,EAAenY,GAAMA,EAAG0X,GAE5B,SAASW,EAAOX,GACnB,OAAOS,EAAenY,IAClB,MAAM,IAAIU,MAAMV,IACjB0X,GAEP,SAASM,EAAkBM,EAAKX,EAAOI,EAAWF,EAAWC,GACzD,IAAI9H,EAAO,GAGX,GAFA2H,EAAQA,GAAS,GACjBG,EAASA,GAAU,GACf,YAAUQ,GAgBV,OAf6B,MAAzBR,EAAOS,gBACH9B,EAAW6B,EAAK,IAChBA,EAAM,YAASA,GAAM,GACrBtI,EAAO,KAGH2H,EAAM1N,QAAQ,MAAQ,EACtB+F,EAAO,IAEF2H,EAAM1N,QAAQ,MAAQ,IAC3B+F,EAAO,MAInB6H,EAAyB,MAAbA,EAAoB,KAAOvN,SAASuN,EAAW,IACnDC,GACJ,IAAK,IACL,IAAK,IACDD,EAAyB,MAAbA,EAAoBA,EAAY,EAC5CS,EAAM,YAAQA,EAAKT,GACnB,MACJ,IAAK,IACL,IAAK,IACDS,EAAmB,MAAbT,EAAoB,YAAYS,EAAKT,GAAa,YAAYS,GACpE,MACJ,IAAK,IACL,IAAK,IACDA,EAAmB,MAAbT,EAAoB,YAAcS,EAAKT,GAAa,YAAcS,GACxE,MACJ,IAAK,IACDA,EAAM,YAAMA,GACZ,MACJ,IAAK,IACDA,EAAM,YAAMA,GAAKnI,cACjB,MACJ,QACImI,EAAMtQ,OAAOsQ,QAKrBA,EADKA,aAAe3E,KACd,YAAa2E,GAGb,YAASA,GAGnB,GADAP,EAAiC,iBAAdA,EAAyBA,EAAYzN,SAASyN,EAAW,IACvEhP,MAAMgP,GAaPO,EAAMtI,EAAOsI,MAbM,CACnB,MAAME,EAAWb,EAAM1N,QAAQ,MAAQ,EACjCwO,EAAYd,EAAM1N,QAAQ,MAAQ,EAClCyO,EAAKD,IAAcD,EAAW,IAAM,IAGtCF,EAFO,MAAPI,EAEM1I,GADNsI,EAAMK,EAAQL,EAAKP,EAAY/H,EAAKhX,OAAQ0f,EAAID,IAI1CE,EAAQ3I,EAAOsI,EAAKP,EAAWW,EAAID,GAMjD,OAAOH,EA+DJ,SAAS,EAAOvO,KAAQqM,GAM3B,MALmB,iBAARrM,GAAoBqM,EAAKpd,OAAS,IAEzC+Q,EAAMqM,EAAK,GACXA,EAAK3c,SAEFsQ,EAAIsM,QAAQG,EAAc,CAACoC,EAAGC,EAAKd,EAAWD,EAAQD,EAAWiB,KACpE,IAAIR,EAAMlC,EAAKyC,GACf,GAAI,YAAUP,GAEV,OADAT,EAAyB,MAAbA,EAAoB,KAAOvN,SAASuN,EAAW,IACnDC,GACJ,IAAK,IACL,IAAK,IACDD,EAAyB,MAAbA,EAAoBA,EAAY,EAC5CS,EAAM,YAAQA,EAAKT,GACnB,MACJ,IAAK,IACL,IAAK,IACDS,EAAmB,MAAbT,EAAoB,YAAYS,EAAKT,GAAa,YAAYS,GACpE,MACJ,IAAK,IACL,IAAK,IACDA,EAAmB,MAAbT,EAAoB,YAAcS,EAAKT,GAAa,YAAcS,GACxE,MACJ,IAAK,IACL,IAAK,IACDT,EAAyB,MAAbA,EAAoBA,EAAY,EAC5CS,EAAM,YAAQ,YAASA,EAAK,KAAMT,GAAa,KAC/C,MACJ,IAAK,IACL,IAAK,IACDS,EAAmB,MAAbT,EAAoBc,EAAQ3Q,OAAOsQ,GAAMT,EAAW,KAAO7P,OAAOsQ,GACxE,MACJ,IAAK,IACL,IAAK,IACDA,EAAmB,MAAbT,EAAoBc,EAAQ,YAAML,GAAMT,EAAW,KAAO,YAAMS,GACvD,MAAXR,IACAQ,EAAMA,EAAInI,eAEd,MACJ,QACI,GAAI2I,EAAS,CACT,IAAI9I,EAAO,GACXsI,EAAMQ,EAAQzC,QAAQ,cAAe,CAACuC,EAAGG,EAASC,KAC1CvC,EAAW6B,EAAK,KAChBA,EAAM,YAASA,GAAM,GACrBtI,EAAO,KAEXsI,EAAM,YAAQA,EAAoB,MAAfU,EAAsBA,EAAYhgB,OAAS,EAAI,GAC3D2f,EAAQL,GAAMS,GAAW,IAAI/f,OAASgX,EAAKhX,QAAyB,MAAfggB,EAAsBA,EAAYhgB,OAAS,GAAI,OAE/Gsf,EAAMtI,EAAOsI,QAKzBA,EADKA,aAAe3E,KACd,YAAa2E,EAAKQ,GAAWhB,GAG7B,YAASQ,GAMnB,OAJAP,EAAYzN,UAAUyN,GAAa,KAAK7N,UAAU,GAAI,IACjDnB,MAAMgP,KACPO,EAAMK,EAAQ3Q,OAAOsQ,GAAM1O,KAAKqP,IAAIlB,GAAY,IAAKA,EAAY,IAE9DO,IAGR,SAASpY,EAAS6J,EAAKmP,GAC1B,MAAML,EAAM9O,EAAIlK,YAAYqZ,GAC5B,OAAOL,GAAO,GAAKA,IAAQ9O,EAAI/Q,OAASkgB,EAAOlgB,OAkB5C,SAASmgB,EAAcpP,GAC1B,MAAsB,iBAARA,GAAmC,IAAfA,EAAI/Q,OAEnC,SAASogB,EAAmBrP,GAC/B,MAAsB,iBAARA,GAAoB,QAAQsP,KAAKtP,GAK5C,SAAS9J,EAAKqZ,EAAWjX,GAC5B,OAAI1C,MAAMC,QAAQyC,GACPA,EAAGpC,KAAKqZ,GAGR3Z,MAAMuD,KAAKb,GAAIpC,KAAKqZ,GAUnC,SAASC,EAAa1e,GAClB,MAAM,IAAI6F,MAAM,oCAAsC7F,EAAO,6BAS1D,SAAS2e,EAAiBC,GAC7B,MAAMC,EAAyB,mBAATC,KAAsBA,KAAKF,GAAcF,EAAa,QACtE7K,EAAQ,IAAI7H,WAAW6S,EAAO1gB,QACpC,IAAK,IAAIF,EAAI,EAAGA,EAAI4gB,EAAO1gB,OAAQF,IAC/B4V,EAAM5V,GAAK4gB,EAAOxG,WAAWpa,GAEjC,OAAO4V,EAEJ,SAASiK,EAAQ5O,EAAKzF,EAAKoU,EAAIkB,GAClClB,EAAKA,GAAM,IACXpU,GAAYyF,EAAI/Q,OAChB,IAAK,IAAIF,EAAI,EAAGA,EAAIwL,EAAKxL,IACrBiR,EAAM6P,EAAU7P,EAAM2O,EAAKA,EAAK3O,EAEpC,OAAOA,EA0BJ,SAAS,EAAMA,EAAK8P,EAAW7G,EAAO8G,GAGzC,GADAA,EAAqC,iBAAhBA,EAA2BA,OAAc3b,GAD9D6U,EAAyB,iBAAVA,EAAqBA,OAAQ7U,IAE/B6U,EAAQ,EACjB,MAAM,IAAItS,MAAM,kCAEpB,GAAc,IAAVsS,EACA,MAAO,GAEX,IAAKrT,MAAMC,QAAQia,GAAY,CAC3B,GAAoB,IAAhBC,EACA,OAAO/P,EAAIgQ,MAAMF,EAAW7G,GAEhC,MAAM1O,EAAM0V,UAAUhhB,OACtB6gB,EAAYla,MAAM2E,EAAM,GACxB,IAAK,IAAI1I,EAAM,EAAGA,EAAM0I,EAAK1I,IACzBie,EAAUje,EAAM,GAAKoe,UAAUpe,GAIvCie,GADAA,EAAYA,EAAUpc,IAAKuC,GAAM,EAAOA,KAClBhH,OAAS,EAAI6gB,EAAY,CAAC,KAChD,IAAI/gB,EAAI,EACR,MAAMmhB,EAAS,GACTC,EAAM,IAAIC,OAAON,EAAU5Z,KAAK,KAAM,KAC5C,KAAgB,MAAT+S,GAAiBA,EAAQ,GAAG,CAC/B,MAAMtY,EAAIwf,EAAIhD,KAAKnN,GACnB,GAAU,OAANrP,EACA,QAECof,GAAgBpf,EAAE0c,MAAQte,EAAK,KAChCka,EAAiB,MAATA,EAAgBA,EAAQ,EAAIA,EACpCiH,EAAO3gB,KAAKyQ,EAAIG,UAAUpR,EAAG4B,EAAE0c,SAEnCte,EAAIohB,EAAIrD,UAKZ,QAHKiD,GAAgB/P,EAAI/Q,OAASF,EAAK,IACnCmhB,EAAO3gB,KAAKyQ,EAAIG,UAAUpR,IAEvBmhB,EAEJ,SAASG,EAAKrQ,KAAQsQ,GACzB,GAAqB,IAAjBA,EAAMrhB,OACN,OAAO+Q,EAAIqQ,OAEf,MAAMtB,EAAU,IAAM,EAAOuB,EAAMpa,KAAK,KAAO,KAC/C,OAAO8J,EAAIsM,QAAQ,IAAI8D,OAAO,IAAMrB,GAAU,IAAIzC,QAAQ,IAAI8D,OAAOrB,EAAU,KAAM,IAOlF,SAASwB,EAAQvQ,KAAQsQ,GAC5B,OAAwB,IAAjBA,EAAMrhB,OACP+Q,EAAIuQ,UACJvQ,EAAIsM,QAAQ,IAAI8D,OAAO,IAAM,EAAOE,EAAMpa,KAAK,KAAO,OAAQ,IAKjE,SAASiK,EAAUH,EAAKwQ,EAAYvhB,GACvC,GAAKuhB,GAAcvhB,GAAU,GAAK+Q,EAAI/Q,OAClC,MAAM,IAAI0H,MAAM,oCAEpB,OAAiB,MAAV1H,EAAiB+Q,EAAIjK,OAAOya,EAAYvhB,GAAU+Q,EAAIjK,OAAOya,K,6BC1exE,gwBAQO,MAUMC,EAAuB,6DAQ7B,SAASC,IACZ,MAAM,IAAK/Z,MAjByB,+CAoBjC,SAASga,IACZ,MAAM,IAAKha,MAvB8B,iCA0BtC,MAAMia,EACT,YAAY1U,GACRvJ,KAAKuJ,EAAIA,EAEb,WAGI,IAAInN,EAAI,EACJiR,EAAM,QACV,MAAMjD,EAAI,YAJCpK,MAKX,IACI,KAAQ5D,EALK,GAKWgO,EAAE,8CAClBhO,EAAI,IACJiR,GAAa,MAEjBA,GAAa,YAASjD,EAAE,2DACxBhO,EAAMA,EAAI,EAAK,EAKnB,OAfa,IAYTA,IACAiR,GAAa,SAEVA,EAAM,IAEjB,QACIjD,EAAEtB,WAGV,gBAEI,OADU9I,KACDuJ,IAEb,CAAC7K,OAAOiI,YACJ,OAAO,YAAW3G,KAAK4G,iBAE3B,iDAEI,OADU5G,KACDuJ,KAYV,MAAM2U,EACT,YAAYpX,EAASiO,EAAMoJ,GACvBne,KAAK8G,QAAUA,EACf9G,KAAK+U,KAAOA,EACZ/U,KAAKme,QAAUA,EAEnB,yDAEI,OADWne,KACD8G,UAEd,+CAEI,OADW9G,KACD8G,UAEd,4CAEI,OADW9G,KACD+U,OAEd,0CA9EG,WACH,MAAM,IAAK/Q,MAHqB,8CAiF5Boa,GAEJ,UACepe,KACRme,WAQJ,SAASE,EAA0CvX,EAASiO,EAAMoJ,GACrE,OAAO,IAAID,EAA2BpX,EAASiO,EAAMoJ,GAwGlD,SAASG,EAAgC/U,EAAGa,GAC/C,OAAOiU,EAA0C,IAAMjU,EAAE,0DAA2D,IAAMA,EAAE,6CAA8C,KACtK,IACIA,EAAEtB,UAEN,QACIS,OAKL,SAASgV,EAA6BC,EAAOC,EAASC,GACzD,IAAIC,GAAU,EACVC,OAAO,EACP5W,EAAQ,YAAKwW,KACjB,MAAML,EAAU,KACZ,GAAa,MAATnW,EAAe,CACf,MAAM6W,EAAM,YAAQ7W,GACpB,IACI0W,EAAOG,GAEX,QACI7W,OAAQ,KAId8W,EAAS,KACX,IACIX,IAEJ,QACIS,OAAO,IAGf,OAAOP,EAA0C,KACxCM,GACDZ,IAEQ,MAARa,EACO,YAAQA,GAGRZ,KAEZ,KAIC,GAHKW,IACDA,GAAU,GAED,MAAT3W,EAAe,CACf,MAAMtK,EAAI,YAAQsK,GAClB,IAAI+W,EACJ,IACIA,EAAeN,EAAQ/gB,GAE3B,MAAOuI,GAEH,MADA6Y,IACM7Y,EAEV,OAAoB,MAAhB8Y,GACAH,EAAOG,GACA,IAGPD,KACO,GAIX,OAAO,GAEZX,GA8BA,SAASa,IACZ,MAAM,IAAKhb,MA/SkB,sEAkT1B,SAASib,EAAaC,EAASlE,GACvB,MAAPA,GACA,YAAkBkE,GAInB,SAASC,EAAM5V,GAClB,OA3PG,SAAuCA,GAC1C,OAAO,IAAI0U,EAAe1U,GA0PnB6V,CAA8B7V,GAGlC,SAASd,EAAM9C,GAElB,OADAsZ,EAAa,SAAUtZ,GAChB,YAAcA,GAGlB,SAAS0Z,EAAMC,GAClB,OAAOH,EAAM,IAAM,YAAcG,MAG9B,SAASrW,EAAOsW,GACnB,OAAOJ,EAAM,IAzNV,SAA2BI,GAC9B,IAAIC,OAAW,EACXC,OAAW,EACXd,GAAU,EACVe,GAAW,EACXd,OAAO,EACX,MAAME,EAAS,KAEX,GADAY,GAAW,EACK,MAAZD,EAAkB,CAClB,MAAME,EAAQF,EACd,IACIE,EAAM7W,UAEV,QACI2W,OAAW,GAGnB,GAAgB,MAAZD,EAAkB,CAClB,MAAMI,EAAQJ,EACd,IACII,EAAM9W,UAEV,QACI0W,OAAW,KAIvB,OAAOnB,EAA0C,KACxCM,EAGIe,GACL1B,IAHAD,IAKQ,MAARa,EACO,YAAQA,GAGRZ,KAEZ,KACC,IAAI6B,EAIJ,GAHKlB,IACDA,GAAU,GAEVe,EACA,OAAO,EAEN,CACD,IAAI7X,OAAM,EACV,KAAc,MAAPA,GAAa,CAChB,MAAM5B,EAAa,CAACuZ,EAAUC,GAC9B,GAAqB,MAAjBxZ,EAAW,GACX,GAAqB,MAAjBA,EAAW,GAAY,CACvB,MAAM6Z,EAAU7Z,EAAW,GAC3B,GAAI6Z,EAAQ,6CACRlB,EAAO,YAAKkB,EAAQ,2DACpBjY,GAAM,OAGN,IACIiY,EAAQhX,UAEZ,QACI2W,OAAW,OAIlB,CACD,MAAMM,EAAU9Z,EAAW,GAC3B,GAAI8Z,EAAQ,6CAA8C,CAEzCF,EADFE,EAAQ,0DACnBN,EAAgC,YAAcI,QAG9Cf,IACAjX,GAAM,OAKd2X,EAAW,YAAcD,GAGjC,OAAO,YAAQ1X,KAEpB,KACM6X,GACDZ,MAiIWkB,CAAkBT,IAGlC,SAASU,EAAOX,EAAWtX,GAC9B,OAAOmX,EAAM,IAvDV,SAA2B5V,EAAGvB,GACjC,IAAI4W,OAAO,EACP3W,EAAMD,EACV,OAAOqW,EAA0C,KAC7C,GAAY,MAARO,EAAc,CACd,MAAMtb,EAAIsb,EAAK,GACJA,EAAK,GAChB,OAAOtb,EAGP,OAAOya,KAEZ,KAEC,GADAa,EAAOrV,EAAEtB,GACG,MAAR2W,EAAc,CACFA,EAAK,GAAjB,MACMsB,EAAOtB,EAAK,GAElB,OADA3W,EAAMiY,GACC,EAGP,OAAO,GAEZ,QAgCgBC,CAAkBb,EAAWtX,IAG7C,SAASV,IACZ,OAAO+X,EAAM,IAAM,IAAKpc,MAAM,IAG3B,SAASuE,EAAUlE,GACtB,OAAO+b,EAAM,IAAM,YAAY/b,IAO5B,SAASqE,EAAQhC,GACpB,OAAI,YAAYA,GACLA,EAEFA,aAAc,IACZ,YAAUA,GAGV1C,MAAMuD,KAAKb,GAQnB,SAASya,EAAOza,GACnB,OAAI,YAAYA,GACL,YAAUA,GAEZA,aAAc,IACZA,EAGA,YAAQA,GAIhB,SAAS0a,EAASphB,EAAQwf,EAASN,GACtC,OAAOgB,EAAM,IAAMZ,EAA6Btf,EAAQwf,EAASN,IAG9D,SAASmC,EAAgBrhB,EAAQwf,EAASN,GAC7C,OAAOgB,EAAM,KACT,IAAI/iB,GAAK,EACT,OAAOmiB,EAA6Btf,EAASqE,IACzClH,EAAMA,EAAI,EAAK,EACRqiB,EAAQriB,EAAGkH,IACnB6a,KAIJ,SAASoC,EAAO5a,EAAI6a,GACvB,OAAOvX,EAAO,CAACtD,EAAI6a,IAsBhB,SAASC,EAAYlI,EAAU5S,EAAI6a,GACtC,MAAME,EAAKjY,EAAM9C,GACjB,IACI,MAAMgb,EAAKlY,EAAM+X,GACjB,IACI,IAAIviB,EAAI,EACJ2iB,EAAKF,EAAG,6CACRG,EAAKF,EAAG,6CACZ,KAAe,IAAN1iB,GAAW2iB,GAAcC,GAC9B5iB,EAA4I,EAAvIsa,EAASmI,EAAG,0DAA2DC,EAAG,2DACrE,IAAN1iB,IACA2iB,EAAKF,EAAG,6CACRG,EAAKF,EAAG,8CAGhB,OAAoD,GAArC,IAAN1iB,EAAWA,EAAK2iB,EAAK,EAAKC,GAAM,EAAI,GAEjD,QACIF,EAAG7X,WAGX,QACI4X,EAAG5X,WAkJJ,SAASU,EAAQM,EAAWnE,GAC/B,MAAMyE,EAAI3B,EAAM9C,GAChB,IACI,IAAIkC,OAAM,EACV,KAAe,MAAPA,GAAeuC,EAAE,8CAAsD,CAC3E,MAAMnM,EAAImM,EAAE,0DACRN,EAAU7L,KACV4J,EAAM,YAAK5J,IAGnB,OAAO4J,EAEX,QACIuC,EAAEtB,WAiFH,SAAShB,EAAKC,EAAQC,EAAOrC,GAChC,MAAMyE,EAAI3B,EAAM9C,GAChB,IACI,IAAIsC,EAAMD,EACV,KAAOoC,EAAE,8CACLnC,EAAMF,EAAOE,EAAKmC,EAAE,2DAExB,OAAOnC,EAEX,QACImC,EAAEtB,WAgCH,SAASgY,EAAOhX,EAAWnE,GAC9B,OAhNG,SAAgBmE,EAAWnE,GAC9B,MAAMyE,EAAI3B,EAAM9C,GAChB,IACI,IAAIob,GAAQ,EACZ,MAASA,GAAS3W,EAAE,8CAChB2W,EAAQjX,EAAUM,EAAE,2DAExB,OAAO2W,EAEX,QACI3W,EAAEtB,WAsMEkY,CAAQ1d,IAAQwG,EAAUxG,GAAKqC,GA0GpC,SAASwC,EAAQC,EAAQzC,GAC5BmC,EAAK,CAACO,EAAU/E,KACZ8E,EAAO9E,SACR,EAAQqC,GASR,SAASsb,EAAe7Y,EAAQzC,GAC9BmC,EAAK,CAAC1L,EAAGkH,KACV8E,EAAOhM,EAAGkH,GACFlH,EAAI,EAAK,GAClB,EAAGuJ,GAkEH,SAAS5E,EAAIsI,EAAS1D,GACzB,OAAO0a,EAAS,IAAM5X,EAAM9C,GAAMyE,GAAOA,EAAE,6CAA+C,YAAKf,EAAQe,EAAE,iEAA8D,EAAY8W,IAC/KA,EAAIpY,YAsGL,SAASQ,EAAQ6X,EAASxb,GAC7B,MAAMyE,EAAI3B,EAAM9C,GAChB,IACI,IAAIkC,OAAM,EACV,KAAe,MAAPA,GAAeuC,EAAE,8CACrBvC,EAAMsZ,EAAQ/W,EAAE,2DAEpB,OAAOvC,EAEX,QACIuC,EAAEtB,WAIH,SAASsY,EAAKD,EAASxb,GAC1B,MAAMM,EAAaqD,EAAQ6X,EAASxb,GACpC,OAAkB,MAAdM,EACO+Y,IAGA,YAAQ/Y,GAIhB,SAASd,EAAO4C,EAAQpC,GAC3B,MAAMyE,EAAI3B,EAAM9C,GAChB,IACI,MAAMG,EAAQub,IAEV,OAAa,CACT,MAAMpZ,EAAMoZ,EACZ,IAAIjX,EAAE,6CAKF,OAAOnC,EAJPoZ,EAAUtZ,EAAOE,EAAKmC,EAAE,6DASpC,GAAIA,EAAE,6CACF,OAAOtE,EAAKsE,EAAE,2DAGd,MAAM,IAAKpG,MAhiCc,iCAmiCjC,QACIoG,EAAEtB,WAoCH,SAASwY,EAAKhL,EAAO3Q,GACxB,OAAOwZ,EAAM,KACT,MAAM/U,EAAI3B,EAAM9C,GAChB,IACI,IAAK,IAAIvJ,EAAI,EAAGA,GAAKka,EAAOla,IACxB,IAAKgO,EAAE,6CACH,MAAM,IAAKpG,MAAO8Z,EAAD,6BAGzB,OAAOQ,EAAgC,OACpClU,GAEP,MAAOnE,GAEH,MADAmE,EAAEtB,UACI7C,KAqBX,SAASsb,EAAKjL,EAAO3Q,GACxB,OAAO2a,EAAgB,IAAM7X,EAAM9C,GAAK,CAACvJ,EAAGgO,KACxC,GAAIhO,EAAIka,EAAO,CACX,GAAIlM,EAAE,6CACF,OAAO,YAAKA,EAAE,2DAGd,MAAM,IAAKpG,MAAO8Z,EAAD,+BAMzBoD,IACAA,EAAIpY,YAwBL,SAAS0Y,EAAQnY,EAAS1D,GAC7B,OAAO0Z,EAAM,IAAMpW,EAAOlI,EAAIsI,EAAS1D,O,6BC9pC3C,gjCAGO,SAAS8b,EAA8Bla,EAAMK,GAChD,MAAsB,mBAAVL,EACD,IAAIA,EAAKK,GAGT,IAAI3E,MAAM2E,GAIzB,SAASoX,IACL,MAAM,IAAKhb,MAAM,sEAGrB,SAAS0d,IACL,MAAM,IAAK1d,MAAM,gCAoBd,SAAS2d,EAAKC,EAAQC,EAAavL,EAAO1X,GAC7C,MAAMkjB,EAAsB,EAAdD,EACd,OAAOD,EAAOD,KAAK/iB,EAAOkjB,EAAQA,EAAQxL,GAQvC,SAASyL,EAAKC,GACjB,GAAqB,IAAjBA,EAAM1lB,OACN,MAAM,IAAK0H,MAAM,qDAErB,OAAOge,EAAMA,EAAM1lB,OAAS,GAYzB,SAAS2lB,EAAW1Y,EAAG2Y,EAAQ3a,GAClC,MAAMK,EAAsB,EAAhBsa,EAAO5lB,OACbslB,EAASH,EAA8Bla,EAAMK,GACnD,IAAK,IAAIxL,EAAI,EAAGA,GAAMwL,EAAM,EAAIxL,IAC5BwlB,EAAOxlB,GAAKmN,EAAEnN,EAAG8lB,EAAO9lB,IAE5B,OAAOwlB,EAGJ,SAAS7gB,EAAIwI,EAAG2Y,EAAQ3a,GAC3B,MAAMK,EAAsB,EAAhBsa,EAAO5lB,OACbslB,EAASH,EAA8Bla,EAAMK,GACnD,IAAK,IAAIxL,EAAI,EAAGA,GAAMwL,EAAM,EAAIxL,IAC5BwlB,EAAOxlB,GAAKmN,EAAE2Y,EAAO9lB,IAEzB,OAAOwlB,EA+CJ,SAASO,EAAQ9Y,EAASrB,EAAOga,EAAOza,GAC3C,MAAMtB,EAA4B,EAAf+b,EAAM1lB,OACzB,GAAmB,IAAf2J,EACA,MAAO,CAAC,GAAI+B,GAEX,CACD,IAAIC,EAAMD,EACV,MAAMH,EAAM4Z,EAA8Bla,EAAMtB,GAChD,IAAK,IAAI7J,EAAI,EAAGA,GAAM4lB,EAAM1lB,OAAS,EAAIF,IAAK,CAC1C,MAAMgmB,EAAe/Y,EAAQpB,EAAK+Z,EAAM5lB,IACxCyL,EAAIzL,GAAKgmB,EAAa,GACtBna,EAAMma,EAAa,GAEvB,MAAO,CAACva,EAAKI,IAId,SAASoa,EAAYhZ,EAAS2Y,EAAOha,EAAOT,GAC/C,MAAMtB,EAA4B,EAAf+b,EAAM1lB,OACzB,GAAmB,IAAf2J,EACA,MAAO,CAAC,GAAI+B,GAEX,CACD,IAAIC,EAAMD,EACV,MAAMH,EAAM4Z,EAA8Bla,EAAMtB,GAChD,IAAK,IAAI7J,EAAI4lB,EAAM1lB,OAAS,EAAGF,GAAK,EAAGA,IAAK,CACxC,MAAMgmB,EAAe/Y,EAAQ2Y,EAAM5lB,GAAI6L,GACvCJ,EAAIzL,GAAKgmB,EAAa,GACtBna,EAAMma,EAAa,GAEvB,MAAO,CAACva,EAAKI,IAmBd,SAASgB,EAAOqZ,EAAQ/a,GAC3B,MAAMgb,EAAWtf,MAAMC,QAAQof,GAAUA,EAAUrf,MAAMuD,KAAK8b,GAE9D,OADqC,EAAlBC,EAASjmB,QAExB,KAAK,EACD,OAAOmlB,EAA8Bla,EAAM,GAE/C,KAAK,EACD,OAAOgb,EAAS,GAEpB,QAAS,CACL,IAAIC,EAAW,EACXC,EAAc,EAClB,IAAK,IAAItG,EAAM,EAAGA,GAAQoG,EAASjmB,OAAS,EAAI6f,IAAO,CAEnDsG,EAAgBA,EADFF,EAASpG,GACa7f,OAAU,EAElD,MAAMa,EAASskB,EAA8Bla,EAAMkb,GACnD,IAAK,IAAIC,EAAQ,EAAGA,GAAUH,EAASjmB,OAAS,EAAIomB,IAAS,CACzD,MAAMC,EAAQJ,EAASG,GACvB,IAAK,IAAIplB,EAAI,EAAGA,GAAMqlB,EAAMrmB,OAAS,EAAIgB,IACrCH,EAAOqlB,GAAYG,EAAMrlB,GACzBklB,EAAaA,EAAW,EAAK,EAGrC,OAAOrlB,IAsCZ,SAASqK,EAAU5I,EAAO2I,GAC7B,MAAMqb,EAAKnB,EAA8Bla,EAAM,GAE/C,OADAqb,EAAG,GAAKhkB,EACDgkB,EAGJ,SAASC,EAAWvM,EAAOwM,EAAavb,GAC3C,GAAI+O,EAAQ,EACR,MAAM,IAAKtS,MAAM,0DAErB,MAAM7G,EAASskB,EAA8Bla,EAAM+O,GACnD,IAAK,IAAIla,EAAI,EAAGA,GAAMka,EAAQ,EAAIla,IAC9Be,EAAOf,GAAK0mB,EAAY1mB,GAE5B,OAAOe,EAGJ,SAAS4lB,EAASf,GACrB,GAAIA,EAAM1lB,OAAS,EACf,MAAO,GAEN,CACD,MAAMga,EAAS0L,EAAM1lB,OAAS,EAAK,EAC7Ba,EAAS,IAAI8F,MAAMqT,GACzB,IAAK,IAAIla,EAAI,EAAGA,GAAMka,EAAQ,EAAIla,IAC9Be,EAAOf,GAAK,CAAC4lB,EAAM5lB,GAAI4lB,EAAM5lB,EAAI,IAErC,OAAOe,GAeR,SAAS6lB,EAAKhB,GACjB,OAAOA,EAAMriB,QAGV,SAASuI,EAAQ8Z,GAEpB,OADgBA,EAAMriB,QACPuI,UAYZ,SAAS+a,EAASlb,EAAQia,EAAOha,EAAOT,GAC3C,MAAMM,EAAM4Z,EAA8Bla,EAAMya,EAAM1lB,OAAS,GAC/DuL,EAAIma,EAAM1lB,QAAU0L,EACpB,IAAK,IAAI5L,EAAI4lB,EAAM1lB,OAAS,EAAGF,GAAK,EAAGA,IACnCyL,EAAIzL,GAAK2L,EAAOia,EAAM5lB,GAAIyL,EAAIzL,EAAI,IAEtC,OAAOyL,EA8BJ,SAAS0Z,EAAKjL,EAAO0L,EAAOza,GAC/B,GAAI+O,EAAQ,EACR,MAAM,IAAKtS,MAAM,0DAErB,GAAIsS,EAAQ0L,EAAM1lB,OACd,MAAM,IAAK0H,MAAM,8DAErB,GAAc,IAAVsS,EACA,OAAOmL,EAA8Bla,EAAM,GAE1C,CACD,MAAMua,EAAQ,EACd,OAAOE,EAAMriB,MAAMmiB,EAAQA,EAAQxL,IAoIpC,SAAS9M,EAAQM,EAAWkY,GAC/B,OAAOA,EAAMkB,KAAKpZ,GAuBf,SAASsX,EAAKD,EAASa,GAqB1B,MApBa,CAAC5b,IACVN,EACA,OAAa,CACT,MAAM1J,EAAIgK,EACV,GAAIhK,GAAK4lB,EAAM1lB,OACX,OAAO0iB,IAEN,CACD,MAAM/Y,EAAakb,EAAQa,EAAM5lB,IACjC,GAAkB,MAAd6J,EACA,OAAO,YAAQA,GAGfG,EAAShK,EAAI,EACb,SAAS0J,KAMlBA,CAAK,GAgDT,SAASqd,EAAYrZ,EAAWkY,GAkBnC,MAjBa,CAAC5b,IAEV,OAAa,CACT,MAAMhK,EAAIgK,EACV,GAAIhK,EAAI,EACJ,OAEC,GAAI0N,EAAUkY,EAAM5lB,IACrB,OAAO,YAAK4lB,EAAM5lB,IAGlBgK,EAAShK,EAAI,IAMlB0J,CAAKkc,EAAM1lB,OAAS,GA6CxB,SAAS8mB,EAAiBtZ,EAAWkY,GAkBxC,MAjBa,CAAC5b,IAEV,OAAa,CACT,MAAMhK,EAAIgK,EACV,GAAIhK,EAAI,EACJ,OAEC,GAAI0N,EAAUkY,EAAM5lB,IACrB,OAAOA,EAGPgK,EAAShK,EAAI,IAMlB0J,CAAKkc,EAAM1lB,OAAS,GAwBxB,SAASwL,EAAKC,EAAQC,EAAOga,GAChC,OAAOA,EAAM7c,OAAO,CAAEke,EAAcC,IAAiBvb,EAAOsb,EAAcC,GAAgBtb,GASvF,SAASiZ,EAAe7Y,EAAQ4Z,GACnC,IAAK,IAAI5lB,EAAI,EAAGA,GAAM4lB,EAAM1lB,OAAS,EAAIF,IACrCgM,EAAOhM,EAAG4lB,EAAM5lB,IA8BjB,SAASmnB,EAAQha,EAAGyY,GACvB,MAAMtU,EAAsB,EAAfsU,EAAM1lB,OACbuL,EAAMma,EAAMriB,QACZ6jB,EAAa,IAAIvgB,MAAMyK,GAS7B,GARAuT,EAAe,CAAC7kB,EAAGkH,KACf,MAAMhG,EAAW,EAAPiM,EAAEnN,GACZ,GAAKkB,EAAI,GAAaA,GAAKoQ,EACvB,MAAM,IAAK1J,MAAM,2BAErB6D,EAAIvK,GAAKgG,EACTkgB,EAAWlmB,GAAK,GACjB0kB,IACGwB,EAAWC,MAAQtY,GAAO,IAAMA,GAClC,MAAM,IAAKnH,MAAM,2BAErB,OAAO6D,EA4GJ,SAAS6b,EAAIC,EAAQC,GACpBD,EAAOrnB,SAAWsnB,EAAOtnB,QACzBolB,IAEJ,MAAMvkB,EAAS,IAAI8F,MAAM0gB,EAAOrnB,QAChC,IAAK,IAAIF,EAAI,EAAGA,GAAMunB,EAAOrnB,OAAS,EAAIF,IACtCe,EAAOf,GAAK,CAACunB,EAAOvnB,GAAIwnB,EAAOxnB,IAEnC,OAAOe,EAcJ,SAAS0mB,EAAYC,EAAW9B,GACnC,GAAI8B,EAAY,EACZ,MAAM,IAAK9f,MAAM,sDAErB,GAAqB,IAAjBge,EAAM1lB,OACN,MAAO,CAAC,IAEP,CACD,MAAMa,EAAS,GACf,IAAK,IAAImG,EAAI,EAAGA,KAAU4J,KAAKkE,KAAK4Q,EAAM1lB,OAASwnB,GAAe,EAAIxgB,IAAK,CACvE,IAAI3D,EACJ,MAAMokB,EAAWzgB,EAAIwgB,EAAa,EAClCnkB,EAASqiB,EAAMriB,MAAMokB,EAAUA,EAAUD,GACnC3mB,EAAOP,KAAK+C,GAEtB,OAAOxC,GAgDR,SAAS6mB,EAAWzL,EAAUoL,EAAQC,GACzC,OAAoE,IAlCjE,SAAqBrL,EAAUoL,EAAQC,GAC1C,GAAc,MAAVD,EACA,OAAc,MAAVC,EACO,GAGC,EAGX,GAAc,MAAVA,EACL,OAAO,EAEN,CACD,IAAIxnB,EAAI,EACJe,EAAS,EACb,MAAM8mB,EAA0B,EAAhBN,EAAOrnB,OACjB4nB,EAA0B,EAAhBN,EAAOtnB,OACvB,GAAI2nB,EAAUC,EACV,OAAO,EAEN,GAAID,EAAUC,EACf,OAAQ,EAGR,KAAQ9nB,EAAI6nB,GAAuB,IAAX9mB,GACpBA,EAA2C,EAAjCob,EAASoL,EAAOvnB,GAAIwnB,EAAOxnB,IACrCA,EAAMA,EAAI,EAAK,EAEnB,OAAgB,EAATe,GAMRsjB,CAAY,CAACC,EAAIC,IAAO,YAAQD,EAAIC,GAAKgD,EAAQC,GAwBrD,SAASpe,EAAKwc,GACjB,GAAqB,IAAjBA,EAAM1lB,OACN,MAAM,IAAK0H,MAAM,qDAGjB,OAAOge,EAAM,GAId,SAASta,EAAQsa,GACpB,OAAqB,IAAjBA,EAAM1lB,YACN,EAGO,YAAK0lB,EAAM,IAenB,SAASvY,EAAQiR,EAAOsH,GAC3B,OAAKtH,EAAQ,GAAaA,GAASsH,EAAM1lB,YACrC,EAGO,YAAK0lB,EAAMtH,IAQnB,SAASyJ,EAASpc,EAAQia,EAAOha,GACpC,OAAOga,EAAMoC,YAAY,CAAEf,EAAcC,IAAiBvb,EAAOub,EAAcD,GAAgBrb,GA8B5F,SAASqc,EAAU9a,EAAGoa,EAAQC,EAAQ5b,GACzC,OAbG,SAA0BD,EAAQ4b,EAAQC,EAAQ5b,GACrD,IAAIC,EAAMD,EACN2b,EAAOrnB,SAAWsnB,EAAOtnB,QACzBolB,IAEJ,MAAMhU,EAAuB,EAAhBiW,EAAOrnB,OACpB,IAAK,IAAIF,EAAI,EAAGA,GAAKsR,EAAMtR,IACvB6L,EAAMF,EAAO3L,EAAI,EAAGunB,EAAOjW,EAAOtR,GAAIwnB,EAAOlW,EAAOtR,GAAI6L,GAE5D,OAAOA,EAIAqc,CAAiB,CAACC,EAAOjhB,EAAG6H,EAAGlD,IAAQsB,EAAEjG,EAAG6H,EAAGlD,GAAM0b,EAAQC,EAAQ5b,GAiIzE,SAASwc,EAASC,EAAYvC,GACjC,GAAIuC,GAAc,EACd,MAAM,IAAKzgB,MAAM,+BAErB,IAAI6D,EACJ,MAAMD,EAAgF,EAA1E,YAAM,CAACtE,EAAG6H,IAAM,YAAkB7H,EAAG6H,GAAI,EAAG+W,EAAO5lB,OAASmoB,GACxE5c,EAAM,IAAK5E,MAAM2E,GACjB,IAAK,IAAIxL,EAAIqoB,EAAYroB,GAAK8lB,EAAO5lB,OAAQF,IACzCyL,EAAIzL,EAAIqoB,GAAcvC,EAAOviB,MAAMvD,EAAIqoB,EAAaroB,EAAI,EAAK,GAEjE,OAAOyL,EAGJ,SAAS6c,EAAUC,EAAQ3C,GAC9B,GAAI2C,EAAS,EACT,MAAM,IAAK3gB,MAAM,wDAErB,GAAqB,IAAjBge,EAAM1lB,OACN,MAAO,CAAC,IAEP,CACD,MAAMa,EAAS,GACTynB,EAA4E,EAAjE,YAAM,CAACthB,EAAG6H,IAAM,YAAkB7H,EAAG6H,GAAIwZ,EAAQ3C,EAAM1lB,QAClEuoB,EAAiD,KAA7B7C,EAAM1lB,OAASsoB,GACnCE,EAAuB9C,EAAM1lB,OAASsoB,EAAY,EACxD,IAAK,IAAIxoB,EAAI,EAAGA,GAAMwoB,EAAW,EAAIxoB,IAAK,CACtC,MAAM0nB,EAA8E,GAAhE1nB,EAAI0oB,EAAwBD,EAAe,EAAKA,GACpE,IAAIllB,EACJ,MAAMokB,EAAY3nB,EAAIyoB,EAAgB,YAAM,CAAChG,EAAKkG,IAAQ,YAAkBlG,EAAKkG,GAAMD,EAAqB1oB,GAAM,EAClHuD,EAASqiB,EAAMriB,MAAMokB,EAAUA,EAAUD,GACnC3mB,EAAOP,KAAK+C,GAEtB,OAAOxC,GAIR,SAAS6nB,EAAU1C,EAAQ/a,GAC9B,MAAMgb,EAAWtf,MAAMC,QAAQof,GAAUA,EAAUrf,MAAMuD,KAAK8b,GACxD1a,EAAwB,EAAlB2a,EAASjmB,OACrB,GAAY,IAARsL,EACA,OAAO,IAAI3E,MAAM,GAEhB,CACD,MAAMgiB,EAAgC,EAArB1C,EAAS,GAAGjmB,OAnedwN,EAoeFob,GAAOA,EAAE5oB,SAAW2oB,EAAW1C,EAnenCkB,MAAM3Z,IAoeX4X,IAEJ,MAAMvkB,EAAS,IAAI8F,MAAMgiB,GACzB,IAAK,IAAI7oB,EAAI,EAAGA,GAAM6oB,EAAW,EAAI7oB,IAAK,CACtCe,EAAOf,GAAKqlB,EAA8Bla,EAAMK,GAChD,IAAK,IAAItK,EAAI,EAAGA,GAAMsK,EAAM,EAAItK,IAC5BH,EAAOf,GAAGkB,GAAKilB,EAASjlB,GAAGlB,GAGnC,OAAOe,EA9eR,IAAgB2M,I,6BCzsBvB,mJAEO,MAAMqb,EACT,YAAYvmB,GACRoB,KAAKpB,MAAQA,EAEjB,SACI,OAAOoB,KAAKpB,MAGhB,WACI,OAAO0M,OAAOtL,KAAKpB,OAEvB,cACI,OAAO,YAAeoB,KAAKpB,OAE/B,OAAO8B,GACH,OAAa,MAATA,GAIO,YAAOV,KAAKpB,MAAO8B,aAAiBykB,EAAOzkB,EAAM9B,MAAQ8B,GAGxE,UAAUA,GACN,OAAa,MAATA,EACO,EAGA,YAAQV,KAAKpB,MAAO8B,aAAiBykB,EAAOzkB,EAAM9B,MAAQ8B,IAItE,SAAS0kB,EAAK9hB,GACjB,OAAY,MAALA,GAAaA,aAAa6hB,EAAO,IAAIA,EAAK7hB,GAAKA,EAEnD,SAAS1E,EAAM0E,GAClB,GAAS,MAALA,EACA,MAAM,IAAIU,MAAM,uBAGhB,OAAOV,aAAa6hB,EAAO7hB,EAAE1E,MAAQ0E,EAiBtC,SAAS+hB,EAAWC,EAAKC,GAC5B,OAAe,MAAPD,EAAe1mB,EAAM0mB,GAAOC,EAQjC,SAASxkB,EAAIsI,EAASic,GACzB,OAAe,MAAPA,EAAeF,EAAK/b,EAAQzK,EAAM0mB,UAAS7jB,I,6BCpEvD,qLAmBO,SAASsJ,EAASzH,EAAGkiB,EAAY,GACpC,GAAS,MAALliB,GAA0B,iBAANA,EAAgB,CACpC,GAA0B,mBAAfA,EAAEyH,SACT,OAAOzH,EAAEyH,WAER,GAAIrM,OAAOiI,YAAYrD,EACxB,OAxBL,SAAqBmiB,GACxB,IAAInP,EAAQ,EACRjJ,EAAM,IACV,IAAK,MAAM/J,KAAKmiB,EAAM,CAClB,GAAc,IAAVnP,EACAjJ,GAAOtC,EAASzH,OAEf,IAAc,MAAVgT,EAAe,CACpBjJ,GAAO,QACP,MAGAA,GAAO,KAAOtC,EAASzH,GAE3BgT,IAEJ,OAAOjJ,EAAM,IAQEqY,CAAYpiB,GAElB,CACD,MAAMiE,EAAOhL,OAAOmY,eAAepR,GAAGqR,YACtC,OAAOpN,IAAShL,QAAUipB,EAAY,GAEhC,KAAOjpB,OAAOopB,QAAQriB,GAAGvC,IAAI,EAAE6kB,EAAGnhB,KAAOmhB,EAAI,MAAQ7a,EAAStG,EAAG+gB,EAAY,IAAIjiB,KAAK,QAAU,KAChGgE,EAAKpJ,MAGnB,OAAOmN,OAAOhI,GAmBX,MAAMuiB,EACT,WACI,OAAO7lB,KAAKM,QAAQN,KAAKF,KAE7B,SACI,OAA8B,IAAvBE,KAAKD,OAAOzD,OAAe0D,KAAK7B,KAAO,CAAC6B,KAAK7B,MAAM8K,OAAOjJ,KAAKD,QAE1E,WACI,OAzBD,SAAuB5B,EAAM4B,GAChC,GAAsB,IAAlBA,EAAOzD,OACP,OAAO6B,EAEN,CACD,IAAI2nB,EAAW,GACXC,GAAa,EAQjB,OAPsB,IAAlBhmB,EAAOzD,QACPwpB,EAAW/a,EAAShL,EAAO,IAC3BgmB,EAAaD,EAASvY,QAAQ,MAAQ,GAGtCuY,EAAW/lB,EAAOgB,IAAKuC,GAAMyH,EAASzH,IAAIC,KAAK,MAE5CpF,GAAQ4nB,EAAa,KAAO,KAAOD,GAAYC,EAAa,IAAM,KAWlEC,CAAchmB,KAAK7B,KAAM6B,KAAKD,QAEzC,cACI,MAAM4W,EAAS3W,KAAKD,OAAOgB,IAAKuC,GAAM,YAAeA,IAErD,OADAqT,EAAOnZ,OAAO,EAAG,EAAG,YAAWwC,KAAKF,MAC7B,YAAiB6W,GAE5B,OAAOjW,GACH,OAAIV,OAASU,KAGH,YAAgBV,KAAMU,KAGvBV,KAAKF,MAAQY,EAAMZ,KACjB,YAAYE,KAAKD,OAAQW,EAAMX,SAM9C,UAAUW,GACN,OAAIV,OAASU,EACF,EAED,YAAgBV,KAAMU,GAGvBV,KAAKF,MAAQY,EAAMZ,IACjB,YAAcE,KAAKD,OAAQW,EAAMX,QAGjCC,KAAKF,IAAMY,EAAMZ,KAAO,EAAI,GAN3B,GAUpB,SAASmmB,EAAaR,GAClB,MAAMpnB,EAAI,GACJsZ,EAAOpb,OAAOob,KAAK8N,GACzB,IAAK,IAAIrpB,EAAI,EAAGA,EAAIub,EAAKrb,OAAQF,IAC7BiC,EAAEsZ,EAAKvb,IAAMqpB,EAAK9N,EAAKvb,IAE3B,OAAOiC,EAEX,SAAS6nB,EAAeT,GACpB,MAAO,KAAOlpB,OAAOopB,QAAQF,GAAM1kB,IAAI,EAAE6kB,EAAGnhB,KAAOmhB,EAAI,MAAQ7a,EAAStG,IAAIlB,KAAK,QAAU,KAE/F,SAAS4iB,EAAkBV,GACvB,MAAM9O,EAASpa,OAAOyI,OAAOygB,GAAM1kB,IAAK0D,GAAM,YAAeA,IAC7D,OAAO,YAAiBkS,GAE5B,SAASyP,EAAaX,EAAM/kB,GACxB,GAAI+kB,IAAS/kB,EACT,OAAO,EAEN,GAAK,YAAgB+kB,EAAM/kB,GAG3B,CACD,MAAM2lB,EAAY9pB,OAAOob,KAAK8N,GAC9B,IAAK,IAAIrpB,EAAI,EAAGA,EAAIiqB,EAAU/pB,OAAQF,IAClC,IAAK,YAAOqpB,EAAKY,EAAUjqB,IAAKsE,EAAM2lB,EAAUjqB,KAC5C,OAAO,EAGf,OAAO,EATP,OAAO,EAYf,SAASkqB,EAAgBb,EAAM/kB,GAC3B,GAAI+kB,IAAS/kB,EACT,OAAO,EAEN,GAAK,YAAgB+kB,EAAM/kB,GAG3B,CACD,MAAM2lB,EAAY9pB,OAAOob,KAAK8N,GAC9B,IAAK,IAAIrpB,EAAI,EAAGA,EAAIiqB,EAAU/pB,OAAQF,IAAK,CACvC,MAAMe,EAAS,YAAQsoB,EAAKY,EAAUjqB,IAAKsE,EAAM2lB,EAAUjqB,KAC3D,GAAe,IAAXe,EACA,OAAOA,EAGf,OAAO,EAVP,OAAQ,EAaT,MAAMopB,EACT,SAAW,OAAON,EAAajmB,MAC/B,WAAa,OAAOkmB,EAAelmB,MACnC,cAAgB,OAAOmmB,EAAkBnmB,MACzC,OAAOU,GAAS,OAAO0lB,EAAapmB,KAAMU,GAC1C,UAAUA,GAAS,OAAO4lB,EAAgBtmB,KAAMU,IAE7C,MAAM8lB,EACT,YAAYC,EAAkBC,GACJ,mBAAXA,GACP1mB,KAAK5B,OAASqoB,EACdzmB,KAAK0mB,OAASA,IAGd1mB,KAAK5B,OAAS,IAAMqoB,EACpBzmB,KAAK0mB,OAAUjiB,IAAQgiB,EAAmBhiB,IAGlD,eACI,OAAOzE,KAAK5B,SAEhB,aAAaqG,GACTzE,KAAK0mB,OAAOjiB,IAKb,MAAMkiB,EACT,YAAYC,GACR5mB,KAAK4mB,QAAUA,K,0xBCjLvB,sZAUO,MAAMC,EACT,YAAYjB,EAAGnhB,GACXzE,KAAK4lB,EAAIA,EACT5lB,KAAKyE,EAAIA,GAQV,SAASqiB,EAA2BlB,EAAGnhB,GAC1C,OAAO,IAAIoiB,EAAcjB,EAAGnhB,GAGzB,SAASsiB,EAAuB7K,GACnC,OAAOA,EAAE0J,EAGN,SAASoB,EAAyB9K,GACrC,OAAOA,EAAEzX,EAGN,MAAMwiB,UAAsBJ,EAC/B,YAAYjB,EAAGnhB,EAAGyiB,EAAMC,EAAO7gB,GAC3BZ,MAAMkgB,EAAGnhB,GACTzE,KAAKknB,KAAOA,EACZlnB,KAAKmnB,MAAQA,EACbnnB,KAAKsG,EAAS,EAAJA,GAQX,SAAS8gB,EAA6BxB,EAAGnhB,EAAGyiB,EAAMC,EAAO7gB,GAC5D,OAAO,IAAI2gB,EAAcrB,EAAGnhB,EAAGyiB,EAAMC,EAAO7gB,GAGzC,SAAS+gB,EAAwBnL,GACpC,OAAOA,EAAEgL,KAGN,SAASI,EAAyBpL,GACrC,OAAOA,EAAEiL,MAGN,SAASI,EAA0BrL,GACtC,OAAOA,EAAE5V,EA6BN,SAASkhB,EAAmBlkB,GAC/B,OAvBG,SAASmkB,EAAsBpG,EAASqG,GAC3CD,EACA,OAAa,CACT,MAAMxf,EAAMoZ,EAASrjB,EAAI0pB,EACzB,GAAS,MAAL1pB,EAAW,CACX,MAAM2pB,EAAK3pB,EACX,GAAI2pB,aAAcV,EAAe,CAC7B5F,EAAUoG,EAAsBxf,EAAM,EAAGof,EAAwBM,IACjED,EAAQJ,EAAyBK,GACjC,SAASF,EAGT,OAAQxf,EAAM,EAAK,EAIvB,OAAa,EAANA,GAORwf,CAAsB,EAAGnkB,GAG7B,SAASskB,EAAiB7pB,EAAG6nB,EAAGnhB,EAAGhG,GACtC,IAAIopB,EAEJ,GAAS,MADC9pB,EACK,CACX,MAAM4pB,EAFA5pB,EAGN8pB,EAAOF,aAAcV,EAAiBM,EAA0BI,GAAM,OAGtEE,EAAK,EAET,IAAIC,EAEJ,GAAW,MADCrpB,EACK,CACb,MAAMspB,EAFEtpB,EAGRqpB,EAAOC,aAAgBd,EAAiBM,EAA0BQ,GAAQ,OAG1ED,EAAK,EAET,MAAME,EAA8B,GAAtBH,EAAKC,EAAMA,EAAKD,GAC9B,OAAY,IAARG,EACOlB,EAA2BlB,EAAGnhB,GAG9B2iB,EAA6BxB,EAAGnhB,EAAG1G,EAAGU,EAAGupB,EAAM,GAIvD,SAASC,EAAwBjnB,EAAI4kB,EAAGnhB,EAAGxD,GAC9C,IAAI+mB,EAAKE,EAAMC,EAAKC,EAChBC,EAEJ,GAAS,MADCrnB,EACK,CACX,MAAM2mB,EAFA3mB,EAGNqnB,EAAQV,aAAcV,EAAiBM,EAA0BI,GAAM,OAGvEU,EAAM,EAEV,IAAIC,EAEJ,GAAW,MADCrnB,EACK,CACb,MAAM8mB,EAFE9mB,EAGRqnB,EAAQP,aAAgBd,EAAiBM,EAA0BQ,GAAQ,OAG3EO,EAAM,EAEV,GAAIA,EAAOD,EAAM,EAAI,CACjB,MAAMpiB,EAAa,YAAQhF,GAC3B,GAAIgF,aAAsBghB,EAAe,CACrC,GAAMe,EAAMX,EAAwBphB,IAAqB,MAAP+hB,GAAiBE,EAAOF,EAAME,aAAgBjB,EAAiBM,EAA0BW,GAAQ,GAAM,GAAOG,EAAM,EAAI,CACtK,MAAMtJ,EAAe,YAAQsI,EAAwBphB,IACrD,GAAI8Y,aAAwBkI,EACxB,OAAOW,EAAiBA,EAAiB5mB,EAAI4kB,EAAGnhB,EAAG4iB,EAAwBtI,IAAgBgI,EAAuBhI,GAAeiI,EAAyBjI,GAAe6I,EAAiBN,EAAyBvI,GAAegI,EAAuB9gB,GAAa+gB,EAAyB/gB,GAAaqhB,EAAyBrhB,KAGrU,MAAM,IAAKjC,MAAM,iCAIrB,OAAO4jB,EAAiBA,EAAiB5mB,EAAI4kB,EAAGnhB,EAAG4iB,EAAwBphB,IAAc8gB,EAAuB9gB,GAAa+gB,EAAyB/gB,GAAaqhB,EAAyBrhB,IAIhM,MAAM,IAAKjC,MAAM,iCAGpB,GAAIqkB,EAAOC,EAAM,EAAI,CACtB,MAAMC,EAAe,YAAQvnB,GAC7B,GAAIunB,aAAwBtB,EAAe,CACvC,GAAMkB,EAAMb,EAAyBiB,IAAuB,MAAPJ,GAAiBC,EAAOD,EAAMC,aAAgBnB,EAAiBM,EAA0Ba,GAAQ,GAAM,GAAOE,EAAM,EAAI,CACzK,MAAME,EAAe,YAAQlB,EAAyBiB,IACtD,GAAIC,aAAwBvB,EACxB,OAAOW,EAAiBA,EAAiBP,EAAwBkB,GAAexB,EAAuBwB,GAAevB,EAAyBuB,GAAelB,EAAwBmB,IAAgBzB,EAAuByB,GAAexB,EAAyBwB,GAAeZ,EAAiBN,EAAyBkB,GAAe5C,EAAGnhB,EAAGxD,IAGnV,MAAM,IAAK+C,MAAM,iCAIrB,OAAO4jB,EAAiBP,EAAwBkB,GAAexB,EAAuBwB,GAAevB,EAAyBuB,GAAeX,EAAiBN,EAAyBiB,GAAe3C,EAAGnhB,EAAGxD,IAIhN,MAAM,IAAK+C,MAAM,iCAIrB,OAAO4jB,EAAiB5mB,EAAI4kB,EAAGnhB,EAAGxD,GAInC,SAASwnB,EAAkBlQ,EAAUqN,EAAGnhB,EAAGzG,GAC9C,GAAS,MAALA,EAAW,CACX,MAAM2pB,EAAK3pB,EACLC,EAAsD,EAAlDsa,EAASmQ,QAAQ9C,EAAGmB,EAAuBY,IACrD,OAAIA,aAAcV,EACVhpB,EAAI,EACGgqB,EAAwBQ,EAAkBlQ,EAAUqN,EAAGnhB,EAAG4iB,EAAwBM,IAAMZ,EAAuBY,GAAKX,EAAyBW,GAAKL,EAAyBK,IAEvK,IAAN1pB,EACEmpB,EAA6BxB,EAAGnhB,EAAG4iB,EAAwBM,GAAKL,EAAyBK,GAAKJ,EAA0BI,IAGxHM,EAAwBZ,EAAwBM,GAAKZ,EAAuBY,GAAKX,EAAyBW,GAAKc,EAAkBlQ,EAAUqN,EAAGnhB,EAAG6iB,EAAyBK,KAGhL1pB,EAAI,EACFmpB,EAA6BxB,EAAGnhB,OAAGkkB,EAAuB3qB,EAAG,GAEzD,IAANC,EACE6oB,EAA2BlB,EAAGnhB,GAG9B2iB,EAA6BxB,EAAGnhB,EAAGzG,OAAG2qB,EAAuB,GAIxE,OAAO7B,EAA2BlB,EAAGnhB,GAItC,SAASmkB,EAAsBC,EAAcC,EAAOpB,GACvDkB,EACA,OAAa,CACT,MAAMrQ,EAAWsQ,EAAcjD,EAAIkD,EAAO9qB,EAAI0pB,EAC9C,GAAS,MAAL1pB,EAAW,CACX,MAAM2pB,EAAK3pB,EACLC,EAAsD,EAAlDsa,EAASmQ,QAAQ9C,EAAGmB,EAAuBY,IACrD,GAAU,IAAN1pB,EACA,OAAO,YAAK+oB,EAAyBW,IAEpC,GAAIA,aAAcV,EAAe,CAClC4B,EAAetQ,EACfuQ,EAAQlD,EACR8B,EAAUzpB,EAAI,EAAKopB,EAAwBM,GAAML,EAAyBK,GAC1E,SAASiB,EAGT,OAIJ,QAgGL,SAASG,EAAiC/qB,GAC7C,GAAS,MAALA,EAAW,CACX,MAAM2pB,EAAK3pB,EACX,GAAI2pB,aAAcV,EAAe,CAC7B,GAAmC,MAA/BI,EAAwBM,GACxB,MAAO,CAACZ,EAAuBY,GAAKX,EAAyBW,GAAKL,EAAyBK,IAE1F,CACD,MAAMvF,EAAe2G,EAAiC1B,EAAwBM,IAC9E,MAAO,CAACvF,EAAa,GAAIA,EAAa,GAAIwF,EAAiBxF,EAAa,GAAI2E,EAAuBY,GAAKX,EAAyBW,GAAKL,EAAyBK,MAInK,MAAO,CAACZ,EAAuBY,GAAKX,EAAyBW,QAAKgB,GAItE,MAAM,IAAK3kB,MAAM,0CAsKlB,SAASglB,EAAmBzf,EAAGvL,IArB/B,SAASirB,EAAsBC,EAAOxB,GACzCuB,EACA,OAAa,CACT,MAAM1f,EAAI2f,EAAOlrB,EAAI0pB,EACrB,GAAS,MAAL1pB,EAAW,CACX,MAAM2pB,EAAK3pB,EACX,GAAI2pB,aAAcV,EAAe,CAC7BgC,EAAsB1f,EAAG8d,EAAwBM,IACjDpe,EAAEwd,EAAuBY,GAAKX,EAAyBW,IACvDuB,EAAQ3f,EACRme,EAAQJ,EAAyBK,GACjC,SAASsB,EAGT1f,EAAEwd,EAAuBY,GAAKX,EAAyBW,IAG/D,OAKJsB,CAAsB1f,EAAGvL,GA+QtB,SAASmrB,EAA0BnrB,EAAGorB,EAAKhtB,GAC9C,IAAIkB,EAAIlB,EACR4sB,EAAmB,CAAC1lB,EAAG6H,KACnBie,EAAI9rB,GAAK,CAACgG,EAAG6H,GACb7N,EAAMA,EAAI,EAAK,GAChBU,GAgCA,SAASqrB,EAAsB9Q,EAAU6Q,GAC5C,IAAIvhB,OAAM8gB,EACV,IAAK,IAAIxM,EAAM,EAAGA,GAAQiN,EAAI9sB,OAAS,EAAI6f,IAAO,CAC9C,MAAMmN,EAAaF,EAAIjN,GACvBtU,EAAM4gB,EAAkBlQ,EAAU+Q,EAAW,GAAIA,EAAW,GAAIzhB,GAEpE,OAAOA,EAGJ,SAAS0hB,EAAoBhR,EAAUta,GAC1C,GAAI,YAAYA,GACZ,OAAOorB,EAAsB9Q,EAAUta,GAEtC,GAAIA,aAAa,IAClB,OApCD,SAA8Bsa,EAAUxa,GAC3C,OAAO,YAAO,CAACkK,EAAKuhB,IAAcf,EAAkBlQ,EAAUiR,EAAU,GAAIA,EAAU,GAAIvhB,QAAM0gB,EAAuB5qB,GAmC5G0rB,CAAqBlR,EAAUta,GAErC,CACD,MAAMyrB,EAAK,YAAczrB,GACzB,IACI,OArCL,SAAwC4qB,EAAcxH,EAASsI,GAElE,OAAa,CACT,MAAMpR,EAAWsQ,EAAc5gB,EAAMoZ,EAASjX,EAAIuf,EAClD,IAAIvf,EAAE,6CAQF,OAAOnC,EARX,CACI,MAAMma,EAAehY,EAAE,0DACvBye,EAAetQ,EACf8I,EAAUoH,EAAkBlQ,EAAU6J,EAAa,GAAIA,EAAa,GAAIna,GACxE0hB,EAAQvf,IA6BDwf,CAA+BrR,OAAUoQ,EAAuBe,GAE3E,QACIA,EAAG5gB,YAKR,MAAM+gB,UAAoC,IAC7C,YAAYC,EAAOnL,GACfjZ,QACA1F,KAAK8pB,MAAQA,EACb9pB,KAAK2e,QAAUA,GAQhB,SAASoL,EAA0BC,GACtCD,EACA,OAAa,CACT,MAAMD,EAAQE,EACd,GAAK,YAAUF,GAmBX,OAAO,cAnBY,CACnB,MAAMG,EAAO,YAAKH,GACZ9rB,EAAI,YAAK8rB,GACf,GAAS,MAAL9rB,EAAW,CACX,MAAM2pB,EAAK3pB,EACX,GAAI2pB,aAAcV,EAAe,CAC7B+C,EAAY,YAAgB,CAAC3C,EAAwBM,GAAKb,EAA2BC,EAAuBY,GAAKX,EAAyBW,IAAML,EAAyBK,IAAMsC,GAC/K,SAASF,EAGT,OAAOD,EAIXE,EAAYC,EACZ,SAASF,IAUlB,SAASG,EAAyBlsB,GACrC,OAAO,IAAI6rB,EAA4BE,EAA0B,YAAU/rB,KAAK,GAW7E,SAASmsB,EAAsB/tB,GAClC,GAAIA,EAAEuiB,QAAS,CACX,MAAM1Y,EAAa7J,EAAE0tB,MACrB,GAAK,YAAU7jB,GAeX,OAtBL,WACH,MAAM,IAAKjC,MAAM,gCAqBFomB,GAdP,GAAwB,MAApB,YAAKnkB,GAAqB,CAC1B,MAAMjI,EAAI,YAAKiI,GACf,GAAIjI,aAAaipB,EACb,MAAM,IAAKjjB,MAAM,mEAGjB,MAAO,CAAC+iB,EAAuB/oB,GAAIgpB,EAAyBhpB,IAIhE,MAAM,IAAKgG,MAAM,mEAQzB,OA9BD,WACH,MAAM,IAAKA,MAAM,2BA6BNqmB,GAgCR,SAASC,EAA4BtsB,GACxC,IAAI5B,EAAI8tB,EAAyBlsB,GACjC,MAAO,CACH,uDAAwD,IAC7CmsB,EAAsB/tB,GAEjC,6CAA8C,IACnC+tB,EAAsB/tB,GAEjC,0CAA2C,IArC5C,SAAgCA,GACnC,GAAIA,EAAEuiB,QAAS,CACX,MAAM1Y,EAAa7J,EAAE0tB,MACrB,GAAK,YAAU7jB,GAgBX,OAAO,EAfP,GAAwB,MAApB,YAAKA,GAAqB,CAE1B,GADU,YAAKA,aACEghB,EACb,MAAM,IAAKjjB,MAAM,oEAIjB,OADA5H,EAAE0tB,MAAQC,EAA0B,YAAK9jB,KACjC,YAAU7J,EAAE0tB,OAIxB,MAAM,IAAK9lB,MAAM,oEASzB,OADA5H,EAAEuiB,SAAU,GACJ,YAAUviB,EAAE0tB,OAcTS,CAAuBnuB,GAElC,yCACIA,EAAI8tB,EAAyBlsB,IAEjC,aAgBD,MAAMwsB,EACT,YAAYjS,EAAUkS,GAClBzqB,KAAKuY,SAAWA,EAChBvY,KAAKyqB,KAAOA,EAEhB,cAEI,OAA2C,EAgR5C,SAAoCC,GACvC,MAAMC,EAAc,CAACrnB,EAAG6H,KAAS7H,GAAK,GAAK6H,EAAK,IAChD,IAAItD,EAAM,EACV,MAAMgB,EAAa,YAAc6hB,GACjC,IACI,KAAO7hB,EAAW,8CAA8C,CAC5D,MAAM+hB,EAA0B/hB,EAAW,0DAC3ChB,EAAsE,EAA/D8iB,EAAY9iB,EAAK,YAAe+iB,EAAwB,KAC/D/iB,EAAsE,EAA/D8iB,EAAY9iB,EAAK,YAAe+iB,EAAwB,MAGvE,QACI/hB,EAAWC,UAEf,OAAa,EAANjB,EA9RIgjB,CADO7qB,MAGlB,OAAO8qB,GACH,MAAMJ,EAAQ1qB,KACd,KAAI8qB,aAAgBN,GAqChB,OAAO,EArCoB,CAC3B,MAAM9J,EAAK,YAAcgK,GACzB,IACI,MAAM/J,EAAK,YAAcmK,GACzB,IACI,MAAMhlB,EAAO,KACT,MAAMilB,EAAKrK,EAAG,6CACd,GAAIqK,IAAOpK,EAAG,6CAA8C,CACxD,GAAKoK,EAGA,CACD,MAAMC,EAAMtK,EAAG,0DACTuK,EAAMtK,EAAG,0DACf,SAAI,YAAOqK,EAAI,GAAIC,EAAI,MAAM,YAAOD,EAAI,GAAIC,EAAI,MACrCnlB,IANX,OAAO,EAcX,OAAO,GAGf,OAAOA,IAEX,QACI6a,EAAG7X,WAGX,QACI4X,EAAG5X,YAOf,WAEI,MAAQ,QAAU,YAAK,KAAM,YAAO2P,GAAO,YAAO,aAAcA,EAAG,GAAIA,EAAG,IAD5DzY,OAC4E,IAE9FxB,IAAKE,OAAOC,eACR,MAAO,YAEX,OAAO4H,GAEH,OAAOtD,MAAMuD,KADCxG,MAGlB,gBAEI,OAAOsqB,EADItqB,KAC2ByqB,MAE1C,CAAC/rB,OAAOiI,YACJ,OAAO,YAAW3G,KAAK4G,iBAE3B,iDAEI,OAAO0jB,EADItqB,KAC2ByqB,MAE1C,UAAUrlB,GACN,MAAMpH,EAAIgC,KACV,GAAIoF,aAAeolB,EACf,OAGa,EAHN,YAAY,CAACU,EAAMC,KACtB,MAAMltB,EAA2C,EAAvCD,EAAEua,SAASmQ,QAAQwC,EAAK,GAAIC,EAAK,IAC3C,OAAqD,GAAtC,IAANltB,EAAWA,EAAI,YAAQitB,EAAK,GAAIC,EAAK,MAC/CntB,EAAGoH,GAGN,MAAM,IAAKpB,MAAM,wCAGzB,oDAAsDV,GAClD,MAAM,IAAKU,MAAM,yBAErB,mDACI,MAAM,IAAKA,MAAM,yBAErB,uDAAyDV,GACrD,MAAM,IAAKU,MAAM,yBAErB,yDAA2DV,GAEvD,QAAO8nB,EADGprB,KACuBsD,EAAE,KAAM,YAAO+nB,EADtCrrB,KAC6DsD,EAAE,IAAKA,EAAE,IAEpF,2DAA6D8lB,EAAKhtB,GAE9D+sB,EADUnpB,KACkByqB,KAAMrB,EAAKhtB,GAE3C,4DACI,OAAO,EAEX,uDAEI,OAAiC,EAA1BkvB,EADGtrB,MAGd,+DAEI,OAAiC,EAA1BsrB,EADGtrB,MAGd,WAEI,OAAiC,EAA1BsrB,EADGtrB,MAGd,QACI,MAAM,IAAKgE,MAAM,yBAErB,OAAOugB,GACH,MAAM,IAAKvgB,MAAM,yBAGrB,UAEI,OAAO,YAAOzE,GAAM,CAACA,EAAE,GAAIA,EAAE,IADnBS,MAGd,IAAI4lB,GAEA,OAAOyF,EADGrrB,KACoB4lB,GAElC,IAAIA,GAEA,OAAOwF,EADGprB,KACuB4lB,GAErC,OAEI,OAAO,YAAOrmB,GAAMA,EAAE,GADZS,MAGd,IAAI4lB,EAAGnhB,GAEH,MAAM,IAAKT,MAAM,yBAGrB,SAEI,OAAO,YAAOzE,GAAMA,EAAE,GADZS,MAGd,QAAQuJ,EAAGgiB,GACP,MAAMvtB,EAAIgC,KACV,YAAWT,IACPgK,EAAEhK,EAAE,GAAIA,EAAE,GAAIvB,IACfA,IAQJ,SAASwtB,EAAgBjT,EAAUkS,GACtC,OAAO,IAAID,EAAUjS,EAAUkS,GAW5B,SAASgB,EAAiB/B,GAC7B,MAAMnR,EAAW,cACjB,OAAOiT,EAAgBjT,EAAUgR,EAAoBhR,EAAUmR,IAuB5D,SAAS2B,EAAoBrtB,EAAGkB,GACnC,OAl7BG,SAA4BqZ,EAAUqN,EAAG5nB,GAC5C,MAAMiI,EAAa2iB,EAAsBrQ,EAAUqN,EAAG5nB,GACtD,GAAkB,MAAdiI,EACA,MAAM,IAAKjC,MAGX,OAAO,YAAQiC,GA46BZylB,CAAmB1tB,EAAEua,SAAUrZ,EAAKlB,EAAEysB,MA4C1C,SAASa,EAAqBttB,GACjC,OAAOwpB,EAAmBxpB,EAAEysB,MAGzB,SAASW,EAAuBptB,EAAGkB,GACtC,OA1wBG,SAA2B2pB,EAAcC,EAAOpB,GACnDiE,EACA,OAAa,CACT,MAAMpT,EAAWsQ,EAAcjD,EAAIkD,EAAO9qB,EAAI0pB,EAC9C,GAAS,MAAL1pB,EAAW,CACX,MAAM2pB,EAAK3pB,EACLC,EAAsD,EAAlDsa,EAASmQ,QAAQ9C,EAAGmB,EAAuBY,IACrD,GAAIA,aAAcV,EAAe,CAC7B,GAAIhpB,EAAI,EAAG,CACP4qB,EAAetQ,EACfuQ,EAAQlD,EACR8B,EAAQL,EAAwBM,GAChC,SAASgE,EAER,GAAU,IAAN1tB,EACL,OAAO,EAGP4qB,EAAetQ,EACfuQ,EAAQlD,EACR8B,EAAQJ,EAAyBK,GACjC,SAASgE,EAIb,OAAa,IAAN1tB,EAIX,OAAO,GA6uBR0tB,CAAkB3tB,EAAEua,SAAUrZ,EAAKlB,EAAEysB,MAGzC,SAASmB,EAAkB5tB,EAAGkB,GACjC,OAAOssB,EAAgBxtB,EAAEua,SAx3BtB,SAASsT,EAAqBtT,EAAUqN,EAAG5nB,GAC9C,GAAS,MAALA,EAAW,CACX,MAAM2pB,EAAK3pB,EACLC,EAAsD,EAAlDsa,EAASmQ,QAAQ9C,EAAGmB,EAAuBY,IACrD,GAAIA,aAAcV,EAAe,CAC7B,GAAIhpB,EAAI,EACJ,OAAOgqB,EAAwB4D,EAAqBtT,EAAUqN,EAAGyB,EAAwBM,IAAMZ,EAAuBY,GAAKX,EAAyBW,GAAKL,EAAyBK,IAEjL,GAAU,IAAN1pB,EAAS,CACd,GAAmC,MAA/BopB,EAAwBM,GACxB,OAAOL,EAAyBK,GAE/B,GAAoC,MAAhCL,EAAyBK,GAC9B,OAAON,EAAwBM,GAE9B,CACD,MAAMvF,EAAe2G,EAAiCzB,EAAyBK,IAC/E,OAAOC,EAAiBP,EAAwBM,GAAKvF,EAAa,GAAIA,EAAa,GAAIA,EAAa,KAIxG,OAAO6F,EAAwBZ,EAAwBM,GAAKZ,EAAuBY,GAAKX,EAAyBW,GAAKkE,EAAqBtT,EAAUqN,EAAG0B,EAAyBK,KAGpL,OAAU,IAAN1pB,OACL,EAGOD,GA41BoB6tB,CAAqB7tB,EAAEua,SAAUrZ,EAAKlB,EAAEysB,OAmBxE,SAASqB,EAAkB9tB,GAC9B,OAnfG,SAA8BA,GACjC,MAAM8H,EAAO,CAACimB,EAAS1K,KACnBvb,EACA,OAAa,CACT,MAAMkmB,EAAMD,EAAS9jB,EAAMoZ,EAC3B,GAAW,MAAP2K,EAAa,CACb,MAAMrE,EAAKqE,EACX,GAAIrE,aAAcV,EAAe,CAC7B8E,EAAU1E,EAAwBM,GAClCtG,EAAU,YAAK,CAAC0F,EAAuBY,GAAKX,EAAyBW,IAAM7hB,EAAKwhB,EAAyBK,GAAK1f,IAC9G,SAASnC,EAGT,OAAO,YAAK,CAACihB,EAAuBY,GAAKX,EAAyBW,IAAM1f,GAI5E,OAAOA,IAKnB,OAAOnC,EAAK9H,EAAG,eA6dRiuB,CAAqBjuB,EAAEysB,MAG3B,SAASyB,EAAmBluB,GAC/B,OAtdG,SAA+BA,GAClC,MAAMoB,EAA4B,EAAxBooB,EAAmBxpB,GACvB6J,EAAM,YAAK,IAAI5E,MAAM7D,GAAI,EAAGA,EAAG,CAAC,KAAM,OAE5C,OADA+pB,EAA0BnrB,EAAG6J,EAAK,GAC3BA,EAkdAskB,CAAsBnuB,EAAEysB,MAoB5B,SAAShjB,EAAQ2kB,GACpB,OAtGiB,MAsGaA,EAtGrB3B,KAiHN,SAASvH,EAAKhkB,EAAKktB,GACtB,OAAOf,EAAoBe,EAAOltB,GAG/B,SAASsK,EAAQtK,EAAKktB,GACzB,OA9CG,SAA4BpuB,EAAGkB,GAClC,OAAO0pB,EAAsB5qB,EAAEua,SAAUrZ,EAAKlB,EAAEysB,MA6CzC4B,CAAmBD,EAAOltB,GAG9B,SAASotB,EAAOptB,EAAKktB,GACxB,OAAOR,EAAkBQ,EAAOltB,GAG7B,SAASqtB,EAAYrtB,EAAKktB,GAC7B,OAAOhB,EAAuBgB,EAAOltB,GA6ElC,SAASstB,EAAOC,GACnB,OAAOhB,EAAiBgB,GAOrB,SAASjkB,EAAQikB,GACpB,MAAMlU,EAAW,cACjB,OAAOiT,EAAgBjT,EAAU8Q,EAAsB9Q,EAAUkU,IAG9D,SAASrM,EAAOgM,GACnB,OAAON,EAAkBM,GAGtB,SAASzkB,EAAQykB,GACpB,OAAOF,EAAmBE,GAOvB,SAAS9V,EAAM8V,GAClB,OAAOd,EAAqBc,GAlQ5B5B,EAAUljB,MAAQkkB,EAAgB,mBAA0C7C,I,mgBCnoChF,gRAAO,MAAM+D,EAAShuB,OAAO,WACtB,SAASiuB,EAAUrpB,GACtB,MAAoB,iBAANA,IAAmBA,aAA6B,EAASA,EAAEopB,IAEtE,SAAS5hB,EAAQxH,EAAG6H,GACvB,MAAiB,iBAAN7H,EACAA,EAAI6H,GAAK,EAAK7H,EAAI6H,EAAI,EAAI,EAG1B7H,EAAEuH,UAAUM,GAGpB,SAASD,EAAS5H,EAAG6H,GACxB,MAAiB,iBAAN7H,EACAA,EAAI6H,EAGJ7H,EAAEopB,KAAUxhB,SAASC,GAG7B,SAASM,EAAQnI,EAAGkI,GACvB,MAAiB,iBAANlI,EACAA,EAAEmI,QAAQD,GAGVlI,EAAEopB,KAAUjhB,QAAQD,GAG5B,SAASJ,EAAY9H,EAAG+H,GAC3B,MAAiB,iBAAN/H,EACAA,EAAE8H,YAAYC,GAGd/H,EAAEopB,KAAUthB,YAAYC,GAGhC,SAASE,EAAcjI,EAAGkI,GAC7B,MAAiB,iBAANlI,EACAA,EAAEiI,cAAcC,GAGhBlI,EAAEopB,KAAUnhB,cAAcC,GAGlC,SAASE,EAAMpI,GAClB,MAAiB,iBAANA,GACCspB,OAAOtpB,KAAO,GAAGyH,SAAS,IAG3BzH,EAAEopB,KAAUhhB,U,6BCjD3B,oUAWO,MAAMmhB,EAAc,mCACpB,SAASC,EAAmB9Y,GAC/B,MAAM+Y,EAAU/Y,EAAS,EAEnBgZ,MADNhZ,EAAS9G,KAAKqP,IAAIvI,IACQ,MACpBiZ,EAAWjZ,EAAS,KAAW,IACrC,OAAQ+Y,EAAU,IAAM,KACpB,YAAaC,EAAO,GAAK,IACzB,YAAaC,EAAS,GAEvB,SAASC,EAAoBpX,EAAMqX,GACtC,MAAM9f,EAAMyI,EAAKsX,cACjB,MAAgB,UAATD,EACD9f,EAAIG,UAAU,EAAGH,EAAIE,QAAQ,MAC7BF,EAAIG,UAAUH,EAAIE,QAAQ,KAAO,EAAGF,EAAI/Q,OAAS,GAuB3D,SAAS+wB,EAA6BvX,EAAMsF,EAAQkS,GAChD,OAAOlS,EAAOzB,QAAQ,WAAaY,IAC/B,IAAIqB,EAAMgR,OAAOW,IACjB,OAAQhT,EAAM/M,UAAU,EAAG,IACvB,IAAK,IACD,MAAMrC,EAAImiB,EAAMxX,EAAK0X,iBAAmB1X,EAAK2X,cAC7C7R,EAAMrB,EAAMje,OAAS,EAAI6O,EAAI,IAAMA,EACnC,MACJ,IAAK,IACDyQ,GAAO0R,EAAMxX,EAAK4X,cAAgB5X,EAAK6X,YAAc,EACrD,MACJ,IAAK,IACD/R,EAAM0R,EAAMxX,EAAK8X,aAAe9X,EAAK+X,UACrC,MACJ,IAAK,IACDjS,EAAM0R,EAAMxX,EAAKgY,cAAgBhY,EAAKiY,WACtC,MACJ,IAAK,IACD,MAAMznB,EAAIgnB,EAAMxX,EAAKgY,cAAgBhY,EAAKiY,WAC1CnS,EAAMtV,EAAI,GAAKA,EAAI,GAAKA,EACxB,MACJ,IAAK,IACDsV,EAAM0R,EAAMxX,EAAKkY,gBAAkBlY,EAAKmY,aACxC,MACJ,IAAK,IACDrS,EAAM0R,EAAMxX,EAAKoY,gBAAkBpY,EAAKqY,aACxC,MACJ,IAAK,IACDvS,EAAM0R,EAAMxX,EAAKsY,qBAAuBtY,EAAKuY,kBAGrD,OAAIzB,OAAOvgB,MAAMuP,GACNrB,EAGCqB,EAAM,IAAMrB,EAAMje,OAAS,EAAK,IAAMsf,EAAM,GAAKA,IAIrE,SAAS0S,EAAuBxY,EAAMsF,GAClC,IAAI1X,EAAI6qB,EAAIC,EACZ,MAAMtwB,EAAI,IAAI+Y,KAAKnB,EAAKoB,WAAoC,QAAtBxT,EAAKoS,EAAK9B,cAA2B,IAAPtQ,EAAgBA,EAAK,IACzF,GAAsB,iBAAX0X,EACP,OAAOld,EAAEkvB,cAAczT,QAAQ,QAAS,IAAIA,QAAQ,eAAgB,KAAOmT,EAA2C,QAAtByB,EAAKzY,EAAK9B,cAA2B,IAAPua,EAAgBA,EAAK,GAElJ,GAAsB,IAAlBnT,EAAO9e,OAYZ,OAAO+wB,EAA6BnvB,EAAGkd,GAAQ,GAX/C,OAAQA,GACJ,IAAK,IACL,IAAK,IAAK,OAAO8R,EAAoBhvB,EAAG,SACxC,IAAK,IACL,IAAK,IAAK,OAAOgvB,EAAoBhvB,EAAG,UACxC,IAAK,IACL,IAAK,IAAK,OAxDtB,SAAmCuwB,EAAgBza,GAC/C,MAAM3G,EAAMohB,EAAerB,cAC3B,OAAO/f,EAAIG,UAAU,EAAGH,EAAI/Q,OAAS,GAAKwwB,EAAmB9Y,GAsDpC0a,CAA0BxwB,EAA2B,QAAtBswB,EAAK1Y,EAAK9B,cAA2B,IAAPwa,EAAgBA,EAAK,GACnG,QAAS,MAAM,IAAIxqB,MAAM,mCAOrC,SAAS2qB,EAAqB7Y,EAAMsF,GAChC,MAAMkS,EAAoB,IAAdxX,EAAKhD,KACjB,GAAsB,iBAAXsI,EACP,OAAOkS,EAAMxX,EAAK8Y,cAAgB9Y,EAAK+Y,iBAEtC,GAAsB,IAAlBzT,EAAO9e,OAgBZ,OAAO+wB,EAA6BvX,EAAMsF,EAAQkS,GAflD,OAAQlS,GACJ,IAAK,IACL,IAAK,IACD,OAAOkS,EAAMJ,EAAoBpX,EAAM,SAAWA,EAAKgZ,qBAC3D,IAAK,IACL,IAAK,IACD,OAAOxB,EAAMJ,EAAoBpX,EAAM,UAAYA,EAAKiZ,qBAC5D,IAAK,IACL,IAAK,IACD,OAhGhB,SAAyB7wB,EAAGovB,GACxB,GAAIA,EACA,OAAOpvB,EAAEkvB,cAER,CAED,MAAM4B,EAAwB,MAAV9wB,EAAE4U,MAAiC,IAAX5U,EAAE4U,KAC9C,OAAO,YAAa5U,EAAEuvB,cAAe,GAAK,IACtC,YAAavvB,EAAEyvB,WAAa,EAAG,GAAK,IACpC,YAAazvB,EAAE2vB,UAAW,GAAK,IAC/B,YAAa3vB,EAAE6vB,WAAY,GAAK,IAChC,YAAa7vB,EAAE+vB,aAAc,GAAK,IAClC,YAAa/vB,EAAEiwB,aAAc,GAAK,IAClC,YAAajwB,EAAEmwB,kBAAmB,IACjCW,EAAclC,GAA4C,IAAzB5uB,EAAE8X,qBAAgC,KAkFzDiZ,CAAgBnZ,EAAMwX,GACjC,QACI,MAAM,IAAItpB,MAAM,mCAOzB,SAAS+G,EAAS+K,EAAMsF,EAAQ8T,GACnC,OAAsB,MAAfpZ,EAAK9B,OACNsa,EAAuBxY,EAAMsF,GAC7BuT,EAAqB7Y,EAAMsF,GAE9B,SAAS+T,EAASvwB,EAAOkU,GAC5B,MAAM5U,EAAI,IAAI+Y,KAAKrY,GAEnB,OADAV,EAAE4U,KAAqD,GAArC,MAARA,EAAe,EAAsBA,GACxC5U,EAEJ,SAASkxB,EAAUlb,EAAOpB,GAC7BoB,EAAQ,YAAUA,GAClBpB,EAAe,MAARA,EAAeA,EAAO,EAC7B,IAAIgD,EAAOqZ,EAAS,YAA6Bjb,GAAQpB,GAOzD,OAHa,IAATA,IACAgD,EAAOqZ,EAASrZ,EAAKoB,UAAY,YAAWpB,GAAOhD,IAEhDgD,EAuBJ,SAASuZ,EAASpV,GACrB,GAAc,OAAVA,EACA,MAAM,IAAIjW,MAAM,8CAEpB,GAAqB,KAAjBiW,EAAMyD,OACN,MAAM,IAAI1Z,MAAM,yDAEpB,IAAI8R,EAAO,IAAImB,KAAKgD,GACpB,GAAI5N,MAAMyJ,EAAKoB,WAAY,CAGvB,MAAMlZ,EAAI,6GAA6Gwc,KAAKP,GAC5H,GAAS,MAALjc,EA0CA,MAAM,IAAIgG,MAAM,mCA1CL,CACX,IAAIsrB,EACAC,EAAgB,EACpB,GAAY,MAARvxB,EAAE,GAAY,CACd,MAAMwxB,EAAYxxB,EAAE,GAAGqf,MAAM,KAC7BkS,EACiC,KAA7B3hB,SAAS4hB,EAAU,GAAI,IACiB,GAApC5hB,SAAS4hB,EAAU,IAAM,IAAK,IAC9BC,WAAWD,EAAU,IAAM,KACvB,MAARxxB,EAAE,IAAqC,OAAvBA,EAAE,GAAGyV,gBACrB8b,GAAiB,KAGzB,GAAY,MAARvxB,EAAE,GAAY,CACd,GAAY,MAARA,EAAE,GACFsxB,EAAW,IAAIrY,KAAKjZ,EAAE,GAAK,YAE1B,CACD,MAAME,EAAI,IAAI+Y,KACdqY,EAAW,IAAIrY,KAAK/Y,EAAEsvB,iBAAmB,KAAOtvB,EAAEwvB,cAAgB,GAAK,IAAMxvB,EAAE0vB,cAEnF,MAAM8B,EAAc1xB,EAAE,GAAGoF,OAAO,GAAGia,MAAM,KACzC,IAAIsS,EAAiD,GAA/B/hB,SAAS8hB,EAAY,GAAI,IAAW9hB,SAAS8hB,EAAY,IAAM,IAAK,IAC1E,MAAZ1xB,EAAE,GAAG,KACL2xB,IAAoB,GAExBJ,GAAmC,GAAlBI,OAGjB,GAAY,MAAR3xB,EAAE,GACFsxB,EAAW,IAAIrY,KAAKjZ,EAAE,QAErB,CACD,MAAME,EAAI,IAAI+Y,KACdqY,EAAW,IAAIrY,KAAK/Y,EAAEuvB,cAAgB,KAAOvvB,EAAEyvB,WAAa,GAAK,IAAMzvB,EAAE2vB,WAGjF/X,EAAO,IAAImB,KAAKqY,EAASpY,UAA4B,IAAhBqY,GAErCzZ,EAAO,IAAImB,KAAKnB,EAAKoB,UAAwE,KAA3DpB,EAAKE,oBAAsBsZ,EAAStZ,uBAM9E,OAAOF,EAEJ,SAAS9C,EAAM3F,EAAKuiB,GAAY,GACnC,MAAM9Z,EAAOuZ,EAAShiB,GAChB2G,EAAS6Y,EAAYrS,KAAKnN,GAG1ByF,EAAiB,MAAVkB,EACN4b,GAA2B,MAAd5b,EAAO,GAAa,EAAc,EAChD,EACN,OAAOmb,EAASrZ,EAAKoB,UAAWpE,GAW7B,SAAS7T,EAAO4wB,EAAMC,EAAOC,EAAKzpB,EAAI,EAAGtI,EAAI,EAAGN,EAAI,EAAGqW,EAAK,EAAGjB,GAClE,MAAMkd,EAAqB,IAATld,EACZmE,KAAKgZ,IAAIJ,EAAMC,EAAQ,EAAGC,EAAKzpB,EAAGtI,EAAGN,EAAGqW,GACxC,IAAIkD,KAAK4Y,EAAMC,EAAQ,EAAGC,EAAKzpB,EAAGtI,EAAGN,EAAGqW,GAAImD,UAClD,GAAI7K,MAAM2jB,GACN,MAAM,IAAIhsB,MAAM,oDAEpB,MAAM8R,EAAOqZ,EAASa,EAAWld,GAIjC,OAHI+c,GAAQ,IACR/Z,EAAKoa,YAAYL,EAAMC,EAAQ,EAAGC,GAE/Bja,EAWJ,SAASqa,EAAWN,GACvB,OAAOA,EAAO,GAAM,GAAKA,EAAO,KAAQ,GAAKA,EAAO,KAAQ,EAEzD,SAASO,EAAYP,EAAMC,GAC9B,OAAiB,IAAVA,EACAK,EAAWN,GAAQ,GAAK,GACxBC,GAAS,EAAKA,EAAQ,GAAM,EAAI,GAAK,GAAOA,EAAQ,GAAM,EAAI,GAAK,GA+HvD,IACE,K,8BCzZzB,YAEO,SAASO,EAAUjoB,GACxB,KAAMpI,gBAAgBqwB,GACpB,OAAO,IAAIA,EAAUjoB,GAEvBpI,KAAKkc,EAAI9T,EANX,soBASA,IAAI8T,EAAImU,EAAU7zB,UAEX,SAAS8zB,EAAMlxB,EAAGmK,GAEvB,IADA,IAAInN,EAAI,EACAA,EAAIgD,EAAGhD,IACbmN,EAAEnN,GAUC,SAAS+I,EAAOoE,EAAGgnB,EAAMnH,GAI9B,OAVK,SAAiB7f,EAAG6f,GACzBkH,EAAMlH,EAAI9sB,QAAQ,SAASF,GACzBmN,EAAE6f,EAAIhtB,GAAIA,EAAGgtB,MAKfjgB,EAAQ,SAASqnB,EAAMp0B,EAAGgtB,GACxBmH,EAAOhnB,EAAEgnB,EAAMC,EAAMp0B,EAAGgtB,KACvBA,GACImH,EAGF,SAASxvB,EAAIwI,EAAG6f,GACrB,OAAOjkB,GACL,SAAS8C,EAAKuoB,EAAMp0B,EAAG8oB,GACrB,OAAOjd,EAAIgB,OAAO,CAACM,EAAEinB,EAAMp0B,EAAG8oB,OAEhC,GACAkE,GA0DJ,SAASqH,IACP,YAAyB,IAAXC,EA6MhB,SAASC,EAASvrB,GAChB,OAAOA,aAAeirB,EAGxB,SAASntB,EAAQI,GACf,MAA+B,mBAAxB,GAAGyH,SAASrO,KAAK4G,GAG1B,SAASstB,EAASttB,GAEhB,OAAOmtB,KAAkBC,EAAOE,SAASttB,GAGpC,SAASutB,EAAYnW,EAAO9b,GACjC,MAAO,CACLkyB,QAAQ,EACRpW,MAAOA,EACP9b,MAAOA,EACPmyB,UAAW,EACXC,SAAU,IAIP,SAASC,EAAYvW,EAAOsW,GAIjC,OAHK9tB,EAAQ8tB,KACXA,EAAW,CAACA,IAEP,CACLF,QAAQ,EACRpW,OAAQ,EACR9b,MAAO,KACPmyB,SAAUrW,EACVsW,SAAUA,GAId,SAASE,EAAa/zB,EAAQ4kB,GAC5B,IAAKA,EACH,OAAO5kB,EAET,GAAIA,EAAO4zB,SAAWhP,EAAKgP,SACzB,OAAO5zB,EAET,IAAI6zB,EACF7zB,EAAO4zB,WAAahP,EAAKgP,SAiC7B,SAAeprB,EAAI6a,GAEjB,IADA,IAAIpb,EAAM,GACDhJ,EAAI,EAAGA,EAAIuJ,EAAGrJ,OAAQF,IAC7BgJ,EAAIO,EAAGvJ,KAAM,EAEf,IAAK,IAAIkB,EAAI,EAAGA,EAAIkjB,EAAGlkB,OAAQgB,IAC7B8H,EAAIob,EAAGljB,KAAM,EAEf,IAAIqa,EAAO,GACX,IAAK,IAAIiO,KAAKxgB,GACR,IAAG3I,eAAeC,KAAK0I,EAAKwgB,IAC9BjO,EAAK/a,KAAKgpB,GAId,OADAjO,EAAKE,OACEF,EA/CDwZ,CAAMh0B,EAAO6zB,SAAUjP,EAAKiP,UAC5BjP,EAAKiP,SACX,MAAO,CACLF,OAAQ3zB,EAAO2zB,OACfpW,MAAOvd,EAAOud,MACd9b,MAAOzB,EAAOyB,MACdmyB,SAAUhP,EAAKgP,SACfC,SAAUA,GAId,SAASI,EAAoBnX,EAAO7d,GAClC,GAAIw0B,EAAS3W,GACX,MAAO,CACLjG,OAAQ5X,EACRi1B,MAAO,EACPC,QAAS,GAGb,IAAIC,EAAQtX,EAAMta,MAAM,EAAGvD,GAAGihB,MAAM,MAKpC,MAAO,CACLrJ,OAAQ5X,EACRi1B,KAJkBE,EAAMj1B,OAKxBg1B,OAJoBC,EAAMA,EAAMj1B,OAAS,GAAGA,OAAS,GA2BzD,SAASk1B,EAAajyB,GACpB,IAAKoxB,EAASpxB,GACZ,MAAM,IAAIyE,MAAM,iBAAmBzE,GAIvC,SAASf,EAAIyb,EAAO7d,GAClB,MAAqB,iBAAV6d,EACFA,EAAMwX,OAAOr1B,GAEf6d,EAAM7d,GAUf,SAASs1B,EAAapuB,GACpB,GAAiB,iBAANA,EACT,MAAM,IAAIU,MAAM,iBAAmBV,GAIvC,SAASquB,EAAaruB,GACpB,KAAMA,aAAama,QACjB,MAAM,IAAIzZ,MAAM,iBAAmBV,GAGrC,IADA,IAAIiG,EAAI0R,EAAM3X,GACLlH,EAAI,EAAGA,EAAImN,EAAEjN,OAAQF,IAAK,CACjC,IAAI6B,EAAIsL,EAAEkoB,OAAOr1B,GAIjB,GAAU,MAAN6B,GAAmB,MAANA,GAAmB,MAANA,EAC5B,MAAM,IAAI+F,MAAM,4BAA8B/F,EAAI,MAAQqF,IAKhE,SAASsuB,EAAetuB,GACtB,GAAiB,mBAANA,EACT,MAAM,IAAIU,MAAM,mBAAqBV,GAIzC,SAASuuB,EAAavuB,GACpB,GAAiB,iBAANA,EACT,MAAM,IAAIU,MAAM,iBAAmBV,GAahC,SAASwuB,EAAOC,EAAQC,GAC7B,OAAO,IAAI/uB,MAAM+uB,EAAS,GAAGzuB,KAAKwuB,GAU7B,SAASE,EAAQ5kB,EAAK6kB,EAAKC,GAChC,IAAItkB,EAAMqkB,EAAM7kB,EAAI/Q,OACpB,OAAIuR,GAAO,EACFR,EAEFykB,EAAOK,EAAMtkB,GAAOR,EA4BtB,SAAS+kB,EAAyBh2B,EAAGi2B,EAAQC,EAAOh2B,GACzD,MAAO,CAELkK,KAAMpK,EAAIi2B,EAAS,EAAIj2B,EAAIi2B,EAAS,EACpCE,GAAIn2B,EAAIk2B,EAAQh2B,EAASA,EAASF,EAAIk2B,GAoBnC,SAASE,EAAUvY,EAAOwY,GAC/B,IAIInB,EACAoB,EACAnB,EACAoB,EACAC,EARAlY,EAAQ+X,EAAM/X,MACdte,EAAIse,EAAM1G,OAEV6e,EAAuB,EAO3B,GAAIz2B,IAAM6d,EAAM3d,OACd,MAAO,2BAGT,GAAIs0B,EAAS3W,GAAQ,CACnB,IAAI6Y,EAAyB12B,EAAKA,EAzFnB,EA0FX22B,EAAkB32B,EAAI02B,EACtBE,EAAYZ,EACdU,EA3FYG,GA6FZC,GACAjZ,EAAM3d,QAKJ62B,EAAYpyB,GAAI,SAASqyB,GAC3B,OAAOryB,GAAI,SAASsyB,GAElB,OAAOpB,EAAQoB,EAAUtoB,SAAS,IAAK,EAAG,OACzCqoB,KAhFT,SAAkBhK,EAAKtF,GACrB,IAAIxnB,EAAS8sB,EAAI9sB,OACbqoB,EAAS,GACT2O,EAAa,EAEjB,GAAIh3B,GAAUwnB,EACZ,MAAO,CAACsF,EAAIzpB,SAGd,IAAK,IAAIvD,EAAI,EAAGA,EAAIE,EAAQF,IACrBuoB,EAAO2O,IACV3O,EAAO/nB,KAAK,IAGd+nB,EAAO2O,GAAY12B,KAAKwsB,EAAIhtB,KAEvBA,EAAI,GAAK0nB,GAAc,GAC1BwP,IAIJ,OAAO3O,EAqDe4O,CADRtZ,EAAMta,MAAMqzB,EAAUxsB,KAAMwsB,EAAUT,IACftnB,SAASnP,KAlG7B,IA2Gf62B,EAlDG,SAA0BK,GAE/B,OAAuB,IAAnBA,EAAUxsB,MAA+B,IAAjBwsB,EAAUT,GAC7B,CACL/rB,KAAMwsB,EAAUxsB,KAChB+rB,GAAIS,EAAUT,IAIX,CACL/rB,KAAMwsB,EAAUxsB,KAnED,EAqEf+rB,GAAIrlB,KAAKgE,MAAM8hB,EAAUT,GArEV,IA2GHiB,CAAiBR,GAC7BN,EAAqBI,EA5GN,EA6GfxB,EAA2B,EAAlByB,EAGLA,GAAmB,IACrBzB,GAAU,GAGZuB,EAAuB,EACvBtB,EAAQxwB,GAAI,SAAS0yB,GACnB,OAAOA,EAASn3B,QAAU,EACtBm3B,EAASlwB,KAAK,KACdkwB,EAAS9zB,MAAM,EAAG,GAAG4D,KAAK,KAAO,KAAOkwB,EAAS9zB,MAAM,GAAG4D,KAAK,OAClE4vB,IACHP,GACyD,GAAtDD,EAAUJ,GAAK,EAAII,EAAUJ,GAAK,EAAII,EAAUJ,KACjDxnB,SAAS,IAAIzO,QAEiB,IAC9Bs2B,EAA4B,OAEzB,CACL,IAAIc,EAAazZ,EAAMoD,MAAM,2BAC7BiU,EAAS5W,EAAM4W,OAAS,EACxBoB,EAAqBhY,EAAM2W,KAAO,EAClCsB,EAAYP,EACVM,EAxIuB,EACD,EA0ItBgB,EAAWp3B,QAGbi1B,EAAQmC,EAAW/zB,MAAMgzB,EAAUnsB,KAAMmsB,EAAUJ,IACnDK,EAA4BD,EAAUJ,GAAGxnB,WAAWzO,OAGtD,IAAIq3B,EAA4BjB,EAAqBC,EAAUnsB,KAkD/D,OAhDIoqB,EAAS3W,KACX2Y,GACyD,GAAtDD,EAAUJ,GAAK,EAAII,EAAUJ,GAAK,EAAII,EAAUJ,KACjDxnB,SAAS,IAAIzO,QAEiB,IAC9Bs2B,EAA4B,GAILztB,GACzB,SAAS8C,EAAK2rB,EAAYlZ,GACxB,IAEImZ,EAFAC,EAAkBpZ,IAAUiZ,EAC5BI,EAASD,EAAkB,KA5Jb,KA6KlB,OAbED,EADEjD,EAAS3W,GACOgY,GACY,GAA1BU,EAAUnsB,KAAOkU,IAAY3P,SAAS,IACxC6nB,EACA,KAGgBX,GACfU,EAAUnsB,KAAOkU,EAAQ,GAAG3P,WAC7B6nB,EACA,KAIG,GAAG3pB,OACRhB,EACA,CAAC8rB,EAASF,EAAkB,MAAQD,GACpCE,EACI,CAjLY,KAmLRhC,EAAO,IAAKc,GACZ,MACAX,EAAQ,GAAIX,EAAQ,KACpBQ,EAAO,IAAKe,IAEhB,MAGR,GACAtB,GAG0BhuB,KAAK,MAe5B,SAAS0X,EAAM+Y,GACpB,IAAIt2B,EAAI,GAAKs2B,EACb,OAAOt2B,EAAEiC,MAAMjC,EAAEyF,YAAY,KAAO,GAG/B,SAAS8wB,EAAeD,GAC7B,OAAOvW,OAAO,OAASuW,EAAG9R,OAAS,IAAKjH,EAAM+Y,IAKzC,SAASE,IAGd,IAFA,IAAIC,EAAU,GAAGx0B,MAAMjD,KAAK4gB,WACxB8W,EAAaD,EAAQ73B,OAChBgB,EAAI,EAAGA,EAAI82B,EAAY92B,GAAK,EACnCk0B,EAAa2C,EAAQ72B,IAEvB,OAAO+yB,GAAU,SAASpW,EAAO7d,GAG/B,IAFA,IAAIe,EACAk3B,EAAQ,IAAIpxB,MAAMmxB,GACb92B,EAAI,EAAGA,EAAI82B,EAAY92B,GAAK,EAAG,CAEtC,KADAH,EAAS+zB,EAAaiD,EAAQ72B,GAAG4e,EAAEjC,EAAO7d,GAAIe,IAClC2zB,OACV,OAAO3zB,EAETk3B,EAAM/2B,GAAKH,EAAOyB,MAClBxC,EAAIe,EAAOud,MAEb,OAAOwW,EAAaL,EAAYz0B,EAAGi4B,GAAQl3B,MA4DxC,SAASm3B,IACd,IAAI5a,EAAO,GAAG/Z,MAAMjD,KAAK4gB,WACzB,GAAoB,IAAhB5D,EAAKpd,OACP,MAAM,IAAI0H,MAAM,sCAElB,IAAIuwB,EAAS7a,EAAK8a,MAElB,OADA5C,EAAe2C,GACRL,EAAIj3B,MAAM,KAAMyc,GAAM3Y,KAAI,SAAS0zB,GACxC,OAAOF,EAAOt3B,MAAM,KAAMw3B,MAoBvB,SAASC,IACd,IAAIP,EAAU,GAAGx0B,MAAMjD,KAAK4gB,WACxB8W,EAAaD,EAAQ73B,OACzB,GAAmB,IAAf83B,EACF,OAAOO,EAAK,mBAEd,IAAK,IAAIr3B,EAAI,EAAGA,EAAI82B,EAAY92B,GAAK,EACnCk0B,EAAa2C,EAAQ72B,IAEvB,OAAO+yB,GAAU,SAASpW,EAAO7d,GAE/B,IADA,IAAIe,EACKG,EAAI,EAAGA,EAAI62B,EAAQ73B,OAAQgB,GAAK,EAEvC,IADAH,EAAS+zB,EAAaiD,EAAQ72B,GAAG4e,EAAEjC,EAAO7d,GAAIe,IACnC2zB,OACT,OAAO3zB,EAGX,OAAOA,KASJ,SAASy3B,EAAOC,EAAQC,GAI7B,OAHAtD,EAAaqD,GACbrD,EAAasD,GAENR,EAAOO,EADFC,EAAUC,KAAKF,GAAQG,QACN,SAASv2B,EAAGw2B,GACvC,MAAO,CAACx2B,GAAGwK,OAAOgsB,MAmRf,SAASlD,EAAO1kB,GACrBwkB,EAAaxkB,GACb,IAAI2jB,EAAW,IAAM3jB,EAAM,IAC3B,OAAOgjB,GAAU,SAASpW,EAAO7d,GAC/B,IAAIkB,EAAIlB,EAAIiR,EAAI/Q,OACZkJ,EAAOyU,EAAMta,MAAMvD,EAAGkB,GAC1B,OAAIkI,IAAS6H,EACJwjB,EAAYvzB,EAAGkI,GAEfyrB,EAAY70B,EAAG40B,MA4BrB,SAASkE,EAAOlB,EAAImB,GACzBxD,EAAaqC,GACT1W,UAAUhhB,QAAU,EACtBo1B,EAAayD,GAEbA,EAAQ,EAEV,IAAIC,EAAWnB,EAAeD,GAC1BhD,EAAW,GAAKgD,EACpB,OAAO3D,GAAU,SAASpW,EAAO7d,GAC/B,IAAIme,EAAQ6a,EAAS5a,KAAKP,EAAMta,MAAMvD,IACtC,GAAIme,EAAO,CACT,GAAI,GAAK4a,GAASA,GAAS5a,EAAMje,OAAQ,CACvC,IAAI+4B,EAAY9a,EAAM,GAClB+a,EAAa/a,EAAM4a,GACvB,OAAOtE,EAAYz0B,EAAIi5B,EAAU/4B,OAAQg5B,GAI3C,OAAOrE,EAAY70B,EADjB,2BAA6Bme,EAAMje,OAAS,QAAU00B,GAG1D,OAAOC,EAAY70B,EAAG40B,MAInB,SAASuE,EAAQ32B,GACtB,OAAOyxB,GAAU,SAASpW,EAAO7d,GAC/B,OAAOy0B,EAAYz0B,EAAGwC,MAInB,SAAS+1B,EAAK3D,GACnB,OAAOX,GAAU,SAASpW,EAAO7d,GAC/B,OAAO60B,EAAY70B,EAAG40B,MAInB,SAASwE,EAAUlyB,GACxB,GAAIqtB,EAASrtB,GACX,OAAO+sB,GAAU,SAASpW,EAAO7d,GAC/B,IAAIe,EAASmG,EAAE4Y,EAAEjC,EAAO7d,GAGxB,OAFAe,EAAOud,MAAQte,EACfe,EAAOyB,MAAQ,GACRzB,KAEJ,GAAiB,iBAANmG,EAChB,OAAOkyB,EAAUzD,EAAOzuB,IACnB,GAAIA,aAAama,OACtB,OAAO+X,EAAUN,EAAO5xB,IAE1B,MAAM,IAAIU,MAAM,oCAAsCV,GAcjD,SAASqZ,EAAK7S,GAEnB,OADA8nB,EAAe9nB,GACRumB,GAAU,SAASpW,EAAO7d,GAC/B,IAAI+1B,EAAO3zB,EAAIyb,EAAO7d,GACtB,OAAIA,EAAI6d,EAAM3d,QAAUwN,EAAUqoB,GACzBtB,EAAYz0B,EAAI,EAAG+1B,GAEnBlB,EAAY70B,EAAG,6BAA+B0N,MAKpD,SAAS2rB,EAAMpoB,GAEpB,IADA,IAAI2jB,EAAW3jB,EAAIgQ,MAAM,IAChBlB,EAAM,EAAGA,EAAM6U,EAAS10B,OAAQ6f,IACvC6U,EAAS7U,GAAO,IAAM6U,EAAS7U,GAAO,IAExC,OAAOQ,GAAK,SAASX,GACnB,OAAO3O,EAAIE,QAAQyO,IAAO,KACzB0Z,KAAK1E,GAGH,SAAS2E,EAAOtoB,GACrB,OAAOsP,GAAK,SAASX,GACnB,OAAO3O,EAAIE,QAAQyO,GAAM,KACxB0Z,KAAK,YAAcroB,EAAM,KAcvB,SAASuoB,EAAU9rB,GAGxB,OAFA8nB,EAAe9nB,GAERumB,GAAU,SAASpW,EAAO7d,GAE/B,IADA,IAAIkB,EAAIlB,EACDkB,EAAI2c,EAAM3d,QAAUwN,EAAUtL,EAAIyb,EAAO3c,KAC9CA,IAEF,OAAOuzB,EAAYvzB,EAAG2c,EAAMta,MAAMvD,EAAGkB,OAIlC,SAASu4B,EAAKH,EAAMnsB,GACrB+T,UAAUhhB,OAAS,IACrBiN,EAAImsB,EACJA,OAAOj0B,GAGT,IAAIozB,EAASxE,GAAU,SAASpW,EAAO7d,GAErC,OADAy4B,EAAO3Y,EAAI3S,IAAI2S,EACR2Y,EAAO3Y,EAAEjC,EAAO7d,MAGzB,OAAIs5B,EACKb,EAAOa,KAAKA,GAEZb,EAnbX3Y,EAAElJ,MAAQ,SAASiH,GACjB,GAAqB,iBAAVA,IAAuB2W,EAAS3W,GACzC,MAAM,IAAIjW,MACR,iEAGJ,IAAI7G,EAAS6C,KAAKshB,KAAKwU,GAAK5Z,EAAEjC,EAAO,GACrC,OAAI9c,EAAO2zB,OACF,CACLA,QAAQ,EACRlyB,MAAOzB,EAAOyB,OAGX,CACLkyB,QAAQ,EACRpW,MAAO0W,EAAoBnX,EAAO9c,EAAO4zB,UACzCC,SAAU7zB,EAAO6zB,WAMrB9U,EAAExI,SAAW,SAASrG,GACpB,IAAIlQ,EAAS6C,KAAKgT,MAAM3F,GACxB,GAAIlQ,EAAO2zB,OACT,OAAO3zB,EAAOyB,MAEd,IAhMwBqb,EAAOwY,EA5LJzB,EA4XvB+E,GAhMoB9b,EAgMF5M,EAhMSolB,EAgMJt1B,EA/LtB,CACL,KACA,qBAAuB20B,EAAO,IAAK,IACnC,OACAU,EAAUvY,EAAOwY,GACjB,QAlM2BzB,EAmMZyB,EAAMzB,SAlMC,IAApBA,EAAS10B,OACJ,gBAAkB00B,EAAS,GAE7B,sCAAwCA,EAASztB,KAAK,OAgM3D,MACAA,KAAK,KAwLDyyB,EAAM,IAAIhyB,MAAM+xB,GAGpB,MAFAC,EAAIC,KAAO,iBACXD,EAAI74B,OAASA,EACP64B,GAIV9Z,EAAEga,GAAK,SAASC,GACd,OAAOzB,EAAI10B,KAAMm2B,IAGnBja,EAAEwB,KAAO,SAASmX,GAChB,OAAO70B,KAAKo2B,KAAKvB,EAAQA,IAG3B3Y,EAAEka,KAAO,SAASC,EAAYC,GAC5B,OAAOhC,EAAO+B,EAAYr2B,KAAMs2B,GAAa,SAASpP,EAAMqP,GAC1D,OAAOA,MAIXra,EAAEsa,KAAO,SAASC,GAChB,OAAOA,EAAQz2B,OAGjBkc,EAAE6Y,KAAO,SAAShgB,GAEhB,OADAyc,EAAazc,GACNmf,EAAIl0B,KAAM+U,GAAMhU,KAAI,SAAS0zB,GAClC,OAAOA,EAAQ,OAInBvY,EAAE8Y,KAAO,WACP,IAAIvP,EAAOzlB,KAEX,OAAOqwB,GAAU,SAASpW,EAAO7d,GAI/B,IAHA,IAAIi4B,EAAQ,GACRl3B,OAASsE,IAEJ,CAEP,KADAtE,EAAS+zB,EAAazL,EAAKvJ,EAAEjC,EAAO7d,GAAIe,IAC7B2zB,OAUT,OAAOI,EAAaL,EAAYz0B,EAAGi4B,GAAQl3B,GAT3C,GAAIf,IAAMe,EAAOud,MACf,MAAM,IAAI1W,MACR,kIAIJ5H,EAAIe,EAAOud,MACX2Z,EAAMz3B,KAAKO,EAAOyB,YAQ1Bsd,EAAEwa,QAAU,SAAS5B,GAEnB,OADAjD,EAAaiD,GACN90B,KAAKe,KAAI,SAAS2Y,GAEvB,GA/eJ,SAAqBpW,GACnB,IAAKJ,EAAQI,GACX,MAAM,IAAIU,MAAM,iBAAmBV,GA4enCqzB,CAAYjd,GACRA,EAAKpd,OAAQ,CACfu1B,EAAanY,EAAK,IAElB,IADA,IAAIhc,EAAIgc,EAAK,GACJtd,EAAI,EAAGA,EAAIsd,EAAKpd,OAAQF,IAC/By1B,EAAanY,EAAKtd,IAClBsB,GAAKo3B,EAAYpb,EAAKtd,GAExB,OAAOsB,EAEP,MAAO,OAKbwe,EAAE0a,IAAM,WACN,OAAO52B,KAAK02B,QAAQ,KAGtBxa,EAAEoU,MAAQ,SAAS3iB,EAAKsD,GACtB,IAAIwU,EAAOzlB,KAMX,OALIsd,UAAUhhB,OAAS,IACrB2U,EAAMtD,GAER+jB,EAAa/jB,GACb+jB,EAAazgB,GACNof,GAAU,SAASpW,EAAO7d,GAI/B,IAHA,IAAIi4B,EAAQ,GACRl3B,OAASsE,EACTo1B,OAAap1B,EACR6uB,EAAQ,EAAGA,EAAQ3iB,EAAK2iB,GAAS,EAAG,CAG3C,GADAuG,EAAa3F,EADb/zB,EAASsoB,EAAKvJ,EAAEjC,EAAO7d,GACWy6B,IAC9B15B,EAAO2zB,OAIT,OAAO+F,EAHPz6B,EAAIe,EAAOud,MACX2Z,EAAMz3B,KAAKO,EAAOyB,OAKtB,KAAO0xB,EAAQrf,IAEb4lB,EAAa3F,EADb/zB,EAASsoB,EAAKvJ,EAAEjC,EAAO7d,GACWy6B,GAC9B15B,EAAO2zB,QAHOR,GAAS,EAIzBl0B,EAAIe,EAAOud,MACX2Z,EAAMz3B,KAAKO,EAAOyB,OAKtB,OAAOsyB,EAAaL,EAAYz0B,EAAGi4B,GAAQwC,OAI/C3a,EAAE/e,OAAS,SAAS0K,GAClB,OAAO7H,KAAKe,KAAI,WACd,OAAO8G,MAIXqU,EAAE4a,OAAS,SAAS13B,GAClB,OAAOY,KAAKswB,MAAM,EAAGlxB,IAGvB8c,EAAE6a,QAAU,SAAS33B,GACnB,OAAOk1B,EAAOt0B,KAAKswB,MAAMlxB,GAAIY,KAAKg1B,QAAQ,SAASgC,EAAM/M,GACvD,OAAO+M,EAAK/tB,OAAOghB,OAIvB/N,EAAEnb,IAAM,SAASk2B,GACfrF,EAAeqF,GACf,IAAIxR,EAAOzlB,KACX,OAAOqwB,GAAU,SAASpW,EAAO7d,GAC/B,IAAIe,EAASsoB,EAAKvJ,EAAEjC,EAAO7d,GAC3B,OAAKe,EAAO2zB,OAGLI,EAAaL,EAAY1zB,EAAOud,MAAOuc,EAAG95B,EAAOyB,QAASzB,GAFxDA,MAMb+e,EAAEgb,UAAY,SAASD,GACrBrF,EAAeqF,GACf,IAAIxR,EAAOzlB,KACX,OAAOqwB,GAAU,SAASpW,EAAO7d,GAC/B,IAAIe,EAASsoB,EAAKzS,MAAMikB,EAAGhd,EAAMta,MAAMvD,KACvC,OAAKe,EAAO2zB,OAGLD,EAAYz0B,EAAI6d,EAAM3d,OAAQa,EAAOyB,OAFnCzB,MAMb+e,EAAEib,OAAS,SAAS5tB,EAAG6tB,GAGrB,OAFAxF,EAAeroB,GACfqoB,EAAewF,GACRp3B,KAAKk3B,UAAU3tB,GAAGxI,IAAIq2B,IAG/Blb,EAAEoF,KAAO,SAASvM,GAChB,OAAOmf,EAAIl0B,KAAM+U,GAAMhU,KAAI,SAAS0zB,GAClC,OAAOA,EAAQ,OAInBvY,EAAEmb,KAAO,WACP,OAAO/C,EAAO5Z,EAAO1a,KAAM0a,GAAO,SAASoH,EAAOljB,EAAO04B,GACvD,MAAO,CACLxV,MAAOA,EACPljB,MAAOA,EACP04B,IAAKA,OAKXpb,EAAEtT,KAAO,SAASzK,GAChB,OAAOm2B,EAAO5Z,EAAO1a,KAAM0a,GAAO,SAASoH,EAAOljB,EAAO04B,GACvD,MAAO,CACLn5B,KAAMA,EACNS,MAAOA,EACPkjB,MAAOA,EACPwV,IAAKA,OAKXpb,EAAEqb,MAAQ,SAASzC,GACjB,OAxOK,SAAeD,EAAQC,GAE5B,OAAOF,EAAOC,EAAQC,GAAWoB,GAAGX,EAAQ,KAsOrCgC,CAAMv3B,KAAM80B,IAGrB5Y,EAAE0Y,OAAS,SAASE,GAClB,OAAOF,EAAO50B,KAAM80B,IAGtB5Y,EAAEsZ,UAAY,SAASlyB,GACrB,OAAOtD,KAAKshB,KAAKkU,EAAUlyB,KAG7B4Y,EAAEsb,cAAgB,SAASl0B,GACzB,OAAOtD,KAAKshB,MAoIZkQ,EAD4BqD,EAnIGvxB,GAqIxB+sB,GAAU,SAASpW,EAAO7d,GAC/B,IAAIe,EAAS03B,EAAO3Y,EAAEjC,EAAO7d,GACzBq7B,EAAOxd,EAAMta,MAAMvD,EAAGe,EAAOud,OACjC,OAAOvd,EAAO2zB,OACVG,EAAY70B,EAAG,QAAUq7B,EAAO,KAChC5G,EAAYz0B,EAAG,WAPhB,IAAuBy4B,GAhI9B3Y,EAAEwZ,KAAO,SAAS1E,GACX9tB,EAAQ8tB,KACXA,EAAW,CAACA,IAEd,IAAIvL,EAAOzlB,KACX,OAAOqwB,GAAU,SAASpW,EAAO7d,GAC/B,IAAIs7B,EAAQjS,EAAKvJ,EAAEjC,EAAO7d,GAI1B,OAHKs7B,EAAM5G,SACT4G,EAAM1G,SAAWA,GAEZ0G,MAIXxb,EAAEyb,SAAW,SAASx6B,GACpB,OAAO6C,KAAKk2B,GAAGX,EAAQp4B,KAGzB+e,EAAE0b,GAAK,SAASl3B,GACd,OAAO4zB,EAAO5zB,EAAOV,MAAM,SAASuJ,EAAGjG,GACrC,OAAOiG,EAAEjG,OAIb4Y,EAAE2b,MAAQ,SAAStuB,GACjB,IAAIkc,EAAOzlB,KACX,OAAOqwB,GAAU,SAASpW,EAAO7d,GAC/B,IAAIe,EAASsoB,EAAKvJ,EAAEjC,EAAO7d,GAC3B,OAAKe,EAAO2zB,OAILI,EADU3nB,EAAEpM,EAAOyB,OACKsd,EAAEjC,EAAO9c,EAAOud,OAAQvd,GAH9CA,MAyLb+e,EAAEjT,OAASiT,EAAEga,GACbha,EAAE5U,MALF,WACE,OAAOqtB,EAAK,uBAKdzY,EAAE4b,GAAKvC,EACPrZ,EAAE,mBAAqBA,EAAE0b,GACzB1b,EAAE,sBAAwBA,EAAE2b,MAC5B3b,EAAE,uBAAyBA,EAAEjT,OAC7BiT,EAAE,sBAAwBA,EAAE5U,MAC5B4U,EAAE,mBAAqBA,EAAE4b,GACzB5b,EAAE,oBAAsBA,EAAEnb,IAInB,MAAM2Z,EAAQ2V,GAAU,SAASpW,EAAO7d,GAC7C,OAAOy0B,EAAYz0B,EAAGg1B,EAAoBnX,EAAO7d,OAGtC27B,EAAM1H,GAAU,SAASpW,EAAO7d,GAC3C,OAAIA,GAAK6d,EAAM3d,OACN20B,EAAY70B,EAAG,sBAEjBy0B,EAAYz0B,EAAI,EAAGoC,EAAIyb,EAAO7d,OAG1B47B,EAAM3H,GAAU,SAASpW,EAAO7d,GAC3C,OAAOy0B,EAAY5W,EAAM3d,OAAQ2d,EAAMta,MAAMvD,OAGlC05B,EAAMzF,GAAU,SAASpW,EAAO7d,GAC3C,OAAIA,EAAI6d,EAAM3d,OACL20B,EAAY70B,EAAG,OAEjBy0B,EAAYz0B,EAAG,SAGX67B,EAAQ/C,EAAO,SAASQ,KAAK,WAE7BwC,GADShD,EAAO,UAAUQ,KAAK,mBACtBR,EAAO,UAAUQ,KAAK,aAC/ByC,EAAUjD,EAAO,WAAWQ,KAAK,oBACjC0C,EAAgBlD,EAAO,OAAOQ,KAAK,uBACnC2C,EAAanD,EAAO,OAAOQ,KAAK,cAChC4C,EAAKvG,EAAO,MACZwG,EAAKxG,EAAO,MAEZyG,EAAU9D,EADH3C,EAAO,QACMwG,EAAID,GAAI5C,KAAK,WAC3BhB,EAAI8D,EAAS1C,K,sDCzxChC,kJAoFO,SAAS2C,EAAY13B,EAAK7B,EAAKqmB,GAClC,QAAIxkB,EAAIqV,IAAIlX,KACRqmB,EAAa1R,SAAW9S,EAAIvC,IAAIU,IACzB,GAIR,SAASw5B,EAASj0B,EAAG4R,GACxB,OAAIA,EAAID,IAAI3R,KAGZ4R,EAAIxI,IAAIpJ,IACD,GAEJ,SAASk0B,EAAUC,EAAMhT,EAAGnhB,GAC/B,GAAIm0B,EAAKxiB,IAAIwP,GACT,MAAM,IAAI5hB,MAAM,0DAA4D4hB,GAEhFgT,EAAKviB,IAAIuP,EAAGnhB,GAET,SAASo0B,EAAgB93B,EAAK7B,GACjC,GAAI6B,EAAIqV,IAAIlX,GACR,OAAO6B,EAAIvC,IAAIU,GAGf,MAAM,IAAI8E,MAAM,kBAAkB9E,2C,6BC5GnC,IAAI45B,EAiCX,SAASC,EAASvuB,EAAUmJ,GACxB,OAAQA,GACJ,KAAK,EAAG,OAAOnJ,EAAW,CAAC,EAAG,KAAO,EAAE,IAAK,KAC5C,KAAK,GAAI,OAAOA,EAAW,CAAC,EAAG,OAAS,EAAE,MAAO,OACjD,KAAK,GAAI,OAAOA,EAAW,CAAC,EAAG,YAAc,EAAE,WAAY,YAC3D,QAAS,MAAM,IAAIxG,MAAM,sBA6B1B,SAASg1B,EAAQ3rB,EAAK4F,EAAOjI,GAChC,MACMnD,EADe,8CACI2S,KAAKnN,EAAIsM,QAAQ,KAAM,KAChD,GAAW,MAAP9R,EAAa,CACb,MAAe,CAAW,CAAEksB,EAAQ/kB,GAAUnH,EAG9C,IAjCR,SAA0BmD,GACtB,OAAQA,GACJ,KAAK,EAAG,MAAO,SACf,KAAK,EAAG,MAAO,SACf,KAAK,GAAI,MAAO,SAChB,KAAK,GAAI,MAAO,eAChB,QACI,MAAM,IAAIhH,MAAM,kBAyBEi1B,CADtBjuB,EAAQA,GArBhB,SAAkB+oB,EAAQ9gB,GACtB,GAAIA,EAAQ6lB,EAAaI,kBACrB,OAAO,GAGP,OAAQnF,GACJ,IAAK,KACL,IAAK,KAAM,OAAO,EAClB,IAAK,KACL,IAAK,KAAM,OAAO,EAClB,IAAK,KACL,IAAK,KAAM,OAAO,GAClB,QAAS,OAAO,IASHoF,CAASpF,EAAQ9gB,IAEf0J,KAAK3N,GACpB,OAnDZ,SAAuBoqB,EAAYpuB,GAC/B,MAAe,CAAEsI,EAAMygB,EAAQ/kB,GAAUoqB,EACzC,MAAO,CACH9lB,KAAMA,GAAQ,GACdygB,OAAQA,GAAU,GAClB/kB,SACAhE,SA6CWquB,CAAcxxB,EAAKmD,GAGlC,OAAO,KAEJ,SAASgI,EAAM3F,EAAK4F,EAAOzI,EAAUmJ,EAAS3I,GACjD,MAAMnD,EAAMmxB,EAAQ3rB,EAAK4F,EAAOjI,GAChC,GAAW,MAAPnD,EAAa,CACb,IAAIpD,EAAImoB,OAAOhf,SAAS/F,EAAIyL,KAAOzL,EAAImH,OAAQnH,EAAImD,OACnD,IAAK4hB,OAAOvgB,MAAM5H,GAAI,CAClB,MAAO60B,EAAMC,GAAQR,GAAS,EAAMplB,IAC/BnJ,GAA0B,KAAd3C,EAAImD,OAAgBvG,GAAK60B,GAAQ70B,GAAK80B,IACnD90B,EAAIA,GAAM,GAAKkP,GAAa,GAAKA,GAErC,MAAOhG,EAAKsD,GAAO8nB,EAASvuB,EAAUmJ,GACtC,GAAIlP,GAAKkJ,GAAOlJ,GAAKwM,EACjB,OAAOxM,GAInB,MAAM,IAAIT,MAAM,6CAEb,SAAS0P,EAASrG,EAAK4F,EAAOzI,EAAUmJ,EAASC,GACpD,IAEI,OADAA,EAASC,SAAWb,EAAM3F,EAAK4F,EAAOzI,EAAUmJ,IACzC,EAEX,MAAOjQ,GACH,OAAO,GASR,SAAS81B,EAAuBl2B,GACnC,OAAc,aAAPA,EAAoBA,GAAKA,EAlHpC,wIAEA,SAAWw1B,GAWPA,EAAaA,EAAgC,kBAAI,KAAO,oBAX5D,CAsBGA,IAAiBA,EAAe,M,gLCnB/BW,EAAI,CACJ,cAAgB,OAAO,YAAiB,CAACz5B,KAAKtC,EAAGsC,KAAKoK,GAAGnB,OAAOjJ,KAAK/B,KACrE,OAAOqF,GAAK,OAAQtD,KAAK05B,IAAIp2B,IAC7B,UAAUA,GAAK,OAAOtD,KAAK05B,IAAIp2B,IAC/B,C,MAAC,KACG,MAAMq2B,EAAQ35B,KACd,MAAO,CACHkL,SAAUC,GAAKwuB,EAAMrpB,IAAInF,GACzBC,YAAaC,GAAMsuB,EAAMvuB,YAAYC,GACrCE,cAAeC,GAAMmuB,EAAMpuB,cAAcC,GACzCC,QAASD,GAAMmuB,EAAMluB,QAAQD,GAC7BE,MAAO,KAAOkhB,OAAO+M,KAAW,GAAG5uB,SAAS,OAkDxD6uB,EAAO,YAAaC,EAAUD,EAAO,WAAYE,EAAaD,EAAU,iBAAuHE,EAAU,uCA2DzM,SAAS/mB,EAAM1P,EAAGlE,GACd,IAAIgL,EAAGhO,EAAG49B,EACV,IAAKD,EAAQpd,KAAKvd,GACd,MAAM4E,MAAM61B,EAAU,UAqB1B,IAlBAv2B,EAAE5F,EAAmB,KAAf0B,EAAEqyB,OAAO,IAAaryB,EAAIA,EAAEO,MAAM,IAAK,GAAK,GAE7CyK,EAAIhL,EAAEmO,QAAQ,OAAS,IACxBnO,EAAIA,EAAEua,QAAQ,IAAK,MAElBvd,EAAIgD,EAAEod,OAAO,OAAS,GAEnBpS,EAAI,IACJA,EAAIhO,GACRgO,IAAMhL,EAAEO,MAAMvD,EAAI,GAClBgD,EAAIA,EAAEoO,UAAU,EAAGpR,IAEdgO,EAAI,IAETA,EAAIhL,EAAE9C,QAEV09B,EAAK56B,EAAE9C,OAEFF,EAAI,EAAGA,EAAIgO,GAAKhO,EAAI49B,GAAqB,KAAf56B,EAAEqyB,OAAOr1B,MAClCA,EAIN,GAAIA,GAAK49B,EAEL12B,EAAErF,EAAI,CAACqF,EAAE8G,EAAI,QAMb,IAHA9G,EAAE8G,EAAIA,EAAIhO,EAAI,EACdkH,EAAErF,EAAI,GAEDmM,EAAI,EAAGhO,EAAI49B,GACZ12B,EAAErF,EAAEmM,MAAQhL,EAAEqyB,OAAOr1B,KAQ7B,OADAkH,EAAI22B,EAAM32B,EAAG42B,EAAIC,GAAK,EAAGD,EAAIE,IAWjC,SAASH,EAAM32B,EAAG+H,EAAIgvB,EAAIC,GACtB,IAAIC,EAAKj3B,EAAErF,EAGX,QAvHmL,IAqH/Ko8B,IACAA,EAAKH,EAAIE,IACF,IAAPC,GAAmB,IAAPA,GAAmB,IAAPA,GAAmB,IAAPA,EACpC,MAAMr2B,MAxHyF61B,kCA0HnG,GAAIxuB,EAAK,EACLivB,EACW,IAAPD,IAAaC,KAAUC,EAAG,KAAc,IAAPlvB,IAAoB,IAAPgvB,GAAYE,EAAG,IAAM,GACxD,IAAPF,IAAaE,EAAG,GAAK,GAAe,IAAVA,EAAG,KAAaD,QA7H6H,IA6HrHC,EAAG,MAC7DA,EAAGj+B,OAAS,EACRg+B,GAEAh3B,EAAE8G,EAAI9G,EAAE8G,EAAIiB,EAAK,EACjBkvB,EAAG,GAAK,GAIRA,EAAG,GAAKj3B,EAAE8G,EAAI,OAGjB,GAAIiB,EAAKkvB,EAAGj+B,OAAQ,CAErB,MAAMkS,EAAS+rB,EAAGC,UAAU,CAACC,EAAKte,IAAQA,GAAO9Q,GAAMovB,EAAM,GAAK,EASlE,GARAH,EACW,IAAPD,GAAYE,EAAGlvB,IAAO,GACX,IAAPgvB,IAAaE,EAAGlvB,GAAM,GAAgB,IAAXkvB,EAAGlvB,KACzBivB,QA/IkK,IA+I1JC,EAAGlvB,EAAK,IAAiC,EAAbkvB,EAAGlvB,EAAK,MAC1C,IAAPgvB,IAAaC,IAAS9rB,GAE9B+rB,EAAGj+B,OAAS+O,IAERivB,EAEA,OAASC,EAAGlvB,GAAM,GACdkvB,EAAGlvB,GAAM,EACJA,QACC/H,EAAE8G,EACJmwB,EAAGG,QAAQ,IAKvB,IAAKrvB,EAAKkvB,EAAGj+B,QAASi+B,IAAKlvB,IACvBkvB,EAAG/F,MAEX,OAAOlxB,EAMX,SAASq3B,EAAUr3B,EAAGs3B,EAAeC,GACjC,IAAIzwB,EAAI9G,EAAE8G,EAAG1M,EAAI4F,EAAErF,EAAEsF,KAAK,IAAKnE,EAAI1B,EAAEpB,OAErC,GAAIs+B,EACAl9B,EAAIA,EAAE+zB,OAAO,IAAMryB,EAAI,EAAI,IAAM1B,EAAEiC,MAAM,GAAK,KAAOyK,EAAI,EAAI,IAAM,MAAQA,OAG1E,GAAIA,EAAI,EAAG,CACZ,OAASA,GACL1M,EAAI,IAAMA,EACdA,EAAI,KAAOA,OAEV,GAAI0M,EAAI,EACT,KAAMA,EAAIhL,EACN,IAAKgL,GAAKhL,EAAGgL,KACT1M,GAAK,SAEJ0M,EAAIhL,IACT1B,EAAIA,EAAEiC,MAAM,EAAGyK,GAAK,IAAM1M,EAAEiC,MAAMyK,SAGjChL,EAAI,IACT1B,EAAIA,EAAE+zB,OAAO,GAAK,IAAM/zB,EAAEiC,MAAM,IAEpC,OAAO2D,EAAE5F,EAAI,GAAKm9B,EAAY,IAAMn9B,EAAIA,EAM5C+7B,EAAEld,IAAM,WACJ,IAAIjZ,EAAI,IAAItD,KAAK2U,YAAY3U,MAE7B,OADAsD,EAAE5F,EAAI,EACC4F,GAOXm2B,EAAEC,IAAM,SAAUvuB,GACd,IAAI2vB,EAAOZ,EAAMl6B,KAAK2U,YAAarR,EAAI,IAAI42B,EAAIl6B,MAAuBu6B,GAAhBpvB,EAAI,IAAI+uB,EAAI/uB,GAAS7H,EAAErF,GAAG88B,EAAK5vB,EAAElN,EAAG7B,EAAIkH,EAAE5F,EAAGJ,EAAI6N,EAAEzN,EAAGkoB,EAAItiB,EAAE8G,EAAGrM,EAAIoN,EAAEf,EAE3H,IAAKmwB,EAAG,KAAOQ,EAAG,GACd,OAAQR,EAAG,GAAuBn+B,EAAjB2+B,EAAG,IAAUz9B,EAAL,EAE7B,GAAIlB,GAAKkB,EACL,OAAOlB,EAGX,GAFA0+B,EAAQ1+B,EAAI,EAERwpB,GAAK7nB,EACL,OAAO6nB,EAAI7nB,EAAI+8B,EAAQ,GAAK,EAGhC,IADAx9B,EAAI4P,KAAK+D,IAAIspB,EAAGj+B,OAAQy+B,EAAGz+B,QACtBF,EAAI,EAAGA,EAAIkB,EAAGlB,IAGf,IAFAwpB,EAAIxpB,EAAIm+B,EAAGj+B,OAASi+B,EAAGn+B,GAAK,KAC5B2B,EAAI3B,EAAI2+B,EAAGz+B,OAASy+B,EAAG3+B,GAAK,GAExB,OAAOwpB,EAAI7nB,EAAI+8B,EAAQ,GAAK,EAEpC,OAAO,GAcXrB,EAAE/qB,IAAM,SAAUvD,GACd,IAAI+uB,EAAMl6B,KAAK2U,YAAarR,EAAI,IAAI42B,EAAIl6B,MAAuBklB,GAAhB/Z,EAAI,IAAI+uB,EAAI/uB,GAAQ7H,EAAErF,GACrE+8B,EAAI7vB,EAAElN,EACN2nB,EAAItiB,EAAE5F,GAAKyN,EAAEzN,EAAI,GAAK,EAAG8N,EAAK0uB,EAAIC,GAClC,GAAI3uB,MAASA,GAAMA,EAAK,GAAKA,EA7QxB,IA8QD,MAAMxH,MAAM81B,GAGhB,IAAKkB,EAAE,GACH,MAAMh3B,MA3PkI41B,6BA8P5I,IAAK1U,EAAE,GAGH,OAFA/Z,EAAEzN,EAAIkoB,EACNza,EAAElN,EAAI,CAACkN,EAAEf,EAAI,GACNe,EAEX,IAAI8vB,EAAIC,EAAI97B,EAAGs6B,EAAKyB,EAAIC,EAAKJ,EAAEr7B,QAAS07B,EAAKJ,EAAKD,EAAE1+B,OAAQg/B,EAAKpW,EAAE5oB,OAAQmC,EAAIymB,EAAEvlB,MAAM,EAAGs7B,GAC1FM,EAAK98B,EAAEnC,OAAQk/B,EAAIrwB,EACnBswB,EAAKD,EAAEv9B,EAAI,GAAIy9B,EAAK,EAAGn8B,EAAIiM,GAAMgwB,EAAEpxB,EAAI9G,EAAE8G,EAAIe,EAAEf,GAAK,EAMpD,IALAoxB,EAAE99B,EAAIkoB,EACNA,EAAIrmB,EAAI,EAAI,EAAIA,EAEhB67B,EAAGV,QAAQ,GAEJa,IAAON,GACVx8B,EAAE7B,KAAK,GACX,EAAG,CAEC,IAAKwC,EAAI,EAAGA,EAAI,GAAIA,IAAK,CAErB,GAAI67B,IAAOM,EAAK98B,EAAEnC,QACdo9B,EAAMuB,EAAKM,EAAK,GAAK,OAGrB,IAAKJ,GAAM,EAAGzB,EAAM,IAAKyB,EAAKF,GAC1B,GAAID,EAAEG,IAAO18B,EAAE08B,GAAK,CAChBzB,EAAMsB,EAAEG,GAAM18B,EAAE08B,GAAM,GAAK,EAC3B,MAKZ,KAAIzB,EAAM,GAiBN,MAdA,IAAKwB,EAAKK,GAAMN,EAAKD,EAAII,EAAIG,GAAK,CAC9B,GAAI98B,IAAI88B,GAAML,EAAGK,GAAK,CAElB,IADAJ,EAAKI,EACEJ,IAAO18B,IAAI08B,IACd18B,EAAE08B,GAAM,IACV18B,EAAE08B,GACJ18B,EAAE88B,IAAO,GAEb98B,EAAE88B,IAAOL,EAAGK,GAEhB,MAAQ98B,EAAE,IACNA,EAAE1B,QAOd0+B,EAAGC,KAAQhC,EAAMt6B,IAAMA,EAEnBX,EAAE,IAAMi7B,EACRj7B,EAAE88B,GAAMrW,EAAEmW,IAAO,EAEjB58B,EAAI,CAACymB,EAAEmW,WACLA,IAAOC,QAxTkK,IAwT5J78B,EAAE,KAAqBmnB,KAW9C,OATK6V,EAAG,IAAY,GAANC,IAEVD,EAAG1+B,QACHy+B,EAAEpxB,IACF7K,KAGAm8B,EAAKn8B,GACL06B,EAAMuB,EAAGj8B,EAAG26B,EAAIE,QAlU+J,IAkU3J37B,EAAE,IACnB+8B,GAKX/B,EAAEniB,GAAK,SAAUnM,GACb,OAAuB,IAAhBnL,KAAK05B,IAAIvuB,IAMpBsuB,EAAEkC,GAAK,SAAUxwB,GACb,OAAOnL,KAAK05B,IAAIvuB,GAAK,GAMzBsuB,EAAEmC,IAAM,SAAUzwB,GACd,OAAOnL,KAAK05B,IAAIvuB,IAAM,GAK1BsuB,EAAEoC,GAAK,SAAU1wB,GACb,OAAOnL,KAAK05B,IAAIvuB,GAAK,GAMzBsuB,EAAEqC,IAAM,SAAU3wB,GACd,OAAOnL,KAAK05B,IAAIvuB,GAAK,GAKzBsuB,EAAEsC,MAAQtC,EAAEuC,IAAM,SAAU7wB,GACxB,IAAI/O,EAAGkB,EAAGuB,EAAGo9B,EAAM/B,EAAMl6B,KAAK2U,YAAarR,EAAI,IAAI42B,EAAIl6B,MAAuBklB,GAAhB/Z,EAAI,IAAI+uB,EAAI/uB,GAAQ7H,EAAE5F,GAAGs9B,EAAI7vB,EAAEzN,EAE7F,GAAIwnB,GAAK8V,EAEL,OADA7vB,EAAEzN,GAAKs9B,EACA13B,EAAE44B,KAAK/wB,GAElB,IAAIovB,EAAKj3B,EAAErF,EAAE0B,QAASw8B,EAAK74B,EAAE8G,EAAG2wB,EAAK5vB,EAAElN,EAAGm+B,EAAKjxB,EAAEf,EAEjD,IAAKmwB,EAAG,KAAOQ,EAAG,GAUd,OATIA,EAAG,GACH5vB,EAAEzN,GAAKs9B,EAEFT,EAAG,GACRpvB,EAAI,IAAI+uB,EAAI52B,GAGZ6H,EAAEzN,EAAI,EAEHyN,EAGX,GAAI+Z,EAAIiX,EAAKC,EAAI,CAUb,KATIH,EAAO/W,EAAI,IACXA,GAAKA,EACLrmB,EAAI07B,IAGJ6B,EAAKD,EACLt9B,EAAIk8B,GAERl8B,EAAEqJ,UACG8yB,EAAI9V,EAAG8V,KACRn8B,EAAEjC,KAAK,GACXiC,EAAEqJ,eAKF,IADA5K,IAAM2+B,EAAO1B,EAAGj+B,OAASy+B,EAAGz+B,QAAUi+B,EAAKQ,GAAIz+B,OAC1C4oB,EAAI8V,EAAI,EAAGA,EAAI19B,EAAG09B,IACnB,GAAIT,EAAGS,IAAMD,EAAGC,GAAI,CAChBiB,EAAO1B,EAAGS,GAAKD,EAAGC,GAClB,MAeZ,GAVIiB,IACAp9B,EAAI07B,EACJA,EAAKQ,EACLA,EAAKl8B,EACLsM,EAAEzN,GAAKyN,EAAEzN,IAMRs9B,GAAK19B,EAAIy9B,EAAGz+B,SAAWF,EAAIm+B,EAAGj+B,SAAW,EAC1C,KAAO0+B,KACHT,EAAGn+B,KAAO,EAElB,IAAK4+B,EAAI5+B,EAAGkB,EAAI4nB,GAAI,CAChB,GAAIqV,IAAKj9B,GAAKy9B,EAAGz9B,GAAI,CACjB,IAAKlB,EAAIkB,EAAGlB,IAAMm+B,IAAKn+B,IACnBm+B,EAAGn+B,GAAK,IACVm+B,EAAGn+B,GACLm+B,EAAGj9B,IAAM,GAEbi9B,EAAGj9B,IAAMy9B,EAAGz9B,GAGhB,KAAmB,IAAZi9B,IAAKS,IACRT,EAAG/F,MAEP,KAAiB,IAAV+F,EAAG,IACNA,EAAGx9B,UACDq/B,EAUN,OARK7B,EAAG,KAEJpvB,EAAEzN,EAAI,EAEN68B,EAAK,CAAC6B,EAAK,IAEfjxB,EAAElN,EAAIs8B,EACNpvB,EAAEf,EAAIgyB,EACCjxB,GAKXsuB,EAAE4C,IAAM,SAAUlxB,GACd,IAAImxB,EAAMpC,EAAMl6B,KAAK2U,YAAarR,EAAI,IAAI42B,EAAIl6B,MAAuBklB,GAAhB/Z,EAAI,IAAI+uB,EAAI/uB,GAAQ7H,EAAE5F,GAAGs9B,EAAI7vB,EAAEzN,EACpF,IAAKyN,EAAElN,EAAE,GACL,MAAM+F,MAvckI41B,6BA6c5I,OAJAt2B,EAAE5F,EAAIyN,EAAEzN,EAAI,EACZ4+B,EAAmB,GAAZnxB,EAAEuuB,IAAIp2B,GACbA,EAAE5F,EAAIwnB,EACN/Z,EAAEzN,EAAIs9B,EACFsB,EACO,IAAIpC,EAAI52B,IACnB4hB,EAAIgV,EAAIC,GACRa,EAAId,EAAIE,GACRF,EAAIC,GAAKD,EAAIE,GAAK,EAClB92B,EAAIA,EAAEoL,IAAIvD,GACV+uB,EAAIC,GAAKjV,EACTgV,EAAIE,GAAKY,EACFh7B,KAAK+7B,MAAMz4B,EAAEgtB,MAAMnlB,MAK9BsuB,EAAEyC,KAAOzC,EAAE5rB,IAAM,SAAU1C,GACvB,IAAIf,EAAGwb,EAAG/mB,EAAGq7B,EAAMl6B,KAAK2U,YAAarR,EAAI,IAAI42B,EAAIl6B,MAAOmL,EAAI,IAAI+uB,EAAI/uB,GAEpE,GAAI7H,EAAE5F,GAAKyN,EAAEzN,EAET,OADAyN,EAAEzN,GAAKyN,EAAEzN,EACF4F,EAAEy4B,MAAM5wB,GAEnB,IAAIgxB,EAAK74B,EAAE8G,EAAGmwB,EAAKj3B,EAAErF,EAAGm+B,EAAKjxB,EAAEf,EAAG2wB,EAAK5vB,EAAElN,EAEzC,IAAKs8B,EAAG,KAAOQ,EAAG,GASd,OARKA,EAAG,KACAR,EAAG,GACHpvB,EAAI,IAAI+uB,EAAI52B,GAGZ6H,EAAEzN,EAAI4F,EAAE5F,GAGTyN,EAKX,GAHAovB,EAAKA,EAAG56B,QAGJyK,EAAI+xB,EAAKC,EAAI,CAUb,IATIhyB,EAAI,GACJgyB,EAAKD,EACLt9B,EAAIk8B,IAGJ3wB,GAAKA,EACLvL,EAAI07B,GAER17B,EAAEqJ,UACKkC,KACHvL,EAAEjC,KAAK,GACXiC,EAAEqJ,UAUN,IAPIqyB,EAAGj+B,OAASy+B,EAAGz+B,OAAS,IACxBuC,EAAIk8B,EACJA,EAAKR,EACLA,EAAK17B,GAETuL,EAAI2wB,EAAGz+B,OAEFspB,EAAI,EAAGxb,EAAGmwB,EAAGnwB,IAAM,GACpBwb,GAAK2U,IAAKnwB,GAAKmwB,EAAGnwB,GAAK2wB,EAAG3wB,GAAKwb,GAAK,GAAK,EAO7C,IALIA,IACA2U,EAAGG,QAAQ9U,KACTwW,GAGDhyB,EAAImwB,EAAGj+B,OAAoB,IAAZi+B,IAAKnwB,IACrBmwB,EAAG/F,MAGP,OAFArpB,EAAElN,EAAIs8B,EACNpvB,EAAEf,EAAIgyB,EACCjxB,GASXsuB,EAAEtsB,IAAM,SAAU/N,GACd,IAAI86B,EAAMl6B,KAAK2U,YAAarR,EAAI,IAAI42B,EAAIl6B,MAAOmL,EAAI,IAAI+uB,EAAI,KAAMqC,EAAM,IAAIrC,EAAI,KAAMY,EAAQ17B,EAAI,EACjG,GAAIA,MAAQA,GAAKA,GAnjBT,KAmjB2BA,EAnjB3B,IAojBJ,MAAM4E,MAAM61B,EAAU,YAI1B,IAFIiB,IACA17B,GAAKA,GAEG,EAAJA,IACA+L,EAAIA,EAAEmlB,MAAMhtB,IAChBlE,IAAM,GAGNkE,EAAIA,EAAEgtB,MAAMhtB,GAEhB,OAAOw3B,EAAQyB,EAAI7tB,IAAIvD,GAAKA,GAShCsuB,EAAE+C,KAAO,SAAUnxB,EAAIgvB,GACnB,GAAIhvB,MAASA,GAAMA,EAAK,GAAKA,EA5kBxB,IA6kBD,MAAMrH,MAAM61B,EAAU,aAE1B,OAAOI,EAAM,IAAIj6B,KAAK2U,YAAY3U,MAAOqL,EAAIgvB,IAWjDZ,EAAEQ,MAAQ,SAAUzuB,EAAI6uB,GACpB,QApkBmL,IAokB/K7uB,EACAA,EAAK,OACJ,GAAIA,MAASA,GAAMA,GA7lBnB,KA6lBmCA,EA7lBnC,IA8lBD,MAAMxH,MAAM81B,GAEhB,OAAOG,EAAM,IAAIj6B,KAAK2U,YAAY3U,MAAOwL,EAAKxL,KAAKoK,EAAI,EAAGiwB,IAM9DZ,EAAEgD,KAAO,WACL,IAAIh+B,EAAGR,EAAGY,EAAGq7B,EAAMl6B,KAAK2U,YAAarR,EAAI,IAAI42B,EAAIl6B,MAAOtC,EAAI4F,EAAE5F,EAAG0M,EAAI9G,EAAE8G,EAAG+iB,EAAO,IAAI+M,EAAI,OAEzF,IAAK52B,EAAErF,EAAE,GACL,OAAO,IAAIi8B,EAAI52B,GAEnB,GAAI5F,EAAI,EACJ,MAAMsG,MAAM41B,EAAO,kBAMb,KAHVl8B,EAAIwP,KAAKuvB,KAAKn5B,EAAI,MAGH5F,IAAM,MACjBO,EAAIqF,EAAErF,EAAEsF,KAAK,KACLjH,OAAS8N,EAAI,IACjBnM,GAAK,KAETmM,IAAMA,EAAI,GAAK,EAAI,IAAMA,EAAI,GAAS,EAAJA,GAClC3L,EAAI,IAAIy7B,IAFRx8B,EAAIwP,KAAKuvB,KAAKx+B,KAEI,IAAQ,MAAQP,EAAIA,EAAE6N,iBAAiB5L,MAAM,EAAGjC,EAAE6P,QAAQ,KAAO,IAAMnD,IAGzF3L,EAAI,IAAIy7B,EAAIx8B,EAAI,IAEpB0M,EAAI3L,EAAE2L,GAAK8vB,EAAIC,IAAM,GAErB,GACIt7B,EAAIJ,EACJA,EAAI0uB,EAAKmD,MAAMzxB,EAAEq9B,KAAK54B,EAAEoL,IAAI7P,WACvBA,EAAEZ,EAAE0B,MAAM,EAAGyK,GAAG7G,KAAK,MAAQ9E,EAAER,EAAE0B,MAAM,EAAGyK,GAAG7G,KAAK,KAC3D,OAAO02B,EAAMx7B,GAAIy7B,EAAIC,IAAM,GAAK17B,EAAE2L,EAAI,EAAG8vB,EAAIE,KAKjDX,EAAEnJ,MAAQmJ,EAAEnpB,IAAM,SAAUnF,GACxB,IAAIlN,EAAGi8B,EAAMl6B,KAAK2U,YAAarR,EAAI,IAAI42B,EAAIl6B,MAAuBu6B,GAAhBpvB,EAAI,IAAI+uB,EAAI/uB,GAAS7H,EAAErF,GAAG88B,EAAK5vB,EAAElN,EAAGinB,EAAIqV,EAAGj+B,OAAQ0+B,EAAID,EAAGz+B,OAAQF,EAAIkH,EAAE8G,EAAG9M,EAAI6N,EAAEf,EAInI,GAFAe,EAAEzN,EAAI4F,EAAE5F,GAAKyN,EAAEzN,EAAI,GAAK,GAEnB68B,EAAG,KAAOQ,EAAG,GAEd,OADA5vB,EAAElN,EAAI,CAACkN,EAAEf,EAAI,GACNe,EAcX,IAXAA,EAAEf,EAAIhO,EAAIkB,EAEN4nB,EAAI8V,IACJ/8B,EAAIs8B,EACJA,EAAKQ,EACLA,EAAK98B,EACLX,EAAI4nB,EACJA,EAAI8V,EACJA,EAAI19B,GAGHW,EAAI,IAAIgF,MAAM3F,EAAI4nB,EAAI8V,GAAI19B,KAC3BW,EAAEX,GAAK,EAGX,IAAKlB,EAAI4+B,EAAG5+B,KAAM,CAGd,IAFA4+B,EAAI,EAEC19B,EAAI4nB,EAAI9oB,EAAGkB,EAAIlB,GAEhB4+B,EAAI/8B,EAAEX,GAAKy9B,EAAG3+B,GAAKm+B,EAAGj9B,EAAIlB,EAAI,GAAK4+B,EACnC/8B,EAAEX,KAAO09B,EAAI,GAEbA,EAAIA,EAAI,GAAK,EAEjB/8B,EAAEX,GAAK09B,EAQX,IALIA,IACE7vB,EAAEf,EAEJnM,EAAElB,QAEDX,EAAI6B,EAAE3B,QAAS2B,IAAI7B,IACpB6B,EAAEu2B,MAEN,OADArpB,EAAElN,EAAIA,EACCkN,GASXsuB,EAAEluB,cAAgB,SAAUC,EAAI6uB,GAC5B,IAAI/2B,EAAItD,KAAMZ,EAAIkE,EAAErF,EAAE,GACtB,QA3qBmL,IA2qB/KuN,EAAkB,CAClB,GAAIA,MAASA,GAAMA,EAAK,GAAKA,EAnsB5B,IAosBG,MAAMxH,MAAM81B,GAGhB,IADAx2B,EAAI22B,EAAM,IAAI32B,EAAEqR,YAAYrR,KAAMkI,EAAI6uB,GAC/B/2B,EAAErF,EAAE3B,OAASkP,GAChBlI,EAAErF,EAAErB,KAAK,GAEjB,OAAO+9B,EAAUr3B,GAAG,IAAQlE,IAYhCq6B,EAAEhuB,QAAU,SAAUD,EAAI6uB,GACtB,IAAI/2B,EAAItD,KAAMZ,EAAIkE,EAAErF,EAAE,GACtB,QAjsBmL,IAisB/KuN,EAAkB,CAClB,GAAIA,MAASA,GAAMA,EAAK,GAAKA,EAztB5B,IA0tBG,MAAMxH,MAAM81B,GAIhB,IAAKtuB,EAAKA,GAFVlI,EAAI22B,EAAM,IAAI32B,EAAEqR,YAAYrR,GAAIkI,EAAKlI,EAAE8G,EAAI,EAAGiwB,IAE7BjwB,EAAI,EAAG9G,EAAErF,EAAE3B,OAASkP,GACjClI,EAAErF,EAAErB,KAAK,GAEjB,OAAO+9B,EAAUr3B,GAAG,IAASlE,IAQjCq6B,EAAExuB,OAASwuB,EAAE1uB,SAAW,WACpB,IAAIzH,EAAItD,KAAMk6B,EAAM52B,EAAEqR,YACtB,OAAOgmB,EAAUr3B,EAAGA,EAAE8G,GAAK8vB,EAAIwC,IAAMp5B,EAAE8G,GAAK8vB,EAAIyC,KAAMr5B,EAAErF,EAAE,KAK9Dw7B,EAAElrB,SAAW,WACT,IAAInP,EAAIwtB,OAAO+N,EAAU36B,MAAM,GAAM,IACrC,IAAgC,IAA5BA,KAAK2U,YAAYioB,SAAoB58B,KAAKsX,GAAGlY,EAAE2L,YAC/C,MAAM/G,MAAM41B,EAAO,wBAEvB,OAAOx6B,GAWXq6B,EAAEruB,YAAc,SAAUC,EAAIgvB,GAC1B,IAAI/2B,EAAItD,KAAMk6B,EAAM52B,EAAEqR,YAAavV,EAAIkE,EAAErF,EAAE,GAC3C,QA3uBmL,IA2uB/KoN,EAAkB,CAClB,GAAIA,MAASA,GAAMA,EAAK,GAAKA,EAnwB5B,IAowBG,MAAMrH,MAAM61B,EAAU,aAG1B,IADAv2B,EAAI22B,EAAM,IAAIC,EAAI52B,GAAI+H,EAAIgvB,GACnB/2B,EAAErF,EAAE3B,OAAS+O,GAChB/H,EAAErF,EAAErB,KAAK,GAEjB,OAAO+9B,EAAUr3B,EAAG+H,GAAM/H,EAAE8G,GAAK9G,EAAE8G,GAAK8vB,EAAIwC,IAAMp5B,EAAE8G,GAAK8vB,EAAIyC,KAAMv9B,IAQvEq6B,EAAEoD,QAAU,WACR,IAAIv5B,EAAItD,KAAMk6B,EAAM52B,EAAEqR,YACtB,IAAmB,IAAfulB,EAAI0C,OACJ,MAAM54B,MAAM41B,EAAO,sBAEvB,OAAOe,EAAUr3B,EAAGA,EAAE8G,GAAK8vB,EAAIwC,IAAMp5B,EAAE8G,GAAK8vB,EAAIyC,IAAI,IAGjD,IAAIzC,EA/vBX,SAAS4C,IAOL,SAAS5C,EAAI96B,GACT,IAAIkE,EAAItD,KAER,KAAMsD,aAAa42B,GACf,YAf2K,IAepK96B,EAAkB09B,IAAU,IAAI5C,EAAI96B,GAE/C,GAAIA,aAAa86B,EACb52B,EAAE5F,EAAI0B,EAAE1B,EACR4F,EAAE8G,EAAIhL,EAAEgL,EACR9G,EAAErF,EAAImB,EAAEnB,EAAE0B,QAyBtB,SAAmB2D,GAEf,GAAIA,EAAErF,EAAE3B,OAAS,IAAMgH,EAAErF,EAAE,GAAI,CAC3B,IAAI7B,EAAIkH,EAAErF,EAAEu8B,UAAUl3B,GAAKA,GAC3BA,EAAErF,EAAIqF,EAAErF,EAAE0B,MAAMvD,GAChBkH,EAAE8G,EAAI9G,EAAE8G,EAAIhO,GA7BR2gC,CAAUz5B,OAET,CACD,GAAiB,iBAANlE,EAAgB,CACvB,IAAmB,IAAf86B,EAAI0C,OACJ,MAAMI,UAAUnD,EAAU,UAG9Bz6B,EAAU,IAANA,GAAW,EAAIA,EAAI,EAAI,KAAOkM,OAAOlM,GAE7C4T,EAAM1P,EAAGlE,GAIbkE,EAAEqR,YAAculB,EAQpB,OANAA,EAAI19B,UAAYi9B,EAChBS,EAAIC,GAxEC,GAyELD,EAAIE,GAhEH,EAiEDF,EAAIwC,IAvDH,GAwDDxC,EAAIyC,GAlDH,GAmDDzC,EAAI0C,QA7CC,EA8CE1C,EAwtBM4C,GAEF,I,KCr0BA,MACS,IAAI,EAAQ,GACb,IAAI,EAAQ,GACP,IAAI,GAAS,GACb,IAAI,EAAQ,iCACZ,IAAI,EAAQ,kCA4BjC,SAAS3qB,EAAY7O,EAAG6H,GAC3B,OAAO7H,EAAEuK,IAAI1C,GAyBV,SAAS,EAAS7H,GACrB,OAAOA,EAAEyH,WAwDb,SAASkyB,EAAaC,EAAWC,EAAMnpB,GACnC,IAAK,IAAI5X,EAAI,EAAGA,EAAI,EAAGA,IACnB8gC,EAAUlpB,EAAS5X,GAAM+gC,GAAa,EAAJ/gC,EAAU,GAU7C,SAASghC,EAAaD,GACzB,OAEqB7yB,EAFL6yB,EAAK,GAEKE,EAFDF,EAAK,GAEC5yB,EAFG4yB,EAAK,GAEFG,EAFMH,EAAK,GAKzCI,EAAUjzB,EAAK+yB,EAAK9yB,EAFR+yB,EAAU,EACdA,GAAW,GAAM,KAF7B,IAAkBhzB,EAAK+yB,EAAK9yB,EAAM+yB,EAKlC,SAASC,EAAUjzB,EAAK+yB,EAAK9yB,EAAM8I,EAAYmqB,GAClD,MACMN,EAAY,IAAI/yB,WAAWszB,IACjCR,EAAaC,EAAW5yB,EAAK,GAC7B2yB,EAAaC,EAAWG,EAAK,GAC7BJ,EAAaC,EAAW3yB,EAAM,IAC9B,MAAMmzB,EA3CV,SAAsBC,EAAKF,GACvB,MAAMG,EAAM,IAAIzzB,WAAqB,IAAVszB,EAAgB,IAAO,EAAI,GACtD,IAAII,EAAW,EACf,IAAK,IAAI3/B,EAAIy/B,EAAIrhC,OAAS,EAAG4B,GAAK,EAAGA,IAAK,CACtC,IAAI4/B,EAAQH,EAAIz/B,GAChB,IAAK,IAAI9B,EAAI,EAAGA,EAAIyhC,EAAUzhC,IAAK,CAC/B,MAAM2R,EAAe,GAAT6vB,EAAIxhC,GAAU0hC,EAAQ,EAClCF,EAAIxhC,GAAM2R,EAAM,GAAM,EACtB+vB,EAAS/vB,EAAM,GAAM,EAEzB,KAAO+vB,EAAQ,GACXF,EAAIC,KAAeC,EAAQ,GAAM,EACjCA,EAASA,EAAQ,GAAM,EAG/B,OAAOF,EAAIj+B,MAAM,EAAGk+B,GA4BFE,CAAab,EALf,IAMhBM,GAAgB,IAChB,MAAMQ,EAAM,IAAI,EAAQ,GACxBA,EAAI//B,EAAIgF,MAAMuD,KAAKk3B,EAAUx1B,WAC7B81B,EAAI5zB,EAAIszB,EAAUphC,OAASkhC,EAAQ,EACnCQ,EAAItgC,EAAI2V,GAAc,EAAI,EAE1B,OADU,IAAI,EAAQ2qB,K,8QCnEZnJ,G,OACNA,EAAOG,O,4CA0DJ,EADHiD,G,WAOYgG,EAAuBC,G,OACnCA,EAAO3G,MAAM0G,G,WAEJ/W,EAAoBC,EAAqBoP,G,OAvE5C4H,EA0EHhX,EAtDKmL,EAqDLiE,EADHrP,EAnDO,KAAMoL,GApBRhR,KAAK6c,G,IADJA,EAoBE7L,E,WAyDH/oB,EAAcsrB,G,OAAuBA,EAAO9zB,IAAIwI,G,eAW7C60B,G,OACR,OAAAC,EAAA,IAAiBp2B,EAAI4sB,IAAU5sB,EAAIiuB,GAAMrB,GAASuJ,G,6DAiChCvJ,G,gBAlITz1B,EAASy1B,G,OAClBA,EAAOkC,QAAQ33B,GAkIf,CAAQ,EAAEy1B,G,WAEI5a,EAAgBrb,G,OAE3B,EAAS2lB,GAAA3lB,EADZ,EAAIqb,I,2BAcI4a,G,OACRA,EAAO9zB,IAAKu9B,GAAA,YAAc,GAAdA,I,+DChNK,EAAc1/B,kBAF5B,EADA,O,EAOA,EAAoB4qB,IAAA,KADvB,EAAgB,EAAc,KAAK+U,I,EAkBhC,EAAoB/U,I,MAAAgV,EAAA,K,mBAMZ,YAAc,IALf,KAAAA,EACE,IACGA,EAHQ,cADvB,EATO,EADA,MAGG,EAAc,KAKjB,EADA,Q,EAgBJ,EAAoBhV,IAAA,KADvB,EAAgB,EAAc,KAAKiV,I,EAMhC,EAAcC,OAAA,MAAAA,GADd,EADH,aAACD,EAAQE,EAAgBJ,EAAMK,M,EAO5B,EAFH,aAAE,EAAuB,OAAQ,WAAM,IACrC,EAAuB,QAAS,WAAM,O,EAGhC,EAAuB,OAAO,Y,cAGlCC,EAEG,EAActa,I,OAAAA,G,IAAA,I,MACJ,K,IADI,I,MAEJ,K,IAFI,I,MAGJ,K,IAHI,I,MAIJ,K,IAJI,I,MAKJ,K,eACAA,IAPb,EAAgB,cAehBua,EAIG,EADA,GDhBAC,ECSA,EAAcC,GAAA,KADjB,EAAgB,EAAc,MAAMH,IAGhB,EAAuB5gC,GAAU,MAAL,GAAkB,OAAL,GDV1Di4B,GAAM6I,M,IADNA,E,OCoBJ,EAAmB,EAAc,KAAO,EAAc,KADzDD,I,KAGUG,EAAcl+B,IAAI29B,OAAA,MAAAA,I,WAEbn/B,G,OACf,MAAgFA,G,QAK7E,EADA,OAAA8+B,EAAA,GAAS9+B,GAAA2/B,EAAA3/B,GADZ,aAAE4/B,EAAOC,EAAOC,EAASC,M,EAIjBJ,EAAgB,EAAc,M,QAElC,S,kBAAO,MA6BR,EADH,aAACK,EAlBM,SAA+B,MAAhB,OAAAlB,EAAA,OADf,EAPWa,EAAgB,EAAc,MAC7BA,EAAgB,EAAc,MAEhC,EAAqBM,EAAM,WAqBrC,SAA6C,MAAd,OAAAC,EAAA,GAAhB,OAAApB,EAAA,QADf,EAbSa,EAAgB,EAAc,MAC7BA,EAAgB,EAAc,MAQxC,EAAAM,EADA,EAAoBhW,IAAA,WAJvB,EACK0V,EAAeD,GACfC,EAAgB,EAAc,MAC9BA,EAAe,qB,EAYXA,EA/BT,S,yDC3EM57B,GACV,SAAYA,S,SAFKA,G,MAAwB,iBAAJA,EAGlC,CAAgBA,IACT,YAAUA,GACV,MAAIA,GACJ,WAAkBA,EAAJ,IACd,UAAiBA,EAAJ,E,WAUb2W,G,gBFaHA,EAAgB4a,G,MAEhB13B,EADP03B,EAAO7hB,MAAMiH,GAEH,OAAA9c,EAAA,OACI,YAAKA,EAAOyB,Y,EEhB1B,CAAgBqb,K,WAGTA,G,MACDhU,EAAA,EAASgU,GAAT,eAEI,YAAU,kDAAV,CAA+CA,GADxChU,E,WAIFse,GAAA,oBAEbA,YAAc,OACC,QAHF,a,OAIYmb,uBAJZ,a,OAKG,YAAQ,oBAAR,CAAhBnb,aALa,c,MAURob,EADA,YAAc,IADd,OAAAtB,EAAA,GAAS9Z,GAAA,EAAAA,GAFdA,c,OAIK,YAAQ,oBAAR,CAAAob,GAVQ,c,MAgBRA,EADA,YAAc,IADd,OAAAtB,EAAA,GAAe7U,I,MAAcoW,EAAyB,EAAvC,M,OAAc,YAAQ,uBAAR,CAAd,KAAc,CAAAA,IAD7B,OAAAH,EAAA,GAFLlb,e,OAKK,YAAQ,oBAAR,CAAAob,G,MAfI,O,WAmBQ1lB,G,OACbA,O,4BAIa,Y,cAEX+H,EAAQA,GACCnZ,EAAA,YADT,aACJ,SAAa,iD,MAATjK,EAAS,4DAAUojB,EAAMA,KAAI,EAAcpjB,K,QAAlCiK,Y,OACPmZ,E,cAEF6d,EAAW,GACKh3B,EAAA,mBAAA42B,EAAA,GADhB,cACJ,SAAoB,iD,MAAfnW,EAAe,4DACmBuW,EADnB,MACF,EADE,O,QAAAh3B,Y,OAEdg3B,E,gCAECjhC,GACX,OAAqBA,QAChB,qBACA,eAAkBA,EAAOA,CAAKM,EAAI4gC,K,IAcKjgB,E,OAbrC,EAASigB,2BACoBA,IAEpBA,kBAEH,YADmCA,EACf,KAEvBA,mBACSA,EADT,YAAAA,GAGC,cAA8BA,GAAgBA,EAC5C,WAAUA,GACV,EAASA,2BAAiDA,KAlFzDx8B,EAmFYw8B,aAnFKx8B,MAAY,WAASA,GAmFRuc,EAAuBigB,EAAvB,YAAAjgB,EAA2C,MAC5EigB,E,IApFGx8B,GAqFX,gB,WAEwBA,G,MAEzBy8B,E,SC1FkBz8B,GACpB,MAAgBA,iBAAb,EACsBA,O,EDwFvB,CADIA,GACJ,GAAAy8B,S,MAAuB1yB,EADnB0yB,E,OAC0B,UAAQ1yB,G,OACtC2yB,E,SCjFkB18B,GACpB,MAAgBA,iBAAb,EACqBA,O,ED+EtB,CAFIA,GAEJ,GAAA08B,S,MAAuBN,EAFnBM,E,OAE6B,UAAQN,G,OACzCO,E,SCvFgB38B,GAClB,MAAcA,kBAAX,EACoBA,O,EDqFrB,CAHIA,GAGJ,GAAA28B,S,MAAqBrhC,EAHjBqhC,E,OAG0B,UAAMrhC,GACpC,GAJI0E,M,SCrEMA,GACZ,OAAUA,QACL,YAAKA,Q,EDuER,CAJIA,G,OAIgB,W,OACpB48B,E,SCrEiB58B,GACnB,OAAI,cAA8BA,GACVA,O,EDmEtB,CALIA,GAKJ,GAAA48B,S,MAAsB9W,EALlB8W,E,OAKyB,UAAQ,OAAA7B,EAAA,GAAc,YAAU/6B,GAAA,EAAAA,GAAa8lB,K,OAC1E+W,E,SChFkB78B,GACpB,MAAgBA,iBAAb,EACE,YAAKA,Q,ED8ER,CANIA,GAMJ,GAAA68B,S,MAAuB9gC,cANnB8gC,G,OASC,UADA,OAAAV,EAAA,GADH,YAAE,4BAAIvgC,IAA6CA,EAAK,EAA2BG,EAAJH,KAAlE,YAA4BG,Q,OAGtC,e,YAGM4a,G,OAEb,EADa,WAAcA,M,6BEzHnC,+VAEO,SAASmmB,IACZ,OAFiB,EAsBd,SAASC,EAAczhC,GAC1B,MAAMoT,EAAQ,IAAI7H,WAAW,GAG7B,OAFa,IAAIm2B,SAAStuB,EAAMuuB,OAAQvuB,EAAMwuB,WAAYxuB,EAAMyuB,YAC3DC,SAAS,EAAG9hC,GAzBA,GA0BVoT,EAkEJ,SAAS2uB,EAAQ3uB,EAAOgC,GAC3B,MAAMgO,EAAQ3N,YAAYC,OAAOtC,GAASA,EAAQ7H,WAAW3D,KAAKwL,GAElE,OADa,IAAIsuB,SAASte,EAAMue,OAAQve,EAAMwe,WAAYxe,EAAMye,YACpDG,SAAS5sB,GA/FJ,GAiGd,SAAS6sB,EAAQ7uB,EAAOgC,GAC3B,MAAMgO,EAAQ3N,YAAYC,OAAOtC,GAASA,EAAQ7H,WAAW3D,KAAKwL,GAElE,OADa,IAAIsuB,SAASte,EAAMue,OAAQve,EAAMwe,WAAYxe,EAAMye,YACpDK,SAAS9sB,GApGJ,GAsGd,SAAS+sB,EAAQ/uB,EAAOgC,GAC3B,MAAMgO,EAAQ3N,YAAYC,OAAOtC,GAASA,EAAQ7H,WAAW3D,KAAKwL,GAC5DgvB,EAAO,IAAIV,SAASte,EAAMue,OAAQve,EAAMwe,WAAYxe,EAAMye,YAC1D1zB,EAAUi0B,EAAKF,SAAS9sB,EAAyB,GAzGtC,GA0GXhH,EAAWg0B,EAAKF,SAAS9sB,EAAyB,GA1GvC,GA2GjB,OAAO,YAASjH,EAASC,GAAU,GAEhC,SAASi0B,EAASjvB,EAAOgC,GAC5B,MAAMgO,EAAQ3N,YAAYC,OAAOtC,GAASA,EAAQ7H,WAAW3D,KAAKwL,GAElE,OADa,IAAIsuB,SAASte,EAAMue,OAAQve,EAAMwe,WAAYxe,EAAMye,YACpDS,UAAUltB,GAhHL,GAkHd,SAASmtB,EAASnvB,EAAOgC,GAC5B,MAAMgO,EAAQ3N,YAAYC,OAAOtC,GAASA,EAAQ7H,WAAW3D,KAAKwL,GAElE,OADa,IAAIsuB,SAASte,EAAMue,OAAQve,EAAMwe,WAAYxe,EAAMye,YACpDW,UAAUptB,GArHL,GAuHd,SAASqtB,EAASrvB,EAAOgC,GAC5B,MAAMgO,EAAQ3N,YAAYC,OAAOtC,GAASA,EAAQ7H,WAAW3D,KAAKwL,GAC5DgvB,EAAO,IAAIV,SAASte,EAAMue,OAAQve,EAAMwe,WAAYxe,EAAMye,YAC1D1zB,EAAUi0B,EAAKI,UAAUptB,EAAyB,GA1HvC,GA2HXhH,EAAWg0B,EAAKI,UAAUptB,EAAyB,GA3HxC,GA4HjB,OAAO,YAASjH,EAASC,GAAU,GAEhC,SAASs0B,EAAStvB,EAAOgC,GAC5B,MAAMgO,EAAQ3N,YAAYC,OAAOtC,GAASA,EAAQ7H,WAAW3D,KAAKwL,GAElE,OADa,IAAIsuB,SAASte,EAAMue,OAAQve,EAAMwe,WAAYxe,EAAMye,YACpDc,WAAWvtB,GAjIN,GAmId,SAASwtB,EAASxvB,EAAOgC,GAC5B,MAAMgO,EAAQ3N,YAAYC,OAAOtC,GAASA,EAAQ7H,WAAW3D,KAAKwL,GAElE,OADa,IAAIsuB,SAASte,EAAMue,OAAQve,EAAMwe,WAAYxe,EAAMye,YACpDgB,WAAWztB,GAtIN,K,mNCoFGnV,GAChB,OAAG,YAAsBA,G,WARH6iC,G,OACtB,YAAG,oBAAG,YAAsBA,I,MAChBtf,EAAkB,YAA+Bsf,G,OACrD,YAAOC,EADH,MAEJ,gBAAOA,EAFH,Q,OAGJ,YAAMD,MAITC,CAAiB9iC,Q,aAmDCd,EAAiBsK,G,OAAMtK,EAAE6jC,M,WAOnBC,G,IAGU9jC,EAmBDA,EACAA,EACcA,EACRA,EACJA,EAEHA,EACKA,EACFA,EACJA,EACYA,EACcA,EAC1BA,EACIA,EACIA,EACvBA,E,MAnCnB+jC,E,SAzImBC,G,OACf,YAAAA,I,IAAA,gB,OACoB,QAAQ,G,IAD5B,c,OAEkB,QAAQ,G,IAF1B,e,OAGmB,QAAQ,I,IAH3B,e,OAImB,QAAQ,G,IAJ3B,gC,IAAA,e,OAMmB,QAAQ,I,IAN3B,gB,OAOoB,QAAQ,G,IAP5B,gB,OAQoB,QAAQ,G,IAR5B,gB,OASoB,QAAQ,G,IAT5B,kB,OAUsB,QAAQ,I,IAV9B,kB,OAWsB,QAAQ,I,IAX9B,wB,OAY4B,QAAQ,I,IAZpC,iB,OAasB,QAAQ,G,IAb9B,gB,OAcoB,QAAQ,G,IAd5B,gB,OAeoB,QAAQ,G,IAf5B,kC,IAAA,iB,OAiBqB,QAAQ,I,IAjB7B,6B,OAkBiC,QAAQ,I,IAlBzC,6B,OAmBiC,QAAQ,G,IAnBzC,c,OAoBkB,QAAQ,I,IApB1B,c,OAqBkB,QAAQ,I,IArB1B,e,OAsBmB,QAAQ,I,IAtB3B,gB,OAuBoB,QAAQ,I,gBAiHhC,CADIF,GACJ,GAAAC,S,OADIA,E,OAEJE,EAAA,EAFIH,GAEJ,GAAAG,S,MAAUC,EAFND,E,OAEgB,QAAQ,IAASjkC,MAAe,QAAM,YAAU8jC,GAAAK,EAAAL,GAAeI,QAA9CE,EAAApkC,K,OACrCqkC,GAhHgBvjC,EA6GZgjC,EA5GH,YAAoBhjC,GAGhB,YAAeiG,IAASA,EAAO,YAAAA,GAAYA,EAAA,IAD9C,YAA2BjG,S,GA6G7B,GAAAujC,S,MAAWriC,EAHPqiC,EAIErkC,EAAI,aAEA,YAAG,4BAAqCkI,GAAO,YAC3C,QADoC,KAGtBi8B,EAHsB,aAAAniC,KAIpC8hC,I,OACZ,QAAQ,OAASM,EAAApkC,I,OAEnBskC,E,SAxGexjC,GACjB,OAAG,YAAmBA,GAGf,YAAemE,IACC,YAAAA,GAELA,EAD0B,YAAes/B,GAAQA,EAAA,GAA3C,YAAAt/B,KAHpB,YAAyBnE,S,EAqG3B,CAbIgjC,GAaJ,GAAAQ,S,MAAU/hC,EAbN+hC,EAcEtkC,EAAI,aACJ,YAAG,4BAAuCkI,GAAM,YAC5C,QADsC,KAGxB,YAAU47B,GAAAK,EAAAL,GAHc,aAAAvhC,KAGiBuhC,I,OAC/D,QAAQ,OAAQM,EAAApkC,I,OAElBwkC,E,SA3Bc1jC,GAChB,OAAG,YAAAA,GACE,YAAuBA,Q,EAyB1B,CArBIgjC,GAqBJ,GAAAU,S,MAASC,EArBLD,E,OAqBiB,QAAQ,IAAOxkC,MAAiB,SAAMmkC,EAAeM,GAAUX,QAAhDM,EAAApkC,K,OACpC0kC,E,SA/Fc5jC,GAChB,OAA0B,IAAtB,YAAAA,WAAsB,6CACrB,YAAAA,GAAyB,Q,EA6F5B,CAtBIgjC,GAsBJ,GAAAY,S,MAASD,EAtBLC,E,OAsBiB,QAAQ,IAAO1kC,MAAiB,QAAMmkC,EAAeM,QAAtCL,EAAApkC,K,OACpC2kC,E,SAnDqB7jC,GACvB,OAAyB,IAAtB,YAAAA,WAAsB,mCACpB,YAAAA,GAAyB,Q,EAiD5B,CAvBIgjC,GAuBJ,GAAAa,S,MAAgBF,EAvBZE,E,OAuBwB,QAAQ,IAAc3kC,MAAiB,QAAMmkC,EAAeM,QAAtCL,EAAApkC,K,OAClD4kC,E,SA/CiB9jC,GACnB,OAAyB,IAAtB,YAAAA,WAAsB,sCACpB,YAAAA,GAAyB,Q,EA6C5B,CAxBIgjC,GAwBJ,GAAAc,S,MAAYH,EAxBRG,E,OAwBoB,QAAQ,IAAU5kC,MAAiB,QAAMmkC,EAAeM,QAAtCL,EAAApkC,K,OAC1C6kC,E,SAjFe/jC,GACjB,OAAG,YAAAA,GACE,YAAAA,Q,EA+EH,CAzBIgjC,GAyBJ,GAAAe,S,MAAUJ,EAzBNI,E,OAyBkB,QAAQ,IAAQ7kC,MAAiB,QAAMmkC,EAAeM,QAAtCL,EAAApkC,K,OAEtC8kC,E,SAzEehkC,GACjB,OAAG,YAAmBA,GACjB,YAA4BA,Q,EAuE/B,CA3BIgjC,GA2BJ,GAAAgB,S,MAAUZ,EA3BNY,E,OA2Be,QAAQ,IAAQ9kC,MAAiB,QAAM,YAAU8jC,GAAAK,EAAAL,GAAeI,QAAhDE,EAAApkC,K,OACnC+kC,E,SA/EgBjkC,GAClB,OAA0B,IAAtB,YAAAA,WAAsB,wCACrB,YAAAA,GAAyB,Q,EA6E5B,CA5BIgjC,GA4BJ,GAAAiB,S,MAAWN,EA5BPM,E,OA4BmB,QAAQ,IAAS/kC,MAAiB,QAAMmkC,EAAeM,QAAtCL,EAAApkC,K,OACxCglC,E,SA7HclkC,GAChB,OAAyB,IAAtB,YAAAA,WAAsB,qBACpB,YAAAA,GAAyB,Q,EA2H5B,CA7BIgjC,GA6BJ,GAAAkB,S,MAASP,EA7BLO,E,OA6BiB,QAAQ,IAAShlC,MAAiB,QAAMmkC,EAAeM,QAAtCL,EAAApkC,K,OACtCilC,E,SAnIankC,GACf,OAAyB,IAAtB,YAAAA,WAAsB,4CACpB,YAAAA,GAAyB,Q,EAiI5B,CA9BIgjC,GA8BJ,GAAAmB,S,MAAQR,EA9BJQ,E,OA8BgB,QAAQ,IAAMjlC,MAAiB,QAAMmkC,EAAeM,QAAtCL,EAAApkC,K,OAClCklC,E,SA/GapkC,GACf,GAA0B,IAAtB,YAAAA,WAAsB,6C,MAElBqkC,EAAU,YAAArkC,G,OACRqkC,EAAS,GAAIA,EAAS,KA2G9B,CA/BIrB,GA+BJ,GAAAoB,S,MAASE,EA/BL,KA+BcC,EA/Bd,K,OA+B4B,QAAQ,IAAMrlC,MAAiB,SAAMmkC,EAAeiB,GAASjB,EAAekB,SAA9DjB,EAAApkC,K,OAC9CslC,E,SApEoBxkC,GACtB,GAAyB,IAAtB,YAAAA,WAAsB,0C,MAEnBqkC,EAAU,YAAArkC,G,OACRqkC,EAAS,GAAIA,EAAS,KAgE5B,CAhCIrB,GAgCJ,GAAAwB,S,MAAgBF,EAhCZ,KAgCqBC,EAhCrB,K,OAgCmC,QAAQ,IAAarlC,MAAiB,SAAMmkC,EAAeiB,GAASjB,EAAekB,GAAWA,QAAzEjB,EAAApkC,K,OAC5DulC,E,SA1EazkC,GACf,OAAyB,IAAtB,YAAAA,WAAsB,4CACnB,YAAAA,GAAyB,Q,EAwE7B,CAjCIgjC,GAiCJ,GAAAyB,S,MAAQd,EAjCJc,E,OAiCgB,QAAQ,IAAMvlC,MAAiB,QAAMmkC,EAAeM,QAAtCL,EAAApkC,K,OAClCwlC,E,SApDe1kC,GACjB,OAAyB,IAAtB,YAAAA,WAAsB,0CACnB,YAAAA,GAAyB,Q,EAkD7B,CAlCIgjC,GAkCJ,GAAA0B,S,MAAUf,EAlCNe,E,OAkCkB,QAAQ,IAAQxlC,MAAiB,QAAMmkC,EAAeM,QAAtCL,EAAApkC,K,OACtCylC,E,SAhDiB3kC,GACnB,OAAyB,IAAtB,YAAAA,WAAsB,2BACpB,YAAAA,GAAyB,Q,EA8C5B,CAnCIgjC,GAmCJ,GAAA2B,S,MAAYhB,EAnCRgB,E,OAmCoB,QAAQ,IAAUzlC,MAAiB,QAAMmkC,EAAeM,QAAtCL,EAAApkC,K,OACrC,QAAQ,IAAMA,MAAiB,QAAM8jC,OAAvBM,EAAApkC,qB,IAjJHc,E,QAmJM,QAAU,I,0EAElBgjC,G,IACV57B,EAAAw9B,OAAA,GAAAx9B,GAAA,YAAAy9B,EAA0B7B,cAA1B4B,gBAAA,K,OACQ,K,OAENE,EAAKC,EAAgB/B,GASzB,OAJS,YAAqB,YAAAA,KAClB,wBAAAA,GAA+B,SAC/B,wBAAAA,GAA+B,SAGvC6B,EAAA,IAAe7B,EAAiB8B,GAGhCA,G,WAOMpf,G,OAAAA,O,8IAkBS,E,eACR,G,WAGHA,GAAA,mBAIL,uBAAkBsf,GAAsB,0B,uUCpOhD,MAAM,UAAe,IACxB,YAAYC,EAAO90B,GACftJ,QACA1F,KAAK8jC,MAAiB,EAARA,EACd9jC,KAAKgP,OAASA,GAQf,SAAS+0B,EAAuBC,EAAOC,GAE1C,OAAa,CACT,MAAM3gC,EAAI0gC,EAAO5kC,EAAI6kC,EACrB,GAAU,IAAN7kC,EACA,OAAO,EAEN,GAAKA,EAAI,GAAO,EAMjB,OAAQkE,EAAIygC,EAAuBzgC,EAAIA,KAAOlE,EAAI,IAAQ,EAL1D4kC,EAAS1gC,EAAIA,EACb2gC,KAAa7kC,EAAI,IA8BK,YAAS,WAAY,GAAG,GAkBnB,YAAS,WAAY,GAAG,GAmGjB,YAAW8kC,GAAmC9nC,GAAM2nC,EAAuB,EAAG3nC,GAAI+nC,YAyCzH,SAASC,EAAmBhlC,GAC/B,OAAOA,EAAE0kC,MAON,SAASO,EAAmBjlC,EAAGhD,GAClC,OAAOgD,EAAE4P,OAAO5S,GAGb,SAASkoC,EAAqBllC,EAAGhD,GACpC,OAAO,YAAYioC,EAAmBjlC,EAAGhD,IAAI,EAAO,GAGjD,SAASmoC,EAAsBnlC,EAAGhD,EAAGqI,GACxCrF,EAAE4P,OAAO5S,GAAU,EAAJqI,EAGZ,SAAS+/B,EAAmBR,EAAOC,GAEtC,OAAa,CACT,MAAM3gC,EAAI0gC,EAAO5kC,EAAI6kC,EACrB,GAAU,IAAN7kC,EACA,OAAO,YAAS,EAAG,GAAG,GAErB,GAAKA,EAAI,GAAO,EAMjB,OAAO,YAAYkE,EAAGkhC,EAAmB,YAAYlhC,EAAGA,MAAQlE,EAAI,KALpE4kC,EAAQ,YAAY1gC,EAAGA,GACvB2gC,KAAa7kC,EAAI,IAUtB,SAASqlC,EAAmBT,EAAOC,GAEtC,OAAa,CACT,MAAM3gC,EAAI0gC,EAAO5kC,EAAI6kC,EACrB,GAAU,IAAN7kC,EACA,OAAO,EAEN,GAAKA,EAAI,GAAO,EAMjB,OAAQkE,EAAImhC,EAAmBnhC,EAAIA,KAAOlE,EAAI,IAAQ,EALtD4kC,EAAS1gC,EAAIA,EACb2gC,KAAa7kC,EAAI,IAkBtB,SAASslC,EAAoBxf,EAAG8V,GACnC,OAAI9V,EAAI8V,EACO,EAAJA,EAGI,EAAJ9V,EAaR,MAMMyf,EAAwB,YAAS,SAAU,GAAG,GAE9CC,EAA2B,YAAS,SAAU,GAAG,GAExB,YAAS,SAAU,GAAG,GAkBrD,SAASC,EAAqBvhC,GACjC,SAAYA,IAAM,IA7Be,IAgC9B,SAASwhC,EAAqBxhC,GACjC,OA7BiC,SA6B1BA,EAGJ,SAASyhC,EAAqB/J,GACjC,OAAO,IAAI,EAAOA,EAAG,IAAImJ,WAAWnJ,IAOjC,SAASgK,EAAmB5lC,GAC/B,MAeM0kC,EAAgD,EAf/B,EAACmB,EAAQ7+B,KAE5B,OAAa,CACT,MAAM8+B,EAAKD,EAAQ7oC,EAAIgK,EACvB,IAAY,IAAPhK,GAA8B,IAAV8oC,EAAG9oC,GACxB,OAAQA,EAAI,EAAK,EAGjB6oC,EAASC,EACT9+B,EAAShK,EAAI,IAMX+oC,CAAe/lC,EAAE4P,OAAQ5P,EAAE0kC,MAAQ,GAEjD,OADA1kC,EAAE0kC,MAAiB,EAARA,EACJ1kC,EASJ,SAASgmC,EAAmB9hC,GAC/B,MAAMub,EAA0B,GAAlBvb,EAAI,EAAK,EAAIA,GAC3B,GAAIub,EAvE0B,SAuEA,CAC1B,MAAMpgB,EAAIsmC,EAAqB,GAE/B,OADAtmC,EAAEuQ,OAAO,GAAY,EAAN6P,EACRmmB,EAAmBvmC,GAEzB,CACD,MAAM4mC,EAAMN,EAdiB,GAe7B,IAAK,IAAI3oC,EAAI,EAAGA,GAAK,EAA6BA,IAC9CipC,EAAIr2B,OAAO5S,MAAYyiB,EAAM4lB,EA/EP,SA+E8CroC,IA/E9C,SA+E4E,EAEtG,OAAO4oC,EAAmBK,IAa3B,SAASC,EAAoBlmC,GAChC,GAAgB,IAAZA,EAAE0kC,MACF,OAAqB,EAAd1kC,EAAE4P,OAAO,GAEf,CACD,IAAI/G,EAAM,EACV,IAAK,IAAI7L,EAAIgD,EAAE0kC,MAAQ,EAAG1nC,GAAK,EAAGA,IAC9B6L,EAAQ7I,EAAE4P,OAAO5S,GArGK,SAqGsB6L,EAAQ,EAExD,OAAa,EAANA,GAiBR,MAAMs9B,EAAmBH,EAAmB,GAEtCI,EAAoBJ,EAAmB,GA2B7C,SAASK,EAAoBrmC,GAChC,OAAOA,EAAE0kC,MAAQ,EAuBd,SAAS4B,EAAiBnmC,EAAGi8B,GAChC,MAAMmK,EAAU,EAAIjB,EAAoBnlC,EAAEukC,MAAOtI,EAAEsI,OAAU,EACvDrlC,EAAIsmC,EAAqBY,GAE/B,OAxBG,SAA2Bv/B,EAAO69B,EAAO2B,EAAOC,EAAOC,EAAOC,GACjE,IAAIC,EAAGC,EAAKC,EAAKC,EAEjB,OAAa,CACT,MAAM/pC,EAAIgK,EAAOhH,EAAI6kC,EAAOhmC,EAAI2nC,EAAOrmC,EAAIsmC,EAAOrK,EAAIsK,EAAOrnC,EAAIsnC,EACjE,KAAI3pC,EAAIgD,GAWR,MAXA,CACI,MAAMkE,EAAsJ,GAA9I0iC,EAAIzmC,EAAI0mC,EAAW,EAAJ7pC,GAAS6pC,EAAMD,EAAElC,MAASkC,EAAEh3B,OAAOi3B,GAAO,IAASC,EAAM1K,EAAI2K,EAAW,EAAJ/pC,EAAS+pC,EAAMD,EAAIpC,MAASoC,EAAIl3B,OAAOm3B,GAAO,GAAQloC,GACvJQ,EAAEuQ,OAAO5S,GAAgC,EAA1B0oC,EAAqBxhC,GACpC8C,EAAShK,EAAI,EACb6nC,EAAQ7kC,EACRwmC,EAAQf,EAAqBvhC,GAC7BuiC,EAAQtmC,EACRumC,EAAQtK,EACRuK,EAAQtnC,IAUhB2nC,CAAkB,EAAGT,EAAQ,EAAGpmC,EAAGi8B,EAAG/8B,GAC/BumC,EAAmBvmC,GAuCvB,SAAS4nC,EAAiB9mC,EAAGi8B,GAChC,MAAMmK,EAAiD,EAAxCjB,EAAoBnlC,EAAEukC,MAAOtI,EAAEsI,OACxCrlC,EAAIsmC,EAAqBY,GAC/B,OAvCG,SAA2Bv/B,EAAO69B,EAAO2B,EAAOC,EAAOC,EAAOC,GACjE,IAAIC,EAAGC,EAAKC,EAAKC,EACjBG,EACA,OAAa,CACT,MAAMlqC,EAAIgK,EAAOhH,EAAI6kC,EAAOhmC,EAAI2nC,EAAOrmC,EAAIsmC,EAAOrK,EAAIsK,EAAOrnC,EAAIsnC,EACjE,GAAI3pC,EAAIgD,EAAG,CACP,MAAMkE,EAAsJ,GAA9I0iC,EAAIzmC,EAAI0mC,EAAW,EAAJ7pC,GAAS6pC,EAAMD,EAAElC,MAASkC,EAAEh3B,OAAOi3B,GAAO,IAASC,EAAM1K,EAAI2K,EAAW,EAAJ/pC,EAAS+pC,EAAMD,EAAIpC,MAASoC,EAAIl3B,OAAOm3B,GAAO,GAAQloC,GACvJ,GAAIqF,EAAI,EAAG,CACP7E,EAAEuQ,OAAO5S,GAAgC,EAA1B0oC,EAAqBxhC,GACpC8C,EAAShK,EAAI,EACb6nC,EAAQ7kC,EACRwmC,EAAQf,EAAqBvhC,GAC7BuiC,EAAQtmC,EACRumC,EAAQtK,EACRuK,EAAQtnC,EACR,SAAS6nC,EAER,CACD,MAAMznB,EAAOvb,EAtMK,SAsMqB,EACvC7E,EAAEuQ,OAAO5S,GAAkC,EAA5B0oC,EAAqBjmB,GACpCzY,EAAShK,EAAI,EACb6nC,EAAQ7kC,EACRwmC,EAASf,EAAqBhmB,GAAO,EACrCgnB,EAAQtmC,EACRumC,EAAQtK,EACRuK,EAAQtnC,EACR,SAAS6nC,GAIb,OAAa,IAANroC,GASXqoC,CAAkB,EAAGX,EAAQ,EAAGpmC,EAAGi8B,EAAG/8B,GAC/B2mC,EAAmB,GAGnBJ,EAAmBvmC,GAI3B,SAAS8nC,EAAoBhnC,GAChC,OAAmB,IAAZA,EAAEukC,MAgBN,SAAS0C,EAAmBjnC,EAAGi8B,GAClC,GAAIj8B,EAAEukC,QAAUtI,EAAEsI,MAAO,CAoBrB,MAnBc,EAAC2C,EAAQC,EAAQtgC,KAE3B,OAAa,CACT,MAAMugC,EAAKF,EAAQG,EAAKF,EAAQtqC,EAAIgK,EACpC,IAAW,IAAPhK,EACA,OAAO,EAEN,GAAIuqC,EAAGvqC,KAAOwqC,EAAGxqC,GAOlB,OAAO,EANPqqC,EAASE,EACTD,EAASE,EACTxgC,EAAShK,EAAI,IASlByqC,CAAMtnC,EAAEyP,OAAQwsB,EAAExsB,OAAQzP,EAAEukC,MAAQ,GAG3C,OAAO,EA0CR,SAASgD,EAAqBvnC,EAAGi8B,GACpC,GAAIj8B,EAAEukC,MAAQtI,EAAEsI,MACZ,OAAQ,EAEP,GAAIvkC,EAAEukC,MAAQtI,EAAEsI,MACjB,OAAO,EAyBP,OAAgD,EAtBlC,EAAC2C,EAAQC,EAAQtgC,KAE3B,OAAa,CACT,MAAMugC,EAAKF,EAAQG,EAAKF,EAAQtqC,EAAIgK,EACpC,IAAW,IAAPhK,EACA,OAAO,EAEN,GAAIuqC,EAAGvqC,KAAOwqC,EAAGxqC,GAMjB,OAAIuqC,EAAGvqC,GAAKwqC,EAAGxqC,IACR,EAGD,EATPqqC,EAASE,EACTD,EAASE,EACTxgC,EAAShK,EAAI,IAYlByqC,CAAMtnC,EAAEyP,OAAQwsB,EAAExsB,OAAQzP,EAAEukC,MAAQ,GAI5C,SAASiD,EAAgBxnC,EAAGi8B,GAC/B,OAAuC,IAAhCsL,EAAqBvnC,EAAGi8B,GAW5B,SAASwL,EAAiBznC,EAAGi8B,GAChC,OAAuC,IAAhCsL,EAAqBvnC,EAAGi8B,GAwD5B,SAASyL,EAAgClB,EAAOH,EAAO9c,GAE1D,OAAa,CACT,MAAMrqB,EAAIsnC,EAAO9nC,EAAI2nC,EAAOhgB,EAAIkD,EAChC,KAAI,YAAQ7qB,EAAG,YAAS,EAAG,GAAG,IAAU,GAQxC,MARA,CACI,MAAMipC,EAAM,YAAY5C,EAAqB7lC,EAAGmnB,GAAI3nB,GACpDsmC,EAAsB9lC,EAAGmnB,IAAM,YAAM,YAAcshB,EAAKtC,KACxDmB,EAAQtnC,EACRmnC,EAAQ,YAAYsB,EAAKvC,GACzB7b,EAASlD,EAAI,IAOlB,SAASuhB,EAAmC5nC,EAAGi8B,GAClD,MAAM4L,EAA6B,EAAxBhD,EAAmB7kC,GACxBd,EAAIsmC,EAAqBqC,EAAK,GAC9BC,EAAM,YAAY7L,GAAG,EAAO,GAClC,IAAIv9B,EAAI,YAAS,EAAG,GAAG,GACvB,IAAK,IAAI7B,EAAI,EAAGA,GAAMgrC,EAAK,EAAIhrC,IAAK,CAChC,MAAM8qC,EAAM,YAAY,YAAYjpC,EAAGqmC,EAAqB7lC,EAAGrC,IAAK,YAAYkoC,EAAqB/kC,EAAGnD,GAAIirC,IAC5G9C,EAAsB9lC,EAAGrC,IAAM,YAAM,YAAc8qC,EAAKtC,KACxD3mC,EAAI,YAAYipC,EAAKvC,GAGzB,OADAsC,EAAgCxoC,EAAGR,EAAGmpC,GAC/BpC,EAAmBvmC,GAsBvB,SAAS6oC,EAA2B/nC,EAAGi8B,GAC1C,MAAM+L,EAAmC,IAA1BnD,EAAmB7kC,GAC5BioC,EAAmC,IAA1BpD,EAAmB5I,GAClC,OAAI+L,GAASC,EA5DV,SAA6CjoC,EAAGi8B,GACnD,MAAM/8B,EAAIsmC,EAAqB,GACzBmC,EAAM,YAAY,YAAY3nC,GAAG,EAAO,GAAI,YAAYi8B,GAAG,EAAO,IAGxE,OAFA+I,EAAsB9lC,EAAG,IAAM,YAAM,YAAcyoC,EAAKtC,KACxDL,EAAsB9lC,EAAG,IAAM,YAAM,YAAYyoC,EAAKvC,KAC/CK,EAAmBvmC,GAwDfgpC,CAAoCpD,EAAmB9kC,EAAG,GAAI8kC,EAAmB7I,EAAG,IAEtF+L,EACEJ,EAAmC3L,EAAG6I,EAAmB9kC,EAAG,IAE9DioC,EACEL,EAAmC5nC,EAAG8kC,EAAmB7I,EAAG,IA7BpE,SAAgDj8B,EAAGi8B,GACtD,MAAM/8B,EAAIsmC,EAAqBxlC,EAAEukC,MAAQtI,EAAEsI,OACrC4D,EAAKjpC,EAAEuQ,OACb,IAAK,IAAI5S,EAAI,EAAGA,GAAMmD,EAAEukC,MAAQ,EAAI1nC,IAAK,CACrC,MAAMurC,EAAM,YAAYpoC,EAAEyP,OAAO5S,IAAI,EAAO,GAC5C,IAAI6B,EAAI,YAAS,EAAG,GAAG,GACnB2nB,EAAIxpB,EACR,IAAK,IAAIkB,EAAI,EAAGA,GAAMk+B,EAAEsI,MAAQ,EAAIxmC,IAAK,CACrC,MAAMsqC,EAAM,YAAYpM,EAAExsB,OAAO1R,IAAI,EAAO,GACtC4pC,EAAM,YAAY,YAAY,YAAYQ,EAAG9hB,IAAI,EAAO,GAAI3nB,GAAI,YAAY0pC,EAAKC,IACvFF,EAAG9hB,GAAkE,IAAxD,YAAM,YAAcshB,EAAKtC,IACtC3mC,EAAI,YAAYipC,EAAKvC,GACrB/e,EAAMA,EAAI,EAAK,EAEnBqhB,EAAgCxoC,EAAGR,EAAG2nB,GAE1C,OAAOof,EAAmBvmC,GAgBfopC,CAAuCtoC,EAAGi8B,GAIlD,MAAM,UAA8B,IACvC,YAAYsM,EAAMC,EAAWniB,EAAGoiB,EAAMC,EAAM5qB,EAAOE,GAC/C7X,QACA1F,KAAK8nC,KAAe,EAAPA,EACb9nC,KAAK+nC,UAAyB,EAAZA,EAClB/nC,KAAK4lB,EAAS,EAAJA,EACV5lB,KAAKgoC,KAAe,EAAPA,EACbhoC,KAAKioC,KAAe,EAAPA,EACbjoC,KAAKqd,MAAiB,EAARA,EACdrd,KAAKud,OAASA,GAQf,SAAS2qB,EAAwBJ,EAAMliB,EAAGoiB,EAAMC,GACnD,OAAO,IAAI,EAAsBH,EAAMrD,EAAmB,EAAGqD,GAAOliB,EAAGoiB,EAAMC,KAnf5C,GAmf8EH,GAAQ,eAnftF,GAmf6HA,GAAS1rC,GAAMqoC,EAAmB,EAAGqD,EAAO1rC,GAAI+nC,aAG3M,MAAMgE,EAAqB,CAACD,EAAwB,EAAG,GAAI,UAAW,WAAYA,EAAwB,EAAG,GAAI,SAAU,WAAYA,EAAwB,EAAG,GAAI,SAAU,UAAWA,EAAwB,EAAG,GAAI,QAAS,UAAWA,EAAwB,EAAG,GAAI,QAAS,SAAUA,EAAwB,EAAG,GAAI,OAAQ,SAAUA,EAAwB,EAAG,GAAI,MAAO,QAASA,EAAwB,EAAG,GAAI,MAAO,QAASA,EAAwB,EAAG,GAAI,KAAM,OAAQA,EAAwB,GAAI,GAAI,KAAM,OAAQA,EAAwB,GAAI,EAAG,IAAK,MAAOA,EAAwB,GAAI,EAAG,GAAI,KAAMA,EAAwB,GAAI,EAAG,GAAI,MA+BpmB,YArhBC,GAqhBkC9rC,GAAOqoC,EAAmB,EAAGroC,GAAK,EAAI+nC,YAEvE,YAvhBD,GAuhBoC/nC,GAAMqoC,EAAmB,EAAGroC,GAAI+nC,YAEhE,YAzhBJ,GAyhBuC/nC,GAAMooC,EAAmB,YAAS,EAAG,GAAG,GAAQpoC,IA4ItE+rC,EAAmB,GAAGF,KAErE,SAASG,EAAiB7oC,EAAGi8B,GAChC,OAAO8L,EAA2B/nC,EAAGi8B,GAGlC,SAAS6M,EAA6B/kC,EAAGiG,EAAG2b,EAAG9lB,GAClD,MAAMgjB,EAAe,CAAC9e,EAAE0L,OAAQy2B,EAAoBniC,IAC9Cub,EAAMuD,EAAa,GACnBkmB,EAAiB,CAACpjB,EAAElW,OAAQy2B,EAAoBvgB,IAChDqjB,EAAyB,EAApBD,EAAe,GACpBE,EAAMF,EAAe,GACrBG,EAAM,YAAYl/B,GAAG,EAAO,GAClC,IAAIjM,EAAI,EACJ0oC,EAAI,YAAYyC,EAAK,YAAYD,EAAI,IAAI,EAAO,IACpD,KAAQ,YAAQxC,EAAG,YAAS,EAAG,GAAG,IAAU,GAAa1oC,EAAIirC,GAAK,CAC9D,GAAIjrC,EAAI8kB,EAAa,GACjB,MAAM,IAAKpe,MAAM,qEAErB,IAAI0kC,IAAS,YAAM,YAAc1C,EAAGpB,IAChC+D,EAAM,YAAY3C,EAAGrB,GACrB+D,GAAO7pB,EAAIvhB,EAAI8B,GACfyf,EAAIvhB,EAAI8B,GAAOyf,EAAIvhB,EAAI8B,GAAKspC,EAAO,GAGnC7pB,EAAIvhB,EAAI8B,GAAOyf,EAAIvhB,EAAI8B,IA5rBD,SA4rB4BspC,GAAQ,EAC1DC,EAAM,YAAYA,EAAK,YAAS,EAAG,GAAG,KAGtC3C,EADA1oC,EAAIirC,EACA,YAAYI,EAAK,YAAYF,EAAK,YAAYD,EAAIlrC,EAAI,IAAI,EAAO,KAGjEqrC,EAERrrC,EAAMA,EAAI,EAAK,EAEd0nC,EAAmB1hC,GASrB,SAASslC,EAA6BtlC,EAAGiG,EAAG2b,EAAG9lB,GAClD,MAAMgjB,EAAe,CAAC9e,EAAE0L,OAAQy2B,EAAoBniC,IAC9Cub,EAAMuD,EAAa,GACnBkmB,EAAiB,CAACpjB,EAAElW,OAAQy2B,EAAoBvgB,IAChDqjB,EAAyB,EAApBD,EAAe,GACpBE,EAAMF,EAAe,GACrBG,EAAM,YAAYl/B,GAAG,EAAO,GAClC,IAAIjM,EAAI,EACJ0oC,EAAI,YAAYyC,EAAK,YAAYD,EAAI,IAAI,EAAO,IACpD,KAAQ,YAAQxC,EAAG,YAAS,EAAG,GAAG,IAAU,GAAa1oC,EAAIirC,GAAK,CAC9D,GAAIjrC,EAAI8kB,EAAa,GACjB,MAAM,IAAKpe,MAAM,qEAErB,IAAI0kC,IAAS,YAAM,YAAc1C,EAAGpB,IAChC+D,EAAM,YAAY3C,EAAGrB,GACrB+D,EA/tBsB,SA+tBM7pB,EAAIvhB,EAAI8B,GACpCyf,EAAIvhB,EAAI8B,GAAOyf,EAAIvhB,EAAI8B,GAAKspC,EAAO,GAGnC7pB,EAAIvhB,EAAI8B,GAAOspC,GAnuBO,SAmuBqB7pB,EAAIvhB,EAAI8B,IAAO,EAC1DupC,EAAM,YAAYA,EAAK,YAAS,EAAG,GAAG,KAGtC3C,EADA1oC,EAAIirC,EACA,YAAYI,EAAK,YAAYF,EAAK,YAAYD,EAAIlrC,EAAI,IAAI,EAAO,KAGjEqrC,EAERrrC,EAAMA,EAAI,EAAK,EAEd0nC,EAAmB1hC,GASrB,SAASulC,EAA0BvlC,EAAG4hB,EAAG9lB,GAC5C,MAAMgjB,EAAe,CAACqjB,EAAoBvgB,GAAIugB,EAAoBniC,IAC5DwlC,EAAyB,EAAlB1mB,EAAa,GACpB2mB,EAAyB,EAAlB3mB,EAAa,GAC1B,GAAI0mB,EAAQC,EAAO3pC,EACf,OAAO,EAEN,CACD,MAAMkpC,EAAiB,CAACpjB,EAAElW,OAAQ1L,EAAE0L,QAC9Bg6B,EAAKV,EAAe,GACpBW,EAAKX,EAAe,GACpB/+B,EAAmgB,GAApf,IAATw/B,EAAgBD,IAAS1pC,KAAU4pC,EAAG5pC,GAAK6pC,EAAG,MAAY,YAAM,YAAY,YAAY,YAAY,YAAYD,EAAGF,IAAO,EAAO,GAAInE,GAAwB,YAAYqE,EAAGF,EAAO,IAAI,EAAO,IAAK,YAAYG,EAAG,IAAI,EAAO,KAAYH,IAAUC,EAAO3pC,KAAW4pC,EAAGF,IAASG,EAAGF,GAAQ,MAAY,YAAM,YAAY,YAAY,YAAY,YAAYC,EAAGF,IAAO,EAAO,GAAInE,GAAwB,YAAYqE,EAAGF,EAAO,IAAI,EAAO,IAAK,YAAY,YAAYG,EAAGF,IAAO,EAAO,GAAI,YAAS,EAAG,GAAG,OACzf,OAAU,IAANx/B,EAC8C,IApfb2/B,EAofA9pC,EApfIo8B,EAofDl4B,EApfI6lC,EAofD,GApfT5pC,EAofA2lB,GAnf/B4e,MAAQoF,EAAO1N,EAAEsI,MAAQqF,GACpB,EAEF5pC,EAAEukC,MAAQoF,EAAO1N,EAAEsI,MAAQoF,EAC1B,EA6BgD,EA1BzC,EAACzC,EAAQC,EAAQtgC,KAC3BygC,EACA,OAAa,CACT,MAAMF,EAAKF,EAAQG,EAAKF,EAAQtqC,EAAIgK,EACpC,IAAW,IAAPhK,EACA,OAAO,EAEN,CACD,MAAMurC,EAAoC,GAA5BvrC,EAAI8sC,EAAM,EAAIvC,EAAGvqC,EAAI8sC,IAC7BE,EAAoC,GAA5BhtC,EAAI+sC,EAAM,EAAIvC,EAAGxqC,EAAI+sC,IACnC,GAAIxB,IAAQyB,EAAK,CACb3C,EAASE,EACTD,EAASE,EACTxgC,EAAShK,EAAI,EACb,SAASyqC,EAER,OAAIc,EAAMyB,GACH,EAGD,KAMhBvC,CAAMtnC,EAAEyP,OAAQwsB,EAAExsB,OAASzP,EAAEukC,MAAQoF,EAAM,IAmdnC,EAGA,EAIA,EAAJ3/B,EA5fZ,IAAmChK,EAAG2pC,EAAI1N,EAAG2N,EAigB7C,SAASE,EAAoBrO,EAAG9V,GACnC,GAAIqhB,EAAoBrhB,GACpB,MAAM,IAAKlhB,MAEV,GAAIyhC,EAAoBzK,GAAKyK,EAAoBvgB,GAClD,MAAO,CAACsgB,EAAmBxK,GAE1B,CACD,MAAM13B,EAnvBP,SAA4BA,GAC/B,OAAO,IAAI,EAAOA,EAAEwgC,MAAO,YAAKxgC,EAAE0L,SAkvBpBs6B,CAAmBtO,GACvB98B,EAAI6mC,EAAuBU,EAAoBzK,GAAKyK,EAAoBvgB,GAAM,EAAK,GACzF,IAAI3lB,EAAIkmC,EAAoBzK,GAC5B,MAAMh9B,EAA6B,EAAzBynC,EAAoBvgB,GAC9B,IAAI9lB,EAAIG,EAAIvB,EACZ,MAAMurC,EAAa/f,MAEnB,IAAI9J,GAAW,EACf,MAAQA,GAAU,CACd6pB,EAAU,CAACrrC,EAAGoF,EAAGlE,EAAGG,IACpB,MAAMgK,EAAyC,EAArCs/B,EAA0BvlC,EAAG4hB,EAAG9lB,GACtCmK,EAAI,GACJ8+B,EAA6B/kC,EAAGiG,EAAG2b,EAAG9lB,GACtCwpC,EAA6B1qC,EAAGqL,EAAGg8B,EAAkBnmC,GACrDmqC,EAAU,CAACrrC,EAAGoF,EAAGlE,EAAGG,MAGpBmgB,EAAmB,IAANnW,GAAkB,IAANnK,EACpBsgB,IACGngB,IAAOvB,EAAIoB,GACXmqC,EAAU,CAACrrC,EAAGoF,EAAGlE,EAAI,EAAGG,IACxBH,EAAMA,EAAI,EAAK,IAGfmqC,EAAU,CAACrrC,EAAGoF,EAAGlE,EAAI,EAAGG,EAAI,IAC5BH,EAAMA,EAAI,EAAK,EACfG,EAAMA,EAAI,EAAK,KAK/B,MAAO,CAACylC,EAAmB9mC,GAAI8mC,EAAmB1hC,KAkEnD,MAAMkmC,EAAmBpE,EAAmB,GA0D5C,SAASqE,EAAqBrqC,GAiBjC,MAhBkB,EAACiiB,EAASyH,EAAO1iB,KAE/B,OAAa,CACT,MAAM6B,EAAMoZ,EAASuE,EAAIkD,EAAO1sB,EAAIgK,EACpC,GAAIhK,IAAMgD,EAAE0kC,MACR,OAAO77B,EAGPoZ,EAAWpZ,EAAO2d,EAAIxmB,EAAE4P,OAAO5S,GAC/B0sB,EA97BkB,SA87BTlD,EACTxf,EAAShK,EAAI,IAMlBstC,CAAU,EAAG,EAAG,GAGpB,SAASC,EAAqBvqC,GACjC,OAAOgmC,EAAmBhmC,GAGvB,SAASwqC,EAAqBxqC,GACjC,OAx3BG,SAA8BkE,GACjC,MAAMub,EAAO,YAAQvb,EAAG,YAAS,EAAG,GAAG,IAAU,EAAK,YAAS,EAAG,GAAG,GAASA,EACxE7E,EAAIsmC,EAtByB,GAuBnC,IAAK,IAAI3oC,EAAI,EAAGA,GAAK,EAA+BA,IAChDqC,EAAEuQ,OAAO5S,GAAuH,IAA7G,YAAM,YAAW,YAAYyiB,EAAK2lB,EAAmBG,EAAuBvoC,IAAKuoC,IAExG,OAAOK,EAAmBvmC,GAk3BnBorC,CAAqBzqC,GAsDzB,SAAS0qC,EAAsB1qC,GAClC,MAAM2qC,EAAgC,EAAzBtE,EAAoBrmC,GAiB3BoiB,EAAU,CAACwoB,EAAeC,EAAYC,EAASC,KACjD3oB,EACA,OAAa,CACT,MAAM4oB,EAAYJ,EAAeh7B,EAASi7B,EAAYI,EAAMH,EAAS3lB,EAAQ4lB,EAC7E,GAAK,YAAQ5lB,GAoBR,CACD,MAAM+lB,EAAiC,EAA3BhF,EAAoB+E,GAChC,OAAID,GAAqB,IAARE,EACNt7B,EAGA,YAAK,YAAcs7B,GAAMt7B,GA1BnB,CACjB,MAAMu7B,EAAU,YAAKhmB,GACfnC,EAAeinB,EAAoBgB,EAAK,YAAK9lB,GAAO,IACpDimB,EAAKpoB,EAAa,GAClBqoB,EAAKroB,EAAa,GACxB,GAAIgoB,GAAY7D,EAAoBkE,GAAa,CAC7CT,EAAgBI,EAChBH,EAAaj7B,EACbk7B,EAAUM,EACVL,EAAYI,EACZ,SAAS/oB,EAGTwoB,EAAgBI,EAChBH,EAAazoB,GAAQ,EAAOxS,EAAQw7B,EAAID,GACxCL,EAAUO,EACVN,EAAYI,EACZ,SAAS/oB,KAenBkpB,EAAWlpB,GAAQ,EAAM,cAASpiB,EApD1B,EAACurC,EAAW7hB,EAAO8hB,KAE7B,OAAa,CACT,MAAMC,EAAQF,EAAW/kB,EAAIkD,EAAOgiB,EAAQF,EAC5C,GAAInF,EAAoBqF,GAASf,EAC7B,OAAO,YAAK,CAACnkB,EAAGklB,GAAQD,GAGxBF,EAAY,YAAK,CAAC/kB,EAAGklB,GAAQD,GAC7B/hB,EAASlD,EAAI,EACbglB,EAAYxC,EAAiB0C,EAAOA,KA0CLC,CAAM,cAAS,EAAG3F,EAAmB,MAChF,OAAI,YAAQsF,GACD,IAGA,YAAK,GAAI,YAAQA,IAIzB,SAASM,EAAsB39B,GAClC,MAAMzF,EAAmB,EAAbyF,EAAI/Q,OAChB,GAAI,YAAc+Q,GACd,MAAM,IAAKrJ,MAAM,sCAErB,MAAMinC,EAAM7F,EAAmB,IAsB/B,MArBc,EAAC/jB,EAASjb,KACpB8kC,EACA,OAAa,CACT,MAAMjjC,EAAMoZ,EAASjlB,EAAIgK,EACzB,GAAIhK,IAAMwL,EACN,OAAOK,EAEN,CACD,MAAM/J,EAAKmP,EAAIjR,GAAGoa,WAAW,GAAK,IAAIA,WAAW,GAAM,EACvD,GAAK,GAAKtY,GAAMA,GAAK,EAAY,CAC7BmjB,EAAUqkB,EAAiB0C,EAAiB6C,EAAKhjC,GAAMm9B,EAAmBlnC,IAC1EkI,EAAShK,EAAI,EACb,SAAS8uC,EAGT,MAAM,IAAKlnC,SAMpBknC,CAAM9F,EAAmB,GAAI,GAGjC,SAAS+F,EAAqB/rC,GACjC,OAAOA,EAAE0kC,OAAS,EAGf,SAASsH,GAAsBhsC,GAClC,MAAM4mC,EAAI5mC,EAEV,OADU,EACF4mC,EAAElC,MACe,EAAdkC,EAAEh3B,OAFH,GAKC,E,sBCl5CR,MAAM,WAAmB,IAC5B,YAAYq8B,EAAS5mC,GACjBiB,QACA1F,KAAKqrC,QAAqB,EAAVA,EAChBrrC,KAAKyE,EAAIA,EAEb,WACI,MAAMnB,EAAItD,KAEV,OADgD,EAA7BsrC,GAAwBhoC,IAEvC,KAAM,EACF,OAAOijC,EAAoBgF,GAAkBjoC,IAAM,IAAO,IAAMwmC,EAAsByB,GAAkBjoC,IAE5G,KAAK,EACD,MAAO,IAEX,KAAK,EACD,OAAOwmC,EAAsByB,GAAkBjoC,IAEnD,QACI,MAAM,IAAKU,MAAM,+BAI7B,OAAOoB,GAEH,OAAQA,aAAe,IAAcomC,GADvBxrC,KAC8DoF,GAEhF,cAEI,OAAsC,GAkWP,IAA/BkmC,GADkCtF,EAlWxBhmC,MAoWH,EAGCsrC,GAAwBtF,GDzHjC,SAA2B5mC,GAC9B,IAAIyI,EAAM,EACV,IAAK,IAAIzL,EAAI,EAAGA,GAAMgD,EAAE0kC,MAAQ,EAAI1nC,IAChCyL,EAAQzI,EAAE4P,OAAO5S,IAAMyL,GAAO,GAAM,EAExC,OAAa,EAANA,ECoHkC4jC,CAAkBF,GAAkBvF,IAAO,GALjF,IAAmCA,EA/VtC,OAAOz/B,GAEH,OAAO,YADOvG,MAGlB,UAAUoF,GAEN,GAAIA,aAAe,GACf,OAAiD,GA6UrDsmC,GADoCtsC,EA9UtBY,KA8UyB2rC,EA5UOvmC,IA8UtC,EAEHomC,GAAgCpsC,EAAGusC,GACjC,EAGA,GAjVH,MAAM,IAAK3nC,MAAM,wDAyUtB,IAAqC5E,EAAGusC,GAhUxC,SAASC,GAA0BP,EAAS5mC,GAC/C,OAAO,IAAI,GAAW4mC,EAAS5mC,GAW5B,SAASonC,GAAyBzsC,GACrC,OAAI+rC,EAAqB/rC,IAAMgsC,GAAsBhsC,GAAK,GAAW0sC,SAC1D,GAAWC,YAAYX,GAAsBhsC,IAG7CA,EAIR,SAAS4sC,GAA2BtuC,EAAG0B,GAC1C,OAAOwsC,GAA0BluC,EAAGmuC,GAAyBzsC,IAG1D,SAAS6sC,GAA0B7sC,GACtC,OAAOwsC,GAA0B,EAAGC,GAAyBzsC,IAG1D,SAAS8sC,GAA0B9sC,GACtC,OAAOwsC,IAA2B,EAAGC,GAAyBzsC,IAY3D,SAASksC,GAAwBhoC,GACpC,OAAOA,EAAE+nC,QAGN,SAASE,GAAkBjoC,GAC9B,OAAOA,EAAEmB,EAGN,SAAS+mC,GAAgCloC,EAAG6H,GAC/C,MAAMlF,EAAa,CAACqlC,GAAwBhoC,GAAIgoC,GAAwBngC,IACxE,IAAIghC,EA8CJ,OA3CQA,GAFe,IAAnBlmC,EAAW,IACY,IAAnBA,EAAW,GACe,EAEH,IAAlBA,EAAW,GACU,EAEH,IAAlBA,EAAW,GACU,EAGA,EAGP,IAAlBA,EAAW,IACO,IAAnBA,EAAW,GACe,EAEH,IAAlBA,EAAW,GACU,EAEH,IAAlBA,EAAW,GACU,EAGA,EAGP,IAAlBA,EAAW,IACO,IAAnBA,EAAW,GACe,EAEH,IAAlBA,EAAW,GACU,EAEH,IAAlBA,EAAW,GACU,EAGA,EAIJ,EAEtBkmC,GACJ,KAAK,EAGL,KAAK,EACD,OAAO3F,EAAmB+E,GAAkBjoC,GAAIioC,GAAkBpgC,IAEtE,KAAK,EAQL,KAAK,EACD,QAAIo7B,EAAoBgF,GAAkBjoC,KAC/BijC,EAAoBgF,GAAkBpgC,IAMrD,KAAK,EACD,OAAO,EAEX,KAAK,EAGL,KAAK,EACD,OAAOo7B,EAAoBgF,GAAkBpgC,IAEjD,KAAK,EAGL,KAAK,EACD,OAAOo7B,EAAoBgF,GAAkBjoC,IAEjD,KAAK,EACD,MAAM,IAAKU,MAAM,mDAStB,SAAS0nC,GAAgCpoC,EAAG6H,GAC/C,MAAMlF,EAAa,CAACqlC,GAAwBhoC,GAAIgoC,GAAwBngC,IACxE,IAAIghC,EA8CJ,OA3CQA,GAFe,IAAnBlmC,EAAW,IACY,IAAnBA,EAAW,GACe,EAEH,IAAlBA,EAAW,GACU,EAEH,IAAlBA,EAAW,GACU,EAGA,EAGP,IAAlBA,EAAW,IACO,IAAnBA,EAAW,GACe,EAEH,IAAlBA,EAAW,GACU,EAEH,IAAlBA,EAAW,GACU,EAGA,EAGP,IAAlBA,EAAW,IACO,IAAnBA,EAAW,GACe,EAEH,IAAlBA,EAAW,GACU,EAEH,IAAlBA,EAAW,GACU,EAGA,EAIJ,EAEtBkmC,GACJ,KAAK,EACD,OAAOpF,EAAgBwE,GAAkBjoC,GAAIioC,GAAkBpgC,IAEnE,KAAK,EACD,OAAO47B,EAAgBwE,GAAkBpgC,GAAIogC,GAAkBjoC,IAEnE,KAAK,EACD,OAAO,EAEX,KAAK,EACD,OAAKijC,EAAoBgF,GAAkBjoC,MAI/BijC,EAAoBgF,GAAkBpgC,IAGtD,KAAK,EACD,OAAO,EAEX,KAAK,EACD,OAAQo7B,EAAoBgF,GAAkBpgC,IAElD,KAAK,EAGL,KAAK,EACD,OAAO,EAEX,KAAK,EACD,OAAQo7B,EAAoBgF,GAAkBjoC,IAElD,KAAK,EACD,MAAM,IAAKU,MAAM,mDAqHtB,SAASooC,GAA2BhtC,GACvC,OAAIA,GAAK,EACEwsC,GAA0B,EAAGC,GAAyBlC,EAAqBvqC,KAG3EwsC,IAA2B,EAAGC,IADzB,aAAPzsC,EACyDwqC,EAAqB,YAAiB,YAAYxqC,GAAG,EAAO,KAG5DuqC,EAAqB,aAAuBvqC,MAI3G,SAASitC,GAA2BjtC,GACvC,OAAI,YAAQA,EAAG,YAAS,EAAG,GAAG,KAAW,EAC9BwsC,GAA0B,EAAGC,GAAyBjC,EAAqBxqC,KAE7E,YAAOA,EAAG,YAAS,EAAG,YAAY,IAChCwsC,IAA2B,EAAGC,GAAyBnG,EAAiBkE,EAAqB,YAAS,WAAY,YAAY,IAASrE,KAGvIqG,IAA2B,EAAGC,GAAyBjC,EAAqB,YAAiBxqC,MAIrG,SAASktC,KACZ,OAAO,GAAW/P,IAGf,SAASgQ,KACZ,OAAO,GAAWC,IAGf,SAASC,KACZ,OAAO,GAAWC,KAGf,SAASC,GAAsC3G,GAClD,MAAM//B,EAA0C,EAA7BqlC,GAAwBtF,GAC3C,OAAmB,IAAf//B,EACOwmC,KAGAT,GAA2B,aAAuB/lC,GAAaslC,GAAkBvF,IAgBzF,SAAS4G,GAAyBC,EAAIC,GACzC,OAAI9F,EAAiB6F,EAAIC,GACdb,GAA0B5F,EAAiBwG,EAAIC,IAG/CZ,GAA0B7F,EAAiByG,EAAID,IAIvD,SAASE,GAAyBF,EAAIC,GACzC,OAAOb,GAA0BvG,EAAiBmH,EAAIC,IAGnD,SAASE,GAAuB1pC,GACnC,OAAmC,IAA/BgoC,GAAwBhoC,IAIjBijC,EAAoBgF,GAAkBjoC,IAI9C,SAAS2pC,GAAsB3pC,GAClC,OAAmC,IAA/BgoC,GAAwBhoC,KDsDZ,KADe/D,ECpDDgsC,GAAkBjoC,IDqD1CwgC,OACqB,IAAhBvkC,EAAEyP,OAAO,IAFjB,IAA4BzP,EC7C5B,SAAS2tC,GAAgC5pC,EAAG6H,GAC/C,GAAI6hC,GAAuB7hC,GACvB,OAAO7H,EAEN,GAAI0pC,GAAuB1pC,GAC5B,OAAO6H,EAEN,CACD,MAAMlF,EAAa,CAACqlC,GAAwBhoC,GAAIgoC,GAAwBngC,IACxE,IAAIghC,EA0BJ,OAvBQA,GAFe,IAAnBlmC,EAAW,IACY,IAAnBA,EAAW,GACe,EAEH,IAAlBA,EAAW,GACU,EAGA,EAGP,IAAlBA,EAAW,IACO,IAAnBA,EAAW,GACe,EAEH,IAAlBA,EAAW,GACU,EAGA,EAIJ,EAEtBkmC,GACJ,KAAK,EACD,OAAOY,GAAyBxB,GAAkBjoC,GAAIioC,GAAkBpgC,IAE5E,KAAK,EACD,OAAOwhC,GAAsCI,GAAyBxB,GAAkBjoC,GAAIioC,GAAkBpgC,KAElH,KAAK,EACD,OAAOyhC,GAAyBrB,GAAkBjoC,GAAIioC,GAAkBpgC,IAE5E,KAAK,EACD,OAAOyhC,GAAyBrB,GAAkBpgC,GAAIogC,GAAkBjoC,IAE5E,KAAK,EACD,MAAM,IAAKU,MAAM,+CA6D1B,SAASmpC,GAAgC7pC,EAAG6H,GAC/C,GAAI6hC,GAAuB1pC,GACvB,OAAOA,EAEN,GAAI0pC,GAAuB7hC,GAC5B,OAAOA,EAEN,GAAI8hC,GAAsB3pC,GAC3B,OAAO6H,EAEN,GAAI8hC,GAAsB9hC,GAC3B,OAAO7H,EAEN,CACD,MAAMtF,EAAIoqC,EAAiBmD,GAAkBjoC,GAAIioC,GAAkBpgC,IACnE,OAAO6gC,GAA2BV,GAAwBhoC,GAAKgoC,GAAwBngC,GAAInN,IA0E5F,SAASovC,GAAiC9pC,EAAG6H,GAChD,OAAOgiC,GAAgC7pC,EAAG+pC,GAAwBd,KAAsBphC,IA0OrF,SAASkiC,GAAwB/pC,EAAG6H,GACvC,GAAIA,EAAI,EACJ,MAAM,IAAKnH,MAAM,KAErB,MAAMiC,EAAa,CAAC+mC,GAAuB1pC,GAAI6H,GAC/C,GAAIlF,EAAW,GACX,OAAsB,IAAlBA,EAAW,GACJqmC,KAGAG,KAGV,CACD,MAAMa,EAAOlB,GAA2BjhC,GACxC,OAAO6gC,GAA2BzF,EDkM/B8C,EClMoEkC,GAAkB+B,GAAO9D,GDkMnE,IClMwF,EAAI8B,GAAwBhoC,GDuRlJ,SAA0BA,EAAGlE,GA2BhC,MA1Bc,EAACiiB,EAASksB,EAASrD,KAC7BsD,EACA,OAAa,CACT,MAAMvlC,EAAMoZ,EAASxC,EAAM0uB,EAASlD,EAAMH,EAC1C,GAAI3D,EAAoB8D,GACpB,OAAOpiC,EAEN,CACD,MAAMma,EAAeinB,EAAoBgB,EAAKb,GACxCiE,EAAQrrB,EAAa,GAC3B,GAAImkB,EAAoBnkB,EAAa,IAAK,CACtCf,EAAUpZ,EACVslC,EAAUnF,EAAiBvpB,EAAKA,GAChCqrB,EAAUuD,EACV,SAASD,EAGTnsB,EAAU+mB,EAAiBvpB,EAAK5W,GAChCslC,EAAUnF,EAAiBvpB,EAAKA,GAChCqrB,EAAUuD,EACV,SAASD,KAMlBA,CAAMjI,EAAkBjiC,EAAGlE,GClTuHsuC,CAAiBnC,GAAkBjoC,GAAIioC,GAAkB+B,MA0D/M,SAASK,GAAyBrqC,GAErC,OADgD,EAA7BgoC,GAAwBhoC,IAEvC,KAAM,EACF,OAAQmmC,EAAqB8B,GAAkBjoC,IAEnD,KAAK,EACD,OAAO,EAEX,KAAK,EACD,OAAOmmC,EAAqB8B,GAAkBjoC,IAElD,QACI,MAAM,IAAKU,MAAM,mDA6BtB,SAAS4pC,GAA2BnW,GACvC,GAAY,MAARA,EACA,MAAM,IAAKzzB,MAAM,QAErB,MAAM6pC,EAASpW,EAAK/Z,OACd9V,EAAsB,EAAhBimC,EAAOvxC,OACnB,GAAY,IAARsL,EACA,MAAM,IAAK5D,MAEf,MAAMiC,EAAa,CAAC4nC,EAAO,GAAIjmC,GAC/B,GAAsB,MAAlB3B,EAAW,GAAY,CACvB,GAAsB,IAAlBA,EAAW,GACX,MAAM,IAAKjC,MAGX,OAAOioC,GAA0BjB,EAAsB6C,EAAOluC,MAAM,EAAIiI,EAAM,EAAK,KAGtF,GAAsB,MAAlB3B,EAAW,GAAY,CAC5B,GAAsB,IAAlBA,EAAW,GACX,MAAM,IAAKjC,MAGX,OAAOkoC,GAA0BlB,EAAsB6C,EAAOluC,MAAM,EAAIiI,EAAM,EAAK,KAIvF,OAAOqkC,GAA0BjB,EAAsB6C,IClhCxD,SAAS76B,GAAM86B,GAClB,OAAOF,GAA2BE,GDoClC,GAAWhC,SAAW,KACtB,GAAWC,YAAc,YAAW,GAAWD,SAAW1sC,GAAMuqC,EAAqBvqC,IACrF,GAAWm9B,IAAM6P,GAA2B,GAC5C,GAAWI,IAAMJ,GAA2B,GAC5C,GAAWM,KAAON,GAA2B,GCzB1C,MAAMM,GAAOD,KAEDH,KAEAC,KAMZ,SAASwB,KACZ,OAAOtB,KAOJ,SAASuB,GAAU5xC,GACtB,OAAOiwC,GAA2BjwC,GAG/B,SAAS6xC,GAAU7xC,GACtB,OAAIA,EAAI,WACGiwC,GAA2B,YAAYjwC,GAAG,EAAO,IAGjDgwC,GAA2BhwC,GA4CnC,SAAS8xC,GAAU5qC,GACtB,OD25BG,SAAmCA,GACtC,OAAO,IAAI6qC,GAAA,EAAQR,GAAyBrqC,IC55BrC8qC,CAA0B9qC,GA2B9B,SAAS,GAASA,GACrB,OAAO,YAAWA,GAGEmpC,KAEDH,KAEhB,SAASn6B,GAAY27B,EAAOO,GAC/B,OAAOnB,GAAgCY,EAAOO,GAuElD,SAASC,GAAmBC,EAAUC,GAClC,MAAMvoC,EAAa,CAACsoC,EAAUC,GAC9B,OAAIvoC,EAAW,GACJ,CAAoB,KAAP,IAAXsoC,IAAuB,GAET,IAAlBtoC,EAAW,GACT,CAAC,GAAG,GAGJ,CAA6G,KAA3GsoC,EAAY,KAAO,IAAKpK,WAAW,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAKjhB,KAAM9mB,IAAQmyC,EAAY,GAAKnyC,GAAM,KAAa,GAuD1H,SAASqyC,GAAcz8B,GAC1B,GAAa,MAATA,EACA,MAAM,IAAKhO,MAAM,SAErB,GAAqB,IAAjBgO,EAAM1V,OACN,OAAOowC,GAEN,CACD,MAAMgC,EAAiD,IAAT,IAA1B18B,EAAMA,EAAM1V,OAAS,IACnCikC,EAAS,YAAK,IAAIp2B,WAAW,GAAI,EAAG,EAAG,GA2C7C,MA1Ca,EAACwkC,EAAiBC,EAAeC,EAAoBC,KAC9DhpC,EACA,OAAa,CACT,MAAMipC,EAAcJ,EAAiBK,EAAYJ,EAAeK,EAAiBJ,EAAoBL,EAAcM,EACnH,GAAuB,IAAnBG,EAAsB,CACtB,MAAMC,EAAU,YAAK,CAACjnC,EAAKrJ,IAAUsuC,GAAgCE,GAAiCnlC,EAAK,IAAK+lC,GAAU,YAAYpvC,GAAO,EAAO,KAAM8tC,GAAMqC,GAChK,OAAIL,EACOQ,EAGA/B,GAAgCf,IAA4B,GAAI8C,GAG1E,CACD,MAAMC,EAA6E,EAA5D,YAAI,CAAC7rC,EAAG6H,IAAM,YAAkB7H,EAAG6H,GAAI8jC,EAAgB,GAC9E,IAAK,IAAIhJ,EAAM,EAAGA,GAAQkJ,EAAiB,EAAIlJ,IAC3C1F,EAAO0F,GAAOj0B,EAAMg9B,EAAY/I,GAEpC,GAAIyI,EAAY,CACZ,YAAKnO,EAAQ4O,EAAgB,EAAIA,EAAgB,GACjDR,EAAkB,eAAUpO,EAAO,GAAOA,EAAO,IAAM,IAAO,KAAQ,EAAOA,EAAO,IAAM,KAAQ,KAAQ,EAAOA,EAAO,IAAM,KAAQ,KAAQ,EAAGwO,GACjJH,EAAiBI,EAAYG,EAC7BN,EAAsBI,EAAiBE,EACvCL,GAAkB,EAClB,SAAShpC,EAER,CACD,YAAKy6B,EAAQ4O,EAAgB,EAAIA,EAAgB,KACjD,MAAM/sB,EAAeksB,GAAmB/N,EAAO,GAAIiO,GAC7ClG,EAAiBgG,GAAmB/N,EAAO,GAAIne,EAAa,IAC5DgtB,EAAiBd,GAAmB/N,EAAO,GAAI+H,EAAe,IAC9D+G,EAAiBf,GAAmB/N,EAAO,GAAI6O,EAAe,IACpET,EAAkB,eAAUvsB,EAAa,GAAOkmB,EAAe,IAAM,IAAO,KAAQ,EAAO8G,EAAe,IAAM,KAAQ,KAAQ,EAAOC,EAAe,IAAM,KAAQ,KAAQ,EAAGN,GAC/KH,EAAiBI,EAAYG,EAC7BN,EAAsBI,EAAiBE,EACvCL,EAAkBO,EAAe,GACjC,SAASvpC,MAMlBA,CAAK,cAAS,EAAGkM,EAAM1V,QAAQ,M,6BClV9C,iFAOO,MAAMgzC,EACT,YAAYC,EAAOh3B,GACf,MAAMmS,EAAQ,IAAI,IAAU,MAC5B1qB,KAAKuY,SAAWA,EAChBmS,EAAM7W,SAAW7T,KACjBA,KAAKwvC,QAAU,IAAK/P,IAAI,IACxBz/B,KAAK,YAAc,EACnB,MAAM6I,EAAa,YAAc0mC,GACjC,IACI,KAAO1mC,EAAW,8CAA8C,CAC5D,MAAM4mC,EAAO5mC,EAAW,0DACxB6mC,EAAuBhlB,EAAM7W,SAAU47B,EAAK,GAAIA,EAAK,KAG7D,QACI5mC,EAAWC,WAGnBtK,IAAKE,OAAOC,eACR,MAAO,aAEX,OAAO4H,GAEH,OAAOtD,MAAMuD,KADCxG,MAGlB,iDAEI,OAAO,YADOA,MAGlB,gBAEI,OAAO,YAAc,YADPA,KACoBwvC,QAAQxqC,WAE9C,CAACtG,OAAOiI,YACJ,OAAO,YAAW3G,KAAK4G,iBAE3B,oDAAsD+oC,GAElDD,EADc1vC,KACgB2vC,EAAK,GAAIA,EAAK,IAEhD,mDAEIC,EADc5vC,MAGlB,yDAA2D2vC,GACvD,MACM1pC,EAAa4pC,EADL7vC,KACsC2vC,EAAK,IACzD,IAAIxD,EAYJ,OATQA,EAFU,MAAdlmC,GACI,YAAOA,EAAW,GAAI0pC,EAAK,IACD,EAOJ,EAEtBxD,GACJ,KAAK,EACD,OAAO,EAEX,KAAK,EACD,OAAO,GAInB,2DAA6DnqB,EAAO8tB,GAEhE,YAAe,CAAC1zC,EAAGgO,KACf4X,EAAM8tB,EAAa1zC,GAAKgO,GAFdpK,MAKlB,uDAEI,OAAsC,EAA/B+vC,EADO/vC,MAGlB,4DACI,OAAO,EAEX,uDAAyD2vC,GACrD,MAAMjlB,EAAQ1qB,KACRiG,EAAa4pC,EAA0BnlB,EAAOilB,EAAK,IACzD,OAAkB,MAAd1pC,IACI,YAAOA,EAAW,GAAI0pC,EAAK,KACtBK,EAAyBtlB,EAAOilB,EAAK,KAEvC,GAMf,qDAAuDzwC,EAAKN,GAExD8wC,EADc1vC,KACgBd,EAAKN,GAEvC,4DAA8DM,GAE1D,OAAO+wC,EADOjwC,KAC8Bd,GAEhD,yDAA2DA,GAEvD,OAAOgxC,EADOlwC,KAC2Bd,GAE7C,0DAA4DA,EAAKuF,GAE7D0rC,EADcnwC,KACqBd,EAAKuF,GAE5C,sDACI,MAAMimB,EAAQ1qB,KACd,OAAO,YAAQ,YAAM,IAAM,YAAKyvC,GAASA,EAAK,GAAI/kB,KAEtD,uDAAyDxrB,GAErD,OAAO8wC,EADOhwC,KACyBd,GAE3C,+DAAiEA,EAAKN,GAClE,MACMqH,EAAa4pC,EADL7vC,KACsCd,GACpD,GAAkB,MAAd+G,EAAoB,CACpB,MAAMwpC,EAAOxpC,EAEb,OADArH,EAAMiV,SAAW47B,EAAK,IACf,EAGP,OAAO,EAGf,wDACI,MAAM/kB,EAAQ1qB,KACd,OAAO,YAAQ,YAAM,IAAM,YAAKyvC,GAASA,EAAK,GAAI/kB,KAEtD,WAEI,OAAsC,EAA/BqlB,EADO/vC,MAGlB,QAEI4vC,EADc5vC,MAGlB,OAAO4lB,GAEH,OAAOoqB,EADOhwC,KACyB4lB,GAE3C,UAEI,OAAO,YAAKrmB,GAAM,CAACA,EAAE,GAAIA,EAAE,IADbS,MAGlB,IAAI4lB,GAEA,OAAOsqB,EADOlwC,KAC2B4lB,GAE7C,IAAIA,GAEA,OAAOqqB,EADOjwC,KAC8B4lB,GAEhD,OAEI,OAAO,YAAKrmB,GAAMA,EAAE,GADNS,MAGlB,IAAI4lB,EAAGnhB,GAGH,OADA0rC,EADcnwC,KACqB4lB,EAAGnhB,GADxBzE,KAIlB,SAEI,OAAO,YAAKT,GAAMA,EAAE,GADNS,MAGlB,QAAQuJ,EAAGgiB,GACP,MAAMb,EAAQ1qB,KACd,YAAST,IACLgK,EAAEhK,EAAE,GAAIA,EAAE,GAAImrB,IACfA,IAYX,SAAS0lB,EAA+B1lB,EAAO9E,GAC3C,MAAMtf,EAAoC,EAAhCokB,EAAMnS,SAAS7N,YAAYkb,GACrC,IAAI3f,EACAw9B,EAAS,KAIb,OAHAx9B,EAAa,CAAC,YAAYykB,EAAM8kB,QAASlpC,EAAG,IAAI,IAAU,IAAMm9B,EAASh/B,IACrEg/B,EAASh/B,KACRg/B,GACDx9B,EAAW,GACJ,EAAC,EAAMK,EAAGL,EAAW,GAAGu0B,UAAWiV,GAAS/kB,EAAMnS,SAAS3N,OAAOgb,EAAG6pB,EAAK,MAG1E,EAAC,EAAOnpC,GAAI,GAIpB,SAASupC,EAA0BnlB,EAAO9E,GAC7C,MAAM3f,EAAamqC,EAA+B1lB,EAAO9E,GACzD,IAAIumB,EAYJ,OATQA,EAFJlmC,EAAW,IACPA,EAAW,IAAM,EACS,EAOJ,EAEtBkmC,GACJ,KAAK,EACD,OAAO,YAAgBzhB,EAAM8kB,QAASvpC,EAAW,IAAIA,EAAW,IAEpE,KAAK,EACD,QASL,SAAS2pC,EAAkBllB,GAC9BA,EAAM8kB,QAAQ92B,QAGX,SAASq3B,EAAsBrlB,GAClC,IAAIpU,EAAQ,EACRzN,EAAa,YAAc6hB,EAAM8kB,QAAQxqC,UAC7C,IACI,KAAO6D,EAAW,8CAA8C,CAE5DyN,EAAUA,EADIzN,EAAW,0DACDvM,OAAU,GAG1C,QACIuM,EAAWC,UAEf,OAAe,EAARwN,EAGJ,SAAS45B,EAA2BxlB,EAAO9E,GAC9C,MAAM3f,EAAa4pC,EAA0BnlB,EAAO9E,GACpD,GAAkB,MAAd3f,EACA,OAAOA,EAAW,GAGlB,MAAM,IAAKjC,MAAM,wCAIlB,SAASmsC,EAA4BzlB,EAAO9E,EAAGnhB,GAClD,MAAMwB,EAAamqC,EAA+B1lB,EAAO9E,GACzD,IAAIumB,EAYJ,OATQA,EAFJlmC,EAAW,IACPA,EAAW,IAAM,EACS,EAOJ,EAEtBkmC,GACJ,KAAK,EACD,YAAgBzhB,EAAM8kB,QAASvpC,EAAW,IAAIA,EAAW,IAAM,CAAC2f,EAAGnhB,GACnE,MAEJ,KAAK,EACD,GAAIwB,EAAW,GAAI,CACK,YAAgBykB,EAAM8kB,QAASvpC,EAAW,IAAIrJ,KAAK,CAACgpB,EAAGnhB,SAG3EimB,EAAM8kB,QAAQn5B,IAAIpQ,EAAW,GAAI,CAAC,CAAC2f,EAAGnhB,MAO/C,SAASirC,EAAuBhlB,EAAO9E,EAAGnhB,GAC7C,MAAMwB,EAAamqC,EAA+B1lB,EAAO9E,GACzD,IAAIumB,EAYJ,OATQA,EAFJlmC,EAAW,IACPA,EAAW,IAAM,EACS,EAOJ,EAEtBkmC,GACJ,KAAK,EAAG,CACJ,MAAMpW,EAAM,YAAO,6DAA8DnQ,GACjF,MAAM,IAAK5hB,MAAM+xB,GAGrB,KAAK,EACD,GAAI9vB,EAAW,GAAI,CACK,YAAgBykB,EAAM8kB,QAASvpC,EAAW,IAAIrJ,KAAK,CAACgpB,EAAGnhB,SAG3EimB,EAAM8kB,QAAQn5B,IAAIpQ,EAAW,GAAI,CAAC,CAAC2f,EAAGnhB,MAO/C,SAASwrC,EAA8BvlB,EAAO9E,GACjD,MAAM3f,EAAamqC,EAA+B1lB,EAAO9E,GACzD,IAAIumB,EAYJ,OATQA,EAFJlmC,EAAW,IACPA,EAAW,IAAM,EACS,EAOJ,EAEtBkmC,GACJ,KAAK,EACD,OAAO,EAEX,KAAK,EACD,OAAO,GAKZ,SAAS6D,EAAyBtlB,EAAO9E,GAC5C,MAAM3f,EAAamqC,EAA+B1lB,EAAO9E,GACzD,IAAIumB,EAYJ,OATQA,EAFJlmC,EAAW,IACPA,EAAW,IAAM,EACS,EAOJ,EAEtBkmC,GACJ,KAAK,EAED,OADA,YAAgBzhB,EAAM8kB,QAASvpC,EAAW,IAAIzI,OAAOyI,EAAW,GAAI,IAC7D,EAEX,KAAK,EACD,OAAO,K,0WCjWK,IAAS,+DAAT,G,qIA6BCse,G,OAAAA,O,cAEQ,uC,cAErB,YAAE,4BAAO,EAAT,aACE,4BAAO,EADT,aAEE,6BAFF,gC,eAHU,e,WAqBCA,G,OAAAA,O,cACkBmb,uB,cAChB,Y,2BAYD2Q,GAEd,GADIA,M,SApBSA,G,eACT,IAAAA,EAAA,kBACJA,Y,qBAA2BA,E,eAmB3B,CADIA,G,OACe,S,OACnBC,E,SAZa/rB,G,MACqBrlB,EAAKN,EAD1B,4BACb2lB,a,SADa,GACN,IADM,YACN,iBADM,cACJ,YAAF,uBADM,2BACN,c,QAAA,C,MAAoBgsB,EAAA,EADd,YACN,2BAAoBA,QADd,wBACN,2B,IADM,wBACN,yC,IAA2BrxC,EADrBqxC,EAC0B3xC,EAD1B,YACN,wC,2DAAiDM,EAAKN,G,eAW7D,CAFIyxC,GAEJ,GAAAC,S,MAAQpxC,EAFJ,KAESN,EAFT,K,OAEyB,QAAoBM,EAAKN,G,OACtD4xC,E,SATcjsB,G,MACqBrlB,EAAYgoB,EAAMC,EAAbvoB,EAD1B,4BACd2lB,a,SADc,GACP,IADO,YACP,iBADO,eACL,YAAF,uBADO,2BACP,c,QAAA,C,MAAqBksB,EAAA,EADd,YACP,2BAAqBA,QADd,wBACP,4BADO,wBACP,yCADO,wBACP,sDADO,wBACP,kE,IAAA,IADO,YACP,mFADO,wBACP,gF,IAA4BvxC,EADrBuxC,EACiCvpB,EADjC,YACP,oDAA8CC,EADvC,YACP,iEAAiCvoB,EAD1B,YACP,wC,2DACCM,EAAKN,EAAOsoB,EAAMC,G,eAO1B,CAHIkpB,GAGJ,GAAAG,Q,OAAAA,C,MAAStxC,EAHL,KAGiBgoB,EAHjB,KAGuBC,EAHvB,KAGUvoB,EAHV,KAIIqH,GAAA,EAAYihB,GAAM,EAAYC,I,MAC7BupB,EAAcC,E,OADf,wB,IACCD,EAAL,KAAmBC,EAAL,M,qBACN,QAAoBzxC,EAAKN,EAAO8xC,EAASC,G,6BAIlClmB,G,OACrB,YACI,iB,IAAMxkB,EACU/G,EAAWN,E,OAD3B,aAAMqH,GAAA,YAAY,IAAIwkB,GAAM,YAAY,IAAIA,IAAtC,YACJ,cADI,YACUvrB,EAAd,eAAyBN,EAAL,KADtB,aACqCM,EAAKN,KACnC,eAEP,iB,IAAMqH,EACUihB,E,OADhB,aAAMjhB,EAAA,YAAY,OAAOwkB,GAAnB,SACJxkB,WAAcihB,EAAdjhB,YAA8B,EAAgBihB,IACzC,eAED,iB,MAAAjhB,EAAA,YAAY,QAAQwkB,G,MACVtD,E,OADV,SACJlhB,W,IAAckhB,EAAdlhB,a,qBAA+B,EAAgBkhB,G,cAC1C,wB,WAGaypB,G,OACxB,YACI,iB,IAAM3qC,E,OAAN,aAAMA,EAAA,YAAY,OAAO2qC,GAAnB,QAEI,WAFJ,GAAN,YAAA3qC,IAIM,iB,MAAAA,EAAA,YAAY,OAAO2qC,G,MACTnrC,E,OADV,SACJQ,W,IAAcR,EAAdQ,a,qBAA8B,EAAmBR,G,cAC5C,qB,WAIC8e,G,OAAAA,O,+DAOY,E,eACjB,G,WAMUA,GAAA,mBAIV,YAAgBsf,GAAgC,IAAxB,oB,SARpBtf,GAAA,kBAQiD,CAAS,YAAgB,IAFnD,kB,WAMvBA,GAAA,kB,WAIDtK,GACV,OAAiB,IAAjBA,EAAA,QAAiB,MAAQ,YAAAA,EAAe,K,WAEzBA,G,MAAiB,IAAOA,EAAQ,I,WAEjCA,G,OACd,YAAAA,EAAgB,EAAGA,EAAM,OAAS,G,oBAkGf42B,EAIAA,EAkBRC,EA4LC9rC,EAoIiCylB,EA/BDA,E,gBAvZ5BxQ,IAAc82B,IACxB9qC,GAAAgU,EAAO82B,G,MACHnyC,E,OADJ,2B,IACIA,EAAR,gB,MADI,4BAEiD,QAAlB,mC,qBADIA,E,cAC8B,I,cAC7DA,EACAA,G,OAJJ,2B,IAGIA,EAAR,gB,EAHI,cAKmD,QAAlB,mC,IALjC,4B,IAIIA,GAAR,gB,iCAD8CA,G,cACIA,G,cACqB,I,cAC/DA,EAEAA,GACFA,GAEEA,GACAA,GACAA,GAEAA,GACAA,GAEAA,GACAA,GACAA,GACAA,GAEAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACqBoyC,GAArBpyC,GAiBqBqyC,GAArBryC,GAKsBqyC,GAAtBryC,GAYRsyC,GAEQtyC,GACAA,GACAA,GACAA,GACAA,GAEAA,GACAA,GAEAA,GAEAA,GACAA,GAMwBuyC,GAAxBnsC,GA0FR86B,GAA2BsR,G,OA9KvB,2B,IAMIxyC,EAAR,gBANI,c,IAWIA,GALR,gBANI,c,IAYIA,GANR,gBANI,c,IAeIA,GATR,gBANI,e,IAkBIA,GAZR,gBANI,e,KAoBIA,GAdR,gBANI,c,KAwBIA,GAlBR,gBANI,c,KA0BIA,GApBR,gBANI,c,KA4BIA,GAtBR,gBANI,e,KA8ByBoyC,GAAd,eAAPpyC,GAxBR,gBANI,e,KAoD0BqyC,GAAf,eAAPryC,GA9CR,gBANI,e,KAgEJsyC,GAhEI,qB,KAkEItyC,GA5DR,gBANI,e,KAmEIA,GA7DR,gBANI,e,KAsEIA,GAhER,gBANI,e,KAwEIA,GAlER,gBANI,e,KA2EIA,GArER,gBANI,e,KA6EIA,GAvER,gBANI,cA8KgD,YA9KhD,KA8K6D,Y,WAAjEkhC,GA9KI,KA8KuBsR,GAAhB,gB,KA9KP,2B,IAQIxyC,GAAR,gBARI,c,IAaIA,GALR,gBARI,c,IAgBIA,GARR,gBARI,e,IAmBIA,GAXR,gBARI,e,KAqBIA,GAbR,gBARI,c,KAuBIA,GAfR,gBARI,c,KAyBIA,GAjBR,gBARI,c,KA2BIA,GAnBR,gBARI,e,KA6BIA,GArBR,gBARI,e,KA+CyBqyC,GAAd,eAAPryC,GAvCR,gBARI,e,KAgEJsyC,GAhEI,qB,KAoEItyC,GA5DR,gBARI,e,KAqEIA,GA7DR,gBARI,e,KAyEIA,GAjER,gBARI,e,KA8EIA,GAtER,gBARI,cA8KgD,YA9KhD,KA8K6D,Y,WAAjEkhC,GA9KI,KA8KuBsR,GAAhB,gB,KA9KP,2B,IASExyC,GAAN,gBATI,e,KAgEJsyC,GAhEI,oBA8KgD,YA9KhD,KA8K6D,Y,WAAjEpR,GA9KI,KA8KuBsR,GAAhB,gB,KA9KP,0B,KAAA,a,KAAA,e,KAgEJF,GAhEI,M,EAAA,c,MAAA,4B,KAgEJA,GAhEI,qB,KAoF4BC,GAAhB,eAARnsC,GAAR,gBApFI,cA8KgD,YA9KhD,KA8K6D,Y,WAAjE86B,GA9KI,KA8KuBsR,GAAhB,gB,KA9KP,e,KAgEJF,GAhEI,oBA8KgD,YA9KhD,KA8K6D,Y,WAAjEpR,GA9KI,KA8KuBsR,GAAhB,gB,kCAxKuCxyC,G,cAEV,WAAcA,I,cAClBA,G,cAEI,YAAIA,c,cACAA,G,kCACYA,I,cAEhBA,G,cACQA,c,cAEN,QAAQA,I,cACR,QAAQA,I,eACV,YAAMA,c,eACAA,sB,eAEEA,S,eACP,YAAOA,c,eACAA,O,eACP,YAAOA,c,2BACAA,O,eACP,YAAOA,c,eACL,WAAcA,I,eAEnDwjB,EAAiC4uB,KAAhCK,EAAD,KAAiBC,EAAjB,K,OACED,O,YAEIprC,EAAAw9B,IAAA,GAAAx9B,GAAA,YAAerH,yBAAf6kC,kBAAA,K,OAEF,K,OAEA7D,EAAoE,YAAA0R,G,OAApE,YAAU,iEAAV,CAA8D1yC,GAA9D,CAAAghC,I,aAEE35B,EAAAw9B,iBAAA,GAAAx9B,GAAA,YAAerH,yBAAf6kC,gBAAA,K,OAEF,K,OAEA7D,EAAoE,YAAA0R,G,OAApE,YAAU,iEAAV,CAA8D1yC,GAA9D,CAAAghC,I,eAEJA,EAA0E,YAAA0R,G,OAA1E,YAAU,uEAAV,CAAoE1yC,GAApE,CAAAghC,K,QAEoBqR,K,OAClBryC,G,eAIF4jC,EAAW,KACT,YAAAA,EAAA,IAEC,0EAAgB+O,EACP,YAAyB3yC,IACzB,kCAAqBA,cACtB,YAAU,0DAAV,CAAuDA,GAAvD,CAAA4jC,G,kDAKsB,YAAyB0O,I,eAEzB,YAAMtyC,c,eACN,YAAKA,a,eACAA,O,eACEA,gB,eACN,YAAMA,a,eAEL,YAAiBA,I,eACjB,YAAQ,WAAcA,K,eAEpB,YAAeA,I,eAET,YAAqBA,I,eAG7D,YAD4BA,IAC5B,wBADc,WAAcA,Y,eAM/BwjB,EAAqB+uB,KAAbK,EAAR,KAAClxC,EAAD,KACE2F,EAAA,YAAWjB,I,MACbysC,EAAiBzsC,EA2BjBysC,EAAmBpB,EA5BjB,eAAApqC,G,SAAA,GACJA,IADI,YACJA,UADI,wBACJA,K,IAAEwrC,EADE,YACJxrC,MAAmBjB,EAAP,YAAZiB,iB,eA2BYyrC,EAlND,KAAAntB,EAsLP,YACJte,OAvLW,S,EAEPse,EAgNQmtB,SA5BR,wBACJzrC,K,IA2BEwrC,EA5BE,YACJxrC,MA2BqBoqC,EA5BjBqB,G,4BAICntB,EADA,YAAmBsf,GAAQ,aAAgB4N,EAD9CnxC,GAEG,W,OAGSqxC,EAAgB,YAAc,KADlB,YAAe9N,GAAQ,YAAQ,sBAAR,CAAiB,YAAevjC,IAEvEs/B,EAAyF,YAAA4R,G,OAAzF,YAAU,mFAAV,CAAgFC,EAAhF,CAAA7R,EAAA,CAAwG+R,GAJ7G,GAKQd,EAALtsB,EAAuD,IAAtBssB,EAAUe,UAAV,QAA2B,EAAUf,EAAUe,UAAW,IAAvE,C,MAAff,EAALtsB,E,OAEE,YAAsB,QADH,EAAY,UAAOvf,GAAQ,YAAqB,M,OAGhE6rC,E,OATR,SASQA,EAALtsB,EAAuD,IAAtB,oBAA2B,EAAS,YAAqB,K,IAArFssB,EAALtsB,G,0BAEE,YAAsB,QADM,EAAY,UAAOvf,GAAQ,YAAqB,M,OAVjF,Y,MAaQ6rC,EACHtsB,EAAA,GAAsC,IAAtB,qBACJ,EAAU,YAAqB,KACvB,qBAAuB,YAAYvf,GAFpD,C,MAGE6sC,EAAuK7sC,EAAZ,YAAYA,GAAvK46B,EAAqI,qBAArI,YAAU,uGAAV,CAAoG,WAApG,CAAAA,EAAA,CAAAiS,G,OAKL,YAAsB,OADf,YAAgBroB,GAAqB,EAArB,WADhB,YAAU,YADb,YAAaxkB,MAnBtB,mC,cA2BA8sC,EADA,YAAmBjO,GAAQ,aAAgB4N,EAD9CnxC,G,MAG0CyxC,EAAjBN,EAA0CO,E,OADhE,SAAAlB,EACGgB,YADH,oCAAAhB,SAAA,a,SACuCiB,EAApCD,OAAmBL,EAAnBK,WAA6DE,EAA7DF,YADH,K,qBAEK,YAAsBC,EAAUA,CAAG,CAAM93B,GAAA82B,GAAA,EAAA92B,EAAA82B,GAAN,CAAiBV,EAAjB,CAAsB2B,K,cAIrDL,EAAgB,YAAc,KADlB,YAAe9N,GAAQ,YAAQ,sBAAR,CAAiB,YAAevjC,IAEvEs/B,EAAyF,YAAA4R,G,OAAzF,YAAU,mFAAV,CAAgFC,EAAhF,CAAA7R,EAAA,CAAwG+R,K,OAtC9G,IAyCW,YAAgB,MAAM3sC,MAAU,YAAgB,SAASA,KAA6B,IAAnB,YAAUA,IAzCxF,IAsDW,EAAe+rC,I,MAExBkB,EAEG,YAAkBC,GAAW,YAAgBA,EAAQltC,IAHvC,aAAC,aAAc,YAAa,WAK3C,SAAAitC,EAAA,C,MAIEE,EAAyB,YAAzBF,EAAmDjtC,IACjD,OAAAmtC,EAAA,K,MACIC,EACF,YAAAC,EAEG,YAAiBxO,GAAQ,2BAAmCuO,EAAmB,cADlF9xC,GAGE,SAAA+xC,EAAA,C,MAGCxO,EAICwO,E,OACJ,YAAsB,QADF,EAAY,UAAQrtC,IAAS,YAAgB,M,OALjE26B,EAA6E,YAAA6R,G,OAA7E,YAAU,gFAAV,CAAA7R,EAAA,CAA4FyS,I,OAQhGzS,EAAgK,YAAA6R,G,OAAhK,YAAU,mKAAV,CAAA7R,I,OAnBJA,EAA2L,YAAA6R,G,OAA3L,YAAU,8LAAV,CAAA7R,I,OAsBA2S,EAAiB,eApFnBrsC,GAqFEssC,EAAe,eAAkBjyC,G,OACrC,YAAU,yDAAV,CAAsDgyC,EAAtD,CAAqEC,IA7CxD,C,MACPtsC,GAAA,YAAY,MAAMjB,IAAQ,YAAY,SAASA,K,MACrCwtC,EAAyBC,E,OADnC,YACJ,cADI,YACsB,c,IAAZD,EAAd,eAAuCC,EAAb,gB,qBACpB5B,EAAYvwC,IAAWkyC,G,OAM3B,YAAsB,OAFf,aAAgB93B,EAAM9b,IAAS,EAAWA,EAAO,YAAqB8b,IADtE,YADH+3B,K,cAMJ7S,EAA+F,YAAA4R,GAA/F7R,EAAyD,YAAqB,UAAQ36B,K,OAAtF,YAAU,2DAAV,CAAA26B,EAAA,CAAAC,O,8BAuCFlB,EADsB,EAAWoB,GADpB,MAEb,YAAApB,G,eACA9/B,EAEAA,EAGAg6B,EAcA6Y,EAAyBN,E,OArM7B,4B,IAkLIvyC,EAAR,gBAlLI,eAqM2C,EAnB/C,iB,IAmBQ6yC,EAnBR,eAmBiCN,EAAf,gB,IArMd,4B,IAoLIvyC,EAAR,gB,IApLI,6B,IAuLIg6B,EAAR,gB,iCAL2Dh6B,G,cAElBA,IAAWA,EAAXA,oB,cAInCJ,EAAIU,GAAM,YAAYA,EAAI05B,GAG3B8Z,EADA,YAAYpvC,KADf,aAAE,EAAI,OAAO,EAAI,QAAQ,EAAI,e,MAGAiH,EAAbD,E,OADb,YAAAooC,G,IACGA,IADH,YACGA,OADH,wBACGA,I,IAAAA,IADH,YACG,YAAAA,QADH,wBACG,YAAAA,K,IAAAA,IADH,YACG,wBAAAA,UADH,wBACG,wBAAAA,O,IAAuBnoC,EAAR,YAAf,YAAAmoC,cAAUpoC,EAAR,YAAFooC,c,6BAIE,YADoB,aAFL,cAA0BpoC,GACzB,cAA0BC,gBAEN,G,cAEjC,YAAU,uG,cAIjB6X,EAAyB,IAAxBuwB,EAAD,KAGDC,EADA,YAAmB/O,GAAQ,aAAgB,EAAa4N,GAD3DkB,GAEG,Y,MAIShB,EAAgB,YAAc,KADlB,YAAe9N,GAAQ,YAAQ,sBAAR,CAAiB,YAAe8O,IAEvE/S,EAAyF,YAR7F,M,OAQI,YAAU,mFAAV,CAAgF6R,EAAhF,CAAA7R,EAAA,CAAwG+R,G,OAJrE,YAAP,W,cAO9BF,EAAyBN,EAUS0B,EAAlCC,EAIDC,EAA0B5B,EAqCH6B,EAAvBhuC,EAOsBguC,EAAtBhuC,EAO2BguC,EAA1BpC,EAOoBoC,EAArBhuC,EAOqBguC,EAArBhuC,EAKAgd,EAAsBixB,EAQrBra,EAAsBuY,EAkCFA,EAArB+B,EAoB4B/B,EAA5B+B,EAgBCta,GAA0BuY,GAgBHgC,GAAxBC,GAcmBjC,GAAlBpwC,GA4EQoyC,G,OA7dZ,4B,IAiNI1B,EAAR,eAAiCN,EAAf,gBAjNd,e,IA2NsC0B,EAAhB,eAAlBC,EAVR,gBAjNI,e,KA6dYK,GAAb,gB,KA7dC,4B,IA+NGJ,EAAP,eAAiC5B,EAAf,gBA/Nd,e,IAoQ0B6B,EAAf,eAARhuC,EArCP,gBA/NI,e,IA2QyBguC,EAAd,eAARhuC,EA5CP,gBA/NI,e,IAyRwBguC,EAAb,eAARhuC,EA1DP,gBA/NI,e,IAgSwBguC,EAAb,eAARhuC,EAjEP,gBA/NI,e,IAqSGgd,EAtEP,eAsE6BixB,EAAf,gBArSV,e,KA+UwB9B,EAAb,eAAR+B,EAhHP,gBA/NI,e,KAmW+B/B,EAApB,eAAR+B,EApIP,gBA/NI,e,KAmY2BC,GAAjB,eAAPC,GApKP,gBA/NI,e,KA6dYD,GAAb,gB,KA7dC,4B,IAkR8BH,EAAd,eAAZpC,EAAR,gBAlRI,e,IA6SIhY,EA3BR,eA2B8BuY,EAAhB,gBA7SV,e,KAmXIvY,GAjGR,eAiGkCuY,GAApB,gBAnXV,e,KAiZsBA,GAAb,eAALpwC,GA/HR,gBAlRI,e,KA6dYoyC,GAAb,gB,KA7dC,e,KA6dYA,GAAb,gB,sBA3QG/wB,EAAyB,IAAxBuwB,EAAD,KAGDU,EADA,YAAmBxP,GAAQ,aAAgB4N,EAD9CkB,GAEG,Y,MAIShB,EAAgB,YAAc,KADlB,YAAe9N,GAAQ,YAAQ,sBAAR,CAAiB,YAAe8O,IAEvE/S,EAAyF,YAR7F,M,OAQI,YAAU,mFAAV,CAAgF6R,EAAhF,CAAA7R,EAAA,CAAwG+R,G,OAJrE,YAAP,W,SAMxB,YAAiBmB,G,EAAkB/B,EAA/C,W,cAII3uB,EAAqB,IAApB9hB,EAAD,K,MAGQmxC,EAWFA,EAAYzsC,EAiBpBsuC,E,OA9BI,YAAAP,I,IA8BJO,EA9BIP,GAEJA,IAFI,YAEJA,OAFI,wBAEJA,K,IAAUtB,EAAR,YAAFsB,e,IAWQtB,EAXN,YAAFsB,aAWoB/tC,EAbhB,YAEJ+tC,K,IA4BAO,EA9BIP,G,iBAKCQ,EADA,YAAmB1P,GAAQ,aAAgB4N,EAD9CnxC,GAEG,Y,MAMSqxC,EAAgB,YAAc,KADlB,YAAe9N,GAAQ,YAAQ,sBAAR,CAAiB,YAAevjC,IAEvEs/B,EAA2F,YAbnG,M,OAaQ,YAAU,qFAAV,CAAkF6R,EAAlF,CAAA7R,EAAA,CAA0G+R,GAJ1G,uB,OAAO,YAAP,W,cAQL6B,EADA,YAAmB3P,GAAQ,aAAgB4N,EAD9CnxC,GAEG,Y,MAKkE2hC,EAC7D,YADiBwR,EACjB,WADuC1B,EACvC,O,OAAgB9P,WAAS,YAAYj9B,IAChC,YAAU,yEAAV,CAAsEyuC,GAK3E,YAAsB1B,EADf,YAAgBvoB,GAAqB,EAArB,WADhB,YAAAyY,EADH,YAAaj9B,M,OANb2sC,EAAgB,YAAc,KADlB,YAAgBptB,GAAA,WAA8BjkB,I,OAE9D,YAAU,2DAAV,CAAwDmxC,EAAxD,CAAiEE,I,cAWrEW,EAAiB,eAAkBgB,GACnCf,EAAe,eAAkBjyC,G,OACrC,YAAU,yDAAV,CAAsDgyC,EAAtD,CAAqEC,K,cAGrEmB,EAAcV,I,OAGf,YADA,YAAcp0C,GAAgB,EAAWA,EAAM80C,GADlD1uC,I,cAMI0uC,EAAc,I,OAEf,YAAc90C,GAAgB,EAAWA,EAAM80C,GADlD1uC,G,cAMI0uC,EAAc,I,OAGf,YAAc90C,GAAgB,EAAWA,EAAM80C,GAF9B,EAAmB9C,I,cAMnC8C,EAAc,I,OAGf,YADA,YAAc90C,GAAgB,EAAWA,EAAM80C,GADlD1uC,I,gDAMI0uC,EAAc,I,OACF,YAAc90C,GAAgB,EAAWA,EAAM80C,GAAc1uC,G,cAQ1E,YAAgBwkB,GAAuB,EAAvB,WADhB,YAHcypB,IAEd,YADHjxB,K,cAOII,EAAqB,IAAbuxB,EAAR,KAAA5zC,EAAA,K,OA+BG,YAAuB4zC,GA5BtB3uC,EAAS,YAAW4zB,GAErB,YAAgB8Z,I,MAAqCkB,EAArC,YAAcC,EAAd,YAGZC,EADA,YAAmBtqB,GAAeqqB,IAAf,KADtB7uC,GAEG,YAGW,QAAA4uC,EAAA,I,YAMAG,E,MAIGpU,EADA,YAAc,KADd,eAAiB,YAAQ,oBAAR,CAAP,MADb,YAAW/G,K,IAIXob,EALAD,EAIG,YAAQ,sBAAR,CAAApU,G,MAQAA,EADA,YAAc,KAJd,YAAgBmS,I,MAAc3zC,EAAd,YACT,4BACiB,YAAQ,8BAAR,CAAyBA,GACzC,YAAQ,8BAAR,CAAyBA,IAJpC4B,IADAi0C,EAOG,YAAQ,sBAAR,CAAArU,G,MACPkS,EAA8J,YAAA8B,G,OAA9J,YAAU,8IAAV,CAA2IE,EAA3I,CAAqJE,EAArJ,CAAAlC,EAAA,CAA8KmC,IArB7J,K,OAAO,EAAP,KAAwBJ,IALvD7zC,K,eA8BAqiB,EAAuB,IAAtB+gB,EAAD,KACAoM,EACA,YAAE,4BAAI0E,I,IACuD/uB,E,OACzD,YADY,EAAW+uB,EAAc,QAAQ,IAAY/uB,EAAIA,CAAGie,EAHpE,UAGuGje,OADjFguB,K,OAGpB/P,O,oCAWC,YAFHoM,I,eAMAntB,EAAqC,IAApC+gB,EAAD,KACAoM,EACA,YAAE,4BAAI0E,GAEF,YADY,EAAWA,EAAc,QAAQ,QAAqB9Q,EAHtE,SAEsB+P,KAItBgB,EACM,eACiB,IAAU,I,+DAD3B,eAEiB,IAAU,I,mEAC1B,IAAU,I,+DAEDrrC,EAAA,YAA2C0mC,GAA/D,SAAoB,iD,MAAfjmB,EAAe,4DAAqD,YAAA4qB,EAArD,Y,QAAArrC,Y,OACdqrC,E,eAGF9xB,EAAqC,KAApC+gB,EAAD,KAIGoM,EADJ,YAAe/lB,IAAe,EAAY,UAA3B,MAAwC2Z,GAAS,EAAjD,KAHd,OAED,YADHvK,KAIQsb,EACM,eACgB,IAAU,I,+DAD1B,eAEiB,IAAU,I,mEAC1B,IAAU,I,+DAEDrrC,EAAA,YAAA0mC,GAApB,SAAoB,iD,MAAfjmB,EAAe,4DAAS,YAAA4qB,EAAT,Y,QAAArrC,Y,OAEdqrC,E,eAGN1R,EAAW2Q,KACXgB,EACM,eACgB,IAAO,I,+DADvB,eAEiB,IAAO,I,mEACvB,IAAO,I,+DAENtrC,EAAA,YAAAuqC,IAAZ,SAAY,gDAER,YADmB,EADX,4DAC2B5Q,GACnC2R,G,QAFQtrC,Y,OAINsrC,E,eAGF/xB,EAAuB,KAAbghB,EAAV,KAACD,EAAD,KAGEl9B,GAAA,YAAY,WAAWlF,IAAK,YAAY,OAAOA,K,MACrCwX,EAAwBkS,E,OADlC,YACJ,cADI,YACqB,cAAaA,EAAb,eAAwB,YAAjD,iB,IAAclS,EAAd,eAAsCkS,EAAb,gB,0BACjBxkB,EAAA,EAAa,UAAOwkB,IAApB,Y,MA0BE2pB,EAAY,YAAqB,UAAO3pB,I,OAC5C,YAAU,qDAAV,CAAkD2pB,G,OAzB9C7E,EAEG,YAAe/lB,I,MAAAtqB,EAAA,K,OAEF,EAASA,GAEL,EAAY,YAAuBA,GAAKikC,GADxC,EAAY,UAAQjkC,GAAKikC,GAElB,EALT,KAK0BC,KAN5C,EADAn9B,I,OASEk9B,O,oCAWC,YAFHoM,K,cAUIh3B,EAAyBkS,E,OAhCnC,YAgCJ,cAhCI,YAgCqB,cAAcA,EAAd,eAAyB,YAAlD,iB,IAAclS,EAAd,eAAuCkS,EAAd,gB,yBAEX,MADO,YAAY,EAAgBA,K,EACbsmB,EAAlC,W,cAKIxB,EAGG,YAAe/lB,I,MAAAtqB,EAAA,K,OAEF,EAASA,GAWN,EAAY,YAAuBA,GAAKikC,GAT5C,YAAsBA,IAAW,YAAoBA,GAG7C,EAAY,UAAQjkC,GAAKikC,GAIzB,EAAY,YAAuBjkC,GAAKikC,GAGpC,EAdT,KAc0BC,KAfzC,YADHriC,K,OAmBEoiC,O,oCAWC,YAFHoM,Q,eAMR3P,EAAgE,YAD9C,MAClBD,EAAqC,YAAoB1lB,G,OAAzD,YAAU,uCAAV,CAAA0lB,EAAA,CAAAC,G,eAEAA,EAAiE,eAAkBmR,GAAnFpR,EAAqC,YAAoB1lB,G,OAAzD,YAAU,uCAAV,CAAA0lB,EAAA,CAAAC,Y,MA7SiC,IAAMhhC,EAHjC8/B,EAjROna,E,gCAmmBiB1E,EACIA,EACMA,E,gBA7B9BjhB,IAAOmyC,I,OACfA,O,cAEE9S,EAAwBr/B,EAC5B,OAAUq/B,QACL,OACA,EAAUA,G,aACA,O,cAGf,OAAG,aAAmBr/B,GACjB,EAAU,OACYA,a,cACZ,EAA+BA,G,gFAQXA,G,sBAEpB,cAAoCA,I,eAClC,cAAqCA,I,eACpC,cAAsCA,I,OACzC,OAAeA,EAAW,OAAY,Q,eACtC,GAAeihB,EAAajhB,EAAbihB,I,eACX,GAAeA,EAAiBjhB,EAAjB,YAAAihB,EAAiC,O,eAC1C,GAAeA,EAAuBjhB,EAAvB,YAAAihB,EAAuC,O,cAU/E,IAAM,YAAc,KALb,YAAe/a,I,MAEd86B,EAAsC,EADrB,YAA2BhhC,EAAOkG,EAAMuvC,cACEvvC,EAAMwvC,W,OAAjE,YAAQ,wBAAR,CAAqBxvC,EAAMyvC,UAA3B,CAAA3U,IALuB,mBAQa,I,eAGxC8T,EAAc,c,MAOlB,IAFO,YAAc,KADd,YAAac,GAAW,EAAUA,EAAQd,GAF7C90C,IAKW,I,eAGX80C,EAAc,c,MAOlB,IAFO,YAAc,KADd,YAAac,GAAW,EAAUA,EAAQd,GAF7C90C,IAKW,I,eAGX80C,EAAc,c,MAOlB,IAFO,YAAc,KADd,YAAac,GAAW,EAAUA,EAAQd,GAF7C90C,IAKW,I,eAGX80C,EAAc,c,MAOlB,IAFO,YAAc,KADd,YAAec,GAAW,EAAUA,EAAQd,GAF/C90C,IAKW,I,eAGX80C,EAAc,c,MAOlB,IAFO,YAAc,KADd,YAAcc,GAAW,EAAUA,EAAQd,GAF9C90C,IAKW,I,eAGX80C,EAAc,c,MAQlB,IAFO,YAAc,KADd,YAAec,GAAW,EAAUA,EAAQd,GAD5C,YAFH90C,KAMW,I,eAGTqH,EAAkBrH,EAAlB,Y,cAEkBqH,G,EAAyB,cAAzB,W,MADd,O,eAINmc,EAA0B,cAC1BA,EAAqB,YAA2BxjB,EADhD,MACC61C,EAAD,KAAW10C,EAAX,KACA4yC,EAGe,UADI9O,GAAQ,aAAgB,YAAA4Q,cAG/C,GAAG,YAAU1D,IAA0B4B,a,OACnC,EAAc,YAAA8B,IAClB,GAAwB,IAAnB9B,EAAU,O,MACX,IAAM,EAAc,YAAA8B,IAAgB,KAAO,EAAU10C,EAAQ,GAAG4yC,EAAW,IAAK,I,OAE5E+B,EAGG,YAAc,KADd,aAAgBh6B,EAAMs3B,IAAY,EAAUjyC,EAAQ2a,GAAOs3B,GAD9DW,I,MAIJ,IAAM,EAAc,YAAA8B,IAApB,MAAiDC,EAAmB,O,eAGpEtyB,EAAuB,cAAtB+gB,EAAD,KAEAwR,EAeG,YAAc,KAXd,YAAgBnrB,I,MACXorB,EAAgB,EADL,KACmBzR,GAC9B0R,EAAkB,EAFP,KANnB,MAUI,OAAG,YAAY1R,IAAW,YAAUA,GACxB,EAASyR,GAEZA,EAAgB,KAAOC,EADtB,EAAUD,GAAiB,KAAOC,EAGxC,IAAMD,EAAgB,KAAOC,EAAkB,KAVpD,YAFHj2C,KAgBJ,OAAG,YAAYukC,IAAW,YAAUA,GAC/B,IAAMwR,EAAmB,IACzB,IAAMA,EAAmB,I,eAG1BvyB,EAAqC,cAApC+gB,EAAD,KACAwR,EAeG,YAAc,KAZd,YAAalF,I,MACRrtB,GAAeqtB,EAAA,GAAUA,EAAA,IACzBmF,EAAgB,EADhB,KAC8BzR,GAC9B0R,EAAkB,EAFlB,KALR,MASI,OAAG,YAAY1R,IAAW,YAAUA,GACxB,EAASyR,GAEZ,EAAgB,KAAOC,EADtB,EAAcD,GAAiB,KAAOC,EAG5C,IAAMD,EAAgB,KAAOC,EAAkB,KAZvDj2C,IAgBJ,OAAG,YAAYukC,IAAW,YAAUA,GAC/B,IAAMwR,EAAmB,IACzB,IAAMA,EAAmB,I,eAG1BG,EAAa,cAEjB,OAAuB,IAApBA,EAAW,OACV,IAAM,EAAUl2C,EAAMk2C,EAAY,IAAK,IAQvC,IAFO,YAAc,KADd,aAAgBp6B,EAAM85B,IAAW,EAAUA,EAAQM,EAAYp6B,IAFlE9b,IAKqB,I,uBAO7B,YAAqBA,G,cAGrB,O,gEC10BZ,8HAiBe,SAASm2C,EAAen2C,EAAOoV,GAC1CghC,EAAmBhhC,GACnB,MAAM9V,EAAI,IAAI+Y,KAAKrY,GAEnB,OADAV,EAAE8V,OAAmB,MAAVA,EAAiBA,GAA2C,KAAlC,IAAIiD,MAAOjB,oBACzC9X,EAEX,SAAS82C,EAAmBhhC,GACxB,GAAc,MAAVA,GAA6B,IAAXA,EAAc,CAChC,GAAIA,EAAS,KAAU,EACnB,MAAM,IAAIhQ,MAAM,8CAEpB,GAAIkJ,KAAKqP,IAAIvI,EAAS,MAAW,GAC7B,MAAM,IAAIhQ,MAAM,kDA+BrB,SAASorB,EAAUlb,EAAOF,GAC7BE,EAAQ,YAAUA,GAElB,OAAO6gC,EADM,YAA6B7gC,GAASF,EACvBA,GAazB,SAAShB,EAAM3F,GAClB,MAAMyI,EAAO,YAASzI,GAChB4nC,EAAc,IAAYz6B,KAAKnN,GAC/B2G,EAAwB,MAAfihC,GACmB,IAA5Bn/B,EAAKE,oBACe,MAAnBi/B,EAAY,GACT,EAC+B,KAA/BrnC,SAASqnC,EAAY,GAAI,IACU,IAA/BrnC,SAASqnC,EAAY,GAAI,IACvC,OAAOF,EAAej/B,EAAKoB,UAAWlD,K,6BCrF1C,6CAYO,SAAShB,EAAM3F,GAClB,MAAMuG,EAAW,IAAI,IAAU,GAC/B,GAbG,SAAkBvG,EAAKuG,GAE1B,GAAW,MAAPvG,GAAe,KAAKsP,KAAKtP,GAAM,CAC/B,MAAM5I,GAAK4I,EAAIsM,QAAQ,IAAK,IAC5B,IAAKiT,OAAOvgB,MAAM5H,GAEd,OADAmP,EAASC,SAAWpP,GACb,EAGf,OAAO,EAIHiP,CAASrG,EAAKuG,GACd,OAAOA,EAASC,SAGhB,MAAM,IAAI7P,MAAM,+C,4GCWjB,SAASkxC,IACZ,OAT4C38B,EASL,CAACmI,EAAIC,IAAO,YAAQD,EAAIC,GARxD,CACH+H,QAAO,CAACplB,EAAG6H,IACAoN,EAASjV,EAAG6H,IAHxB,IAAyCoN,E,eCCzC,SAAS48B,IACZ,OAAOD,IAuBJ,SAASE,EAAkB9xC,GAC9B,MAAM,IAAKU,MAAMV,K,6BC/CrB,gKASO,MAAM+xC,EACT,YAAYzvB,GACR5lB,KAAK4lB,EAAIA,GAQV,SAAS0vB,EAA0B1vB,GACtC,OAAO,IAAIyvB,EAAczvB,GAGtB,SAAS2vB,EAAuBr5B,GACnC,OAAOA,EAAE0J,EAGN,MAAM4vB,UAAsBH,EAC/B,YAAY5wC,EAAGyiB,EAAMC,EAAO7gB,GACxBZ,MAAMjB,GACNzE,KAAKknB,KAAOA,EACZlnB,KAAKmnB,MAAQA,EACbnnB,KAAKsG,EAAS,EAAJA,GAQX,SAASmvC,EAA8BhxC,EAAGyiB,EAAMC,EAAO7gB,GAC1D,OAAO,IAAIkvC,EAAc/wC,EAAGyiB,EAAMC,EAAO7gB,GAGtC,SAASovC,EAAwBx5B,GACpC,OAAOA,EAAEgL,KAGN,SAASyuB,EAAyBz5B,GACrC,OAAOA,EAAEiL,MAGN,SAASyuB,EAA0B15B,GACtC,OAAOA,EAAE5V,EA6BN,SAASuvC,EAAoBn4C,GAChC,OAvBG,SAASo4C,EAAuBC,EAAO10B,GAC1Cy0B,EACA,OAAa,CACT,MAAMj3C,EAAIk3C,EAAO9tC,EAAMoZ,EACvB,GAAS,MAALxiB,EAAW,CACX,MAAMoC,EAAKpC,EACX,GAAIoC,aAAcu0C,EAAe,CAC7BO,EAAQL,EAAwBz0C,GAChCogB,EAAUy0B,EAAuBH,EAAyB10C,GAAKgH,EAAM,GACrE,SAAS6tC,EAGT,OAAQ7tC,EAAM,EAAK,EAIvB,OAAa,EAANA,GAOR6tC,CAAuBp4C,EAAG,GAG9B,SAASs4C,EAAiBj4C,EAAG6nB,EAAGnnB,GACnC,IAAIopB,EAEJ,GAAS,MADC9pB,EACK,CACX,MAAMkD,EAFAlD,EAGN8pB,EAAO5mB,aAAcu0C,EAAiBI,EAA0B30C,GAAM,OAGtE4mB,EAAK,EAET,IAAIC,EAEJ,GAAW,MADCrpB,EACK,CACb,MAAMw3C,EAFEx3C,EAGRqpB,EAAOmuB,aAAgBT,EAAiBI,EAA0BK,GAAQ,OAG1EnuB,EAAK,EAET,MAAM9pB,EAA4B,GAAtB6pB,EAAKC,EAAMA,EAAKD,GAC5B,OAAU,IAAN7pB,EACOs3C,EAA0B1vB,GAG1B6vB,EAA8B7vB,EAAG7nB,EAAGU,EAAGT,EAAI,GAInD,SAASk4C,EAAwBl1C,EAAIyD,EAAGxD,GAC3C,IAAI+H,EAAKmtC,EAAMC,EAAKC,EAChBhuB,EAEJ,GAAS,MADCrnB,EACK,CACX,MAAMi1C,EAFAj1C,EAGNqnB,EAAQ4tB,aAAgBT,EAAiBI,EAA0BK,GAAQ,OAG3E5tB,EAAM,EAEV,IAAIC,EAEJ,GAAW,MADCrnB,EACK,CACb,MAAMq1C,EAFEr1C,EAGRqnB,EAAQguB,aAAgBd,EAAiBI,EAA0BU,GAAQ,OAG3EhuB,EAAM,EAEV,GAAIA,EAAOD,EAAM,EAAI,CACjB,MAAMpiB,EAAa,YAAQhF,GAC3B,GAAIgF,aAAsBuvC,EAAe,CACrC,GAAMxsC,EAAM0sC,EAAwBzvC,IAAqB,MAAP+C,GAAiBmtC,EAAOntC,EAAMmtC,aAAgBX,EAAiBI,EAA0BO,GAAQ,GAAM,GAAO9tB,EAAM,EAAI,CACtK,MAAMtJ,EAAe,YAAQ22B,EAAwBzvC,IACrD,GAAI8Y,aAAwBy2B,EACxB,OAAOQ,EAAiBA,EAAiBh1C,EAAIyD,EAAGixC,EAAwB32B,IAAgBw2B,EAAuBx2B,GAAei3B,EAAiBL,EAAyB52B,GAAew2B,EAAuBtvC,GAAa0vC,EAAyB1vC,KAGpP,MAAM,IAAKjC,MAAM,iCAIrB,OAAOgyC,EAAiBA,EAAiBh1C,EAAIyD,EAAGixC,EAAwBzvC,IAAcsvC,EAAuBtvC,GAAa0vC,EAAyB1vC,IAIvJ,MAAM,IAAKjC,MAAM,iCAGpB,GAAIqkB,EAAOC,EAAM,EAAI,CACtB,MAAMC,EAAe,YAAQvnB,GAC7B,GAAIunB,aAAwBitB,EAAe,CACvC,GAAMY,EAAMT,EAAyBptB,IAAuB,MAAP6tB,GAAiBC,EAAOD,EAAMC,aAAgBb,EAAiBI,EAA0BS,GAAQ,GAAM,GAAO/tB,EAAM,EAAI,CACzK,MAAME,EAAe,YAAQmtB,EAAyBptB,IACtD,GAAIC,aAAwBgtB,EACxB,OAAOQ,EAAiBA,EAAiBN,EAAwBntB,GAAegtB,EAAuBhtB,GAAemtB,EAAwBltB,IAAgB+sB,EAAuB/sB,GAAewtB,EAAiBL,EAAyBntB,GAAe/jB,EAAGxD,IAGhQ,MAAM,IAAK+C,MAAM,iCAIrB,OAAOgyC,EAAiBN,EAAwBntB,GAAegtB,EAAuBhtB,GAAeytB,EAAiBL,EAAyBptB,GAAe9jB,EAAGxD,IAIrK,MAAM,IAAK+C,MAAM,iCAIrB,OAAOgyC,EAAiBh1C,EAAIyD,EAAGxD,GAIhC,SAASs1C,EAAkBh+B,EAAUqN,EAAG/mB,GAC3C,GAAS,MAALA,EAAW,CACX,MAAMoC,EAAKpC,EACLZ,EAAsD,EAAlDsa,EAASmQ,QAAQ9C,EAAG2vB,EAAuBt0C,IACrD,GAAIA,aAAcu0C,EACd,OAAIv3C,EAAI,EACGi4C,EAAwBK,EAAkBh+B,EAAUqN,EAAG8vB,EAAwBz0C,IAAMs0C,EAAuBt0C,GAAK00C,EAAyB10C,IAEtI,IAANhD,EACEY,EAGAq3C,EAAwBR,EAAwBz0C,GAAKs0C,EAAuBt0C,GAAKs1C,EAAkBh+B,EAAUqN,EAAG+vB,EAAyB10C,KAGnJ,CACD,MAAMu1C,EAAwD,EAAlDj+B,EAASmQ,QAAQ9C,EAAG2vB,EAAuBt0C,IACvD,OAAIu1C,EAAM,EACCf,EAA8B7vB,OAAG6wB,EAAuB53C,EAAG,GAErD,IAAR23C,EACE33C,EAGA42C,EAA8B7vB,EAAG/mB,OAAG43C,EAAuB,IAK1E,OAAOnB,EAA0B1vB,GAkIlC,SAAS8wB,EAAkB7tB,EAAcC,EAAOitB,GACnDW,EACA,OAAa,CACT,MAAMn+B,EAAWsQ,EAAcjD,EAAIkD,EAAOjqB,EAAIk3C,EAC9C,GAAS,MAALl3C,EAAW,CACX,MAAMoC,EAAKpC,EACLZ,EAAsD,EAAlDsa,EAASmQ,QAAQ9C,EAAG2vB,EAAuBt0C,IACrD,GAAIA,aAAcu0C,EAAe,CAC7B,GAAIv3C,EAAI,EAAG,CACP4qB,EAAetQ,EACfuQ,EAAQlD,EACRmwB,EAAQL,EAAwBz0C,GAChC,SAASy1C,EAER,GAAU,IAANz4C,EACL,OAAO,EAGP4qB,EAAetQ,EACfuQ,EAAQlD,EACRmwB,EAAQJ,EAAyB10C,GACjC,SAASy1C,EAIb,OAAa,IAANz4C,EAIX,OAAO,GAMZ,SAAS04C,EAAmBztB,EAAO6sB,GACtCY,EACA,OAAa,CACT,MAAMptC,EAAI2f,EAAOrqB,EAAIk3C,EACrB,GAAS,MAALl3C,EAAW,CACX,MAAMoC,EAAKpC,EACX,GAAIoC,aAAcu0C,EAAe,CAC7BmB,EAAmBptC,EAAGmsC,EAAwBz0C,IAC9CsI,EAAEgsC,EAAuBt0C,IACzBioB,EAAQ3f,EACRwsC,EAAQJ,EAAyB10C,GACjC,SAAS01C,EAGTptC,EAAEgsC,EAAuBt0C,IAGjC,OAoYD,MAAM21C,UAAoC,IAC7C,YAAY9sB,EAAOnL,GACfjZ,QACA1F,KAAK8pB,MAAQA,EACb9pB,KAAK2e,QAAUA,GAQhB,SAASk4B,EAA0B7sB,GACtC6sB,EACA,OAAa,CACT,MAAM/sB,EAAQE,EACd,GAAK,YAAUF,GAmBX,OAAO,cAnBY,CACnB,MAAMxmB,EAAI,YAAKwmB,GACTG,EAAO,YAAKH,GAClB,GAAS,MAALxmB,EAAW,CACX,MAAMwzC,EAAKxzC,EACX,GAAIwzC,aAActB,EAAe,CAC7BxrB,EAAY,YAAgB,CAAC0rB,EAAwBoB,GAAKxB,EAA0BC,EAAuBuB,IAAMnB,EAAyBmB,IAAM7sB,GAChJ,SAAS4sB,EAGT,OAAO/sB,EAIXE,EAAYC,EACZ,SAAS4sB,IAUlB,SAASE,EAAyBr5C,GACrC,OAAO,IAAIk5C,EAA4BC,EAA0B,YAAYn5C,KAAK,GAW/E,SAASs5C,EAAsB56C,GAClC,GAAIA,EAAEuiB,QAAS,CACX,MAAM1Y,EAAa7J,EAAE0tB,MACrB,GAAI,YAAU7jB,GACV,OARL,WACH,MAAM,IAAKjC,MAAM,+BAOFizC,GAEN,GAAwB,MAApB,YAAKhxC,GAAqB,CAE/B,OAAOsvC,EADG,YAAKtvC,IAIf,MAAM,IAAKjC,MAAM,mEAIrB,OAvBD,WACH,MAAM,IAAKA,MAAM,2BAsBNkzC,GAgCR,SAASC,EAA4Bz5C,GACxC,IAAItB,EAAI26C,EAAyBr5C,GACjC,MAAO,CACH,uDAAwD,IAC7Cs5C,EAAsB56C,GAEjC,6CAA8C,IACnC46C,EAAsB56C,GAEjC,0CAA2C,IArC5C,SAAgCA,GACnC,GAAIA,EAAEuiB,QAAS,CACX,MAAM1Y,EAAa7J,EAAE0tB,MACrB,GAAK,YAAU7jB,GAgBX,OAAO,EAfP,GAAwB,MAApB,YAAKA,GAAqB,CAE1B,GADU,YAAKA,aACEuvC,EACb,MAAM,IAAKxxC,MAAM,oEAIjB,OADA5H,EAAE0tB,MAAQ+sB,EAA0B,YAAK5wC,KACjC,YAAU7J,EAAE0tB,OAIxB,MAAM,IAAK9lB,MAAM,oEASzB,OADA5H,EAAEuiB,SAAU,GACJ,YAAUviB,EAAE0tB,OAcTstB,CAAuBh7C,GAElC,yCACIA,EAAI26C,EAAyBr5C,IAEjC,aA+bD,SAAS25C,EAAsB9+B,EAAUvX,EAAIC,GAChD,OAAU,MAAND,EACU,MAANC,EACO,GAGC,EAGD,MAANA,EACE,EAG0E,EAvclF,SAAqC4nB,EAAcyuB,EAAQC,GAC9DC,EACA,OAAa,CACT,MAAMj/B,EAAWsQ,EAAc4uB,EAAKH,EAAQI,EAAKH,EAC3CtxC,EAAa,CAACwxC,EAAIC,GACxB,GAAK,YAAUzxC,EAAW,IA2arB,OAAI,YAAUA,EAAW,IACnB,GAGC,EA9aR,GAAK,YAAUA,EAAW,IAuatB,OAAO,EAtaP,GAA2B,MAAvB,YAAKA,EAAW,IAChB,GAA2B,MAAvB,YAAKA,EAAW,IAAa,CAC7B,MAAM0xC,EAAO,YAAK1xC,EAAW,IACvB2xC,EAAO,YAAK3xC,EAAW,IAC7B,GAAI0xC,aAAgBnC,EAChB,GAAqC,MAAjCE,EAAwBiC,GAAe,CACvC,KAAIC,aAAgBpC,GAoFf,CACD,MAAMgB,EAAqF,EAA/Ej+B,EAASmQ,QAAQ6sB,EAAuBoC,GAAOpC,EAAuBqC,IAClF,GAAY,IAARpB,EACA,OAAa,EAANA,EAGP3tB,EAAetQ,EACf++B,EAAS,YAAK3B,EAAyBgC,GAAO,YAAK1xC,EAAW,KAC9DsxC,EAAS,iBAAKd,EAAuB,YAAKxwC,EAAW,KACrD,SAASuxC,EA5Fb,GAAqC,MAAjC9B,EAAwBkC,GAAe,CACvC,MAAM35C,EAAmF,EAA/Esa,EAASmQ,QAAQ6sB,EAAuBoC,GAAOpC,EAAuBqC,IAChF,GAAU,IAAN35C,EACA,OAAW,EAAJA,EAGP4qB,EAAetQ,EACf++B,EAAS,YAAK3B,EAAyBgC,GAAO,YAAK1xC,EAAW,KAC9DsxC,EAAS,YAAK5B,EAAyBiC,GAAO,YAAK3xC,EAAW,KAC9D,SAASuxC,EAGZ,CACD,MAAMhvB,EAAe,CAACivB,EAAIC,GAC1B,IAAIvL,EAAyB0L,EAAMC,EAAMC,EAAMC,EAkC/C,OAjCK,YAAUxvB,EAAa,IAoBlB,YAAUA,EAAa,IAW7B2jB,EAA0B,EAVG,MAAzB,YAAK3jB,EAAa,KAClB2jB,EAA0B,EAC1B4L,EAAO,YAAKvvB,EAAa,IACzBwvB,EAAO,YAAKxvB,EAAa,KAGzB2jB,EAA0B,EA1BD,MAAzB,YAAK3jB,EAAa,KAClB2jB,EAA0B,EAC1B0L,EAAO,YAAKrvB,EAAa,IACzBsvB,EAAO,YAAKtvB,EAAa,KAEnB,YAAUA,EAAa,IAW7B2jB,EAA0B,EAVG,MAAzB,YAAK3jB,EAAa,KAClB2jB,EAA0B,EAC1B4L,EAAO,YAAKvvB,EAAa,IACzBwvB,EAAO,YAAKxvB,EAAa,KAGzB2jB,EAA0B,EAoB9BA,GACJ,KAAK,EACD,GAAI2L,aAAgBtC,EAAe,CAC/B3sB,EAAetQ,EACf++B,EAAS,YAAgB,CAAC5B,EAAwBoC,GAAOrC,EAA8BF,EAAuBuC,QAAOrB,EAAuBd,EAAyBmC,GAAO,IAAKD,GACjLN,EAASG,EACT,SAASF,EAGT3uB,EAAetQ,EACf++B,EAAS,YAAgB,MAACb,EAAuBnB,EAA0BC,EAAuBuC,KAASD,GAC3GN,EAASG,EACT,SAASF,EAGjB,KAAK,EACD,GAAIQ,aAAgBxC,EAAe,CAC/B3sB,EAAetQ,EACf++B,EAASG,EACTF,EAAS,YAAgB,CAAC7B,EAAwBsC,GAAOvC,EAA8BF,EAAuByC,QAAOvB,EAAuBd,EAAyBqC,GAAO,IAAKD,GACjL,SAASP,EAGT3uB,EAAetQ,EACf++B,EAASG,EACTF,EAAS,YAAgB,MAACd,EAAuBnB,EAA0BC,EAAuByC,KAASD,GAC3G,SAASP,EAGjB,KAAK,EACD,MAAM,IAAKxzC,MAAM,mDAkBhC,CACD,MAAMi0C,EAAe,CAACR,EAAIC,GAC1B,IAAIQ,EAA2BC,EAAMC,EAAMC,EAAMC,EAkCjD,OAjCK,YAAUL,EAAa,IAoBlB,YAAUA,EAAa,IAW7BC,EAA4B,EAVC,MAAzB,YAAKD,EAAa,KAClBC,EAA4B,EAC5BG,EAAO,YAAKJ,EAAa,IACzBK,EAAO,YAAKL,EAAa,KAGzBC,EAA4B,EA1BH,MAAzB,YAAKD,EAAa,KAClBC,EAA4B,EAC5BC,EAAO,YAAKF,EAAa,IACzBG,EAAO,YAAKH,EAAa,KAEnB,YAAUA,EAAa,IAW7BC,EAA4B,EAVC,MAAzB,YAAKD,EAAa,KAClBC,EAA4B,EAC5BG,EAAO,YAAKJ,EAAa,IACzBK,EAAO,YAAKL,EAAa,KAGzBC,EAA4B,EAoBhCA,GACJ,KAAK,EACD,GAAIE,aAAgB5C,EAAe,CAC/B3sB,EAAetQ,EACf++B,EAAS,YAAgB,CAAC5B,EAAwB0C,GAAO3C,EAA8BF,EAAuB6C,QAAO3B,EAAuBd,EAAyByC,GAAO,IAAKD,GACjLZ,EAASG,EACT,SAASF,EAGT3uB,EAAetQ,EACf++B,EAAS,YAAgB,MAACb,EAAuBnB,EAA0BC,EAAuB6C,KAASD,GAC3GZ,EAASG,EACT,SAASF,EAGjB,KAAK,EACD,GAAIc,aAAgB9C,EAAe,CAC/B3sB,EAAetQ,EACf++B,EAASG,EACTF,EAAS,YAAgB,CAAC7B,EAAwB4C,GAAO7C,EAA8BF,EAAuB+C,QAAO7B,EAAuBd,EAAyB2C,GAAO,IAAKD,GACjL,SAASb,EAGT3uB,EAAetQ,EACf++B,EAASG,EACTF,EAAS,YAAgB,MAACd,EAAuBnB,EAA0BC,EAAuB+C,KAASD,GAC3G,SAASb,EAGjB,KAAK,EACD,MAAM,IAAKxzC,MAAM,kDAK5B,MAAI4zC,aAAgBpC,GAoFpB,CACD,MAAM+C,EAAqF,EAA/EhgC,EAASmQ,QAAQ6sB,EAAuBoC,GAAOpC,EAAuBqC,IAClF,GAAY,IAARW,EACA,OAAa,EAANA,EAGP1vB,EAAetQ,EACf++B,EAAS,YAAKrxC,EAAW,IACzBsxC,EAAS,YAAKtxC,EAAW,IACzB,SAASuxC,EA5Fb,GAAqC,MAAjC9B,EAAwBkC,GAAe,CACvC,MAAMY,EAAqF,EAA/EjgC,EAASmQ,QAAQ6sB,EAAuBoC,GAAOpC,EAAuBqC,IAClF,GAAY,IAARY,EACA,OAAa,EAANA,EAGP3vB,EAAetQ,EACf++B,EAAS,iBAAKb,EAAuB,YAAKxwC,EAAW,KACrDsxC,EAAS,YAAK5B,EAAyBiC,GAAO,YAAK3xC,EAAW,KAC9D,SAASuxC,EAGZ,CACD,MAAMiB,EAAe,CAAChB,EAAIC,GAC1B,IAAIgB,EAA2BC,EAAMC,EAAMC,EAAMC,EAkCjD,OAjCK,YAAUL,EAAa,IAoBlB,YAAUA,EAAa,IAW7BC,EAA4B,EAVC,MAAzB,YAAKD,EAAa,KAClBC,EAA4B,EAC5BG,EAAO,YAAKJ,EAAa,IACzBK,EAAO,YAAKL,EAAa,KAGzBC,EAA4B,EA1BH,MAAzB,YAAKD,EAAa,KAClBC,EAA4B,EAC5BC,EAAO,YAAKF,EAAa,IACzBG,EAAO,YAAKH,EAAa,KAEnB,YAAUA,EAAa,IAW7BC,EAA4B,EAVC,MAAzB,YAAKD,EAAa,KAClBC,EAA4B,EAC5BG,EAAO,YAAKJ,EAAa,IACzBK,EAAO,YAAKL,EAAa,KAGzBC,EAA4B,EAoBhCA,GACJ,KAAK,EACD,GAAIE,aAAgBpD,EAAe,CAC/B3sB,EAAetQ,EACf++B,EAAS,YAAgB,CAAC5B,EAAwBkD,GAAOnD,EAA8BF,EAAuBqD,QAAOnC,EAAuBd,EAAyBiD,GAAO,IAAKD,GACjLpB,EAASG,EACT,SAASF,EAGT3uB,EAAetQ,EACf++B,EAAS,YAAgB,MAACb,EAAuBnB,EAA0BC,EAAuBqD,KAASD,GAC3GpB,EAASG,EACT,SAASF,EAGjB,KAAK,EACD,GAAIsB,aAAgBtD,EAAe,CAC/B3sB,EAAetQ,EACf++B,EAASG,EACTF,EAAS,YAAgB,CAAC7B,EAAwBoD,GAAOrD,EAA8BF,EAAuBuD,QAAOrC,EAAuBd,EAAyBmD,GAAO,IAAKD,GACjL,SAASrB,EAGT3uB,EAAetQ,EACf++B,EAASG,EACTF,EAAS,YAAgB,MAACd,EAAuBnB,EAA0BC,EAAuBuD,KAASD,GAC3G,SAASrB,EAGjB,KAAK,EACD,MAAM,IAAKxzC,MAAM,oDAkBhC,CACU,YAAKiC,EAAW,IAA3B,MACM8Y,EAAe,CAAC04B,EAAIC,GAC1B,IAAIqB,EAA2BC,EAAMC,EAAI3C,EAAM4C,EAkC/C,OAjCK,YAAUn6B,EAAa,IAoBlB,YAAUA,EAAa,IAW7Bg6B,EAA4B,EAVC,MAAzB,YAAKh6B,EAAa,KAClBg6B,EAA4B,EAC5BzC,EAAO,YAAKv3B,EAAa,IACzBm6B,EAAO,YAAKn6B,EAAa,KAGzBg6B,EAA4B,EA1BH,MAAzB,YAAKh6B,EAAa,KAClBg6B,EAA4B,EAC5BC,EAAO,YAAKj6B,EAAa,IACzBk6B,EAAK,YAAKl6B,EAAa,KAEjB,YAAUA,EAAa,IAW7Bg6B,EAA4B,EAVC,MAAzB,YAAKh6B,EAAa,KAClBg6B,EAA4B,EAC5BzC,EAAO,YAAKv3B,EAAa,IACzBm6B,EAAO,YAAKn6B,EAAa,KAGzBg6B,EAA4B,EAoBhCA,GACJ,KAAK,EACD,GAAIE,aAAczD,EAAe,CAC7B3sB,EAAetQ,EACf++B,EAAS,YAAgB,CAAC5B,EAAwBuD,GAAKxD,EAA8BF,EAAuB0D,QAAKxC,EAAuBd,EAAyBsD,GAAK,IAAKD,GAC3KzB,EAASG,EACT,SAASF,EAGT3uB,EAAetQ,EACf++B,EAAS,YAAgB,MAACb,EAAuBnB,EAA0BC,EAAuB0D,KAAOD,GACzGzB,EAASG,EACT,SAASF,EAGjB,KAAK,EACD,GAAI0B,aAAgB1D,EAAe,CAC/B3sB,EAAetQ,EACf++B,EAASG,EACTF,EAAS,YAAgB,CAAC7B,EAAwBwD,GAAOzD,EAA8BF,EAAuB2D,QAAOzC,EAAuBd,EAAyBuD,GAAO,IAAK5C,GACjL,SAASkB,EAGT3uB,EAAetQ,EACf++B,EAASG,EACTF,EAAS,YAAgB,MAACd,EAAuBnB,EAA0BC,EAAuB2D,KAAS5C,GAC3G,SAASkB,EAGjB,KAAK,EACD,MAAM,IAAKxzC,MAAM,kDAK5B,IAA2B,MAAvB,YAAKiC,EAAW,IAuEpB,CACD4iB,EAAetQ,EACf++B,EAAS,YAAKrxC,EAAW,IACzBsxC,EAAS,YAAKtxC,EAAW,IACzB,SAASuxC,EA3EyB,CACrB,YAAKvxC,EAAW,IAA7B,MACMsiB,EAAe,CAACkvB,EAAIC,GAC1B,IAAIyB,EAA2BC,EAAMC,EAAMhD,EAAMiD,EAkCjD,OAjCK,YAAU/wB,EAAa,IAoBlB,YAAUA,EAAa,IAW7B4wB,EAA4B,EAVC,MAAzB,YAAK5wB,EAAa,KAClB4wB,EAA4B,EAC5B9C,EAAO,YAAK9tB,EAAa,IACzB+wB,EAAO,YAAK/wB,EAAa,KAGzB4wB,EAA4B,EA1BH,MAAzB,YAAK5wB,EAAa,KAClB4wB,EAA4B,EAC5BC,EAAO,YAAK7wB,EAAa,IACzB8wB,EAAO,YAAK9wB,EAAa,KAEnB,YAAUA,EAAa,IAW7B4wB,EAA4B,EAVC,MAAzB,YAAK5wB,EAAa,KAClB4wB,EAA4B,EAC5B9C,EAAO,YAAK9tB,EAAa,IACzB+wB,EAAO,YAAK/wB,EAAa,KAGzB4wB,EAA4B,EAoBhCA,GACJ,KAAK,EACD,GAAIE,aAAgB7D,EAAe,CAC/B3sB,EAAetQ,EACf++B,EAAS,YAAgB,CAAC5B,EAAwB2D,GAAO5D,EAA8BF,EAAuB8D,QAAO5C,EAAuBd,EAAyB0D,GAAO,IAAKD,GACjL7B,EAASG,EACT,SAASF,EAGT3uB,EAAetQ,EACf++B,EAAS,YAAgB,MAACb,EAAuBnB,EAA0BC,EAAuB8D,KAASD,GAC3G7B,EAASG,EACT,SAASF,EAGjB,KAAK,EACD,GAAI8B,aAAgB9D,EAAe,CAC/B3sB,EAAetQ,EACf++B,EAASG,EACTF,EAAS,YAAgB,CAAC7B,EAAwB4D,GAAO7D,EAA8BF,EAAuB+D,QAAO7C,EAAuBd,EAAyB2D,GAAO,IAAKjD,GACjL,SAASmB,EAGT3uB,EAAetQ,EACf++B,EAASG,EACTF,EAAS,YAAgB,MAACd,EAAuBnB,EAA0BC,EAAuB+D,KAASjD,GAC3G,SAASmB,EAGjB,KAAK,EACD,MAAM,IAAKxzC,MAAM,+CAqBrC,OAiBOwzC,CAA4Bj/B,EAAU,YAAYvX,GAAK,YAAYC,IAiC3E,SAASs4C,EAA0B77C,EAAG0rB,EAAKhtB,GAC9C,IAAIkB,EAAIlB,EACRu6C,EAAoBrzC,IAChB8lB,EAAI9rB,GAAKgG,EACThG,EAAMA,EAAI,EAAK,GAChBI,GA2BA,SAAS87C,EAAsBjhC,EAAUxa,GAC5C,OAAO,YAAO,CAACkK,EAAK2d,IAAM2wB,EAAkBh+B,EAAUqN,EAAG3d,QAAMwuC,EAAuB14C,GAOnF,SAAS07C,EAAoBlhC,EAAUta,GAC1C,GAAI,YAAYA,GACZ,OAAOu7C,EAAsBjhC,EAAUta,GAEtC,GAAIA,aAAa,IAClB,OATD,SAA8Bsa,EAAUxa,GAC3C,OAAO,YAAO,CAACkK,EAAK2d,IAAM2wB,EAAkBh+B,EAAUqN,EAAG3d,QAAMwuC,EAAuB14C,GAQ3E27C,CAAqBnhC,EAAUta,GAErC,CACD,MAAMyrB,EAAK,YAAczrB,GACzB,IACI,OAnCL,SAAwC4qB,EAAcxH,EAASsI,GAElE,OAAa,CACT,MAAMpR,EAAWsQ,EAAc5gB,EAAMoZ,EAASjX,EAAIuf,EAClD,IAAIvf,EAAE,6CAOF,OAAOnC,EANP4gB,EAAetQ,EACf8I,EAAUk1B,EAAkBh+B,EAAUnO,EAAE,0DAA2DnC,GACnG0hB,EAAQvf,GA4BDuvC,CAA+BphC,OAAUk+B,EAAuB/sB,GAE3E,QACIA,EAAG5gB,YAKR,MAAM8wC,EACT,YAAYrhC,EAAUkS,GAClBzqB,KAAKuY,SAAWA,EAChBvY,KAAKyqB,KAAOA,EAEhB,cAEI,OAA2C,EA2Q5C,SAAoCC,GACvC,IAAIvf,EACAtD,EAAM,EACV,MAAMgB,EAAa,YAAc6hB,GACjC,IACI,KAAO7hB,EAAW,8CAA8C,CAC5D,MAAMgW,EAAMhW,EAAW,0DACvBhB,EAAmE,GAA1DsD,EAA2B,EAAtB,YAAe0T,IAAahX,GAAO,GAAKsD,EAAK,MAGnE,QACItC,EAAWC,UAEf,OAAuB,EAAhBoE,KAAKqP,IAAI1U,GAxRLgyC,CADO75C,MAGlB,OAAO8qB,GAEH,OAAQA,aAAgB8uB,GAA+H,IAAjHvC,EAAsByC,EAD9C95C,MAC8E+5C,EAD9E/5C,MAC0G+5C,EAAoBjvB,IAEhJ,WAEI,MAAQ,QAAU,YAAK,KAAM,YAAOxnB,IAChC,IAAIuc,EAAevc,EACnB,OAAO,YAASuc,IAHN7f,OAIA,IAElBxB,IAAKE,OAAOC,eACR,MAAO,YAEX,OAAO4H,GAEH,OAAOtD,MAAMuD,KADCxG,MAGlB,UAAU8qB,GAEN,OAA8G,EAAvGusB,EAAsByC,EADnB95C,MAC+C+5C,EAD/C/5C,MACuE+5C,EAAoBjvB,IAEzG,oDAAsDxnB,GAClD,MAAM,IAAKU,MAAM,sBAErB,mDACI,MAAM,IAAKA,MAAM,sBAErB,uDAAyDV,GACrD,MAAM,IAAKU,MAAM,sBAErB,yDAA2DV,GAEvD,OAAOozC,EAAkBoD,EADf95C,MAC2CsD,EAAGy2C,EAD9C/5C,OAGd,2DAA6DopB,EAAKhtB,GAE9Dm9C,EAA0BQ,EADhB/5C,MACwCopB,EAAKhtB,GAE3D,4DACI,OAAO,EAEX,uDAEI,OAAiC,EAA1B49C,EADGh6C,MAGd,+DAEI,OAAiC,EAA1Bg6C,EADGh6C,MAGd,gBAEI,OAAOm3C,EAA4B4C,EADzB/5C,OAGd,CAACtB,OAAOiI,YACJ,OAAO,YAAW3G,KAAK4G,iBAE3B,iDAEI,OAAOuwC,EAA4B4C,EADzB/5C,OAGd,WAEI,OAAiC,EAA1Bg6C,EADGh6C,MAGd,IAAI4lB,GAEA,MAAM,IAAK5hB,MAAM,yBAGrB,QACI,MAAM,IAAKA,MAAM,yBAErB,OAAO4hB,GACH,MAAM,IAAK5hB,MAAM,yBAGrB,IAAI4hB,GAEA,OAAOq0B,EADGj6C,KACoB4lB,GAElC,OAEI,OAAO,YAAOtiB,GAAMA,EADVtD,MAGd,SAEI,OAAO,YAAOsD,GAAMA,EADVtD,MAGd,UAEI,OAAO,YAAOyE,GAAM,CAACA,EAAGA,GADdzE,MAGd,QAAQuJ,EAAGgiB,GACP,MAAM7tB,EAAIsC,KACV,YAAWsD,IACPiG,EAAEjG,EAAGA,EAAG5F,IACTA,IAQJ,SAASw8C,EAAgB3hC,EAAUkS,GACtC,OAAO,IAAImvB,EAAUrhC,EAAUkS,GAG5B,SAASqvB,EAAwBK,GACpC,OAAOA,EAAK5hC,SAGT,SAASwhC,EAAoBI,GAChC,OAAOA,EAAK1vB,KAGT,SAAS2vB,EAAgB7hC,GAC5B,OAAO2hC,EAAgB3hC,OAAUk+B,GAG9B,SAAS4D,EAAe38C,EAAGkB,GAC9B,OAAOs7C,EAAgBJ,EAAwBp8C,GAAI64C,EAAkBuD,EAAwBp8C,GAAIkB,EAAOm7C,EAAoBr8C,KAOzH,SAASs8C,EAAqBt8C,GACjC,OAAOm4C,EAAoBkE,EAAoBr8C,IAG5C,SAASu8C,EAAoBv8C,EAAGkB,GACnC,OAAO83C,EAAkBoD,EAAwBp8C,GAAIkB,EAAOm7C,EAAoBr8C,IA2L7E,SAAS4J,EAAMiR,GAClB,OAAO6hC,EAAgB7hC,GAmCpB,SAASiU,EAAOC,EAAUlU,GAC7B,OAAO2hC,EAAgB3hC,EAAUkhC,EAAoBlhC,EAAUkU,M,6BCnxDnE,+EAIA,MAAM6tB,EAAY,uFACZC,EAAoB,uEACpBC,EAAe,8EAwBd,SAASxnC,EAAM3F,GAClB,SAASotC,EAAcptC,GACnB,OAAOA,EAAIsM,QAAQ4gC,EAAmB,kBAE1C,MAAMG,EAAmBrtC,EAAIqQ,OAAO7B,cACpC,GAAIy+B,EAAU39B,KAAK+9B,GACf,OAAO,YAAKA,EAAkB,IAAK,IAAK,IAAK,KAE5C,GAAIH,EAAkB59B,KAAK+9B,GAC5B,OAAOD,EAAcC,GAEpB,GAAIF,EAAa79B,KAAK+9B,GACvB,OAAOD,EAAcC,EAAiB/gC,QAAQ,cAAe,KAG7D,MAAM,IAAI3V,MAAM,qFAuBxB,IACI22C,EACAC,EAFAC,GAA0B,EAG9B,SAASC,IACLH,EAAa,IAAI13C,MAAM,KACvB23C,EAAa,GACb,IAAK,IAAIx+C,EAAI,EAAGA,EAAI,IAAKA,IACrBu+C,EAAWv+C,IAAMA,EAAI,KAAO2O,SAAS,IAAI3H,OAAO,GAChDw3C,EAAWD,EAAWv+C,IAAMA,EAEhCy+C,GAA0B,EA+CvB,SAASE,EAAYC,GACxB,GAAmB,KAAfA,EAAI1+C,OACJ,MAAM,IAAI0H,MAAM,qDAEf62C,GACDC,IAUJ,OARaH,EAAWK,EAAI,IAAML,EAAWK,EAAI,IAC7CL,EAAWK,EAAI,IAAML,EAAWK,EAAI,IAAM,IAC1CL,EAAWK,EAAI,IAAML,EAAWK,EAAI,IAAM,IAC1CL,EAAWK,EAAI,IAAML,EAAWK,EAAI,IAAM,IAC1CL,EAAWK,EAAI,IAAML,EAAWK,EAAI,IAAM,IAC1CL,EAAWK,EAAI,KAAOL,EAAWK,EAAI,KACrCL,EAAWK,EAAI,KAAOL,EAAWK,EAAI,KACrCL,EAAWK,EAAI,KAAOL,EAAWK,EAAI,O,8BC3I7C,+EAOO,MAAMC,EACT,YAAY7H,EAAO76B,GACf,MAAMmS,EAAQ,IAAI,IAAU,MAC5B1qB,KAAKuY,SAAWA,EAChBmS,EAAM7W,SAAW7T,KACjBA,KAAKwvC,QAAU,IAAK/P,IAAI,IACxBz/B,KAAK,YAAc,EACnB,MAAM6I,EAAa,YAAcuqC,GACjC,IACI,KAAOvqC,EAAW,8CACTqyC,EAAmBxwB,EAAM7W,SAAUhL,EAAW,2DAG3D,QACIA,EAAWC,WAGnBtK,IAAKE,OAAOC,eACR,MAAO,UAEX,OAAO4H,GAEH,OAAOtD,MAAMuD,KADCxG,MAGlB,iDAEI,OAAO,YADOA,MAGlB,gBAEI,OAAO,YAAc,YADPA,KACoBwvC,QAAQxqC,WAE9C,CAACtG,OAAOiI,YACJ,OAAO,YAAW3G,KAAK4G,iBAE3B,oDAAsD+oC,GAE7CuL,EADSl7C,KACiB2vC,GAEnC,mDAEIwL,EADcn7C,MAGlB,yDAA2D2vC,GAEvD,OAAOyL,EADOp7C,KACwB2vC,GAE1C,2DAA6D3tB,EAAO8tB,GAEhE,YAAe,CAAC1zC,EAAGgO,KACf4X,EAAM8tB,EAAa1zC,GAAKgO,GAFdpK,MAKlB,uDAEI,OAAmC,EAA5Bq7C,EADOr7C,MAGlB,4DACI,OAAO,EAEX,uDAAyD2vC,GAErD,OAAO2L,EADOt7C,KACsB2vC,GAExC,WAEI,OAAmC,EAA5B0L,EADOr7C,MAGlB,IAAI4lB,GAGA,OADKs1B,EADSl7C,KACiB4lB,GADjB5lB,KAIlB,QAEIm7C,EADcn7C,MAGlB,OAAO4lB,GAEH,OAAO01B,EADOt7C,KACsB4lB,GAExC,IAAIA,GAEA,OAAOw1B,EADOp7C,KACwB4lB,GAE1C,OAEI,OAAO,YAAKtiB,GAAMA,EADJtD,MAGlB,SAEI,OAAO,YAAKsD,GAAMA,EADJtD,MAGlB,UAEI,OAAO,YAAKyE,GAAM,CAACA,EAAGA,GADRzE,MAGlB,QAAQuJ,EAAGgiB,GACP,MAAMb,EAAQ1qB,KACd,YAASsD,IACLiG,EAAEjG,EAAGA,EAAGonB,IACTA,IAYX,SAAS6wB,EAA4B7wB,EAAO9E,GACxC,MAAMtf,EAAoC,EAAhCokB,EAAMnS,SAAS7N,YAAYkb,GACrC,IAAI3f,EACAw9B,EAAS,KAIb,OAHAx9B,EAAa,CAAC,YAAYykB,EAAM8kB,QAASlpC,EAAG,IAAI,IAAU,IAAMm9B,EAASh/B,IACrEg/B,EAASh/B,KACRg/B,GACDx9B,EAAW,GACJ,EAAC,EAAMK,EAAGL,EAAW,GAAGu0B,UAAWghB,GAAQ9wB,EAAMnS,SAAS3N,OAAOgb,EAAG41B,KAGpE,EAAC,EAAOl1C,GAAI,GAgCpB,SAAS60C,EAAezwB,GAC3BA,EAAM8kB,QAAQ92B,QAGX,SAAS2iC,EAAmB3wB,GAC/B,IAAIpU,EAAQ,EACRzN,EAAa,YAAc6hB,EAAM8kB,QAAQxqC,UAC7C,IACI,KAAO6D,EAAW,8CAA8C,CAE5DyN,EAAUA,EADIzN,EAAW,0DACDvM,OAAU,GAG1C,QACIuM,EAAWC,UAEf,OAAe,EAARwN,EAGJ,SAAS4kC,EAAmBxwB,EAAO9E,GACtC,MAAM3f,EAAas1C,EAA4B7wB,EAAO9E,GACtD,IAAIumB,EAYJ,OATQA,EAFJlmC,EAAW,IACPA,EAAW,IAAM,EACS,EAOJ,EAEtBkmC,GACJ,KAAK,EACD,OAAO,EAEX,KAAK,EACD,GAAIlmC,EAAW,GAAI,CACK,YAAgBykB,EAAM8kB,QAASvpC,EAAW,IAAIrJ,KAAKgpB,GACvE,OAAO,EAIP,OADA8E,EAAM8kB,QAAQn5B,IAAIpQ,EAAW,GAAI,CAAC2f,KAC3B,GAMhB,SAASw1B,EAAwB1wB,EAAO9E,GAC3C,MAAM3f,EAAas1C,EAA4B7wB,EAAO9E,GACtD,IAAIumB,EAYJ,OATQA,EAFJlmC,EAAW,IACPA,EAAW,IAAM,EACS,EAOJ,EAEtBkmC,GACJ,KAAK,EACD,OAAO,EAEX,KAAK,EACD,OAAO,GAKZ,SAASmP,EAAsB5wB,EAAO9E,GACzC,MAAM3f,EAAas1C,EAA4B7wB,EAAO9E,GACtD,IAAIumB,EAYJ,OATQA,EAFJlmC,EAAW,IACPA,EAAW,IAAM,EACS,EAOJ,EAEtBkmC,GACJ,KAAK,EAED,OADA,YAAgBzhB,EAAM8kB,QAASvpC,EAAW,IAAIzI,OAAOyI,EAAW,GAAI,IAC7D,EAEX,KAAK,EACD,OAAO,K,gCCjQnB,8CAyKe,IA7Ef,MACI,SAASoH,EAAKqN,EAAOpE,GAQjB,GAPAjJ,EAAMpK,MAAMC,QAAQmK,GAAOA,EAAI9J,KAAK,IAAM8J,EAC7B,MAATqN,GAA0B,MAATpE,EACjBjJ,EAAMA,EAAIG,UAAUkN,EAAOA,EAAQpE,GAErB,MAAToE,IACLrN,EAAMA,EAAIG,UAAUkN,SAEF,IAAXgW,EAAwB,CAC/B,MAAM1e,EAAQ0e,EAAOlqB,KAAK6G,EAAK,WAC/B,OAAO,IAAIlD,WAAW6H,EAAMuuB,OAAQvuB,EAAMwuB,WAAYxuB,EAAMyuB,YAG5D,OAzGZ,SAAwBpzB,GACpB,MAAM2E,EAAQ,IAAI7H,WAAwB,EAAbkD,EAAI/Q,QAC3B0kC,EAAO,IAAIV,SAAStuB,EAAMuuB,QAChC,IAAK,IAAInkC,EAAI,EAAGA,EAAIiR,EAAI/Q,OAAQF,IAAK,CACjC,MAAMq/C,EAAOpuC,EAAImJ,WAAWpa,GAC5B4kC,EAAK0a,UAAc,EAAJt/C,EAAOq/C,GANT,GAQjB,OAAOzpC,EAkGQ2pC,CAAetuC,GAG9B,UAAU2E,EAAO0I,EAAOpE,GACpB,MAAM0L,EAAQ3N,YAAYC,OAAOtC,GAASA,EAAQ7H,WAAW3D,KAAKwL,GAClE,IAAIuuB,EAAS,IAAIp2B,WAAW6X,EAAMue,OAAQve,EAAMwe,WAAYxe,EAAMye,YAOlE,OANa,MAAT/lB,GAA0B,MAATpE,EACjBiqB,EAASA,EAAOqb,SAASlhC,EAAOA,EAAQpE,GAE1B,MAAToE,IACL6lB,EAASA,EAAOqb,SAASlhC,IAEF,oBAAhBmhC,YACA,IAAIA,YAAY,YAAYC,OAAOvb,QAEnB,IAAX7P,EACLA,EAAOlqB,KAAK+5B,GAAQx1B,SAAS,WAhHhD,SAAwBiH,GACpB,MAAMgQ,EAAQ3N,YAAYC,OAAOtC,GAASA,EAAQ7H,WAAW3D,KAAKwL,GAC5DgvB,EAAO,IAAIV,SAASte,EAAMue,OAAQve,EAAMwe,WAAYxe,EAAMye,YAC1D9iB,EAAQ,IAAI1a,MAAM+9B,EAAKP,WAAa,GAC1C,IAAK,IAAIrkC,EAAI,EAAGA,EAAIuhB,EAAMrhB,OAAQF,IAAK,CACnC,MAAMq/C,EAAOza,EAAKE,UAAc,EAAJ9kC,GAff,GAgBbuhB,EAAMvhB,GAAKkP,OAAOywC,aAAaN,GAEnC,OAAO99B,EAAMpa,KAAK,IA2GHy4C,CAAezb,KA4ClC,MACM0b,EAAQ,IAzCd,MACI,SAAS5uC,EAAKqN,EAAOpE,GAQjB,GAPAjJ,EAAMpK,MAAMC,QAAQmK,GAAOA,EAAI9J,KAAK,IAAM8J,EAC7B,MAATqN,GAA0B,MAATpE,EACjBjJ,EAAMA,EAAIG,UAAUkN,EAAOA,EAAQpE,GAErB,MAAToE,IACLrN,EAAMA,EAAIG,UAAUkN,IAEG,oBAAhBwhC,YACP,OAAO,IAAIA,aAAcC,OAAO9uC,GAE/B,QAAsB,IAAXqjB,EAAwB,CACpC,MAAM1e,EAAQ0e,EAAOlqB,KAAK6G,EAAK,QAC/B,OAAO,IAAIlD,WAAW6H,EAAMuuB,OAAQvuB,EAAMwuB,WAAYxuB,EAAMyuB,YAG5D,OA9HZ,SAAqBpzB,GACjB,IAAI+uC,EAAM,EACNpB,EAAM,IAAI7wC,WAAwB,EAAbkD,EAAI/Q,QAC7B,IAAK,IAAIF,EAAI,EAAGA,EAAIiR,EAAI/Q,OAAQF,IAAK,CACjC,IAAIq/C,EAAOpuC,EAAImJ,WAAWpa,GAC1B,GAAIq/C,GAAQ,OAAUA,GAAQ,MAAQ,CAClC,MAAMY,EAAYjgD,EAAIiR,EAAI/Q,OAAU+Q,EAAImJ,WAAWpa,EAAI,GAAK,EACxDigD,GAAY,OAAUA,GAAY,OAClCjgD,GAAK,EACLq/C,EAAyB,MAAjBA,EAAO,OAAkBY,EAAW,MAAS,MACjDZ,EAAO,QACPT,EAAIoB,KAAS,IAAeX,IAAS,GACrCT,EAAIoB,KAAS,IAAeX,IAAS,GAAM,GAC3CT,EAAIoB,KAAS,IAAeX,IAAS,EAAK,GAC1CT,EAAIoB,KAAS,IAAqB,GAAPX,KAI/BT,EAAIoB,KAAS,IACbpB,EAAIoB,KAAS,IACbpB,EAAIoB,KAAS,UAGZX,GAAQ,IACbT,EAAIoB,KAAS,EAAaX,EAErBA,GAAQ,MACbT,EAAIoB,KAAS,IAAcX,IAAS,EACpCT,EAAIoB,KAAS,IAAqB,GAAPX,IAG3BT,EAAIoB,KAAS,IAAcX,IAAS,GACpCT,EAAIoB,KAAS,IAAeX,IAAS,EAAK,GAC1CT,EAAIoB,KAAS,IAAqB,GAAPX,GAInC,OADAT,EAAM,IAAI7wC,WAAW6wC,EAAIza,OAAO5gC,MAAM,EAAGy8C,IAClCpB,EAyFQsB,CAAYjvC,GAG3B,UAAU2E,EAAO0I,EAAOpE,GACpB,MAAM0L,EAAQ3N,YAAYC,OAAOtC,GAASA,EAAQ7H,WAAW3D,KAAKwL,GAClE,IAAIuuB,EAAS,IAAIp2B,WAAW6X,EAAMue,OAAQve,EAAMwe,WAAYxe,EAAMye,YAOlE,OANa,MAAT/lB,GAA0B,MAATpE,EACjBiqB,EAASA,EAAOqb,SAASlhC,EAAOA,EAAQpE,GAE1B,MAAToE,IACL6lB,EAASA,EAAOqb,SAASlhC,IAEF,oBAAhBmhC,aACA,IAAIA,aAAcC,OAAOvb,QAET,IAAX7P,EACLA,EAAOlqB,KAAK+5B,GAAQx1B,SAAS,QAvGhD,SAAqBiH,GACjB,IAAIoqC,EAAM,EACV,MAAMG,EAAa,KACf,MAAMC,EAAKxqC,EAAMoqC,KACjB,GAAoB,IAAV,IAALI,GACD,OAAOA,EAEN,GAAoB,MAAV,IAALA,GAAqB,CAE3B,OAAc,GAALA,IAAc,EAAW,GADvBxqC,EAAMoqC,KAGhB,GAAoB,MAAV,IAALI,GAAqB,CAG3B,OAAc,GAALA,IAAc,IAAa,GAFzBxqC,EAAMoqC,OAE4B,EAAW,GAD7CpqC,EAAMoqC,KAGhB,GAAoB,MAAV,IAALI,GAAqB,CAI3B,OAAc,EAALA,IAAc,IAAa,GAHzBxqC,EAAMoqC,OAG4B,IAAa,GAF/CpqC,EAAMoqC,OAEkD,EAAW,GADnEpqC,EAAMoqC,KAIjB,MAAM,IAAI9uC,WAAW,sBAAwBkvC,IAG/C7+B,EAAQ,IAAI1a,MAClB,KAAOm5C,EAAMpqC,EAAM1V,QAAQ,CACvB,MAAMm/C,EAAOc,IACb5+B,EAAM/gB,KAAK0O,OAAOmxC,cAAchB,IAEpC,OAAO99B,EAAMpa,KAAK,IA2EHm5C,CAAYnc,KAOxB,SAASoc,IAAa,OAAOV,K,sDC5KrB,SAASW,EAAMC,GAC1B,IAAIC,EAAY,2HACZC,EAAO,CACP,KAAM,MACN,KAAM,MACN,KAAM,MACN,KAAM,MACN,KAAM,MACN,IAAK,MACL,KAAM,QAIV,OADAD,EAAU3iC,UAAY,EACf2iC,EAAUngC,KAAKkgC,GAClB,IAAMA,EAAUljC,QAAQmjC,GAAW,SAAU53B,GACzC,IAAIjnB,EAAI8+C,EAAK73B,GACb,MAAoB,iBAANjnB,EAAiBA,EAC3B,OAAS,OAASinB,EAAE1O,WAAW,GAAGzL,SAAS,KAAKpL,OAAO,MAC1D,IACL,IAAMk9C,EAAY,IAnB1B,mC,qECAO,MAAMG,EACT,YAAYC,GAAY,GACpBj9C,KAAKk9C,IAAM,EACXl9C,KAAKm9C,WAAaF,EAClBj9C,KAAKo9C,WAAa,IAAI3d,IAE1B,kBACI,OAAOz/B,KAAKm9C,WAEhB,SACI,IAAKn9C,KAAKm9C,WAAY,CAClBn9C,KAAKm9C,YAAa,EAClB,IAAK,MAAO,CAAEE,KAAar9C,KAAKo9C,WAC5BC,KAIZ,YAAY9zC,GACR,MAAMuN,EAAK9W,KAAKk9C,IAEhB,OADAl9C,KAAKo9C,WAAW/mC,IAAIrW,KAAKk9C,MAAO3zC,GACzBuN,EAEX,eAAeA,GACX,OAAO9W,KAAKo9C,WAAWE,OAAOxmC,GAElC,SAASvN,EAAGvB,GACR,MAAMu1C,EAAIv9C,KACJ8W,EAAK9W,KAAKw9C,YAAqB,MAATx1C,EAAgBuB,EAAI,IAAMA,EAAEvB,IACxD,MAAO,CAAE,UAAYu1C,EAAEE,eAAe3mC,MAGvC,MAAM4mC,UAA+B15C,MACxC,cACI0B,MAAM,8BACNnJ,OAAOohD,eAAe39C,KAAM09C,EAAuBlhD,YAGpD,MAAMohD,EACT,cACI59C,KAAK69C,UAAY,EAErB,oCACI,OAAO,IAEX,oBACI,OAAO79C,KAAK69C,YAAcD,EAAWE,uBAEzC,OAAOv0C,GACHvJ,KAAK69C,UAAY,EACjBE,WAAWx0C,EAAG,IAGf,SAASy0C,EAAcz0C,GAC1B,OAAQ00C,IACJ,GAAIA,EAAIC,YAAYC,YAChBF,EAAIG,SAAS,IAAIV,QAEhB,GAAIO,EAAII,WAAWC,oBACpBL,EAAII,WAAWE,OAAO,KAClB,IACIh1C,EAAE00C,GAEN,MAAOjoB,GACHioB,EAAIO,QAAQxoB,WAKpB,IACIzsB,EAAE00C,GAEN,MAAOjoB,GACHioB,EAAIO,QAAQxoB,KAKrB,SAASyoB,EAAcC,EAAaC,GACvC,OAAOX,EAAeC,IAClBS,EAAY,CACRE,UAAYt7C,IACR,IACIq7C,EAAOr7C,EAAPq7C,CAAUV,GAEd,MAAOY,GACHZ,EAAIO,QAAQK,KAGpBL,QAASP,EAAIO,QACbJ,SAAUH,EAAIG,SACdF,YAAaD,EAAIC,YACjBG,WAAYJ,EAAII,eAIrB,SAASS,EAAgBlgD,GAC5B,OAAOo/C,EAAeC,GAAQA,EAAIW,UAAUhgD,IAgFzC,MAAM4I,EAAY,IA9ElB,MACH,KAAKk3C,EAAaC,GACd,OAAOF,EAAcC,EAAaC,GAEtC,QAAQI,EAAcC,GAClB,OAAOh/C,KAAKi/C,KAAKF,EAAc,IAAMC,GAEzC,MAAM1/B,GACF,OAAO0+B,EAAeC,GAAQ3+B,IAAY2+B,IAE9C,IAAIiB,EAAUC,GACV,MAAMtqC,EAAOqqC,EAASxgD,OAAOiI,YAC7B,IAAImO,EAAMD,EAAKE,OACf,OAAO/U,KAAKo/C,MAAM,KAAOtqC,EAAIE,KAAMhV,KAAKq/C,MAAM,KAC1C,MAAMx3C,EAAMs3C,EAAKrqC,EAAIlW,OAErB,OADAkW,EAAMD,EAAKE,OACJlN,KAGf,OAAOjJ,GACH,OAAOkgD,EAAgBlgD,GAE3B,WAAW8/C,GACP,OAAOA,EAEX,WAAWA,EAAaY,GACpB,OAAOtB,EAAeC,IAClBS,EAAY,CACRE,UAAYt7C,IACRg8C,IACArB,EAAIW,UAAUt7C,IAElBk7C,QAAUl7C,IACNg8C,IACArB,EAAIO,QAAQl7C,IAEhB86C,SAAW96C,IACPg8C,IACArB,EAAIG,SAAS96C,IAEjB46C,YAAaD,EAAIC,YACjBG,WAAYJ,EAAII,eAI5B,QAAQK,EAAaa,GACjB,OAAOvB,EAAeC,IAClBS,EAAY,CACRE,UAAWX,EAAIW,UACfR,SAAUH,EAAIG,SACdF,YAAaD,EAAIC,YACjBG,WAAYJ,EAAII,WAChBG,QAAUK,IACN,IACIU,EAAaV,EAAbU,CAAiBtB,GAErB,MAAOuB,GACHvB,EAAIO,QAAQgB,SAMhC,MAAMC,EAAUd,GACZ,OAAO3+C,KAAK0/C,WAAWf,EAAOc,GAAW,IAAMA,EAAS32C,WAE5D,MAAM62C,EAAOjB,GACT,OAAIiB,IACO3/C,KAAKi/C,KAAKP,EAAa,IAAM1+C,KAAKo/C,MAAMO,EAAOjB,IAG/C1+C,KAAK4/C,YAAO,GAG3B,OACI,OAAO5B,EAAeC,GAAQA,EAAIW,eAAU,M,WCzK7C,MAAM,UAAuB,IAChC,YAAY9+C,KAAQC,GAChB2F,QACA1F,KAAKF,IAAa,EAANA,EACZE,KAAKD,OAASA,EAElB,QACI,MAAO,CAAC,KAAM,UAmCf,MAAM,UAAuB,IAChC,YAAYD,KAAQC,GAChB2F,QACA1F,KAAKF,IAAa,EAANA,EACZE,KAAKD,OAASA,EAElB,QACI,MAAO,CAAC,aAAc,eAQM,IAeA,IAeA,IAeA,IAeA,IChHpC,SAAS8/C,EAAkBC,IAqDpB,MAAMC,EAA2B,IAAI/C,EACrC,SAASgD,EAAWC,GACvB,OAAOjC,EAAeC,IAClBgC,EAAK,CACDrB,UAAYt7C,GAAM26C,EAAIW,UDsE3B,SAA+Bt7C,GAClC,OAAO,IAAI,EAAe,EAAGA,GCvEW48C,CAAsB58C,IACtDk7C,QAAUK,GAAOZ,EAAIW,UD0EtB,IAAI,EAAe,EC1EmCC,IACrDT,SAAUH,EAAIG,SACdF,YAAaD,EAAIC,YACjBG,WAAYJ,EAAII,eAIrB,SAAS8B,EAAkB52C,GAC9B,OAAOy0C,EAAeC,GAAQ10C,EAAE,CAAC00C,EAAIW,UAAWX,EAAIO,QAASP,EAAIG,YAwB9D,SAASgC,EAAe1B,EAAa2B,GACxC,OAJG,SAAe3B,EAAa2B,GAC/B,OAAOC,EAAuB5B,EAAa2B,GAGpC,CAAM3B,EAAa2B,GAEvB,SAASC,EAAuB5B,EAAa6B,EAAcC,EAAuBC,EAA0BvC,GACnF,mBAAjBqC,IACPrC,EAAcqC,EACdA,OAAe9+C,GAEnB,MAAM48C,EAAa,IAAIT,EACvBc,EAAY,CACRE,UAAW2B,GAA8BV,EACzCrB,QAASgC,GAAgDX,EACzDzB,SAAUqC,GAAsDZ,EAChE3B,YAAaA,GAA4B6B,EACzC1B,eC/GD,MAAMqC,EACT,YAAYC,EAAQnC,EAASoC,GACzB5gD,KAAK6gD,OAASF,EACd3gD,KAAK8gD,QAAUtC,GAAW,CAAEuC,OAC5B/gD,KAAKghD,YAAcJ,GAAe,UCHnC,MAAMK,EACT,cACIjhD,KAAKkhD,UAAY,GAErB,IAAI33C,GACAvJ,KAAKmhD,YAAY53C,GAErB,cACI,OAAOvJ,KAEX,QAAQohD,EAAeC,GACnB,IAAIC,EACA1iD,OACqB6C,IAArB4/C,GACAC,EAAS,KACT1iD,EAAQwiD,IAGRE,EAASF,EACTxiD,EAAQyiD,GAEZrhD,KAAKkhD,UAAU/3C,QAASI,GAAmB,IAAbA,EAAEjN,OAAeiN,EAAE3K,GAAS2K,EAAE+3C,EAAQ1iD,IAGxE,WAAW2iD,GACPvhD,KAAKmhD,YAAYI,GAErB,cAAcA,GACVvhD,KAAKwhD,eAAeD,GAGxB,UAAUvmC,GACN,MAAMymC,EAA0B,mBAARzmC,EAClBA,EACAA,EAAI6lC,OAEV,OADA7gD,KAAKmhD,YAAYM,GACV,CAAE34C,QAAS,KAAQ9I,KAAKwhD,eAAeC,KAElD,YAAYl4C,GACRvJ,KAAKkhD,UAAUtkD,KAAK2M,GAExB,eAAeA,GACX,MAAMmR,EAAQ1a,KAAKkhD,UAAU3zC,QAAQhE,GACjCmR,GAAS,GACT1a,KAAKkhD,UAAU1jD,OAAOkd,EAAO,IA2E1B,QCxDA,MAjER,MACH,YAAYgnC,GACR1hD,KAAK2hD,UAAW,EAChB3hD,KAAK4hD,aAAc,EACnB5hD,KAAK6hD,YAAc,EACnB7hD,KAAK8hD,WAAa,EAClB9hD,KAAK+hD,SAAWL,GAAYA,EAAW,EAAIA,EAAW,IACtD1hD,KAAKgiD,WAAY,EACjBhiD,KAAKiiD,SAAW,IAAI,EAExB,UACI,OAAOjiD,KAAKiiD,SAEhB,cACI,OAAOjiD,KAAK2hD,SAEhB,YAAYr+C,GACHtD,KAAK4hD,aAAe5hD,KAAK2hD,WAAar+C,IACvCtD,KAAK2hD,SAAWr+C,EACZtD,KAAK2hD,SACD3hD,KAAKgiD,UACLhiD,KAAK6hD,YAAcK,YAAY,KACtBliD,KAAKgiD,YACNhiD,KAAKmiD,SAAU,GAEnBniD,KAAKiiD,SAASG,QAAQ,IAAInrC,OAC3BjX,KAAK+hD,UAGR/hD,KAAK8hD,WAAa/D,WAAW,KACzB/9C,KAAKmiD,SAAU,EACfniD,KAAK8hD,WAAa,EACd9hD,KAAKgiD,YACLhiD,KAAKmiD,SAAU,GAEnBniD,KAAKiiD,SAASG,QAAQ,IAAInrC,OAC3BjX,KAAK+hD,WAIR/hD,KAAK8hD,aACLO,aAAariD,KAAK8hD,YAClB9hD,KAAK8hD,WAAa,GAElB9hD,KAAK6hD,cACLS,cAActiD,KAAK6hD,aACnB7hD,KAAK6hD,YAAc,KAKnC,UACI7hD,KAAKmiD,SAAU,EACfniD,KAAK4hD,aAAc,EAEvB,QACI5hD,KAAK8I,UAET,QACI9I,KAAKmiD,SAAU,EAEnB,OACIniD,KAAKmiD,SAAU,I,WClDN1qB,EAAconB,GAAW0D,QAAA,MAAe,YAAA9qB,GAAKonB,G,WAgBhD6C,EAASD,G,IACX5iD,EAAI2jD,EAAA,IAAI,EAAYd,GAAsB,eAA1C7iD,EAAI2jD,EHRT,SAAaf,EAAUv/B,GAC1BA,EAAOugC,UAAU,IAAI/B,EAASe,I,CGQZA,EAAZ,EAAAiB,WACF7jD,EAAA,SAAa,EACbA,EAAA,Q,WCTc2/C,EAASmE,EAA2BC,GAC3C,OAAAvkB,EAAA,GAAe3hC,IAAQ,IAAIA,EAAKimD,G,MAAc9D,GAAML,EAAQK,KAAnE+D,G,oBAIA,c,WAOOC,G,OACC,OAAAxkB,EAAA,GAARwkB,G,0CCnBD,SAASC,EAAkBhhC,EAAOihC,EAAMC,EAAMtW,EAAM7+B,GACvD,MAAMo1C,EAbH,SAA+BF,EAAMC,EAAMtW,EAAM7+B,GACpD,MAAMq1C,EAA6C,EAAtB,YAAQH,EAAMrW,GAC3C,GAA6B,IAAzBwW,EACA,MAAM,IAAKl/C,MAAM,sCAErB,MAAMm/C,EAAsBD,EAAuB,EACnD,OAAQ5/C,IACJ,MAAM8/C,EAAsC,EAAnB,YAAQ9/C,EAAG0/C,GACpC,OAASG,GAAuBC,GAAoB,IAAwBD,GAAwBC,GAAoB,EAAe,CAAC9/C,EAAGuK,EAAIvK,EAAGy/C,SAAS,GAKhJM,CAAsBN,EAAMC,EAAMtW,EAAM7+B,GACvD,OAAO,YAAM,IAAM,YAAOo1C,EAAQnhC,IAW/B,SAASwhC,EAAYxhC,EAAOihC,EAAMC,GACrC,OAAOF,EAAkBhhC,EAAOihC,EAAMC,EAAM,EAAG,CAAC1/C,EAAG6H,IAAO7H,EAAI6H,G,0ICxBlCuC,GAQ5B,eACI,0BAA4B,YAAG,wBAACA,EAAK,OAAT,YAAG,wBAACA,EAAK,IAAK,U,WAEvC3G,G,MACGd,EAAA,EAAA+B,MAAA,c,MACiBu7C,EACf,cADoBC,EACpB,cADQpQ,EACR,YAAAqQ,GAAQD,EAAM,GAAKpQ,EAAM,OAAN,E,OAGnB,EAAAprC,MAFE,IAAOu7C,EAET,IAAS,IAASnQ,EAAOmQ,GAEzB,IAAS,IAAanQ,EAAOmQ,EAAKE,GACtC,YAAKrQ,EAAOoQ,K,WAIbz8C,EAAS4oC,G,MACN1pC,EAAA,EAAA+B,MAAA,c,MAKiBu7C,EACnB,cADwBC,EACxB,cADYpQ,EACZ,cAAOmQ,GAAQ5T,E,MACX+T,GAAQ,EAAM,GAAK,WAGnB,EAAA17C,MAFE,IAAOw7C,EAET,IAAS,KAlCNG,EAkC4BH,EAlCxBpQ,EAkCeA,E,WAjCxB,4BAAgB,OAAAwQ,EAAA,GAAAD,EAATvQ,GACP,4BAAgB,OAAAwQ,EAAA,GAAAD,EAATvQ,GACP,4BAASntC,GACP,kBADO,MAAGmtC,EAAM,gBA+B+B,SAAc,GAE7D,IAAS,IAAaA,EAAOsQ,EAAMF,O,OAXxBG,EACf,cADQvQ,EACR,YAAAA,EAAOuQ,GAAOhU,E,MACV4T,GAAOI,EAAK,GAAKvQ,EAAM,OAAN,EACrB,EAAAprC,MAAA,IAAS,IAAaorC,EAAOmQ,EAAKI,G,IA5B3BA,EAAIvQ,E,wLC2FDyQ,EACAC,G,OACd,yCACoBD,EADpB,0B,WAQMC,G,qBACNA,EAAQ9iB,M,WAsBChmB,EAAY8oC,G,MACjB1hC,EAAc0hC,EAAQ9sB,KAAKhc,GAA1B+oC,EAAD,KACAC,E,MAAgB,I,IACRC,GAAY,EACZj8C,EAAQ+7C,E,MAkBhBG,EAAeA,cAAAJ,EAAQI,aAAR,CAjBFnuB,IACb,GAAGkuB,EACC,EAAAD,EAAQjuB,O,CAERkuB,GAAa,E,IACDE,EAAU,YAAKpuB,GAC3B,KAAoBouB,U,MACZpuB,EAAM,YAAAouB,GACV,I,MACQ/hC,EAAgB0hC,EAAQM,OAAOruB,EAAI/tB,GAAlCq8C,EAAD,KACJP,EAAA,SAAiBO,EAAOH,GAChB,EAAcrF,IAAMiF,EAAA,SAAiB,YAAQ,mDAAR,CAA8C/tB,GAAK8oB,KAAKqF,EAFjG,MAGJl8C,EAASq8C,E,MACRxF,GACDiF,EAAA,SAAiB,YAAQ,iDAAR,CAA4C/tB,GAAK8oB,IACtEsF,EAAW,EAAAH,GACfC,GAAa,MAGrBH,EAAA,SAAiBC,EAAMG,GAQpB,EAAcrF,IAAMiF,EAAA,SAAiB,uBAAwBjF,KAA7DqF,EADH,EAAU,mBALN,I,OACIJ,EAAQQ,UAAUP,G,MACjBlF,G,OACDiF,EAAA,SAAiB,uBAAwBjF,IACzC,MACE,GA9BN,S,6JC1Hc0F,G,MACuBA,G,sBAELC,EAAWC,G,OAAtCzkD,KACE,YADFA,KACmB,YAAiBwkD,EAAUT,O,gBAE9C/jD,KACL,gB,WAsBW0kD,EACA1jB,EACAh5B,EACA26C,G,OA0Df,kBAxDI,MAEU36C,MAFWg5B,EAAKh5B,EAAM26C,GACtB+B,I,WCVgBC,EAAcC,EAAed,G,OAQpD,GAPUC,EAAMpB,KACf,SACIgC,EAAA,CAAmBrhD,EAAE6H,IAAyB7H,IAAE6H,gBAAK,EAAa24C,IAASC,EAAMpB,GACjFkC,SAASC,eAAeF,KAGhCd,G,67BCTeiB,EAAwBC,EAAUC,G,MAChCD,GADF,KAAAD,WAAkC,KAAAE,e,YAAlCF,EAAwBC,EAAUC,G,qECiDtC,IACE,I,+BCzDJnpD,GACb,OAAgBA,wBACXA,EACA,eAAiBA,G,SCtBuB,OAChC,UACP,IACI,cAEI,WADI,G,YAKbopD,G,OACL,OAEsB,UADPA,EADf,8C,YAKMA,G,OACN,OAEsB,UADPA,EADf,8C,YAWYC,EAASC,G,OAAoB,0BAAqBD,EAArB,iC,YAOhChG,EAAMiG,G,OAAoB,oCAAyBjG,EAAzB,mB,YAEdkG,EAA6CC,EAAcF,G,OAAoB,YACpG,OdcGpH,EAAeC,GAAQA,EAAIW,UAAUX,EAAIC,ccdvC35B,I,MAAAghC,EAAAhhC,E,OAkCL,aAjCc,EAAgCiF,I,MACtCg8B,EAAM,IAAAC,eAEJ,IAAAL,EAAA,eAEII,EAAA,KAAa,OAAQJ,EAAIM,KAD1BF,EAAA,KAAa,MAAOJ,EAAIM,KAG3B,MAAAL,GACO,EAAEG,GAGfD,EAAM,SAAN,KACIC,EAAA,QACA,KAAO,UAAkCD,M,MAIzB18C,EAAA,YAAAu8C,EAAA,SAApB,SAAoB,iD,MAAf97B,EAAe,4DAChBk8B,EAAA,iBADgB,Y,QAAA38C,YAGpB28C,EAAA,gBAAuBJ,EAAIO,gBAE3BH,EAAA,wB,eACU,OAAAA,EAAII,Yd7BnB,SAAiCL,GACpC,OAAgB,MAATA,GAAiBA,EAAMpH,Yc6BS,CAAAoH,G,gBACvB,KAAOD,EAAPE,M,MAGFv/C,EAAAm/C,EAAIS,Y,OAAJ5/C,O,OAEwBu/C,EAAA,KAAS,YAAT,c,aACVA,EAAA,KAAS,eAAT,e,cAFTA,EAAA,c,SAQRJ,GAAAU,QAAY,EAAUN,OAAQ,GAAqBA,EAAI10B,OAAuB00B,EAAIO,cAAlFX,G,GAIPA,GAAAU,GACeN,IAAOA,EAAA,aAAoB,eACjCA,IACW,eAAmC,YACvC,UAJhBJ,G,0CClCWY,EAAQC,EAAUC,EAAmBtS,G,IAC5CuS,E,MACMlgD,EAAAigD,EAAK5R,U,OAALruC,O,gBADNkgD,GAG+BD,EAAK5R,W,cAHpC6R,EAI2B,c,cAJ3BA,EAKO,YAAU,wDAAV,CAAqDD,EAAK3R,W,MAEjE6R,EAA8BD,SAAY,IAC1CE,EAAkB,YAAWF,G,IAE7BG,E,MACMrgD,EAAAigD,EAAK5R,UAAL,e,MAEIruC,EAAA,qDAAAA,SAAA,aAHVqgD,GAKmB,MAFT,CACmB,KAzCnB/hC,EAyCmB,KAJ7B+hC,EArCU,YAEJ,6BAmCNA,GAMe,E,IA3CL/hC,E,MA8CV2gC,E,SAnDoBna,EAAOwb,GACzB,SAAAA,EAAA,C,MAEQ5mB,EAAgB,YAAhB4mB,EAA4B,K,OAA5B,YAAQ,oBAAR,CAAA5mB,EAAA,CAAkCoL,G,OADtCA,EAiDA,CADEib,EAAQQ,aAAaP,EAASC,EAAK3R,WACPyR,EAAQS,SAC5CC,EACM,oCAAAP,SAAA,IAAAA,EAAA,8CAAAA,SAAA,IAAAA,EAAA,cAAAA,EAAA,aAAAA,EAAA,aAAAA,EAAA,aAAAA,EAAA,OAMNQ,EACGL,EACE,2BACA,kCAELM,EAAqB,YAAWR,EAAcD,GAE9ChB,EAAU,YACV,yCAAM,eAAgBwB,IACtB,yCAAM,mBAAoB,SAC1B,4BAAOX,EAAQa,cACT,iB,MAAA5gD,EAAA+/C,EAAQc,cAAR,eAEI,cADU,aAAM,gBAAN7gD,a,IAGpB8gD,EACA,GAAG,oBAAAf,EAAA,8B,SA/DczhC,GAAA,e,MAEXte,EAAA,iCAEI,uB,OAIC,EAuDsC,CAAmBogD,I,IAC5DW,E,MACM/gD,EAAA+/C,EAAQiB,4BAAR,GAAAhhD,MAAA,cAAAA,I,MACCihD,gBACCjhD,GAAAlE,E,0BAzDFolD,IAClB,IAAG,OAAAC,EAAA,GAAiCD,GAGpC,OAAK,YAAAA,GAC6B,YAA9B,YAAAA,IAEAA,E,EALa,OAAAC,EAAA,GAA0CD,OAuD1B,CAAcvT,GAHnCoT,EAIQjC,GAAYmC,EAAWnC,EAAXmC,CAAoBnlD,QAJxCilD,EAKOpoD,KAPfmoD,EASQM,GAAe,YAEf,OAEQ,GAEG,GAAAlC,EAHJuB,EAEI,GAAAW,EADH,GAAUnC,IAKV,GAASA,KAPZ3gC,I,MAAW+iC,EAWhB,OAXMvC,EAWN,KAAM,SAAAuC,E,OAEF,SAAON,EAAKjC,I,OACd3lD,EACMkoD,I,OACJ,QA/GAC,EA8GqB,IAAAC,KAAA,CAA2BzC,+BA7GhE,EAAgCv7B,I,MACxBi+B,EAAS,eACbA,EAAA,OAAqBljC,IACd,IAAAkjC,EAAO7B,YACL,KAAe6B,EAAOtqD,SAE/BsqD,EAAA,WAAkBF,MAwGDzV,I,MACDiT,EAAW,OAAeuC,EADzBxV,GAEDkT,EAAkB,MAAJ5lD,EAAa,YAAQ,sEAAR,CAAiE8lD,GAAS,YAAQ,0DAAR,CAAqD9lD,EAArD,CAAuD8lD,G,OAChK,mBAAQ,MAAO,GAAsBH,EAAUC,EAAU,iBAAzD,M,IAlHAuC,S,OAqHJxlD,EACM,KAAAskD,EAAA,UAAAA,EAAA,IACmC,cAElC,YAAU,oEAAV,CAAiEH,EAAK3R,WArCrFwS,EAuCQM,GAAe,YAEf,OAEQ,GAEG,GAAAlC,EAHJuB,EAEI,GAAAW,EADH,GAAUnC,IAKV,GAASA,KAPZxS,I,MAAAqS,EAAArS,EAWCzsC,EAAA,e,OAAAA,G,KAAA,I,OAGF,SAAO,aADU,aAAuB,gBACHlE,I,KAHnC,I,OAIG,mBAAQ,MAAO,GAAsBgjD,EAAU,YAAQ,sEAAR,CAAiEG,GAAK,iBAArH,I,eACA,mBAAQ,MAAO,GAAsBH,EAAU,YAAQ,8EAAR,CAA/C9+C,EAA+C,CAA2Ei/C,GAAK,iBAA/H,Q,OAGjBxmB,GAAKgpB,GAAKC,GAAKC,GAAKC,GAAKC,GAAKC,GAAKC,I,IAUrB/hD,E,MATVgiD,EACEvB,EACE,YAAWN,GAAqB1nB,EAASgpB,EAASC,EAASC,EAAUC,EAAUC,EAAUC,EAAUC,O,OAqB3GjB,EAjBOT,MACC,GAAW,EAAe5nB,IAEpBz4B,EAAA,EAAA2gD,EAAmB,OAAnB,MACQ,aAAkBA,EAAoB,IAD9C,IAQF,GAAW,EART,MAOoB,cAAqBqB,EAAgB,IAAO,SAAQ,OAAiBrB,EAAoB,KAIzF,aAAkBqB,EADzB,SAAQ,OAAWrB,KATc,IAGhD,GAAW,EADW,aAAkBqB,EAAgB,GADzC,SAAQ,OAAWrB,KAFhC,IAQF,GAAW,EART,MAOoB,cAAqBqB,EAAgB,IAAO,SAAQ,OAAiBrB,EAAoB,KAIzF,aAAkBqB,EADzB,SAAQ,OAAWrB,Q,+BC3JnCsB,EAAIviD,G,MAGX6jB,E,SAXQ7jB,G,OAGb,OAAA04B,EAAA,iBAAgB7U,I,MAAA2+B,EAAA,KAAS5D,EAAT,K,OAAgBjhD,I,MACzB2C,EAAoB3C,E,MACR,cAAJ,KAAI,CAAa,8BAAY6kD,GAAS5D,IAC7C4D,EAAS,YAAA7kD,EAAKihD,O,CAAQ,cAAI,eAJlC,OAAAlmB,EAAA,GADH14B,IASG,CADHA,G,OAE2B,aA4aoC,YAAa,YAAc,IA5a9D,YAAAuiD,EAApB,c,wVCoBiBlC,EAA2CoC,G,MAChEvmB,EAAe,YAAAumB,iBACfC,EAAa,aAAexmB,GAC1B,QAAAwmB,EAAA,K,MAEEjmC,EAAuB,cAAduxB,EAAT,KACA2U,EAAiE,YAAehmB,IAAQ,YAAAA,GAAWA,EAAA,IAAtF,OAAA8kB,EAAA,GAAsCzT,I,OA4C3C,YAAuBA,EA3ChB,YACf,4BAAI7uC,I,IACc1F,EAgCJ6G,EA/BF2tC,EACA3c,E,OAHZ,aACkB73B,EAoCH,GAJD6G,EAAAnB,EAAMwvC,UAAN,uBACiB,EADjB,WAGmC,qBAAa,EAC/C,GAnCHV,EAA0B,YAAiBpqB,GAAiB,OAAO1kB,EAAMyvC,UAA9B,U,EAA/B+T,GACZrxB,EAAK,GAAiB+uB,EAAQ,YAAArS,GAAgB7uC,EAAM8uC,GAClD,IAAAx0C,EACM63B,EAAA,KAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,MADN,IAAA73B,EAEU8lB,GACZ+R,EAAG/R,EAAH+R,CAAG/R,KAAH+R,CAAG/R,KAAH+R,CAAG/R,KAAH+R,CAAG/R,KAAH+R,CAAG/R,KAAH+R,CAAG/R,KAAH+R,CAAG/R,MAHD,IAAA9lB,EAAA,CAMwBikB,EAAAC,IADT2T,EACS5T,EADT4T,CACS3T,EADT2T,CACS3T,KADT2T,CACS3T,KADT2T,CACS3T,KADT2T,CACS3T,KADT2T,CACS3T,KADT2T,CACS3T,MANxB,IAAAlkB,EAAA,CAS0BikB,EAAAC,EAAAilC,IADTtxB,EACS5T,EADT4T,CACS3T,EADT2T,CACSsxB,EADTtxB,CACSsxB,KADTtxB,CACSsxB,KADTtxB,CACSsxB,KADTtxB,CACSsxB,KADTtxB,CACSsxB,MAT1B,IAAAnpD,EAAA,CAY4BikB,EAAAC,EAAAilC,EAAAC,IADTvxB,EACS5T,EADT4T,CACS3T,EADT2T,CACSsxB,EADTtxB,CACSuxB,EADTvxB,CACSuxB,KADTvxB,CACSuxB,KADTvxB,CACSuxB,KADTvxB,CACSuxB,MAZ5B,IAAAppD,EAAA,CAe8BikB,EAAAC,EAAAilC,EAAAC,EAAAC,IADTxxB,EACS5T,EADT4T,CACS3T,EADT2T,CACSsxB,EADTtxB,CACSuxB,EADTvxB,CACSwxB,EADTxxB,CACSwxB,KADTxxB,CACSwxB,KADTxxB,CACSwxB,MAf9B,IAAArpD,EAAA,CAkBgCikB,EAAAC,EAAAilC,EAAAC,EAAAC,EAAAC,IADTzxB,EACS5T,EADT4T,CACS3T,EADT2T,CACSsxB,EADTtxB,CACSuxB,EADTvxB,CACSwxB,EADTxxB,CACSyxB,EADTzxB,CACSyxB,KADTzxB,CACSyxB,MAlBhC,IAAAtpD,EAAA,CAqBkCikB,EAAAC,EAAAilC,EAAAC,EAAAC,EAAAC,EAAAC,IADT1xB,EACS5T,EADT4T,CACS3T,EADT2T,CACSsxB,EADTtxB,CACSuxB,EADTvxB,CACSwxB,EADTxxB,CACSyxB,EADTzxB,CACS0xB,EADT1xB,CACS0xB,MArBlC,IAAAvpD,EAAA,CAwBoCikB,EAAAC,EAAAilC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,IADT3xB,EACS5T,EADT4T,CACS3T,EADT2T,CACSsxB,EADTtxB,CACSuxB,EADTvxB,CACSwxB,EADTxxB,CACSyxB,EADTzxB,CACS0xB,EADT1xB,CACS2xB,GAEtC,YAAU,kIAAV,CAA+H9jD,EAAMyvC,cAjCjJ,S,OAgDJ5U,EAAmH,YAAAkC,G,OAAnH,YAAU,sHAAV,CAAAlC,ICxEL,EDNkBkpB,GCKlB,CAA0B5C,EAAA6C,I,SCPjB7C,EAAS6C,G,OACjB,YAAQ,0BAAR,CAAqB7C,EAArB,CAA8B6C,GDML,CAAA7C,EAAA6C,GDLC9C,G,eALX+C,E,OALD,OACE,mBACN,OACM,GACE,iBACHA,EAAA,YAAS,uBAATppB,I,MAAAqpB,EAAA,EAAArpB,G,OAAAC,GAAA,EAAAA,M,mBACe,ICQlC,GDHI,uEAA8BipB,GAA9B,iCCGJ,C,oRDJqBA,GAAS7C,G,YCmBtBjwB,EAAWguB,G,OACbhuB,O,cAKF,aAAsB,YboDTjU,EauDWxe,K,SbhBdA,GAAI,EAAY,EAAOihB,IAAA,EAA0BjhB,KagBnC,CAAAA,IbtDX2lD,EatDiBC,GAAIC,UbuDrBnuC,EavD+B+oC,EAAM2B,IbwDrC0D,EaxDyC1qB,OAAA,KAAAA,GbgElD,gBAAS5c,EANL,YACI,OAAqB,EAAZmnC,EAAKjuC,IAATuJ,I,MAAA9lB,EAAA8lB,EACC,WAAA9lB,EAAA,KACY,EAAU2qD,EAAV,wBACX,iB,ca5DXjsD,EACF,uBAAAA,EAAA,I,CAKF,aAAsB,SAAtB,cAAiC,M,SLoBhB8gC,EAAiBorB,GAEtC,GAAG,YAA0BA,Q,OAIzBC,EAAa,GAA+BrrB,GAC5CspB,EAAO,UAAiD+B,gBAF7C,6BAGXC,EAAU,2BAAkChC,GAC5CiC,EAAW,uBAAmC,KAClDA,EAAA,MAAgB,gBAChBA,EAAA,KAAeD,EACfC,EAAA,SAAmBH,EACnBG,EAAA,IAAc,WACdA,EAAA,QAEAA,EAAA,SAEA,uBAA8C,oBAAkCD,IAAW,MKzCvF,qC,CACA,aAAsB,SADtB,yBACyC,M,eAR7C,mBAAmC,WAAW,K,IbuDjCznC,EACAmnC,EACAjuC,EACAouC,E,UaurBU7E,E,MAlCGkF,EA/rBR,aAiuBKlF,EAhuBJ,cA4tBoC,OA3tBzC,kCAxD6B,YA0yCU,cA73B4B,WAAY,qBAlX7B,wBA8VhB,O,IA7V3B,e,IACA,cAF2C,wBAtDlB,gBAqKc,GA6mBL,cAAgCA,OA5tBvB,wBAiIhB,O,UAyjBkC,e,SAxUW,+BAwUsBkF,O,eAlrB1GC,EAAOC,EAAmB/iC,G,MA6TV29B,EA5Tf,aACVmF,GAwWiF,WAAY,qBAlX7B,wBAiIhB,kBApKc,GA4WG,iBA7TzC,aA8pD+B,WA9pDnBC,OAZ4B,wBAiIhB,kBApKc,GAgXC,eAhUzC,aA6pDiC,WA7pD/B/iC,Y,OAbwC,wBAxBZ,sBACc,GA4VH,UAA4B29B,K,YApTjFR,EAAepB,G,IAsiBA4B,EANFA,EAgUGA,EA/TFkF,EA9GDlF,E,MA7OFA,EArMf,cAymDsE,S,gBAxmD1C,Y,CA+V+C,WAAY,sBAqMpEA,EAliBL,cAhFuB,YAg4CW,eAn9B2B,WAAY,sBA+LtEA,EAzhBK,cAnFe,YAg6CY,gBAn/B0B,WAAY,sBA+fnEA,EAt1BW,cAmwDmB,QAlwDrBR,EAAM2B,KAAN,CA+lDyC,S,gBA9lDjB,U,CAgyCG,cA/xCrB,gDAk8B4B,WAAiBkE,IAj8BrCjH,EAAV,SAi8BwE,mB,CAyHjC,aAzjCjCkH,IAAkB,UAATA,EAAG3qD,KAAgCyjD,EAAb,eAhCZ,wBAoWd,oBApWtC,aAy2H+B,OAAO,QAz2H/B,GAi3BmD,QAA0C4B,YAj3BhD,wBAoelB,gBA3Yc,GAwdL,UAA4BA,OAC3DkF,EA9gBI,aAgaLlF,EA/ZQ,YACX,yCAjGuB,YA6jCQ,YA39B/B,4BAAG,YAAAR,EAAA,OAAe,WADlB,aAjGuB,YAm1CW,eAjvClC,cACA,oCAFA,aA2dqC,YCljBhDmB,EDyFwCnB,EAAM2B,MCxFvD,YAA0BR,MDyFN,4BAHA,aAw9BoD,UAr9BlC3gC,IAAKo+B,EAAS,cAHhC,6BAooDmC,WAhoDzB,iB,IC3FrBuC,SDiDuD,wBAtDlB,gBAqKc,GAqVL,SAA2BX,OApclB,wBAoelB,K,UA8EgC,U,SAhMe,+BAgMakF,YAljB1C,wBAiIhB,kBApKc,GA0lBH,QAA0BlF,W,OAvjBrB,wBAiIhB,kBApKc,GA0PP,MAAwBA,K,IRpN1DK,GAAed,GFvCnC9sB,GACAotB,GACApjB,I,SA2II8iB,GAA+C,OAAQ,EAAGA,GYtJpE,EVgD0Bc,GUpDG,aZavB5tB,G,kBUGD,OACU,iDACG,WAGP,MVPLotB,GYlBT,CAA6BruB,EAAAguB,IAAA,GAAAhuB,EAAAguB,GZmBpB/iB,GYnBoB+iB,CAAaA,EAAApB,I,SFuGhCoB,EAAepB,G,IAiIO4B,EA8CCA,EA9CDA,EAtHIkF,EAsHJlF,E,MArEFA,EA3Df,cA9GoC,YA68Cc,kBAyOmB,S,gBAtkD1C,Y,CA6T+C,WAAY,sBA/LrEA,EA5HP,cAlH0B,YAqjDK,SArjDL,YA4rDW,gBA/wC2B,WAAY,sBAjJpEA,EAtKC,YACV,yCAvH2B,YAugCa,kBA/4BpC,iB,MAAAuF,EA7D4C,wBAkmBf,Q,gBA6iCkB,O,YA9kDrB,G,aACC,E,MACP,S,SAEN,MAEdC,EAAYtyB,GAvEgC,wBAoelB,K,oBA3ZU,G,SAySqC,qBAvSjEqyB,EA3EoC,wBAkmBf,Q,SAthBCryB,Q,OAhBlC,aAsTiE,WAAY,qBAlX7B,wBAiSjB,M,SAjNP,2DACpBsyB,EAAW,oDACXA,EAAW,qBACXA,EAAW,iCACXA,EAAW,uDApFiC,wBAiIhB,kBApKc,GAoQH,UAA4BxF,WAjOvB,wBAiIhB,kBApKc,GAsNJ,SAA2BA,OAA7DA,EA1FP,cApJ0B,YAqjDK,SArjDL,YA4rDW,gBA/wC2B,WAAY,qBArRjFyF,GAAajG,EAAMpB,QA7FiC,wBAiIhB,kBApKc,GAsNJ,SAA2B4B,OAtHzDkF,EAmCR,aAmFIlF,EAlFH,cA5JsB,YAqjDK,SArjDL,YA4rDW,gBA/wC2B,WAAY,+BA9QnE,YACV,iB,IAAMt+C,EAICgkD,E,OAJP,aAAMhkD,EAAA89C,EAAMmG,OAAN,UAGF,WAHE,cAICD,EACC,cALR,gBAhK2B,YAikCW,cA35BL,OAAO,6EAAaA,EAD9B,IAALA,EAAY,QAAa,eALrC,UAAN,gBAhK2B,YAmkCU,aA35BL,UARhC,cAGI,WAHJ,gCArGgD,wBA8VhB,O,uBA/OO,S,IAC1B,8CAhHmC,wBAiIhB,kBApKc,GAsNJ,SAA2B1F,OAnLrB,wBAiIhB,O,UApEoC,Y,SAqTS,+BArTqBkF,Y,OA7DlD,wBA+kBZ,sBAjmBc,GAgIN,OAAyBlF,KEnKnD,CAAAR,EAAApB,GVwDEmB,GFpCpC,MAAS9sB,GACEotB,GAGO7/B,GAAA,IAFTyc,IACQ+iB,OAAS/iB,GAAK+iB,MAEnBv6B,IAAA,c,cACKlmB,OE+BjB,GAAmCohD,EAAA1jB,EAAAh5B,EAAA26C,IAAA,EAAA+B,EAAA1jB,EAAAh5B,EAAA26C,GAAciC,GAAcd","file":"app.e7fee4ed139594e200e8.js","sourcesContent":[" \t// install a JSONP callback for chunk loading\n \tfunction webpackJsonpCallback(data) {\n \t\tvar chunkIds = data[0];\n \t\tvar moreModules = data[1];\n \t\tvar executeModules = data[2];\n\n \t\t// add \"moreModules\" to the modules object,\n \t\t// then flag all \"chunkIds\" as loaded and fire callback\n \t\tvar moduleId, chunkId, i = 0, resolves = [];\n \t\tfor(;i < chunkIds.length; i++) {\n \t\t\tchunkId = chunkIds[i];\n \t\t\tif(Object.prototype.hasOwnProperty.call(installedChunks, chunkId) && installedChunks[chunkId]) {\n \t\t\t\tresolves.push(installedChunks[chunkId][0]);\n \t\t\t}\n \t\t\tinstalledChunks[chunkId] = 0;\n \t\t}\n \t\tfor(moduleId in moreModules) {\n \t\t\tif(Object.prototype.hasOwnProperty.call(moreModules, moduleId)) {\n \t\t\t\tmodules[moduleId] = moreModules[moduleId];\n \t\t\t}\n \t\t}\n \t\tif(parentJsonpFunction) parentJsonpFunction(data);\n\n \t\twhile(resolves.length) {\n \t\t\tresolves.shift()();\n \t\t}\n\n \t\t// add entry modules from loaded chunk to deferred list\n \t\tdeferredModules.push.apply(deferredModules, executeModules || []);\n\n \t\t// run deferred modules when all chunks ready\n \t\treturn checkDeferredModules();\n \t};\n \tfunction checkDeferredModules() {\n \t\tvar result;\n \t\tfor(var i = 0; i < deferredModules.length; i++) {\n \t\t\tvar deferredModule = deferredModules[i];\n \t\t\tvar fulfilled = true;\n \t\t\tfor(var j = 1; j < deferredModule.length; j++) {\n \t\t\t\tvar depId = deferredModule[j];\n \t\t\t\tif(installedChunks[depId] !== 0) fulfilled = false;\n \t\t\t}\n \t\t\tif(fulfilled) {\n \t\t\t\tdeferredModules.splice(i--, 1);\n \t\t\t\tresult = __webpack_require__(__webpack_require__.s = deferredModule[0]);\n \t\t\t}\n \t\t}\n\n \t\treturn result;\n \t}\n\n \t// The module cache\n \tvar installedModules = {};\n\n \t// object to store loaded and loading chunks\n \t// undefined = chunk not loaded, null = chunk preloaded/prefetched\n \t// Promise = chunk loading, 0 = chunk loaded\n \tvar installedChunks = {\n \t\t0: 0\n \t};\n\n \tvar deferredModules = [];\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\n \t\t}\n \t};\n\n \t// define __esModule on exports\n \t__webpack_require__.r = function(exports) {\n \t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n \t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n \t\t}\n \t\tObject.defineProperty(exports, '__esModule', { value: true });\n \t};\n\n \t// create a fake namespace object\n \t// mode & 1: value is a module id, require it\n \t// mode & 2: merge all properties of value into the ns\n \t// mode & 4: return value when already ns object\n \t// mode & 8|1: behave like require\n \t__webpack_require__.t = function(value, mode) {\n \t\tif(mode & 1) value = __webpack_require__(value);\n \t\tif(mode & 8) return value;\n \t\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\n \t\tvar ns = Object.create(null);\n \t\t__webpack_require__.r(ns);\n \t\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\n \t\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\n \t\treturn ns;\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"\";\n\n \tvar jsonpArray = window[\"webpackJsonp\"] = window[\"webpackJsonp\"] || [];\n \tvar oldJsonpFunction = jsonpArray.push.bind(jsonpArray);\n \tjsonpArray.push = webpackJsonpCallback;\n \tjsonpArray = jsonpArray.slice();\n \tfor(var i = 0; i < jsonpArray.length; i++) webpackJsonpCallback(jsonpArray[i]);\n \tvar parentJsonpFunction = oldJsonpFunction;\n\n\n \t// add entry module to deferred list\n \tdeferredModules.push([44,1]);\n \t// run deferred modules when ready\n \treturn checkDeferredModules();\n","import { Record, Union } from \"./Types.js\";\nimport { combineHashCodes, equalArraysWith, stringHash } from \"./Util.js\";\nexport class CaseInfo {\n    constructor(declaringType, tag, name, fields) {\n        this.declaringType = declaringType;\n        this.tag = tag;\n        this.name = name;\n        this.fields = fields;\n    }\n}\nexport class TypeInfo {\n    constructor(fullname, generics, construct, parent, fields, cases, enumCases) {\n        this.fullname = fullname;\n        this.generics = generics;\n        this.construct = construct;\n        this.parent = parent;\n        this.fields = fields;\n        this.cases = cases;\n        this.enumCases = enumCases;\n    }\n    toString() {\n        return fullName(this);\n    }\n    GetHashCode() {\n        return getHashCode(this);\n    }\n    Equals(other) {\n        return equals(this, other);\n    }\n}\nexport function getGenerics(t) {\n    return t.generics != null ? t.generics : [];\n}\nexport function getHashCode(t) {\n    const fullnameHash = stringHash(t.fullname);\n    const genHashes = getGenerics(t).map(getHashCode);\n    return combineHashCodes([fullnameHash, ...genHashes]);\n}\nexport function equals(t1, t2) {\n    if (t1.fullname === \"\") { // Anonymous records\n        return t2.fullname === \"\"\n            && equalArraysWith(getRecordElements(t1), getRecordElements(t2), ([k1, v1], [k2, v2]) => k1 === k2 && equals(v1, v2));\n    }\n    else {\n        return t1.fullname === t2.fullname\n            && equalArraysWith(getGenerics(t1), getGenerics(t2), equals);\n    }\n}\nexport function class_type(fullname, generics, construct, parent) {\n    return new TypeInfo(fullname, generics, construct, parent);\n}\nexport function record_type(fullname, generics, construct, fields) {\n    return new TypeInfo(fullname, generics, construct, undefined, fields);\n}\nexport function anonRecord_type(...fields) {\n    return new TypeInfo(\"\", undefined, undefined, undefined, () => fields);\n}\nexport function union_type(fullname, generics, construct, cases) {\n    const t = new TypeInfo(fullname, generics, construct, undefined, undefined, () => {\n        const caseNames = construct.prototype.cases();\n        return cases().map((fields, i) => new CaseInfo(t, i, caseNames[i], fields));\n    });\n    return t;\n}\nexport function tuple_type(...generics) {\n    return new TypeInfo(\"System.Tuple`\" + generics.length, generics);\n}\nexport function delegate_type(...generics) {\n    return new TypeInfo(\"System.Func`\" + generics.length, generics);\n}\nexport function lambda_type(argType, returnType) {\n    return new TypeInfo(\"Microsoft.FSharp.Core.FSharpFunc`2\", [argType, returnType]);\n}\nexport function option_type(generic) {\n    return new TypeInfo(\"Microsoft.FSharp.Core.FSharpOption`1\", [generic]);\n}\nexport function list_type(generic) {\n    return new TypeInfo(\"Microsoft.FSharp.Collections.FSharpList`1\", [generic]);\n}\nexport function array_type(generic) {\n    return new TypeInfo(generic.fullname + \"[]\", [generic]);\n}\nexport function enum_type(fullname, underlyingType, enumCases) {\n    return new TypeInfo(fullname, [underlyingType], undefined, undefined, undefined, undefined, enumCases);\n}\nexport const obj_type = new TypeInfo(\"System.Object\");\nexport const unit_type = new TypeInfo(\"Microsoft.FSharp.Core.Unit\");\nexport const char_type = new TypeInfo(\"System.Char\");\nexport const string_type = new TypeInfo(\"System.String\");\nexport const bool_type = new TypeInfo(\"System.Boolean\");\nexport const int8_type = new TypeInfo(\"System.SByte\");\nexport const uint8_type = new TypeInfo(\"System.Byte\");\nexport const int16_type = new TypeInfo(\"System.Int16\");\nexport const uint16_type = new TypeInfo(\"System.UInt16\");\nexport const int32_type = new TypeInfo(\"System.Int32\");\nexport const uint32_type = new TypeInfo(\"System.UInt32\");\nexport const float32_type = new TypeInfo(\"System.Single\");\nexport const float64_type = new TypeInfo(\"System.Double\");\nexport const decimal_type = new TypeInfo(\"System.Decimal\");\nexport function name(info) {\n    if (Array.isArray(info)) {\n        return info[0];\n    }\n    else if (info instanceof CaseInfo) {\n        return info.name;\n    }\n    else {\n        const i = info.fullname.lastIndexOf(\".\");\n        return i === -1 ? info.fullname : info.fullname.substr(i + 1);\n    }\n}\nexport function fullName(t) {\n    const gen = t.generics != null && !isArray(t) ? t.generics : [];\n    if (gen.length > 0) {\n        return t.fullname + \"[\" + gen.map((x) => fullName(x)).join(\",\") + \"]\";\n    }\n    else {\n        return t.fullname;\n    }\n}\nexport function namespace(t) {\n    const i = t.fullname.lastIndexOf(\".\");\n    return i === -1 ? \"\" : t.fullname.substr(0, i);\n}\nexport function isArray(t) {\n    return t.fullname.endsWith(\"[]\");\n}\nexport function getElementType(t) {\n    var _a;\n    return isArray(t) ? (_a = t.generics) === null || _a === void 0 ? void 0 : _a[0] : undefined;\n}\nexport function isGenericType(t) {\n    return t.generics != null && t.generics.length > 0;\n}\nexport function isEnum(t) {\n    return t.enumCases != null && t.enumCases.length > 0;\n}\nexport function isSubclassOf(t1, t2) {\n    var _a, _b;\n    return (_b = (_a = t1.parent) === null || _a === void 0 ? void 0 : _a.Equals(t2)) !== null && _b !== void 0 ? _b : false;\n}\n/**\n * This doesn't replace types for fields (records) or cases (unions)\n * but it should be enough for type comparison purposes\n */\nexport function getGenericTypeDefinition(t) {\n    return t.generics == null ? t : new TypeInfo(t.fullname, t.generics.map(() => obj_type));\n}\nexport function getEnumUnderlyingType(t) {\n    var _a;\n    return (_a = t.generics) === null || _a === void 0 ? void 0 : _a[0];\n}\nexport function getEnumValues(t) {\n    if (isEnum(t) && t.enumCases != null) {\n        return t.enumCases.map((kv) => kv[1]);\n    }\n    else {\n        throw new Error(`${t.fullname} is not an enum type`);\n    }\n}\nexport function getEnumNames(t) {\n    if (isEnum(t) && t.enumCases != null) {\n        return t.enumCases.map((kv) => kv[0]);\n    }\n    else {\n        throw new Error(`${t.fullname} is not an enum type`);\n    }\n}\nfunction getEnumCase(t, v) {\n    if (t.enumCases != null) {\n        if (typeof v === \"string\") {\n            for (const kv of t.enumCases) {\n                if (kv[0] === v) {\n                    return kv;\n                }\n            }\n            throw new Error(`'${v}' was not found in ${t.fullname}`);\n        }\n        else {\n            for (const kv of t.enumCases) {\n                if (kv[1] === v) {\n                    return kv;\n                }\n            }\n            // .NET returns the number even if it doesn't match any of the cases\n            return [\"\", v];\n        }\n    }\n    else {\n        throw new Error(`${t.fullname} is not an enum type`);\n    }\n}\nexport function parseEnum(t, str) {\n    // TODO: better int parsing here, parseInt ceils floats: \"4.8\" -> 4\n    const value = parseInt(str, 10);\n    return getEnumCase(t, isNaN(value) ? str : value)[1];\n}\nexport function tryParseEnum(t, str, defValue) {\n    try {\n        defValue.contents = parseEnum(t, str);\n        return true;\n    }\n    catch (_a) {\n        return false;\n    }\n}\nexport function getEnumName(t, v) {\n    return getEnumCase(t, v)[0];\n}\nexport function isEnumDefined(t, v) {\n    try {\n        const kv = getEnumCase(t, v);\n        return kv[0] != null && kv[0] !== \"\";\n    }\n    catch (_a) {\n        // supress error\n    }\n    return false;\n}\n// FSharpType\nexport function getUnionCases(t) {\n    if (t.cases != null) {\n        return t.cases();\n    }\n    else {\n        throw new Error(`${t.fullname} is not an F# union type`);\n    }\n}\nexport function getRecordElements(t) {\n    if (t.fields != null) {\n        return t.fields();\n    }\n    else {\n        throw new Error(`${t.fullname} is not an F# record type`);\n    }\n}\nexport function getTupleElements(t) {\n    if (isTuple(t) && t.generics != null) {\n        return t.generics;\n    }\n    else {\n        throw new Error(`${t.fullname} is not a tuple type`);\n    }\n}\nexport function getFunctionElements(t) {\n    if (isFunction(t) && t.generics != null) {\n        const gen = t.generics;\n        return [gen[0], gen[1]];\n    }\n    else {\n        throw new Error(`${t.fullname} is not an F# function type`);\n    }\n}\nexport function isUnion(t) {\n    return t instanceof TypeInfo ? t.cases != null : t instanceof Union;\n}\nexport function isRecord(t) {\n    return t instanceof TypeInfo ? t.fields != null : t instanceof Record;\n}\nexport function isTuple(t) {\n    return t.fullname.startsWith(\"System.Tuple\") && !isArray(t);\n}\n// In .NET this is false for delegates\nexport function isFunction(t) {\n    return t.fullname === \"Microsoft.FSharp.Core.FSharpFunc`2\";\n}\n// FSharpValue\nexport function getUnionFields(v, t) {\n    const cases = getUnionCases(t);\n    const case_ = cases[v.tag];\n    if (case_ == null) {\n        throw new Error(`Cannot find case ${v.name} in union type`);\n    }\n    return [case_, v.fields];\n}\nexport function getUnionCaseFields(uci) {\n    return uci.fields == null ? [] : uci.fields;\n}\n// This is used as replacement of `FSharpValue.GetRecordFields`\n// For `FSharpTypes.GetRecordFields` see `getRecordElements`\n// Object.keys returns keys in the order they were added to the object\nexport function getRecordFields(v) {\n    return Object.keys(v).map((k) => v[k]);\n}\nexport function getRecordField(v, field) {\n    return v[field[0]];\n}\nexport function getTupleFields(v) {\n    return v;\n}\nexport function getTupleField(v, i) {\n    return v[i];\n}\nexport function makeUnion(uci, values) {\n    const expectedLength = (uci.fields || []).length;\n    if (values.length !== expectedLength) {\n        throw new Error(`Expected an array of length ${expectedLength} but got ${values.length}`);\n    }\n    return uci.declaringType.construct != null\n        ? new uci.declaringType.construct(uci.tag, ...values)\n        : {};\n}\nexport function makeRecord(t, values) {\n    const fields = getRecordElements(t);\n    if (fields.length !== values.length) {\n        throw new Error(`Expected an array of length ${fields.length} but got ${values.length}`);\n    }\n    return t.construct != null\n        ? new t.construct(...values)\n        : fields.reduce((obj, [key, _t], i) => {\n            obj[key] = values[i];\n            return obj;\n        }, {});\n}\nexport function makeTuple(values, _t) {\n    return values;\n}\nexport function makeGenericType(t, generics) {\n    return new TypeInfo(t.fullname, generics, t.construct, t.parent, t.fields, t.cases);\n}\nexport function createInstance(t, consArgs) {\n    // TODO: Check if consArgs length is same as t.construct?\n    // (Arg types can still be different)\n    if (typeof t.construct === \"function\") {\n        return new t.construct(...(consArgs !== null && consArgs !== void 0 ? consArgs : []));\n    }\n    else {\n        throw new Error(`Cannot access constructor of ${t.fullname}`);\n    }\n}\nexport function getValue(propertyInfo, v) {\n    return v[propertyInfo[0]];\n}\n// Fable.Core.Reflection\nfunction assertUnion(x) {\n    if (!(x instanceof Union)) {\n        throw new Error(`Value is not an F# union type`);\n    }\n}\nexport function getCaseTag(x) {\n    assertUnion(x);\n    return x.tag;\n}\nexport function getCaseName(x) {\n    assertUnion(x);\n    return x.cases()[x.tag];\n}\nexport function getCaseFields(x) {\n    assertUnion(x);\n    return x.fields;\n}\n","import { join } from \"./String.js\";\r\nimport { uncurry, isArrayLike, getEnumerator, toIterator, compare, structuralHash, equals } from \"./Util.js\";\r\nimport { Record } from \"./Types.js\";\r\nimport { class_type, record_type, option_type } from \"./Reflection.js\";\r\nimport { defaultArg, value as value_1, some } from \"./Option.js\";\r\nimport { transpose as transpose_1, splitInto as splitInto_1, windowed as windowed_1, pairwise as pairwise_1, chunkBySize as chunkBySize_1, map as map_1, permute as permute_1, tryFindIndexBack as tryFindIndexBack_1, tryFindBack as tryFindBack_1, scanBack as scanBack_1, foldBack2 as foldBack2_1, foldBack as foldBack_1, fill } from \"./Array.js\";\r\n\r\nexport const SR_indexOutOfBounds = \"The index was outside the range of elements in the list.\";\r\n\r\nexport const SR_inputListWasEmpty = \"List was empty\";\r\n\r\nexport const SR_inputMustBeNonNegative = \"The input must be non-negative.\";\r\n\r\nexport const SR_inputSequenceEmpty = \"The input sequence was empty.\";\r\n\r\nexport const SR_inputSequenceTooLong = \"The input sequence contains more than one element.\";\r\n\r\nexport const SR_keyNotFoundAlt = \"An index satisfying the predicate was not found in the collection.\";\r\n\r\nexport const SR_listsHadDifferentLengths = \"The lists had different lengths.\";\r\n\r\nexport const SR_notEnoughElements = \"The input sequence has an insufficient number of elements.\";\r\n\r\nexport class FSharpList extends Record {\r\n    constructor(head, tail) {\r\n        super();\r\n        this.head = head;\r\n        this.tail = tail;\r\n    }\r\n    toString() {\r\n        const xs = this;\r\n        return (\"[\" + join(\"; \", xs)) + \"]\";\r\n    }\r\n    Equals(other) {\r\n        const xs = this;\r\n        if (xs === other) {\r\n            return true;\r\n        }\r\n        else {\r\n            const loop = (xs_1_mut, ys_1_mut) => {\r\n                loop:\r\n                while (true) {\r\n                    const xs_1 = xs_1_mut, ys_1 = ys_1_mut;\r\n                    const matchValue = [xs_1.tail, ys_1.tail];\r\n                    if (matchValue[0] != null) {\r\n                        if (matchValue[1] != null) {\r\n                            const xt = matchValue[0];\r\n                            const yt = matchValue[1];\r\n                            if (equals(xs_1.head, ys_1.head)) {\r\n                                xs_1_mut = xt;\r\n                                ys_1_mut = yt;\r\n                                continue loop;\r\n                            }\r\n                            else {\r\n                                return false;\r\n                            }\r\n                        }\r\n                        else {\r\n                            return false;\r\n                        }\r\n                    }\r\n                    else if (matchValue[1] != null) {\r\n                        return false;\r\n                    }\r\n                    else {\r\n                        return true;\r\n                    }\r\n                    break;\r\n                }\r\n            };\r\n            return loop(xs, other);\r\n        }\r\n    }\r\n    GetHashCode() {\r\n        const xs = this;\r\n        const loop = (i_mut, h_mut, xs_1_mut) => {\r\n            loop:\r\n            while (true) {\r\n                const i = i_mut, h = h_mut, xs_1 = xs_1_mut;\r\n                const matchValue = xs_1.tail;\r\n                if (matchValue != null) {\r\n                    const t = matchValue;\r\n                    if (i > 18) {\r\n                        return h | 0;\r\n                    }\r\n                    else {\r\n                        i_mut = (i + 1);\r\n                        h_mut = (((h << 1) + structuralHash(xs_1.head)) + (631 * i));\r\n                        xs_1_mut = t;\r\n                        continue loop;\r\n                    }\r\n                }\r\n                else {\r\n                    return h | 0;\r\n                }\r\n                break;\r\n            }\r\n        };\r\n        return loop(0, 0, xs) | 0;\r\n    }\r\n    toJSON(_key) {\r\n        const this$ = this;\r\n        return Array.from(this$);\r\n    }\r\n    CompareTo(other) {\r\n        const xs = this;\r\n        const loop = (xs_1_mut, ys_1_mut) => {\r\n            loop:\r\n            while (true) {\r\n                const xs_1 = xs_1_mut, ys_1 = ys_1_mut;\r\n                const matchValue = [xs_1.tail, ys_1.tail];\r\n                if (matchValue[0] != null) {\r\n                    if (matchValue[1] != null) {\r\n                        const xt = matchValue[0];\r\n                        const yt = matchValue[1];\r\n                        const c = compare(xs_1.head, ys_1.head) | 0;\r\n                        if (c === 0) {\r\n                            xs_1_mut = xt;\r\n                            ys_1_mut = yt;\r\n                            continue loop;\r\n                        }\r\n                        else {\r\n                            return c | 0;\r\n                        }\r\n                    }\r\n                    else {\r\n                        return 1;\r\n                    }\r\n                }\r\n                else if (matchValue[1] != null) {\r\n                    return -1;\r\n                }\r\n                else {\r\n                    return 0;\r\n                }\r\n                break;\r\n            }\r\n        };\r\n        return loop(xs, other) | 0;\r\n    }\r\n    GetEnumerator() {\r\n        const xs = this;\r\n        return ListEnumerator$1_$ctor_3002E699(xs);\r\n    }\r\n    [Symbol.iterator]() {\r\n        return toIterator(this.GetEnumerator());\r\n    }\r\n    [\"System.Collections.IEnumerable.GetEnumerator\"]() {\r\n        const xs = this;\r\n        return getEnumerator(xs);\r\n    }\r\n}\r\n\r\nexport function FSharpList$reflection(gen0) {\r\n    return record_type(\"ListModule.FSharpList\", [gen0], FSharpList, () => [[\"head\", gen0], [\"tail\", option_type(FSharpList$reflection(gen0))]]);\r\n}\r\n\r\nexport class ListEnumerator$1 {\r\n    constructor(xs) {\r\n        this.xs = xs;\r\n        this.it = this.xs;\r\n        this.current = null;\r\n    }\r\n    [\"System.Collections.Generic.IEnumerator`1.get_Current\"]() {\r\n        const __ = this;\r\n        return __.current;\r\n    }\r\n    [\"System.Collections.IEnumerator.get_Current\"]() {\r\n        const __ = this;\r\n        return __.current;\r\n    }\r\n    [\"System.Collections.IEnumerator.MoveNext\"]() {\r\n        const __ = this;\r\n        const matchValue = __.it.tail;\r\n        if (matchValue != null) {\r\n            const t = matchValue;\r\n            __.current = __.it.head;\r\n            __.it = t;\r\n            return true;\r\n        }\r\n        else {\r\n            return false;\r\n        }\r\n    }\r\n    [\"System.Collections.IEnumerator.Reset\"]() {\r\n        const __ = this;\r\n        __.it = __.xs;\r\n        __.current = null;\r\n    }\r\n    Dispose() {\r\n    }\r\n}\r\n\r\nexport function ListEnumerator$1$reflection(gen0) {\r\n    return class_type(\"ListModule.ListEnumerator`1\", [gen0], ListEnumerator$1);\r\n}\r\n\r\nexport function ListEnumerator$1_$ctor_3002E699(xs) {\r\n    return new ListEnumerator$1(xs);\r\n}\r\n\r\nexport function FSharpList_get_Empty() {\r\n    return new FSharpList(null, void 0);\r\n}\r\n\r\nexport function FSharpList_Cons_305B8EAC(x, xs) {\r\n    return new FSharpList(x, xs);\r\n}\r\n\r\nexport function FSharpList__get_IsEmpty(xs) {\r\n    return xs.tail == null;\r\n}\r\n\r\nexport function FSharpList__get_Length(xs) {\r\n    const loop = (i_mut, xs_1_mut) => {\r\n        loop:\r\n        while (true) {\r\n            const i = i_mut, xs_1 = xs_1_mut;\r\n            const matchValue = xs_1.tail;\r\n            if (matchValue != null) {\r\n                i_mut = (i + 1);\r\n                xs_1_mut = matchValue;\r\n                continue loop;\r\n            }\r\n            else {\r\n                return i | 0;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    return loop(0, xs) | 0;\r\n}\r\n\r\nexport function FSharpList__get_Head(xs) {\r\n    const matchValue = xs.tail;\r\n    if (matchValue != null) {\r\n        return xs.head;\r\n    }\r\n    else {\r\n        throw (new Error((SR_inputListWasEmpty + \"\\\\nParameter name: \") + \"list\"));\r\n    }\r\n}\r\n\r\nexport function FSharpList__get_Tail(xs) {\r\n    const matchValue = xs.tail;\r\n    if (matchValue != null) {\r\n        return matchValue;\r\n    }\r\n    else {\r\n        throw (new Error((SR_inputListWasEmpty + \"\\\\nParameter name: \") + \"list\"));\r\n    }\r\n}\r\n\r\nexport function FSharpList__get_Item_Z524259A4(xs, index) {\r\n    const loop = (i_mut, xs_1_mut) => {\r\n        loop:\r\n        while (true) {\r\n            const i = i_mut, xs_1 = xs_1_mut;\r\n            const matchValue = xs_1.tail;\r\n            if (matchValue != null) {\r\n                if (i === index) {\r\n                    return xs_1.head;\r\n                }\r\n                else {\r\n                    i_mut = (i + 1);\r\n                    xs_1_mut = matchValue;\r\n                    continue loop;\r\n                }\r\n            }\r\n            else {\r\n                throw (new Error((SR_indexOutOfBounds + \"\\\\nParameter name: \") + \"index\"));\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    return loop(0, xs);\r\n}\r\n\r\nexport function empty() {\r\n    return FSharpList_get_Empty();\r\n}\r\n\r\nexport function cons(x, xs) {\r\n    return FSharpList_Cons_305B8EAC(x, xs);\r\n}\r\n\r\nexport function singleton(x) {\r\n    return FSharpList_Cons_305B8EAC(x, FSharpList_get_Empty());\r\n}\r\n\r\nexport function isEmpty(xs) {\r\n    return FSharpList__get_IsEmpty(xs);\r\n}\r\n\r\nexport function length(xs) {\r\n    return FSharpList__get_Length(xs);\r\n}\r\n\r\nexport function head(xs) {\r\n    return FSharpList__get_Head(xs);\r\n}\r\n\r\nexport function tryHead(xs) {\r\n    if (FSharpList__get_IsEmpty(xs)) {\r\n        return void 0;\r\n    }\r\n    else {\r\n        return some(FSharpList__get_Head(xs));\r\n    }\r\n}\r\n\r\nexport function tail(xs) {\r\n    return FSharpList__get_Tail(xs);\r\n}\r\n\r\nexport function tryLast(xs_mut) {\r\n    tryLast:\r\n    while (true) {\r\n        const xs = xs_mut;\r\n        if (FSharpList__get_IsEmpty(xs)) {\r\n            return void 0;\r\n        }\r\n        else {\r\n            const t = FSharpList__get_Tail(xs);\r\n            if (FSharpList__get_IsEmpty(t)) {\r\n                return some(FSharpList__get_Head(xs));\r\n            }\r\n            else {\r\n                xs_mut = t;\r\n                continue tryLast;\r\n            }\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function last(xs) {\r\n    const matchValue = tryLast(xs);\r\n    if (matchValue == null) {\r\n        throw (new Error(SR_inputListWasEmpty));\r\n    }\r\n    else {\r\n        return value_1(matchValue);\r\n    }\r\n}\r\n\r\nexport function compareWith(comparer, xs, ys) {\r\n    const loop = (xs_1_mut, ys_1_mut) => {\r\n        loop:\r\n        while (true) {\r\n            const xs_1 = xs_1_mut, ys_1 = ys_1_mut;\r\n            const matchValue = [FSharpList__get_IsEmpty(xs_1), FSharpList__get_IsEmpty(ys_1)];\r\n            if (matchValue[0]) {\r\n                if (matchValue[1]) {\r\n                    return 0;\r\n                }\r\n                else {\r\n                    return -1;\r\n                }\r\n            }\r\n            else if (matchValue[1]) {\r\n                return 1;\r\n            }\r\n            else {\r\n                const c = comparer(FSharpList__get_Head(xs_1), FSharpList__get_Head(ys_1)) | 0;\r\n                if (c === 0) {\r\n                    xs_1_mut = FSharpList__get_Tail(xs_1);\r\n                    ys_1_mut = FSharpList__get_Tail(ys_1);\r\n                    continue loop;\r\n                }\r\n                else {\r\n                    return c | 0;\r\n                }\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    return loop(xs, ys) | 0;\r\n}\r\n\r\nexport function toArray(xs) {\r\n    const len = FSharpList__get_Length(xs) | 0;\r\n    const res = fill(new Array(len), 0, len, null);\r\n    const loop = (i_mut, xs_1_mut) => {\r\n        loop:\r\n        while (true) {\r\n            const i = i_mut, xs_1 = xs_1_mut;\r\n            if (!FSharpList__get_IsEmpty(xs_1)) {\r\n                res[i] = FSharpList__get_Head(xs_1);\r\n                i_mut = (i + 1);\r\n                xs_1_mut = FSharpList__get_Tail(xs_1);\r\n                continue loop;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    loop(0, xs);\r\n    return res;\r\n}\r\n\r\nexport function fold(folder, state, xs) {\r\n    let acc = state;\r\n    let xs_1 = xs;\r\n    while (!FSharpList__get_IsEmpty(xs_1)) {\r\n        acc = folder(acc, FSharpList__get_Head(xs_1));\r\n        xs_1 = FSharpList__get_Tail(xs_1);\r\n    }\r\n    return acc;\r\n}\r\n\r\nexport function reverse(xs) {\r\n    return fold((acc, x) => FSharpList_Cons_305B8EAC(x, acc), FSharpList_get_Empty(), xs);\r\n}\r\n\r\nexport function foldBack(folder, xs, state) {\r\n    return foldBack_1(folder, toArray(xs), state);\r\n}\r\n\r\nexport function foldIndexed(folder, state, xs) {\r\n    const loop = (i_mut, acc_mut, xs_1_mut) => {\r\n        loop:\r\n        while (true) {\r\n            const i = i_mut, acc = acc_mut, xs_1 = xs_1_mut;\r\n            if (FSharpList__get_IsEmpty(xs_1)) {\r\n                return acc;\r\n            }\r\n            else {\r\n                i_mut = (i + 1);\r\n                acc_mut = folder(i, acc, FSharpList__get_Head(xs_1));\r\n                xs_1_mut = FSharpList__get_Tail(xs_1);\r\n                continue loop;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    return loop(0, state, xs);\r\n}\r\n\r\nexport function fold2(folder, state, xs, ys) {\r\n    let acc = state;\r\n    let xs_1 = xs;\r\n    let ys_1 = ys;\r\n    while ((!FSharpList__get_IsEmpty(xs_1)) ? (!FSharpList__get_IsEmpty(ys_1)) : false) {\r\n        acc = folder(acc, FSharpList__get_Head(xs_1), FSharpList__get_Head(ys_1));\r\n        xs_1 = FSharpList__get_Tail(xs_1);\r\n        ys_1 = FSharpList__get_Tail(ys_1);\r\n    }\r\n    return acc;\r\n}\r\n\r\nexport function foldBack2(folder, xs, ys, state) {\r\n    return foldBack2_1(folder, toArray(xs), toArray(ys), state);\r\n}\r\n\r\nexport function unfold(gen, state) {\r\n    const loop = (acc_mut, node_mut) => {\r\n        let t;\r\n        loop:\r\n        while (true) {\r\n            const acc = acc_mut, node = node_mut;\r\n            const matchValue = gen(acc);\r\n            if (matchValue != null) {\r\n                acc_mut = matchValue[1];\r\n                node_mut = ((t = (new FSharpList(matchValue[0], void 0)), (node.tail = t, t)));\r\n                continue loop;\r\n            }\r\n            else {\r\n                return node;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    const root = FSharpList_get_Empty();\r\n    const node_1 = loop(state, root);\r\n    const t_2 = FSharpList_get_Empty();\r\n    node_1.tail = t_2;\r\n    return FSharpList__get_Tail(root);\r\n}\r\n\r\nexport function iterate(action, xs) {\r\n    fold((unitVar0, x) => {\r\n        action(x);\r\n    }, void 0, xs);\r\n}\r\n\r\nexport function iterate2(action, xs, ys) {\r\n    fold2((unitVar0, x, y) => {\r\n        action(x, y);\r\n    }, void 0, xs, ys);\r\n}\r\n\r\nexport function iterateIndexed(action, xs) {\r\n    void fold((i, x) => {\r\n        action(i, x);\r\n        return (i + 1) | 0;\r\n    }, 0, xs);\r\n}\r\n\r\nexport function iterateIndexed2(action, xs, ys) {\r\n    void fold2((i, x, y) => {\r\n        action(i, x, y);\r\n        return (i + 1) | 0;\r\n    }, 0, xs, ys);\r\n}\r\n\r\nexport function toSeq(xs) {\r\n    return xs;\r\n}\r\n\r\nexport function ofArrayWithTail(xs, tail_1) {\r\n    let res = tail_1;\r\n    for (let i = xs.length - 1; i >= 0; i--) {\r\n        res = FSharpList_Cons_305B8EAC(xs[i], res);\r\n    }\r\n    return res;\r\n}\r\n\r\nexport function ofArray(xs) {\r\n    return ofArrayWithTail(xs, FSharpList_get_Empty());\r\n}\r\n\r\nexport function ofSeq(xs) {\r\n    let xs_3, t;\r\n    if (isArrayLike(xs)) {\r\n        return ofArray(xs);\r\n    }\r\n    else if (xs instanceof FSharpList) {\r\n        return xs;\r\n    }\r\n    else {\r\n        const root = FSharpList_get_Empty();\r\n        let node = root;\r\n        const enumerator = getEnumerator(xs);\r\n        try {\r\n            while (enumerator[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n                const x = enumerator[\"System.Collections.Generic.IEnumerator`1.get_Current\"]();\r\n                node = ((xs_3 = node, (t = (new FSharpList(x, void 0)), (xs_3.tail = t, t))));\r\n            }\r\n        }\r\n        finally {\r\n            enumerator.Dispose();\r\n        }\r\n        const xs_5 = node;\r\n        const t_2 = FSharpList_get_Empty();\r\n        xs_5.tail = t_2;\r\n        return FSharpList__get_Tail(root);\r\n    }\r\n}\r\n\r\nexport function concat(lists) {\r\n    const root = FSharpList_get_Empty();\r\n    let node = root;\r\n    const action = (xs) => {\r\n        node = fold((acc, x) => {\r\n            const t = new FSharpList(x, void 0);\r\n            acc.tail = t;\r\n            return t;\r\n        }, node, xs);\r\n    };\r\n    if (isArrayLike(lists)) {\r\n        lists.forEach(action);\r\n    }\r\n    else if (lists instanceof FSharpList) {\r\n        iterate(action, lists);\r\n    }\r\n    else {\r\n        const enumerator = getEnumerator(lists);\r\n        try {\r\n            while (enumerator[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n                action(enumerator[\"System.Collections.Generic.IEnumerator`1.get_Current\"]());\r\n            }\r\n        }\r\n        finally {\r\n            enumerator.Dispose();\r\n        }\r\n    }\r\n    const xs_6 = node;\r\n    const t_2 = FSharpList_get_Empty();\r\n    xs_6.tail = t_2;\r\n    return FSharpList__get_Tail(root);\r\n}\r\n\r\nexport function scan(folder, state, xs) {\r\n    let xs_4, t_2;\r\n    const root = FSharpList_get_Empty();\r\n    let node;\r\n    const t = new FSharpList(state, void 0);\r\n    root.tail = t;\r\n    node = t;\r\n    let acc = state;\r\n    let xs_3 = xs;\r\n    while (!FSharpList__get_IsEmpty(xs_3)) {\r\n        acc = folder(acc, FSharpList__get_Head(xs_3));\r\n        node = ((xs_4 = node, (t_2 = (new FSharpList(acc, void 0)), (xs_4.tail = t_2, t_2))));\r\n        xs_3 = FSharpList__get_Tail(xs_3);\r\n    }\r\n    const xs_6 = node;\r\n    const t_4 = FSharpList_get_Empty();\r\n    xs_6.tail = t_4;\r\n    return FSharpList__get_Tail(root);\r\n}\r\n\r\nexport function scanBack(folder, xs, state) {\r\n    return ofArray(scanBack_1(folder, toArray(xs), state));\r\n}\r\n\r\nexport function append(xs, ys) {\r\n    return fold((acc, x) => FSharpList_Cons_305B8EAC(x, acc), ys, reverse(xs));\r\n}\r\n\r\nexport function collect(mapping, xs) {\r\n    let xs_1, t;\r\n    const root = FSharpList_get_Empty();\r\n    let node = root;\r\n    let ys = xs;\r\n    while (!FSharpList__get_IsEmpty(ys)) {\r\n        let zs = mapping(FSharpList__get_Head(ys));\r\n        while (!FSharpList__get_IsEmpty(zs)) {\r\n            node = ((xs_1 = node, (t = (new FSharpList(FSharpList__get_Head(zs), void 0)), (xs_1.tail = t, t))));\r\n            zs = FSharpList__get_Tail(zs);\r\n        }\r\n        ys = FSharpList__get_Tail(ys);\r\n    }\r\n    const xs_3 = node;\r\n    const t_2 = FSharpList_get_Empty();\r\n    xs_3.tail = t_2;\r\n    return FSharpList__get_Tail(root);\r\n}\r\n\r\nexport function mapIndexed(mapping, xs) {\r\n    const root = FSharpList_get_Empty();\r\n    const node = foldIndexed((i, acc, x) => {\r\n        const t = new FSharpList(mapping(i, x), void 0);\r\n        acc.tail = t;\r\n        return t;\r\n    }, root, xs);\r\n    const t_2 = FSharpList_get_Empty();\r\n    node.tail = t_2;\r\n    return FSharpList__get_Tail(root);\r\n}\r\n\r\nexport function map(mapping, xs) {\r\n    const root = FSharpList_get_Empty();\r\n    const node = fold((acc, x) => {\r\n        const t = new FSharpList(mapping(x), void 0);\r\n        acc.tail = t;\r\n        return t;\r\n    }, root, xs);\r\n    const t_2 = FSharpList_get_Empty();\r\n    node.tail = t_2;\r\n    return FSharpList__get_Tail(root);\r\n}\r\n\r\nexport function indexed(xs) {\r\n    return mapIndexed((i, x) => [i, x], xs);\r\n}\r\n\r\nexport function map2(mapping, xs, ys) {\r\n    const root = FSharpList_get_Empty();\r\n    const node = fold2((acc, x, y) => {\r\n        const t = new FSharpList(mapping(x, y), void 0);\r\n        acc.tail = t;\r\n        return t;\r\n    }, root, xs, ys);\r\n    const t_2 = FSharpList_get_Empty();\r\n    node.tail = t_2;\r\n    return FSharpList__get_Tail(root);\r\n}\r\n\r\nexport function mapIndexed2(mapping, xs, ys) {\r\n    const loop = (i_mut, acc_mut, xs_1_mut, ys_1_mut) => {\r\n        let t;\r\n        loop:\r\n        while (true) {\r\n            const i = i_mut, acc = acc_mut, xs_1 = xs_1_mut, ys_1 = ys_1_mut;\r\n            if (FSharpList__get_IsEmpty(xs_1) ? true : FSharpList__get_IsEmpty(ys_1)) {\r\n                return acc;\r\n            }\r\n            else {\r\n                i_mut = (i + 1);\r\n                acc_mut = ((t = (new FSharpList(mapping(i, FSharpList__get_Head(xs_1), FSharpList__get_Head(ys_1)), void 0)), (acc.tail = t, t)));\r\n                xs_1_mut = FSharpList__get_Tail(xs_1);\r\n                ys_1_mut = FSharpList__get_Tail(ys_1);\r\n                continue loop;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    const root = FSharpList_get_Empty();\r\n    const node_1 = loop(0, root, xs, ys);\r\n    const t_2 = FSharpList_get_Empty();\r\n    node_1.tail = t_2;\r\n    return FSharpList__get_Tail(root);\r\n}\r\n\r\nexport function map3(mapping, xs, ys, zs) {\r\n    const loop = (acc_mut, xs_1_mut, ys_1_mut, zs_1_mut) => {\r\n        let t;\r\n        loop:\r\n        while (true) {\r\n            const acc = acc_mut, xs_1 = xs_1_mut, ys_1 = ys_1_mut, zs_1 = zs_1_mut;\r\n            if ((FSharpList__get_IsEmpty(xs_1) ? true : FSharpList__get_IsEmpty(ys_1)) ? true : FSharpList__get_IsEmpty(zs_1)) {\r\n                return acc;\r\n            }\r\n            else {\r\n                acc_mut = ((t = (new FSharpList(mapping(FSharpList__get_Head(xs_1), FSharpList__get_Head(ys_1), FSharpList__get_Head(zs_1)), void 0)), (acc.tail = t, t)));\r\n                xs_1_mut = FSharpList__get_Tail(xs_1);\r\n                ys_1_mut = FSharpList__get_Tail(ys_1);\r\n                zs_1_mut = FSharpList__get_Tail(zs_1);\r\n                continue loop;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    const root = FSharpList_get_Empty();\r\n    const node_1 = loop(root, xs, ys, zs);\r\n    const t_2 = FSharpList_get_Empty();\r\n    node_1.tail = t_2;\r\n    return FSharpList__get_Tail(root);\r\n}\r\n\r\nexport function mapFold(mapping, state, xs) {\r\n    const root = FSharpList_get_Empty();\r\n    const patternInput_1 = fold((tupledArg, x) => {\r\n        let t;\r\n        const patternInput = mapping(tupledArg[1], x);\r\n        return [(t = (new FSharpList(patternInput[0], void 0)), (tupledArg[0].tail = t, t)), patternInput[1]];\r\n    }, [root, state], xs);\r\n    const t_2 = FSharpList_get_Empty();\r\n    patternInput_1[0].tail = t_2;\r\n    return [FSharpList__get_Tail(root), patternInput_1[1]];\r\n}\r\n\r\nexport function mapFoldBack(mapping, xs, state) {\r\n    return mapFold((acc, x) => mapping(x, acc), state, reverse(xs));\r\n}\r\n\r\nexport function tryPick(f, xs) {\r\n    const loop = (xs_1_mut) => {\r\n        loop:\r\n        while (true) {\r\n            const xs_1 = xs_1_mut;\r\n            if (FSharpList__get_IsEmpty(xs_1)) {\r\n                return void 0;\r\n            }\r\n            else {\r\n                const matchValue = f(FSharpList__get_Head(xs_1));\r\n                if (matchValue == null) {\r\n                    xs_1_mut = FSharpList__get_Tail(xs_1);\r\n                    continue loop;\r\n                }\r\n                else {\r\n                    return matchValue;\r\n                }\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    return loop(xs);\r\n}\r\n\r\nexport function pick(f, xs) {\r\n    const matchValue = tryPick(f, xs);\r\n    if (matchValue == null) {\r\n        throw (new Error(SR_keyNotFoundAlt));\r\n    }\r\n    else {\r\n        return value_1(matchValue);\r\n    }\r\n}\r\n\r\nexport function tryFind(f, xs) {\r\n    return tryPick((x) => (f(x) ? some(x) : (void 0)), xs);\r\n}\r\n\r\nexport function find(f, xs) {\r\n    const matchValue = tryFind(f, xs);\r\n    if (matchValue == null) {\r\n        throw (new Error(SR_keyNotFoundAlt));\r\n    }\r\n    else {\r\n        return value_1(matchValue);\r\n    }\r\n}\r\n\r\nexport function tryFindBack(f, xs) {\r\n    return tryFindBack_1(f, toArray(xs));\r\n}\r\n\r\nexport function findBack(f, xs) {\r\n    const matchValue = tryFindBack(f, xs);\r\n    if (matchValue == null) {\r\n        throw (new Error(SR_keyNotFoundAlt));\r\n    }\r\n    else {\r\n        return value_1(matchValue);\r\n    }\r\n}\r\n\r\nexport function tryFindIndex(f, xs) {\r\n    const loop = (i_mut, xs_1_mut) => {\r\n        loop:\r\n        while (true) {\r\n            const i = i_mut, xs_1 = xs_1_mut;\r\n            if (FSharpList__get_IsEmpty(xs_1)) {\r\n                return void 0;\r\n            }\r\n            else if (f(FSharpList__get_Head(xs_1))) {\r\n                return i;\r\n            }\r\n            else {\r\n                i_mut = (i + 1);\r\n                xs_1_mut = FSharpList__get_Tail(xs_1);\r\n                continue loop;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    return loop(0, xs);\r\n}\r\n\r\nexport function findIndex(f, xs) {\r\n    const matchValue = tryFindIndex(f, xs);\r\n    if (matchValue == null) {\r\n        throw (new Error(SR_keyNotFoundAlt));\r\n    }\r\n    else {\r\n        return matchValue | 0;\r\n    }\r\n}\r\n\r\nexport function tryFindIndexBack(f, xs) {\r\n    return tryFindIndexBack_1(f, toArray(xs));\r\n}\r\n\r\nexport function findIndexBack(f, xs) {\r\n    const matchValue = tryFindIndexBack(f, xs);\r\n    if (matchValue == null) {\r\n        throw (new Error(SR_keyNotFoundAlt));\r\n    }\r\n    else {\r\n        return matchValue | 0;\r\n    }\r\n}\r\n\r\nexport function tryItem(n, xs) {\r\n    const loop = (i_mut, xs_1_mut) => {\r\n        loop:\r\n        while (true) {\r\n            const i = i_mut, xs_1 = xs_1_mut;\r\n            if (FSharpList__get_IsEmpty(xs_1)) {\r\n                return void 0;\r\n            }\r\n            else if (i === n) {\r\n                return some(FSharpList__get_Head(xs_1));\r\n            }\r\n            else {\r\n                i_mut = (i + 1);\r\n                xs_1_mut = FSharpList__get_Tail(xs_1);\r\n                continue loop;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    return loop(0, xs);\r\n}\r\n\r\nexport function item(n, xs) {\r\n    return FSharpList__get_Item_Z524259A4(xs, n);\r\n}\r\n\r\nexport function filter(f, xs) {\r\n    const root = FSharpList_get_Empty();\r\n    const node = fold((acc, x) => {\r\n        if (f(x)) {\r\n            const t = new FSharpList(x, void 0);\r\n            acc.tail = t;\r\n            return t;\r\n        }\r\n        else {\r\n            return acc;\r\n        }\r\n    }, root, xs);\r\n    const t_2 = FSharpList_get_Empty();\r\n    node.tail = t_2;\r\n    return FSharpList__get_Tail(root);\r\n}\r\n\r\nexport function partition(f, xs) {\r\n    const patternInput = [FSharpList_get_Empty(), FSharpList_get_Empty()];\r\n    const root2 = patternInput[1];\r\n    const root1 = patternInput[0];\r\n    const patternInput_1 = fold(uncurry(2, (tupledArg) => {\r\n        const lacc = tupledArg[0];\r\n        const racc = tupledArg[1];\r\n        return (x) => {\r\n            let t, t_2;\r\n            return f(x) ? [(t = (new FSharpList(x, void 0)), (lacc.tail = t, t)), racc] : [lacc, (t_2 = (new FSharpList(x, void 0)), (racc.tail = t_2, t_2))];\r\n        };\r\n    }), [root1, root2], xs);\r\n    const t_4 = FSharpList_get_Empty();\r\n    patternInput_1[0].tail = t_4;\r\n    const t_5 = FSharpList_get_Empty();\r\n    patternInput_1[1].tail = t_5;\r\n    return [FSharpList__get_Tail(root1), FSharpList__get_Tail(root2)];\r\n}\r\n\r\nexport function choose(f, xs) {\r\n    const root = FSharpList_get_Empty();\r\n    const node = fold((acc, x) => {\r\n        const matchValue = f(x);\r\n        if (matchValue == null) {\r\n            return acc;\r\n        }\r\n        else {\r\n            const t = new FSharpList(value_1(matchValue), void 0);\r\n            acc.tail = t;\r\n            return t;\r\n        }\r\n    }, root, xs);\r\n    const t_2 = FSharpList_get_Empty();\r\n    node.tail = t_2;\r\n    return FSharpList__get_Tail(root);\r\n}\r\n\r\nexport function contains(value, xs, eq) {\r\n    return tryFindIndex((v) => eq.Equals(value, v), xs) != null;\r\n}\r\n\r\nexport function initialize(n, f) {\r\n    let xs, t;\r\n    const root = FSharpList_get_Empty();\r\n    let node = root;\r\n    for (let i = 0; i <= (n - 1); i++) {\r\n        node = ((xs = node, (t = (new FSharpList(f(i), void 0)), (xs.tail = t, t))));\r\n    }\r\n    const xs_2 = node;\r\n    const t_2 = FSharpList_get_Empty();\r\n    xs_2.tail = t_2;\r\n    return FSharpList__get_Tail(root);\r\n}\r\n\r\nexport function replicate(n, x) {\r\n    return initialize(n, (_arg1) => x);\r\n}\r\n\r\nexport function reduce(f, xs) {\r\n    if (FSharpList__get_IsEmpty(xs)) {\r\n        throw (new Error(SR_inputListWasEmpty));\r\n    }\r\n    else {\r\n        return fold(f, head(xs), tail(xs));\r\n    }\r\n}\r\n\r\nexport function reduceBack(f, xs) {\r\n    if (FSharpList__get_IsEmpty(xs)) {\r\n        throw (new Error(SR_inputListWasEmpty));\r\n    }\r\n    else {\r\n        return foldBack(f, tail(xs), head(xs));\r\n    }\r\n}\r\n\r\nexport function forAll(f, xs) {\r\n    return fold((acc, x) => (acc ? f(x) : false), true, xs);\r\n}\r\n\r\nexport function forAll2(f, xs, ys) {\r\n    return fold2((acc, x, y) => (acc ? f(x, y) : false), true, xs, ys);\r\n}\r\n\r\nexport function exists(f, xs) {\r\n    return tryFindIndex(f, xs) != null;\r\n}\r\n\r\nexport function exists2(f_mut, xs_mut, ys_mut) {\r\n    exists2:\r\n    while (true) {\r\n        const f = f_mut, xs = xs_mut, ys = ys_mut;\r\n        const matchValue = [FSharpList__get_IsEmpty(xs), FSharpList__get_IsEmpty(ys)];\r\n        let pattern_matching_result;\r\n        if (matchValue[0]) {\r\n            if (matchValue[1]) {\r\n                pattern_matching_result = 0;\r\n            }\r\n            else {\r\n                pattern_matching_result = 2;\r\n            }\r\n        }\r\n        else if (matchValue[1]) {\r\n            pattern_matching_result = 2;\r\n        }\r\n        else {\r\n            pattern_matching_result = 1;\r\n        }\r\n        switch (pattern_matching_result) {\r\n            case 0: {\r\n                return false;\r\n            }\r\n            case 1: {\r\n                if (f(FSharpList__get_Head(xs), FSharpList__get_Head(ys))) {\r\n                    return true;\r\n                }\r\n                else {\r\n                    f_mut = f;\r\n                    xs_mut = FSharpList__get_Tail(xs);\r\n                    ys_mut = FSharpList__get_Tail(ys);\r\n                    continue exists2;\r\n                }\r\n            }\r\n            case 2: {\r\n                throw (new Error((SR_listsHadDifferentLengths + \"\\\\nParameter name: \") + \"list2\"));\r\n            }\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function unzip(xs) {\r\n    return foldBack((tupledArg, tupledArg_1) => [FSharpList_Cons_305B8EAC(tupledArg[0], tupledArg_1[0]), FSharpList_Cons_305B8EAC(tupledArg[1], tupledArg_1[1])], xs, [FSharpList_get_Empty(), FSharpList_get_Empty()]);\r\n}\r\n\r\nexport function unzip3(xs) {\r\n    return foldBack((tupledArg, tupledArg_1) => [FSharpList_Cons_305B8EAC(tupledArg[0], tupledArg_1[0]), FSharpList_Cons_305B8EAC(tupledArg[1], tupledArg_1[1]), FSharpList_Cons_305B8EAC(tupledArg[2], tupledArg_1[2])], xs, [FSharpList_get_Empty(), FSharpList_get_Empty(), FSharpList_get_Empty()]);\r\n}\r\n\r\nexport function zip(xs, ys) {\r\n    return map2((x, y) => [x, y], xs, ys);\r\n}\r\n\r\nexport function zip3(xs, ys, zs) {\r\n    return map3((x, y, z) => [x, y, z], xs, ys, zs);\r\n}\r\n\r\nexport function sortWith(comparer, xs) {\r\n    const arr = toArray(xs);\r\n    arr.sort(comparer);\r\n    return ofArray(arr);\r\n}\r\n\r\nexport function sort(xs, comparer) {\r\n    return sortWith((x, y) => comparer.Compare(x, y), xs);\r\n}\r\n\r\nexport function sortBy(projection, xs, comparer) {\r\n    return sortWith((x, y) => comparer.Compare(projection(x), projection(y)), xs);\r\n}\r\n\r\nexport function sortDescending(xs, comparer) {\r\n    return sortWith((x, y) => (comparer.Compare(x, y) * -1), xs);\r\n}\r\n\r\nexport function sortByDescending(projection, xs, comparer) {\r\n    return sortWith((x, y) => (comparer.Compare(projection(x), projection(y)) * -1), xs);\r\n}\r\n\r\nexport function sum(xs, adder) {\r\n    return fold((acc, x) => adder.Add(acc, x), adder.GetZero(), xs);\r\n}\r\n\r\nexport function sumBy(f, xs, adder) {\r\n    return fold((acc, x) => adder.Add(acc, f(x)), adder.GetZero(), xs);\r\n}\r\n\r\nexport function maxBy(projection, xs, comparer) {\r\n    return reduce((x, y) => ((comparer.Compare(projection(y), projection(x)) > 0) ? y : x), xs);\r\n}\r\n\r\nexport function max(xs, comparer) {\r\n    return reduce((x, y) => ((comparer.Compare(y, x) > 0) ? y : x), xs);\r\n}\r\n\r\nexport function minBy(projection, xs, comparer) {\r\n    return reduce((x, y) => ((comparer.Compare(projection(y), projection(x)) > 0) ? x : y), xs);\r\n}\r\n\r\nexport function min(xs, comparer) {\r\n    return reduce((x, y) => ((comparer.Compare(y, x) > 0) ? x : y), xs);\r\n}\r\n\r\nexport function average(xs, averager) {\r\n    let count = 0;\r\n    return averager.DivideByInt(fold((acc, x) => {\r\n        count = ((count + 1) | 0);\r\n        return averager.Add(acc, x);\r\n    }, averager.GetZero(), xs), count);\r\n}\r\n\r\nexport function averageBy(f, xs, averager) {\r\n    let count = 0;\r\n    return averager.DivideByInt(fold((acc, x) => {\r\n        count = ((count + 1) | 0);\r\n        return averager.Add(acc, f(x));\r\n    }, averager.GetZero(), xs), count);\r\n}\r\n\r\nexport function permute(f, xs) {\r\n    return ofArray(permute_1(f, toArray(xs)));\r\n}\r\n\r\nexport function chunkBySize(chunkSize, xs) {\r\n    return ofArray(map_1((xs_1) => ofArray(xs_1), chunkBySize_1(chunkSize, toArray(xs))));\r\n}\r\n\r\nexport function allPairs(xs, ys) {\r\n    const root = FSharpList_get_Empty();\r\n    let node = root;\r\n    iterate((x) => {\r\n        iterate((y) => {\r\n            let xs_1, t;\r\n            node = ((xs_1 = node, (t = (new FSharpList([x, y], void 0)), (xs_1.tail = t, t))));\r\n        }, ys);\r\n    }, xs);\r\n    const xs_3 = node;\r\n    const t_2 = FSharpList_get_Empty();\r\n    xs_3.tail = t_2;\r\n    return FSharpList__get_Tail(root);\r\n}\r\n\r\nexport function skip(count_mut, xs_mut) {\r\n    skip:\r\n    while (true) {\r\n        const count = count_mut, xs = xs_mut;\r\n        if (count <= 0) {\r\n            return xs;\r\n        }\r\n        else if (FSharpList__get_IsEmpty(xs)) {\r\n            throw (new Error((SR_notEnoughElements + \"\\\\nParameter name: \") + \"list\"));\r\n        }\r\n        else {\r\n            count_mut = (count - 1);\r\n            xs_mut = FSharpList__get_Tail(xs);\r\n            continue skip;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function skipWhile(predicate_mut, xs_mut) {\r\n    skipWhile:\r\n    while (true) {\r\n        const predicate = predicate_mut, xs = xs_mut;\r\n        if (FSharpList__get_IsEmpty(xs)) {\r\n            return xs;\r\n        }\r\n        else if (!predicate(FSharpList__get_Head(xs))) {\r\n            return xs;\r\n        }\r\n        else {\r\n            predicate_mut = predicate;\r\n            xs_mut = FSharpList__get_Tail(xs);\r\n            continue skipWhile;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function take(count, xs) {\r\n    if (count < 0) {\r\n        throw (new Error((SR_inputMustBeNonNegative + \"\\\\nParameter name: \") + \"count\"));\r\n    }\r\n    const loop = (i_mut, acc_mut, xs_1_mut) => {\r\n        let t;\r\n        loop:\r\n        while (true) {\r\n            const i = i_mut, acc = acc_mut, xs_1 = xs_1_mut;\r\n            if (i <= 0) {\r\n                return acc;\r\n            }\r\n            else if (FSharpList__get_IsEmpty(xs_1)) {\r\n                throw (new Error((SR_notEnoughElements + \"\\\\nParameter name: \") + \"list\"));\r\n            }\r\n            else {\r\n                i_mut = (i - 1);\r\n                acc_mut = ((t = (new FSharpList(FSharpList__get_Head(xs_1), void 0)), (acc.tail = t, t)));\r\n                xs_1_mut = FSharpList__get_Tail(xs_1);\r\n                continue loop;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    const root = FSharpList_get_Empty();\r\n    const node = loop(count, root, xs);\r\n    const t_2 = FSharpList_get_Empty();\r\n    node.tail = t_2;\r\n    return FSharpList__get_Tail(root);\r\n}\r\n\r\nexport function takeWhile(predicate, xs) {\r\n    const loop = (acc_mut, xs_1_mut) => {\r\n        let t;\r\n        loop:\r\n        while (true) {\r\n            const acc = acc_mut, xs_1 = xs_1_mut;\r\n            if (FSharpList__get_IsEmpty(xs_1)) {\r\n                return acc;\r\n            }\r\n            else if (!predicate(FSharpList__get_Head(xs_1))) {\r\n                return acc;\r\n            }\r\n            else {\r\n                acc_mut = ((t = (new FSharpList(FSharpList__get_Head(xs_1), void 0)), (acc.tail = t, t)));\r\n                xs_1_mut = FSharpList__get_Tail(xs_1);\r\n                continue loop;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    const root = FSharpList_get_Empty();\r\n    const node = loop(root, xs);\r\n    const t_2 = FSharpList_get_Empty();\r\n    node.tail = t_2;\r\n    return FSharpList__get_Tail(root);\r\n}\r\n\r\nexport function truncate(count, xs) {\r\n    const loop = (i_mut, acc_mut, xs_1_mut) => {\r\n        let t;\r\n        loop:\r\n        while (true) {\r\n            const i = i_mut, acc = acc_mut, xs_1 = xs_1_mut;\r\n            if (i <= 0) {\r\n                return acc;\r\n            }\r\n            else if (FSharpList__get_IsEmpty(xs_1)) {\r\n                return acc;\r\n            }\r\n            else {\r\n                i_mut = (i - 1);\r\n                acc_mut = ((t = (new FSharpList(FSharpList__get_Head(xs_1), void 0)), (acc.tail = t, t)));\r\n                xs_1_mut = FSharpList__get_Tail(xs_1);\r\n                continue loop;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    const root = FSharpList_get_Empty();\r\n    const node = loop(count, root, xs);\r\n    const t_2 = FSharpList_get_Empty();\r\n    node.tail = t_2;\r\n    return FSharpList__get_Tail(root);\r\n}\r\n\r\nexport function getSlice(startIndex, endIndex, xs) {\r\n    const len = length(xs) | 0;\r\n    const startIndex_1 = defaultArg(startIndex, 0) | 0;\r\n    const endIndex_1 = defaultArg(endIndex, len - 1) | 0;\r\n    if (startIndex_1 < 0) {\r\n        throw (new Error((SR_indexOutOfBounds + \"\\\\nParameter name: \") + \"startIndex\"));\r\n    }\r\n    else if (endIndex_1 >= len) {\r\n        throw (new Error((SR_indexOutOfBounds + \"\\\\nParameter name: \") + \"endIndex\"));\r\n    }\r\n    else if (endIndex_1 < startIndex_1) {\r\n        return FSharpList_get_Empty();\r\n    }\r\n    else {\r\n        return take((endIndex_1 - startIndex_1) + 1, skip(startIndex_1, xs));\r\n    }\r\n}\r\n\r\nexport function splitAt(index, xs) {\r\n    if (index < 0) {\r\n        throw (new Error((SR_inputMustBeNonNegative + \"\\\\nParameter name: \") + \"index\"));\r\n    }\r\n    if (index > FSharpList__get_Length(xs)) {\r\n        throw (new Error((SR_notEnoughElements + \"\\\\nParameter name: \") + \"index\"));\r\n    }\r\n    return [take(index, xs), skip(index, xs)];\r\n}\r\n\r\nexport function exactlyOne(xs) {\r\n    if (FSharpList__get_IsEmpty(xs)) {\r\n        throw (new Error((SR_inputSequenceEmpty + \"\\\\nParameter name: \") + \"list\"));\r\n    }\r\n    else if (FSharpList__get_IsEmpty(FSharpList__get_Tail(xs))) {\r\n        return FSharpList__get_Head(xs);\r\n    }\r\n    else {\r\n        throw (new Error((SR_inputSequenceTooLong + \"\\\\nParameter name: \") + \"list\"));\r\n    }\r\n}\r\n\r\nexport function tryExactlyOne(xs) {\r\n    if ((!FSharpList__get_IsEmpty(xs)) ? FSharpList__get_IsEmpty(FSharpList__get_Tail(xs)) : false) {\r\n        return some(FSharpList__get_Head(xs));\r\n    }\r\n    else {\r\n        return void 0;\r\n    }\r\n}\r\n\r\nexport function where(predicate, xs) {\r\n    return filter(predicate, xs);\r\n}\r\n\r\nexport function pairwise(xs) {\r\n    return ofArray(pairwise_1(toArray(xs)));\r\n}\r\n\r\nexport function windowed(windowSize, xs) {\r\n    return ofArray(map_1((xs_1) => ofArray(xs_1), windowed_1(windowSize, toArray(xs))));\r\n}\r\n\r\nexport function splitInto(chunks, xs) {\r\n    return ofArray(map_1((xs_1) => ofArray(xs_1), splitInto_1(chunks, toArray(xs))));\r\n}\r\n\r\nexport function transpose(lists) {\r\n    return ofArray(map_1((xs_1) => ofArray(xs_1), transpose_1(map_1((xs) => toArray(xs), Array.from(lists)))));\r\n}\r\n\r\n","// Adapted from: https://github.com/dcodeIO/long.js/blob/master/src/long.js\n// Apache License 2.0: https://github.com/dcodeIO/long.js/blob/master/LICENSE\n/* tslint:disable */\nimport { symbol } from \"../Numeric.js\";\n/**\n * wasm optimizations, to do native i64 multiplication and divide\n */\nvar wasm = null;\ntry {\n    wasm = new WebAssembly.Instance(new WebAssembly.Module(new Uint8Array([\n        0, 97, 115, 109, 1, 0, 0, 0, 1, 13, 2, 96, 0, 1, 127, 96, 4, 127, 127, 127, 127, 1, 127, 3, 7, 6, 0, 1, 1, 1, 1, 1, 6, 6, 1, 127, 1, 65, 0, 11, 7, 50, 6, 3, 109, 117, 108, 0, 1, 5, 100, 105, 118, 95, 115, 0, 2, 5, 100, 105, 118, 95, 117, 0, 3, 5, 114, 101, 109, 95, 115, 0, 4, 5, 114, 101, 109, 95, 117, 0, 5, 8, 103, 101, 116, 95, 104, 105, 103, 104, 0, 0, 10, 191, 1, 6, 4, 0, 35, 0, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 126, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 127, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 128, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 129, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 130, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11\n    ])), {}).exports;\n}\ncatch (e) {\n    // no wasm support :(\n}\n/**\n * Constructs a 64 bit two's-complement integer, given its low and high 32 bit values as *signed* integers.\n *  See the from* functions below for more convenient ways of constructing Longs.\n * @exports Long\n * @class A Long class for representing a 64 bit two's-complement integer value.\n * @param {number} low The low (signed) 32 bits of the long\n * @param {number} high The high (signed) 32 bits of the long\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @constructor\n */\nexport function Long(low, high, unsigned) {\n    /**\n     * The low 32 bits as a signed value.\n     * @type {number}\n     */\n    this.low = low | 0;\n    /**\n     * The high 32 bits as a signed value.\n     * @type {number}\n     */\n    this.high = high | 0;\n    /**\n     * Whether unsigned or not.\n     * @type {boolean}\n     */\n    this.unsigned = !!unsigned;\n}\nLong.prototype.GetHashCode = function () {\n    let h1 = this.unsigned ? 1 : 0;\n    h1 = ((h1 << 5) + h1) ^ this.high;\n    h1 = ((h1 << 5) + h1) ^ this.low;\n    return h1;\n};\nLong.prototype.Equals = function (x) { return equals(this, x); };\nLong.prototype.CompareTo = function (x) { return compare(this, x); };\nLong.prototype.toString = function (radix) { return toString(this, radix); };\nLong.prototype.toJSON = function () { return toString(this); };\nLong.prototype[symbol] = function () {\n    const x = this;\n    return {\n        multiply: y => multiply(x, y),\n        toPrecision: sd => String(x) + (0).toPrecision(sd).substr(1),\n        toExponential: dp => String(x) + (0).toExponential(dp).substr(1),\n        toFixed: dp => String(x) + (0).toFixed(dp).substr(1),\n        toHex: () => toString(x.unsigned ? x : fromBytes(toBytes(x), true), 16),\n    };\n};\n// The internal representation of a long is the two given signed, 32-bit values.\n// We use 32-bit pieces because these are the size of integers on which\n// Javascript performs bit-operations.  For operations like addition and\n// multiplication, we split each number into 16 bit pieces, which can easily be\n// multiplied within Javascript's floating-point representation without overflow\n// or change in sign.\n//\n// In the algorithms below, we frequently reduce the negative case to the\n// positive case by negating the input(s) and then post-processing the result.\n// Note that we must ALWAYS check specially whether those values are MIN_VALUE\n// (-2^63) because -MIN_VALUE == MIN_VALUE (since 2^63 cannot be represented as\n// a positive number, it overflows back into a negative).  Not handling this\n// case would often result in infinite recursion.\n//\n// Common constant values ZERO, ONE, NEG_ONE, etc. are defined below the from*\n// methods on which they depend.\n/**\n * An indicator used to reliably determine if an object is a Long or not.\n * @type {boolean}\n * @const\n * @private\n */\nLong.prototype.__isLong__;\nObject.defineProperty(Long.prototype, \"__isLong__\", { value: true });\n/**\n * @function\n * @param {*} obj Object\n * @returns {boolean}\n * @inner\n */\nexport function isLong(obj) {\n    return (obj && obj[\"__isLong__\"]) === true;\n}\n/**\n * Tests if the specified object is a Long.\n * @function\n * @param {*} obj Object\n * @returns {boolean}\n */\n// Long.isLong = isLong;\n/**\n * A cache of the Long representations of small integer values.\n * @type {!Object}\n * @inner\n */\nvar INT_CACHE = {};\n/**\n * A cache of the Long representations of small unsigned integer values.\n * @type {!Object}\n * @inner\n */\nvar UINT_CACHE = {};\n/**\n * @param {number} value\n * @param {boolean=} unsigned\n * @returns {!Long}\n * @inner\n */\nexport function fromInt(value, unsigned) {\n    var obj, cachedObj, cache;\n    if (unsigned) {\n        value >>>= 0;\n        if (cache = (0 <= value && value < 256)) {\n            cachedObj = UINT_CACHE[value];\n            if (cachedObj)\n                return cachedObj;\n        }\n        obj = fromBits(value, (value | 0) < 0 ? -1 : 0, true);\n        if (cache)\n            UINT_CACHE[value] = obj;\n        return obj;\n    }\n    else {\n        value |= 0;\n        if (cache = (-128 <= value && value < 128)) {\n            cachedObj = INT_CACHE[value];\n            if (cachedObj)\n                return cachedObj;\n        }\n        obj = fromBits(value, value < 0 ? -1 : 0, false);\n        if (cache)\n            INT_CACHE[value] = obj;\n        return obj;\n    }\n}\n/**\n * Returns a Long representing the given 32 bit integer value.\n * @function\n * @param {number} value The 32 bit integer in question\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @returns {!Long} The corresponding Long value\n */\n// Long.fromInt = fromInt;\n/**\n * @param {number} value\n * @param {boolean=} unsigned\n * @returns {!Long}\n * @inner\n */\nexport function fromNumber(value, unsigned) {\n    if (isNaN(value))\n        return unsigned ? UZERO : ZERO;\n    if (unsigned) {\n        if (value < 0)\n            return UZERO;\n        if (value >= TWO_PWR_64_DBL)\n            return MAX_UNSIGNED_VALUE;\n    }\n    else {\n        if (value <= -TWO_PWR_63_DBL)\n            return MIN_VALUE;\n        if (value + 1 >= TWO_PWR_63_DBL)\n            return MAX_VALUE;\n    }\n    if (value < 0)\n        return negate(fromNumber(-value, unsigned));\n    return fromBits((value % TWO_PWR_32_DBL) | 0, (value / TWO_PWR_32_DBL) | 0, unsigned);\n}\n/**\n * Returns a Long representing the given value, provided that it is a finite number. Otherwise, zero is returned.\n * @function\n * @param {number} value The number in question\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @returns {!Long} The corresponding Long value\n */\n// Long.fromNumber = fromNumber;\n/**\n * @param {number} lowBits\n * @param {number} highBits\n * @param {boolean=} unsigned\n * @returns {!Long}\n * @inner\n */\nexport function fromBits(lowBits, highBits, unsigned) {\n    return new Long(lowBits, highBits, unsigned);\n}\n/**\n * Returns a Long representing the 64 bit integer that comes by concatenating the given low and high bits. Each is\n *  assumed to use 32 bits.\n * @function\n * @param {number} lowBits The low 32 bits\n * @param {number} highBits The high 32 bits\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @returns {!Long} The corresponding Long value\n */\n// Long.fromBits = fromBits;\n/**\n * @function\n * @param {number} base\n * @param {number} exponent\n * @returns {number}\n * @inner\n */\nvar pow_dbl = Math.pow; // Used 4 times (4*8 to 15+4)\n/**\n * @param {string} str\n * @param {(boolean|number)=} unsigned\n * @param {number=} radix\n * @returns {!Long}\n * @inner\n */\nexport function fromString(str, unsigned, radix) {\n    if (str.length === 0)\n        throw Error('empty string');\n    if (str === \"NaN\" || str === \"Infinity\" || str === \"+Infinity\" || str === \"-Infinity\")\n        return ZERO;\n    if (typeof unsigned === 'number') {\n        // For goog.math.long compatibility\n        radix = unsigned,\n            unsigned = false;\n    }\n    else {\n        unsigned = !!unsigned;\n    }\n    radix = radix || 10;\n    if (radix < 2 || 36 < radix)\n        throw RangeError('radix');\n    var p = str.indexOf('-');\n    if (p > 0)\n        throw Error('interior hyphen');\n    else if (p === 0) {\n        return negate(fromString(str.substring(1), unsigned, radix));\n    }\n    // Do several (8) digits each time through the loop, so as to\n    // minimize the calls to the very expensive emulated div.\n    var radixToPower = fromNumber(pow_dbl(radix, 8));\n    var result = ZERO;\n    for (var i = 0; i < str.length; i += 8) {\n        var size = Math.min(8, str.length - i), value = parseInt(str.substring(i, i + size), radix);\n        if (size < 8) {\n            var power = fromNumber(pow_dbl(radix, size));\n            result = add(multiply(result, power), fromNumber(value));\n        }\n        else {\n            result = multiply(result, radixToPower);\n            result = add(result, fromNumber(value));\n        }\n    }\n    result.unsigned = unsigned;\n    return result;\n}\n/**\n * Returns a Long representation of the given string, written using the specified radix.\n * @function\n * @param {string} str The textual representation of the Long\n * @param {(boolean|number)=} unsigned Whether unsigned or not, defaults to signed\n * @param {number=} radix The radix in which the text is written (2-36), defaults to 10\n * @returns {!Long} The corresponding Long value\n */\n// Long.fromString = fromString;\n/**\n * @function\n * @param {!Long|number|string|!{low: number, high: number, unsigned: boolean}} val\n * @param {boolean=} unsigned\n * @returns {!Long}\n * @inner\n */\nexport function fromValue(val, unsigned) {\n    if (typeof val === 'number')\n        return fromNumber(val, unsigned);\n    if (typeof val === 'string')\n        return fromString(val, unsigned);\n    // Throws for non-objects, converts non-instanceof Long:\n    return fromBits(val.low, val.high, typeof unsigned === 'boolean' ? unsigned : val.unsigned);\n}\n/**\n * Converts the specified value to a Long using the appropriate from* function for its type.\n * @function\n * @param {!Long|number|string|!{low: number, high: number, unsigned: boolean}} val Value\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @returns {!Long}\n */\n// Long.fromValue = fromValue;\n// NOTE: the compiler should inline these constant values below and then remove these variables, so there should be\n// no runtime penalty for these.\n/**\n * @type {number}\n * @const\n * @inner\n */\nvar TWO_PWR_16_DBL = 1 << 16;\n/**\n * @type {number}\n * @const\n * @inner\n */\nvar TWO_PWR_24_DBL = 1 << 24;\n/**\n * @type {number}\n * @const\n * @inner\n */\nvar TWO_PWR_32_DBL = TWO_PWR_16_DBL * TWO_PWR_16_DBL;\n/**\n * @type {number}\n * @const\n * @inner\n */\nvar TWO_PWR_64_DBL = TWO_PWR_32_DBL * TWO_PWR_32_DBL;\n/**\n * @type {number}\n * @const\n * @inner\n */\nvar TWO_PWR_63_DBL = TWO_PWR_64_DBL / 2;\n/**\n * @type {!Long}\n * @const\n * @inner\n */\nvar TWO_PWR_24 = fromInt(TWO_PWR_24_DBL);\n/**\n * @type {!Long}\n * @inner\n */\nexport var ZERO = fromInt(0);\n/**\n * Signed zero.\n * @type {!Long}\n */\n// Long.ZERO = ZERO;\n/**\n * @type {!Long}\n * @inner\n */\nexport var UZERO = fromInt(0, true);\n/**\n * Unsigned zero.\n * @type {!Long}\n */\n// Long.UZERO = UZERO;\n/**\n * @type {!Long}\n * @inner\n */\nexport var ONE = fromInt(1);\n/**\n * Signed one.\n * @type {!Long}\n */\n// Long.ONE = ONE;\n/**\n * @type {!Long}\n * @inner\n */\nexport var UONE = fromInt(1, true);\n/**\n * Unsigned one.\n * @type {!Long}\n */\n// Long.UONE = UONE;\n/**\n * @type {!Long}\n * @inner\n */\nexport var NEG_ONE = fromInt(-1);\n/**\n * Signed negative one.\n * @type {!Long}\n */\n// Long.NEG_ONE = NEG_ONE;\n/**\n * @type {!Long}\n * @inner\n */\nexport var MAX_VALUE = fromBits(0xFFFFFFFF | 0, 0x7FFFFFFF | 0, false);\n/**\n * Maximum signed value.\n * @type {!Long}\n */\n// Long.MAX_VALUE = MAX_VALUE;\n/**\n * @type {!Long}\n * @inner\n */\nexport var MAX_UNSIGNED_VALUE = fromBits(0xFFFFFFFF | 0, 0xFFFFFFFF | 0, true);\n/**\n * Maximum unsigned value.\n * @type {!Long}\n */\n// Long.MAX_UNSIGNED_VALUE = MAX_UNSIGNED_VALUE;\n/**\n * @type {!Long}\n * @inner\n */\nexport var MIN_VALUE = fromBits(0, 0x80000000 | 0, false);\n/**\n * Minimum signed value.\n * @type {!Long}\n */\n// Long.MIN_VALUE = MIN_VALUE;\n/**\n * @alias Long.prototype\n * @inner\n */\n// var LongPrototype = Long.prototype;\n/**\n * Converts the Long to a 32 bit integer, assuming it is a 32 bit integer.\n * @this {!Long}\n * @returns {number}\n */\nexport function toInt($this) {\n    return $this.unsigned ? $this.low >>> 0 : $this.low;\n}\n;\n/**\n * Converts the Long to a the nearest floating-point representation of this value (double, 53 bit mantissa).\n * @this {!Long}\n * @returns {number}\n */\nexport function toNumber($this) {\n    if ($this.unsigned)\n        return (($this.high >>> 0) * TWO_PWR_32_DBL) + ($this.low >>> 0);\n    return $this.high * TWO_PWR_32_DBL + ($this.low >>> 0);\n}\n;\n/**\n * Converts the Long to a string written in the specified radix.\n * @this {!Long}\n * @param {number=} radix Radix (2-36), defaults to 10\n * @returns {string}\n * @override\n * @throws {RangeError} If `radix` is out of range\n */\nexport function toString($this, radix) {\n    radix = radix || 10;\n    if (radix < 2 || 36 < radix)\n        throw RangeError('radix');\n    if (isZero($this))\n        return '0';\n    if (isNegative($this)) { // Unsigned Longs are never negative\n        if (equals($this, MIN_VALUE)) {\n            // We need to change the Long value before it can be negated, so we remove\n            // the bottom-most digit in this base and then recurse to do the rest.\n            var radixLong = fromNumber(radix), div = divide($this, radixLong), rem1 = subtract(multiply(div, radixLong), $this);\n            return toString(div, radix) + toInt(rem1).toString(radix);\n        }\n        else\n            return '-' + toString(negate($this), radix);\n    }\n    // Do several (6) digits each time through the loop, so as to\n    // minimize the calls to the very expensive emulated div.\n    var radixToPower = fromNumber(pow_dbl(radix, 6), $this.unsigned), rem = $this;\n    var result = '';\n    while (true) {\n        var remDiv = divide(rem, radixToPower), intval = toInt(subtract(rem, multiply(remDiv, radixToPower))) >>> 0, digits = intval.toString(radix);\n        rem = remDiv;\n        if (isZero(rem))\n            return digits + result;\n        else {\n            while (digits.length < 6)\n                digits = '0' + digits;\n            result = '' + digits + result;\n        }\n    }\n}\n;\n/**\n * Gets the high 32 bits as a signed integer.\n * @this {!Long}\n * @returns {number} Signed high bits\n */\nexport function getHighBits($this) {\n    return $this.high;\n}\n;\n/**\n * Gets the high 32 bits as an unsigned integer.\n * @this {!Long}\n * @returns {number} Unsigned high bits\n */\nexport function getHighBitsUnsigned($this) {\n    return $this.high >>> 0;\n}\n;\n/**\n * Gets the low 32 bits as a signed integer.\n * @this {!Long}\n * @returns {number} Signed low bits\n */\nexport function getLowBits($this) {\n    return $this.low;\n}\n;\n/**\n * Gets the low 32 bits as an unsigned integer.\n * @this {!Long}\n * @returns {number} Unsigned low bits\n */\nexport function getLowBitsUnsigned($this) {\n    return $this.low >>> 0;\n}\n;\n/**\n * Gets the number of bits needed to represent the absolute value of this Long.\n * @this {!Long}\n * @returns {number}\n */\nexport function getNumBitsAbs($this) {\n    if (isNegative($this)) // Unsigned Longs are never negative\n        return equals($this, MIN_VALUE) ? 64 : getNumBitsAbs(negate($this));\n    var val = $this.high != 0 ? $this.high : $this.low;\n    for (var bit = 31; bit > 0; bit--)\n        if ((val & (1 << bit)) != 0)\n            break;\n    return $this.high != 0 ? bit + 33 : bit + 1;\n}\n;\n/**\n * Tests if this Long's value equals zero.\n * @this {!Long}\n * @returns {boolean}\n */\nexport function isZero($this) {\n    return $this.high === 0 && $this.low === 0;\n}\n;\n/**\n * Tests if this Long's value equals zero. This is an alias of {@link Long#isZero}.\n * @returns {boolean}\n */\n// LongPrototype.eqz = LongPrototype.isZero;\n/**\n * Tests if this Long's value is negative.\n * @this {!Long}\n * @returns {boolean}\n */\nexport function isNegative($this) {\n    return !$this.unsigned && $this.high < 0;\n}\n;\n/**\n * Tests if this Long's value is positive.\n * @this {!Long}\n * @returns {boolean}\n */\nexport function isPositive($this) {\n    return $this.unsigned || $this.high >= 0;\n}\n;\n/**\n * Tests if this Long's value is odd.\n * @this {!Long}\n * @returns {boolean}\n */\nexport function isOdd($this) {\n    return ($this.low & 1) === 1;\n}\n;\n/**\n * Tests if this Long's value is even.\n * @this {!Long}\n * @returns {boolean}\n */\nexport function isEven($this) {\n    return ($this.low & 1) === 0;\n}\n;\n/**\n * Tests if this Long's value equals the specified's.\n * @this {!Long}\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nexport function equals($this, other) {\n    if (!isLong(other))\n        other = fromValue(other);\n    if ($this.unsigned !== other.unsigned && ($this.high >>> 31) === 1 && (other.high >>> 31) === 1)\n        return false;\n    return $this.high === other.high && $this.low === other.low;\n}\n;\n/**\n * Tests if this Long's value equals the specified's. This is an alias of {@link Long#equals}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\n// LongPrototype.eq = LongPrototype.equals;\n/**\n * Tests if this Long's value differs from the specified's.\n * @this {!Long}\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nexport function notEquals($this, other) {\n    return !equals($this, /* validates */ other);\n}\n;\n/**\n * Tests if this Long's value differs from the specified's. This is an alias of {@link Long#notEquals}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\n// LongPrototype.neq = LongPrototype.notEquals;\n/**\n * Tests if this Long's value differs from the specified's. This is an alias of {@link Long#notEquals}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\n// LongPrototype.ne = LongPrototype.notEquals;\n/**\n * Tests if this Long's value is less than the specified's.\n * @this {!Long}\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nexport function lessThan($this, other) {\n    return compare($this, /* validates */ other) < 0;\n}\n;\n/**\n * Tests if this Long's value is less than the specified's. This is an alias of {@link Long#lessThan}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\n// LongPrototype.lt = LongPrototype.lessThan;\n/**\n * Tests if this Long's value is less than or equal the specified's.\n * @this {!Long}\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nexport function lessThanOrEqual($this, other) {\n    return compare($this, /* validates */ other) <= 0;\n}\n;\n/**\n * Tests if this Long's value is less than or equal the specified's. This is an alias of {@link Long#lessThanOrEqual}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\n// LongPrototype.lte = LongPrototype.lessThanOrEqual;\n/**\n * Tests if this Long's value is less than or equal the specified's. This is an alias of {@link Long#lessThanOrEqual}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\n// LongPrototype.le = LongPrototype.lessThanOrEqual;\n/**\n * Tests if this Long's value is greater than the specified's.\n * @this {!Long}\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nexport function greaterThan($this, other) {\n    return compare($this, /* validates */ other) > 0;\n}\n;\n/**\n * Tests if this Long's value is greater than the specified's. This is an alias of {@link Long#greaterThan}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\n// LongPrototype.gt = LongPrototype.greaterThan;\n/**\n * Tests if this Long's value is greater than or equal the specified's.\n * @this {!Long}\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\nexport function greaterThanOrEqual($this, other) {\n    return compare($this, /* validates */ other) >= 0;\n}\n;\n/**\n * Tests if this Long's value is greater than or equal the specified's. This is an alias of {@link Long#greaterThanOrEqual}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\n// LongPrototype.gte = LongPrototype.greaterThanOrEqual;\n/**\n * Tests if this Long's value is greater than or equal the specified's. This is an alias of {@link Long#greaterThanOrEqual}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {boolean}\n */\n// LongPrototype.ge = LongPrototype.greaterThanOrEqual;\n/**\n * Compares this Long's value with the specified's.\n * @this {!Long}\n * @param {!Long|number|string} other Other value\n * @returns {number} 0 if they are the same, 1 if the this is greater and -1\n *  if the given one is greater\n */\nexport function compare($this, other) {\n    if (!isLong(other))\n        other = fromValue(other);\n    if (equals($this, other))\n        return 0;\n    var thisNeg = isNegative($this), otherNeg = isNegative(other);\n    if (thisNeg && !otherNeg)\n        return -1;\n    if (!thisNeg && otherNeg)\n        return 1;\n    // At this point the sign bits are the same\n    if (!$this.unsigned)\n        return isNegative(subtract($this, other)) ? -1 : 1;\n    // Both are positive if at least one is unsigned\n    return (other.high >>> 0) > ($this.high >>> 0) || (other.high === $this.high && (other.low >>> 0) > ($this.low >>> 0)) ? -1 : 1;\n}\n;\n/**\n * Compares this Long's value with the specified's. This is an alias of {@link Long#compare}.\n * @function\n * @param {!Long|number|string} other Other value\n * @returns {number} 0 if they are the same, 1 if the this is greater and -1\n *  if the given one is greater\n */\n// LongPrototype.comp = LongPrototype.compare;\n/**\n * Negates this Long's value.\n * @this {!Long}\n * @returns {!Long} Negated Long\n */\nexport function negate($this) {\n    if (!$this.unsigned && equals($this, MIN_VALUE))\n        return MIN_VALUE;\n    return add(not($this), ONE);\n}\n;\n/**\n * Negates this Long's value. This is an alias of {@link Long#negate}.\n * @function\n * @returns {!Long} Negated Long\n */\n// LongPrototype.neg = LongPrototype.negate;\n/**\n * Returns the sum of this and the specified Long.\n * @this {!Long}\n * @param {!Long|number|string} addend Addend\n * @returns {!Long} Sum\n */\nexport function add($this, addend) {\n    if (!isLong(addend))\n        addend = fromValue(addend);\n    // Divide each number into 4 chunks of 16 bits, and then sum the chunks.\n    var a48 = $this.high >>> 16;\n    var a32 = $this.high & 0xFFFF;\n    var a16 = $this.low >>> 16;\n    var a00 = $this.low & 0xFFFF;\n    var b48 = addend.high >>> 16;\n    var b32 = addend.high & 0xFFFF;\n    var b16 = addend.low >>> 16;\n    var b00 = addend.low & 0xFFFF;\n    var c48 = 0, c32 = 0, c16 = 0, c00 = 0;\n    c00 += a00 + b00;\n    c16 += c00 >>> 16;\n    c00 &= 0xFFFF;\n    c16 += a16 + b16;\n    c32 += c16 >>> 16;\n    c16 &= 0xFFFF;\n    c32 += a32 + b32;\n    c48 += c32 >>> 16;\n    c32 &= 0xFFFF;\n    c48 += a48 + b48;\n    c48 &= 0xFFFF;\n    return fromBits((c16 << 16) | c00, (c48 << 16) | c32, $this.unsigned);\n}\n;\n/**\n * Returns the difference of this and the specified Long.\n * @this {!Long}\n * @param {!Long|number|string} subtrahend Subtrahend\n * @returns {!Long} Difference\n */\nexport function subtract($this, subtrahend) {\n    if (!isLong(subtrahend))\n        subtrahend = fromValue(subtrahend);\n    return add($this, negate(subtrahend));\n}\n;\n/**\n * Returns the difference of this and the specified Long. This is an alias of {@link Long#subtract}.\n * @function\n * @param {!Long|number|string} subtrahend Subtrahend\n * @returns {!Long} Difference\n */\n// LongPrototype.sub = LongPrototype.subtract;\n/**\n * Returns the product of this and the specified Long.\n * @this {!Long}\n * @param {!Long|number|string} multiplier Multiplier\n * @returns {!Long} Product\n */\nexport function multiply($this, multiplier) {\n    if (isZero($this))\n        return $this.unsigned ? UZERO : ZERO;\n    if (!isLong(multiplier))\n        multiplier = fromValue(multiplier);\n    // use wasm support if present\n    if (wasm) {\n        var low = wasm.mul($this.low, $this.high, multiplier.low, multiplier.high);\n        return fromBits(low, wasm.get_high(), $this.unsigned);\n    }\n    if (isZero(multiplier))\n        return $this.unsigned ? UZERO : ZERO;\n    if (equals($this, MIN_VALUE))\n        return isOdd(multiplier) ? MIN_VALUE : ZERO;\n    if (equals(multiplier, MIN_VALUE))\n        return isOdd($this) ? MIN_VALUE : ZERO;\n    if (isNegative($this)) {\n        if (isNegative(multiplier))\n            return multiply(negate($this), negate(multiplier));\n        else\n            return negate(multiply(negate($this), multiplier));\n    }\n    else if (isNegative(multiplier))\n        return negate(multiply($this, negate(multiplier)));\n    // If both longs are small, use float multiplication\n    if (lessThan($this, TWO_PWR_24) && lessThan(multiplier, TWO_PWR_24))\n        return fromNumber(toNumber($this) * toNumber(multiplier), $this.unsigned);\n    // Divide each long into 4 chunks of 16 bits, and then add up 4x4 products.\n    // We can skip products that would overflow.\n    var a48 = $this.high >>> 16;\n    var a32 = $this.high & 0xFFFF;\n    var a16 = $this.low >>> 16;\n    var a00 = $this.low & 0xFFFF;\n    var b48 = multiplier.high >>> 16;\n    var b32 = multiplier.high & 0xFFFF;\n    var b16 = multiplier.low >>> 16;\n    var b00 = multiplier.low & 0xFFFF;\n    var c48 = 0, c32 = 0, c16 = 0, c00 = 0;\n    c00 += a00 * b00;\n    c16 += c00 >>> 16;\n    c00 &= 0xFFFF;\n    c16 += a16 * b00;\n    c32 += c16 >>> 16;\n    c16 &= 0xFFFF;\n    c16 += a00 * b16;\n    c32 += c16 >>> 16;\n    c16 &= 0xFFFF;\n    c32 += a32 * b00;\n    c48 += c32 >>> 16;\n    c32 &= 0xFFFF;\n    c32 += a16 * b16;\n    c48 += c32 >>> 16;\n    c32 &= 0xFFFF;\n    c32 += a00 * b32;\n    c48 += c32 >>> 16;\n    c32 &= 0xFFFF;\n    c48 += a48 * b00 + a32 * b16 + a16 * b32 + a00 * b48;\n    c48 &= 0xFFFF;\n    return fromBits((c16 << 16) | c00, (c48 << 16) | c32, $this.unsigned);\n}\n;\n/**\n * Returns the product of this and the specified Long. This is an alias of {@link Long#multiply}.\n * @function\n * @param {!Long|number|string} multiplier Multiplier\n * @returns {!Long} Product\n */\n// LongPrototype.mul = LongPrototype.multiply;\n/**\n * Returns this Long divided by the specified. The result is signed if this Long is signed or\n *  unsigned if this Long is unsigned.\n * @this {!Long}\n * @param {!Long|number|string} divisor Divisor\n * @returns {!Long} Quotient\n */\nexport function divide($this, divisor) {\n    if (!isLong(divisor))\n        divisor = fromValue(divisor);\n    if (isZero(divisor))\n        throw Error('division by zero');\n    // use wasm support if present\n    if (wasm) {\n        // guard against signed division overflow: the largest\n        // negative number / -1 would be 1 larger than the largest\n        // positive number, due to two's complement.\n        if (!$this.unsigned &&\n            $this.high === -0x80000000 &&\n            divisor.low === -1 && divisor.high === -1) {\n            // be consistent with non-wasm code path\n            return $this;\n        }\n        var low = ($this.unsigned ? wasm.div_u : wasm.div_s)($this.low, $this.high, divisor.low, divisor.high);\n        return fromBits(low, wasm.get_high(), $this.unsigned);\n    }\n    if (isZero($this))\n        return $this.unsigned ? UZERO : ZERO;\n    var approx, rem, res;\n    if (!$this.unsigned) {\n        // This section is only relevant for signed longs and is derived from the\n        // closure library as a whole.\n        if (equals($this, MIN_VALUE)) {\n            if (equals(divisor, ONE) || equals(divisor, NEG_ONE))\n                return MIN_VALUE; // recall that -MIN_VALUE == MIN_VALUE\n            else if (equals(divisor, MIN_VALUE))\n                return ONE;\n            else {\n                // At this point, we have |other| >= 2, so |this/other| < |MIN_VALUE|.\n                var halfThis = shiftRight($this, 1);\n                approx = shiftLeft(divide(halfThis, divisor), 1);\n                if (equals(approx, ZERO)) {\n                    return isNegative(divisor) ? ONE : NEG_ONE;\n                }\n                else {\n                    rem = subtract($this, multiply(divisor, approx));\n                    res = add(approx, divide(rem, divisor));\n                    return res;\n                }\n            }\n        }\n        else if (equals(divisor, MIN_VALUE))\n            return $this.unsigned ? UZERO : ZERO;\n        if (isNegative($this)) {\n            if (isNegative(divisor))\n                return divide(negate($this), negate(divisor));\n            return negate(divide(negate($this), divisor));\n        }\n        else if (isNegative(divisor))\n            return negate(divide($this, negate(divisor)));\n        res = ZERO;\n    }\n    else {\n        // The algorithm below has not been made for unsigned longs. It's therefore\n        // required to take special care of the MSB prior to running it.\n        if (!divisor.unsigned)\n            divisor = toUnsigned(divisor);\n        if (greaterThan(divisor, $this))\n            return UZERO;\n        if (greaterThan(divisor, shiftRightUnsigned($this, 1))) // 15 >>> 1 = 7 ; with divisor = 8 ; true\n            return UONE;\n        res = UZERO;\n    }\n    // Repeat the following until the remainder is less than other:  find a\n    // floating-point that approximates remainder / other *from below*, add this\n    // into the result, and subtract it from the remainder.  It is critical that\n    // the approximate value is less than or equal to the real value so that the\n    // remainder never becomes negative.\n    rem = $this;\n    while (greaterThanOrEqual(rem, divisor)) {\n        // Approximate the result of division. This may be a little greater or\n        // smaller than the actual value.\n        approx = Math.max(1, Math.floor(toNumber(rem) / toNumber(divisor)));\n        // We will tweak the approximate result by changing it in the 48-th digit or\n        // the smallest non-fractional digit, whichever is larger.\n        var log2 = Math.ceil(Math.log(approx) / Math.LN2), delta = (log2 <= 48) ? 1 : pow_dbl(2, log2 - 48), \n        // Decrease the approximation until it is smaller than the remainder.  Note\n        // that if it is too large, the product overflows and is negative.\n        approxRes = fromNumber(approx), approxRem = multiply(approxRes, divisor);\n        while (isNegative(approxRem) || greaterThan(approxRem, rem)) {\n            approx -= delta;\n            approxRes = fromNumber(approx, $this.unsigned);\n            approxRem = multiply(approxRes, divisor);\n        }\n        // We know the answer can't be zero... and actually, zero would cause\n        // infinite recursion since we would make no progress.\n        if (isZero(approxRes))\n            approxRes = ONE;\n        res = add(res, approxRes);\n        rem = subtract(rem, approxRem);\n    }\n    return res;\n}\n;\n/**\n * Returns this Long divided by the specified. This is an alias of {@link Long#divide}.\n * @function\n * @param {!Long|number|string} divisor Divisor\n * @returns {!Long} Quotient\n */\n// LongPrototype.div = LongPrototype.divide;\n/**\n * Returns this Long modulo the specified.\n * @this {!Long}\n * @param {!Long|number|string} divisor Divisor\n * @returns {!Long} Remainder\n */\nexport function modulo($this, divisor) {\n    if (!isLong(divisor))\n        divisor = fromValue(divisor);\n    // use wasm support if present\n    if (wasm) {\n        var low = ($this.unsigned ? wasm.rem_u : wasm.rem_s)($this.low, $this.high, divisor.low, divisor.high);\n        return fromBits(low, wasm.get_high(), $this.unsigned);\n    }\n    return subtract($this, multiply(divide($this, divisor), divisor));\n}\n;\n/**\n * Returns this Long modulo the specified. This is an alias of {@link Long#modulo}.\n * @function\n * @param {!Long|number|string} divisor Divisor\n * @returns {!Long} Remainder\n */\n// LongPrototype.mod = LongPrototype.modulo;\n/**\n * Returns this Long modulo the specified. This is an alias of {@link Long#modulo}.\n * @function\n * @param {!Long|number|string} divisor Divisor\n * @returns {!Long} Remainder\n */\n// LongPrototype.rem = LongPrototype.modulo;\n/**\n * Returns the bitwise NOT of this Long.\n * @this {!Long}\n * @returns {!Long}\n */\nexport function not($this) {\n    return fromBits(~$this.low, ~$this.high, $this.unsigned);\n}\n;\n/**\n * Returns the bitwise AND of this Long and the specified.\n * @this {!Long}\n * @param {!Long|number|string} other Other Long\n * @returns {!Long}\n */\nexport function and($this, other) {\n    if (!isLong(other))\n        other = fromValue(other);\n    return fromBits($this.low & other.low, $this.high & other.high, $this.unsigned);\n}\n;\n/**\n * Returns the bitwise OR of this Long and the specified.\n * @this {!Long}\n * @param {!Long|number|string} other Other Long\n * @returns {!Long}\n */\nexport function or($this, other) {\n    if (!isLong(other))\n        other = fromValue(other);\n    return fromBits($this.low | other.low, $this.high | other.high, $this.unsigned);\n}\n;\n/**\n * Returns the bitwise XOR of this Long and the given one.\n * @this {!Long}\n * @param {!Long|number|string} other Other Long\n * @returns {!Long}\n */\nexport function xor($this, other) {\n    if (!isLong(other))\n        other = fromValue(other);\n    return fromBits($this.low ^ other.low, $this.high ^ other.high, $this.unsigned);\n}\n;\n/**\n * Returns this Long with bits shifted to the left by the given amount.\n * @this {!Long}\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Shifted Long\n */\nexport function shiftLeft($this, numBits) {\n    if (isLong(numBits))\n        numBits = toInt(numBits);\n    if ((numBits &= 63) === 0)\n        return $this;\n    else if (numBits < 32)\n        return fromBits($this.low << numBits, ($this.high << numBits) | ($this.low >>> (32 - numBits)), $this.unsigned);\n    else\n        return fromBits(0, $this.low << (numBits - 32), $this.unsigned);\n}\n;\n/**\n * Returns this Long with bits shifted to the left by the given amount. This is an alias of {@link Long#shiftLeft}.\n * @function\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Shifted Long\n */\n// LongPrototype.shl = LongPrototype.shiftLeft;\n/**\n * Returns this Long with bits arithmetically shifted to the right by the given amount.\n * @this {!Long}\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Shifted Long\n */\nexport function shiftRight($this, numBits) {\n    if (isLong(numBits))\n        numBits = toInt(numBits);\n    if ((numBits &= 63) === 0)\n        return $this;\n    else if (numBits < 32)\n        return fromBits(($this.low >>> numBits) | ($this.high << (32 - numBits)), $this.high >> numBits, $this.unsigned);\n    else\n        return fromBits($this.high >> (numBits - 32), $this.high >= 0 ? 0 : -1, $this.unsigned);\n}\n;\n/**\n * Returns this Long with bits arithmetically shifted to the right by the given amount. This is an alias of {@link Long#shiftRight}.\n * @function\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Shifted Long\n */\n// LongPrototype.shr = LongPrototype.shiftRight;\n/**\n * Returns this Long with bits logically shifted to the right by the given amount.\n * @this {!Long}\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Shifted Long\n */\nexport function shiftRightUnsigned($this, numBits) {\n    if (isLong(numBits))\n        numBits = toInt(numBits);\n    numBits &= 63;\n    if (numBits === 0)\n        return $this;\n    else {\n        var high = $this.high;\n        if (numBits < 32) {\n            var low = $this.low;\n            return fromBits((low >>> numBits) | (high << (32 - numBits)), high >>> numBits, $this.unsigned);\n        }\n        else if (numBits === 32)\n            return fromBits(high, 0, $this.unsigned);\n        else\n            return fromBits(high >>> (numBits - 32), 0, $this.unsigned);\n    }\n}\n;\n/**\n * Returns this Long with bits logically shifted to the right by the given amount. This is an alias of {@link Long#shiftRightUnsigned}.\n * @function\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Shifted Long\n */\n// LongPrototype.shru = LongPrototype.shiftRightUnsigned;\n/**\n * Returns this Long with bits logically shifted to the right by the given amount. This is an alias of {@link Long#shiftRightUnsigned}.\n * @function\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Shifted Long\n */\n// LongPrototype.shr_u = LongPrototype.shiftRightUnsigned;\n/**\n * Returns this Long with bits rotated to the left by the given amount.\n * @this {!Long}\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Rotated Long\n */\nexport const rotateLeft = function rotateLeft(numBits) {\n    var b;\n    if (isLong(numBits))\n        numBits = numBits.toInt();\n    if ((numBits &= 63) === 0)\n        return this;\n    if (numBits === 32)\n        return fromBits(this.high, this.low, this.unsigned);\n    if (numBits < 32) {\n        b = (32 - numBits);\n        return fromBits(((this.low << numBits) | (this.high >>> b)), ((this.high << numBits) | (this.low >>> b)), this.unsigned);\n    }\n    numBits -= 32;\n    b = (32 - numBits);\n    return fromBits(((this.high << numBits) | (this.low >>> b)), ((this.low << numBits) | (this.high >>> b)), this.unsigned);\n};\n/**\n * Returns this Long with bits rotated to the left by the given amount. This is an alias of {@link Long#rotateLeft}.\n * @function\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Rotated Long\n */\n// LongPrototype.rotl = LongPrototype.rotateLeft;\n/**\n * Returns this Long with bits rotated to the right by the given amount.\n * @this {!Long}\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Rotated Long\n */\nexport const rotateRight = function rotateRight(numBits) {\n    var b;\n    if (isLong(numBits))\n        numBits = numBits.toInt();\n    if ((numBits &= 63) === 0)\n        return this;\n    if (numBits === 32)\n        return fromBits(this.high, this.low, this.unsigned);\n    if (numBits < 32) {\n        b = (32 - numBits);\n        return fromBits(((this.high << b) | (this.low >>> numBits)), ((this.low << b) | (this.high >>> numBits)), this.unsigned);\n    }\n    numBits -= 32;\n    b = (32 - numBits);\n    return fromBits(((this.low << b) | (this.high >>> numBits)), ((this.high << b) | (this.low >>> numBits)), this.unsigned);\n};\n/**\n * Returns this Long with bits rotated to the right by the given amount. This is an alias of {@link Long#rotateRight}.\n * @function\n * @param {number|!Long} numBits Number of bits\n * @returns {!Long} Rotated Long\n */\n// LongPrototype.rotr = LongPrototype.rotateRight;\n/**\n * Converts this Long to signed.\n * @this {!Long}\n * @returns {!Long} Signed long\n */\nexport function toSigned($this) {\n    if (!$this.unsigned)\n        return $this;\n    return fromBits($this.low, $this.high, false);\n}\n;\n/**\n * Converts this Long to unsigned.\n * @this {!Long}\n * @returns {!Long} Unsigned long\n */\nexport function toUnsigned($this) {\n    if ($this.unsigned)\n        return $this;\n    return fromBits($this.low, $this.high, true);\n}\n;\n/**\n * Converts this Long to its byte representation.\n * @param {boolean=} le Whether little or big endian, defaults to big endian\n * @this {!Long}\n * @returns {!Array.<number>} Byte representation\n */\nexport function toBytes($this, le) {\n    return le ? toBytesLE($this) : toBytesBE($this);\n}\n;\n/**\n * Converts this Long to its little endian byte representation.\n * @this {!Long}\n * @returns {!Array.<number>} Little endian byte representation\n */\nexport function toBytesLE($this) {\n    var hi = $this.high, lo = $this.low;\n    return [\n        lo & 0xff,\n        lo >>> 8 & 0xff,\n        lo >>> 16 & 0xff,\n        lo >>> 24,\n        hi & 0xff,\n        hi >>> 8 & 0xff,\n        hi >>> 16 & 0xff,\n        hi >>> 24\n    ];\n}\n;\n/**\n * Converts this Long to its big endian byte representation.\n * @this {!Long}\n * @returns {!Array.<number>} Big endian byte representation\n */\nexport function toBytesBE($this) {\n    var hi = $this.high, lo = $this.low;\n    return [\n        hi >>> 24,\n        hi >>> 16 & 0xff,\n        hi >>> 8 & 0xff,\n        hi & 0xff,\n        lo >>> 24,\n        lo >>> 16 & 0xff,\n        lo >>> 8 & 0xff,\n        lo & 0xff\n    ];\n}\n;\n/**\n * Creates a Long from its byte representation.\n * @param {!Array.<number>} bytes Byte representation\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @param {boolean=} le Whether little or big endian, defaults to big endian\n * @returns {Long} The corresponding Long value\n */\nexport function fromBytes(bytes, unsigned, le) {\n    return le ? fromBytesLE(bytes, unsigned) : fromBytesBE(bytes, unsigned);\n}\n;\n/**\n * Creates a Long from its little endian byte representation.\n * @param {!Array.<number>} bytes Little endian byte representation\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @returns {Long} The corresponding Long value\n */\nexport function fromBytesLE(bytes, unsigned) {\n    return new Long(bytes[0] |\n        bytes[1] << 8 |\n        bytes[2] << 16 |\n        bytes[3] << 24, bytes[4] |\n        bytes[5] << 8 |\n        bytes[6] << 16 |\n        bytes[7] << 24, unsigned);\n}\n;\n/**\n * Creates a Long from its big endian byte representation.\n * @param {!Array.<number>} bytes Big endian byte representation\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n * @returns {Long} The corresponding Long value\n */\nexport function fromBytesBE(bytes, unsigned) {\n    return new Long(bytes[4] << 24 |\n        bytes[5] << 16 |\n        bytes[6] << 8 |\n        bytes[7], bytes[0] << 24 |\n        bytes[1] << 16 |\n        bytes[2] << 8 |\n        bytes[3], unsigned);\n}\n;\n","import { isValid } from \"./Int32.js\";\nimport * as LongLib from \"./lib/long.js\";\nexport default LongLib.Long;\nexport const get_Zero = LongLib.ZERO;\nexport const get_One = LongLib.ONE;\nexport const op_Addition = LongLib.add;\nexport const op_Subtraction = LongLib.subtract;\nexport const op_Multiply = LongLib.multiply;\nexport const op_Division = LongLib.divide;\nexport const op_Modulus = LongLib.modulo;\nexport const op_UnaryNegation = LongLib.negate;\nexport const op_LeftShift = LongLib.shiftLeft;\nexport const op_RightShift = LongLib.shiftRight;\nexport const op_RightShiftUnsigned = LongLib.shiftRightUnsigned;\nexport const op_BitwiseAnd = LongLib.and;\nexport const op_BitwiseOr = LongLib.or;\nexport const op_ExclusiveOr = LongLib.xor;\nexport const op_LogicalNot = LongLib.not;\nexport const op_LessThan = LongLib.lessThan;\nexport const op_LessThanOrEqual = LongLib.lessThanOrEqual;\nexport const op_GreaterThan = LongLib.greaterThan;\nexport const op_GreaterThanOrEqual = LongLib.greaterThanOrEqual;\nexport const op_Equality = LongLib.equals;\nexport const op_Inequality = LongLib.notEquals;\nexport const equals = LongLib.equals;\nexport const compare = LongLib.compare;\nexport const fromInt = LongLib.fromInt;\nexport const fromBits = LongLib.fromBits;\nexport const fromBytes = LongLib.fromBytes;\nexport const fromNumber = LongLib.fromNumber;\nexport const fromString = LongLib.fromString;\nexport const fromValue = LongLib.fromValue;\nexport const toInt = LongLib.toInt;\nexport const toBytes = LongLib.toBytes;\nexport const toNumber = LongLib.toNumber;\nexport const toString = LongLib.toString;\nexport const getLowBits = LongLib.getLowBits;\nexport const getHighBits = LongLib.getHighBits;\nexport const getLowBitsUnsigned = LongLib.getLowBitsUnsigned;\nexport const getHighBitsUnsigned = LongLib.getHighBitsUnsigned;\nfunction getMaxValue(unsigned, radix, isNegative) {\n    switch (radix) {\n        case 2: return unsigned ?\n            \"1111111111111111111111111111111111111111111111111111111111111111\" :\n            (isNegative ? \"1000000000000000000000000000000000000000000000000000000000000000\"\n                : \"111111111111111111111111111111111111111111111111111111111111111\");\n        case 8: return unsigned ?\n            \"1777777777777777777777\" :\n            (isNegative ? \"1000000000000000000000\" : \"777777777777777777777\");\n        case 10: return unsigned ?\n            \"18446744073709551615\" :\n            (isNegative ? \"9223372036854775808\" : \"9223372036854775807\");\n        case 16: return unsigned ?\n            \"FFFFFFFFFFFFFFFF\" :\n            (isNegative ? \"8000000000000000\" : \"7FFFFFFFFFFFFFFF\");\n        default: throw new Error(\"Invalid radix.\");\n    }\n}\nexport function abs(x) {\n    if (!x.unsigned && LongLib.isNegative(x)) {\n        return op_UnaryNegation(x);\n    }\n    else {\n        return x;\n    }\n}\nexport function fromInteger(value, unsigned, kind) {\n    let x = value;\n    let xh = 0;\n    switch (kind) {\n        case 0:\n            x = value << 24 >> 24;\n            xh = x;\n            break;\n        case 4:\n            x = value << 24 >>> 24;\n            break;\n        case 1:\n            x = value << 16 >> 16;\n            xh = x;\n            break;\n        case 5:\n            x = value << 16 >>> 16;\n            break;\n        case 2:\n            x = value >> 0;\n            xh = x;\n            break;\n        case 6:\n            x = value >>> 0;\n            break;\n    }\n    return LongLib.fromBits(x, xh >> 31, unsigned);\n}\nexport function parse(str, style, unsigned, _bitsize, radix) {\n    const res = isValid(str, style, radix);\n    if (res != null) {\n        const lessOrEqual = (x, y) => {\n            const len = Math.max(x.length, y.length);\n            return x.padStart(len, \"0\") <= y.padStart(len, \"0\");\n        };\n        const isNegative = res.sign === \"-\";\n        const maxValue = getMaxValue(unsigned || res.radix !== 10, res.radix, isNegative);\n        if (lessOrEqual(res.digits.toUpperCase(), maxValue)) {\n            str = isNegative ? res.sign + res.digits : res.digits;\n            return LongLib.fromString(str, unsigned, res.radix);\n        }\n    }\n    throw new Error(\"Input string was not in a correct format.\");\n}\nexport function tryParse(str, style, unsigned, bitsize, defValue) {\n    try {\n        defValue.contents = parse(str, style, unsigned, bitsize);\n        return true;\n    }\n    catch (_a) {\n        return false;\n    }\n}\nexport function unixEpochMillisecondsToTicks(ms, offset) {\n    return op_Multiply(op_Addition(op_Addition(LongLib.fromNumber(ms), 62135596800000), offset), 10000);\n}\nexport function ticksToUnixEpochMilliseconds(ticks) {\n    return LongLib.toNumber(op_Subtraction(op_Division(ticks, 10000), 62135596800000));\n}\n// export function makeRangeStepFunction(step: Long, last: Long, unsigned: boolean) {\n//   const stepComparedWithZero = LongLib.compare(step, unsigned ? LongLib.UZERO : LongLib.ZERO);\n//   if (stepComparedWithZero === 0) {\n//     throw new Error(\"The step of a range cannot be zero\");\n//   }\n//   const stepGreaterThanZero = stepComparedWithZero > 0;\n//   return (x: Long) => {\n//     const comparedWithLast = LongLib.compare(x, last);\n//     if ((stepGreaterThanZero && comparedWithLast <= 0)\n//       || (!stepGreaterThanZero && comparedWithLast >= 0)) {\n//       return [x, op_Addition(x, step)];\n//     } else {\n//       return undefined;\n//     }\n//   };\n// }\n","// tslint:disable:ban-types\nexport function isIterable(x) {\n    return x != null && typeof x === \"object\" && Symbol.iterator in x;\n}\nexport function isArrayLike(x) {\n    return Array.isArray(x) || ArrayBuffer.isView(x);\n}\nfunction isComparer(x) {\n    return typeof x.Compare === \"function\";\n}\nfunction isComparable(x) {\n    return typeof x.CompareTo === \"function\";\n}\nfunction isEquatable(x) {\n    return typeof x.Equals === \"function\";\n}\nfunction isHashable(x) {\n    return typeof x.GetHashCode === \"function\";\n}\nexport function isDisposable(x) {\n    return x != null && typeof x.Dispose === \"function\";\n}\nexport function sameConstructor(x, y) {\n    return Object.getPrototypeOf(x).constructor === Object.getPrototypeOf(y).constructor;\n}\nexport class Enumerator {\n    constructor(iter) {\n        this.iter = iter;\n    }\n    [\"System.Collections.Generic.IEnumerator`1.get_Current\"]() {\n        return this.current;\n    }\n    [\"System.Collections.IEnumerator.get_Current\"]() {\n        return this.current;\n    }\n    [\"System.Collections.IEnumerator.MoveNext\"]() {\n        const cur = this.iter.next();\n        this.current = cur.value;\n        return !cur.done;\n    }\n    [\"System.Collections.IEnumerator.Reset\"]() {\n        throw new Error(\"JS iterators cannot be reset\");\n    }\n    Dispose() {\n        return;\n    }\n}\nexport function getEnumerator(o) {\n    return typeof o.GetEnumerator === \"function\"\n        ? o.GetEnumerator()\n        : new Enumerator(o[Symbol.iterator]());\n}\nexport function toIterator(en) {\n    return {\n        [Symbol.iterator]() { return this; },\n        next() {\n            const hasNext = en[\"System.Collections.IEnumerator.MoveNext\"]();\n            const current = hasNext ? en[\"System.Collections.IEnumerator.get_Current\"]() : undefined;\n            return { done: !hasNext, value: current };\n        },\n    };\n}\nexport class Comparer {\n    constructor(f) {\n        this.Compare = f || compare;\n    }\n}\nexport function comparerFromEqualityComparer(comparer) {\n    // Sometimes IEqualityComparer also implements IComparer\n    if (isComparer(comparer)) {\n        return new Comparer(comparer.Compare);\n    }\n    else {\n        return new Comparer((x, y) => {\n            const xhash = comparer.GetHashCode(x);\n            const yhash = comparer.GetHashCode(y);\n            if (xhash === yhash) {\n                return comparer.Equals(x, y) ? 0 : -1;\n            }\n            else {\n                return xhash < yhash ? -1 : 1;\n            }\n        });\n    }\n}\nexport function assertEqual(actual, expected, msg) {\n    if (!equals(actual, expected)) {\n        throw Object.assign(new Error(msg || `Expected: ${expected} - Actual: ${actual}`), {\n            actual,\n            expected,\n        });\n    }\n}\nexport function assertNotEqual(actual, expected, msg) {\n    if (equals(actual, expected)) {\n        throw Object.assign(new Error(msg || `Expected: ${expected} - Actual: ${actual}`), {\n            actual,\n            expected,\n        });\n    }\n}\nexport class Lazy {\n    constructor(factory) {\n        this.factory = factory;\n        this.isValueCreated = false;\n    }\n    get Value() {\n        if (!this.isValueCreated) {\n            this.createdValue = this.factory();\n            this.isValueCreated = true;\n        }\n        return this.createdValue;\n    }\n    get IsValueCreated() {\n        return this.isValueCreated;\n    }\n}\nexport function lazyFromValue(v) {\n    return new Lazy(() => v);\n}\nexport function padWithZeros(i, length) {\n    let str = i.toString(10);\n    while (str.length < length) {\n        str = \"0\" + str;\n    }\n    return str;\n}\nexport function padLeftAndRightWithZeros(i, lengthLeft, lengthRight) {\n    let str = i.toString(10);\n    while (str.length < lengthLeft) {\n        str = \"0\" + str;\n    }\n    while (str.length < lengthRight) {\n        str = str + \"0\";\n    }\n    return str;\n}\nexport function dateOffset(date) {\n    const date1 = date;\n    return typeof date1.offset === \"number\"\n        ? date1.offset\n        : (date.kind === 1 /* UTC */\n            ? 0 : date.getTimezoneOffset() * -60000);\n}\nexport function int16ToString(i, radix) {\n    i = i < 0 && radix != null && radix !== 10 ? 0xFFFF + i + 1 : i;\n    return i.toString(radix);\n}\nexport function int32ToString(i, radix) {\n    i = i < 0 && radix != null && radix !== 10 ? 0xFFFFFFFF + i + 1 : i;\n    return i.toString(radix);\n}\nexport class ObjectRef {\n    static id(o) {\n        if (!ObjectRef.idMap.has(o)) {\n            ObjectRef.idMap.set(o, ++ObjectRef.count);\n        }\n        return ObjectRef.idMap.get(o);\n    }\n}\nObjectRef.idMap = new WeakMap();\nObjectRef.count = 0;\nexport function stringHash(s) {\n    let i = 0;\n    let h = 5381;\n    const len = s.length;\n    while (i < len) {\n        h = (h * 33) ^ s.charCodeAt(i++);\n    }\n    return h;\n}\nexport function numberHash(x) {\n    return x * 2654435761 | 0;\n}\n// From https://stackoverflow.com/a/37449594\nexport function combineHashCodes(hashes) {\n    if (hashes.length === 0) {\n        return 0;\n    }\n    return hashes.reduce((h1, h2) => {\n        return ((h1 << 5) + h1) ^ h2;\n    });\n}\nexport function physicalHash(x) {\n    if (x == null) {\n        return 0;\n    }\n    switch (typeof x) {\n        case \"boolean\":\n            return x ? 1 : 0;\n        case \"number\":\n            return numberHash(x);\n        case \"string\":\n            return stringHash(x);\n        default:\n            return numberHash(ObjectRef.id(x));\n    }\n}\nexport function identityHash(x) {\n    if (x == null) {\n        return 0;\n    }\n    else if (isHashable(x)) {\n        return x.GetHashCode();\n    }\n    else {\n        return physicalHash(x);\n    }\n}\nexport function dateHash(x) {\n    return x.getTime();\n}\nexport function arrayHash(x) {\n    const len = x.length;\n    const hashes = new Array(len);\n    for (let i = 0; i < len; i++) {\n        hashes[i] = structuralHash(x[i]);\n    }\n    return combineHashCodes(hashes);\n}\nexport function structuralHash(x) {\n    if (x == null) {\n        return 0;\n    }\n    switch (typeof x) {\n        case \"boolean\":\n            return x ? 1 : 0;\n        case \"number\":\n            return numberHash(x);\n        case \"string\":\n            return stringHash(x);\n        default: {\n            if (isHashable(x)) {\n                return x.GetHashCode();\n            }\n            else if (isArrayLike(x)) {\n                return arrayHash(x);\n            }\n            else if (x instanceof Date) {\n                return dateHash(x);\n            }\n            else if (Object.getPrototypeOf(x).constructor === Object) {\n                // TODO: check call-stack to prevent cyclic objects?\n                const hashes = Object.values(x).map((v) => structuralHash(v));\n                return combineHashCodes(hashes);\n            }\n            else {\n                // Classes don't implement GetHashCode by default, but must use identity hashing\n                return numberHash(ObjectRef.id(x));\n                // return stringHash(String(x));\n            }\n        }\n    }\n}\n// Intended for custom numeric types, like long or decimal\nexport function fastStructuralHash(x) {\n    return stringHash(String(x));\n}\n// Intended for declared types that may or may not implement GetHashCode\nexport function safeHash(x) {\n    return x == null ? 0 : isHashable(x) ? x.GetHashCode() : numberHash(ObjectRef.id(x));\n}\nexport function equalArraysWith(x, y, eq) {\n    if (x == null) {\n        return y == null;\n    }\n    if (y == null) {\n        return false;\n    }\n    if (x.length !== y.length) {\n        return false;\n    }\n    for (let i = 0; i < x.length; i++) {\n        if (!eq(x[i], y[i])) {\n            return false;\n        }\n    }\n    return true;\n}\nexport function equalArrays(x, y) {\n    return equalArraysWith(x, y, equals);\n}\nfunction equalObjects(x, y) {\n    const xKeys = Object.keys(x);\n    const yKeys = Object.keys(y);\n    if (xKeys.length !== yKeys.length) {\n        return false;\n    }\n    xKeys.sort();\n    yKeys.sort();\n    for (let i = 0; i < xKeys.length; i++) {\n        if (xKeys[i] !== yKeys[i] || !equals(x[xKeys[i]], y[yKeys[i]])) {\n            return false;\n        }\n    }\n    return true;\n}\nexport function equals(x, y) {\n    if (x === y) {\n        return true;\n    }\n    else if (x == null) {\n        return y == null;\n    }\n    else if (y == null) {\n        return false;\n    }\n    else if (typeof x !== \"object\") {\n        return false;\n    }\n    else if (isEquatable(x)) {\n        return x.Equals(y);\n    }\n    else if (isArrayLike(x)) {\n        return isArrayLike(y) && equalArrays(x, y);\n    }\n    else if (x instanceof Date) {\n        return (y instanceof Date) && compareDates(x, y) === 0;\n    }\n    else {\n        return Object.getPrototypeOf(x).constructor === Object && equalObjects(x, y);\n    }\n}\nexport function compareDates(x, y) {\n    let xtime;\n    let ytime;\n    // DateTimeOffset and DateTime deals with equality differently.\n    if (\"offset\" in x && \"offset\" in y) {\n        xtime = x.getTime();\n        ytime = y.getTime();\n    }\n    else {\n        xtime = x.getTime() + dateOffset(x);\n        ytime = y.getTime() + dateOffset(y);\n    }\n    return xtime === ytime ? 0 : (xtime < ytime ? -1 : 1);\n}\nexport function comparePrimitives(x, y) {\n    return x === y ? 0 : (x < y ? -1 : 1);\n}\nexport function compareArraysWith(x, y, comp) {\n    if (x == null) {\n        return y == null ? 0 : 1;\n    }\n    if (y == null) {\n        return -1;\n    }\n    if (x.length !== y.length) {\n        return x.length < y.length ? -1 : 1;\n    }\n    for (let i = 0, j = 0; i < x.length; i++) {\n        j = comp(x[i], y[i]);\n        if (j !== 0) {\n            return j;\n        }\n    }\n    return 0;\n}\nexport function compareArrays(x, y) {\n    return compareArraysWith(x, y, compare);\n}\nfunction compareObjects(x, y) {\n    const xKeys = Object.keys(x);\n    const yKeys = Object.keys(y);\n    if (xKeys.length !== yKeys.length) {\n        return xKeys.length < yKeys.length ? -1 : 1;\n    }\n    xKeys.sort();\n    yKeys.sort();\n    for (let i = 0, j = 0; i < xKeys.length; i++) {\n        const key = xKeys[i];\n        if (key !== yKeys[i]) {\n            return key < yKeys[i] ? -1 : 1;\n        }\n        else {\n            j = compare(x[key], y[key]);\n            if (j !== 0) {\n                return j;\n            }\n        }\n    }\n    return 0;\n}\nexport function compare(x, y) {\n    if (x === y) {\n        return 0;\n    }\n    else if (x == null) {\n        return y == null ? 0 : -1;\n    }\n    else if (y == null) {\n        return 1;\n    }\n    else if (typeof x !== \"object\") {\n        return x < y ? -1 : 1;\n    }\n    else if (isComparable(x)) {\n        return x.CompareTo(y);\n    }\n    else if (isArrayLike(x)) {\n        return isArrayLike(y) ? compareArrays(x, y) : -1;\n    }\n    else if (x instanceof Date) {\n        return y instanceof Date ? compareDates(x, y) : -1;\n    }\n    else {\n        return Object.getPrototypeOf(x).constructor === Object ? compareObjects(x, y) : -1;\n    }\n}\nexport function min(comparer, x, y) {\n    return comparer(x, y) < 0 ? x : y;\n}\nexport function max(comparer, x, y) {\n    return comparer(x, y) > 0 ? x : y;\n}\nexport function clamp(comparer, value, min, max) {\n    return (comparer(value, min) < 0) ? min : (comparer(value, max) > 0) ? max : value;\n}\nexport function createAtom(value) {\n    let atom = value;\n    return (value, isSetter) => {\n        if (!isSetter) {\n            return atom;\n        }\n        else {\n            atom = value;\n            return void 0;\n        }\n    };\n}\nexport function createObj(fields) {\n    const obj = {};\n    for (const kv of fields) {\n        obj[kv[0]] = kv[1];\n    }\n    return obj;\n}\nexport function jsOptions(mutator) {\n    const opts = {};\n    mutator(opts);\n    return opts;\n}\nexport function round(value, digits = 0) {\n    const m = Math.pow(10, digits);\n    const n = +(digits ? value * m : value).toFixed(8);\n    const i = Math.floor(n);\n    const f = n - i;\n    const e = 1e-8;\n    const r = (f > 0.5 - e && f < 0.5 + e) ? ((i % 2 === 0) ? i : i + 1) : Math.round(n);\n    return digits ? r / m : r;\n}\nexport function sign(x) {\n    return x > 0 ? 1 : x < 0 ? -1 : 0;\n}\nexport function randomNext(min, max) {\n    return Math.floor(Math.random() * (max - min)) + min;\n}\nexport function randomBytes(buffer) {\n    if (buffer == null) {\n        throw new Error(\"Buffer cannot be null\");\n    }\n    for (let i = 0; i < buffer.length; i += 6) {\n        // Pick random 48-bit number. Fill buffer in 2 24-bit chunks to avoid bitwise truncation.\n        let r = Math.floor(Math.random() * 281474976710656); // Low 24 bits = chunk 1.\n        const rhi = Math.floor(r / 16777216); // High 24 bits shifted via division = chunk 2.\n        for (let j = 0; j < 6 && i + j < buffer.length; j++) {\n            if (j === 3) {\n                r = rhi;\n            }\n            buffer[i + j] = r & 255;\n            r >>>= 8;\n        }\n    }\n}\nexport function unescapeDataString(s) {\n    // https://stackoverflow.com/a/4458580/524236\n    return decodeURIComponent((s).replace(/\\+/g, \"%20\"));\n}\nexport function escapeDataString(s) {\n    return encodeURIComponent(s).replace(/!/g, \"%21\")\n        .replace(/'/g, \"%27\")\n        .replace(/\\(/g, \"%28\")\n        .replace(/\\)/g, \"%29\")\n        .replace(/\\*/g, \"%2A\");\n}\nexport function escapeUriString(s) {\n    return encodeURI(s);\n}\n// ICollection.Clear and Count members can be called on Arrays\n// or Dictionaries so we need a runtime check (see #1120)\nexport function count(col) {\n    if (isArrayLike(col)) {\n        return col.length;\n    }\n    else {\n        let count = 0;\n        for (const _ of col) {\n            count++;\n        }\n        return count;\n    }\n}\nexport function clear(col) {\n    if (isArrayLike(col)) {\n        col.splice(0);\n    }\n    else {\n        col.clear();\n    }\n}\nconst CURRIED_KEY = \"__CURRIED__\";\nexport function uncurry(arity, f) {\n    // f may be a function option with None value\n    if (f == null || f.length > 1) {\n        return f;\n    }\n    let uncurriedFn;\n    switch (arity) {\n        case 2:\n            uncurriedFn = (a1, a2) => f(a1)(a2);\n            break;\n        case 3:\n            uncurriedFn = (a1, a2, a3) => f(a1)(a2)(a3);\n            break;\n        case 4:\n            uncurriedFn = (a1, a2, a3, a4) => f(a1)(a2)(a3)(a4);\n            break;\n        case 5:\n            uncurriedFn = (a1, a2, a3, a4, a5) => f(a1)(a2)(a3)(a4)(a5);\n            break;\n        case 6:\n            uncurriedFn = (a1, a2, a3, a4, a5, a6) => f(a1)(a2)(a3)(a4)(a5)(a6);\n            break;\n        case 7:\n            uncurriedFn = (a1, a2, a3, a4, a5, a6, a7) => f(a1)(a2)(a3)(a4)(a5)(a6)(a7);\n            break;\n        case 8:\n            uncurriedFn = (a1, a2, a3, a4, a5, a6, a7, a8) => f(a1)(a2)(a3)(a4)(a5)(a6)(a7)(a8);\n            break;\n        default:\n            throw new Error(\"Uncurrying to more than 8-arity is not supported: \" + arity);\n    }\n    uncurriedFn[CURRIED_KEY] = f;\n    return uncurriedFn;\n}\nexport function curry(arity, f) {\n    if (f == null || f.length === 1) {\n        return f;\n    }\n    if (CURRIED_KEY in f) {\n        return f[CURRIED_KEY];\n    }\n    switch (arity) {\n        case 2:\n            return (a1) => (a2) => f(a1, a2);\n        case 3:\n            return (a1) => (a2) => (a3) => f(a1, a2, a3);\n        case 4:\n            return (a1) => (a2) => (a3) => (a4) => f(a1, a2, a3, a4);\n        case 5:\n            return (a1) => (a2) => (a3) => (a4) => (a5) => f(a1, a2, a3, a4, a5);\n        case 6:\n            return (a1) => (a2) => (a3) => (a4) => (a5) => (a6) => f(a1, a2, a3, a4, a5, a6);\n        case 7:\n            return (a1) => (a2) => (a3) => (a4) => (a5) => (a6) => (a7) => f(a1, a2, a3, a4, a5, a6, a7);\n        case 8:\n            return (a1) => (a2) => (a3) => (a4) => (a5) => (a6) => (a7) => (a8) => f(a1, a2, a3, a4, a5, a6, a7, a8);\n        default:\n            throw new Error(\"Currying to more than 8-arity is not supported: \" + arity);\n    }\n}\nexport function checkArity(arity, f) {\n    return f.length > arity\n        ? (...args1) => (...args2) => f.apply(undefined, args1.concat(args2))\n        : f;\n}\nexport function partialApply(arity, f, args) {\n    if (f == null) {\n        return undefined;\n    }\n    else if (CURRIED_KEY in f) {\n        f = f[CURRIED_KEY];\n        for (let i = 0; i < args.length; i++) {\n            f = f(args[i]);\n        }\n        return f;\n    }\n    else {\n        switch (arity) {\n            case 1:\n                // Wrap arguments to make sure .concat doesn't destruct arrays. Example\n                // [1,2].concat([3,4],5)   --> [1,2,3,4,5]    // fails\n                // [1,2].concat([[3,4],5]) --> [1,2,[3,4],5]  // ok\n                return (a1) => f.apply(undefined, args.concat([a1]));\n            case 2:\n                return (a1) => (a2) => f.apply(undefined, args.concat([a1, a2]));\n            case 3:\n                return (a1) => (a2) => (a3) => f.apply(undefined, args.concat([a1, a2, a3]));\n            case 4:\n                return (a1) => (a2) => (a3) => (a4) => f.apply(undefined, args.concat([a1, a2, a3, a4]));\n            case 5:\n                return (a1) => (a2) => (a3) => (a4) => (a5) => f.apply(undefined, args.concat([a1, a2, a3, a4, a5]));\n            case 6:\n                return (a1) => (a2) => (a3) => (a4) => (a5) => (a6) => f.apply(undefined, args.concat([a1, a2, a3, a4, a5, a6]));\n            case 7:\n                return (a1) => (a2) => (a3) => (a4) => (a5) => (a6) => (a7) => f.apply(undefined, args.concat([a1, a2, a3, a4, a5, a6, a7]));\n            case 8:\n                return (a1) => (a2) => (a3) => (a4) => (a5) => (a6) => (a7) => (a8) => f.apply(undefined, args.concat([a1, a2, a3, a4, a5, a6, a7, a8]));\n            default:\n                throw new Error(\"Partially applying to more than 8-arity is not supported: \" + arity);\n        }\n    }\n}\nexport function mapCurriedArgs(fn, mappings) {\n    function mapArg(fn, arg, mappings, idx) {\n        const mapping = mappings[idx];\n        if (mapping !== 0) {\n            const expectedArity = mapping[0];\n            const actualArity = mapping[1];\n            if (expectedArity > 1) {\n                arg = curry(expectedArity, arg);\n            }\n            if (actualArity > 1) {\n                arg = uncurry(actualArity, arg);\n            }\n        }\n        const res = fn(arg);\n        if (idx + 1 === mappings.length) {\n            return res;\n        }\n        else {\n            return (arg) => mapArg(res, arg, mappings, idx + 1);\n        }\n    }\n    return (arg) => mapArg(fn, arg, mappings, 0);\n}\n","export function create(pattern, options = 0) {\n    // Supported RegexOptions\n    // * IgnoreCase:  0x0001\n    // * Multiline:   0x0002\n    // * Singleline:  0x0010\n    // * ECMAScript:  0x0100 (ignored)\n    if ((options & ~(1 ^ 2 ^ 16 ^ 256)) !== 0) {\n        throw new Error(\"RegexOptions only supports: IgnoreCase, Multiline, Singleline and ECMAScript\");\n    }\n    let flags = \"g\";\n    flags += options & 1 ? \"i\" : \"\"; // 0x0001 RegexOptions.IgnoreCase\n    flags += options & 2 ? \"m\" : \"\";\n    flags += options & 16 ? \"s\" : \"\";\n    return new RegExp(pattern, flags);\n}\n// From http://stackoverflow.com/questions/3446170/escape-string-for-use-in-javascript-regex\nexport function escape(str) {\n    return str.replace(/[\\-\\[\\]\\/\\{\\}\\(\\)\\*\\+\\?\\.\\\\\\^\\$\\|]/g, \"\\\\$&\");\n}\nexport function unescape(str) {\n    return str.replace(/\\\\([\\-\\[\\]\\/\\{\\}\\(\\)\\*\\+\\?\\.\\\\\\^\\$\\|])/g, \"$1\");\n}\nexport function isMatch(str, pattern, options = 0) {\n    let reg;\n    reg = str instanceof RegExp\n        ? (reg = str, str = pattern, reg.lastIndex = options, reg)\n        : reg = create(pattern, options);\n    return reg.test(str);\n}\nexport function match(str, pattern, options = 0) {\n    let reg;\n    reg = str instanceof RegExp\n        ? (reg = str, str = pattern, reg.lastIndex = options, reg)\n        : reg = create(pattern, options);\n    return reg.exec(str);\n}\nexport function matches(str, pattern, options = 0) {\n    let reg;\n    reg = str instanceof RegExp\n        ? (reg = str, str = pattern, reg.lastIndex = options, reg)\n        : reg = create(pattern, options);\n    if (!reg.global) {\n        throw new Error(\"Non-global RegExp\"); // Prevent infinite loop\n    }\n    let m = reg.exec(str);\n    const matches = [];\n    while (m !== null) {\n        matches.push(m);\n        m = reg.exec(str);\n    }\n    return matches;\n}\nexport function options(reg) {\n    let options = 256; // ECMAScript\n    options |= reg.ignoreCase ? 1 : 0;\n    options |= reg.multiline ? 2 : 0;\n    return options;\n}\nexport function replace(reg, input, replacement, limit, offset = 0) {\n    function replacer() {\n        let res = arguments[0];\n        if (limit) {\n            limit--;\n            const match = [];\n            const len = arguments.length;\n            // arguments: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/replace#specifying_a_function_as_a_parameter\n            // * match: matched substring\n            // * p1, p2, ...: nth capture group string\n            // * offset: offset of matched substring\n            // * string: whole string examined\n            // * groups: named capturing groups\n            //           ONLY if regex contains a named capture group AND browser supports named groups\n            // -> last element can be groups OR input string\n            // -> check if last element is string\n            const withGroups = typeof arguments[len - 1] !== \"string\";\n            let pLast = withGroups ? len - 3 : len - 2;\n            for (let i = 0; i < pLast; i++) {\n                match.push(arguments[i]);\n            }\n            match.index = arguments[pLast++];\n            match.input = arguments[pLast++];\n            if (withGroups) {\n                match.groups = arguments[pLast];\n            }\n            res = replacement(match);\n        }\n        return res;\n    }\n    if (typeof reg === \"string\") {\n        const tmp = reg;\n        reg = create(input, limit !== null && limit !== void 0 ? limit : 0);\n        input = tmp;\n        limit = undefined;\n    }\n    if (typeof replacement === \"function\") {\n        limit = limit == null ? -1 : limit;\n        return input.substring(0, offset) + input.substring(offset).replace(reg, replacer);\n    }\n    else {\n        replacement =\n            replacement\n                // $0 doesn't work with JS regex, see #1155\n                .replace(/\\$0/g, (_s) => \"$&\")\n                // named groups in replacement are `${name}` in .Net, but `$<name>` in JS (in regex: groups are `(?<name>...)` in both)\n                .replace(/\\${([^}]+)}/g, \"\\$<$1>\");\n        if (limit != null) {\n            let m;\n            const sub1 = input.substring(offset);\n            const _matches = matches(reg, sub1);\n            const sub2 = matches.length > limit ? (m = _matches[limit - 1], sub1.substring(0, m.index + m[0].length)) : sub1;\n            return input.substring(0, offset) + sub2.replace(reg, replacement)\n                + input.substring(offset + sub2.length);\n        }\n        else {\n            return input.replace(reg, replacement);\n        }\n    }\n}\nexport function split(reg, input, limit, offset = 0) {\n    if (typeof reg === \"string\") {\n        const tmp = reg;\n        reg = create(input, limit !== null && limit !== void 0 ? limit : 0);\n        input = tmp;\n        limit = undefined;\n    }\n    input = input.substring(offset);\n    return input.split(reg, limit);\n}\n","import { toString as dateToString } from \"./Date.js\";\nimport { compare as numericCompare, isNumeric, multiply, toExponential, toFixed, toHex, toPrecision } from \"./Numeric.js\";\nimport { escape } from \"./RegExp.js\";\nimport { toString } from \"./Types.js\";\nconst fsFormatRegExp = /(^|[^%])%([0+\\- ]*)(\\*|\\d+)?(?:\\.(\\d+))?(\\w)/g;\nconst interpolateRegExp = /(?:(^|[^%])%([0+\\- ]*)(\\d+)?(?:\\.(\\d+))?(\\w))?%P\\(\\)/g;\nconst formatRegExp = /\\{(\\d+)(,-?\\d+)?(?:\\:([a-zA-Z])(\\d{0,2})|\\:(.+?))?\\}/g;\nfunction isLessThan(x, y) {\n    return numericCompare(x, y) < 0;\n}\nfunction cmp(x, y, ic) {\n    function isIgnoreCase(i) {\n        return i === true ||\n            i === 1 /* CurrentCultureIgnoreCase */ ||\n            i === 3 /* InvariantCultureIgnoreCase */ ||\n            i === 5 /* OrdinalIgnoreCase */;\n    }\n    function isOrdinal(i) {\n        return i === 4 /* Ordinal */ ||\n            i === 5 /* OrdinalIgnoreCase */;\n    }\n    if (x == null) {\n        return y == null ? 0 : -1;\n    }\n    if (y == null) {\n        return 1;\n    } // everything is bigger than null\n    if (isOrdinal(ic)) {\n        if (isIgnoreCase(ic)) {\n            x = x.toLowerCase();\n            y = y.toLowerCase();\n        }\n        return (x === y) ? 0 : (x < y ? -1 : 1);\n    }\n    else {\n        if (isIgnoreCase(ic)) {\n            x = x.toLocaleLowerCase();\n            y = y.toLocaleLowerCase();\n        }\n        return x.localeCompare(y);\n    }\n}\nexport function compare(...args) {\n    switch (args.length) {\n        case 2: return cmp(args[0], args[1], false);\n        case 3: return cmp(args[0], args[1], args[2]);\n        case 4: return cmp(args[0], args[1], args[2] === true);\n        case 5: return cmp(args[0].substr(args[1], args[4]), args[2].substr(args[3], args[4]), false);\n        case 6: return cmp(args[0].substr(args[1], args[4]), args[2].substr(args[3], args[4]), args[5]);\n        case 7: return cmp(args[0].substr(args[1], args[4]), args[2].substr(args[3], args[4]), args[5] === true);\n        default: throw new Error(\"String.compare: Unsupported number of parameters\");\n    }\n}\nexport function compareOrdinal(x, y) {\n    return cmp(x, y, 4 /* Ordinal */);\n}\nexport function compareTo(x, y) {\n    return cmp(x, y, 0 /* CurrentCulture */);\n}\nexport function startsWith(str, pattern, ic) {\n    if (str.length >= pattern.length) {\n        return cmp(str.substr(0, pattern.length), pattern, ic) === 0;\n    }\n    return false;\n}\nexport function indexOfAny(str, anyOf, ...args) {\n    if (str == null || str === \"\") {\n        return -1;\n    }\n    const startIndex = (args.length > 0) ? args[0] : 0;\n    if (startIndex < 0) {\n        throw new Error(\"Start index cannot be negative\");\n    }\n    const length = (args.length > 1) ? args[1] : str.length - startIndex;\n    if (length < 0) {\n        throw new Error(\"Length cannot be negative\");\n    }\n    if (length > str.length - startIndex) {\n        throw new Error(\"Invalid startIndex and length\");\n    }\n    str = str.substr(startIndex, length);\n    for (const c of anyOf) {\n        const index = str.indexOf(c);\n        if (index > -1) {\n            return index + startIndex;\n        }\n    }\n    return -1;\n}\nexport function printf(input) {\n    return {\n        input,\n        cont: fsFormat(input),\n    };\n}\nexport function interpolate(str, values) {\n    let valIdx = 0;\n    let strIdx = 0;\n    let result = \"\";\n    interpolateRegExp.lastIndex = 0;\n    let match = interpolateRegExp.exec(str);\n    while (match) {\n        // The first group corresponds to the no-escape char (^|[^%]), the actual pattern starts in the next char\n        // Note: we don't use negative lookbehind because some browsers don't support it yet\n        const matchIndex = match.index + (match[1] || \"\").length;\n        result += str.substring(strIdx, matchIndex).replace(/%%/g, \"%\");\n        const [, , flags, padLength, precision, format] = match;\n        result += formatReplacement(values[valIdx++], flags, padLength, precision, format);\n        strIdx = interpolateRegExp.lastIndex;\n        // Likewise we need to move interpolateRegExp.lastIndex one char behind to make sure we match the no-escape char next time\n        interpolateRegExp.lastIndex -= 1;\n        match = interpolateRegExp.exec(str);\n    }\n    result += str.substring(strIdx).replace(/%%/g, \"%\");\n    return result;\n}\nfunction continuePrint(cont, arg) {\n    return typeof arg === \"string\" ? cont(arg) : arg.cont(cont);\n}\nexport function toConsole(arg) {\n    // Don't remove the lambda here, see #1357\n    return continuePrint((x) => console.log(x), arg);\n}\nexport function toConsoleError(arg) {\n    return continuePrint((x) => console.error(x), arg);\n}\nexport function toText(arg) {\n    return continuePrint((x) => x, arg);\n}\nexport function toFail(arg) {\n    return continuePrint((x) => {\n        throw new Error(x);\n    }, arg);\n}\nfunction formatReplacement(rep, flags, padLength, precision, format) {\n    let sign = \"\";\n    flags = flags || \"\";\n    format = format || \"\";\n    if (isNumeric(rep)) {\n        if (format.toLowerCase() !== \"x\") {\n            if (isLessThan(rep, 0)) {\n                rep = multiply(rep, -1);\n                sign = \"-\";\n            }\n            else {\n                if (flags.indexOf(\" \") >= 0) {\n                    sign = \" \";\n                }\n                else if (flags.indexOf(\"+\") >= 0) {\n                    sign = \"+\";\n                }\n            }\n        }\n        precision = precision == null ? null : parseInt(precision, 10);\n        switch (format) {\n            case \"f\":\n            case \"F\":\n                precision = precision != null ? precision : 6;\n                rep = toFixed(rep, precision);\n                break;\n            case \"g\":\n            case \"G\":\n                rep = precision != null ? toPrecision(rep, precision) : toPrecision(rep);\n                break;\n            case \"e\":\n            case \"E\":\n                rep = precision != null ? toExponential(rep, precision) : toExponential(rep);\n                break;\n            case \"x\":\n                rep = toHex(rep);\n                break;\n            case \"X\":\n                rep = toHex(rep).toUpperCase();\n                break;\n            default: // AOid\n                rep = String(rep);\n                break;\n        }\n    }\n    else if (rep instanceof Date) {\n        rep = dateToString(rep);\n    }\n    else {\n        rep = toString(rep);\n    }\n    padLength = typeof padLength === \"number\" ? padLength : parseInt(padLength, 10);\n    if (!isNaN(padLength)) {\n        const zeroFlag = flags.indexOf(\"0\") >= 0; // Use '0' for left padding\n        const minusFlag = flags.indexOf(\"-\") >= 0; // Right padding\n        const ch = minusFlag || !zeroFlag ? \" \" : \"0\";\n        if (ch === \"0\") {\n            rep = padLeft(rep, padLength - sign.length, ch, minusFlag);\n            rep = sign + rep;\n        }\n        else {\n            rep = padLeft(sign + rep, padLength, ch, minusFlag);\n        }\n    }\n    else {\n        rep = sign + rep;\n    }\n    return rep;\n}\nfunction createPrinter(cont, _strParts, _matches, _result = \"\", padArg = -1) {\n    return (...args) => {\n        // Make copies of the values passed by reference because the function can be used multiple times\n        let result = _result;\n        const strParts = _strParts.slice();\n        const matches = _matches.slice();\n        for (const arg of args) {\n            const [, , flags, _padLength, precision, format] = matches[0];\n            let padLength = _padLength;\n            if (padArg >= 0) {\n                padLength = padArg;\n                padArg = -1;\n            }\n            else if (padLength === \"*\") {\n                if (arg < 0) {\n                    throw new Error(\"Non-negative number required\");\n                }\n                padArg = arg;\n                continue;\n            }\n            result += strParts[0];\n            result += formatReplacement(arg, flags, padLength, precision, format);\n            strParts.splice(0, 1);\n            matches.splice(0, 1);\n        }\n        if (matches.length === 0) {\n            result += strParts[0];\n            return cont(result);\n        }\n        else {\n            return createPrinter(cont, strParts, matches, result, padArg);\n        }\n    };\n}\nexport function fsFormat(str) {\n    return (cont) => {\n        fsFormatRegExp.lastIndex = 0;\n        const strParts = [];\n        const matches = [];\n        let strIdx = 0;\n        let match = fsFormatRegExp.exec(str);\n        while (match) {\n            // The first group corresponds to the no-escape char (^|[^%]), the actual pattern starts in the next char\n            // Note: we don't use negative lookbehind because some browsers don't support it yet\n            const matchIndex = match.index + (match[1] || \"\").length;\n            strParts.push(str.substring(strIdx, matchIndex).replace(/%%/g, \"%\"));\n            matches.push(match);\n            strIdx = fsFormatRegExp.lastIndex;\n            // Likewise we need to move fsFormatRegExp.lastIndex one char behind to make sure we match the no-escape char next time\n            fsFormatRegExp.lastIndex -= 1;\n            match = fsFormatRegExp.exec(str);\n        }\n        if (strParts.length === 0) {\n            return cont(str.replace(/%%/g, \"%\"));\n        }\n        else {\n            strParts.push(str.substring(strIdx).replace(/%%/g, \"%\"));\n            return createPrinter(cont, strParts, matches);\n        }\n    };\n}\nexport function format(str, ...args) {\n    if (typeof str === \"object\" && args.length > 0) {\n        // Called with culture info\n        str = args[0];\n        args.shift();\n    }\n    return str.replace(formatRegExp, (_, idx, padLength, format, precision, pattern) => {\n        let rep = args[idx];\n        if (isNumeric(rep)) {\n            precision = precision == null ? null : parseInt(precision, 10);\n            switch (format) {\n                case \"f\":\n                case \"F\":\n                    precision = precision != null ? precision : 2;\n                    rep = toFixed(rep, precision);\n                    break;\n                case \"g\":\n                case \"G\":\n                    rep = precision != null ? toPrecision(rep, precision) : toPrecision(rep);\n                    break;\n                case \"e\":\n                case \"E\":\n                    rep = precision != null ? toExponential(rep, precision) : toExponential(rep);\n                    break;\n                case \"p\":\n                case \"P\":\n                    precision = precision != null ? precision : 2;\n                    rep = toFixed(multiply(rep, 100), precision) + \" %\";\n                    break;\n                case \"d\":\n                case \"D\":\n                    rep = precision != null ? padLeft(String(rep), precision, \"0\") : String(rep);\n                    break;\n                case \"x\":\n                case \"X\":\n                    rep = precision != null ? padLeft(toHex(rep), precision, \"0\") : toHex(rep);\n                    if (format === \"X\") {\n                        rep = rep.toUpperCase();\n                    }\n                    break;\n                default:\n                    if (pattern) {\n                        let sign = \"\";\n                        rep = pattern.replace(/(0+)(\\.0+)?/, (_, intPart, decimalPart) => {\n                            if (isLessThan(rep, 0)) {\n                                rep = multiply(rep, -1);\n                                sign = \"-\";\n                            }\n                            rep = toFixed(rep, decimalPart != null ? decimalPart.length - 1 : 0);\n                            return padLeft(rep, (intPart || \"\").length - sign.length + (decimalPart != null ? decimalPart.length : 0), \"0\");\n                        });\n                        rep = sign + rep;\n                    }\n            }\n        }\n        else if (rep instanceof Date) {\n            rep = dateToString(rep, pattern || format);\n        }\n        else {\n            rep = toString(rep);\n        }\n        padLength = parseInt((padLength || \" \").substring(1), 10);\n        if (!isNaN(padLength)) {\n            rep = padLeft(String(rep), Math.abs(padLength), \" \", padLength < 0);\n        }\n        return rep;\n    });\n}\nexport function endsWith(str, search) {\n    const idx = str.lastIndexOf(search);\n    return idx >= 0 && idx === str.length - search.length;\n}\nexport function initialize(n, f) {\n    if (n < 0) {\n        throw new Error(\"String length must be non-negative\");\n    }\n    const xs = new Array(n);\n    for (let i = 0; i < n; i++) {\n        xs[i] = f(i);\n    }\n    return xs.join(\"\");\n}\nexport function insert(str, startIndex, value) {\n    if (startIndex < 0 || startIndex > str.length) {\n        throw new Error(\"startIndex is negative or greater than the length of this instance.\");\n    }\n    return str.substring(0, startIndex) + value + str.substring(startIndex);\n}\nexport function isNullOrEmpty(str) {\n    return typeof str !== \"string\" || str.length === 0;\n}\nexport function isNullOrWhiteSpace(str) {\n    return typeof str !== \"string\" || /^\\s*$/.test(str);\n}\nexport function concat(...xs) {\n    return xs.map((x) => String(x)).join(\"\");\n}\nexport function join(delimiter, xs) {\n    if (Array.isArray(xs)) {\n        return xs.join(delimiter);\n    }\n    else {\n        return Array.from(xs).join(delimiter);\n    }\n}\nexport function joinWithIndices(delimiter, xs, startIndex, count) {\n    const endIndexPlusOne = startIndex + count;\n    if (endIndexPlusOne > xs.length) {\n        throw new Error(\"Index and count must refer to a location within the buffer.\");\n    }\n    return xs.slice(startIndex, endIndexPlusOne).join(delimiter);\n}\nfunction notSupported(name) {\n    throw new Error(\"The environment doesn't support '\" + name + \"', please use a polyfill.\");\n}\nexport function toBase64String(inArray) {\n    let str = \"\";\n    for (let i = 0; i < inArray.length; i++) {\n        str += String.fromCharCode(inArray[i]);\n    }\n    return typeof btoa === \"function\" ? btoa(str) : notSupported(\"btoa\");\n}\nexport function fromBase64String(b64Encoded) {\n    const binary = typeof atob === \"function\" ? atob(b64Encoded) : notSupported(\"atob\");\n    const bytes = new Uint8Array(binary.length);\n    for (let i = 0; i < binary.length; i++) {\n        bytes[i] = binary.charCodeAt(i);\n    }\n    return bytes;\n}\nexport function padLeft(str, len, ch, isRight) {\n    ch = ch || \" \";\n    len = len - str.length;\n    for (let i = 0; i < len; i++) {\n        str = isRight ? str + ch : ch + str;\n    }\n    return str;\n}\nexport function padRight(str, len, ch) {\n    return padLeft(str, len, ch, true);\n}\nexport function remove(str, startIndex, count) {\n    if (startIndex >= str.length) {\n        throw new Error(\"startIndex must be less than length of string\");\n    }\n    if (typeof count === \"number\" && (startIndex + count) > str.length) {\n        throw new Error(\"Index and count must refer to a location within the string.\");\n    }\n    return str.slice(0, startIndex) + (typeof count === \"number\" ? str.substr(startIndex + count) : \"\");\n}\nexport function replace(str, search, replace) {\n    return str.replace(new RegExp(escape(search), \"g\"), replace);\n}\nexport function replicate(n, x) {\n    return initialize(n, () => x);\n}\nexport function getCharAtIndex(input, index) {\n    if (index < 0 || index >= input.length) {\n        throw new Error(\"Index was outside the bounds of the array.\");\n    }\n    return input[index];\n}\nexport function split(str, splitters, count, removeEmpty) {\n    count = typeof count === \"number\" ? count : undefined;\n    removeEmpty = typeof removeEmpty === \"number\" ? removeEmpty : undefined;\n    if (count && count < 0) {\n        throw new Error(\"Count cannot be less than zero\");\n    }\n    if (count === 0) {\n        return [];\n    }\n    if (!Array.isArray(splitters)) {\n        if (removeEmpty === 0) {\n            return str.split(splitters, count);\n        }\n        const len = arguments.length;\n        splitters = Array(len - 1);\n        for (let key = 1; key < len; key++) {\n            splitters[key - 1] = arguments[key];\n        }\n    }\n    splitters = splitters.map((x) => escape(x));\n    splitters = splitters.length > 0 ? splitters : [\" \"];\n    let i = 0;\n    const splits = [];\n    const reg = new RegExp(splitters.join(\"|\"), \"g\");\n    while (count == null || count > 1) {\n        const m = reg.exec(str);\n        if (m === null) {\n            break;\n        }\n        if (!removeEmpty || (m.index - i) > 0) {\n            count = count != null ? count - 1 : count;\n            splits.push(str.substring(i, m.index));\n        }\n        i = reg.lastIndex;\n    }\n    if (!removeEmpty || (str.length - i) > 0) {\n        splits.push(str.substring(i));\n    }\n    return splits;\n}\nexport function trim(str, ...chars) {\n    if (chars.length === 0) {\n        return str.trim();\n    }\n    const pattern = \"[\" + escape(chars.join(\"\")) + \"]+\";\n    return str.replace(new RegExp(\"^\" + pattern), \"\").replace(new RegExp(pattern + \"$\"), \"\");\n}\nexport function trimStart(str, ...chars) {\n    return chars.length === 0\n        ? str.trimStart()\n        : str.replace(new RegExp(\"^[\" + escape(chars.join(\"\")) + \"]+\"), \"\");\n}\nexport function trimEnd(str, ...chars) {\n    return chars.length === 0\n        ? str.trimEnd()\n        : str.replace(new RegExp(\"[\" + escape(chars.join(\"\")) + \"]+$\"), \"\");\n}\nexport function filter(pred, x) {\n    return x.split(\"\").filter((c) => pred(c)).join(\"\");\n}\nexport function substring(str, startIndex, length) {\n    if ((startIndex + (length || 0) > str.length)) {\n        throw new Error(\"Invalid startIndex and/or length\");\n    }\n    return length != null ? str.substr(startIndex, length) : str.substr(startIndex);\n}\n","import { equals, isArrayLike, isDisposable, toIterator, getEnumerator } from \"./Util.js\";\r\nimport { toString } from \"./Types.js\";\r\nimport { class_type } from \"./Reflection.js\";\r\nimport { some, value as value_1 } from \"./Option.js\";\r\nimport { Operators_NullArg } from \"./FSharp.Core.js\";\r\nimport { chunkBySize as chunkBySize_1, permute as permute_1, transpose as transpose_1, windowed as windowed_1, splitInto as splitInto_1, map as map_1, pairwise as pairwise_1, scanBack as scanBack_1, reverse as reverse_1, mapFoldBack as mapFoldBack_1, mapFold as mapFold_1, tryItem as tryItem_1, tryHead as tryHead_1, foldBack2 as foldBack2_1, foldBack as foldBack_1, tryFindIndexBack as tryFindIndexBack_1, tryFindBack as tryFindBack_1, singleton as singleton_1 } from \"./Array.js\";\r\nimport { length as length_1, tryItem as tryItem_2, isEmpty as isEmpty_1, tryHead as tryHead_2, ofSeq as ofSeq_1, ofArray as ofArray_1, toArray as toArray_1, FSharpList } from \"./List.js\";\r\n\r\nexport const SR_enumerationAlreadyFinished = \"Enumeration already finished.\";\r\n\r\nexport const SR_enumerationNotStarted = \"Enumeration has not started. Call MoveNext.\";\r\n\r\nexport const SR_inputSequenceEmpty = \"The input sequence was empty.\";\r\n\r\nexport const SR_inputSequenceTooLong = \"The input sequence contains more than one element.\";\r\n\r\nexport const SR_keyNotFoundAlt = \"An index satisfying the predicate was not found in the collection.\";\r\n\r\nexport const SR_notEnoughElements = \"The input sequence has an insufficient number of elements.\";\r\n\r\nexport const SR_resetNotSupported = \"Reset is not supported on this enumerator.\";\r\n\r\nexport function Enumerator_noReset() {\r\n    throw (new Error(SR_resetNotSupported));\r\n}\r\n\r\nexport function Enumerator_notStarted() {\r\n    throw (new Error(SR_enumerationNotStarted));\r\n}\r\n\r\nexport function Enumerator_alreadyFinished() {\r\n    throw (new Error(SR_enumerationAlreadyFinished));\r\n}\r\n\r\nexport class Enumerator_Seq {\r\n    constructor(f) {\r\n        this.f = f;\r\n    }\r\n    toString() {\r\n        const xs = this;\r\n        const maxCount = 4;\r\n        let i = 0;\r\n        let str = \"seq [\";\r\n        const e = getEnumerator(xs);\r\n        try {\r\n            while ((i < maxCount) ? e[\"System.Collections.IEnumerator.MoveNext\"]() : false) {\r\n                if (i > 0) {\r\n                    str = (str + \"; \");\r\n                }\r\n                str = (str + toString(e[\"System.Collections.Generic.IEnumerator`1.get_Current\"]()));\r\n                i = ((i + 1) | 0);\r\n            }\r\n            if (i === maxCount) {\r\n                str = (str + \"; ...\");\r\n            }\r\n            return str + \"]\";\r\n        }\r\n        finally {\r\n            e.Dispose();\r\n        }\r\n    }\r\n    GetEnumerator() {\r\n        const x = this;\r\n        return x.f();\r\n    }\r\n    [Symbol.iterator]() {\r\n        return toIterator(this.GetEnumerator());\r\n    }\r\n    [\"System.Collections.IEnumerable.GetEnumerator\"]() {\r\n        const x = this;\r\n        return x.f();\r\n    }\r\n}\r\n\r\nexport function Enumerator_Seq$reflection(gen0) {\r\n    return class_type(\"SeqModule.Enumerator.Seq\", [gen0], Enumerator_Seq);\r\n}\r\n\r\nexport function Enumerator_Seq_$ctor_673A07F2(f) {\r\n    return new Enumerator_Seq(f);\r\n}\r\n\r\nexport class Enumerator_FromFunctions$1 {\r\n    constructor(current, next, dispose) {\r\n        this.current = current;\r\n        this.next = next;\r\n        this.dispose = dispose;\r\n    }\r\n    [\"System.Collections.Generic.IEnumerator`1.get_Current\"]() {\r\n        const __ = this;\r\n        return __.current();\r\n    }\r\n    [\"System.Collections.IEnumerator.get_Current\"]() {\r\n        const __ = this;\r\n        return __.current();\r\n    }\r\n    [\"System.Collections.IEnumerator.MoveNext\"]() {\r\n        const __ = this;\r\n        return __.next();\r\n    }\r\n    [\"System.Collections.IEnumerator.Reset\"]() {\r\n        Enumerator_noReset();\r\n    }\r\n    Dispose() {\r\n        const __ = this;\r\n        __.dispose();\r\n    }\r\n}\r\n\r\nexport function Enumerator_FromFunctions$1$reflection(gen0) {\r\n    return class_type(\"SeqModule.Enumerator.FromFunctions`1\", [gen0], Enumerator_FromFunctions$1);\r\n}\r\n\r\nexport function Enumerator_FromFunctions$1_$ctor_58C54629(current, next, dispose) {\r\n    return new Enumerator_FromFunctions$1(current, next, dispose);\r\n}\r\n\r\nexport function Enumerator_cast(e) {\r\n    return Enumerator_FromFunctions$1_$ctor_58C54629(() => e[\"System.Collections.IEnumerator.get_Current\"](), () => e[\"System.Collections.IEnumerator.MoveNext\"](), () => {\r\n        if (isDisposable(e)) {\r\n            e.Dispose();\r\n        }\r\n    });\r\n}\r\n\r\nexport function Enumerator_concat(sources) {\r\n    let outerOpt = void 0;\r\n    let innerOpt = void 0;\r\n    let started = false;\r\n    let finished = false;\r\n    let curr = void 0;\r\n    const finish = () => {\r\n        finished = true;\r\n        if (innerOpt != null) {\r\n            const inner = innerOpt;\r\n            try {\r\n                inner.Dispose();\r\n            }\r\n            finally {\r\n                innerOpt = (void 0);\r\n            }\r\n        }\r\n        if (outerOpt != null) {\r\n            const outer = outerOpt;\r\n            try {\r\n                outer.Dispose();\r\n            }\r\n            finally {\r\n                outerOpt = (void 0);\r\n            }\r\n        }\r\n    };\r\n    return Enumerator_FromFunctions$1_$ctor_58C54629(() => {\r\n        if (!started) {\r\n            Enumerator_notStarted();\r\n        }\r\n        else if (finished) {\r\n            Enumerator_alreadyFinished();\r\n        }\r\n        if (curr != null) {\r\n            return value_1(curr);\r\n        }\r\n        else {\r\n            return Enumerator_alreadyFinished();\r\n        }\r\n    }, () => {\r\n        let copyOfStruct;\r\n        if (!started) {\r\n            started = true;\r\n        }\r\n        if (finished) {\r\n            return false;\r\n        }\r\n        else {\r\n            let res = void 0;\r\n            while (res == null) {\r\n                const matchValue = [outerOpt, innerOpt];\r\n                if (matchValue[0] != null) {\r\n                    if (matchValue[1] != null) {\r\n                        const inner_1 = matchValue[1];\r\n                        if (inner_1[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n                            curr = some(inner_1[\"System.Collections.Generic.IEnumerator`1.get_Current\"]());\r\n                            res = true;\r\n                        }\r\n                        else {\r\n                            try {\r\n                                inner_1.Dispose();\r\n                            }\r\n                            finally {\r\n                                innerOpt = (void 0);\r\n                            }\r\n                        }\r\n                    }\r\n                    else {\r\n                        const outer_1 = matchValue[0];\r\n                        if (outer_1[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n                            const ie = outer_1[\"System.Collections.Generic.IEnumerator`1.get_Current\"]();\r\n                            innerOpt = ((copyOfStruct = ie, getEnumerator(copyOfStruct)));\r\n                        }\r\n                        else {\r\n                            finish();\r\n                            res = false;\r\n                        }\r\n                    }\r\n                }\r\n                else {\r\n                    outerOpt = getEnumerator(sources);\r\n                }\r\n            }\r\n            return value_1(res);\r\n        }\r\n    }, () => {\r\n        if (!finished) {\r\n            finish();\r\n        }\r\n    });\r\n}\r\n\r\nexport function Enumerator_enumerateThenFinally(f, e) {\r\n    return Enumerator_FromFunctions$1_$ctor_58C54629(() => e[\"System.Collections.Generic.IEnumerator`1.get_Current\"](), () => e[\"System.Collections.IEnumerator.MoveNext\"](), () => {\r\n        try {\r\n            e.Dispose();\r\n        }\r\n        finally {\r\n            f();\r\n        }\r\n    });\r\n}\r\n\r\nexport function Enumerator_generateWhileSome(openf, compute, closef) {\r\n    let started = false;\r\n    let curr = void 0;\r\n    let state = some(openf());\r\n    const dispose = () => {\r\n        if (state != null) {\r\n            const x_1 = value_1(state);\r\n            try {\r\n                closef(x_1);\r\n            }\r\n            finally {\r\n                state = (void 0);\r\n            }\r\n        }\r\n    };\r\n    const finish = () => {\r\n        try {\r\n            dispose();\r\n        }\r\n        finally {\r\n            curr = (void 0);\r\n        }\r\n    };\r\n    return Enumerator_FromFunctions$1_$ctor_58C54629(() => {\r\n        if (!started) {\r\n            Enumerator_notStarted();\r\n        }\r\n        if (curr != null) {\r\n            return value_1(curr);\r\n        }\r\n        else {\r\n            return Enumerator_alreadyFinished();\r\n        }\r\n    }, () => {\r\n        if (!started) {\r\n            started = true;\r\n        }\r\n        if (state != null) {\r\n            const s = value_1(state);\r\n            let matchValue_1;\r\n            try {\r\n                matchValue_1 = compute(s);\r\n            }\r\n            catch (matchValue) {\r\n                finish();\r\n                throw matchValue;\r\n            }\r\n            if (matchValue_1 != null) {\r\n                curr = matchValue_1;\r\n                return true;\r\n            }\r\n            else {\r\n                finish();\r\n                return false;\r\n            }\r\n        }\r\n        else {\r\n            return false;\r\n        }\r\n    }, dispose);\r\n}\r\n\r\nexport function Enumerator_unfold(f, state) {\r\n    let curr = void 0;\r\n    let acc = state;\r\n    return Enumerator_FromFunctions$1_$ctor_58C54629(() => {\r\n        if (curr != null) {\r\n            const x = curr[0];\r\n            const st = curr[1];\r\n            return x;\r\n        }\r\n        else {\r\n            return Enumerator_notStarted();\r\n        }\r\n    }, () => {\r\n        curr = f(acc);\r\n        if (curr != null) {\r\n            const x_1 = curr[0];\r\n            const st_1 = curr[1];\r\n            acc = st_1;\r\n            return true;\r\n        }\r\n        else {\r\n            return false;\r\n        }\r\n    }, () => {\r\n    });\r\n}\r\n\r\nexport function indexNotFound() {\r\n    throw (new Error(SR_keyNotFoundAlt));\r\n}\r\n\r\nexport function checkNonNull(argName, arg) {\r\n    if (arg == null) {\r\n        Operators_NullArg(argName);\r\n    }\r\n}\r\n\r\nexport function mkSeq(f) {\r\n    return Enumerator_Seq_$ctor_673A07F2(f);\r\n}\r\n\r\nexport function ofSeq(xs) {\r\n    checkNonNull(\"source\", xs);\r\n    return getEnumerator(xs);\r\n}\r\n\r\nexport function delay(generator) {\r\n    return mkSeq(() => getEnumerator(generator()));\r\n}\r\n\r\nexport function concat(sources) {\r\n    return mkSeq(() => Enumerator_concat(sources));\r\n}\r\n\r\nexport function unfold(generator, state) {\r\n    return mkSeq(() => Enumerator_unfold(generator, state));\r\n}\r\n\r\nexport function empty() {\r\n    return delay(() => (new Array(0)));\r\n}\r\n\r\nexport function singleton(x) {\r\n    return delay(() => singleton_1(x));\r\n}\r\n\r\nexport function ofArray(arr) {\r\n    return arr;\r\n}\r\n\r\nexport function toArray(xs) {\r\n    if (isArrayLike(xs)) {\r\n        return xs;\r\n    }\r\n    else if (xs instanceof FSharpList) {\r\n        return toArray_1(xs);\r\n    }\r\n    else {\r\n        return Array.from(xs);\r\n    }\r\n}\r\n\r\nexport function ofList(xs) {\r\n    return xs;\r\n}\r\n\r\nexport function toList(xs) {\r\n    if (isArrayLike(xs)) {\r\n        return ofArray_1(xs);\r\n    }\r\n    else if (xs instanceof FSharpList) {\r\n        return xs;\r\n    }\r\n    else {\r\n        return ofSeq_1(xs);\r\n    }\r\n}\r\n\r\nexport function generate(create, compute, dispose) {\r\n    return mkSeq(() => Enumerator_generateWhileSome(create, compute, dispose));\r\n}\r\n\r\nexport function generateIndexed(create, compute, dispose) {\r\n    return mkSeq(() => {\r\n        let i = -1;\r\n        return Enumerator_generateWhileSome(create, (x) => {\r\n            i = ((i + 1) | 0);\r\n            return compute(i, x);\r\n        }, dispose);\r\n    });\r\n}\r\n\r\nexport function append(xs, ys) {\r\n    return concat([xs, ys]);\r\n}\r\n\r\nexport function cast(xs) {\r\n    return mkSeq(() => {\r\n        checkNonNull(\"source\", xs);\r\n        return Enumerator_cast(getEnumerator(xs));\r\n    });\r\n}\r\n\r\nexport function choose(chooser, xs) {\r\n    return generate(() => ofSeq(xs), (e) => {\r\n        let curr = void 0;\r\n        while ((curr == null) ? e[\"System.Collections.IEnumerator.MoveNext\"]() : false) {\r\n            curr = chooser(e[\"System.Collections.Generic.IEnumerator`1.get_Current\"]());\r\n        }\r\n        return curr;\r\n    }, (e_1) => {\r\n        e_1.Dispose();\r\n    });\r\n}\r\n\r\nexport function compareWith(comparer, xs, ys) {\r\n    const e1 = ofSeq(xs);\r\n    try {\r\n        const e2 = ofSeq(ys);\r\n        try {\r\n            let c = 0;\r\n            let b1 = e1[\"System.Collections.IEnumerator.MoveNext\"]();\r\n            let b2 = e2[\"System.Collections.IEnumerator.MoveNext\"]();\r\n            while (((c === 0) ? b1 : false) ? b2 : false) {\r\n                c = (comparer(e1[\"System.Collections.Generic.IEnumerator`1.get_Current\"](), e2[\"System.Collections.Generic.IEnumerator`1.get_Current\"]()) | 0);\r\n                if (c === 0) {\r\n                    b1 = e1[\"System.Collections.IEnumerator.MoveNext\"]();\r\n                    b2 = e2[\"System.Collections.IEnumerator.MoveNext\"]();\r\n                }\r\n            }\r\n            return ((c !== 0) ? c : (b1 ? 1 : (b2 ? -1 : 0))) | 0;\r\n        }\r\n        finally {\r\n            e2.Dispose();\r\n        }\r\n    }\r\n    finally {\r\n        e1.Dispose();\r\n    }\r\n}\r\n\r\nexport function contains(value, xs, comparer) {\r\n    const e = ofSeq(xs);\r\n    try {\r\n        let found = false;\r\n        while ((!found) ? e[\"System.Collections.IEnumerator.MoveNext\"]() : false) {\r\n            found = comparer.Equals(value, e[\"System.Collections.Generic.IEnumerator`1.get_Current\"]());\r\n        }\r\n        return found;\r\n    }\r\n    finally {\r\n        e.Dispose();\r\n    }\r\n}\r\n\r\nexport function enumerateFromFunctions(create, moveNext, current) {\r\n    return generate(create, (x) => (moveNext(x) ? some(current(x)) : (void 0)), (x_1) => {\r\n        const matchValue = x_1;\r\n        if (isDisposable(matchValue)) {\r\n            matchValue.Dispose();\r\n        }\r\n    });\r\n}\r\n\r\nexport function enumerateThenFinally(source, compensation) {\r\n    const compensation_1 = compensation;\r\n    return mkSeq(() => {\r\n        try {\r\n            return Enumerator_enumerateThenFinally(compensation_1, ofSeq(source));\r\n        }\r\n        catch (matchValue) {\r\n            compensation_1();\r\n            throw matchValue;\r\n        }\r\n    });\r\n}\r\n\r\nexport function enumerateUsing(resource, source) {\r\n    const compensation = () => {\r\n        if (equals(resource, null)) {\r\n        }\r\n        else {\r\n            let copyOfStruct = resource;\r\n            copyOfStruct.Dispose();\r\n        }\r\n    };\r\n    return mkSeq(() => {\r\n        try {\r\n            return Enumerator_enumerateThenFinally(compensation, ofSeq(source(resource)));\r\n        }\r\n        catch (matchValue_1) {\r\n            compensation();\r\n            throw matchValue_1;\r\n        }\r\n    });\r\n}\r\n\r\nexport function enumerateWhile(guard, xs) {\r\n    return concat(unfold((i) => (guard() ? [xs, i + 1] : (void 0)), 0));\r\n}\r\n\r\nexport function filter(f, xs) {\r\n    return choose((x) => {\r\n        if (f(x)) {\r\n            return some(x);\r\n        }\r\n        else {\r\n            return void 0;\r\n        }\r\n    }, xs);\r\n}\r\n\r\nexport function exists(predicate, xs) {\r\n    const e = ofSeq(xs);\r\n    try {\r\n        let found = false;\r\n        while ((!found) ? e[\"System.Collections.IEnumerator.MoveNext\"]() : false) {\r\n            found = predicate(e[\"System.Collections.Generic.IEnumerator`1.get_Current\"]());\r\n        }\r\n        return found;\r\n    }\r\n    finally {\r\n        e.Dispose();\r\n    }\r\n}\r\n\r\nexport function exists2(predicate, xs, ys) {\r\n    const e1 = ofSeq(xs);\r\n    try {\r\n        const e2 = ofSeq(ys);\r\n        try {\r\n            let found = false;\r\n            while (((!found) ? e1[\"System.Collections.IEnumerator.MoveNext\"]() : false) ? e2[\"System.Collections.IEnumerator.MoveNext\"]() : false) {\r\n                found = predicate(e1[\"System.Collections.Generic.IEnumerator`1.get_Current\"](), e2[\"System.Collections.Generic.IEnumerator`1.get_Current\"]());\r\n            }\r\n            return found;\r\n        }\r\n        finally {\r\n            e2.Dispose();\r\n        }\r\n    }\r\n    finally {\r\n        e1.Dispose();\r\n    }\r\n}\r\n\r\nexport function exactlyOne(xs) {\r\n    const e = ofSeq(xs);\r\n    try {\r\n        if (e[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n            const v = e[\"System.Collections.Generic.IEnumerator`1.get_Current\"]();\r\n            if (e[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n                throw (new Error((SR_inputSequenceTooLong + \"\\\\nParameter name: \") + \"source\"));\r\n            }\r\n            else {\r\n                return v;\r\n            }\r\n        }\r\n        else {\r\n            throw (new Error((SR_inputSequenceEmpty + \"\\\\nParameter name: \") + \"source\"));\r\n        }\r\n    }\r\n    finally {\r\n        e.Dispose();\r\n    }\r\n}\r\n\r\nexport function tryExactlyOne(xs) {\r\n    const e = ofSeq(xs);\r\n    try {\r\n        if (e[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n            const v = e[\"System.Collections.Generic.IEnumerator`1.get_Current\"]();\r\n            return e[\"System.Collections.IEnumerator.MoveNext\"]() ? (void 0) : some(v);\r\n        }\r\n        else {\r\n            return void 0;\r\n        }\r\n    }\r\n    finally {\r\n        e.Dispose();\r\n    }\r\n}\r\n\r\nexport function tryFind(predicate, xs) {\r\n    const e = ofSeq(xs);\r\n    try {\r\n        let res = void 0;\r\n        while ((res == null) ? e[\"System.Collections.IEnumerator.MoveNext\"]() : false) {\r\n            const c = e[\"System.Collections.Generic.IEnumerator`1.get_Current\"]();\r\n            if (predicate(c)) {\r\n                res = some(c);\r\n            }\r\n        }\r\n        return res;\r\n    }\r\n    finally {\r\n        e.Dispose();\r\n    }\r\n}\r\n\r\nexport function find(predicate, xs) {\r\n    const matchValue = tryFind(predicate, xs);\r\n    if (matchValue == null) {\r\n        return indexNotFound();\r\n    }\r\n    else {\r\n        return value_1(matchValue);\r\n    }\r\n}\r\n\r\nexport function tryFindBack(predicate, xs) {\r\n    return tryFindBack_1(predicate, toArray(xs));\r\n}\r\n\r\nexport function findBack(predicate, xs) {\r\n    const matchValue = tryFindBack(predicate, xs);\r\n    if (matchValue == null) {\r\n        return indexNotFound();\r\n    }\r\n    else {\r\n        return value_1(matchValue);\r\n    }\r\n}\r\n\r\nexport function tryFindIndex(predicate, xs) {\r\n    const e = ofSeq(xs);\r\n    try {\r\n        const loop = (i_mut) => {\r\n            loop:\r\n            while (true) {\r\n                const i = i_mut;\r\n                if (e[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n                    if (predicate(e[\"System.Collections.Generic.IEnumerator`1.get_Current\"]())) {\r\n                        return i;\r\n                    }\r\n                    else {\r\n                        i_mut = (i + 1);\r\n                        continue loop;\r\n                    }\r\n                }\r\n                else {\r\n                    return void 0;\r\n                }\r\n                break;\r\n            }\r\n        };\r\n        return loop(0);\r\n    }\r\n    finally {\r\n        e.Dispose();\r\n    }\r\n}\r\n\r\nexport function findIndex(predicate, xs) {\r\n    const matchValue = tryFindIndex(predicate, xs);\r\n    if (matchValue == null) {\r\n        return indexNotFound() | 0;\r\n    }\r\n    else {\r\n        return matchValue | 0;\r\n    }\r\n}\r\n\r\nexport function tryFindIndexBack(predicate, xs) {\r\n    return tryFindIndexBack_1(predicate, toArray(xs));\r\n}\r\n\r\nexport function findIndexBack(predicate, xs) {\r\n    const matchValue = tryFindIndexBack(predicate, xs);\r\n    if (matchValue == null) {\r\n        return indexNotFound() | 0;\r\n    }\r\n    else {\r\n        return matchValue | 0;\r\n    }\r\n}\r\n\r\nexport function fold(folder, state, xs) {\r\n    const e = ofSeq(xs);\r\n    try {\r\n        let acc = state;\r\n        while (e[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n            acc = folder(acc, e[\"System.Collections.Generic.IEnumerator`1.get_Current\"]());\r\n        }\r\n        return acc;\r\n    }\r\n    finally {\r\n        e.Dispose();\r\n    }\r\n}\r\n\r\nexport function foldBack(folder, xs, state) {\r\n    return foldBack_1(folder, toArray(xs), state);\r\n}\r\n\r\nexport function fold2(folder, state, xs, ys) {\r\n    const e1 = ofSeq(xs);\r\n    try {\r\n        const e2 = ofSeq(ys);\r\n        try {\r\n            let acc = state;\r\n            while (e1[\"System.Collections.IEnumerator.MoveNext\"]() ? e2[\"System.Collections.IEnumerator.MoveNext\"]() : false) {\r\n                acc = folder(acc, e1[\"System.Collections.Generic.IEnumerator`1.get_Current\"](), e2[\"System.Collections.Generic.IEnumerator`1.get_Current\"]());\r\n            }\r\n            return acc;\r\n        }\r\n        finally {\r\n            e2.Dispose();\r\n        }\r\n    }\r\n    finally {\r\n        e1.Dispose();\r\n    }\r\n}\r\n\r\nexport function foldBack2(folder, xs, ys, state) {\r\n    return foldBack2_1(folder, toArray(xs), toArray(ys), state);\r\n}\r\n\r\nexport function forAll(predicate, xs) {\r\n    return !exists((x) => (!predicate(x)), xs);\r\n}\r\n\r\nexport function forAll2(predicate, xs, ys) {\r\n    return !exists2((x, y) => (!predicate(x, y)), xs, ys);\r\n}\r\n\r\nexport function tryHead(xs) {\r\n    if (isArrayLike(xs)) {\r\n        return tryHead_1(xs);\r\n    }\r\n    else if (xs instanceof FSharpList) {\r\n        return tryHead_2(xs);\r\n    }\r\n    else {\r\n        const e = ofSeq(xs);\r\n        try {\r\n            return e[\"System.Collections.IEnumerator.MoveNext\"]() ? some(e[\"System.Collections.Generic.IEnumerator`1.get_Current\"]()) : (void 0);\r\n        }\r\n        finally {\r\n            e.Dispose();\r\n        }\r\n    }\r\n}\r\n\r\nexport function head(xs) {\r\n    const matchValue = tryHead(xs);\r\n    if (matchValue == null) {\r\n        throw (new Error((SR_inputSequenceEmpty + \"\\\\nParameter name: \") + \"source\"));\r\n    }\r\n    else {\r\n        return value_1(matchValue);\r\n    }\r\n}\r\n\r\nexport function initialize(count, f) {\r\n    return unfold((i) => ((i < count) ? [f(i), i + 1] : (void 0)), 0);\r\n}\r\n\r\nexport function initializeInfinite(f) {\r\n    return initialize(2147483647, f);\r\n}\r\n\r\nexport function isEmpty(xs) {\r\n    if (isArrayLike(xs)) {\r\n        return xs.length === 0;\r\n    }\r\n    else if (xs instanceof FSharpList) {\r\n        return isEmpty_1(xs);\r\n    }\r\n    else {\r\n        const e = ofSeq(xs);\r\n        try {\r\n            return !e[\"System.Collections.IEnumerator.MoveNext\"]();\r\n        }\r\n        finally {\r\n            e.Dispose();\r\n        }\r\n    }\r\n}\r\n\r\nexport function tryItem(index, xs) {\r\n    if (isArrayLike(xs)) {\r\n        return tryItem_1(index, xs);\r\n    }\r\n    else if (xs instanceof FSharpList) {\r\n        return tryItem_2(index, xs);\r\n    }\r\n    else {\r\n        const e = ofSeq(xs);\r\n        try {\r\n            const loop = (index_1_mut) => {\r\n                loop:\r\n                while (true) {\r\n                    const index_1 = index_1_mut;\r\n                    if (!e[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n                        return void 0;\r\n                    }\r\n                    else if (index_1 === 0) {\r\n                        return some(e[\"System.Collections.Generic.IEnumerator`1.get_Current\"]());\r\n                    }\r\n                    else {\r\n                        index_1_mut = (index_1 - 1);\r\n                        continue loop;\r\n                    }\r\n                    break;\r\n                }\r\n            };\r\n            return loop(index);\r\n        }\r\n        finally {\r\n            e.Dispose();\r\n        }\r\n    }\r\n}\r\n\r\nexport function item(index, xs) {\r\n    const matchValue = tryItem(index, xs);\r\n    if (matchValue == null) {\r\n        throw (new Error((SR_notEnoughElements + \"\\\\nParameter name: \") + \"index\"));\r\n    }\r\n    else {\r\n        return value_1(matchValue);\r\n    }\r\n}\r\n\r\nexport function iterate(action, xs) {\r\n    fold((unitVar0, x) => {\r\n        action(x);\r\n    }, void 0, xs);\r\n}\r\n\r\nexport function iterate2(action, xs, ys) {\r\n    fold2((unitVar0, x, y) => {\r\n        action(x, y);\r\n    }, void 0, xs, ys);\r\n}\r\n\r\nexport function iterateIndexed(action, xs) {\r\n    void fold((i, x) => {\r\n        action(i, x);\r\n        return (i + 1) | 0;\r\n    }, 0, xs);\r\n}\r\n\r\nexport function iterateIndexed2(action, xs, ys) {\r\n    void fold2((i, x, y) => {\r\n        action(i, x, y);\r\n        return (i + 1) | 0;\r\n    }, 0, xs, ys);\r\n}\r\n\r\nexport function tryLast(xs) {\r\n    const e = ofSeq(xs);\r\n    try {\r\n        const loop = (acc_mut) => {\r\n            loop:\r\n            while (true) {\r\n                const acc = acc_mut;\r\n                if (!e[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n                    return acc;\r\n                }\r\n                else {\r\n                    acc_mut = e[\"System.Collections.Generic.IEnumerator`1.get_Current\"]();\r\n                    continue loop;\r\n                }\r\n                break;\r\n            }\r\n        };\r\n        return e[\"System.Collections.IEnumerator.MoveNext\"]() ? some(loop(e[\"System.Collections.Generic.IEnumerator`1.get_Current\"]())) : (void 0);\r\n    }\r\n    finally {\r\n        e.Dispose();\r\n    }\r\n}\r\n\r\nexport function last(xs) {\r\n    const matchValue = tryLast(xs);\r\n    if (matchValue == null) {\r\n        throw (new Error((SR_notEnoughElements + \"\\\\nParameter name: \") + \"source\"));\r\n    }\r\n    else {\r\n        return value_1(matchValue);\r\n    }\r\n}\r\n\r\nexport function length(xs) {\r\n    if (isArrayLike(xs)) {\r\n        return xs.length | 0;\r\n    }\r\n    else if (xs instanceof FSharpList) {\r\n        return length_1(xs) | 0;\r\n    }\r\n    else {\r\n        const e = ofSeq(xs);\r\n        try {\r\n            let count = 0;\r\n            while (e[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n                count = ((count + 1) | 0);\r\n            }\r\n            return count | 0;\r\n        }\r\n        finally {\r\n            e.Dispose();\r\n        }\r\n    }\r\n}\r\n\r\nexport function map(mapping, xs) {\r\n    return generate(() => ofSeq(xs), (e) => (e[\"System.Collections.IEnumerator.MoveNext\"]() ? some(mapping(e[\"System.Collections.Generic.IEnumerator`1.get_Current\"]())) : (void 0)), (e_1) => {\r\n        e_1.Dispose();\r\n    });\r\n}\r\n\r\nexport function mapIndexed(mapping, xs) {\r\n    return generateIndexed(() => ofSeq(xs), (i, e) => (e[\"System.Collections.IEnumerator.MoveNext\"]() ? some(mapping(i, e[\"System.Collections.Generic.IEnumerator`1.get_Current\"]())) : (void 0)), (e_1) => {\r\n        e_1.Dispose();\r\n    });\r\n}\r\n\r\nexport function indexed(xs) {\r\n    return mapIndexed((i, x) => [i, x], xs);\r\n}\r\n\r\nexport function map2(mapping, xs, ys) {\r\n    return generate(() => [ofSeq(xs), ofSeq(ys)], (tupledArg) => {\r\n        const e1 = tupledArg[0];\r\n        const e2 = tupledArg[1];\r\n        return (e1[\"System.Collections.IEnumerator.MoveNext\"]() ? e2[\"System.Collections.IEnumerator.MoveNext\"]() : false) ? some(mapping(e1[\"System.Collections.Generic.IEnumerator`1.get_Current\"](), e2[\"System.Collections.Generic.IEnumerator`1.get_Current\"]())) : (void 0);\r\n    }, (tupledArg_1) => {\r\n        try {\r\n            tupledArg_1[0].Dispose();\r\n        }\r\n        finally {\r\n            tupledArg_1[1].Dispose();\r\n        }\r\n    });\r\n}\r\n\r\nexport function mapIndexed2(mapping, xs, ys) {\r\n    return generateIndexed(() => [ofSeq(xs), ofSeq(ys)], (i, tupledArg) => {\r\n        const e1 = tupledArg[0];\r\n        const e2 = tupledArg[1];\r\n        return (e1[\"System.Collections.IEnumerator.MoveNext\"]() ? e2[\"System.Collections.IEnumerator.MoveNext\"]() : false) ? some(mapping(i, e1[\"System.Collections.Generic.IEnumerator`1.get_Current\"](), e2[\"System.Collections.Generic.IEnumerator`1.get_Current\"]())) : (void 0);\r\n    }, (tupledArg_1) => {\r\n        try {\r\n            tupledArg_1[0].Dispose();\r\n        }\r\n        finally {\r\n            tupledArg_1[1].Dispose();\r\n        }\r\n    });\r\n}\r\n\r\nexport function map3(mapping, xs, ys, zs) {\r\n    return generate(() => [ofSeq(xs), ofSeq(ys), ofSeq(zs)], (tupledArg) => {\r\n        const e1 = tupledArg[0];\r\n        const e2 = tupledArg[1];\r\n        const e3 = tupledArg[2];\r\n        return ((e1[\"System.Collections.IEnumerator.MoveNext\"]() ? e2[\"System.Collections.IEnumerator.MoveNext\"]() : false) ? e3[\"System.Collections.IEnumerator.MoveNext\"]() : false) ? some(mapping(e1[\"System.Collections.Generic.IEnumerator`1.get_Current\"](), e2[\"System.Collections.Generic.IEnumerator`1.get_Current\"](), e3[\"System.Collections.Generic.IEnumerator`1.get_Current\"]())) : (void 0);\r\n    }, (tupledArg_1) => {\r\n        try {\r\n            tupledArg_1[0].Dispose();\r\n        }\r\n        finally {\r\n            try {\r\n                tupledArg_1[1].Dispose();\r\n            }\r\n            finally {\r\n                tupledArg_1[2].Dispose();\r\n            }\r\n        }\r\n    });\r\n}\r\n\r\nexport function readOnly(xs) {\r\n    checkNonNull(\"source\", xs);\r\n    return map((x) => x, xs);\r\n}\r\n\r\nexport function cache(xs) {\r\n    let cached = false;\r\n    const xsCache = [];\r\n    return delay(() => {\r\n        if (!cached) {\r\n            cached = true;\r\n            return map((x) => {\r\n                void (xsCache.push(x));\r\n                return x;\r\n            }, xs);\r\n        }\r\n        else {\r\n            return xsCache;\r\n        }\r\n    });\r\n}\r\n\r\nexport function allPairs(xs, ys) {\r\n    const ysCache = cache(ys);\r\n    return delay(() => concat(map((x) => map((y) => [x, y], ysCache), xs)));\r\n}\r\n\r\nexport function mapFold(mapping, state, xs) {\r\n    const patternInput = mapFold_1(mapping, state, toArray(xs));\r\n    return [readOnly(patternInput[0]), patternInput[1]];\r\n}\r\n\r\nexport function mapFoldBack(mapping, xs, state) {\r\n    const patternInput = mapFoldBack_1(mapping, toArray(xs), state);\r\n    return [readOnly(patternInput[0]), patternInput[1]];\r\n}\r\n\r\nexport function tryPick(chooser, xs) {\r\n    const e = ofSeq(xs);\r\n    try {\r\n        let res = void 0;\r\n        while ((res == null) ? e[\"System.Collections.IEnumerator.MoveNext\"]() : false) {\r\n            res = chooser(e[\"System.Collections.Generic.IEnumerator`1.get_Current\"]());\r\n        }\r\n        return res;\r\n    }\r\n    finally {\r\n        e.Dispose();\r\n    }\r\n}\r\n\r\nexport function pick(chooser, xs) {\r\n    const matchValue = tryPick(chooser, xs);\r\n    if (matchValue == null) {\r\n        return indexNotFound();\r\n    }\r\n    else {\r\n        return value_1(matchValue);\r\n    }\r\n}\r\n\r\nexport function reduce(folder, xs) {\r\n    const e = ofSeq(xs);\r\n    try {\r\n        const loop = (acc_mut) => {\r\n            loop:\r\n            while (true) {\r\n                const acc = acc_mut;\r\n                if (e[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n                    acc_mut = folder(acc, e[\"System.Collections.Generic.IEnumerator`1.get_Current\"]());\r\n                    continue loop;\r\n                }\r\n                else {\r\n                    return acc;\r\n                }\r\n                break;\r\n            }\r\n        };\r\n        if (e[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n            return loop(e[\"System.Collections.Generic.IEnumerator`1.get_Current\"]());\r\n        }\r\n        else {\r\n            throw (new Error(SR_inputSequenceEmpty));\r\n        }\r\n    }\r\n    finally {\r\n        e.Dispose();\r\n    }\r\n}\r\n\r\nexport function reduceBack(folder, xs) {\r\n    const arr = toArray(xs);\r\n    if (arr.length > 0) {\r\n        return arr.reduceRight(folder);\r\n    }\r\n    else {\r\n        throw (new Error(SR_inputSequenceEmpty));\r\n    }\r\n}\r\n\r\nexport function replicate(n, x) {\r\n    return initialize(n, (_arg1) => x);\r\n}\r\n\r\nexport function reverse(xs) {\r\n    return delay(() => ofArray(reverse_1(toArray(xs))));\r\n}\r\n\r\nexport function scan(folder, state, xs) {\r\n    return delay(() => {\r\n        let acc = state;\r\n        return concat([singleton(state), map((x) => {\r\n            acc = folder(acc, x);\r\n            return acc;\r\n        }, xs)]);\r\n    });\r\n}\r\n\r\nexport function scanBack(folder, xs, state) {\r\n    return delay(() => ofArray(scanBack_1(folder, toArray(xs), state)));\r\n}\r\n\r\nexport function skip(count, xs) {\r\n    return mkSeq(() => {\r\n        const e = ofSeq(xs);\r\n        try {\r\n            for (let i = 1; i <= count; i++) {\r\n                if (!e[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n                    throw (new Error((SR_notEnoughElements + \"\\\\nParameter name: \") + \"source\"));\r\n                }\r\n            }\r\n            return Enumerator_enumerateThenFinally(() => {\r\n            }, e);\r\n        }\r\n        catch (matchValue) {\r\n            e.Dispose();\r\n            throw matchValue;\r\n        }\r\n    });\r\n}\r\n\r\nexport function skipWhile(predicate, xs) {\r\n    return delay(() => {\r\n        let skipped = true;\r\n        return filter((x) => {\r\n            if (skipped) {\r\n                skipped = predicate(x);\r\n            }\r\n            return !skipped;\r\n        }, xs);\r\n    });\r\n}\r\n\r\nexport function tail(xs) {\r\n    return skip(1, xs);\r\n}\r\n\r\nexport function take(count, xs) {\r\n    return generateIndexed(() => ofSeq(xs), (i, e) => {\r\n        if (i < count) {\r\n            if (e[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n                return some(e[\"System.Collections.Generic.IEnumerator`1.get_Current\"]());\r\n            }\r\n            else {\r\n                throw (new Error((SR_notEnoughElements + \"\\\\nParameter name: \") + \"source\"));\r\n            }\r\n        }\r\n        else {\r\n            return void 0;\r\n        }\r\n    }, (e_1) => {\r\n        e_1.Dispose();\r\n    });\r\n}\r\n\r\nexport function takeWhile(predicate, xs) {\r\n    return generate(() => ofSeq(xs), (e) => ((e[\"System.Collections.IEnumerator.MoveNext\"]() ? predicate(e[\"System.Collections.Generic.IEnumerator`1.get_Current\"]()) : false) ? some(e[\"System.Collections.Generic.IEnumerator`1.get_Current\"]()) : (void 0)), (e_1) => {\r\n        e_1.Dispose();\r\n    });\r\n}\r\n\r\nexport function truncate(count, xs) {\r\n    return generateIndexed(() => ofSeq(xs), (i, e) => (((i < count) ? e[\"System.Collections.IEnumerator.MoveNext\"]() : false) ? some(e[\"System.Collections.Generic.IEnumerator`1.get_Current\"]()) : (void 0)), (e_1) => {\r\n        e_1.Dispose();\r\n    });\r\n}\r\n\r\nexport function zip(xs, ys) {\r\n    return map2((x, y) => [x, y], xs, ys);\r\n}\r\n\r\nexport function zip3(xs, ys, zs) {\r\n    return map3((x, y, z) => [x, y, z], xs, ys, zs);\r\n}\r\n\r\nexport function collect(mapping, xs) {\r\n    return delay(() => concat(map(mapping, xs)));\r\n}\r\n\r\nexport function where(predicate, xs) {\r\n    return filter(predicate, xs);\r\n}\r\n\r\nexport function pairwise(xs) {\r\n    return delay(() => ofArray(pairwise_1(toArray(xs))));\r\n}\r\n\r\nexport function splitInto(chunks, xs) {\r\n    return delay(() => ofArray(map_1((arr) => ofArray(arr), splitInto_1(chunks, toArray(xs)))));\r\n}\r\n\r\nexport function windowed(windowSize, xs) {\r\n    return delay(() => ofArray(map_1((arr) => ofArray(arr), windowed_1(windowSize, toArray(xs)))));\r\n}\r\n\r\nexport function transpose(xss) {\r\n    return delay(() => ofArray(map_1((arr) => ofArray(arr), transpose_1(map_1((xs_1) => toArray(xs_1), toArray(xss))))));\r\n}\r\n\r\nexport function sortWith(comparer, xs) {\r\n    return delay(() => {\r\n        const arr = toArray(xs);\r\n        arr.sort(comparer);\r\n        return ofArray(arr);\r\n    });\r\n}\r\n\r\nexport function sort(xs, comparer) {\r\n    return sortWith((x, y) => comparer.Compare(x, y), xs);\r\n}\r\n\r\nexport function sortBy(projection, xs, comparer) {\r\n    return sortWith((x, y) => comparer.Compare(projection(x), projection(y)), xs);\r\n}\r\n\r\nexport function sortDescending(xs, comparer) {\r\n    return sortWith((x, y) => (comparer.Compare(x, y) * -1), xs);\r\n}\r\n\r\nexport function sortByDescending(projection, xs, comparer) {\r\n    return sortWith((x, y) => (comparer.Compare(projection(x), projection(y)) * -1), xs);\r\n}\r\n\r\nexport function sum(xs, adder) {\r\n    return fold((acc, x) => adder.Add(acc, x), adder.GetZero(), xs);\r\n}\r\n\r\nexport function sumBy(f, xs, adder) {\r\n    return fold((acc, x) => adder.Add(acc, f(x)), adder.GetZero(), xs);\r\n}\r\n\r\nexport function maxBy(projection, xs, comparer) {\r\n    return reduce((x, y) => ((comparer.Compare(projection(y), projection(x)) > 0) ? y : x), xs);\r\n}\r\n\r\nexport function max(xs, comparer) {\r\n    return reduce((x, y) => ((comparer.Compare(y, x) > 0) ? y : x), xs);\r\n}\r\n\r\nexport function minBy(projection, xs, comparer) {\r\n    return reduce((x, y) => ((comparer.Compare(projection(y), projection(x)) > 0) ? x : y), xs);\r\n}\r\n\r\nexport function min(xs, comparer) {\r\n    return reduce((x, y) => ((comparer.Compare(y, x) > 0) ? x : y), xs);\r\n}\r\n\r\nexport function average(xs, averager) {\r\n    let count = 0;\r\n    const total = fold((acc, x) => {\r\n        count = ((count + 1) | 0);\r\n        return averager.Add(acc, x);\r\n    }, averager.GetZero(), xs);\r\n    if (count === 0) {\r\n        throw (new Error(\"The input sequence was empty\\\\nParameter name: xs\"));\r\n    }\r\n    else {\r\n        return averager.DivideByInt(total, count);\r\n    }\r\n}\r\n\r\nexport function averageBy(f, xs, averager) {\r\n    let count = 0;\r\n    const total = fold((acc, x) => {\r\n        count = ((count + 1) | 0);\r\n        return averager.Add(acc, f(x));\r\n    }, averager.GetZero(), xs);\r\n    if (count === 0) {\r\n        throw (new Error(\"The input sequence was empty\\\\nParameter name: xs\"));\r\n    }\r\n    else {\r\n        return averager.DivideByInt(total, count);\r\n    }\r\n}\r\n\r\nexport function permute(f, xs) {\r\n    return delay(() => ofArray(permute_1(f, toArray(xs))));\r\n}\r\n\r\nexport function chunkBySize(chunkSize, xs) {\r\n    return delay(() => ofArray(map_1((arr) => ofArray(arr), chunkBySize_1(chunkSize, toArray(xs)))));\r\n}\r\n\r\n","import { value as value_2, defaultArg, some } from \"./Option.js\";\r\nimport { min as min_1, compare, getEnumerator, comparePrimitives, max as max_1 } from \"./Util.js\";\r\n\r\nexport function Helpers_allocateArrayFromCons(cons, len) {\r\n    if ((typeof cons) === \"function\") {\r\n        return new cons(len);\r\n    }\r\n    else {\r\n        return new Array(len);\r\n    }\r\n}\r\n\r\nfunction indexNotFound() {\r\n    throw (new Error(\"An index satisfying the predicate was not found in the collection.\"));\r\n}\r\n\r\nfunction differentLengths() {\r\n    throw (new Error(\"Arrays had different lengths\"));\r\n}\r\n\r\nexport function append(array1, array2, cons) {\r\n    const len1 = array1.length | 0;\r\n    const len2 = array2.length | 0;\r\n    const newArray = Helpers_allocateArrayFromCons(cons, len1 + len2);\r\n    for (let i = 0; i <= (len1 - 1); i++) {\r\n        newArray[i] = array1[i];\r\n    }\r\n    for (let i_1 = 0; i_1 <= (len2 - 1); i_1++) {\r\n        newArray[i_1 + len1] = array2[i_1];\r\n    }\r\n    return newArray;\r\n}\r\n\r\nexport function filter(predicate, array) {\r\n    return array.filter(predicate);\r\n}\r\n\r\nexport function fill(target, targetIndex, count, value) {\r\n    const start = targetIndex | 0;\r\n    return target.fill(value, start, (start + count));\r\n}\r\n\r\nexport function getSubArray(array, start, count) {\r\n    const start_1 = start | 0;\r\n    return array.slice(start_1, (start_1 + count));\r\n}\r\n\r\nexport function last(array) {\r\n    if (array.length === 0) {\r\n        throw (new Error(\"The input array was empty\\\\nParameter name: array\"));\r\n    }\r\n    return array[array.length - 1];\r\n}\r\n\r\nexport function tryLast(array) {\r\n    if (array.length === 0) {\r\n        return void 0;\r\n    }\r\n    else {\r\n        return some(array[array.length - 1]);\r\n    }\r\n}\r\n\r\nexport function mapIndexed(f, source, cons) {\r\n    const len = source.length | 0;\r\n    const target = Helpers_allocateArrayFromCons(cons, len);\r\n    for (let i = 0; i <= (len - 1); i++) {\r\n        target[i] = f(i, source[i]);\r\n    }\r\n    return target;\r\n}\r\n\r\nexport function map(f, source, cons) {\r\n    const len = source.length | 0;\r\n    const target = Helpers_allocateArrayFromCons(cons, len);\r\n    for (let i = 0; i <= (len - 1); i++) {\r\n        target[i] = f(source[i]);\r\n    }\r\n    return target;\r\n}\r\n\r\nexport function mapIndexed2(f, source1, source2, cons) {\r\n    if (source1.length !== source2.length) {\r\n        throw (new Error(\"Arrays had different lengths\"));\r\n    }\r\n    const result = Helpers_allocateArrayFromCons(cons, source1.length);\r\n    for (let i = 0; i <= (source1.length - 1); i++) {\r\n        result[i] = f(i, source1[i], source2[i]);\r\n    }\r\n    return result;\r\n}\r\n\r\nexport function map2(f, source1, source2, cons) {\r\n    if (source1.length !== source2.length) {\r\n        throw (new Error(\"Arrays had different lengths\"));\r\n    }\r\n    const result = Helpers_allocateArrayFromCons(cons, source1.length);\r\n    for (let i = 0; i <= (source1.length - 1); i++) {\r\n        result[i] = f(source1[i], source2[i]);\r\n    }\r\n    return result;\r\n}\r\n\r\nexport function mapIndexed3(f, source1, source2, source3, cons) {\r\n    if ((source1.length !== source2.length) ? true : (source2.length !== source3.length)) {\r\n        throw (new Error(\"Arrays had different lengths\"));\r\n    }\r\n    const result = Helpers_allocateArrayFromCons(cons, source1.length);\r\n    for (let i = 0; i <= (source1.length - 1); i++) {\r\n        result[i] = f(i, source1[i], source2[i], source3[i]);\r\n    }\r\n    return result;\r\n}\r\n\r\nexport function map3(f, source1, source2, source3, cons) {\r\n    if ((source1.length !== source2.length) ? true : (source2.length !== source3.length)) {\r\n        throw (new Error(\"Arrays had different lengths\"));\r\n    }\r\n    const result = Helpers_allocateArrayFromCons(cons, source1.length);\r\n    for (let i = 0; i <= (source1.length - 1); i++) {\r\n        result[i] = f(source1[i], source2[i], source3[i]);\r\n    }\r\n    return result;\r\n}\r\n\r\nexport function mapFold(mapping, state, array, cons) {\r\n    const matchValue = array.length | 0;\r\n    if (matchValue === 0) {\r\n        return [[], state];\r\n    }\r\n    else {\r\n        let acc = state;\r\n        const res = Helpers_allocateArrayFromCons(cons, matchValue);\r\n        for (let i = 0; i <= (array.length - 1); i++) {\r\n            const patternInput = mapping(acc, array[i]);\r\n            res[i] = patternInput[0];\r\n            acc = patternInput[1];\r\n        }\r\n        return [res, acc];\r\n    }\r\n}\r\n\r\nexport function mapFoldBack(mapping, array, state, cons) {\r\n    const matchValue = array.length | 0;\r\n    if (matchValue === 0) {\r\n        return [[], state];\r\n    }\r\n    else {\r\n        let acc = state;\r\n        const res = Helpers_allocateArrayFromCons(cons, matchValue);\r\n        for (let i = array.length - 1; i >= 0; i--) {\r\n            const patternInput = mapping(array[i], acc);\r\n            res[i] = patternInput[0];\r\n            acc = patternInput[1];\r\n        }\r\n        return [res, acc];\r\n    }\r\n}\r\n\r\nexport function indexed(source) {\r\n    const len = source.length | 0;\r\n    const target = new Array(len);\r\n    for (let i = 0; i <= (len - 1); i++) {\r\n        target[i] = [i, source[i]];\r\n    }\r\n    return target;\r\n}\r\n\r\nexport function truncate(count, array) {\r\n    const count_1 = max_1((x, y) => comparePrimitives(x, y), 0, count) | 0;\r\n    const start = 0;\r\n    return array.slice(start, (start + count_1));\r\n}\r\n\r\nexport function concat(arrays, cons) {\r\n    const arrays_1 = Array.isArray(arrays) ? arrays : (Array.from(arrays));\r\n    const matchValue = arrays_1.length | 0;\r\n    switch (matchValue) {\r\n        case 0: {\r\n            return Helpers_allocateArrayFromCons(cons, 0);\r\n        }\r\n        case 1: {\r\n            return arrays_1[0];\r\n        }\r\n        default: {\r\n            let totalIdx = 0;\r\n            let totalLength = 0;\r\n            for (let idx = 0; idx <= (arrays_1.length - 1); idx++) {\r\n                const arr_1 = arrays_1[idx];\r\n                totalLength = ((totalLength + arr_1.length) | 0);\r\n            }\r\n            const result = Helpers_allocateArrayFromCons(cons, totalLength);\r\n            for (let idx_1 = 0; idx_1 <= (arrays_1.length - 1); idx_1++) {\r\n                const arr_2 = arrays_1[idx_1];\r\n                for (let j = 0; j <= (arr_2.length - 1); j++) {\r\n                    result[totalIdx] = arr_2[j];\r\n                    totalIdx = ((totalIdx + 1) | 0);\r\n                }\r\n            }\r\n            return result;\r\n        }\r\n    }\r\n}\r\n\r\nexport function collect(mapping, array, cons) {\r\n    return concat(map(mapping, array, null), cons);\r\n}\r\n\r\nexport function where(predicate, array) {\r\n    return array.filter(predicate);\r\n}\r\n\r\nexport function contains(value, array, eq) {\r\n    const loop = (i_mut) => {\r\n        loop:\r\n        while (true) {\r\n            const i = i_mut;\r\n            if (i >= array.length) {\r\n                return false;\r\n            }\r\n            else if (eq.Equals(value, array[i])) {\r\n                return true;\r\n            }\r\n            else {\r\n                i_mut = (i + 1);\r\n                continue loop;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    return loop(0);\r\n}\r\n\r\nexport function empty(cons) {\r\n    return Helpers_allocateArrayFromCons(cons, 0);\r\n}\r\n\r\nexport function singleton(value, cons) {\r\n    const ar = Helpers_allocateArrayFromCons(cons, 1);\r\n    ar[0] = value;\r\n    return ar;\r\n}\r\n\r\nexport function initialize(count, initializer, cons) {\r\n    if (count < 0) {\r\n        throw (new Error(\"The input must be non-negative\\\\nParameter name: count\"));\r\n    }\r\n    const result = Helpers_allocateArrayFromCons(cons, count);\r\n    for (let i = 0; i <= (count - 1); i++) {\r\n        result[i] = initializer(i);\r\n    }\r\n    return result;\r\n}\r\n\r\nexport function pairwise(array) {\r\n    if (array.length < 2) {\r\n        return [];\r\n    }\r\n    else {\r\n        const count = (array.length - 1) | 0;\r\n        const result = new Array(count);\r\n        for (let i = 0; i <= (count - 1); i++) {\r\n            result[i] = [array[i], array[i + 1]];\r\n        }\r\n        return result;\r\n    }\r\n}\r\n\r\nexport function replicate(count, initial, cons) {\r\n    if (count < 0) {\r\n        throw (new Error(\"The input must be non-negative\\\\nParameter name: count\"));\r\n    }\r\n    const result = Helpers_allocateArrayFromCons(cons, count);\r\n    for (let i = 0; i <= (result.length - 1); i++) {\r\n        result[i] = initial;\r\n    }\r\n    return result;\r\n}\r\n\r\nexport function copy(array) {\r\n    return array.slice();\r\n}\r\n\r\nexport function reverse(array) {\r\n    const array_2 = array.slice();\r\n    return array_2.reverse();\r\n}\r\n\r\nexport function scan(folder, state, array, cons) {\r\n    const res = Helpers_allocateArrayFromCons(cons, array.length + 1);\r\n    res[0] = state;\r\n    for (let i = 0; i <= (array.length - 1); i++) {\r\n        res[i + 1] = folder(res[i], array[i]);\r\n    }\r\n    return res;\r\n}\r\n\r\nexport function scanBack(folder, array, state, cons) {\r\n    const res = Helpers_allocateArrayFromCons(cons, array.length + 1);\r\n    res[array.length] = state;\r\n    for (let i = array.length - 1; i >= 0; i--) {\r\n        res[i] = folder(array[i], res[i + 1]);\r\n    }\r\n    return res;\r\n}\r\n\r\nexport function skip(count, array, cons) {\r\n    if (count > array.length) {\r\n        throw (new Error(\"count is greater than array length\\\\nParameter name: count\"));\r\n    }\r\n    if (count === array.length) {\r\n        return Helpers_allocateArrayFromCons(cons, 0);\r\n    }\r\n    else {\r\n        const count_1 = ((count < 0) ? 0 : count) | 0;\r\n        return array.slice(count_1);\r\n    }\r\n}\r\n\r\nexport function skipWhile(predicate, array, cons) {\r\n    let count = 0;\r\n    while ((count < array.length) ? predicate(array[count]) : false) {\r\n        count = ((count + 1) | 0);\r\n    }\r\n    if (count === array.length) {\r\n        return Helpers_allocateArrayFromCons(cons, 0);\r\n    }\r\n    else {\r\n        const count_1 = count | 0;\r\n        return array.slice(count_1);\r\n    }\r\n}\r\n\r\nexport function take(count, array, cons) {\r\n    if (count < 0) {\r\n        throw (new Error(\"The input must be non-negative\\\\nParameter name: count\"));\r\n    }\r\n    if (count > array.length) {\r\n        throw (new Error(\"count is greater than array length\\\\nParameter name: count\"));\r\n    }\r\n    if (count === 0) {\r\n        return Helpers_allocateArrayFromCons(cons, 0);\r\n    }\r\n    else {\r\n        const start = 0;\r\n        return array.slice(start, (start + count));\r\n    }\r\n}\r\n\r\nexport function takeWhile(predicate, array, cons) {\r\n    let count = 0;\r\n    while ((count < array.length) ? predicate(array[count]) : false) {\r\n        count = ((count + 1) | 0);\r\n    }\r\n    if (count === 0) {\r\n        return Helpers_allocateArrayFromCons(cons, 0);\r\n    }\r\n    else {\r\n        const start = 0;\r\n        const count_1 = count | 0;\r\n        return array.slice(start, (start + count_1));\r\n    }\r\n}\r\n\r\nexport function addInPlace(x, array) {\r\n    void (array.push(x));\r\n}\r\n\r\nexport function addRangeInPlace(range, array) {\r\n    const enumerator = getEnumerator(range);\r\n    try {\r\n        while (enumerator[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n            addInPlace(enumerator[\"System.Collections.Generic.IEnumerator`1.get_Current\"](), array);\r\n        }\r\n    }\r\n    finally {\r\n        enumerator.Dispose();\r\n    }\r\n}\r\n\r\nexport function insertRangeInPlace(index, range, array) {\r\n    let index_1;\r\n    let i = index;\r\n    const enumerator = getEnumerator(range);\r\n    try {\r\n        while (enumerator[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n            const x = enumerator[\"System.Collections.Generic.IEnumerator`1.get_Current\"]();\r\n            void ((index_1 = (i | 0), array.splice(index_1, 0, x)));\r\n            i = ((i + 1) | 0);\r\n        }\r\n    }\r\n    finally {\r\n        enumerator.Dispose();\r\n    }\r\n}\r\n\r\nexport function removeInPlace(item_1, array) {\r\n    const i = array.indexOf(item_1, 0);\r\n    if (i > -1) {\r\n        void (array.splice(i, 1));\r\n        return true;\r\n    }\r\n    else {\r\n        return false;\r\n    }\r\n}\r\n\r\nexport function removeAllInPlace(predicate, array) {\r\n    const countRemoveAll = (count) => {\r\n        const i = array.findIndex(predicate);\r\n        if (i > -1) {\r\n            void (array.splice(i, 1));\r\n            return (countRemoveAll(count) + 1) | 0;\r\n        }\r\n        else {\r\n            return count | 0;\r\n        }\r\n    };\r\n    return countRemoveAll(0) | 0;\r\n}\r\n\r\nexport function copyTo(source, sourceIndex, target, targetIndex, count) {\r\n    const diff = (targetIndex - sourceIndex) | 0;\r\n    for (let i = sourceIndex; i <= ((sourceIndex + count) - 1); i++) {\r\n        target[i + diff] = source[i];\r\n    }\r\n}\r\n\r\nexport function copyToTypedArray(source, sourceIndex, target, targetIndex, count) {\r\n    try {\r\n        target.set(source.subarray(sourceIndex, sourceIndex + count), targetIndex);\r\n    }\r\n    catch (matchValue) {\r\n        copyTo(source, sourceIndex, target, targetIndex, count);\r\n    }\r\n}\r\n\r\nexport function indexOf(array, item_1, start, count) {\r\n    const start_1 = defaultArg(start, 0) | 0;\r\n    const i = array.indexOf(item_1, start_1);\r\n    if ((count != null) ? (i >= (start_1 + value_2(count))) : false) {\r\n        return -1;\r\n    }\r\n    else {\r\n        return i | 0;\r\n    }\r\n}\r\n\r\nexport function partition(f, source, cons) {\r\n    const len = source.length | 0;\r\n    const res1 = Helpers_allocateArrayFromCons(cons, len);\r\n    const res2 = Helpers_allocateArrayFromCons(cons, len);\r\n    let iTrue = 0;\r\n    let iFalse = 0;\r\n    for (let i = 0; i <= (len - 1); i++) {\r\n        if (f(source[i])) {\r\n            res1[iTrue] = source[i];\r\n            iTrue = ((iTrue + 1) | 0);\r\n        }\r\n        else {\r\n            res2[iFalse] = source[i];\r\n            iFalse = ((iFalse + 1) | 0);\r\n        }\r\n    }\r\n    return [truncate(iTrue, res1), truncate(iFalse, res2)];\r\n}\r\n\r\nexport function find(predicate, array) {\r\n    const matchValue = array.find(predicate);\r\n    if (matchValue == null) {\r\n        return indexNotFound();\r\n    }\r\n    else {\r\n        return value_2(matchValue);\r\n    }\r\n}\r\n\r\nexport function tryFind(predicate, array) {\r\n    return array.find(predicate);\r\n}\r\n\r\nexport function findIndex(predicate, array) {\r\n    const matchValue = array.findIndex(predicate);\r\n    if (matchValue > -1) {\r\n        return matchValue | 0;\r\n    }\r\n    else {\r\n        return indexNotFound() | 0;\r\n    }\r\n}\r\n\r\nexport function tryFindIndex(predicate, array) {\r\n    const matchValue = array.findIndex(predicate);\r\n    if (matchValue > -1) {\r\n        return matchValue;\r\n    }\r\n    else {\r\n        return void 0;\r\n    }\r\n}\r\n\r\nexport function pick(chooser, array) {\r\n    const loop = (i_mut) => {\r\n        loop:\r\n        while (true) {\r\n            const i = i_mut;\r\n            if (i >= array.length) {\r\n                return indexNotFound();\r\n            }\r\n            else {\r\n                const matchValue = chooser(array[i]);\r\n                if (matchValue != null) {\r\n                    return value_2(matchValue);\r\n                }\r\n                else {\r\n                    i_mut = (i + 1);\r\n                    continue loop;\r\n                }\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    return loop(0);\r\n}\r\n\r\nexport function tryPick(chooser, array) {\r\n    const loop = (i_mut) => {\r\n        loop:\r\n        while (true) {\r\n            const i = i_mut;\r\n            if (i >= array.length) {\r\n                return void 0;\r\n            }\r\n            else {\r\n                const matchValue = chooser(array[i]);\r\n                if (matchValue == null) {\r\n                    i_mut = (i + 1);\r\n                    continue loop;\r\n                }\r\n                else {\r\n                    return matchValue;\r\n                }\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    return loop(0);\r\n}\r\n\r\nexport function findBack(predicate, array) {\r\n    const loop = (i_mut) => {\r\n        loop:\r\n        while (true) {\r\n            const i = i_mut;\r\n            if (i < 0) {\r\n                return indexNotFound();\r\n            }\r\n            else if (predicate(array[i])) {\r\n                return array[i];\r\n            }\r\n            else {\r\n                i_mut = (i - 1);\r\n                continue loop;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    return loop(array.length - 1);\r\n}\r\n\r\nexport function tryFindBack(predicate, array) {\r\n    const loop = (i_mut) => {\r\n        loop:\r\n        while (true) {\r\n            const i = i_mut;\r\n            if (i < 0) {\r\n                return void 0;\r\n            }\r\n            else if (predicate(array[i])) {\r\n                return some(array[i]);\r\n            }\r\n            else {\r\n                i_mut = (i - 1);\r\n                continue loop;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    return loop(array.length - 1);\r\n}\r\n\r\nexport function findLastIndex(predicate, array) {\r\n    const loop = (i_mut) => {\r\n        loop:\r\n        while (true) {\r\n            const i = i_mut;\r\n            if (i < 0) {\r\n                return -1;\r\n            }\r\n            else if (predicate(array[i])) {\r\n                return i | 0;\r\n            }\r\n            else {\r\n                i_mut = (i - 1);\r\n                continue loop;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    return loop(array.length - 1) | 0;\r\n}\r\n\r\nexport function findIndexBack(predicate, array) {\r\n    const loop = (i_mut) => {\r\n        loop:\r\n        while (true) {\r\n            const i = i_mut;\r\n            if (i < 0) {\r\n                return indexNotFound() | 0;\r\n            }\r\n            else if (predicate(array[i])) {\r\n                return i | 0;\r\n            }\r\n            else {\r\n                i_mut = (i - 1);\r\n                continue loop;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    return loop(array.length - 1) | 0;\r\n}\r\n\r\nexport function tryFindIndexBack(predicate, array) {\r\n    const loop = (i_mut) => {\r\n        loop:\r\n        while (true) {\r\n            const i = i_mut;\r\n            if (i < 0) {\r\n                return void 0;\r\n            }\r\n            else if (predicate(array[i])) {\r\n                return i;\r\n            }\r\n            else {\r\n                i_mut = (i - 1);\r\n                continue loop;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    return loop(array.length - 1);\r\n}\r\n\r\nexport function choose(chooser, array, cons) {\r\n    const res = [];\r\n    for (let i = 0; i <= (array.length - 1); i++) {\r\n        const matchValue = chooser(array[i]);\r\n        if (matchValue != null) {\r\n            const y = value_2(matchValue);\r\n            void (res.push(y));\r\n        }\r\n    }\r\n    if ((typeof cons) === \"function\") {\r\n        return map((x) => x, res, cons);\r\n    }\r\n    else {\r\n        return res;\r\n    }\r\n}\r\n\r\nexport function foldIndexed(folder, state, array) {\r\n    return array.reduce(((delegateArg0, delegateArg1, delegateArg2) => folder(delegateArg2, delegateArg0, delegateArg1)), state);\r\n}\r\n\r\nexport function fold(folder, state, array) {\r\n    return array.reduce(((delegateArg0, delegateArg1) => folder(delegateArg0, delegateArg1)), state);\r\n}\r\n\r\nexport function iterate(action, array) {\r\n    for (let i = 0; i <= (array.length - 1); i++) {\r\n        action(array[i]);\r\n    }\r\n}\r\n\r\nexport function iterateIndexed(action, array) {\r\n    for (let i = 0; i <= (array.length - 1); i++) {\r\n        action(i, array[i]);\r\n    }\r\n}\r\n\r\nexport function iterate2(action, array1, array2) {\r\n    if (array1.length !== array2.length) {\r\n        differentLengths();\r\n    }\r\n    for (let i = 0; i <= (array1.length - 1); i++) {\r\n        action(array1[i], array2[i]);\r\n    }\r\n}\r\n\r\nexport function iterateIndexed2(action, array1, array2) {\r\n    if (array1.length !== array2.length) {\r\n        differentLengths();\r\n    }\r\n    for (let i = 0; i <= (array1.length - 1); i++) {\r\n        action(i, array1[i], array2[i]);\r\n    }\r\n}\r\n\r\nexport function isEmpty(array) {\r\n    return array.length === 0;\r\n}\r\n\r\nexport function forAll(predicate, array) {\r\n    return array.every(predicate);\r\n}\r\n\r\nexport function permute(f, array) {\r\n    const size = array.length | 0;\r\n    const res = array.slice();\r\n    const checkFlags = new Array(size);\r\n    iterateIndexed((i, x) => {\r\n        const j = f(i) | 0;\r\n        if ((j < 0) ? true : (j >= size)) {\r\n            throw (new Error(\"Not a valid permutation\"));\r\n        }\r\n        res[j] = x;\r\n        checkFlags[j] = 1;\r\n    }, array);\r\n    if (!(checkFlags.every(((y) => (1 === y))))) {\r\n        throw (new Error(\"Not a valid permutation\"));\r\n    }\r\n    return res;\r\n}\r\n\r\nexport function setSlice(target, lower, upper, source) {\r\n    const lower_1 = defaultArg(lower, 0) | 0;\r\n    const upper_1 = defaultArg(upper, 0) | 0;\r\n    const length = (((upper_1 > 0) ? upper_1 : (target.length - 1)) - lower_1) | 0;\r\n    for (let i = 0; i <= length; i++) {\r\n        target[i + lower_1] = source[i];\r\n    }\r\n}\r\n\r\nexport function sortInPlaceBy(projection, xs, comparer) {\r\n    xs.sort(((x, y) => comparer.Compare(projection(x), projection(y))));\r\n}\r\n\r\nexport function sortInPlace(xs, comparer) {\r\n    xs.sort(((x, y) => comparer.Compare(x, y)));\r\n}\r\n\r\nexport function sort(xs, comparer) {\r\n    const xs_1 = xs.slice();\r\n    xs_1.sort(((x, y) => comparer.Compare(x, y)));\r\n    return xs_1;\r\n}\r\n\r\nexport function sortBy(projection, xs, comparer) {\r\n    const xs_1 = xs.slice();\r\n    xs_1.sort(((x, y) => comparer.Compare(projection(x), projection(y))));\r\n    return xs_1;\r\n}\r\n\r\nexport function sortDescending(xs, comparer) {\r\n    const xs_1 = xs.slice();\r\n    xs_1.sort(((x, y) => (comparer.Compare(x, y) * -1)));\r\n    return xs_1;\r\n}\r\n\r\nexport function sortByDescending(projection, xs, comparer) {\r\n    const xs_1 = xs.slice();\r\n    xs_1.sort(((x, y) => (comparer.Compare(projection(x), projection(y)) * -1)));\r\n    return xs_1;\r\n}\r\n\r\nexport function sortWith(comparer, xs) {\r\n    const comparer_1 = comparer;\r\n    const xs_1 = xs.slice();\r\n    xs_1.sort(comparer_1);\r\n    return xs_1;\r\n}\r\n\r\nexport function allPairs(xs, ys) {\r\n    const len1 = xs.length | 0;\r\n    const len2 = ys.length | 0;\r\n    const res = new Array((len1 * len2));\r\n    for (let i = 0; i <= (xs.length - 1); i++) {\r\n        for (let j = 0; j <= (ys.length - 1); j++) {\r\n            res[(i * len2) + j] = [xs[i], ys[j]];\r\n        }\r\n    }\r\n    return res;\r\n}\r\n\r\nexport function unfold(generator, state) {\r\n    const res = [];\r\n    const loop = (state_1_mut) => {\r\n        loop:\r\n        while (true) {\r\n            const state_1 = state_1_mut;\r\n            const matchValue = generator(state_1);\r\n            if (matchValue != null) {\r\n                const x = matchValue[0];\r\n                const s = matchValue[1];\r\n                void (res.push(x));\r\n                state_1_mut = s;\r\n                continue loop;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    loop(state);\r\n    return res;\r\n}\r\n\r\nexport function unzip(array) {\r\n    const len = array.length | 0;\r\n    const res1 = new Array(len);\r\n    const res2 = new Array(len);\r\n    iterateIndexed((i, tupledArg) => {\r\n        res1[i] = tupledArg[0];\r\n        res2[i] = tupledArg[1];\r\n    }, array);\r\n    return [res1, res2];\r\n}\r\n\r\nexport function unzip3(array) {\r\n    const len = array.length | 0;\r\n    const res1 = new Array(len);\r\n    const res2 = new Array(len);\r\n    const res3 = new Array(len);\r\n    iterateIndexed((i, tupledArg) => {\r\n        res1[i] = tupledArg[0];\r\n        res2[i] = tupledArg[1];\r\n        res3[i] = tupledArg[2];\r\n    }, array);\r\n    return [res1, res2, res3];\r\n}\r\n\r\nexport function zip(array1, array2) {\r\n    if (array1.length !== array2.length) {\r\n        differentLengths();\r\n    }\r\n    const result = new Array(array1.length);\r\n    for (let i = 0; i <= (array1.length - 1); i++) {\r\n        result[i] = [array1[i], array2[i]];\r\n    }\r\n    return result;\r\n}\r\n\r\nexport function zip3(array1, array2, array3) {\r\n    if ((array1.length !== array2.length) ? true : (array2.length !== array3.length)) {\r\n        differentLengths();\r\n    }\r\n    const result = new Array(array1.length);\r\n    for (let i = 0; i <= (array1.length - 1); i++) {\r\n        result[i] = [array1[i], array2[i], array3[i]];\r\n    }\r\n    return result;\r\n}\r\n\r\nexport function chunkBySize(chunkSize, array) {\r\n    if (chunkSize < 1) {\r\n        throw (new Error(\"The input must be positive.\\\\nParameter name: size\"));\r\n    }\r\n    if (array.length === 0) {\r\n        return [[]];\r\n    }\r\n    else {\r\n        const result = [];\r\n        for (let x = 0; x <= ((~(~Math.ceil(array.length / chunkSize))) - 1); x++) {\r\n            let slice;\r\n            const start_1 = (x * chunkSize) | 0;\r\n            slice = (array.slice(start_1, (start_1 + chunkSize)));\r\n            void (result.push(slice));\r\n        }\r\n        return result;\r\n    }\r\n}\r\n\r\nexport function splitAt(index, array) {\r\n    let start;\r\n    if (index < 0) {\r\n        throw (new Error(\"The input must be non-negative\\\\nParameter name: index\"));\r\n    }\r\n    if (index > array.length) {\r\n        throw (new Error(\"The input sequence has an insufficient number of elements.\\\\nParameter name: index\"));\r\n    }\r\n    return [(start = 0, array.slice(start, (start + index))), array.slice(index)];\r\n}\r\n\r\nexport function compareWith(comparer, array1, array2) {\r\n    if (array1 == null) {\r\n        if (array2 == null) {\r\n            return 0;\r\n        }\r\n        else {\r\n            return -1;\r\n        }\r\n    }\r\n    else if (array2 == null) {\r\n        return 1;\r\n    }\r\n    else {\r\n        let i = 0;\r\n        let result = 0;\r\n        const length1 = array1.length | 0;\r\n        const length2 = array2.length | 0;\r\n        if (length1 > length2) {\r\n            return 1;\r\n        }\r\n        else if (length1 < length2) {\r\n            return -1;\r\n        }\r\n        else {\r\n            while ((i < length1) ? (result === 0) : false) {\r\n                result = (comparer(array1[i], array2[i]) | 0);\r\n                i = ((i + 1) | 0);\r\n            }\r\n            return result | 0;\r\n        }\r\n    }\r\n}\r\n\r\nexport function equalsWith(comparer, array1, array2) {\r\n    return compareWith((e1, e2) => compare(e1, e2), array1, array2) === 0;\r\n}\r\n\r\nexport function exactlyOne(array) {\r\n    if (array.length === 1) {\r\n        return array[0];\r\n    }\r\n    else if (array.length === 0) {\r\n        throw (new Error(\"The input sequence was empty\\\\nParameter name: array\"));\r\n    }\r\n    else {\r\n        throw (new Error(\"Input array too long\\\\nParameter name: array\"));\r\n    }\r\n}\r\n\r\nexport function tryExactlyOne(array) {\r\n    if (array.length === 1) {\r\n        return some(array[0]);\r\n    }\r\n    else {\r\n        return void 0;\r\n    }\r\n}\r\n\r\nexport function head(array) {\r\n    if (array.length === 0) {\r\n        throw (new Error(\"The input array was empty\\\\nParameter name: array\"));\r\n    }\r\n    else {\r\n        return array[0];\r\n    }\r\n}\r\n\r\nexport function tryHead(array) {\r\n    if (array.length === 0) {\r\n        return void 0;\r\n    }\r\n    else {\r\n        return some(array[0]);\r\n    }\r\n}\r\n\r\nexport function tail(array) {\r\n    if (array.length === 0) {\r\n        throw (new Error(\"Not enough elements\\\\nParameter name: array\"));\r\n    }\r\n    return array.slice(1);\r\n}\r\n\r\nexport function item(index, array) {\r\n    return array[index];\r\n}\r\n\r\nexport function tryItem(index, array) {\r\n    if ((index < 0) ? true : (index >= array.length)) {\r\n        return void 0;\r\n    }\r\n    else {\r\n        return some(array[index]);\r\n    }\r\n}\r\n\r\nexport function foldBackIndexed(folder, array, state) {\r\n    return array.reduceRight(((delegateArg0, delegateArg1, delegateArg2) => folder(delegateArg2, delegateArg1, delegateArg0)), state);\r\n}\r\n\r\nexport function foldBack(folder, array, state) {\r\n    return array.reduceRight(((delegateArg0, delegateArg1) => folder(delegateArg1, delegateArg0)), state);\r\n}\r\n\r\nexport function foldIndexed2(folder, state, array1, array2) {\r\n    let acc = state;\r\n    if (array1.length !== array2.length) {\r\n        throw (new Error(\"Arrays have different lengths\"));\r\n    }\r\n    for (let i = 0; i <= (array1.length - 1); i++) {\r\n        acc = folder(i, acc, array1[i], array2[i]);\r\n    }\r\n    return acc;\r\n}\r\n\r\nexport function fold2(folder, state, array1, array2) {\r\n    return foldIndexed2((_arg1, acc, x, y) => folder(acc, x, y), state, array1, array2);\r\n}\r\n\r\nexport function foldBackIndexed2(folder, array1, array2, state) {\r\n    let acc = state;\r\n    if (array1.length !== array2.length) {\r\n        differentLengths();\r\n    }\r\n    const size = array1.length | 0;\r\n    for (let i = 1; i <= size; i++) {\r\n        acc = folder(i - 1, array1[size - i], array2[size - i], acc);\r\n    }\r\n    return acc;\r\n}\r\n\r\nexport function foldBack2(f, array1, array2, state) {\r\n    return foldBackIndexed2((_arg1, x, y, acc) => f(x, y, acc), array1, array2, state);\r\n}\r\n\r\nexport function reduce(reduction, array) {\r\n    if (array.length === 0) {\r\n        throw (new Error(\"The input array was empty\"));\r\n    }\r\n    const reduction_1 = reduction;\r\n    return array.reduce(reduction_1);\r\n}\r\n\r\nexport function reduceBack(reduction, array) {\r\n    if (array.length === 0) {\r\n        throw (new Error(\"The input array was empty\"));\r\n    }\r\n    const reduction_1 = reduction;\r\n    return array.reduceRight(reduction_1);\r\n}\r\n\r\nexport function forAll2(predicate, array1, array2) {\r\n    return fold2((acc, x, y) => (acc ? predicate(x, y) : false), true, array1, array2);\r\n}\r\n\r\nexport function existsOffset(predicate_mut, array_mut, index_mut) {\r\n    existsOffset:\r\n    while (true) {\r\n        const predicate = predicate_mut, array = array_mut, index = index_mut;\r\n        if (index === array.length) {\r\n            return false;\r\n        }\r\n        else if (predicate(array[index])) {\r\n            return true;\r\n        }\r\n        else {\r\n            predicate_mut = predicate;\r\n            array_mut = array;\r\n            index_mut = (index + 1);\r\n            continue existsOffset;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function exists(predicate, array) {\r\n    return existsOffset(predicate, array, 0);\r\n}\r\n\r\nexport function existsOffset2(predicate_mut, array1_mut, array2_mut, index_mut) {\r\n    existsOffset2:\r\n    while (true) {\r\n        const predicate = predicate_mut, array1 = array1_mut, array2 = array2_mut, index = index_mut;\r\n        if (index === array1.length) {\r\n            return false;\r\n        }\r\n        else if (predicate(array1[index], array2[index])) {\r\n            return true;\r\n        }\r\n        else {\r\n            predicate_mut = predicate;\r\n            array1_mut = array1;\r\n            array2_mut = array2;\r\n            index_mut = (index + 1);\r\n            continue existsOffset2;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function exists2(predicate, array1, array2) {\r\n    if (array1.length !== array2.length) {\r\n        differentLengths();\r\n    }\r\n    return existsOffset2(predicate, array1, array2, 0);\r\n}\r\n\r\nexport function sum(array, adder) {\r\n    let acc = adder.GetZero();\r\n    for (let i = 0; i <= (array.length - 1); i++) {\r\n        acc = adder.Add(acc, array[i]);\r\n    }\r\n    return acc;\r\n}\r\n\r\nexport function sumBy(projection, array, adder) {\r\n    let acc = adder.GetZero();\r\n    for (let i = 0; i <= (array.length - 1); i++) {\r\n        acc = adder.Add(acc, projection(array[i]));\r\n    }\r\n    return acc;\r\n}\r\n\r\nexport function maxBy(projection, xs, comparer) {\r\n    return reduce((x, y) => ((comparer.Compare(projection(y), projection(x)) > 0) ? y : x), xs);\r\n}\r\n\r\nexport function max(xs, comparer) {\r\n    return reduce((x, y) => ((comparer.Compare(y, x) > 0) ? y : x), xs);\r\n}\r\n\r\nexport function minBy(projection, xs, comparer) {\r\n    return reduce((x, y) => ((comparer.Compare(projection(y), projection(x)) > 0) ? x : y), xs);\r\n}\r\n\r\nexport function min(xs, comparer) {\r\n    return reduce((x, y) => ((comparer.Compare(y, x) > 0) ? x : y), xs);\r\n}\r\n\r\nexport function average(array, averager) {\r\n    if (array.length === 0) {\r\n        throw (new Error(\"The input array was empty\\\\nParameter name: array\"));\r\n    }\r\n    let total = averager.GetZero();\r\n    for (let i = 0; i <= (array.length - 1); i++) {\r\n        total = averager.Add(total, array[i]);\r\n    }\r\n    return averager.DivideByInt(total, array.length);\r\n}\r\n\r\nexport function averageBy(projection, array, averager) {\r\n    if (array.length === 0) {\r\n        throw (new Error(\"The input array was empty\\\\nParameter name: array\"));\r\n    }\r\n    let total = averager.GetZero();\r\n    for (let i = 0; i <= (array.length - 1); i++) {\r\n        total = averager.Add(total, projection(array[i]));\r\n    }\r\n    return averager.DivideByInt(total, array.length);\r\n}\r\n\r\nexport function windowed(windowSize, source) {\r\n    if (windowSize <= 0) {\r\n        throw (new Error(\"windowSize must be positive\"));\r\n    }\r\n    let res;\r\n    const len = max_1((x, y) => comparePrimitives(x, y), 0, source.length - windowSize) | 0;\r\n    res = (new Array(len));\r\n    for (let i = windowSize; i <= source.length; i++) {\r\n        res[i - windowSize] = source.slice(i - windowSize, (i - 1) + 1);\r\n    }\r\n    return res;\r\n}\r\n\r\nexport function splitInto(chunks, array) {\r\n    if (chunks < 1) {\r\n        throw (new Error(\"The input must be positive.\\\\nParameter name: chunks\"));\r\n    }\r\n    if (array.length === 0) {\r\n        return [[]];\r\n    }\r\n    else {\r\n        const result = [];\r\n        const chunks_1 = min_1((x, y) => comparePrimitives(x, y), chunks, array.length) | 0;\r\n        const minChunkSize = (~(~(array.length / chunks_1))) | 0;\r\n        const chunksWithExtraItem = (array.length % chunks_1) | 0;\r\n        for (let i = 0; i <= (chunks_1 - 1); i++) {\r\n            const chunkSize = ((i < chunksWithExtraItem) ? (minChunkSize + 1) : minChunkSize) | 0;\r\n            let slice;\r\n            const start_1 = ((i * minChunkSize) + min_1((x_1, y_1) => comparePrimitives(x_1, y_1), chunksWithExtraItem, i)) | 0;\r\n            slice = (array.slice(start_1, (start_1 + chunkSize)));\r\n            void (result.push(slice));\r\n        }\r\n        return result;\r\n    }\r\n}\r\n\r\nexport function transpose(arrays, cons) {\r\n    const arrays_1 = Array.isArray(arrays) ? arrays : (Array.from(arrays));\r\n    const len = arrays_1.length | 0;\r\n    if (len === 0) {\r\n        return new Array(0);\r\n    }\r\n    else {\r\n        const lenInner = arrays_1[0].length | 0;\r\n        if (!forAll((a) => (a.length === lenInner), arrays_1)) {\r\n            differentLengths();\r\n        }\r\n        const result = new Array(lenInner);\r\n        for (let i = 0; i <= (lenInner - 1); i++) {\r\n            result[i] = Helpers_allocateArrayFromCons(cons, len);\r\n            for (let j = 0; j <= (len - 1); j++) {\r\n                result[i][j] = arrays_1[j][i];\r\n            }\r\n        }\r\n        return result;\r\n    }\r\n}\r\n\r\n","import { compare, equals, structuralHash } from \"./Util.js\";\n// Using a class here for better compatibility with TS files importing Some\nexport class Some {\n    constructor(value) {\n        this.value = value;\n    }\n    toJSON() {\n        return this.value;\n    }\n    // Don't add \"Some\" for consistency with erased options\n    toString() {\n        return String(this.value);\n    }\n    GetHashCode() {\n        return structuralHash(this.value);\n    }\n    Equals(other) {\n        if (other == null) {\n            return false;\n        }\n        else {\n            return equals(this.value, other instanceof Some ? other.value : other);\n        }\n    }\n    CompareTo(other) {\n        if (other == null) {\n            return 1;\n        }\n        else {\n            return compare(this.value, other instanceof Some ? other.value : other);\n        }\n    }\n}\nexport function some(x) {\n    return x == null || x instanceof Some ? new Some(x) : x;\n}\nexport function value(x) {\n    if (x == null) {\n        throw new Error(\"Option has no value\");\n    }\n    else {\n        return x instanceof Some ? x.value : x;\n    }\n}\nexport function ofNullable(x) {\n    // This will fail with unit probably, an alternative would be:\n    // return x === null ? undefined : (x === undefined ? new Some(x) : x);\n    return x == null ? undefined : x;\n}\nexport function toNullable(x) {\n    return x == null ? null : value(x);\n}\nexport function flatten(x) {\n    return x == null ? undefined : value(x);\n}\nexport function toArray(opt) {\n    return (opt == null) ? [] : [value(opt)];\n}\nexport function defaultArg(opt, defaultValue) {\n    return (opt != null) ? value(opt) : defaultValue;\n}\nexport function defaultArgWith(opt, defThunk) {\n    return (opt != null) ? value(opt) : defThunk();\n}\nexport function filter(predicate, opt) {\n    return (opt != null) ? (predicate(value(opt)) ? opt : undefined) : opt;\n}\nexport function map(mapping, opt) {\n    return (opt != null) ? some(mapping(value(opt))) : undefined;\n}\nexport function map2(mapping, opt1, opt2) {\n    return (opt1 != null && opt2 != null) ? mapping(value(opt1), value(opt2)) : undefined;\n}\nexport function map3(mapping, opt1, opt2, opt3) {\n    return (opt1 != null && opt2 != null && opt3 != null) ? mapping(value(opt1), value(opt2), value(opt3)) : undefined;\n}\nexport function bind(binder, opt) {\n    return opt != null ? binder(value(opt)) : undefined;\n}\nexport function tryOp(op, arg) {\n    try {\n        return some(op(arg));\n    }\n    catch (_a) {\n        return undefined;\n    }\n}\n","import { combineHashCodes, compare, compareArrays, equalArrays, equals, sameConstructor, numberHash, structuralHash } from \"./Util.js\";\nexport function seqToString(self) {\n    let count = 0;\n    let str = \"[\";\n    for (const x of self) {\n        if (count === 0) {\n            str += toString(x);\n        }\n        else if (count === 100) {\n            str += \"; ...\";\n            break;\n        }\n        else {\n            str += \"; \" + toString(x);\n        }\n        count++;\n    }\n    return str + \"]\";\n}\nexport function toString(x, callStack = 0) {\n    if (x != null && typeof x === \"object\") {\n        if (typeof x.toString === \"function\") {\n            return x.toString();\n        }\n        else if (Symbol.iterator in x) {\n            return seqToString(x);\n        }\n        else { // TODO: Date?\n            const cons = Object.getPrototypeOf(x).constructor;\n            return cons === Object && callStack < 10\n                // Same format as recordToString\n                ? \"{ \" + Object.entries(x).map(([k, v]) => k + \" = \" + toString(v, callStack + 1)).join(\"\\n  \") + \" }\"\n                : cons.name;\n        }\n    }\n    return String(x);\n}\nexport function unionToString(name, fields) {\n    if (fields.length === 0) {\n        return name;\n    }\n    else {\n        let fieldStr = \"\";\n        let withParens = true;\n        if (fields.length === 1) {\n            fieldStr = toString(fields[0]);\n            withParens = fieldStr.indexOf(\" \") >= 0;\n        }\n        else {\n            fieldStr = fields.map((x) => toString(x)).join(\", \");\n        }\n        return name + (withParens ? \" (\" : \" \") + fieldStr + (withParens ? \")\" : \"\");\n    }\n}\nexport class Union {\n    get name() {\n        return this.cases()[this.tag];\n    }\n    toJSON() {\n        return this.fields.length === 0 ? this.name : [this.name].concat(this.fields);\n    }\n    toString() {\n        return unionToString(this.name, this.fields);\n    }\n    GetHashCode() {\n        const hashes = this.fields.map((x) => structuralHash(x));\n        hashes.splice(0, 0, numberHash(this.tag));\n        return combineHashCodes(hashes);\n    }\n    Equals(other) {\n        if (this === other) {\n            return true;\n        }\n        else if (!sameConstructor(this, other)) {\n            return false;\n        }\n        else if (this.tag === other.tag) {\n            return equalArrays(this.fields, other.fields);\n        }\n        else {\n            return false;\n        }\n    }\n    CompareTo(other) {\n        if (this === other) {\n            return 0;\n        }\n        else if (!sameConstructor(this, other)) {\n            return -1;\n        }\n        else if (this.tag === other.tag) {\n            return compareArrays(this.fields, other.fields);\n        }\n        else {\n            return this.tag < other.tag ? -1 : 1;\n        }\n    }\n}\nfunction recordToJSON(self) {\n    const o = {};\n    const keys = Object.keys(self);\n    for (let i = 0; i < keys.length; i++) {\n        o[keys[i]] = self[keys[i]];\n    }\n    return o;\n}\nfunction recordToString(self) {\n    return \"{ \" + Object.entries(self).map(([k, v]) => k + \" = \" + toString(v)).join(\"\\n  \") + \" }\";\n}\nfunction recordGetHashCode(self) {\n    const hashes = Object.values(self).map((v) => structuralHash(v));\n    return combineHashCodes(hashes);\n}\nfunction recordEquals(self, other) {\n    if (self === other) {\n        return true;\n    }\n    else if (!sameConstructor(self, other)) {\n        return false;\n    }\n    else {\n        const thisNames = Object.keys(self);\n        for (let i = 0; i < thisNames.length; i++) {\n            if (!equals(self[thisNames[i]], other[thisNames[i]])) {\n                return false;\n            }\n        }\n        return true;\n    }\n}\nfunction recordCompareTo(self, other) {\n    if (self === other) {\n        return 0;\n    }\n    else if (!sameConstructor(self, other)) {\n        return -1;\n    }\n    else {\n        const thisNames = Object.keys(self);\n        for (let i = 0; i < thisNames.length; i++) {\n            const result = compare(self[thisNames[i]], other[thisNames[i]]);\n            if (result !== 0) {\n                return result;\n            }\n        }\n        return 0;\n    }\n}\nexport class Record {\n    toJSON() { return recordToJSON(this); }\n    toString() { return recordToString(this); }\n    GetHashCode() { return recordGetHashCode(this); }\n    Equals(other) { return recordEquals(this, other); }\n    CompareTo(other) { return recordCompareTo(this, other); }\n}\nexport class FSharpRef {\n    constructor(contentsOrGetter, setter) {\n        if (typeof setter === \"function\") {\n            this.getter = contentsOrGetter;\n            this.setter = setter;\n        }\n        else {\n            this.getter = () => contentsOrGetter;\n            this.setter = (v) => { contentsOrGetter = v; };\n        }\n    }\n    get contents() {\n        return this.getter();\n    }\n    set contents(v) {\n        this.setter(v);\n    }\n}\n// EXCEPTIONS\n// Exception is intentionally not derived from Error, for performance reasons (see #2160)\nexport class Exception {\n    constructor(message) {\n        this.message = message;\n    }\n}\nexport function isException(x) {\n    return x instanceof Exception || x instanceof Error;\n}\nexport class FSharpException extends Exception {\n    toJSON() { return recordToJSON(this); }\n    toString() { return recordToString(this); }\n    GetHashCode() { return recordGetHashCode(this); }\n    Equals(other) { return recordEquals(this, other); }\n    CompareTo(other) { return recordCompareTo(this, other); }\n}\nexport class MatchFailureException extends FSharpException {\n    constructor(arg1, arg2, arg3) {\n        super();\n        this.arg1 = arg1;\n        this.arg2 = arg2 | 0;\n        this.arg3 = arg3 | 0;\n        this.message = \"The match cases were incomplete\";\n    }\n}\nexport class Attribute {\n}\n","import { record_type, bool_type, list_type, option_type, class_type } from \"./Reflection.js\";\r\nimport { some, value as value_1 } from \"./Option.js\";\r\nimport { singleton, ofArrayWithTail, head, tail, isEmpty as isEmpty_1, FSharpList, fold as fold_1, empty as empty_1, cons } from \"./List.js\";\r\nimport { fill } from \"./Array.js\";\r\nimport { structuralHash, compare, toIterator, equals, getEnumerator, isArrayLike } from \"./Util.js\";\r\nimport { Record } from \"./Types.js\";\r\nimport { tryPick as tryPick_1, pick as pick_1, iterate as iterate_1, compareWith, map as map_1, unfold } from \"./Seq.js\";\r\nimport { format, join } from \"./String.js\";\r\nimport { LanguagePrimitives_FastGenericComparer } from \"./FSharp.Core.js\";\r\n\r\nexport class MapTreeLeaf$2 {\r\n    constructor(k, v) {\r\n        this.k = k;\r\n        this.v = v;\r\n    }\r\n}\r\n\r\nexport function MapTreeLeaf$2$reflection(gen0, gen1) {\r\n    return class_type(\"Map.MapTreeLeaf`2\", [gen0, gen1], MapTreeLeaf$2);\r\n}\r\n\r\nexport function MapTreeLeaf$2_$ctor_5BDDA1(k, v) {\r\n    return new MapTreeLeaf$2(k, v);\r\n}\r\n\r\nexport function MapTreeLeaf$2__get_Key(_) {\r\n    return _.k;\r\n}\r\n\r\nexport function MapTreeLeaf$2__get_Value(_) {\r\n    return _.v;\r\n}\r\n\r\nexport class MapTreeNode$2 extends MapTreeLeaf$2 {\r\n    constructor(k, v, left, right, h) {\r\n        super(k, v);\r\n        this.left = left;\r\n        this.right = right;\r\n        this.h = (h | 0);\r\n    }\r\n}\r\n\r\nexport function MapTreeNode$2$reflection(gen0, gen1) {\r\n    return class_type(\"Map.MapTreeNode`2\", [gen0, gen1], MapTreeNode$2, MapTreeLeaf$2$reflection(gen0, gen1));\r\n}\r\n\r\nexport function MapTreeNode$2_$ctor_499A11FD(k, v, left, right, h) {\r\n    return new MapTreeNode$2(k, v, left, right, h);\r\n}\r\n\r\nexport function MapTreeNode$2__get_Left(_) {\r\n    return _.left;\r\n}\r\n\r\nexport function MapTreeNode$2__get_Right(_) {\r\n    return _.right;\r\n}\r\n\r\nexport function MapTreeNode$2__get_Height(_) {\r\n    return _.h;\r\n}\r\n\r\nexport function MapTreeModule_empty() {\r\n    return void 0;\r\n}\r\n\r\nexport function MapTreeModule_sizeAux(acc_mut, m_mut) {\r\n    MapTreeModule_sizeAux:\r\n    while (true) {\r\n        const acc = acc_mut, m = m_mut;\r\n        if (m != null) {\r\n            const m2 = m;\r\n            if (m2 instanceof MapTreeNode$2) {\r\n                acc_mut = MapTreeModule_sizeAux(acc + 1, MapTreeNode$2__get_Left(m2));\r\n                m_mut = MapTreeNode$2__get_Right(m2);\r\n                continue MapTreeModule_sizeAux;\r\n            }\r\n            else {\r\n                return (acc + 1) | 0;\r\n            }\r\n        }\r\n        else {\r\n            return acc | 0;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_size(x) {\r\n    return MapTreeModule_sizeAux(0, x);\r\n}\r\n\r\nexport function MapTreeModule_mk(l, k, v, r) {\r\n    let hl;\r\n    const m = l;\r\n    if (m != null) {\r\n        const m2 = m;\r\n        hl = ((m2 instanceof MapTreeNode$2) ? MapTreeNode$2__get_Height(m2) : 1);\r\n    }\r\n    else {\r\n        hl = 0;\r\n    }\r\n    let hr;\r\n    const m_1 = r;\r\n    if (m_1 != null) {\r\n        const m2_1 = m_1;\r\n        hr = ((m2_1 instanceof MapTreeNode$2) ? MapTreeNode$2__get_Height(m2_1) : 1);\r\n    }\r\n    else {\r\n        hr = 0;\r\n    }\r\n    const m_2 = ((hl < hr) ? hr : hl) | 0;\r\n    if (m_2 === 0) {\r\n        return MapTreeLeaf$2_$ctor_5BDDA1(k, v);\r\n    }\r\n    else {\r\n        return MapTreeNode$2_$ctor_499A11FD(k, v, l, r, m_2 + 1);\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_rebalance(t1, k, v, t2) {\r\n    let m_2, m2_2, m_3, m2_3;\r\n    let t1h;\r\n    const m = t1;\r\n    if (m != null) {\r\n        const m2 = m;\r\n        t1h = ((m2 instanceof MapTreeNode$2) ? MapTreeNode$2__get_Height(m2) : 1);\r\n    }\r\n    else {\r\n        t1h = 0;\r\n    }\r\n    let t2h;\r\n    const m_1 = t2;\r\n    if (m_1 != null) {\r\n        const m2_1 = m_1;\r\n        t2h = ((m2_1 instanceof MapTreeNode$2) ? MapTreeNode$2__get_Height(m2_1) : 1);\r\n    }\r\n    else {\r\n        t2h = 0;\r\n    }\r\n    if (t2h > (t1h + 2)) {\r\n        const matchValue = value_1(t2);\r\n        if (matchValue instanceof MapTreeNode$2) {\r\n            if (((m_2 = MapTreeNode$2__get_Left(matchValue), (m_2 != null) ? ((m2_2 = m_2, (m2_2 instanceof MapTreeNode$2) ? MapTreeNode$2__get_Height(m2_2) : 1)) : 0)) > (t1h + 1)) {\r\n                const matchValue_1 = value_1(MapTreeNode$2__get_Left(matchValue));\r\n                if (matchValue_1 instanceof MapTreeNode$2) {\r\n                    return MapTreeModule_mk(MapTreeModule_mk(t1, k, v, MapTreeNode$2__get_Left(matchValue_1)), MapTreeLeaf$2__get_Key(matchValue_1), MapTreeLeaf$2__get_Value(matchValue_1), MapTreeModule_mk(MapTreeNode$2__get_Right(matchValue_1), MapTreeLeaf$2__get_Key(matchValue), MapTreeLeaf$2__get_Value(matchValue), MapTreeNode$2__get_Right(matchValue)));\r\n                }\r\n                else {\r\n                    throw (new Error(\"internal error: Map.rebalance\"));\r\n                }\r\n            }\r\n            else {\r\n                return MapTreeModule_mk(MapTreeModule_mk(t1, k, v, MapTreeNode$2__get_Left(matchValue)), MapTreeLeaf$2__get_Key(matchValue), MapTreeLeaf$2__get_Value(matchValue), MapTreeNode$2__get_Right(matchValue));\r\n            }\r\n        }\r\n        else {\r\n            throw (new Error(\"internal error: Map.rebalance\"));\r\n        }\r\n    }\r\n    else if (t1h > (t2h + 2)) {\r\n        const matchValue_2 = value_1(t1);\r\n        if (matchValue_2 instanceof MapTreeNode$2) {\r\n            if (((m_3 = MapTreeNode$2__get_Right(matchValue_2), (m_3 != null) ? ((m2_3 = m_3, (m2_3 instanceof MapTreeNode$2) ? MapTreeNode$2__get_Height(m2_3) : 1)) : 0)) > (t2h + 1)) {\r\n                const matchValue_3 = value_1(MapTreeNode$2__get_Right(matchValue_2));\r\n                if (matchValue_3 instanceof MapTreeNode$2) {\r\n                    return MapTreeModule_mk(MapTreeModule_mk(MapTreeNode$2__get_Left(matchValue_2), MapTreeLeaf$2__get_Key(matchValue_2), MapTreeLeaf$2__get_Value(matchValue_2), MapTreeNode$2__get_Left(matchValue_3)), MapTreeLeaf$2__get_Key(matchValue_3), MapTreeLeaf$2__get_Value(matchValue_3), MapTreeModule_mk(MapTreeNode$2__get_Right(matchValue_3), k, v, t2));\r\n                }\r\n                else {\r\n                    throw (new Error(\"internal error: Map.rebalance\"));\r\n                }\r\n            }\r\n            else {\r\n                return MapTreeModule_mk(MapTreeNode$2__get_Left(matchValue_2), MapTreeLeaf$2__get_Key(matchValue_2), MapTreeLeaf$2__get_Value(matchValue_2), MapTreeModule_mk(MapTreeNode$2__get_Right(matchValue_2), k, v, t2));\r\n            }\r\n        }\r\n        else {\r\n            throw (new Error(\"internal error: Map.rebalance\"));\r\n        }\r\n    }\r\n    else {\r\n        return MapTreeModule_mk(t1, k, v, t2);\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_add(comparer, k, v, m) {\r\n    if (m != null) {\r\n        const m2 = m;\r\n        const c = comparer.Compare(k, MapTreeLeaf$2__get_Key(m2)) | 0;\r\n        if (m2 instanceof MapTreeNode$2) {\r\n            if (c < 0) {\r\n                return MapTreeModule_rebalance(MapTreeModule_add(comparer, k, v, MapTreeNode$2__get_Left(m2)), MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2), MapTreeNode$2__get_Right(m2));\r\n            }\r\n            else if (c === 0) {\r\n                return MapTreeNode$2_$ctor_499A11FD(k, v, MapTreeNode$2__get_Left(m2), MapTreeNode$2__get_Right(m2), MapTreeNode$2__get_Height(m2));\r\n            }\r\n            else {\r\n                return MapTreeModule_rebalance(MapTreeNode$2__get_Left(m2), MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2), MapTreeModule_add(comparer, k, v, MapTreeNode$2__get_Right(m2)));\r\n            }\r\n        }\r\n        else if (c < 0) {\r\n            return MapTreeNode$2_$ctor_499A11FD(k, v, MapTreeModule_empty(), m, 2);\r\n        }\r\n        else if (c === 0) {\r\n            return MapTreeLeaf$2_$ctor_5BDDA1(k, v);\r\n        }\r\n        else {\r\n            return MapTreeNode$2_$ctor_499A11FD(k, v, m, MapTreeModule_empty(), 2);\r\n        }\r\n    }\r\n    else {\r\n        return MapTreeLeaf$2_$ctor_5BDDA1(k, v);\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_tryFind(comparer_mut, k_mut, m_mut) {\r\n    MapTreeModule_tryFind:\r\n    while (true) {\r\n        const comparer = comparer_mut, k = k_mut, m = m_mut;\r\n        if (m != null) {\r\n            const m2 = m;\r\n            const c = comparer.Compare(k, MapTreeLeaf$2__get_Key(m2)) | 0;\r\n            if (c === 0) {\r\n                return some(MapTreeLeaf$2__get_Value(m2));\r\n            }\r\n            else if (m2 instanceof MapTreeNode$2) {\r\n                comparer_mut = comparer;\r\n                k_mut = k;\r\n                m_mut = ((c < 0) ? MapTreeNode$2__get_Left(m2) : MapTreeNode$2__get_Right(m2));\r\n                continue MapTreeModule_tryFind;\r\n            }\r\n            else {\r\n                return void 0;\r\n            }\r\n        }\r\n        else {\r\n            return void 0;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_find(comparer, k, m) {\r\n    const matchValue = MapTreeModule_tryFind(comparer, k, m);\r\n    if (matchValue == null) {\r\n        throw (new Error());\r\n    }\r\n    else {\r\n        return value_1(matchValue);\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_partition1(comparer, f, k, v, acc1, acc2) {\r\n    if (f(k, v)) {\r\n        return [MapTreeModule_add(comparer, k, v, acc1), acc2];\r\n    }\r\n    else {\r\n        return [acc1, MapTreeModule_add(comparer, k, v, acc2)];\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_partitionAux(comparer_mut, f_mut, m_mut, acc_0_mut, acc_1_mut) {\r\n    MapTreeModule_partitionAux:\r\n    while (true) {\r\n        const comparer = comparer_mut, f = f_mut, m = m_mut, acc_0 = acc_0_mut, acc_1 = acc_1_mut;\r\n        const acc = [acc_0, acc_1];\r\n        if (m != null) {\r\n            const m2 = m;\r\n            if (m2 instanceof MapTreeNode$2) {\r\n                const acc_2 = MapTreeModule_partitionAux(comparer, f, MapTreeNode$2__get_Right(m2), acc[0], acc[1]);\r\n                const acc_3 = MapTreeModule_partition1(comparer, f, MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2), acc_2[0], acc_2[1]);\r\n                comparer_mut = comparer;\r\n                f_mut = f;\r\n                m_mut = MapTreeNode$2__get_Left(m2);\r\n                acc_0_mut = acc_3[0];\r\n                acc_1_mut = acc_3[1];\r\n                continue MapTreeModule_partitionAux;\r\n            }\r\n            else {\r\n                return MapTreeModule_partition1(comparer, f, MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2), acc[0], acc[1]);\r\n            }\r\n        }\r\n        else {\r\n            return acc;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_partition(comparer, f, m) {\r\n    return MapTreeModule_partitionAux(comparer, f, m, MapTreeModule_empty(), MapTreeModule_empty());\r\n}\r\n\r\nexport function MapTreeModule_filter1(comparer, f, k, v, acc) {\r\n    if (f(k, v)) {\r\n        return MapTreeModule_add(comparer, k, v, acc);\r\n    }\r\n    else {\r\n        return acc;\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_filterAux(comparer_mut, f_mut, m_mut, acc_mut) {\r\n    MapTreeModule_filterAux:\r\n    while (true) {\r\n        const comparer = comparer_mut, f = f_mut, m = m_mut, acc = acc_mut;\r\n        if (m != null) {\r\n            const m2 = m;\r\n            if (m2 instanceof MapTreeNode$2) {\r\n                const acc_1 = MapTreeModule_filterAux(comparer, f, MapTreeNode$2__get_Left(m2), acc);\r\n                const acc_2 = MapTreeModule_filter1(comparer, f, MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2), acc_1);\r\n                comparer_mut = comparer;\r\n                f_mut = f;\r\n                m_mut = MapTreeNode$2__get_Right(m2);\r\n                acc_mut = acc_2;\r\n                continue MapTreeModule_filterAux;\r\n            }\r\n            else {\r\n                return MapTreeModule_filter1(comparer, f, MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2), acc);\r\n            }\r\n        }\r\n        else {\r\n            return acc;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_filter(comparer, f, m) {\r\n    return MapTreeModule_filterAux(comparer, f, m, MapTreeModule_empty());\r\n}\r\n\r\nexport function MapTreeModule_spliceOutSuccessor(m) {\r\n    if (m != null) {\r\n        const m2 = m;\r\n        if (m2 instanceof MapTreeNode$2) {\r\n            if (MapTreeNode$2__get_Left(m2) == null) {\r\n                return [MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2), MapTreeNode$2__get_Right(m2)];\r\n            }\r\n            else {\r\n                const patternInput = MapTreeModule_spliceOutSuccessor(MapTreeNode$2__get_Left(m2));\r\n                return [patternInput[0], patternInput[1], MapTreeModule_mk(patternInput[2], MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2), MapTreeNode$2__get_Right(m2))];\r\n            }\r\n        }\r\n        else {\r\n            return [MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2), MapTreeModule_empty()];\r\n        }\r\n    }\r\n    else {\r\n        throw (new Error(\"internal error: Map.spliceOutSuccessor\"));\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_remove(comparer, k, m) {\r\n    if (m != null) {\r\n        const m2 = m;\r\n        const c = comparer.Compare(k, MapTreeLeaf$2__get_Key(m2)) | 0;\r\n        if (m2 instanceof MapTreeNode$2) {\r\n            if (c < 0) {\r\n                return MapTreeModule_rebalance(MapTreeModule_remove(comparer, k, MapTreeNode$2__get_Left(m2)), MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2), MapTreeNode$2__get_Right(m2));\r\n            }\r\n            else if (c === 0) {\r\n                if (MapTreeNode$2__get_Left(m2) == null) {\r\n                    return MapTreeNode$2__get_Right(m2);\r\n                }\r\n                else if (MapTreeNode$2__get_Right(m2) == null) {\r\n                    return MapTreeNode$2__get_Left(m2);\r\n                }\r\n                else {\r\n                    const patternInput = MapTreeModule_spliceOutSuccessor(MapTreeNode$2__get_Right(m2));\r\n                    return MapTreeModule_mk(MapTreeNode$2__get_Left(m2), patternInput[0], patternInput[1], patternInput[2]);\r\n                }\r\n            }\r\n            else {\r\n                return MapTreeModule_rebalance(MapTreeNode$2__get_Left(m2), MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2), MapTreeModule_remove(comparer, k, MapTreeNode$2__get_Right(m2)));\r\n            }\r\n        }\r\n        else if (c === 0) {\r\n            return MapTreeModule_empty();\r\n        }\r\n        else {\r\n            return m;\r\n        }\r\n    }\r\n    else {\r\n        return MapTreeModule_empty();\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_change(comparer, k, u, m) {\r\n    if (m != null) {\r\n        const m2 = m;\r\n        if (m2 instanceof MapTreeNode$2) {\r\n            const c = comparer.Compare(k, MapTreeLeaf$2__get_Key(m2)) | 0;\r\n            if (c < 0) {\r\n                return MapTreeModule_rebalance(MapTreeModule_change(comparer, k, u, MapTreeNode$2__get_Left(m2)), MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2), MapTreeNode$2__get_Right(m2));\r\n            }\r\n            else if (c === 0) {\r\n                const matchValue_1 = u(some(MapTreeLeaf$2__get_Value(m2)));\r\n                if (matchValue_1 != null) {\r\n                    return MapTreeNode$2_$ctor_499A11FD(k, value_1(matchValue_1), MapTreeNode$2__get_Left(m2), MapTreeNode$2__get_Right(m2), MapTreeNode$2__get_Height(m2));\r\n                }\r\n                else if (MapTreeNode$2__get_Left(m2) == null) {\r\n                    return MapTreeNode$2__get_Right(m2);\r\n                }\r\n                else if (MapTreeNode$2__get_Right(m2) == null) {\r\n                    return MapTreeNode$2__get_Left(m2);\r\n                }\r\n                else {\r\n                    const patternInput = MapTreeModule_spliceOutSuccessor(MapTreeNode$2__get_Right(m2));\r\n                    return MapTreeModule_mk(MapTreeNode$2__get_Left(m2), patternInput[0], patternInput[1], patternInput[2]);\r\n                }\r\n            }\r\n            else {\r\n                return MapTreeModule_rebalance(MapTreeNode$2__get_Left(m2), MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2), MapTreeModule_change(comparer, k, u, MapTreeNode$2__get_Right(m2)));\r\n            }\r\n        }\r\n        else {\r\n            const c_1 = comparer.Compare(k, MapTreeLeaf$2__get_Key(m2)) | 0;\r\n            if (c_1 < 0) {\r\n                const matchValue_2 = u(void 0);\r\n                if (matchValue_2 != null) {\r\n                    return MapTreeNode$2_$ctor_499A11FD(k, value_1(matchValue_2), MapTreeModule_empty(), m, 2);\r\n                }\r\n                else {\r\n                    return m;\r\n                }\r\n            }\r\n            else if (c_1 === 0) {\r\n                const matchValue_3 = u(some(MapTreeLeaf$2__get_Value(m2)));\r\n                if (matchValue_3 != null) {\r\n                    return MapTreeLeaf$2_$ctor_5BDDA1(k, value_1(matchValue_3));\r\n                }\r\n                else {\r\n                    return MapTreeModule_empty();\r\n                }\r\n            }\r\n            else {\r\n                const matchValue_4 = u(void 0);\r\n                if (matchValue_4 != null) {\r\n                    return MapTreeNode$2_$ctor_499A11FD(k, value_1(matchValue_4), m, MapTreeModule_empty(), 2);\r\n                }\r\n                else {\r\n                    return m;\r\n                }\r\n            }\r\n        }\r\n    }\r\n    else {\r\n        const matchValue = u(void 0);\r\n        if (matchValue != null) {\r\n            return MapTreeLeaf$2_$ctor_5BDDA1(k, value_1(matchValue));\r\n        }\r\n        else {\r\n            return m;\r\n        }\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_mem(comparer_mut, k_mut, m_mut) {\r\n    MapTreeModule_mem:\r\n    while (true) {\r\n        const comparer = comparer_mut, k = k_mut, m = m_mut;\r\n        if (m != null) {\r\n            const m2 = m;\r\n            const c = comparer.Compare(k, MapTreeLeaf$2__get_Key(m2)) | 0;\r\n            if (m2 instanceof MapTreeNode$2) {\r\n                if (c < 0) {\r\n                    comparer_mut = comparer;\r\n                    k_mut = k;\r\n                    m_mut = MapTreeNode$2__get_Left(m2);\r\n                    continue MapTreeModule_mem;\r\n                }\r\n                else if (c === 0) {\r\n                    return true;\r\n                }\r\n                else {\r\n                    comparer_mut = comparer;\r\n                    k_mut = k;\r\n                    m_mut = MapTreeNode$2__get_Right(m2);\r\n                    continue MapTreeModule_mem;\r\n                }\r\n            }\r\n            else {\r\n                return c === 0;\r\n            }\r\n        }\r\n        else {\r\n            return false;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_iterOpt(f_mut, m_mut) {\r\n    MapTreeModule_iterOpt:\r\n    while (true) {\r\n        const f = f_mut, m = m_mut;\r\n        if (m != null) {\r\n            const m2 = m;\r\n            if (m2 instanceof MapTreeNode$2) {\r\n                MapTreeModule_iterOpt(f, MapTreeNode$2__get_Left(m2));\r\n                f(MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2));\r\n                f_mut = f;\r\n                m_mut = MapTreeNode$2__get_Right(m2);\r\n                continue MapTreeModule_iterOpt;\r\n            }\r\n            else {\r\n                f(MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2));\r\n            }\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_iter(f, m) {\r\n    MapTreeModule_iterOpt(f, m);\r\n}\r\n\r\nexport function MapTreeModule_tryPickOpt(f_mut, m_mut) {\r\n    MapTreeModule_tryPickOpt:\r\n    while (true) {\r\n        const f = f_mut, m = m_mut;\r\n        if (m != null) {\r\n            const m2 = m;\r\n            if (m2 instanceof MapTreeNode$2) {\r\n                const matchValue = MapTreeModule_tryPickOpt(f, MapTreeNode$2__get_Left(m2));\r\n                if (matchValue == null) {\r\n                    const matchValue_1 = f(MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2));\r\n                    if (matchValue_1 == null) {\r\n                        f_mut = f;\r\n                        m_mut = MapTreeNode$2__get_Right(m2);\r\n                        continue MapTreeModule_tryPickOpt;\r\n                    }\r\n                    else {\r\n                        return matchValue_1;\r\n                    }\r\n                }\r\n                else {\r\n                    return matchValue;\r\n                }\r\n            }\r\n            else {\r\n                return f(MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2));\r\n            }\r\n        }\r\n        else {\r\n            return void 0;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_tryPick(f, m) {\r\n    return MapTreeModule_tryPickOpt(f, m);\r\n}\r\n\r\nexport function MapTreeModule_existsOpt(f_mut, m_mut) {\r\n    MapTreeModule_existsOpt:\r\n    while (true) {\r\n        const f = f_mut, m = m_mut;\r\n        if (m != null) {\r\n            const m2 = m;\r\n            if (m2 instanceof MapTreeNode$2) {\r\n                if (MapTreeModule_existsOpt(f, MapTreeNode$2__get_Left(m2)) ? true : f(MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2))) {\r\n                    return true;\r\n                }\r\n                else {\r\n                    f_mut = f;\r\n                    m_mut = MapTreeNode$2__get_Right(m2);\r\n                    continue MapTreeModule_existsOpt;\r\n                }\r\n            }\r\n            else {\r\n                return f(MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2));\r\n            }\r\n        }\r\n        else {\r\n            return false;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_exists(f, m) {\r\n    return MapTreeModule_existsOpt(f, m);\r\n}\r\n\r\nexport function MapTreeModule_forallOpt(f_mut, m_mut) {\r\n    MapTreeModule_forallOpt:\r\n    while (true) {\r\n        const f = f_mut, m = m_mut;\r\n        if (m != null) {\r\n            const m2 = m;\r\n            if (m2 instanceof MapTreeNode$2) {\r\n                if (MapTreeModule_forallOpt(f, MapTreeNode$2__get_Left(m2)) ? f(MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2)) : false) {\r\n                    f_mut = f;\r\n                    m_mut = MapTreeNode$2__get_Right(m2);\r\n                    continue MapTreeModule_forallOpt;\r\n                }\r\n                else {\r\n                    return false;\r\n                }\r\n            }\r\n            else {\r\n                return f(MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2));\r\n            }\r\n        }\r\n        else {\r\n            return true;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_forall(f, m) {\r\n    return MapTreeModule_forallOpt(f, m);\r\n}\r\n\r\nexport function MapTreeModule_map(f, m) {\r\n    if (m != null) {\r\n        const m2 = m;\r\n        if (m2 instanceof MapTreeNode$2) {\r\n            const l2 = MapTreeModule_map(f, MapTreeNode$2__get_Left(m2));\r\n            const v2 = f(MapTreeLeaf$2__get_Value(m2));\r\n            const r2 = MapTreeModule_map(f, MapTreeNode$2__get_Right(m2));\r\n            return MapTreeNode$2_$ctor_499A11FD(MapTreeLeaf$2__get_Key(m2), v2, l2, r2, MapTreeNode$2__get_Height(m2));\r\n        }\r\n        else {\r\n            return MapTreeLeaf$2_$ctor_5BDDA1(MapTreeLeaf$2__get_Key(m2), f(MapTreeLeaf$2__get_Value(m2)));\r\n        }\r\n    }\r\n    else {\r\n        return MapTreeModule_empty();\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_mapiOpt(f, m) {\r\n    if (m != null) {\r\n        const m2 = m;\r\n        if (m2 instanceof MapTreeNode$2) {\r\n            const l2 = MapTreeModule_mapiOpt(f, MapTreeNode$2__get_Left(m2));\r\n            const v2 = f(MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2));\r\n            const r2 = MapTreeModule_mapiOpt(f, MapTreeNode$2__get_Right(m2));\r\n            return MapTreeNode$2_$ctor_499A11FD(MapTreeLeaf$2__get_Key(m2), v2, l2, r2, MapTreeNode$2__get_Height(m2));\r\n        }\r\n        else {\r\n            return MapTreeLeaf$2_$ctor_5BDDA1(MapTreeLeaf$2__get_Key(m2), f(MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2)));\r\n        }\r\n    }\r\n    else {\r\n        return MapTreeModule_empty();\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_mapi(f, m) {\r\n    return MapTreeModule_mapiOpt(f, m);\r\n}\r\n\r\nexport function MapTreeModule_foldBackOpt(f_mut, m_mut, x_mut) {\r\n    MapTreeModule_foldBackOpt:\r\n    while (true) {\r\n        const f = f_mut, m = m_mut, x = x_mut;\r\n        if (m != null) {\r\n            const m2 = m;\r\n            if (m2 instanceof MapTreeNode$2) {\r\n                const x_1 = MapTreeModule_foldBackOpt(f, MapTreeNode$2__get_Right(m2), x);\r\n                const x_2 = f(MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2), x_1);\r\n                f_mut = f;\r\n                m_mut = MapTreeNode$2__get_Left(m2);\r\n                x_mut = x_2;\r\n                continue MapTreeModule_foldBackOpt;\r\n            }\r\n            else {\r\n                return f(MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2), x);\r\n            }\r\n        }\r\n        else {\r\n            return x;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_foldBack(f, m, x) {\r\n    return MapTreeModule_foldBackOpt(f, m, x);\r\n}\r\n\r\nexport function MapTreeModule_foldOpt(f_mut, x_mut, m_mut) {\r\n    MapTreeModule_foldOpt:\r\n    while (true) {\r\n        const f = f_mut, x = x_mut, m = m_mut;\r\n        if (m != null) {\r\n            const m2 = m;\r\n            if (m2 instanceof MapTreeNode$2) {\r\n                f_mut = f;\r\n                x_mut = f(MapTreeModule_foldOpt(f, x, MapTreeNode$2__get_Left(m2)), MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2));\r\n                m_mut = MapTreeNode$2__get_Right(m2);\r\n                continue MapTreeModule_foldOpt;\r\n            }\r\n            else {\r\n                return f(x, MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2));\r\n            }\r\n        }\r\n        else {\r\n            return x;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_fold(f, x, m) {\r\n    return MapTreeModule_foldOpt(f, x, m);\r\n}\r\n\r\nexport function MapTreeModule_foldSectionOpt(comparer, lo, hi, f, m, x) {\r\n    const foldFromTo = (f_1_mut, m_1_mut, x_1_mut) => {\r\n        foldFromTo:\r\n        while (true) {\r\n            const f_1 = f_1_mut, m_1 = m_1_mut, x_1 = x_1_mut;\r\n            if (m_1 != null) {\r\n                const m2 = m_1;\r\n                if (m2 instanceof MapTreeNode$2) {\r\n                    const cLoKey = comparer.Compare(lo, MapTreeLeaf$2__get_Key(m2)) | 0;\r\n                    const cKeyHi = comparer.Compare(MapTreeLeaf$2__get_Key(m2), hi) | 0;\r\n                    const x_2 = (cLoKey < 0) ? foldFromTo(f_1, MapTreeNode$2__get_Left(m2), x_1) : x_1;\r\n                    const x_3 = ((cLoKey <= 0) ? (cKeyHi <= 0) : false) ? f_1(MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2), x_2) : x_2;\r\n                    if (cKeyHi < 0) {\r\n                        f_1_mut = f_1;\r\n                        m_1_mut = MapTreeNode$2__get_Right(m2);\r\n                        x_1_mut = x_3;\r\n                        continue foldFromTo;\r\n                    }\r\n                    else {\r\n                        return x_3;\r\n                    }\r\n                }\r\n                else if ((comparer.Compare(lo, MapTreeLeaf$2__get_Key(m2)) <= 0) ? (comparer.Compare(MapTreeLeaf$2__get_Key(m2), hi) <= 0) : false) {\r\n                    return f_1(MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2), x_1);\r\n                }\r\n                else {\r\n                    return x_1;\r\n                }\r\n            }\r\n            else {\r\n                return x_1;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    if (comparer.Compare(lo, hi) === 1) {\r\n        return x;\r\n    }\r\n    else {\r\n        return foldFromTo(f, m, x);\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_foldSection(comparer, lo, hi, f, m, x) {\r\n    return MapTreeModule_foldSectionOpt(comparer, lo, hi, f, m, x);\r\n}\r\n\r\nexport function MapTreeModule_toList(m) {\r\n    const loop = (m_1_mut, acc_mut) => {\r\n        loop:\r\n        while (true) {\r\n            const m_1 = m_1_mut, acc = acc_mut;\r\n            if (m_1 != null) {\r\n                const m2 = m_1;\r\n                if (m2 instanceof MapTreeNode$2) {\r\n                    m_1_mut = MapTreeNode$2__get_Left(m2);\r\n                    acc_mut = cons([MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2)], loop(MapTreeNode$2__get_Right(m2), acc));\r\n                    continue loop;\r\n                }\r\n                else {\r\n                    return cons([MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2)], acc);\r\n                }\r\n            }\r\n            else {\r\n                return acc;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    return loop(m, empty_1());\r\n}\r\n\r\nexport function MapTreeModule_copyToArray(m, arr, i) {\r\n    let j = i;\r\n    MapTreeModule_iter((x, y) => {\r\n        arr[j] = [x, y];\r\n        j = ((j + 1) | 0);\r\n    }, m);\r\n}\r\n\r\nexport function MapTreeModule_toArray(m) {\r\n    const n = MapTreeModule_size(m) | 0;\r\n    const res = fill(new Array(n), 0, n, [null, null]);\r\n    MapTreeModule_copyToArray(m, res, 0);\r\n    return res;\r\n}\r\n\r\nexport function MapTreeModule_ofList(comparer, l) {\r\n    return fold_1((acc, tupledArg) => MapTreeModule_add(comparer, tupledArg[0], tupledArg[1], acc), MapTreeModule_empty(), l);\r\n}\r\n\r\nexport function MapTreeModule_mkFromEnumerator(comparer_mut, acc_mut, e_mut) {\r\n    MapTreeModule_mkFromEnumerator:\r\n    while (true) {\r\n        const comparer = comparer_mut, acc = acc_mut, e = e_mut;\r\n        if (e[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n            const patternInput = e[\"System.Collections.Generic.IEnumerator`1.get_Current\"]();\r\n            comparer_mut = comparer;\r\n            acc_mut = MapTreeModule_add(comparer, patternInput[0], patternInput[1], acc);\r\n            e_mut = e;\r\n            continue MapTreeModule_mkFromEnumerator;\r\n        }\r\n        else {\r\n            return acc;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_ofArray(comparer, arr) {\r\n    let res = MapTreeModule_empty();\r\n    for (let idx = 0; idx <= (arr.length - 1); idx++) {\r\n        const forLoopVar = arr[idx];\r\n        res = MapTreeModule_add(comparer, forLoopVar[0], forLoopVar[1], res);\r\n    }\r\n    return res;\r\n}\r\n\r\nexport function MapTreeModule_ofSeq(comparer, c) {\r\n    if (isArrayLike(c)) {\r\n        return MapTreeModule_ofArray(comparer, c);\r\n    }\r\n    else if (c instanceof FSharpList) {\r\n        return MapTreeModule_ofList(comparer, c);\r\n    }\r\n    else {\r\n        const ie = getEnumerator(c);\r\n        try {\r\n            return MapTreeModule_mkFromEnumerator(comparer, MapTreeModule_empty(), ie);\r\n        }\r\n        finally {\r\n            ie.Dispose();\r\n        }\r\n    }\r\n}\r\n\r\nexport class MapTreeModule_MapIterator$2 extends Record {\r\n    constructor(stack, started) {\r\n        super();\r\n        this.stack = stack;\r\n        this.started = started;\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_MapIterator$2$reflection(gen0, gen1) {\r\n    return record_type(\"Map.MapTreeModule.MapIterator`2\", [gen0, gen1], MapTreeModule_MapIterator$2, () => [[\"stack\", list_type(option_type(MapTreeLeaf$2$reflection(gen0, gen1)))], [\"started\", bool_type]]);\r\n}\r\n\r\nexport function MapTreeModule_collapseLHS(stack_mut) {\r\n    MapTreeModule_collapseLHS:\r\n    while (true) {\r\n        const stack = stack_mut;\r\n        if (!isEmpty_1(stack)) {\r\n            const rest = tail(stack);\r\n            const m = head(stack);\r\n            if (m != null) {\r\n                const m2 = m;\r\n                if (m2 instanceof MapTreeNode$2) {\r\n                    stack_mut = ofArrayWithTail([MapTreeNode$2__get_Left(m2), MapTreeLeaf$2_$ctor_5BDDA1(MapTreeLeaf$2__get_Key(m2), MapTreeLeaf$2__get_Value(m2)), MapTreeNode$2__get_Right(m2)], rest);\r\n                    continue MapTreeModule_collapseLHS;\r\n                }\r\n                else {\r\n                    return stack;\r\n                }\r\n            }\r\n            else {\r\n                stack_mut = rest;\r\n                continue MapTreeModule_collapseLHS;\r\n            }\r\n        }\r\n        else {\r\n            return empty_1();\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_mkIterator(m) {\r\n    return new MapTreeModule_MapIterator$2(MapTreeModule_collapseLHS(singleton(m)), false);\r\n}\r\n\r\nexport function MapTreeModule_notStarted() {\r\n    throw (new Error(\"enumeration not started\"));\r\n}\r\n\r\nexport function MapTreeModule_alreadyFinished() {\r\n    throw (new Error(\"enumeration already finished\"));\r\n}\r\n\r\nexport function MapTreeModule_current(i) {\r\n    if (i.started) {\r\n        const matchValue = i.stack;\r\n        if (!isEmpty_1(matchValue)) {\r\n            if (head(matchValue) != null) {\r\n                const m = head(matchValue);\r\n                if (m instanceof MapTreeNode$2) {\r\n                    throw (new Error(\"Please report error: Map iterator, unexpected stack for current\"));\r\n                }\r\n                else {\r\n                    return [MapTreeLeaf$2__get_Key(m), MapTreeLeaf$2__get_Value(m)];\r\n                }\r\n            }\r\n            else {\r\n                throw (new Error(\"Please report error: Map iterator, unexpected stack for current\"));\r\n            }\r\n        }\r\n        else {\r\n            return MapTreeModule_alreadyFinished();\r\n        }\r\n    }\r\n    else {\r\n        return MapTreeModule_notStarted();\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_moveNext(i) {\r\n    if (i.started) {\r\n        const matchValue = i.stack;\r\n        if (!isEmpty_1(matchValue)) {\r\n            if (head(matchValue) != null) {\r\n                const m = head(matchValue);\r\n                if (m instanceof MapTreeNode$2) {\r\n                    throw (new Error(\"Please report error: Map iterator, unexpected stack for moveNext\"));\r\n                }\r\n                else {\r\n                    i.stack = MapTreeModule_collapseLHS(tail(matchValue));\r\n                    return !isEmpty_1(i.stack);\r\n                }\r\n            }\r\n            else {\r\n                throw (new Error(\"Please report error: Map iterator, unexpected stack for moveNext\"));\r\n            }\r\n        }\r\n        else {\r\n            return false;\r\n        }\r\n    }\r\n    else {\r\n        i.started = true;\r\n        return !isEmpty_1(i.stack);\r\n    }\r\n}\r\n\r\nexport function MapTreeModule_mkIEnumerator(m) {\r\n    let i = MapTreeModule_mkIterator(m);\r\n    return {\r\n        [\"System.Collections.Generic.IEnumerator`1.get_Current\"]() {\r\n            return MapTreeModule_current(i);\r\n        },\r\n        [\"System.Collections.IEnumerator.get_Current\"]() {\r\n            return MapTreeModule_current(i);\r\n        },\r\n        [\"System.Collections.IEnumerator.MoveNext\"]() {\r\n            return MapTreeModule_moveNext(i);\r\n        },\r\n        [\"System.Collections.IEnumerator.Reset\"]() {\r\n            i = MapTreeModule_mkIterator(m);\r\n        },\r\n        Dispose() {\r\n        },\r\n    };\r\n}\r\n\r\nexport function MapTreeModule_toSeq(s) {\r\n    return unfold((en_1) => {\r\n        if (en_1[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n            return [en_1[\"System.Collections.Generic.IEnumerator`1.get_Current\"](), en_1];\r\n        }\r\n        else {\r\n            return void 0;\r\n        }\r\n    }, MapTreeModule_mkIEnumerator(s));\r\n}\r\n\r\nexport class FSharpMap {\r\n    constructor(comparer, tree) {\r\n        this.comparer = comparer;\r\n        this.tree = tree;\r\n    }\r\n    GetHashCode() {\r\n        const this$ = this;\r\n        return FSharpMap__ComputeHashCode(this$) | 0;\r\n    }\r\n    Equals(that) {\r\n        const this$ = this;\r\n        if (that instanceof FSharpMap) {\r\n            const e1 = getEnumerator(this$);\r\n            try {\r\n                const e2 = getEnumerator(that);\r\n                try {\r\n                    const loop = () => {\r\n                        const m1 = e1[\"System.Collections.IEnumerator.MoveNext\"]();\r\n                        if (m1 === e2[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n                            if (!m1) {\r\n                                return true;\r\n                            }\r\n                            else {\r\n                                const e1c = e1[\"System.Collections.Generic.IEnumerator`1.get_Current\"]();\r\n                                const e2c = e2[\"System.Collections.Generic.IEnumerator`1.get_Current\"]();\r\n                                if (equals(e1c[0], e2c[0]) ? equals(e1c[1], e2c[1]) : false) {\r\n                                    return loop();\r\n                                }\r\n                                else {\r\n                                    return false;\r\n                                }\r\n                            }\r\n                        }\r\n                        else {\r\n                            return false;\r\n                        }\r\n                    };\r\n                    return loop();\r\n                }\r\n                finally {\r\n                    e2.Dispose();\r\n                }\r\n            }\r\n            finally {\r\n                e1.Dispose();\r\n            }\r\n        }\r\n        else {\r\n            return false;\r\n        }\r\n    }\r\n    toString() {\r\n        const this$ = this;\r\n        return (\"map [\" + join(\"; \", map_1((kv) => format(\"({0}, {1})\", kv[0], kv[1]), this$))) + \"]\";\r\n    }\r\n    get [Symbol.toStringTag]() {\r\n        return \"FSharpMap\";\r\n    }\r\n    toJSON(_key) {\r\n        const this$ = this;\r\n        return Array.from(this$);\r\n    }\r\n    GetEnumerator() {\r\n        const __ = this;\r\n        return MapTreeModule_mkIEnumerator(__.tree);\r\n    }\r\n    [Symbol.iterator]() {\r\n        return toIterator(this.GetEnumerator());\r\n    }\r\n    [\"System.Collections.IEnumerable.GetEnumerator\"]() {\r\n        const __ = this;\r\n        return MapTreeModule_mkIEnumerator(__.tree);\r\n    }\r\n    CompareTo(obj) {\r\n        const m = this;\r\n        if (obj instanceof FSharpMap) {\r\n            return compareWith((kvp1, kvp2) => {\r\n                const c = m.comparer.Compare(kvp1[0], kvp2[0]) | 0;\r\n                return ((c !== 0) ? c : compare(kvp1[1], kvp2[1])) | 0;\r\n            }, m, obj) | 0;\r\n        }\r\n        else {\r\n            throw (new Error(\"not comparable\\\\nParameter name: obj\"));\r\n        }\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.Add2B595\"](x) {\r\n        throw (new Error(\"Map cannot be mutated\"));\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.Clear\"]() {\r\n        throw (new Error(\"Map cannot be mutated\"));\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.Remove2B595\"](x) {\r\n        throw (new Error(\"Map cannot be mutated\"));\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.Contains2B595\"](x) {\r\n        const m = this;\r\n        return FSharpMap__ContainsKey(m, x[0]) ? equals(FSharpMap__get_Item(m, x[0]), x[1]) : false;\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.CopyToZ2E171D71\"](arr, i) {\r\n        const m = this;\r\n        MapTreeModule_copyToArray(m.tree, arr, i);\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.get_IsReadOnly\"]() {\r\n        return true;\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.get_Count\"]() {\r\n        const m = this;\r\n        return FSharpMap__get_Count(m) | 0;\r\n    }\r\n    [\"System.Collections.Generic.IReadOnlyCollection`1.get_Count\"]() {\r\n        const m = this;\r\n        return FSharpMap__get_Count(m) | 0;\r\n    }\r\n    get size() {\r\n        const m = this;\r\n        return FSharpMap__get_Count(m) | 0;\r\n    }\r\n    clear() {\r\n        throw (new Error(\"Map cannot be mutated\"));\r\n    }\r\n    delete(_arg1) {\r\n        throw (new Error(\"Map cannot be mutated\"));\r\n        return false;\r\n    }\r\n    entries() {\r\n        const m = this;\r\n        return map_1((p) => [p[0], p[1]], m);\r\n    }\r\n    get(k) {\r\n        const m = this;\r\n        return FSharpMap__get_Item(m, k);\r\n    }\r\n    has(k) {\r\n        const m = this;\r\n        return FSharpMap__ContainsKey(m, k);\r\n    }\r\n    keys() {\r\n        const m = this;\r\n        return map_1((p) => p[0], m);\r\n    }\r\n    set(k, v) {\r\n        const m = this;\r\n        throw (new Error(\"Map cannot be mutated\"));\r\n        return m;\r\n    }\r\n    values() {\r\n        const m = this;\r\n        return map_1((p) => p[1], m);\r\n    }\r\n    forEach(f, thisArg) {\r\n        const m = this;\r\n        iterate_1((p) => {\r\n            f(p[1], p[0], m);\r\n        }, m);\r\n    }\r\n}\r\n\r\nexport function FSharpMap$reflection(gen0, gen1) {\r\n    return class_type(\"Map.FSharpMap\", [gen0, gen1], FSharpMap);\r\n}\r\n\r\nexport function FSharpMap_$ctor(comparer, tree) {\r\n    return new FSharpMap(comparer, tree);\r\n}\r\n\r\n(() => {\r\n    FSharpMap.empty = FSharpMap_$ctor(LanguagePrimitives_FastGenericComparer(), MapTreeModule_empty());\r\n})();\r\n\r\nexport function FSharpMap_get_Empty() {\r\n    return FSharpMap.empty;\r\n}\r\n\r\nexport function FSharpMap_Create(ie) {\r\n    const comparer = LanguagePrimitives_FastGenericComparer();\r\n    return FSharpMap_$ctor(comparer, MapTreeModule_ofSeq(comparer, ie));\r\n}\r\n\r\nexport function FSharpMap__get_Comparer(m) {\r\n    return m.comparer;\r\n}\r\n\r\nexport function FSharpMap__get_Tree(m) {\r\n    return m.tree;\r\n}\r\n\r\nexport function FSharpMap__Add(m, key, value) {\r\n    return FSharpMap_$ctor(m.comparer, MapTreeModule_add(m.comparer, key, value, m.tree));\r\n}\r\n\r\nexport function FSharpMap__Change(m, key, f) {\r\n    return FSharpMap_$ctor(m.comparer, MapTreeModule_change(m.comparer, key, f, m.tree));\r\n}\r\n\r\nexport function FSharpMap__get_IsEmpty(m) {\r\n    return m.tree == null;\r\n}\r\n\r\nexport function FSharpMap__get_Item(m, key) {\r\n    return MapTreeModule_find(m.comparer, key, m.tree);\r\n}\r\n\r\nexport function FSharpMap__TryPick(m, f) {\r\n    return MapTreeModule_tryPick(f, m.tree);\r\n}\r\n\r\nexport function FSharpMap__Exists(m, predicate) {\r\n    return MapTreeModule_exists(predicate, m.tree);\r\n}\r\n\r\nexport function FSharpMap__Filter(m, predicate) {\r\n    return FSharpMap_$ctor(m.comparer, MapTreeModule_filter(m.comparer, predicate, m.tree));\r\n}\r\n\r\nexport function FSharpMap__ForAll(m, predicate) {\r\n    return MapTreeModule_forall(predicate, m.tree);\r\n}\r\n\r\nexport function FSharpMap__Fold(m, f, acc) {\r\n    return MapTreeModule_foldBack(f, m.tree, acc);\r\n}\r\n\r\nexport function FSharpMap__FoldSection(m, lo, hi, f, acc) {\r\n    return MapTreeModule_foldSection(m.comparer, lo, hi, f, m.tree, acc);\r\n}\r\n\r\nexport function FSharpMap__Iterate(m, f) {\r\n    MapTreeModule_iter(f, m.tree);\r\n}\r\n\r\nexport function FSharpMap__MapRange(m, f) {\r\n    return FSharpMap_$ctor(m.comparer, MapTreeModule_map(f, m.tree));\r\n}\r\n\r\nexport function FSharpMap__Map(m, f) {\r\n    return FSharpMap_$ctor(m.comparer, MapTreeModule_mapi(f, m.tree));\r\n}\r\n\r\nexport function FSharpMap__Partition(m, predicate) {\r\n    const patternInput = MapTreeModule_partition(m.comparer, predicate, m.tree);\r\n    return [FSharpMap_$ctor(m.comparer, patternInput[0]), FSharpMap_$ctor(m.comparer, patternInput[1])];\r\n}\r\n\r\nexport function FSharpMap__get_Count(m) {\r\n    return MapTreeModule_size(m.tree);\r\n}\r\n\r\nexport function FSharpMap__ContainsKey(m, key) {\r\n    return MapTreeModule_mem(m.comparer, key, m.tree);\r\n}\r\n\r\nexport function FSharpMap__Remove(m, key) {\r\n    return FSharpMap_$ctor(m.comparer, MapTreeModule_remove(m.comparer, key, m.tree));\r\n}\r\n\r\nexport function FSharpMap__TryGetValue(__, key, value) {\r\n    const matchValue = MapTreeModule_tryFind(__.comparer, key, __.tree);\r\n    if (matchValue == null) {\r\n        return false;\r\n    }\r\n    else {\r\n        const v = value_1(matchValue);\r\n        value.contents = v;\r\n        return true;\r\n    }\r\n}\r\n\r\nexport function FSharpMap__TryFind(m, key) {\r\n    return MapTreeModule_tryFind(m.comparer, key, m.tree);\r\n}\r\n\r\nexport function FSharpMap__ToList(m) {\r\n    return MapTreeModule_toList(m.tree);\r\n}\r\n\r\nexport function FSharpMap__ToArray(m) {\r\n    return MapTreeModule_toArray(m.tree);\r\n}\r\n\r\nexport function FSharpMap__ComputeHashCode(this$) {\r\n    const combineHash = (x, y) => (((x << 1) + y) + 631);\r\n    let res = 0;\r\n    const enumerator = getEnumerator(this$);\r\n    try {\r\n        while (enumerator[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n            const activePatternResult5329 = enumerator[\"System.Collections.Generic.IEnumerator`1.get_Current\"]();\r\n            res = (combineHash(res, structuralHash(activePatternResult5329[0])) | 0);\r\n            res = (combineHash(res, structuralHash(activePatternResult5329[1])) | 0);\r\n        }\r\n    }\r\n    finally {\r\n        enumerator.Dispose();\r\n    }\r\n    return res | 0;\r\n}\r\n\r\nexport function isEmpty(table) {\r\n    return FSharpMap__get_IsEmpty(table);\r\n}\r\n\r\nexport function add(key, value, table) {\r\n    return FSharpMap__Add(table, key, value);\r\n}\r\n\r\nexport function change(key, f, table) {\r\n    return FSharpMap__Change(table, key, f);\r\n}\r\n\r\nexport function find(key, table) {\r\n    return FSharpMap__get_Item(table, key);\r\n}\r\n\r\nexport function tryFind(key, table) {\r\n    return FSharpMap__TryFind(table, key);\r\n}\r\n\r\nexport function remove(key, table) {\r\n    return FSharpMap__Remove(table, key);\r\n}\r\n\r\nexport function containsKey(key, table) {\r\n    return FSharpMap__ContainsKey(table, key);\r\n}\r\n\r\nexport function iterate(action, table) {\r\n    FSharpMap__Iterate(table, action);\r\n}\r\n\r\nexport function tryPick(chooser, table) {\r\n    return FSharpMap__TryPick(table, chooser);\r\n}\r\n\r\nexport function pick(chooser, table) {\r\n    const matchValue = tryPick(chooser, table);\r\n    if (matchValue != null) {\r\n        return value_1(matchValue);\r\n    }\r\n    else {\r\n        throw (new Error());\r\n    }\r\n}\r\n\r\nexport function exists(predicate, table) {\r\n    return FSharpMap__Exists(table, predicate);\r\n}\r\n\r\nexport function filter(predicate, table) {\r\n    return FSharpMap__Filter(table, predicate);\r\n}\r\n\r\nexport function partition(predicate, table) {\r\n    return FSharpMap__Partition(table, predicate);\r\n}\r\n\r\nexport function forAll(predicate, table) {\r\n    return FSharpMap__ForAll(table, predicate);\r\n}\r\n\r\nexport function map(mapping, table) {\r\n    return FSharpMap__Map(table, mapping);\r\n}\r\n\r\nexport function fold(folder, state, table) {\r\n    return MapTreeModule_fold(folder, state, FSharpMap__get_Tree(table));\r\n}\r\n\r\nexport function foldBack(folder, table, state) {\r\n    return MapTreeModule_foldBack(folder, FSharpMap__get_Tree(table), state);\r\n}\r\n\r\nexport function toSeq(table) {\r\n    return map_1((kvp) => [kvp[0], kvp[1]], table);\r\n}\r\n\r\nexport function findKey(predicate, table) {\r\n    return pick_1((kvp) => {\r\n        const k = kvp[0];\r\n        if (predicate(k, kvp[1])) {\r\n            return some(k);\r\n        }\r\n        else {\r\n            return void 0;\r\n        }\r\n    }, table);\r\n}\r\n\r\nexport function tryFindKey(predicate, table) {\r\n    return tryPick_1((kvp) => {\r\n        const k = kvp[0];\r\n        if (predicate(k, kvp[1])) {\r\n            return some(k);\r\n        }\r\n        else {\r\n            return void 0;\r\n        }\r\n    }, table);\r\n}\r\n\r\nexport function ofList(elements) {\r\n    return FSharpMap_Create(elements);\r\n}\r\n\r\nexport function ofSeq(elements) {\r\n    return FSharpMap_Create(elements);\r\n}\r\n\r\nexport function ofArray(elements) {\r\n    const comparer = LanguagePrimitives_FastGenericComparer();\r\n    return FSharpMap_$ctor(comparer, MapTreeModule_ofArray(comparer, elements));\r\n}\r\n\r\nexport function toList(table) {\r\n    return FSharpMap__ToList(table);\r\n}\r\n\r\nexport function toArray(table) {\r\n    return FSharpMap__ToArray(table);\r\n}\r\n\r\nexport function empty() {\r\n    return FSharpMap_get_Empty();\r\n}\r\n\r\nexport function count(table) {\r\n    return FSharpMap__get_Count(table);\r\n}\r\n\r\n","export const symbol = Symbol(\"numeric\");\nexport function isNumeric(x) {\n    return typeof x === \"number\" || (x === null || x === void 0 ? void 0 : x[symbol]);\n}\nexport function compare(x, y) {\n    if (typeof x === \"number\") {\n        return x < y ? -1 : (x > y ? 1 : 0);\n    }\n    else {\n        return x.CompareTo(y);\n    }\n}\nexport function multiply(x, y) {\n    if (typeof x === \"number\") {\n        return x * y;\n    }\n    else {\n        return x[symbol]().multiply(y);\n    }\n}\nexport function toFixed(x, dp) {\n    if (typeof x === \"number\") {\n        return x.toFixed(dp);\n    }\n    else {\n        return x[symbol]().toFixed(dp);\n    }\n}\nexport function toPrecision(x, sd) {\n    if (typeof x === \"number\") {\n        return x.toPrecision(sd);\n    }\n    else {\n        return x[symbol]().toPrecision(sd);\n    }\n}\nexport function toExponential(x, dp) {\n    if (typeof x === \"number\") {\n        return x.toExponential(dp);\n    }\n    else {\n        return x[symbol]().toExponential(dp);\n    }\n}\nexport function toHex(x) {\n    if (typeof x === \"number\") {\n        return (Number(x) >>> 0).toString(16);\n    }\n    else {\n        return x[symbol]().toHex();\n    }\n}\n","/**\n * DateTimeOffset functions.\n *\n * Note: Date instances are always DateObjects in local\n * timezone (because JS dates are all kinds of messed up).\n * A local date returns UTC epoc when `.getTime()` is called.\n *\n * Basically; invariant: date.getTime() always return UTC time.\n */\nimport { fromValue, ticksToUnixEpochMilliseconds, unixEpochMillisecondsToTicks } from \"./Long.js\";\nimport { compareDates, dateOffset, padWithZeros } from \"./Util.js\";\nexport const offsetRegex = /(?:Z|[+-](\\d+):?([0-5]?\\d)?)\\s*$/;\nexport function dateOffsetToString(offset) {\n    const isMinus = offset < 0;\n    offset = Math.abs(offset);\n    const hours = ~~(offset / 3600000);\n    const minutes = (offset % 3600000) / 60000;\n    return (isMinus ? \"-\" : \"+\") +\n        padWithZeros(hours, 2) + \":\" +\n        padWithZeros(minutes, 2);\n}\nexport function dateToHalfUTCString(date, half) {\n    const str = date.toISOString();\n    return half === \"first\"\n        ? str.substring(0, str.indexOf(\"T\"))\n        : str.substring(str.indexOf(\"T\") + 1, str.length - 1);\n}\nfunction dateToISOString(d, utc) {\n    if (utc) {\n        return d.toISOString();\n    }\n    else {\n        // JS Date is always local\n        const printOffset = d.kind == null ? true : d.kind === 2 /* Local */;\n        return padWithZeros(d.getFullYear(), 4) + \"-\" +\n            padWithZeros(d.getMonth() + 1, 2) + \"-\" +\n            padWithZeros(d.getDate(), 2) + \"T\" +\n            padWithZeros(d.getHours(), 2) + \":\" +\n            padWithZeros(d.getMinutes(), 2) + \":\" +\n            padWithZeros(d.getSeconds(), 2) + \".\" +\n            padWithZeros(d.getMilliseconds(), 3) +\n            (printOffset ? dateOffsetToString(d.getTimezoneOffset() * -60000) : \"\");\n    }\n}\nfunction dateToISOStringWithOffset(dateWithOffset, offset) {\n    const str = dateWithOffset.toISOString();\n    return str.substring(0, str.length - 1) + dateOffsetToString(offset);\n}\nfunction dateToStringWithCustomFormat(date, format, utc) {\n    return format.replace(/(\\w)\\1*/g, (match) => {\n        let rep = Number.NaN;\n        switch (match.substring(0, 1)) {\n            case \"y\":\n                const y = utc ? date.getUTCFullYear() : date.getFullYear();\n                rep = match.length < 4 ? y % 100 : y;\n                break;\n            case \"M\":\n                rep = (utc ? date.getUTCMonth() : date.getMonth()) + 1;\n                break;\n            case \"d\":\n                rep = utc ? date.getUTCDate() : date.getDate();\n                break;\n            case \"H\":\n                rep = utc ? date.getUTCHours() : date.getHours();\n                break;\n            case \"h\":\n                const h = utc ? date.getUTCHours() : date.getHours();\n                rep = h > 12 ? h % 12 : h;\n                break;\n            case \"m\":\n                rep = utc ? date.getUTCMinutes() : date.getMinutes();\n                break;\n            case \"s\":\n                rep = utc ? date.getUTCSeconds() : date.getSeconds();\n                break;\n            case \"f\":\n                rep = utc ? date.getUTCMilliseconds() : date.getMilliseconds();\n                break;\n        }\n        if (Number.isNaN(rep)) {\n            return match;\n        }\n        else {\n            return (rep < 10 && match.length > 1) ? \"0\" + rep : \"\" + rep;\n        }\n    });\n}\nfunction dateToStringWithOffset(date, format) {\n    var _a, _b, _c;\n    const d = new Date(date.getTime() + ((_a = date.offset) !== null && _a !== void 0 ? _a : 0));\n    if (typeof format !== \"string\") {\n        return d.toISOString().replace(/\\.\\d+/, \"\").replace(/[A-Z]|\\.\\d+/g, \" \") + dateOffsetToString(((_b = date.offset) !== null && _b !== void 0 ? _b : 0));\n    }\n    else if (format.length === 1) {\n        switch (format) {\n            case \"D\":\n            case \"d\": return dateToHalfUTCString(d, \"first\");\n            case \"T\":\n            case \"t\": return dateToHalfUTCString(d, \"second\");\n            case \"O\":\n            case \"o\": return dateToISOStringWithOffset(d, ((_c = date.offset) !== null && _c !== void 0 ? _c : 0));\n            default: throw new Error(\"Unrecognized Date print format\");\n        }\n    }\n    else {\n        return dateToStringWithCustomFormat(d, format, true);\n    }\n}\nfunction dateToStringWithKind(date, format) {\n    const utc = date.kind === 1 /* UTC */;\n    if (typeof format !== \"string\") {\n        return utc ? date.toUTCString() : date.toLocaleString();\n    }\n    else if (format.length === 1) {\n        switch (format) {\n            case \"D\":\n            case \"d\":\n                return utc ? dateToHalfUTCString(date, \"first\") : date.toLocaleDateString();\n            case \"T\":\n            case \"t\":\n                return utc ? dateToHalfUTCString(date, \"second\") : date.toLocaleTimeString();\n            case \"O\":\n            case \"o\":\n                return dateToISOString(date, utc);\n            default:\n                throw new Error(\"Unrecognized Date print format\");\n        }\n    }\n    else {\n        return dateToStringWithCustomFormat(date, format, utc);\n    }\n}\nexport function toString(date, format, _provider) {\n    return date.offset != null\n        ? dateToStringWithOffset(date, format)\n        : dateToStringWithKind(date, format);\n}\nexport function DateTime(value, kind) {\n    const d = new Date(value);\n    d.kind = (kind == null ? 0 /* Unspecified */ : kind) | 0;\n    return d;\n}\nexport function fromTicks(ticks, kind) {\n    ticks = fromValue(ticks);\n    kind = kind != null ? kind : 0 /* Unspecified */;\n    let date = DateTime(ticksToUnixEpochMilliseconds(ticks), kind);\n    // Ticks are local to offset (in this case, either UTC or Local/Unknown).\n    // If kind is anything but UTC, that means that the tick number was not\n    // in utc, thus getTime() cannot return UTC, and needs to be shifted.\n    if (kind !== 1 /* UTC */) {\n        date = DateTime(date.getTime() - dateOffset(date), kind);\n    }\n    return date;\n}\nexport function fromDateTimeOffset(date, kind) {\n    var _a;\n    switch (kind) {\n        case 1 /* UTC */: return DateTime(date.getTime(), 1 /* UTC */);\n        case 2 /* Local */: return DateTime(date.getTime(), 2 /* Local */);\n        default:\n            const d = DateTime(date.getTime() + ((_a = date.offset) !== null && _a !== void 0 ? _a : 0), kind);\n            return DateTime(d.getTime() - dateOffset(d), kind);\n    }\n}\nexport function getTicks(date) {\n    return unixEpochMillisecondsToTicks(date.getTime(), dateOffset(date));\n}\nexport function minValue() {\n    // This is \"0001-01-01T00:00:00.000Z\", actual JS min value is -8640000000000000\n    return DateTime(-62135596800000, 0 /* Unspecified */);\n}\nexport function maxValue() {\n    // This is \"9999-12-31T23:59:59.999Z\", actual JS max value is 8640000000000000\n    return DateTime(253402300799999, 0 /* Unspecified */);\n}\nexport function parseRaw(input) {\n    if (input === null) {\n        throw new Error(\"Value cannot be null when parsing DateTime\");\n    }\n    if (input.trim() === \"\") {\n        throw new Error(\"An empty string is not recognized as a valid DateTime\");\n    }\n    let date = new Date(input);\n    if (isNaN(date.getTime())) {\n        // Try to check strings JS Date cannot parse (see #1045, #1422)\n        // tslint:disable-next-line:max-line-length\n        const m = /^\\s*(\\d+[^\\w\\s:]\\d+[^\\w\\s:]\\d+)?\\s*(\\d+:\\d+(?::\\d+(?:\\.\\d+)?)?)?\\s*([AaPp][Mm])?\\s*([+-]\\d+(?::\\d+)?)?\\s*$/.exec(input);\n        if (m != null) {\n            let baseDate;\n            let timeInSeconds = 0;\n            if (m[2] != null) {\n                const timeParts = m[2].split(\":\");\n                timeInSeconds =\n                    parseInt(timeParts[0], 10) * 3600 +\n                        parseInt(timeParts[1] || \"0\", 10) * 60 +\n                        parseFloat(timeParts[2] || \"0\");\n                if (m[3] != null && m[3].toUpperCase() === \"PM\") {\n                    timeInSeconds += 720;\n                }\n            }\n            if (m[4] != null) { // There's an offset, parse as UTC\n                if (m[1] != null) {\n                    baseDate = new Date(m[1] + \" UTC\");\n                }\n                else {\n                    const d = new Date();\n                    baseDate = new Date(d.getUTCFullYear() + \"/\" + (d.getUTCMonth() + 1) + \"/\" + d.getUTCDate());\n                }\n                const offsetParts = m[4].substr(1).split(\":\");\n                let offsetInMinutes = parseInt(offsetParts[0], 10) * 60 + parseInt(offsetParts[1] || \"0\", 10);\n                if (m[4][0] === \"+\") {\n                    offsetInMinutes *= -1;\n                }\n                timeInSeconds += offsetInMinutes * 60;\n            }\n            else {\n                if (m[1] != null) {\n                    baseDate = new Date(m[1]);\n                }\n                else {\n                    const d = new Date();\n                    baseDate = new Date(d.getFullYear() + \"/\" + (d.getMonth() + 1) + \"/\" + d.getDate());\n                }\n            }\n            date = new Date(baseDate.getTime() + timeInSeconds * 1000);\n            // correct for daylight savings time\n            date = new Date(date.getTime() + (date.getTimezoneOffset() - baseDate.getTimezoneOffset()) * 60000);\n        }\n        else {\n            throw new Error(\"The string is not a valid Date.\");\n        }\n    }\n    return date;\n}\nexport function parse(str, detectUTC = false) {\n    const date = parseRaw(str);\n    const offset = offsetRegex.exec(str);\n    // .NET always parses DateTime as Local if there's offset info (even \"Z\")\n    // Newtonsoft.Json uses UTC if the offset is \"Z\"\n    const kind = offset != null\n        ? (detectUTC && offset[0] === \"Z\" ? 1 /* UTC */ : 2 /* Local */)\n        : 0 /* Unspecified */;\n    return DateTime(date.getTime(), kind);\n}\nexport function tryParse(v, defValue) {\n    try {\n        defValue.contents = parse(v);\n        return true;\n    }\n    catch (_err) {\n        return false;\n    }\n}\nexport function create(year, month, day, h = 0, m = 0, s = 0, ms = 0, kind) {\n    const dateValue = kind === 1 /* UTC */\n        ? Date.UTC(year, month - 1, day, h, m, s, ms)\n        : new Date(year, month - 1, day, h, m, s, ms).getTime();\n    if (isNaN(dateValue)) {\n        throw new Error(\"The parameters describe an unrepresentable Date.\");\n    }\n    const date = DateTime(dateValue, kind);\n    if (year <= 99) {\n        date.setFullYear(year, month - 1, day);\n    }\n    return date;\n}\nexport function now() {\n    return DateTime(Date.now(), 2 /* Local */);\n}\nexport function utcNow() {\n    return DateTime(Date.now(), 1 /* UTC */);\n}\nexport function today() {\n    return date(now());\n}\nexport function isLeapYear(year) {\n    return year % 4 === 0 && year % 100 !== 0 || year % 400 === 0;\n}\nexport function daysInMonth(year, month) {\n    return month === 2\n        ? (isLeapYear(year) ? 29 : 28)\n        : (month >= 8 ? (month % 2 === 0 ? 31 : 30) : (month % 2 === 0 ? 30 : 31));\n}\nexport function toUniversalTime(date) {\n    return date.kind === 1 /* UTC */ ? date : DateTime(date.getTime(), 1 /* UTC */);\n}\nexport function toLocalTime(date) {\n    return date.kind === 2 /* Local */ ? date : DateTime(date.getTime(), 2 /* Local */);\n}\nexport function specifyKind(d, kind) {\n    return create(year(d), month(d), day(d), hour(d), minute(d), second(d), millisecond(d), kind);\n}\nexport function timeOfDay(d) {\n    return hour(d) * 3600000\n        + minute(d) * 60000\n        + second(d) * 1000\n        + millisecond(d);\n}\nexport function date(d) {\n    return create(year(d), month(d), day(d), 0, 0, 0, 0, d.kind);\n}\nexport function day(d) {\n    return d.kind === 1 /* UTC */ ? d.getUTCDate() : d.getDate();\n}\nexport function hour(d) {\n    return d.kind === 1 /* UTC */ ? d.getUTCHours() : d.getHours();\n}\nexport function millisecond(d) {\n    return d.kind === 1 /* UTC */ ? d.getUTCMilliseconds() : d.getMilliseconds();\n}\nexport function minute(d) {\n    return d.kind === 1 /* UTC */ ? d.getUTCMinutes() : d.getMinutes();\n}\nexport function month(d) {\n    return (d.kind === 1 /* UTC */ ? d.getUTCMonth() : d.getMonth()) + 1;\n}\nexport function second(d) {\n    return d.kind === 1 /* UTC */ ? d.getUTCSeconds() : d.getSeconds();\n}\nexport function year(d) {\n    return d.kind === 1 /* UTC */ ? d.getUTCFullYear() : d.getFullYear();\n}\nexport function dayOfWeek(d) {\n    return d.kind === 1 /* UTC */ ? d.getUTCDay() : d.getDay();\n}\nexport function dayOfYear(d) {\n    const _year = year(d);\n    const _month = month(d);\n    let _day = day(d);\n    for (let i = 1; i < _month; i++) {\n        _day += daysInMonth(_year, i);\n    }\n    return _day;\n}\nexport function add(d, ts) {\n    const newDate = DateTime(d.getTime() + ts, d.kind);\n    if (d.kind === 2 /* Local */) {\n        const oldTzOffset = d.getTimezoneOffset();\n        const newTzOffset = newDate.getTimezoneOffset();\n        return oldTzOffset !== newTzOffset\n            ? DateTime(newDate.getTime() + (newTzOffset - oldTzOffset) * 60000, d.kind)\n            : newDate;\n    }\n    else {\n        return newDate;\n    }\n}\nexport function addDays(d, v) {\n    return add(d, v * 86400000);\n}\nexport function addHours(d, v) {\n    return add(d, v * 3600000);\n}\nexport function addMinutes(d, v) {\n    return add(d, v * 60000);\n}\nexport function addSeconds(d, v) {\n    return add(d, v * 1000);\n}\nexport function addMilliseconds(d, v) {\n    return add(d, v);\n}\nexport function addYears(d, v) {\n    const newMonth = month(d);\n    const newYear = year(d) + v;\n    const _daysInMonth = daysInMonth(newYear, newMonth);\n    const newDay = Math.min(_daysInMonth, day(d));\n    return create(newYear, newMonth, newDay, hour(d), minute(d), second(d), millisecond(d), d.kind);\n}\nexport function addMonths(d, v) {\n    let newMonth = month(d) + v;\n    let newMonth_ = 0;\n    let yearOffset = 0;\n    if (newMonth > 12) {\n        newMonth_ = newMonth % 12;\n        yearOffset = Math.floor(newMonth / 12);\n        newMonth = newMonth_;\n    }\n    else if (newMonth < 1) {\n        newMonth_ = 12 + newMonth % 12;\n        yearOffset = Math.floor(newMonth / 12) + (newMonth_ === 12 ? -1 : 0);\n        newMonth = newMonth_;\n    }\n    const newYear = year(d) + yearOffset;\n    const _daysInMonth = daysInMonth(newYear, newMonth);\n    const newDay = Math.min(_daysInMonth, day(d));\n    return create(newYear, newMonth, newDay, hour(d), minute(d), second(d), millisecond(d), d.kind);\n}\nexport function subtract(d, that) {\n    return typeof that === \"number\"\n        ? add(d, -that)\n        : d.getTime() - that.getTime();\n}\nexport function toLongDateString(d) {\n    return d.toDateString();\n}\nexport function toShortDateString(d) {\n    return d.toLocaleDateString();\n}\nexport function toLongTimeString(d) {\n    return d.toLocaleTimeString();\n}\nexport function toShortTimeString(d) {\n    return d.toLocaleTimeString().replace(/:\\d\\d(?!:)/, \"\");\n}\nexport function equals(d1, d2) {\n    return d1.getTime() === d2.getTime();\n}\nexport const compare = compareDates;\nexport const compareTo = compareDates;\nexport function op_Addition(x, y) {\n    return add(x, y);\n}\nexport function op_Subtraction(x, y) {\n    return subtract(x, y);\n}\nexport function isDaylightSavingTime(x) {\n    const jan = new Date(x.getFullYear(), 0, 1);\n    const jul = new Date(x.getFullYear(), 6, 1);\n    return isDST(jan.getTimezoneOffset(), jul.getTimezoneOffset(), x.getTimezoneOffset());\n}\nfunction isDST(janOffset, julOffset, tOffset) {\n    return Math.min(janOffset, julOffset) === tOffset;\n}\nexport default DateTime;\n","\"use strict\";\r\n\r\nexport function Parsimmon(action) {\r\n  if (!(this instanceof Parsimmon)) {\r\n    return new Parsimmon(action);\r\n  }\r\n  this._ = action;\r\n}\r\n\r\nvar _ = Parsimmon.prototype;\r\n\r\nexport function times(n, f) {\r\n  var i = 0;\r\n  for (i; i < n; i++) {\r\n    f(i);\r\n  }\r\n}\r\n\r\nexport function forEach(f, arr) {\r\n  times(arr.length, function(i) {\r\n    f(arr[i], i, arr);\r\n  });\r\n}\r\n\r\nexport function reduce(f, seed, arr) {\r\n  forEach(function(elem, i, arr) {\r\n    seed = f(seed, elem, i, arr);\r\n  }, arr);\r\n  return seed;\r\n}\r\n\r\nexport function map(f, arr) {\r\n  return reduce(\r\n    function(acc, elem, i, a) {\r\n      return acc.concat([f(elem, i, a)]);\r\n    },\r\n    [],\r\n    arr\r\n  );\r\n}\r\n\r\nexport function lshiftBuffer(input) {\r\n  var asTwoBytes = reduce(\r\n    function(a, v, i, b) {\r\n      return a.concat(\r\n        i === b.length - 1\r\n          ? Buffer.from([v, 0]).readUInt16BE(0)\r\n          : b.readUInt16BE(i)\r\n      );\r\n    },\r\n    [],\r\n    input\r\n  );\r\n  return Buffer.from(\r\n    map(function(x) {\r\n      return ((x << 1) & 0xffff) >> 8;\r\n    }, asTwoBytes)\r\n  );\r\n}\r\n\r\nfunction consumeBitsFromBuffer(n, input) {\r\n  var state = { v: 0, buf: input };\r\n  times(n, function() {\r\n    state = {\r\n      v: (state.v << 1) | bitPeekBuffer(state.buf),\r\n      buf: lshiftBuffer(state.buf)\r\n    };\r\n  });\r\n  return state;\r\n}\r\n\r\nfunction bitPeekBuffer(input) {\r\n  return input[0] >> 7;\r\n}\r\n\r\nexport function sum(numArr) {\r\n  return reduce(\r\n    function(x, y) {\r\n      return x + y;\r\n    },\r\n    0,\r\n    numArr\r\n  );\r\n}\r\n\r\nexport function find(pred, arr) {\r\n  return reduce(\r\n    function(found, elem) {\r\n      return found || (pred(elem) ? elem : found);\r\n    },\r\n    null,\r\n    arr\r\n  );\r\n}\r\n\r\nfunction bufferExists() {\r\n  return typeof Buffer !== \"undefined\";\r\n}\r\n\r\nfunction ensureBuffer() {\r\n  if (!bufferExists()) {\r\n    throw new Error(\r\n      \"Buffer global does not exist; please consider using https://github.com/feross/buffer if you are running Parsimmon in a browser.\"\r\n    );\r\n  }\r\n}\r\n\r\nfunction bitSeq(alignments) {\r\n  ensureBuffer();\r\n  var totalBits = sum(alignments);\r\n  if (totalBits % 8 !== 0) {\r\n    throw new Error(\r\n      \"The bits [\" +\r\n        alignments.join(\", \") +\r\n        \"] add up to \" +\r\n        totalBits +\r\n        \" which is not an even number of bytes; the total should be divisible by 8\"\r\n    );\r\n  }\r\n  var bytes = totalBits / 8;\r\n\r\n  var tooBigRange = find(function(x) {\r\n    return x > 48;\r\n  }, alignments);\r\n  if (tooBigRange) {\r\n    throw new Error(\r\n      tooBigRange + \" bit range requested exceeds 48 bit (6 byte) Number max.\"\r\n    );\r\n  }\r\n\r\n  return new Parsimmon(function(input, i) {\r\n    var newPos = bytes + i;\r\n    if (newPos > input.length) {\r\n      return makeFailure(i, bytes.toString() + \" bytes\");\r\n    }\r\n    return makeSuccess(\r\n      newPos,\r\n      reduce(\r\n        function(acc, bits) {\r\n          var state = consumeBitsFromBuffer(bits, acc.buf);\r\n          return {\r\n            coll: acc.coll.concat(state.v),\r\n            buf: state.buf\r\n          };\r\n        },\r\n        { coll: [], buf: input.slice(i, newPos) },\r\n        alignments\r\n      ).coll\r\n    );\r\n  });\r\n}\r\n\r\nfunction bitSeqObj(namedAlignments) {\r\n  ensureBuffer();\r\n  var seenKeys = {};\r\n  var totalKeys = 0;\r\n  var fullAlignments = map(function(item) {\r\n    if (isArray(item)) {\r\n      var pair = item;\r\n      if (pair.length !== 2) {\r\n        throw new Error(\r\n          \"[\" +\r\n            pair.join(\", \") +\r\n            \"] should be length 2, got length \" +\r\n            pair.length\r\n        );\r\n      }\r\n      assertString(pair[0]);\r\n      assertNumber(pair[1]);\r\n      if (Object.prototype.hasOwnProperty.call(seenKeys, pair[0])) {\r\n        throw new Error(\"duplicate key in bitSeqObj: \" + pair[0]);\r\n      }\r\n      seenKeys[pair[0]] = true;\r\n      totalKeys++;\r\n      return pair;\r\n    } else {\r\n      assertNumber(item);\r\n      return [null, item];\r\n    }\r\n  }, namedAlignments);\r\n  if (totalKeys < 1) {\r\n    throw new Error(\r\n      \"bitSeqObj expects at least one named pair, got [\" +\r\n        namedAlignments.join(\", \") +\r\n        \"]\"\r\n    );\r\n  }\r\n  var namesOnly = map(function(pair) {\r\n    return pair[0];\r\n  }, fullAlignments);\r\n  var alignmentsOnly = map(function(pair) {\r\n    return pair[1];\r\n  }, fullAlignments);\r\n\r\n  return bitSeq(alignmentsOnly).map(function(parsed) {\r\n    var namedParsed = map(function(name, i) {\r\n      return [name, parsed[i]];\r\n    }, namesOnly);\r\n\r\n    return reduce(\r\n      function(obj, kv) {\r\n        if (kv[0] !== null) {\r\n          obj[kv[0]] = kv[1];\r\n        }\r\n        return obj;\r\n      },\r\n      {},\r\n      namedParsed\r\n    );\r\n  });\r\n}\r\n\r\nfunction parseBufferFor(other, length) {\r\n  ensureBuffer();\r\n  return new Parsimmon(function(input, i) {\r\n    if (i + length > input.length) {\r\n      return makeFailure(i, length + \" bytes for \" + other);\r\n    }\r\n    return makeSuccess(i + length, input.slice(i, i + length));\r\n  });\r\n}\r\n\r\nfunction parseBuffer(length) {\r\n  return parseBufferFor(\"buffer\", length).map(function(unsafe) {\r\n    return Buffer.from(unsafe);\r\n  });\r\n}\r\n\r\nfunction encodedString(encoding, length) {\r\n  return parseBufferFor(\"string\", length).map(function(buff) {\r\n    return buff.toString(encoding);\r\n  });\r\n}\r\n\r\nfunction isInteger(value) {\r\n  return typeof value === \"number\" && Math.floor(value) === value;\r\n}\r\n\r\nfunction assertValidIntegerByteLengthFor(who, length) {\r\n  if (!isInteger(length) || length < 0 || length > 6) {\r\n    throw new Error(who + \" requires integer length in range [0, 6].\");\r\n  }\r\n}\r\n\r\nfunction uintBE(length) {\r\n  assertValidIntegerByteLengthFor(\"uintBE\", length);\r\n  return parseBufferFor(\"uintBE(\" + length + \")\", length).map(function(buff) {\r\n    return buff.readUIntBE(0, length);\r\n  });\r\n}\r\n\r\nfunction uintLE(length) {\r\n  assertValidIntegerByteLengthFor(\"uintLE\", length);\r\n  return parseBufferFor(\"uintLE(\" + length + \")\", length).map(function(buff) {\r\n    return buff.readUIntLE(0, length);\r\n  });\r\n}\r\n\r\nfunction intBE(length) {\r\n  assertValidIntegerByteLengthFor(\"intBE\", length);\r\n  return parseBufferFor(\"intBE(\" + length + \")\", length).map(function(buff) {\r\n    return buff.readIntBE(0, length);\r\n  });\r\n}\r\n\r\nfunction intLE(length) {\r\n  assertValidIntegerByteLengthFor(\"intLE\", length);\r\n  return parseBufferFor(\"intLE(\" + length + \")\", length).map(function(buff) {\r\n    return buff.readIntLE(0, length);\r\n  });\r\n}\r\n\r\nfunction floatBE() {\r\n  return parseBufferFor(\"floatBE\", 4).map(function(buff) {\r\n    return buff.readFloatBE(0);\r\n  });\r\n}\r\n\r\nfunction floatLE() {\r\n  return parseBufferFor(\"floatLE\", 4).map(function(buff) {\r\n    return buff.readFloatLE(0);\r\n  });\r\n}\r\n\r\nfunction doubleBE() {\r\n  return parseBufferFor(\"doubleBE\", 8).map(function(buff) {\r\n    return buff.readDoubleBE(0);\r\n  });\r\n}\r\n\r\nfunction doubleLE() {\r\n  return parseBufferFor(\"doubleLE\", 8).map(function(buff) {\r\n    return buff.readDoubleLE(0);\r\n  });\r\n}\r\n\r\nfunction toArray(arrLike) {\r\n  return Array.prototype.slice.call(arrLike);\r\n}\r\n// -*- Helpers -*-\r\n\r\nfunction isParser(obj) {\r\n  return obj instanceof Parsimmon;\r\n}\r\n\r\nfunction isArray(x) {\r\n  return {}.toString.call(x) === \"[object Array]\";\r\n}\r\n\r\nfunction isBuffer(x) {\r\n  /* global Buffer */\r\n  return bufferExists() && Buffer.isBuffer(x);\r\n}\r\n\r\nexport function makeSuccess(index, value) {\r\n  return {\r\n    status: true,\r\n    index: index,\r\n    value: value,\r\n    furthest: -1,\r\n    expected: []\r\n  };\r\n}\r\n\r\nexport function makeFailure(index, expected) {\r\n  if (!isArray(expected)) {\r\n    expected = [expected];\r\n  }\r\n  return {\r\n    status: false,\r\n    index: -1,\r\n    value: null,\r\n    furthest: index,\r\n    expected: expected\r\n  };\r\n}\r\n\r\nfunction mergeReplies(result, last) {\r\n  if (!last) {\r\n    return result;\r\n  }\r\n  if (result.furthest > last.furthest) {\r\n    return result;\r\n  }\r\n  var expected =\r\n    result.furthest === last.furthest\r\n      ? union(result.expected, last.expected)\r\n      : last.expected;\r\n  return {\r\n    status: result.status,\r\n    index: result.index,\r\n    value: result.value,\r\n    furthest: last.furthest,\r\n    expected: expected\r\n  };\r\n}\r\n\r\nfunction makeLineColumnIndex(input, i) {\r\n  if (isBuffer(input)) {\r\n    return {\r\n      offset: i,\r\n      line: -1,\r\n      column: -1\r\n    };\r\n  }\r\n  var lines = input.slice(0, i).split(\"\\n\");\r\n  // Note that unlike the character offset, the line and column offsets are\r\n  // 1-based.\r\n  var lineWeAreUpTo = lines.length;\r\n  var columnWeAreUpTo = lines[lines.length - 1].length + 1;\r\n  return {\r\n    offset: i,\r\n    line: lineWeAreUpTo,\r\n    column: columnWeAreUpTo\r\n  };\r\n}\r\n\r\n// Returns the sorted set union of two arrays of strings\r\nfunction union(xs, ys) {\r\n  var obj = {};\r\n  for (var i = 0; i < xs.length; i++) {\r\n    obj[xs[i]] = true;\r\n  }\r\n  for (var j = 0; j < ys.length; j++) {\r\n    obj[ys[j]] = true;\r\n  }\r\n  var keys = [];\r\n  for (var k in obj) {\r\n    if ({}.hasOwnProperty.call(obj, k)) {\r\n      keys.push(k);\r\n    }\r\n  }\r\n  keys.sort();\r\n  return keys;\r\n}\r\n\r\nfunction assertParser(p) {\r\n  if (!isParser(p)) {\r\n    throw new Error(\"not a parser: \" + p);\r\n  }\r\n}\r\n\r\nfunction get(input, i) {\r\n  if (typeof input === \"string\") {\r\n    return input.charAt(i);\r\n  }\r\n  return input[i];\r\n}\r\n\r\n// TODO[ES5]: Switch to Array.isArray eventually.\r\nfunction assertArray(x) {\r\n  if (!isArray(x)) {\r\n    throw new Error(\"not an array: \" + x);\r\n  }\r\n}\r\n\r\nfunction assertNumber(x) {\r\n  if (typeof x !== \"number\") {\r\n    throw new Error(\"not a number: \" + x);\r\n  }\r\n}\r\n\r\nfunction assertRegexp(x) {\r\n  if (!(x instanceof RegExp)) {\r\n    throw new Error(\"not a regexp: \" + x);\r\n  }\r\n  var f = flags(x);\r\n  for (var i = 0; i < f.length; i++) {\r\n    var c = f.charAt(i);\r\n    // Only allow regexp flags [imu] for now, since [g] and [y] specifically\r\n    // mess up Parsimmon. If more non-stateful regexp flags are added in the\r\n    // future, this will need to be revisited.\r\n    if (c !== \"i\" && c !== \"m\" && c !== \"u\") {\r\n      throw new Error('unsupported regexp flag \"' + c + '\": ' + x);\r\n    }\r\n  }\r\n}\r\n\r\nfunction assertFunction(x) {\r\n  if (typeof x !== \"function\") {\r\n    throw new Error(\"not a function: \" + x);\r\n  }\r\n}\r\n\r\nfunction assertString(x) {\r\n  if (typeof x !== \"string\") {\r\n    throw new Error(\"not a string: \" + x);\r\n  }\r\n}\r\n\r\n// -*- Error Formatting -*-\r\n\r\nvar linesBeforeStringError = 2;\r\nvar linesAfterStringError = 3;\r\nvar bytesPerLine = 8;\r\nvar bytesBefore = bytesPerLine * 5;\r\nvar bytesAfter = bytesPerLine * 4;\r\nvar defaultLinePrefix = \"  \";\r\n\r\nexport function repeat(string, amount) {\r\n  return new Array(amount + 1).join(string);\r\n}\r\n\r\nexport function formatExpected(expected) {\r\n  if (expected.length === 1) {\r\n    return \"Expected:\\n\\n\" + expected[0];\r\n  }\r\n  return \"Expected one of the following: \\n\\n\" + expected.join(\", \");\r\n}\r\n\r\nexport function leftPad(str, pad, char) {\r\n  var add = pad - str.length;\r\n  if (add <= 0) {\r\n    return str;\r\n  }\r\n  return repeat(char, add) + str;\r\n}\r\n\r\nfunction toChunks(arr, chunkSize) {\r\n  var length = arr.length;\r\n  var chunks = [];\r\n  var chunkIndex = 0;\r\n\r\n  if (length <= chunkSize) {\r\n    return [arr.slice()];\r\n  }\r\n\r\n  for (var i = 0; i < length; i++) {\r\n    if (!chunks[chunkIndex]) {\r\n      chunks.push([]);\r\n    }\r\n\r\n    chunks[chunkIndex].push(arr[i]);\r\n\r\n    if ((i + 1) % chunkSize === 0) {\r\n      chunkIndex++;\r\n    }\r\n  }\r\n\r\n  return chunks;\r\n}\r\n\r\n// Get a range of indexes including `i`-th element and `before` and `after` amount of elements from `arr`.\r\nexport function rangeFromIndexAndOffsets(i, before, after, length) {\r\n  return {\r\n    // Guard against the negative upper bound for lines included in the output.\r\n    from: i - before > 0 ? i - before : 0,\r\n    to: i + after > length ? length : i + after\r\n  };\r\n}\r\n\r\nexport function byteRangeToRange(byteRange) {\r\n  // Exception for inputs smaller than `bytesPerLine`\r\n  if (byteRange.from === 0 && byteRange.to === 1) {\r\n    return {\r\n      from: byteRange.from,\r\n      to: byteRange.to\r\n    };\r\n  }\r\n\r\n  return {\r\n    from: byteRange.from / bytesPerLine,\r\n    // Round `to`, so we don't get float if the amount of bytes is not divisible by `bytesPerLine`\r\n    to: Math.floor(byteRange.to / bytesPerLine)\r\n  };\r\n}\r\n\r\nexport function formatGot(input, error) {\r\n  var index = error.index;\r\n  var i = index.offset;\r\n\r\n  var verticalMarkerLength = 1;\r\n  var column;\r\n  var lineWithErrorIndex;\r\n  var lines;\r\n  var lineRange;\r\n  var lastLineNumberLabelLength;\r\n\r\n  if (i === input.length) {\r\n    return \"Got the end of the input\";\r\n  }\r\n\r\n  if (isBuffer(input)) {\r\n    var byteLineWithErrorIndex = i - (i % bytesPerLine);\r\n    var columnByteIndex = i - byteLineWithErrorIndex;\r\n    var byteRange = rangeFromIndexAndOffsets(\r\n      byteLineWithErrorIndex,\r\n      bytesBefore,\r\n      bytesAfter + bytesPerLine,\r\n      input.length\r\n    );\r\n    var bytes = input.slice(byteRange.from, byteRange.to);\r\n    var bytesInChunks = toChunks(bytes.toJSON().data, bytesPerLine);\r\n\r\n    var byteLines = map(function(byteRow) {\r\n      return map(function(byteValue) {\r\n        // Prefix byte values with a `0` if they are shorter than 2 characters.\r\n        return leftPad(byteValue.toString(16), 2, \"0\");\r\n      }, byteRow);\r\n    }, bytesInChunks);\r\n\r\n    lineRange = byteRangeToRange(byteRange);\r\n    lineWithErrorIndex = byteLineWithErrorIndex / bytesPerLine;\r\n    column = columnByteIndex * 3;\r\n\r\n    // Account for an extra space.\r\n    if (columnByteIndex >= 4) {\r\n      column += 1;\r\n    }\r\n\r\n    verticalMarkerLength = 2;\r\n    lines = map(function(byteLine) {\r\n      return byteLine.length <= 4\r\n        ? byteLine.join(\" \")\r\n        : byteLine.slice(0, 4).join(\" \") + \"  \" + byteLine.slice(4).join(\" \");\r\n    }, byteLines);\r\n    lastLineNumberLabelLength = (\r\n      (lineRange.to > 0 ? lineRange.to - 1 : lineRange.to) * 8\r\n    ).toString(16).length;\r\n\r\n    if (lastLineNumberLabelLength < 2) {\r\n      lastLineNumberLabelLength = 2;\r\n    }\r\n  } else {\r\n    var inputLines = input.split(/\\r\\n|[\\n\\r\\u2028\\u2029]/);\r\n    column = index.column - 1;\r\n    lineWithErrorIndex = index.line - 1;\r\n    lineRange = rangeFromIndexAndOffsets(\r\n      lineWithErrorIndex,\r\n      linesBeforeStringError,\r\n      linesAfterStringError,\r\n      inputLines.length\r\n    );\r\n\r\n    lines = inputLines.slice(lineRange.from, lineRange.to);\r\n    lastLineNumberLabelLength = lineRange.to.toString().length;\r\n  }\r\n\r\n  var lineWithErrorCurrentIndex = lineWithErrorIndex - lineRange.from;\r\n\r\n  if (isBuffer(input)) {\r\n    lastLineNumberLabelLength = (\r\n      (lineRange.to > 0 ? lineRange.to - 1 : lineRange.to) * 8\r\n    ).toString(16).length;\r\n\r\n    if (lastLineNumberLabelLength < 2) {\r\n      lastLineNumberLabelLength = 2;\r\n    }\r\n  }\r\n\r\n  var linesWithLineNumbers = reduce(\r\n    function(acc, lineSource, index) {\r\n      var isLineWithError = index === lineWithErrorCurrentIndex;\r\n      var prefix = isLineWithError ? \"> \" : defaultLinePrefix;\r\n      var lineNumberLabel;\r\n\r\n      if (isBuffer(input)) {\r\n        lineNumberLabel = leftPad(\r\n          ((lineRange.from + index) * 8).toString(16),\r\n          lastLineNumberLabelLength,\r\n          \"0\"\r\n        );\r\n      } else {\r\n        lineNumberLabel = leftPad(\r\n          (lineRange.from + index + 1).toString(),\r\n          lastLineNumberLabelLength,\r\n          \" \"\r\n        );\r\n      }\r\n\r\n      return [].concat(\r\n        acc,\r\n        [prefix + lineNumberLabel + \" | \" + lineSource],\r\n        isLineWithError\r\n          ? [\r\n              defaultLinePrefix +\r\n                repeat(\" \", lastLineNumberLabelLength) +\r\n                \" | \" +\r\n                leftPad(\"\", column, \" \") +\r\n                repeat(\"^\", verticalMarkerLength)\r\n            ]\r\n          : []\r\n      );\r\n    },\r\n    [],\r\n    lines\r\n  );\r\n\r\n  return linesWithLineNumbers.join(\"\\n\");\r\n}\r\n\r\nexport function formatError(input, error) {\r\n  return [\r\n    \"\\n\",\r\n    \"-- PARSING FAILED \" + repeat(\"-\", 50),\r\n    \"\\n\\n\",\r\n    formatGot(input, error),\r\n    \"\\n\\n\",\r\n    formatExpected(error.expected),\r\n    \"\\n\"\r\n  ].join(\"\");\r\n}\r\n\r\nexport function flags(re) {\r\n  var s = \"\" + re;\r\n  return s.slice(s.lastIndexOf(\"/\") + 1);\r\n}\r\n\r\nexport function anchoredRegexp(re) {\r\n  return RegExp(\"^(?:\" + re.source + \")\", flags(re));\r\n}\r\n\r\n// -*- Combinators -*-\r\n\r\nexport function seq() {\r\n  var parsers = [].slice.call(arguments);\r\n  var numParsers = parsers.length;\r\n  for (var j = 0; j < numParsers; j += 1) {\r\n    assertParser(parsers[j]);\r\n  }\r\n  return Parsimmon(function(input, i) {\r\n    var result;\r\n    var accum = new Array(numParsers);\r\n    for (var j = 0; j < numParsers; j += 1) {\r\n      result = mergeReplies(parsers[j]._(input, i), result);\r\n      if (!result.status) {\r\n        return result;\r\n      }\r\n      accum[j] = result.value;\r\n      i = result.index;\r\n    }\r\n    return mergeReplies(makeSuccess(i, accum), result);\r\n  });\r\n}\r\n\r\nexport function seqObj() {\r\n  var seenKeys = {};\r\n  var totalKeys = 0;\r\n  var parsers = toArray(arguments);\r\n  var numParsers = parsers.length;\r\n  for (var j = 0; j < numParsers; j += 1) {\r\n    var p = parsers[j];\r\n    if (isParser(p)) {\r\n      continue;\r\n    }\r\n    if (isArray(p)) {\r\n      var isWellFormed =\r\n        p.length === 2 && typeof p[0] === \"string\" && isParser(p[1]);\r\n      if (isWellFormed) {\r\n        var key = p[0];\r\n        if (Object.prototype.hasOwnProperty.call(seenKeys, key)) {\r\n          throw new Error(\"seqObj: duplicate key \" + key);\r\n        }\r\n        seenKeys[key] = true;\r\n        totalKeys++;\r\n        continue;\r\n      }\r\n    }\r\n    throw new Error(\r\n      \"seqObj arguments must be parsers or [string, parser] array pairs.\"\r\n    );\r\n  }\r\n  if (totalKeys === 0) {\r\n    throw new Error(\"seqObj expects at least one named parser, found zero\");\r\n  }\r\n  return Parsimmon(function(input, i) {\r\n    var result;\r\n    var accum = {};\r\n    for (var j = 0; j < numParsers; j += 1) {\r\n      var name;\r\n      var parser;\r\n      if (isArray(parsers[j])) {\r\n        name = parsers[j][0];\r\n        parser = parsers[j][1];\r\n      } else {\r\n        name = null;\r\n        parser = parsers[j];\r\n      }\r\n      result = mergeReplies(parser._(input, i), result);\r\n      if (!result.status) {\r\n        return result;\r\n      }\r\n      if (name) {\r\n        accum[name] = result.value;\r\n      }\r\n      i = result.index;\r\n    }\r\n    return mergeReplies(makeSuccess(i, accum), result);\r\n  });\r\n}\r\n\r\nexport function seqMap() {\r\n  var args = [].slice.call(arguments);\r\n  if (args.length === 0) {\r\n    throw new Error(\"seqMap needs at least one argument\");\r\n  }\r\n  var mapper = args.pop();\r\n  assertFunction(mapper);\r\n  return seq.apply(null, args).map(function(results) {\r\n    return mapper.apply(null, results);\r\n  });\r\n}\r\n\r\n// TODO[ES5]: Revisit this with Object.keys and .bind.\r\nexport function createLanguage(parsers) {\r\n  var language = {};\r\n  for (var key in parsers) {\r\n    if ({}.hasOwnProperty.call(parsers, key)) {\r\n      (function(key) {\r\n        var func = function() {\r\n          return parsers[key](language);\r\n        };\r\n        language[key] = lazy(func);\r\n      })(key);\r\n    }\r\n  }\r\n  return language;\r\n}\r\n\r\nexport function alt() {\r\n  var parsers = [].slice.call(arguments);\r\n  var numParsers = parsers.length;\r\n  if (numParsers === 0) {\r\n    return fail(\"zero alternates\");\r\n  }\r\n  for (var j = 0; j < numParsers; j += 1) {\r\n    assertParser(parsers[j]);\r\n  }\r\n  return Parsimmon(function(input, i) {\r\n    var result;\r\n    for (var j = 0; j < parsers.length; j += 1) {\r\n      result = mergeReplies(parsers[j]._(input, i), result);\r\n      if (result.status) {\r\n        return result;\r\n      }\r\n    }\r\n    return result;\r\n  });\r\n}\r\n\r\nexport function sepBy(parser, separator) {\r\n  // Argument asserted by sepBy1\r\n  return sepBy1(parser, separator).or(succeed([]));\r\n}\r\n\r\nexport function sepBy1(parser, separator) {\r\n  assertParser(parser);\r\n  assertParser(separator);\r\n  var pairs = separator.then(parser).many();\r\n  return seqMap(parser, pairs, function(r, rs) {\r\n    return [r].concat(rs);\r\n  });\r\n}\r\n\r\n// -*- Core Parsing Methods -*-\r\n\r\n_.parse = function(input) {\r\n  if (typeof input !== \"string\" && !isBuffer(input)) {\r\n    throw new Error(\r\n      \".parse must be called with a string or Buffer as its argument\"\r\n    );\r\n  }\r\n  var result = this.skip(eof)._(input, 0);\r\n  if (result.status) {\r\n    return {\r\n      status: true,\r\n      value: result.value\r\n    };\r\n  }\r\n  return {\r\n    status: false,\r\n    index: makeLineColumnIndex(input, result.furthest),\r\n    expected: result.expected\r\n  };\r\n};\r\n\r\n// -*- Other Methods -*-\r\n\r\n_.tryParse = function(str) {\r\n  var result = this.parse(str);\r\n  if (result.status) {\r\n    return result.value;\r\n  } else {\r\n    var msg = formatError(str, result);\r\n    var err = new Error(msg);\r\n    err.type = \"ParsimmonError\";\r\n    err.result = result;\r\n    throw err;\r\n  }\r\n};\r\n\r\n_.or = function(alternative) {\r\n  return alt(this, alternative);\r\n};\r\n\r\n_.trim = function(parser) {\r\n  return this.wrap(parser, parser);\r\n};\r\n\r\n_.wrap = function(leftParser, rightParser) {\r\n  return seqMap(leftParser, this, rightParser, function(left, middle) {\r\n    return middle;\r\n  });\r\n};\r\n\r\n_.thru = function(wrapper) {\r\n  return wrapper(this);\r\n};\r\n\r\n_.then = function(next) {\r\n  assertParser(next);\r\n  return seq(this, next).map(function(results) {\r\n    return results[1];\r\n  });\r\n};\r\n\r\n_.many = function() {\r\n  var self = this;\r\n\r\n  return Parsimmon(function(input, i) {\r\n    var accum = [];\r\n    var result = undefined;\r\n\r\n    for (;;) {\r\n      result = mergeReplies(self._(input, i), result);\r\n      if (result.status) {\r\n        if (i === result.index) {\r\n          throw new Error(\r\n            \"infinite loop detected in .many() parser --- calling .many() on \" +\r\n              \"a parser which can accept zero characters is usually the cause\"\r\n          );\r\n        }\r\n        i = result.index;\r\n        accum.push(result.value);\r\n      } else {\r\n        return mergeReplies(makeSuccess(i, accum), result);\r\n      }\r\n    }\r\n  });\r\n};\r\n\r\n_.tieWith = function(separator) {\r\n  assertString(separator);\r\n  return this.map(function(args) {\r\n    assertArray(args);\r\n    if (args.length) {\r\n      assertString(args[0]);\r\n      var s = args[0];\r\n      for (var i = 1; i < args.length; i++) {\r\n        assertString(args[i]);\r\n        s += separator + args[i];\r\n      }\r\n      return s;\r\n    } else {\r\n      return \"\";\r\n    }\r\n  });\r\n};\r\n\r\n_.tie = function() {\r\n  return this.tieWith(\"\");\r\n};\r\n\r\n_.times = function(min, max) {\r\n  var self = this;\r\n  if (arguments.length < 2) {\r\n    max = min;\r\n  }\r\n  assertNumber(min);\r\n  assertNumber(max);\r\n  return Parsimmon(function(input, i) {\r\n    var accum = [];\r\n    var result = undefined;\r\n    var prevResult = undefined;\r\n    for (var times = 0; times < min; times += 1) {\r\n      result = self._(input, i);\r\n      prevResult = mergeReplies(result, prevResult);\r\n      if (result.status) {\r\n        i = result.index;\r\n        accum.push(result.value);\r\n      } else {\r\n        return prevResult;\r\n      }\r\n    }\r\n    for (; times < max; times += 1) {\r\n      result = self._(input, i);\r\n      prevResult = mergeReplies(result, prevResult);\r\n      if (result.status) {\r\n        i = result.index;\r\n        accum.push(result.value);\r\n      } else {\r\n        break;\r\n      }\r\n    }\r\n    return mergeReplies(makeSuccess(i, accum), prevResult);\r\n  });\r\n};\r\n\r\n_.result = function(res) {\r\n  return this.map(function() {\r\n    return res;\r\n  });\r\n};\r\n\r\n_.atMost = function(n) {\r\n  return this.times(0, n);\r\n};\r\n\r\n_.atLeast = function(n) {\r\n  return seqMap(this.times(n), this.many(), function(init, rest) {\r\n    return init.concat(rest);\r\n  });\r\n};\r\n\r\n_.map = function(fn) {\r\n  assertFunction(fn);\r\n  var self = this;\r\n  return Parsimmon(function(input, i) {\r\n    var result = self._(input, i);\r\n    if (!result.status) {\r\n      return result;\r\n    }\r\n    return mergeReplies(makeSuccess(result.index, fn(result.value)), result);\r\n  });\r\n};\r\n\r\n_.contramap = function(fn) {\r\n  assertFunction(fn);\r\n  var self = this;\r\n  return Parsimmon(function(input, i) {\r\n    var result = self.parse(fn(input.slice(i)));\r\n    if (!result.status) {\r\n      return result;\r\n    }\r\n    return makeSuccess(i + input.length, result.value);\r\n  });\r\n};\r\n\r\n_.promap = function(f, g) {\r\n  assertFunction(f);\r\n  assertFunction(g);\r\n  return this.contramap(f).map(g);\r\n};\r\n\r\n_.skip = function(next) {\r\n  return seq(this, next).map(function(results) {\r\n    return results[0];\r\n  });\r\n};\r\n\r\n_.mark = function() {\r\n  return seqMap(index, this, index, function(start, value, end) {\r\n    return {\r\n      start: start,\r\n      value: value,\r\n      end: end\r\n    };\r\n  });\r\n};\r\n\r\n_.node = function(name) {\r\n  return seqMap(index, this, index, function(start, value, end) {\r\n    return {\r\n      name: name,\r\n      value: value,\r\n      start: start,\r\n      end: end\r\n    };\r\n  });\r\n};\r\n\r\n_.sepBy = function(separator) {\r\n  return sepBy(this, separator);\r\n};\r\n\r\n_.sepBy1 = function(separator) {\r\n  return sepBy1(this, separator);\r\n};\r\n\r\n_.lookahead = function(x) {\r\n  return this.skip(lookahead(x));\r\n};\r\n\r\n_.notFollowedBy = function(x) {\r\n  return this.skip(notFollowedBy(x));\r\n};\r\n\r\n_.desc = function(expected) {\r\n  if (!isArray(expected)) {\r\n    expected = [expected];\r\n  }\r\n  var self = this;\r\n  return Parsimmon(function(input, i) {\r\n    var reply = self._(input, i);\r\n    if (!reply.status) {\r\n      reply.expected = expected;\r\n    }\r\n    return reply;\r\n  });\r\n};\r\n\r\n_.fallback = function(result) {\r\n  return this.or(succeed(result));\r\n};\r\n\r\n_.ap = function(other) {\r\n  return seqMap(other, this, function(f, x) {\r\n    return f(x);\r\n  });\r\n};\r\n\r\n_.chain = function(f) {\r\n  var self = this;\r\n  return Parsimmon(function(input, i) {\r\n    var result = self._(input, i);\r\n    if (!result.status) {\r\n      return result;\r\n    }\r\n    var nextParser = f(result.value);\r\n    return mergeReplies(nextParser._(input, result.index), result);\r\n  });\r\n};\r\n\r\n// -*- Constructors -*-\r\n\r\nexport function string(str) {\r\n  assertString(str);\r\n  var expected = \"'\" + str + \"'\";\r\n  return Parsimmon(function(input, i) {\r\n    var j = i + str.length;\r\n    var head = input.slice(i, j);\r\n    if (head === str) {\r\n      return makeSuccess(j, head);\r\n    } else {\r\n      return makeFailure(i, expected);\r\n    }\r\n  });\r\n}\r\n\r\nexport function byte(b) {\r\n  ensureBuffer();\r\n  assertNumber(b);\r\n  if (b > 0xff) {\r\n    throw new Error(\r\n      \"Value specified to byte constructor (\" +\r\n        b +\r\n        \"=0x\" +\r\n        b.toString(16) +\r\n        \") is larger in value than a single byte.\"\r\n    );\r\n  }\r\n  var expected = (b > 0xf ? \"0x\" : \"0x0\") + b.toString(16);\r\n  return Parsimmon(function(input, i) {\r\n    var head = get(input, i);\r\n    if (head === b) {\r\n      return makeSuccess(i + 1, head);\r\n    } else {\r\n      return makeFailure(i, expected);\r\n    }\r\n  });\r\n}\r\n\r\nexport function regexp(re, group) {\r\n  assertRegexp(re);\r\n  if (arguments.length >= 2) {\r\n    assertNumber(group);\r\n  } else {\r\n    group = 0;\r\n  }\r\n  var anchored = anchoredRegexp(re);\r\n  var expected = \"\" + re;\r\n  return Parsimmon(function(input, i) {\r\n    var match = anchored.exec(input.slice(i));\r\n    if (match) {\r\n      if (0 <= group && group <= match.length) {\r\n        var fullMatch = match[0];\r\n        var groupMatch = match[group];\r\n        return makeSuccess(i + fullMatch.length, groupMatch);\r\n      }\r\n      var message =\r\n        \"valid match group (0 to \" + match.length + \") in \" + expected;\r\n      return makeFailure(i, message);\r\n    }\r\n    return makeFailure(i, expected);\r\n  });\r\n}\r\n\r\nexport function succeed(value) {\r\n  return Parsimmon(function(input, i) {\r\n    return makeSuccess(i, value);\r\n  });\r\n}\r\n\r\nexport function fail(expected) {\r\n  return Parsimmon(function(input, i) {\r\n    return makeFailure(i, expected);\r\n  });\r\n}\r\n\r\nexport function lookahead(x) {\r\n  if (isParser(x)) {\r\n    return Parsimmon(function(input, i) {\r\n      var result = x._(input, i);\r\n      result.index = i;\r\n      result.value = \"\";\r\n      return result;\r\n    });\r\n  } else if (typeof x === \"string\") {\r\n    return lookahead(string(x));\r\n  } else if (x instanceof RegExp) {\r\n    return lookahead(regexp(x));\r\n  }\r\n  throw new Error(\"not a string, regexp, or parser: \" + x);\r\n}\r\n\r\nexport function notFollowedBy(parser) {\r\n  assertParser(parser);\r\n  return Parsimmon(function(input, i) {\r\n    var result = parser._(input, i);\r\n    var text = input.slice(i, result.index);\r\n    return result.status\r\n      ? makeFailure(i, 'not \"' + text + '\"')\r\n      : makeSuccess(i, null);\r\n  });\r\n}\r\n\r\nexport function test(predicate) {\r\n  assertFunction(predicate);\r\n  return Parsimmon(function(input, i) {\r\n    var char = get(input, i);\r\n    if (i < input.length && predicate(char)) {\r\n      return makeSuccess(i + 1, char);\r\n    } else {\r\n      return makeFailure(i, \"a character/byte matching \" + predicate);\r\n    }\r\n  });\r\n}\r\n\r\nexport function oneOf(str) {\r\n  var expected = str.split(\"\");\r\n  for (var idx = 0; idx < expected.length; idx++) {\r\n    expected[idx] = \"'\" + expected[idx] + \"'\";\r\n  }\r\n  return test(function(ch) {\r\n    return str.indexOf(ch) >= 0;\r\n  }).desc(expected);\r\n}\r\n\r\nexport function noneOf(str) {\r\n  return test(function(ch) {\r\n    return str.indexOf(ch) < 0;\r\n  }).desc(\"none of '\" + str + \"'\");\r\n}\r\n\r\nexport function custom(parsingFunction) {\r\n  return Parsimmon(parsingFunction(makeSuccess, makeFailure));\r\n}\r\n\r\n// TODO[ES5]: Improve error message using JSON.stringify eventually.\r\nexport function range(begin, end) {\r\n  return test(function(ch) {\r\n    return begin <= ch && ch <= end;\r\n  }).desc(begin + \"-\" + end);\r\n}\r\n\r\nexport function takeWhile(predicate) {\r\n  assertFunction(predicate);\r\n\r\n  return Parsimmon(function(input, i) {\r\n    var j = i;\r\n    while (j < input.length && predicate(get(input, j))) {\r\n      j++;\r\n    }\r\n    return makeSuccess(j, input.slice(i, j));\r\n  });\r\n}\r\n\r\nexport function lazy(desc, f) {\r\n  if (arguments.length < 2) {\r\n    f = desc;\r\n    desc = undefined;\r\n  }\r\n\r\n  var parser = Parsimmon(function(input, i) {\r\n    parser._ = f()._;\r\n    return parser._(input, i);\r\n  });\r\n\r\n  if (desc) {\r\n    return parser.desc(desc);\r\n  } else {\r\n    return parser;\r\n  }\r\n}\r\n\r\n// -*- Fantasy Land Extras -*-\r\n\r\nfunction empty() {\r\n  return fail(\"fantasy-land/empty\");\r\n}\r\n\r\n_.concat = _.or;\r\n_.empty = empty;\r\n_.of = succeed;\r\n_[\"fantasy-land/ap\"] = _.ap;\r\n_[\"fantasy-land/chain\"] = _.chain;\r\n_[\"fantasy-land/concat\"] = _.concat;\r\n_[\"fantasy-land/empty\"] = _.empty;\r\n_[\"fantasy-land/of\"] = _.of;\r\n_[\"fantasy-land/map\"] = _.map;\r\n\r\n// -*- Base Parsers -*-\r\n\r\nexport const index = Parsimmon(function(input, i) {\r\n  return makeSuccess(i, makeLineColumnIndex(input, i));\r\n});\r\n\r\nexport const any = Parsimmon(function(input, i) {\r\n  if (i >= input.length) {\r\n    return makeFailure(i, \"any character/byte\");\r\n  }\r\n  return makeSuccess(i + 1, get(input, i));\r\n});\r\n\r\nexport const all = Parsimmon(function(input, i) {\r\n  return makeSuccess(input.length, input.slice(i));\r\n});\r\n\r\nexport const eof = Parsimmon(function(input, i) {\r\n  if (i < input.length) {\r\n    return makeFailure(i, \"EOF\");\r\n  }\r\n  return makeSuccess(i, null);\r\n});\r\n\r\nexport const digit = regexp(/[0-9]/).desc(\"a digit\");\r\nexport const digits = regexp(/[0-9]*/).desc(\"optional digits\");\r\nexport const letter = regexp(/[a-z]/i).desc(\"a letter\");\r\nexport const letters = regexp(/[a-z]*/i).desc(\"optional letters\");\r\nexport const optWhitespace = regexp(/\\s*/).desc(\"optional whitespace\");\r\nexport const whitespace = regexp(/\\s+/).desc(\"whitespace\");\r\nexport const cr = string(\"\\r\");\r\nexport const lf = string(\"\\n\");\r\nexport const crlf = string(\"\\r\\n\");\r\nexport const newline = alt(crlf, lf, cr).desc(\"newline\");\r\nexport const end = alt(newline, eof);","import { equals } from \"./Util.js\";\nimport { Union } from \"./Types.js\";\nconst CaseRules = {\n    None: 0,\n    LowerFirst: 1,\n    SnakeCase: 2,\n    SnakeCaseAllCaps: 3,\n    KebabCase: 4,\n};\nfunction dashify(str, separator) {\n    return str.replace(/[a-z]?[A-Z]/g, (m) => m.length === 1\n        ? m.toLowerCase()\n        : m.charAt(0) + separator + m.charAt(1).toLowerCase());\n}\nfunction changeCase(str, caseRule) {\n    switch (caseRule) {\n        case CaseRules.LowerFirst:\n            return str.charAt(0).toLowerCase() + str.slice(1);\n        case CaseRules.SnakeCase:\n            return dashify(str, \"_\");\n        case CaseRules.SnakeCaseAllCaps:\n            return dashify(str, \"_\").toUpperCase();\n        case CaseRules.KebabCase:\n            return dashify(str, \"-\");\n        case CaseRules.None:\n        default:\n            return str;\n    }\n}\nexport function keyValueList(fields, caseRule = CaseRules.None) {\n    const obj = {};\n    const definedCaseRule = caseRule;\n    function fail(kvPair) {\n        throw new Error(\"Cannot infer key and value of \" + String(kvPair));\n    }\n    function assign(key, caseRule, value) {\n        key = changeCase(key, caseRule);\n        obj[key] = value;\n    }\n    for (let kvPair of fields) {\n        let caseRule = CaseRules.None;\n        if (kvPair == null) {\n            fail(kvPair);\n        }\n        // Deflate unions and use the defined case rule\n        if (kvPair instanceof Union) {\n            const name = kvPair.cases()[kvPair.tag];\n            kvPair = kvPair.fields.length === 0 ? name : [name].concat(kvPair.fields);\n            caseRule = definedCaseRule;\n        }\n        if (Array.isArray(kvPair)) {\n            switch (kvPair.length) {\n                case 0:\n                    fail(kvPair);\n                    break;\n                case 1:\n                    assign(kvPair[0], caseRule, true);\n                    break;\n                case 2:\n                    const value = kvPair[1];\n                    assign(kvPair[0], caseRule, value);\n                    break;\n                default:\n                    assign(kvPair[0], caseRule, kvPair.slice(1));\n            }\n        }\n        else if (typeof kvPair === \"string\") {\n            assign(kvPair, caseRule, true);\n        }\n        else {\n            fail(kvPair);\n        }\n    }\n    return obj;\n}\n// TODO: Move these methods to Map and Set modules\nexport function containsValue(v, map) {\n    for (const kv of map) {\n        if (equals(v, kv[1])) {\n            return true;\n        }\n    }\n    return false;\n}\nexport function tryGetValue(map, key, defaultValue) {\n    if (map.has(key)) {\n        defaultValue.contents = map.get(key);\n        return true;\n    }\n    return false;\n}\nexport function addToSet(v, set) {\n    if (set.has(v)) {\n        return false;\n    }\n    set.add(v);\n    return true;\n}\nexport function addToDict(dict, k, v) {\n    if (dict.has(k)) {\n        throw new Error(\"An item with the same key has already been added. Key: \" + k);\n    }\n    dict.set(k, v);\n}\nexport function getItemFromDict(map, key) {\n    if (map.has(key)) {\n        return map.get(key);\n    }\n    else {\n        throw new Error(`The given key '${key}' was not present in the dictionary.`);\n    }\n}\n","// export type decimal = Decimal;\nexport var NumberStyles;\n(function (NumberStyles) {\n    // None = 0x00000000,\n    // AllowLeadingWhite = 0x00000001,\n    // AllowTrailingWhite = 0x00000002,\n    // AllowLeadingSign = 0x00000004,\n    // AllowTrailingSign = 0x00000008,\n    // AllowParentheses = 0x00000010,\n    // AllowDecimalPoint = 0x00000020,\n    // AllowThousands = 0x00000040,\n    // AllowExponent = 0x00000080,\n    // AllowCurrencySymbol = 0x00000100,\n    NumberStyles[NumberStyles[\"AllowHexSpecifier\"] = 512] = \"AllowHexSpecifier\";\n    // Integer = AllowLeadingWhite | AllowTrailingWhite | AllowLeadingSign,\n    // HexNumber = AllowLeadingWhite | AllowTrailingWhite | AllowHexSpecifier,\n    // Number = AllowLeadingWhite | AllowTrailingWhite | AllowLeadingSign |\n    //          AllowTrailingSign | AllowDecimalPoint | AllowThousands,\n    // Float = AllowLeadingWhite | AllowTrailingWhite | AllowLeadingSign |\n    //         AllowDecimalPoint | AllowExponent,\n    // Currency = AllowLeadingWhite | AllowTrailingWhite | AllowLeadingSign | AllowTrailingSign |\n    //            AllowParentheses | AllowDecimalPoint | AllowThousands | AllowCurrencySymbol,\n    // Any = AllowLeadingWhite | AllowTrailingWhite | AllowLeadingSign | AllowTrailingSign |\n    //       AllowParentheses | AllowDecimalPoint | AllowThousands | AllowCurrencySymbol | AllowExponent,\n})(NumberStyles || (NumberStyles = {}));\nfunction validResponse(regexMatch, radix) {\n    const [/*all*/ , sign, prefix, digits] = regexMatch;\n    return {\n        sign: sign || \"\",\n        prefix: prefix || \"\",\n        digits,\n        radix,\n    };\n}\nfunction getRange(unsigned, bitsize) {\n    switch (bitsize) {\n        case 8: return unsigned ? [0, 255] : [-128, 127];\n        case 16: return unsigned ? [0, 65535] : [-32768, 32767];\n        case 32: return unsigned ? [0, 4294967295] : [-2147483648, 2147483647];\n        default: throw new Error(\"Invalid bit size.\");\n    }\n}\nfunction getInvalidDigits(radix) {\n    switch (radix) {\n        case 2: return /[^0-1]/;\n        case 8: return /[^0-7]/;\n        case 10: return /[^0-9]/;\n        case 16: return /[^0-9a-fA-F]/;\n        default:\n            throw new Error(\"Invalid Base.\");\n    }\n}\nfunction getRadix(prefix, style) {\n    if (style & NumberStyles.AllowHexSpecifier) {\n        return 16;\n    }\n    else {\n        switch (prefix) {\n            case \"0b\":\n            case \"0B\": return 2;\n            case \"0o\":\n            case \"0O\": return 8;\n            case \"0x\":\n            case \"0X\": return 16;\n            default: return 10;\n        }\n    }\n}\nexport function isValid(str, style, radix) {\n    const integerRegex = /^\\s*([\\+\\-])?(0[xXoObB])?([0-9a-fA-F]+)\\s*$/;\n    const res = integerRegex.exec(str.replace(/_/g, \"\"));\n    if (res != null) {\n        const [/*all*/ , /*sign*/ , prefix, digits] = res;\n        radix = radix || getRadix(prefix, style);\n        const invalidDigits = getInvalidDigits(radix);\n        if (!invalidDigits.test(digits)) {\n            return validResponse(res, radix);\n        }\n    }\n    return null;\n}\nexport function parse(str, style, unsigned, bitsize, radix) {\n    const res = isValid(str, style, radix);\n    if (res != null) {\n        let v = Number.parseInt(res.sign + res.digits, res.radix);\n        if (!Number.isNaN(v)) {\n            const [umin, umax] = getRange(true, bitsize);\n            if (!unsigned && res.radix !== 10 && v >= umin && v <= umax) {\n                v = v << (32 - bitsize) >> (32 - bitsize);\n            }\n            const [min, max] = getRange(unsigned, bitsize);\n            if (v >= min && v <= max) {\n                return v;\n            }\n        }\n    }\n    throw new Error(\"Input string was not in a correct format.\");\n}\nexport function tryParse(str, style, unsigned, bitsize, defValue) {\n    try {\n        defValue.contents = parse(str, style, unsigned, bitsize);\n        return true;\n    }\n    catch (_a) {\n        return false;\n    }\n}\nexport function op_UnaryNegation_Int8(x) {\n    return x === -128 ? x : -x;\n}\nexport function op_UnaryNegation_Int16(x) {\n    return x === -32768 ? x : -x;\n}\nexport function op_UnaryNegation_Int32(x) {\n    return x === -2147483648 ? x : -x;\n}\n","// Adapted from https://github.com/MikeMcl/big.js/blob/0f94dc9110d55c4f324a47ba6a2e832ce23ac589/big.mjs\n/* tslint:disable */\nimport { combineHashCodes } from \"../Util.js\";\nimport { symbol } from \"../Numeric.js\";\n// The shared prototype object.\nvar P = {\n    GetHashCode() { return combineHashCodes([this.s, this.e].concat(this.c)); },\n    Equals(x) { return !this.cmp(x); },\n    CompareTo(x) { return this.cmp(x); },\n    [symbol]() {\n        const _this = this;\n        return {\n            multiply: y => _this.mul(y),\n            toPrecision: sd => _this.toPrecision(sd),\n            toExponential: dp => _this.toExponential(dp),\n            toFixed: dp => _this.toFixed(dp),\n            toHex: () => (Number(_this) >>> 0).toString(16),\n        };\n    }\n};\n/*\n *  big.js v6.0.3\n *  A small, fast, easy-to-use library for arbitrary-precision decimal arithmetic.\n *  Copyright (c) 2020 Michael Mclaughlin\n *  https://github.com/MikeMcl/big.js/LICENCE.md\n */\n/************************************** EDITABLE DEFAULTS *****************************************/\n// The default values below must be integers within the stated ranges.\n/*\n * The maximum number of decimal places (DP) of the results of operations involving division:\n * div and sqrt, and pow with negative exponents.\n */\nvar DP = 28, // 0 to MAX_DP\n/*\n * The rounding mode (RM) used when rounding to the above decimal places.\n *\n *  0  Towards zero (i.e. truncate, no rounding).       (ROUND_DOWN)\n *  1  To nearest neighbour. If equidistant, round up.  (ROUND_HALF_UP)\n *  2  To nearest neighbour. If equidistant, to even.   (ROUND_HALF_EVEN)\n *  3  Away from zero.                                  (ROUND_UP)\n */\nRM = 1, // 0, 1, 2 or 3\n// The maximum value of DP and Big.DP.\nMAX_DP = 1E6, // 0 to 1000000\n// The maximum magnitude of the exponent argument to the pow method.\nMAX_POWER = 1E6, // 1 to 1000000\n/*\n * The negative exponent (NE) at and beneath which toString returns exponential notation.\n * (JavaScript numbers: -7)\n * -1000000 is the minimum recommended exponent value of a Big.\n */\nNE = -29, // 0 to -1000000\n/*\n * The positive exponent (PE) at and above which toString returns exponential notation.\n * (JavaScript numbers: 21)\n * 1000000 is the maximum recommended exponent value of a Big, but this limit is not enforced.\n */\nPE = 29, // 0 to 1000000\n/*\n * When true, an error will be thrown if a primitive number is passed to the Big constructor,\n * or if valueOf is called, or if toNumber is called on a Big which cannot be converted to a\n * primitive number without a loss of precision.\n */\nSTRICT = false, // true or false\n/**************************************************************************************************/\n// Error messages.\nNAME = '[big.js] ', INVALID = NAME + 'Invalid ', INVALID_DP = INVALID + 'decimal places', INVALID_RM = INVALID + 'rounding mode', DIV_BY_ZERO = NAME + 'Division by zero', UNDEFINED = void 0, NUMERIC = /^-?(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?$/i;\n/*\n * Create and return a Big constructor.\n */\nfunction _Big_() {\n    /*\n     * The Big constructor and exported function.\n     * Create and return a new instance of a Big number object.\n     *\n     * n {number|string|Big} A numeric value.\n     */\n    function Big(n) {\n        var x = this;\n        // Enable constructor usage without new.\n        if (!(x instanceof Big))\n            return n === UNDEFINED ? _Big_() : new Big(n);\n        // Duplicate.\n        if (n instanceof Big) {\n            x.s = n.s;\n            x.e = n.e;\n            x.c = n.c.slice();\n            normalize(x);\n        }\n        else {\n            if (typeof n !== 'string') {\n                if (Big.strict === true) {\n                    throw TypeError(INVALID + 'number');\n                }\n                // Minus zero?\n                n = n === 0 && 1 / n < 0 ? '-0' : String(n);\n            }\n            parse(x, n);\n        }\n        // Retain a reference to this Big constructor.\n        // Shadow Big.prototype.constructor which points to Object.\n        x.constructor = Big;\n    }\n    Big.prototype = P;\n    Big.DP = DP;\n    Big.RM = RM;\n    Big.NE = NE;\n    Big.PE = PE;\n    Big.strict = STRICT;\n    return Big;\n}\nfunction normalize(x) {\n    // x = round(x, DP, 0);\n    if (x.c.length > 1 && !x.c[0]) {\n        let i = x.c.findIndex(x => x);\n        x.c = x.c.slice(i);\n        x.e = x.e - i;\n    }\n}\n/*\n * Parse the number or string value passed to a Big constructor.\n *\n * x {Big} A Big number instance.\n * n {number|string} A numeric value.\n */\nfunction parse(x, n) {\n    var e, i, nl;\n    if (!NUMERIC.test(n)) {\n        throw Error(INVALID + 'number');\n    }\n    // Determine sign.\n    x.s = n.charAt(0) == '-' ? (n = n.slice(1), -1) : 1;\n    // Decimal point?\n    if ((e = n.indexOf('.')) > -1)\n        n = n.replace('.', '');\n    // Exponential form?\n    if ((i = n.search(/e/i)) > 0) {\n        // Determine exponent.\n        if (e < 0)\n            e = i;\n        e += +n.slice(i + 1);\n        n = n.substring(0, i);\n    }\n    else if (e < 0) {\n        // Integer.\n        e = n.length;\n    }\n    nl = n.length;\n    // Determine leading zeros before decimal point.\n    for (i = 0; i < e && i < nl && n.charAt(i) == '0';)\n        ++i;\n    // original version (ignores decimal point).\n    // // Determine leading zeros.\n    // for (i = 0; i < nl && n.charAt(i) == '0';) ++i;\n    if (i == nl) {\n        // Zero.\n        x.c = [x.e = 0];\n    }\n    else {\n        x.e = e - i - 1;\n        x.c = [];\n        // Convert string to array of digits without leading zeros\n        for (e = 0; i < nl;)\n            x.c[e++] = +n.charAt(i++);\n        // older version (doesn't keep trailing zeroes).\n        // // Determine trailing zeros.\n        // for (; nl > 0 && n.charAt(--nl) == '0';);\n        // // Convert string to array of digits without leading/trailing zeros.\n        // for (e = 0; i <= nl;) x.c[e++] = +n.charAt(i++);\n    }\n    x = round(x, Big.DP + 1, Big.RM);\n    return x;\n}\n/*\n * Round Big x to a maximum of sd significant digits using rounding mode rm.\n *\n * x {Big} The Big to round.\n * sd {number} Significant digits: integer, 0 to MAX_DP inclusive.\n * rm {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\n * [more] {boolean} Whether the result of division was truncated.\n */\nfunction round(x, sd, rm, more) {\n    var xc = x.c;\n    if (rm === UNDEFINED)\n        rm = Big.RM;\n    if (rm !== 0 && rm !== 1 && rm !== 2 && rm !== 3) {\n        throw Error(INVALID_RM);\n    }\n    if (sd < 1) {\n        more =\n            rm === 3 && (more || !!xc[0]) || sd === 0 && (rm === 1 && xc[0] >= 5 ||\n                rm === 2 && (xc[0] > 5 || xc[0] === 5 && (more || xc[1] !== UNDEFINED)));\n        xc.length = 1;\n        if (more) {\n            // 1, 0.1, 0.01, 0.001, 0.0001 etc.\n            x.e = x.e - sd + 1;\n            xc[0] = 1;\n        }\n        else {\n            // Zero.\n            xc[0] = x.e = 0;\n        }\n    }\n    else if (sd < xc.length) {\n        // xc[sd] is the digit after the digit that may be rounded up.\n        const isZero = xc.findIndex((xci, idx) => idx >= sd && xci > 0) < 0;\n        more =\n            rm === 1 && xc[sd] >= 5 ||\n                rm === 2 && (xc[sd] > 5 || xc[sd] === 5 &&\n                    (more || xc[sd + 1] !== UNDEFINED || xc[sd - 1] & 1)) ||\n                rm === 3 && (more || !isZero);\n        // Remove any digits after the required precision.\n        xc.length = sd--;\n        // Round up?\n        if (more) {\n            // Rounding up may mean the previous digit has to be rounded up.\n            for (; ++xc[sd] > 9;) {\n                xc[sd] = 0;\n                if (!sd--) {\n                    ++x.e;\n                    xc.unshift(1);\n                }\n            }\n        }\n        // Remove trailing zeros.\n        for (sd = xc.length; !xc[--sd];)\n            xc.pop();\n    }\n    return x;\n}\n/*\n * Return a string representing the value of Big x in normal or exponential notation.\n * Handles P.toExponential, P.toFixed, P.toJSON, P.toPrecision, P.toString and P.valueOf.\n */\nfunction stringify(x, doExponential, isNonzero) {\n    var e = x.e, s = x.c.join(''), n = s.length;\n    // Exponential notation?\n    if (doExponential) {\n        s = s.charAt(0) + (n > 1 ? '.' + s.slice(1) : '') + (e < 0 ? 'e' : 'e+') + e;\n        // Normal notation.\n    }\n    else if (e < 0) {\n        for (; ++e;)\n            s = '0' + s;\n        s = '0.' + s;\n    }\n    else if (e > 0) {\n        if (++e > n) {\n            for (e -= n; e--;)\n                s += '0';\n        }\n        else if (e < n) {\n            s = s.slice(0, e) + '.' + s.slice(e);\n        }\n    }\n    else if (n > 1) {\n        s = s.charAt(0) + '.' + s.slice(1);\n    }\n    return x.s < 0 && isNonzero ? '-' + s : s;\n}\n// Prototype/instance methods\n/*\n * Return a new Big whose value is the absolute value of this Big.\n */\nP.abs = function () {\n    var x = new this.constructor(this);\n    x.s = 1;\n    return x;\n};\n/*\n * Return 1 if the value of this Big is greater than the value of Big y,\n *       -1 if the value of this Big is less than the value of Big y, or\n *        0 if they have the same value.\n */\nP.cmp = function (y) {\n    var isneg, Big = this.constructor, x = new Big(this), y = new Big(y), xc = x.c, yc = y.c, i = x.s, j = y.s, k = x.e, l = y.e;\n    // Either zero?\n    if (!xc[0] || !yc[0])\n        return !xc[0] ? !yc[0] ? 0 : -j : i;\n    // Signs differ?\n    if (i != j)\n        return i;\n    isneg = i < 0;\n    // Compare exponents.\n    if (k != l)\n        return k > l ^ isneg ? 1 : -1;\n    // Compare digit by digit.\n    j = Math.max(xc.length, yc.length);\n    for (i = 0; i < j; i++) {\n        k = i < xc.length ? xc[i] : 0;\n        l = i < yc.length ? yc[i] : 0;\n        if (k != l)\n            return k > l ^ isneg ? 1 : -1;\n    }\n    return 0;\n    // original version (doesn't compare well trailing zeroes, e.g. 1.0 with 1.00)\n    // j = (k = xc.length) < (l = yc.length) ? k : l;\n    // // Compare digit by digit.\n    // for (i = -1; ++i < j;) {\n    //   if (xc[i] != yc[i]) return xc[i] > yc[i] ^ isneg ? 1 : -1;\n    // }\n    // // Compare lengths.\n    // return k == l ? 0 : k > l ^ isneg ? 1 : -1;\n};\n/*\n * Return a new Big whose value is the value of this Big divided by the value of Big y, rounded,\n * if necessary, to a maximum of Big.DP decimal places using rounding mode Big.RM.\n */\nP.div = function (y) {\n    var Big = this.constructor, x = new Big(this), y = new Big(y), a = x.c, // dividend\n    b = y.c, // divisor\n    k = x.s == y.s ? 1 : -1, dp = Big.DP;\n    if (dp !== ~~dp || dp < 0 || dp > MAX_DP) {\n        throw Error(INVALID_DP);\n    }\n    // Divisor is zero?\n    if (!b[0]) {\n        throw Error(DIV_BY_ZERO);\n    }\n    // Dividend is 0? Return +-0.\n    if (!a[0]) {\n        y.s = k;\n        y.c = [y.e = 0];\n        return y;\n    }\n    var bl, bt, n, cmp, ri, bz = b.slice(), ai = bl = b.length, al = a.length, r = a.slice(0, bl), // remainder\n    rl = r.length, q = y, // quotient\n    qc = q.c = [], qi = 0, p = dp + (q.e = x.e - y.e) + 1; // precision of the result\n    q.s = k;\n    k = p < 0 ? 0 : p;\n    // Create version of divisor with leading zero.\n    bz.unshift(0);\n    // Add zeros to make remainder as long as divisor.\n    for (; rl++ < bl;)\n        r.push(0);\n    do {\n        // n is how many times the divisor goes into current remainder.\n        for (n = 0; n < 10; n++) {\n            // Compare divisor and remainder.\n            if (bl != (rl = r.length)) {\n                cmp = bl > rl ? 1 : -1;\n            }\n            else {\n                for (ri = -1, cmp = 0; ++ri < bl;) {\n                    if (b[ri] != r[ri]) {\n                        cmp = b[ri] > r[ri] ? 1 : -1;\n                        break;\n                    }\n                }\n            }\n            // If divisor < remainder, subtract divisor from remainder.\n            if (cmp < 0) {\n                // Remainder can't be more than 1 digit longer than divisor.\n                // Equalise lengths using divisor with extra leading zero?\n                for (bt = rl == bl ? b : bz; rl;) {\n                    if (r[--rl] < bt[rl]) {\n                        ri = rl;\n                        for (; ri && !r[--ri];)\n                            r[ri] = 9;\n                        --r[ri];\n                        r[rl] += 10;\n                    }\n                    r[rl] -= bt[rl];\n                }\n                for (; !r[0];)\n                    r.shift();\n            }\n            else {\n                break;\n            }\n        }\n        // Add the digit n to the result array.\n        qc[qi++] = cmp ? n : ++n;\n        // Update the remainder.\n        if (r[0] && cmp)\n            r[rl] = a[ai] || 0;\n        else\n            r = [a[ai]];\n    } while ((ai++ < al || r[0] !== UNDEFINED) && k--);\n    // Leading zero? Do not remove if result is simply zero (qi == 1).\n    if (!qc[0] && qi != 1) {\n        // There can't be more than one zero.\n        qc.shift();\n        q.e--;\n        p--;\n    }\n    // Round?\n    if (qi > p)\n        round(q, p, Big.RM, r[0] !== UNDEFINED);\n    return q;\n};\n/*\n * Return true if the value of this Big is equal to the value of Big y, otherwise return false.\n */\nP.eq = function (y) {\n    return this.cmp(y) === 0;\n};\n/*\n * Return true if the value of this Big is greater than the value of Big y, otherwise return\n * false.\n */\nP.gt = function (y) {\n    return this.cmp(y) > 0;\n};\n/*\n * Return true if the value of this Big is greater than or equal to the value of Big y, otherwise\n * return false.\n */\nP.gte = function (y) {\n    return this.cmp(y) > -1;\n};\n/*\n * Return true if the value of this Big is less than the value of Big y, otherwise return false.\n */\nP.lt = function (y) {\n    return this.cmp(y) < 0;\n};\n/*\n * Return true if the value of this Big is less than or equal to the value of Big y, otherwise\n * return false.\n */\nP.lte = function (y) {\n    return this.cmp(y) < 1;\n};\n/*\n * Return a new Big whose value is the value of this Big minus the value of Big y.\n */\nP.minus = P.sub = function (y) {\n    var i, j, t, xlty, Big = this.constructor, x = new Big(this), y = new Big(y), a = x.s, b = y.s;\n    // Signs differ?\n    if (a != b) {\n        y.s = -b;\n        return x.plus(y);\n    }\n    var xc = x.c.slice(), xe = x.e, yc = y.c, ye = y.e;\n    // Either zero?\n    if (!xc[0] || !yc[0]) {\n        if (yc[0]) {\n            y.s = -b;\n        }\n        else if (xc[0]) {\n            y = new Big(x);\n        }\n        else {\n            y.s = 1;\n        }\n        return y;\n    }\n    // Determine which is the bigger number. Prepend zeros to equalise exponents.\n    if (a = xe - ye) {\n        if (xlty = a < 0) {\n            a = -a;\n            t = xc;\n        }\n        else {\n            ye = xe;\n            t = yc;\n        }\n        t.reverse();\n        for (b = a; b--;)\n            t.push(0);\n        t.reverse();\n    }\n    else {\n        // Exponents equal. Check digit by digit.\n        j = ((xlty = xc.length < yc.length) ? xc : yc).length;\n        for (a = b = 0; b < j; b++) {\n            if (xc[b] != yc[b]) {\n                xlty = xc[b] < yc[b];\n                break;\n            }\n        }\n    }\n    // x < y? Point xc to the array of the bigger number.\n    if (xlty) {\n        t = xc;\n        xc = yc;\n        yc = t;\n        y.s = -y.s;\n    }\n    /*\n     * Append zeros to xc if shorter. No need to add zeros to yc if shorter as subtraction only\n     * needs to start at yc.length.\n     */\n    if ((b = (j = yc.length) - (i = xc.length)) > 0)\n        for (; b--;)\n            xc[i++] = 0;\n    // Subtract yc from xc.\n    for (b = i; j > a;) {\n        if (xc[--j] < yc[j]) {\n            for (i = j; i && !xc[--i];)\n                xc[i] = 9;\n            --xc[i];\n            xc[j] += 10;\n        }\n        xc[j] -= yc[j];\n    }\n    // Remove trailing zeros.\n    for (; xc[--b] === 0;)\n        xc.pop();\n    // Remove leading zeros and adjust exponent accordingly.\n    for (; xc[0] === 0;) {\n        xc.shift();\n        --ye;\n    }\n    if (!xc[0]) {\n        // n - n = +0\n        y.s = 1;\n        // Result must be zero.\n        xc = [ye = 0];\n    }\n    y.c = xc;\n    y.e = ye;\n    return y;\n};\n/*\n * Return a new Big whose value is the value of this Big modulo the value of Big y.\n */\nP.mod = function (y) {\n    var ygtx, Big = this.constructor, x = new Big(this), y = new Big(y), a = x.s, b = y.s;\n    if (!y.c[0]) {\n        throw Error(DIV_BY_ZERO);\n    }\n    x.s = y.s = 1;\n    ygtx = y.cmp(x) == 1;\n    x.s = a;\n    y.s = b;\n    if (ygtx)\n        return new Big(x);\n    a = Big.DP;\n    b = Big.RM;\n    Big.DP = Big.RM = 0;\n    x = x.div(y);\n    Big.DP = a;\n    Big.RM = b;\n    return this.minus(x.times(y));\n};\n/*\n * Return a new Big whose value is the value of this Big plus the value of Big y.\n */\nP.plus = P.add = function (y) {\n    var e, k, t, Big = this.constructor, x = new Big(this), y = new Big(y);\n    // Signs differ?\n    if (x.s != y.s) {\n        y.s = -y.s;\n        return x.minus(y);\n    }\n    var xe = x.e, xc = x.c, ye = y.e, yc = y.c;\n    // Either zero?\n    if (!xc[0] || !yc[0]) {\n        if (!yc[0]) {\n            if (xc[0]) {\n                y = new Big(x);\n            }\n            else {\n                y.s = x.s;\n            }\n        }\n        return y;\n    }\n    xc = xc.slice();\n    // Prepend zeros to equalise exponents.\n    // Note: reverse faster than unshifts.\n    if (e = xe - ye) {\n        if (e > 0) {\n            ye = xe;\n            t = yc;\n        }\n        else {\n            e = -e;\n            t = xc;\n        }\n        t.reverse();\n        for (; e--;)\n            t.push(0);\n        t.reverse();\n    }\n    // Point xc to the longer array.\n    if (xc.length - yc.length < 0) {\n        t = yc;\n        yc = xc;\n        xc = t;\n    }\n    e = yc.length;\n    // Only start adding at yc.length - 1 as the further digits of xc can be left as they are.\n    for (k = 0; e; xc[e] %= 10)\n        k = (xc[--e] = xc[e] + yc[e] + k) / 10 | 0;\n    // No need to check for zero, as +x + +y != 0 && -x + -y != 0\n    if (k) {\n        xc.unshift(k);\n        ++ye;\n    }\n    // Remove trailing zeros.\n    for (e = xc.length; xc[--e] === 0;)\n        xc.pop();\n    y.c = xc;\n    y.e = ye;\n    return y;\n};\n/*\n * Return a Big whose value is the value of this Big raised to the power n.\n * If n is negative, round to a maximum of Big.DP decimal places using rounding\n * mode Big.RM.\n *\n * n {number} Integer, -MAX_POWER to MAX_POWER inclusive.\n */\nP.pow = function (n) {\n    var Big = this.constructor, x = new Big(this), y = new Big('1'), one = new Big('1'), isneg = n < 0;\n    if (n !== ~~n || n < -MAX_POWER || n > MAX_POWER) {\n        throw Error(INVALID + 'exponent');\n    }\n    if (isneg)\n        n = -n;\n    for (;;) {\n        if (n & 1)\n            y = y.times(x);\n        n >>= 1;\n        if (!n)\n            break;\n        x = x.times(x);\n    }\n    return isneg ? one.div(y) : y;\n};\n/*\n * Return a new Big whose value is the value of this Big rounded to a maximum precision of sd\n * significant digits using rounding mode rm, or Big.RM if rm is not specified.\n *\n * sd {number} Significant digits: integer, 1 to MAX_DP inclusive.\n * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\n */\nP.prec = function (sd, rm) {\n    if (sd !== ~~sd || sd < 1 || sd > MAX_DP) {\n        throw Error(INVALID + 'precision');\n    }\n    return round(new this.constructor(this), sd, rm);\n};\n/*\n * Return a new Big whose value is the value of this Big rounded to a maximum of dp decimal places\n * using rounding mode rm, or Big.RM if rm is not specified.\n * If dp is negative, round to an integer which is a multiple of 10**-dp.\n * If dp is not specified, round to 0 decimal places.\n *\n * dp? {number} Integer, -MAX_DP to MAX_DP inclusive.\n * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\n */\nP.round = function (dp, rm) {\n    if (dp === UNDEFINED)\n        dp = 0;\n    else if (dp !== ~~dp || dp < -MAX_DP || dp > MAX_DP) {\n        throw Error(INVALID_DP);\n    }\n    return round(new this.constructor(this), dp + this.e + 1, rm);\n};\n/*\n * Return a new Big whose value is the square root of the value of this Big, rounded, if\n * necessary, to a maximum of Big.DP decimal places using rounding mode Big.RM.\n */\nP.sqrt = function () {\n    var r, c, t, Big = this.constructor, x = new Big(this), s = x.s, e = x.e, half = new Big('0.5');\n    // Zero?\n    if (!x.c[0])\n        return new Big(x);\n    // Negative?\n    if (s < 0) {\n        throw Error(NAME + 'No square root');\n    }\n    // Estimate.\n    s = Math.sqrt(x + '');\n    // Math.sqrt underflow/overflow?\n    // Re-estimate: pass x coefficient to Math.sqrt as integer, then adjust the result exponent.\n    if (s === 0 || s === 1 / 0) {\n        c = x.c.join('');\n        if (!(c.length + e & 1))\n            c += '0';\n        s = Math.sqrt(c);\n        e = ((e + 1) / 2 | 0) - (e < 0 || e & 1);\n        r = new Big((s == 1 / 0 ? '5e' : (s = s.toExponential()).slice(0, s.indexOf('e') + 1)) + e);\n    }\n    else {\n        r = new Big(s + '');\n    }\n    e = r.e + (Big.DP += 4);\n    // Newton-Raphson iteration.\n    do {\n        t = r;\n        r = half.times(t.plus(x.div(t)));\n    } while (t.c.slice(0, e).join('') !== r.c.slice(0, e).join(''));\n    return round(r, (Big.DP -= 4) + r.e + 1, Big.RM);\n};\n/*\n * Return a new Big whose value is the value of this Big times the value of Big y.\n */\nP.times = P.mul = function (y) {\n    var c, Big = this.constructor, x = new Big(this), y = new Big(y), xc = x.c, yc = y.c, a = xc.length, b = yc.length, i = x.e, j = y.e;\n    // Determine sign of result.\n    y.s = x.s == y.s ? 1 : -1;\n    // Return signed 0 if either 0.\n    if (!xc[0] || !yc[0]) {\n        y.c = [y.e = 0];\n        return y;\n    }\n    // Initialise exponent of result as x.e + y.e.\n    y.e = i + j;\n    // If array xc has fewer digits than yc, swap xc and yc, and lengths.\n    if (a < b) {\n        c = xc;\n        xc = yc;\n        yc = c;\n        j = a;\n        a = b;\n        b = j;\n    }\n    // Initialise coefficient array of result with zeros.\n    for (c = new Array(j = a + b); j--;)\n        c[j] = 0;\n    // Multiply.\n    // i is initially xc.length.\n    for (i = b; i--;) {\n        b = 0;\n        // a is yc.length.\n        for (j = a + i; j > i;) {\n            // Current sum of products at this digit position, plus carry.\n            b = c[j] + yc[i] * xc[j - i - 1] + b;\n            c[j--] = b % 10;\n            // carry\n            b = b / 10 | 0;\n        }\n        c[j] = b;\n    }\n    // Increment result exponent if there is a final carry, otherwise remove leading zero.\n    if (b)\n        ++y.e;\n    else\n        c.shift();\n    // Remove trailing zeros.\n    for (i = c.length; !c[--i];)\n        c.pop();\n    y.c = c;\n    return y;\n};\n/*\n * Return a string representing the value of this Big in exponential notation rounded to dp fixed\n * decimal places using rounding mode rm, or Big.RM if rm is not specified.\n *\n * dp? {number} Decimal places: integer, 0 to MAX_DP inclusive.\n * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\n */\nP.toExponential = function (dp, rm) {\n    var x = this, n = x.c[0];\n    if (dp !== UNDEFINED) {\n        if (dp !== ~~dp || dp < 0 || dp > MAX_DP) {\n            throw Error(INVALID_DP);\n        }\n        x = round(new x.constructor(x), ++dp, rm);\n        for (; x.c.length < dp;)\n            x.c.push(0);\n    }\n    return stringify(x, true, !!n);\n};\n/*\n * Return a string representing the value of this Big in normal notation rounded to dp fixed\n * decimal places using rounding mode rm, or Big.RM if rm is not specified.\n *\n * dp? {number} Decimal places: integer, 0 to MAX_DP inclusive.\n * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\n *\n * (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.\n * (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.\n */\nP.toFixed = function (dp, rm) {\n    var x = this, n = x.c[0];\n    if (dp !== UNDEFINED) {\n        if (dp !== ~~dp || dp < 0 || dp > MAX_DP) {\n            throw Error(INVALID_DP);\n        }\n        x = round(new x.constructor(x), dp + x.e + 1, rm);\n        // x.e may have changed if the value is rounded up.\n        for (dp = dp + x.e + 1; x.c.length < dp;)\n            x.c.push(0);\n    }\n    return stringify(x, false, !!n);\n};\n/*\n * Return a string representing the value of this Big.\n * Return exponential notation if this Big has a positive exponent equal to or greater than\n * Big.PE, or a negative exponent equal to or less than Big.NE.\n * Omit the sign for negative zero.\n */\nP.toJSON = P.toString = function () {\n    var x = this, Big = x.constructor;\n    return stringify(x, x.e <= Big.NE || x.e >= Big.PE, !!x.c[0]);\n};\n/*\n * Return the value of this Big as a primitve number.\n */\nP.toNumber = function () {\n    var n = Number(stringify(this, true, true));\n    if (this.constructor.strict === true && !this.eq(n.toString())) {\n        throw Error(NAME + 'Imprecise conversion');\n    }\n    return n;\n};\n/*\n * Return a string representing the value of this Big rounded to sd significant digits using\n * rounding mode rm, or Big.RM if rm is not specified.\n * Use exponential notation if sd is less than the number of digits necessary to represent\n * the integer part of the value in normal notation.\n *\n * sd {number} Significant digits: integer, 1 to MAX_DP inclusive.\n * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\n */\nP.toPrecision = function (sd, rm) {\n    var x = this, Big = x.constructor, n = x.c[0];\n    if (sd !== UNDEFINED) {\n        if (sd !== ~~sd || sd < 1 || sd > MAX_DP) {\n            throw Error(INVALID + 'precision');\n        }\n        x = round(new Big(x), sd, rm);\n        for (; x.c.length < sd;)\n            x.c.push(0);\n    }\n    return stringify(x, sd <= x.e || x.e <= Big.NE || x.e >= Big.PE, !!n);\n};\n/*\n * Return a string representing the value of this Big.\n * Return exponential notation if this Big has a positive exponent equal to or greater than\n * Big.PE, or a negative exponent equal to or less than Big.NE.\n * Include the sign for negative zero.\n */\nP.valueOf = function () {\n    var x = this, Big = x.constructor;\n    if (Big.strict === true) {\n        throw Error(NAME + 'valueOf disallowed');\n    }\n    return stringify(x, x.e <= Big.NE || x.e >= Big.PE, true);\n};\n// Export\nexport var Big = _Big_();\n/// <reference types=\"https://raw.githubusercontent.com/DefinitelyTyped/DefinitelyTyped/master/types/big.js/index.d.ts\" />\nexport default Big;\n","import Decimal from \"./lib/big.js\";\nimport { FSharpRef } from \"./Types.js\";\nexport default Decimal;\nexport const get_Zero = new Decimal(0);\nexport const get_One = new Decimal(1);\nexport const get_MinusOne = new Decimal(-1);\nexport const get_MaxValue = new Decimal(\"79228162514264337593543950335\");\nexport const get_MinValue = new Decimal(\"-79228162514264337593543950335\");\nexport function compare(x, y) {\n    return x.cmp(y);\n}\nexport function equals(x, y) {\n    return !x.cmp(y);\n}\nexport function abs(x) {\n    return x.abs();\n}\nexport function round(x, digits = 0) {\n    return x.round(digits, 2 /* ROUND_HALF_EVEN */);\n}\nexport function truncate(x) {\n    return x.round(0, 0 /* ROUND_DOWN */);\n}\nexport function ceiling(x) {\n    return x.round(0, x.cmp(0) >= 0 ? 3 /* ROUND_UP */ : 0 /* ROUND_DOWN */);\n}\nexport function floor(x) {\n    return x.round(0, x.cmp(0) >= 0 ? 0 /* ROUND_DOWN */ : 3 /* ROUND_UP */);\n}\nexport function pow(x, n) {\n    return x.pow(n);\n}\nexport function sqrt(x) {\n    return x.sqrt();\n}\nexport function op_Addition(x, y) {\n    return x.add(y);\n}\nexport function op_Subtraction(x, y) {\n    return x.sub(y);\n}\nexport function op_Multiply(x, y) {\n    return x.mul(y);\n}\nexport function op_Division(x, y) {\n    return x.div(y);\n}\nexport function op_Modulus(x, y) {\n    return x.mod(y);\n}\nexport function op_UnaryNegation(x) {\n    const x2 = new Decimal(x);\n    x2.s = -x2.s || 0;\n    return x2;\n}\nexport const add = op_Addition;\nexport const subtract = op_Subtraction;\nexport const multiply = op_Multiply;\nexport const divide = op_Division;\nexport const remainder = op_Modulus;\nexport const negate = op_UnaryNegation;\nexport function toString(x) {\n    return x.toString();\n}\nexport function tryParse(str, defValue) {\n    try {\n        defValue.contents = new Decimal(str.trim());\n        return true;\n    }\n    catch (_a) {\n        return false;\n    }\n}\nexport function parse(str) {\n    const defValue = new FSharpRef(get_Zero);\n    if (tryParse(str, defValue)) {\n        return defValue.contents;\n    }\n    else {\n        throw new Error(\"Input string was not in a correct format.\");\n    }\n}\nexport function toNumber(x) {\n    return +x;\n}\nfunction decimalToHex(dec, bitSize) {\n    const hex = new Uint8Array(bitSize / 4 | 0);\n    let hexCount = 1;\n    for (let d = 0; d < dec.length; d++) {\n        let value = dec[d];\n        for (let i = 0; i < hexCount; i++) {\n            const digit = hex[i] * 10 + value | 0;\n            hex[i] = digit & 0xF;\n            value = digit >> 4;\n        }\n        if (value !== 0) {\n            hex[hexCount++] = value;\n        }\n    }\n    return hex.slice(0, hexCount); // digits in reverse order\n}\nfunction hexToDecimal(hex, bitSize) {\n    const dec = new Uint8Array(bitSize * 301 / 1000 + 1 | 0);\n    let decCount = 1;\n    for (let d = hex.length - 1; d >= 0; d--) {\n        let carry = hex[d];\n        for (let i = 0; i < decCount; i++) {\n            const val = dec[i] * 16 + carry | 0;\n            dec[i] = (val % 10) | 0;\n            carry = (val / 10) | 0;\n        }\n        while (carry > 0) {\n            dec[decCount++] = (carry % 10) | 0;\n            carry = (carry / 10) | 0;\n        }\n    }\n    return dec.slice(0, decCount); // digits in reverse order\n}\nfunction setInt32Bits(hexDigits, bits, offset) {\n    for (let i = 0; i < 8; i++) {\n        hexDigits[offset + i] = (bits >> (i * 4)) & 0xF;\n    }\n}\nfunction getInt32Bits(hexDigits, offset) {\n    let bits = 0;\n    for (let i = 0; i < 8; i++) {\n        bits = bits | (hexDigits[offset + i] << (i * 4));\n    }\n    return bits;\n}\nexport function fromIntArray(bits) {\n    return fromInts(bits[0], bits[1], bits[2], bits[3]);\n}\nexport function fromInts(low, mid, high, signExp) {\n    const isNegative = signExp < 0;\n    const scale = (signExp >> 16) & 0x7F;\n    return fromParts(low, mid, high, isNegative, scale);\n}\nexport function fromParts(low, mid, high, isNegative, scale) {\n    const bitSize = 96;\n    const hexDigits = new Uint8Array(bitSize / 4);\n    setInt32Bits(hexDigits, low, 0);\n    setInt32Bits(hexDigits, mid, 8);\n    setInt32Bits(hexDigits, high, 16);\n    const decDigits = hexToDecimal(hexDigits, bitSize);\n    scale = scale & 0x7F;\n    const big = new Decimal(0);\n    big.c = Array.from(decDigits.reverse());\n    big.e = decDigits.length - scale - 1;\n    big.s = isNegative ? -1 : 1;\n    const d = new Decimal(big);\n    return d;\n}\nexport function getBits(d) {\n    const bitSize = 96;\n    const decDigits = Uint8Array.from(d.c);\n    const hexDigits = decimalToHex(decDigits, bitSize);\n    const low = getInt32Bits(hexDigits, 0);\n    const mid = getInt32Bits(hexDigits, 8);\n    const high = getInt32Bits(hexDigits, 16);\n    const decStr = d.toString();\n    const dotPos = decStr.indexOf(\".\");\n    const scale = dotPos < 0 ? 0 : decStr.length - dotPos - 1;\n    const signExp = ((scale & 0x7F) << 16) | (d.s < 0 ? 0x80000000 : 0);\n    return [low, mid, high, signExp];\n}\n// export function makeRangeStepFunction(step: Decimal, last: Decimal) {\n//   const stepComparedWithZero = step.cmp(get_Zero);\n//   if (stepComparedWithZero === 0) {\n//     throw new Error(\"The step of a range cannot be zero\");\n//   }\n//   const stepGreaterThanZero = stepComparedWithZero > 0;\n//   return (x: Decimal) => {\n//     const comparedWithLast = x.cmp(last);\n//     if ((stepGreaterThanZero && comparedWithLast <= 0)\n//       || (!stepGreaterThanZero && comparedWithLast >= 0)) {\n//       return [x, op_Addition(x, step)];\n//     } else {\n//       return undefined;\n//     }\n//   };\n// }\n","namespace Fable.Parsimmon\r\n\r\nopen Fable.Core\r\nopen Fable.Core.JsInterop\r\n\r\ntype ParseResult<'t> =\r\n    abstract status : bool\r\n    abstract value : 't\r\n\r\ntype IParserOffSet =\r\n    abstract offset : int\r\n    abstract line : int\r\n    abstract column : int\r\n\r\ntype TokenPosition =\r\n    { offset: int\r\n      line: int\r\n      column: int }\r\n\r\ntype NodeResult<'t> =\r\n    { name: string\r\n      value: 't\r\n      start: TokenPosition\r\n      ``end``: TokenPosition }\r\n\r\ntype IParser<'t> =\r\n    abstract map<'u> : ('t -> 'u) -> IParser<'u>\r\n    abstract parse : string -> ParseResult<'t>\r\n    abstract times : int -> IParser<'t []>\r\n    abstract times : int * int -> IParser<'t []>\r\n    abstract many : unit -> IParser<'t []>\r\n    [<Emit(\"$0.then($1)\")>]\r\n    abstract chain : IParser<'u> -> IParser<'u>\r\n    [<Emit(\"$0.chain($1)\")>]\r\n    abstract bind : ('t -> IParser<'u>) -> IParser<'u>\r\n    abstract skip : IParser<'u> -> IParser<'t>\r\n    abstract sepBy : IParser<'u> -> IParser<'t []>\r\n    abstract fallback : 't -> IParser<'t>\r\n    abstract trim : IParser<'u> -> IParser<'t>\r\n    abstract notFollowedBy : IParser<'u> -> IParser<'t>\r\n    abstract atMost : int -> IParser<'t[]>\r\n    abstract atLeast : int -> IParser<'t[]>\r\n    [<Emit(\"$0.or($1)\")>]\r\n    abstract orTry : IParser<'t> -> IParser<'t>\r\n    abstract sepBy1 : IParser<'u> -> IParser<'t []>\r\n    [<Emit(\"$0.node($1)\")>]\r\n    abstract node : string -> IParser<NodeResult<'t>>\r\n\r\nmodule Parsimmon =\r\n    let parseRaw (input: string) (parser: IParser<'t>) =\r\n        parser.parse input\r\n\r\n    let parse (input: string) (parser: IParser<'t>) =\r\n        parser.parse input\r\n        |> fun result ->\r\n            match result.status with\r\n            | true -> Some result.value\r\n            | false -> None\r\n\r\n    /// A parser that consumes no input and yields an object an object representing the current offset into the parse: it has a 0-based character offset property and 1-based line and column properties\r\n    let index : IParser<IParserOffSet> =\r\n        import \"index\" \"./Parsimmon.js\"\r\n\r\n    /// Returns a new parser which tries parser, and if it fails uses otherParser. Example:\r\n    let orTry (otherParser: IParser<'t>) (parser: IParser<'t>) : IParser<'t> =\r\n        parser.orTry(otherParser)\r\n\r\n    /// Returns a new parser that tries to parse the input exactly `n` times\r\n    let times<'t> (n: int) (parser : IParser<'t>) : IParser<'t[]> =\r\n        parser.times n\r\n\r\n    /// Expects parser at least n times. Yields an array of the results.\r\n    let atLeast (n: int) (parser: IParser<'t>) : IParser<'t[]> =\r\n        parser.atLeast n\r\n\r\n\r\n    /// Expects parser at most n times. Yields an array of the results.\r\n    let atMost (n: int) (parser: IParser<'t>) : IParser<'t[]> =\r\n        parser.atMost n\r\n\r\n    let skip (skipped: IParser<'u>) (keep: IParser<'t>) : IParser<'t> =\r\n        keep.skip skipped\r\n\r\n    let many (parser : IParser<'t>) : IParser<'t[]> =\r\n        parser.many()\r\n\r\n    /// Returns a parser that looks for a match to the regexp and yields the entire text matched. The regexp will always match starting at the current parse location.\r\n    [<Import(\"regexp\", \"./Parsimmon.js\"); Emit(\"$0(new RegExp($1))\")>]\r\n    let regex (pattern: string) : IParser<string> = jsNative\r\n    /// Returns a parser that looks for a match to the regexp and yields the entire text matched. The regexp will always match starting at the current parse location.\r\n    [<Import(\"regexp\", \"./Parsimmon.js\"); Emit(\"$0(new RegExp($1), $2)\")>]\r\n    let regexGroupNumber (pattern: string) (groupNumber: int): IParser<string> = jsNative\r\n    let ofLazy (f: unit -> IParser<'t>) : IParser<'t> =\r\n        import \"lazy\" \"./Parsimmon.js\"\r\n\r\n    /// This is the same as Parsimmon.sepBy, but matches the parser at least once.\r\n    let seperateByAtLeastOne (seperator : IParser<'u>) (parser: IParser<'t>) : IParser<'t[]> =\r\n        parser.sepBy1(seperator)\r\n\r\n    /// Expects parser \"after\" to follow parser \"before\", and yields the result of \"before\".\r\n    let chain  (after: IParser<'u>) (before: IParser<'t>) : IParser<'u> =\r\n        before.chain after\r\n\r\n    /// Returns a new parser which tries parser \"p\", and on success calls the function \"f\" with the result of the parse, which is expected to return another parser, which will be tried next. This allows you to dynamically decide how to continue the parse, which is impossible with the other combinators.\r\n    let bind (f: 't -> IParser<'u>) (p: IParser<'t>) : IParser<'u> =\r\n        p.bind f\r\n\r\n    /// A parser that consumes one letter\r\n    let letter : IParser<string> =\r\n        import \"letter\" \"./Parsimmon.js\"\r\n\r\n    /// Returns a parser that tries `parser` and succeeds if `parser` is able to parse between `min` and `max` times\r\n    let timesBetween (min: int) (max: int) (parser: IParser<'u>) =\r\n        parser.times(min, max)\r\n\r\n    /// A parser that consumes one or more letters\r\n    let letters : IParser<string[]> =\r\n        import \"letters\" \"./Parsimmon.js\"\r\n\r\n    /// A parser that expects to be at the end of the input (zero characters left).\r\n    let endOfFile : IParser<string> =\r\n        import \"eof\" \"./Parsimmon.js\"\r\n\r\n    /// Returns a parser that looks for anything but whatever \"p\" wants to parse, and does not consume it. Yields the same result as \"before\".\r\n    let notFollowedBy (p: IParser<'u>) (before: IParser<'t>) : IParser<'t> =\r\n        before.notFollowedBy p\r\n\r\n    /// Returns a parser that doesn't consume any input, and yields the given value\r\n    let succeed (value: 't) : IParser<'t> =\r\n        import \"succeed\" \"./Parsimmon.js\"\r\n\r\n    /// Parses using parser, but does not consume what it parses. Yields an empty string.\r\n    let lookahead (parser: IParser<'t>) : IParser<string> =\r\n        import \"lookahead\" \"./Parsimmon.js\"\r\n\r\n    // A parser that consumes one digit\r\n    let digit : IParser<string> =\r\n        import \"digit\" \"./Parsimmon.js\"\r\n\r\n    // A parser that consumes one or more digits\r\n    let digits : IParser<string[]> =\r\n        digit\r\n        |> many\r\n\r\n    /// Returns a new parser which tries \"parser\" and, if it fails, yields value without consuming any input.\r\n    let fallback (value: 't) (parser: IParser<'t>) : IParser<'t> =\r\n        parser.fallback value\r\n\r\n    let seperateBy (content: IParser<'u>) (others: IParser<'t>) : IParser<'t[]> =\r\n        others.sepBy(content)\r\n\r\n    let between (left: IParser<'t>) (right: IParser<'u>) (middle: IParser<'v>) =\r\n        left\r\n        |> chain middle\r\n        |> skip right\r\n\r\n    /// Transforms the parsed value of the given parser.\r\n    let map (f: 't -> 'u) (parser: IParser<'t>) = parser.map f\r\n\r\n    /// Alias of Parsimmon.concat\r\n    let tie (parser: IParser<string[]>) : IParser<string> =\r\n        map (String.concat \"\") parser\r\n\r\n    /// A parser that consumes and yields the next character of the input.\r\n    let any : IParser<string> =\r\n        import \"any\" \"./Parsimmon.js\"\r\n\r\n    /// Accepts any number of parsers, yielding the value of the first one that succeeds, backtracking in between.\r\n    let choose (ps: IParser<'t> list) : IParser<'t> =\r\n        List.reduce (fun acc parser -> acc.orTry(parser)) ps\r\n\r\n    /// A parser that consumes and yields the entire remainder of the input.\r\n    let all : IParser<string> =\r\n        import \"all\"  \"./Parsimmon.js\"\r\n\r\n    /// Returns a failing parser with the given message.\r\n    let fail (input: string) : IParser<string> =\r\n        import \"fail\" \"./Parsimmon.js\"\r\n\r\n    /// Returns a parser that yield a single character if it passes the predicate function.\r\n    let satisfy (f: string -> bool) : IParser<string> =\r\n        import \"test\" \"./Parsimmon.js\"\r\n\r\n    /// Returns a parser yield a string containing all the next characters that pass the predicate \"f\"\r\n    let takeWhile (f: string -> bool) : IParser<string> =\r\n        import \"takeWhile\" \"./Parsimmon.js\"\r\n\r\n    /// Returns a parser that can only parse the exact given input string\r\n    let str (input: string) : IParser<string> =\r\n        import \"string\" \"./Parsimmon.js\"\r\n\r\n    /// Returns a parser that parses any of the characters of the input string\r\n    let oneOf (input: string) : IParser<string> =\r\n        import \"oneOf\" \"./Parsimmon.js\"\r\n\r\n    let whitespace : IParser<string> =\r\n        import \"whitespace\" \"./Parsimmon.js\"\r\n\r\n    let optionalWhitespace : IParser<string> =\r\n        import \"optWhitespace\" \"./Parsimmon.js\"\r\n\r\n    /// Returns a parser that succeeds one or more times\r\n    let atLeastOneOrMany (parser: IParser<'t>) : IParser<'t[]> =\r\n        atLeast 1 parser\r\n\r\n    let stringReturn (input: string) (value: 't) : IParser<'t> =\r\n        str input\r\n        |> map (fun _ -> value)\r\n\r\n    /// Returns a parser that parses comsumes any character of a string other than the characters of the input string\r\n    let noneOf (input: string) : IParser<string> =\r\n        import \"noneOf\" \"./Parsimmon.js\"\r\n\r\n    let seq2 (p1: IParser<'t>) (p2:IParser<'u>) :  IParser<'t * 'u> =\r\n        import \"seq\" \"./Parsimmon.js\"\r\n\r\n    let trim (trimmed: IParser<'a>) (p: IParser<'t>) : IParser<'t> =\r\n        p.trim trimmed\r\n\r\n    /// Equivalent to `parser.map (String.concat \"\")`\r\n    let concat (parser: IParser<string[]>) : IParser<string> =\r\n        parser.map (String.concat \"\")\r\n\r\n    let seq3 (p1: IParser<'t>)\r\n             (p2: IParser<'u>)\r\n             (p3:IParser<'v>) :  IParser<'t * 'u * 'v> =\r\n        import \"seq\" \"./Parsimmon.js\"\r\n\r\n    let seq4 (p1: IParser<'t>)\r\n             (p2: IParser<'u>)\r\n             (p3:IParser<'v>)\r\n             (p4:IParser<'w>) :  IParser<'t * 'u * 'v * 'w> =\r\n        import \"seq\" \"./Parsimmon.js\"\r\n\r\n    let seq5 (p1: IParser<'t>)\r\n             (p2: IParser<'u>)\r\n             (p3: IParser<'v>)\r\n             (p4: IParser<'w>)\r\n             (p5: IParser<'q>) : IParser<'t * 'u * 'v * 'w * 'q> =\r\n        import \"seq\" \"./Parsimmon.js\"\r\n\r\n    /// Equivalent to `parser.node(\"description\")`\r\n    let node<'t> description (p:IParser<'t>) = p.node(description)","namespace Fable.SimpleJson\r\n\r\nopen Fable.Parsimmon\r\n\r\n#nowarn \"40\"\r\n\r\nmodule Parser =\r\n\r\n    let digits = \r\n        Parsimmon.digit \r\n        |> Parsimmon.atLeastOneOrMany\r\n        |> Parsimmon.concat\r\n\r\n    let jint = digits |> Parsimmon.map float\r\n\r\n    let negJint = \r\n        Parsimmon.seq2 (Parsimmon.str \"-\") jint \r\n        |> Parsimmon.map (fun (sign, number) -> -number)\r\n\r\n    let jfloat = \r\n\r\n        let digits = \r\n            Parsimmon.digit \r\n            |> Parsimmon.many\r\n            |> Parsimmon.concat\r\n\r\n        let dot = Parsimmon.str \".\"\r\n\r\n        let decimals = \r\n            Parsimmon.digit\r\n            |> Parsimmon.atLeastOneOrMany\r\n            |> Parsimmon.concat\r\n\r\n        Parsimmon.seq3 digits dot decimals\r\n        |> Parsimmon.map (fun (digitsLeft,dot,digitsRight) -> \r\n            match digitsLeft with\r\n            | \"\" -> \"0\"\r\n            | other -> other \r\n            |> fun digitsLeft ->\r\n                [digitsLeft; dot; digitsRight]\r\n                |> String.concat \"\" \r\n                |> float\r\n        )\r\n\r\n    let negativeJFloat = \r\n        Parsimmon.seq2 (Parsimmon.str \"-\") jfloat \r\n        |> Parsimmon.map (fun (sign, number) -> -number)\r\n\r\n    let jnumber = \r\n        [jfloat; negativeJFloat; jint; negJint] \r\n        |> Parsimmon.choose\r\n        |> Parsimmon.map JNumber\r\n\r\n    let jbool = \r\n        [ Parsimmon.stringReturn \"true\" (JBool true)\r\n          Parsimmon.stringReturn \"false\" (JBool false)]\r\n        |> Parsimmon.choose\r\n\r\n    let jnull = Parsimmon.stringReturn \"null\" JNull\r\n\r\n    let stringLiteral =\r\n        let escape =  \r\n            Parsimmon.oneOf \"\\\"\\\\/bfnrt\"\r\n            |> Parsimmon.map(function\r\n                | \"b\" -> \"\\b\"\r\n                | \"f\" -> \"\\u000C\"\r\n                | \"n\" -> \"\\n\"\r\n                | \"r\" -> \"\\r\"\r\n                | \"t\" -> \"\\t\"\r\n                | c   -> c) // every other char is mapped to itself\r\n\r\n        let escapedCharSnippet = \r\n            Parsimmon.seq2 (Parsimmon.str \"\\\\\") escape\r\n            |> Parsimmon.map snd\r\n\r\n        let normalCharSnippet = Parsimmon.satisfy (fun c -> c <> \"\\\"\" && c <> \"\\\\\")\r\n\r\n        let anyCharSnippet = \r\n            normalCharSnippet\r\n            |> Parsimmon.orTry escapedCharSnippet\r\n            |> Parsimmon.many\r\n            |> Parsimmon.concat\r\n\r\n        anyCharSnippet\r\n        |> Parsimmon.between (Parsimmon.str \"\\\"\") (Parsimmon.str \"\\\"\")\r\n        \r\n    let jstring = stringLiteral.map JString\r\n\r\n    let withWhitespace p = \r\n        Parsimmon.between (Parsimmon.optionalWhitespace) (Parsimmon.optionalWhitespace) p\r\n        \r\n    let jvalue = \r\n        [ jnull; jbool; jnumber; jstring ]\r\n        |> List.map withWhitespace\r\n        |> Parsimmon.choose\r\n    \r\n    let comma = withWhitespace (Parsimmon.str \",\")\r\n \r\n    let rec json = Parsimmon.ofLazy <| fun () ->\r\n        \r\n        let leftBracket = withWhitespace (Parsimmon.str \"[\")\r\n        let rightBracket = withWhitespace (Parsimmon.str \"]\")\r\n                    \r\n        let arrayValue = Parsimmon.seperateBy comma json\r\n        \r\n        let jarray = \r\n            arrayValue\r\n            |> Parsimmon.between leftBracket rightBracket\r\n            |> Parsimmon.map (List.ofArray >> JArray)\r\n\r\n        let leftBrace = withWhitespace (Parsimmon.str \"{\")\r\n        let rightBrace = withWhitespace (Parsimmon.str \"}\")\r\n            \r\n        let keyValues = \r\n            Parsimmon.seq3 \r\n                (withWhitespace stringLiteral)\r\n                (withWhitespace (Parsimmon.str \":\"))\r\n                (withWhitespace json)\r\n            |> Parsimmon.map (fun (key, _ , value) -> key,value)\r\n            |> Parsimmon.seperateBy comma\r\n\r\n        let jobject = \r\n            keyValues\r\n            |> Parsimmon.between leftBrace rightBrace\r\n            |> Parsimmon.map (List.ofArray >> Map.ofList >> JObject)\r\n\r\n        [jvalue; jarray; jobject]\r\n        |> Parsimmon.choose\r\n        \r\n    let jsonParser = withWhitespace json\r\n","namespace Fable.SimpleJson\r\n\r\nopen Fable.Core\r\nopen Fable.Parsimmon\r\nopen Parser\r\nopen Fable.Import\r\nopen System\r\nopen Fable.Core.JsInterop\r\n\r\n[<AutoOpen>]\r\nmodule InteropUtil =\r\n    [<Emit(\"Array.from($0)\")>]\r\n    let arrayFrom (xs: obj) : obj = jsNative\r\n    [<Emit(\"$1[$0]\")>]\r\n    let get<'a> (key: string) (x: obj) : 'a = jsNative\r\n    [<Emit(\"$0 instanceof Date\")>]\r\n    let isDate (x: obj) = jsNative\r\n    [<Emit(\"$0 in $1\")>]\r\n    let hasKey (key: string) (x: 'a) = jsNative\r\n    let isDateOffset (x: obj) = isDate x && hasKey \"offset\" x\r\n    [<Emit(\"typeof $0\")>]\r\n    let getTypeOf (x: obj) : string = jsNative\r\n    let isObjectLiteral (x: obj) = getTypeOf x = \"object\"\r\n    let isBigInt (x: obj) =\r\n        not (isNull x)\r\n        && isObjectLiteral x\r\n        && hasKey \"signInt\" x\r\n        && hasKey \"v\" x\r\n        && hasKey \"digits\" (get \"v\" x)\r\n        && hasKey \"bound\" (get \"v\" x)\r\n\r\n    [<Emit(\"console.log($0)\")>]\r\n    let log (x: 'a) : unit = jsNative\r\n\r\n    [<Emit \"({})\">]\r\n    let createEmptyObject() : obj = jsNative\r\n\r\nmodule SimpleJson =\r\n    /// Tries to parse a string into a Json structured JSON data.\r\n    let tryParse (input: string) : Option<Json> =\r\n        Parsimmon.parse input jsonParser\r\n\r\n    /// Parses the input string into a structured JSON data. Fails with an exception if parsing fails.\r\n    let parse (input: string) : Json =\r\n        match tryParse input with\r\n        | Some result -> result\r\n        | None -> failwithf \"Could not parse the JSON input: %s\" input\r\n\r\n    /// Stringifies a Json object back to string representation\r\n    let rec toString = function\r\n        | JNull -> \"null\"\r\n        | JBool true -> \"true\"\r\n        | JBool false -> \"false\"\r\n        | JNumber number -> string number\r\n        | JString text -> sprintf \"\\\"%s\\\"\" text\r\n        | JArray elements ->\r\n            elements\r\n            |> List.map toString\r\n            |> String.concat \",\"\r\n            |> sprintf \"[%s]\"\r\n        | JObject map ->\r\n            map\r\n            |> Map.toList\r\n            |> List.map (fun (key,value) -> sprintf \"\\\"%s\\\":%s\" key (toString value))\r\n            |> String.concat \",\"\r\n            |> sprintf \"{%s}\"\r\n\r\n    [<Emit \"$2[$0] = $1\">]\r\n    let private setValue (key: string) (value: obj) (destination: obj) = jsNative\r\n    let rec toPlainObject (input: Json) : obj =\r\n        match input with\r\n        | JNull -> unbox null\r\n        | JBool value -> unbox value\r\n        | JNumber value -> unbox value\r\n        | JString value -> unbox value\r\n        | JArray values ->\r\n            let array = new ResizeArray<obj>()\r\n            for value in values do array.Add(toPlainObject value)\r\n            unbox array\r\n        | JObject map ->\r\n            let jsObject = createEmptyObject()\r\n            for (key, value) in Map.toList map do\r\n                setValue key (toPlainObject value) jsObject\r\n            unbox jsObject\r\n\r\n    let stringify (value: 'a) : string =\r\n        if isNullOrUndefined value\r\n        then JS.JSON.stringify(null)\r\n        else JS.JSON.stringify(value, (fun key jsonValue ->\r\n            if isBigInt jsonValue then\r\n                let bigInt : bigint = unbox(jsonValue)\r\n                box (string (decimal bigInt))\r\n            elif isDate jsonValue then\r\n                let dateOffset : DateTimeOffset = unbox(jsonValue)\r\n                box (dateOffset.ToString(\"o\"))\r\n            else\r\n            match jsonValue with\r\n            | :? string -> jsonValue\r\n            | :? System.Collections.IEnumerable ->\r\n                if JS.Constructors.Array.isArray(jsonValue) then jsonValue\r\n                else arrayFrom jsonValue\r\n            | _ when isBigInt jsonValue -> box (string (decimal (unbox<bigint> jsonValue)))\r\n            | _ when isDateOffset jsonValue -> box ((unbox<DateTimeOffset> jsonValue).ToString(\"O\"))\r\n            | _ -> jsonValue\r\n        ), 0)\r\n\r\n    let rec internal parseNative' (x: obj) =\r\n        match x with\r\n        | TypeCheck.NativeString str -> JString str\r\n        | TypeCheck.NativeNumber number -> JNumber number\r\n        | TypeCheck.NativeBool value -> JBool value\r\n        | TypeCheck.Null _ -> JNull\r\n        | TypeCheck.NativeArray arr -> JArray (List.ofArray (Array.map parseNative' arr))\r\n        | TypeCheck.NativeObject object ->\r\n            [ for key in JS.Constructors.Object.keys object -> key, parseNative' (get<obj> key object)  ]\r\n            |> Map.ofList\r\n            |> JObject\r\n        | _ -> JNull\r\n\r\n    /// Parses and converts the input string to Json using Javascript's native parsing capabilities\r\n    let parseNative (input: string) =\r\n        let parsed = JS.JSON.parse input\r\n        parseNative' parsed\r\n\r\n    let tryParseNative (input: string) =\r\n        try Some (parseNative input)\r\n        with | ex -> None\r\n\r\n    /// Tries to convert an object literal to the Json by calling JSON.stringify on the object first\r\n    let fromObjectLiteral (x: 'a) =\r\n        try Some (parseNative' x)\r\n        with | _ -> None\r\n\r\n    /// Transforms all keys of the objects within the Json structure\r\n    let rec mapKeys f = function\r\n        | JObject dictionary ->\r\n            dictionary\r\n            |> Map.toList\r\n            |> List.map (fun (key, value) -> f key, mapKeys f value)\r\n            |> Map.ofList\r\n            |> JObject\r\n        | JArray values ->\r\n            values\r\n            |> List.map (mapKeys f)\r\n            |> JArray\r\n        | otherJsonValue -> otherJsonValue\r\n\r\n    /// Transforms object values recursively using function `f` that takes the key and value of the object and returns a new value\r\n    let rec mapbyKey f = function\r\n        | JObject dictionary ->\r\n            dictionary\r\n            |> Map.toList\r\n            |> List.map (fun (key, value) -> key, f key value)\r\n            |> Map.ofList\r\n            |> JObject\r\n        | JArray values ->\r\n            values\r\n            |> List.map (mapbyKey f)\r\n            |> JArray\r\n        | otherJsonValue -> otherJsonValue\r\n\r\n    /// Transforms keys of object selectively by path segments\r\n    let mapKeysByPath f json =\r\n        let rec mapKey xs = function\r\n            | JObject dictionary ->\r\n                dictionary\r\n                |> Map.toList\r\n                |> List.map (fun (key, value) ->\r\n                    let keyPath = List.concat [xs; [key]]\r\n                    match f keyPath with\r\n                    | Some nextKey -> nextKey, mapKey keyPath value\r\n                    | None -> key, mapKey keyPath value)\r\n                |> Map.ofList\r\n                |> JObject\r\n            | JArray values ->\r\n                values\r\n                |> List.map (mapKey xs)\r\n                |> JArray\r\n            | otherJsonValue -> otherJsonValue\r\n        mapKey [] json\r\n\r\n    let rec readPath (keys: string list) (input: Json) =\r\n        match keys, input with\r\n        | [ ], _ -> None\r\n        | [ key ], JObject dict -> Map.tryFind key dict\r\n        | firstKey :: rest, JObject dict ->\r\n            match Map.tryFind firstKey dict with\r\n            | Some (JObject nextDict) -> readPath rest (JObject nextDict)\r\n            | _ -> None\r\n        | _ -> None","namespace Fable.SimpleJson\r\n\r\nopen Fable.Core\r\nopen Fable.Core.JsInterop\r\n\r\nmodule TypeCheck =\r\n\r\n    [<Emit(\"typeof ($0) === 'string'\")>]\r\n    let typeofString (x: obj) : bool = jsNative\r\n\r\n    [<Emit(\"typeof ($0) === 'boolean'\")>]\r\n    let typeofBool (x: obj) : bool = jsNative\r\n\r\n    [<Emit(\"typeof ($0) === 'number'\")>]\r\n    let typeofNumber (x: obj) : bool = jsNative\r\n    [<Emit(\"typeof ($0) === 'object'\")>]\r\n    let typeofObject (x: obj) : bool = jsNative\r\n\r\n    let (|NativeString|_|) (x: obj) =\r\n        if typeofString x\r\n        then Some (unbox<string> x)\r\n        else None\r\n\r\n    let (|NativeBool|_|) (x: obj) =\r\n        if typeofBool x\r\n        then Some (unbox<bool> x)\r\n        else None\r\n\r\n    let (|NativeNumber|_|) (x: obj) =\r\n        if typeofNumber x\r\n        then Some (unbox<float> x)\r\n        else None\r\n\r\n    let (|NativeObject|_|) (x: obj) =\r\n        if typeofObject x\r\n        then Some x\r\n        else None\r\n\r\n    let (|Null|_|) (x: obj) =\r\n        if isNull x\r\n        then Some x\r\n        else None\r\n\r\n    let (|NativeArray|_|) (x: obj) =\r\n        if (JS.Constructors.Array.isArray x)\r\n        then Some (unbox<obj[]> x)\r\n        else None","import { fromBits, getHighBits, getHighBitsUnsigned, getLowBits, getLowBitsUnsigned } from \"./Long.js\";\nconst littleEndian = true;\nexport function isLittleEndian() {\n    return littleEndian;\n}\nexport function getBytesBoolean(value) {\n    const bytes = new Uint8Array(1);\n    const view = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);\n    view.setUint8(0, value ? 1 : 0);\n    return bytes;\n}\nexport function getBytesChar(value) {\n    const bytes = new Uint8Array(2);\n    const view = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);\n    view.setUint16(0, value.charCodeAt(0), littleEndian);\n    return bytes;\n}\nexport function getBytesInt16(value) {\n    const bytes = new Uint8Array(2);\n    const view = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);\n    view.setInt16(0, value, littleEndian);\n    return bytes;\n}\nexport function getBytesInt32(value) {\n    const bytes = new Uint8Array(4);\n    const view = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);\n    view.setInt32(0, value, littleEndian);\n    return bytes;\n}\nexport function getBytesInt64(value) {\n    const bytes = new Uint8Array(8);\n    const view = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);\n    view.setInt32(littleEndian ? 0 : 4, getLowBits(value), littleEndian);\n    view.setInt32(littleEndian ? 4 : 0, getHighBits(value), littleEndian);\n    return bytes;\n}\nexport function getBytesUInt16(value) {\n    const bytes = new Uint8Array(2);\n    const view = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);\n    view.setUint16(0, value, littleEndian);\n    return bytes;\n}\nexport function getBytesUInt32(value) {\n    const bytes = new Uint8Array(4);\n    const view = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);\n    view.setUint32(0, value, littleEndian);\n    return bytes;\n}\nexport function getBytesUInt64(value) {\n    const bytes = new Uint8Array(8);\n    const view = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);\n    view.setUint32(littleEndian ? 0 : 4, getLowBitsUnsigned(value), littleEndian);\n    view.setUint32(littleEndian ? 4 : 0, getHighBitsUnsigned(value), littleEndian);\n    return bytes;\n}\nexport function getBytesSingle(value) {\n    const bytes = new Uint8Array(4);\n    const view = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);\n    view.setFloat32(0, value, littleEndian);\n    return bytes;\n}\nexport function getBytesDouble(value) {\n    const bytes = new Uint8Array(8);\n    const view = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);\n    view.setFloat64(0, value, littleEndian);\n    return bytes;\n}\nexport function int64BitsToDouble(value) {\n    const buffer = new ArrayBuffer(8);\n    const view = new DataView(buffer);\n    view.setInt32(littleEndian ? 0 : 4, getLowBits(value), littleEndian);\n    view.setInt32(littleEndian ? 4 : 0, getHighBits(value), littleEndian);\n    return view.getFloat64(0, littleEndian);\n}\nexport function doubleToInt64Bits(value) {\n    const buffer = new ArrayBuffer(8);\n    const view = new DataView(buffer);\n    view.setFloat64(0, value, littleEndian);\n    const lowBits = view.getInt32(littleEndian ? 0 : 4, littleEndian);\n    const highBits = view.getInt32(littleEndian ? 4 : 0, littleEndian);\n    return fromBits(lowBits, highBits, false);\n}\nexport function toBoolean(bytes, offset) {\n    const array = ArrayBuffer.isView(bytes) ? bytes : Uint8Array.from(bytes);\n    const view = new DataView(array.buffer, array.byteOffset, array.byteLength);\n    return view.getUint8(offset) === 1 ? true : false;\n}\nexport function toChar(bytes, offset) {\n    const array = ArrayBuffer.isView(bytes) ? bytes : Uint8Array.from(bytes);\n    const view = new DataView(array.buffer, array.byteOffset, array.byteLength);\n    const code = view.getUint16(offset, littleEndian);\n    return String.fromCharCode(code);\n}\nexport function toInt16(bytes, offset) {\n    const array = ArrayBuffer.isView(bytes) ? bytes : Uint8Array.from(bytes);\n    const view = new DataView(array.buffer, array.byteOffset, array.byteLength);\n    return view.getInt16(offset, littleEndian);\n}\nexport function toInt32(bytes, offset) {\n    const array = ArrayBuffer.isView(bytes) ? bytes : Uint8Array.from(bytes);\n    const view = new DataView(array.buffer, array.byteOffset, array.byteLength);\n    return view.getInt32(offset, littleEndian);\n}\nexport function toInt64(bytes, offset) {\n    const array = ArrayBuffer.isView(bytes) ? bytes : Uint8Array.from(bytes);\n    const view = new DataView(array.buffer, array.byteOffset, array.byteLength);\n    const lowBits = view.getInt32(offset + (littleEndian ? 0 : 4), littleEndian);\n    const highBits = view.getInt32(offset + (littleEndian ? 4 : 0), littleEndian);\n    return fromBits(lowBits, highBits, false);\n}\nexport function toUInt16(bytes, offset) {\n    const array = ArrayBuffer.isView(bytes) ? bytes : Uint8Array.from(bytes);\n    const view = new DataView(array.buffer, array.byteOffset, array.byteLength);\n    return view.getUint16(offset, littleEndian);\n}\nexport function toUInt32(bytes, offset) {\n    const array = ArrayBuffer.isView(bytes) ? bytes : Uint8Array.from(bytes);\n    const view = new DataView(array.buffer, array.byteOffset, array.byteLength);\n    return view.getUint32(offset, littleEndian);\n}\nexport function toUInt64(bytes, offset) {\n    const array = ArrayBuffer.isView(bytes) ? bytes : Uint8Array.from(bytes);\n    const view = new DataView(array.buffer, array.byteOffset, array.byteLength);\n    const lowBits = view.getUint32(offset + (littleEndian ? 0 : 4), littleEndian);\n    const highBits = view.getUint32(offset + (littleEndian ? 4 : 0), littleEndian);\n    return fromBits(lowBits, highBits, true);\n}\nexport function toSingle(bytes, offset) {\n    const array = ArrayBuffer.isView(bytes) ? bytes : Uint8Array.from(bytes);\n    const view = new DataView(array.buffer, array.byteOffset, array.byteLength);\n    return view.getFloat32(offset, littleEndian);\n}\nexport function toDouble(bytes, offset) {\n    const array = ArrayBuffer.isView(bytes) ? bytes : Uint8Array.from(bytes);\n    const view = new DataView(array.buffer, array.byteOffset, array.byteLength);\n    return view.getFloat64(offset, littleEndian);\n}\nexport function toString(bytes, offset, count) {\n    const array = ArrayBuffer.isView(bytes) ? bytes : Uint8Array.from(bytes);\n    let buffer = new Uint8Array(array.buffer, array.byteOffset, array.byteLength);\n    if (offset != null && count != null) {\n        buffer = buffer.subarray(offset, offset + count);\n    }\n    else if (offset != null) {\n        buffer = buffer.subarray(offset);\n    }\n    return Array.from(buffer).map((b) => (\"0\" + b.toString(16)).slice(-2)).join(\"-\");\n}\n","namespace Fable.SimpleJson\r\n\r\nopen System\r\nopen FSharp.Reflection\r\nopen Fable.Core\r\nopen System.Reflection\r\nopen System.Collections.Generic\r\n\r\n[<AutoOpen>]\r\nmodule Converter =\r\n    let (|PrimitiveType|_|) (primType: Type) =\r\n        match primType.FullName with\r\n        | \"System.String\" -> Some TypeInfo.String\r\n        | \"System.Char\" -> Some TypeInfo.Char\r\n        | \"System.Int16\" -> Some TypeInfo.Short\r\n        | \"System.Int32\" -> Some TypeInfo.Int32\r\n        | \"Microsoft.FSharp.Core.int64`1\"\r\n        | \"System.Int64\" -> Some TypeInfo.Long\r\n        | \"System.UInt16\" -> Some TypeInfo.UInt16\r\n        | \"System.UInt32\" -> Some TypeInfo.UInt32\r\n        | \"System.UInt64\" -> Some TypeInfo.UInt64\r\n        | \"System.DateTime\" -> Some TypeInfo.DateTime\r\n        | \"System.TimeSpan\" -> Some TypeInfo.TimeSpan\r\n        | \"System.DateTimeOffset\" -> Some TypeInfo.DateTimeOffset\r\n        | \"System.Boolean\" -> Some  TypeInfo.Bool\r\n        | \"System.Single\" -> Some TypeInfo.Float32\r\n        | \"System.Double\" -> Some TypeInfo.Float\r\n        | \"Microsoft.FSharp.Core.decimal`1\"\r\n        | \"System.Decimal\" -> Some TypeInfo.Decimal\r\n        | \"System.Numerics.BigInteger\" -> Some TypeInfo.BigInt\r\n        | \"Microsoft.FSharp.Core.Unit\" -> Some TypeInfo.Unit\r\n        | \"System.Guid\" -> Some TypeInfo.Guid\r\n        | \"System.Byte\" -> Some TypeInfo.Byte\r\n        | \"System.SByte\" -> Some TypeInfo.SByte\r\n        | \"System.Object\" -> Some TypeInfo.Object\r\n        | _ -> None\r\n\r\n    let (|RecordType|_|) (t: Type) =\r\n        if FSharpType.IsRecord t\r\n        then\r\n            FSharpType.GetRecordFields t\r\n            |> Array.map (fun field -> field, field.Name, field.PropertyType)\r\n            |> Some\r\n        else None\r\n\r\n    let (|SetType|_|) (t: Type) =\r\n        if t.FullName.StartsWith \"Microsoft.FSharp.Collections.FSharpSet`1\"\r\n        then t.GetGenericArguments().[0] |> Some\r\n        else None\r\n\r\n    let (|Nullable|_|) (t: Type) =\r\n        if t.FullName.StartsWith \"System.Nullable`1\"\r\n        then t.GetGenericArguments().[0] |> Some\r\n        else None\r\n\r\n    let (|UnionType|_|) (t: Type) =\r\n        if FSharpType.IsUnion t\r\n        then\r\n            FSharpType.GetUnionCases t\r\n            |> Array.map (fun info ->\r\n                let caseName = info.Name\r\n                let caseTypes = info.GetFields() |> Array.map (fun prop -> prop.PropertyType)\r\n                caseName, info, caseTypes)\r\n            |> Some\r\n        else None\r\n\r\n    let (|MapType|_|) (t: Type) =\r\n        if (t.FullName.StartsWith \"Microsoft.FSharp.Collections.FSharpMap`2\")\r\n        then\r\n            let genArgs = t.GetGenericArguments()\r\n            Some (genArgs.[0], genArgs.[1])\r\n        else None\r\n\r\n    let (|ListType|_|) (t: Type) =\r\n        if (t.FullName.StartsWith \"Microsoft.FSharp.Collections.FSharpList`1\")\r\n        then t.GetGenericArguments().[0] |> Some\r\n        else None\r\n\r\n    let rec flattenFuncTypes (typeDef: Type) =\r\n        [| if FSharpType.IsFunction typeDef\r\n           then let (domain, range) = FSharpType.GetFunctionElements typeDef\r\n                yield! flattenFuncTypes domain\r\n                yield! flattenFuncTypes range\r\n           else yield typeDef |]\r\n\r\n    let (|FuncType|_|) (t: Type) =\r\n        if FSharpType.IsFunction t\r\n        then flattenFuncTypes t |> Some\r\n        else None\r\n\r\n    let (|ArrayType|_|) (t:Type) =\r\n        if t.IsArray\r\n        then t.GetElementType() |> Some\r\n        else None\r\n\r\n    let (|OptionType|_|) (t:Type) =\r\n        if (t.FullName.StartsWith \"Microsoft.FSharp.Core.FSharpOption`1\")\r\n        then t.GetGenericArguments().[0] |> Some\r\n        else None\r\n\r\n    let (|TupleType|_|) (t: Type) =\r\n        if FSharpType.IsTuple t\r\n        then FSharpType.GetTupleElements(t) |> Some\r\n        else None\r\n\r\n    let (|SeqType|_|) (t: Type) =\r\n        if t.FullName.StartsWith \"System.Collections.Generic.IEnumerable`1\"\r\n        then  t.GetGenericArguments().[0] |> Some\r\n        else None\r\n\r\n    let (|DictionaryType|_|) (t: Type) =\r\n        if t.FullName.StartsWith \"System.Collections.Generic.Dictionary\"\r\n        then\r\n          let genArgs = t.GetGenericArguments()\r\n          Some (genArgs.[0], genArgs.[1])\r\n        else\r\n          None\r\n\r\n    let (|ResizeArrayType|_|) (t: Type) =\r\n        if t.FullName.StartsWith \"System.Collections.Generic.List\"\r\n        then t.GetGenericArguments().[0] |> Some\r\n        else None\r\n\r\n    let (|HashSetType|_|) (t: Type) =\r\n        if t.FullName.StartsWith \"System.Collections.Generic.HashSet\"\r\n        then t.GetGenericArguments().[0] |> Some\r\n        else None\r\n\r\n    let (|AsyncType|_|) (t:Type) =\r\n        if t.FullName.StartsWith \"Microsoft.FSharp.Control.FSharpAsync`1\"\r\n        then  t.GetGenericArguments().[0] |> Some\r\n        else None\r\n\r\n    let (|PromiseType|_|) (t:Type) =\r\n        if t.FullName.StartsWith \"Fable.Core.JS.Promise`1\"\r\n        then t.GetGenericArguments().[0] |> Some\r\n        else None\r\n\r\n    let private lazyToDelayed (l:Lazy<_>) = fun () -> l.Value\r\n\r\n    let (|EnumType|_|) (t: Type) =\r\n        if t.IsEnum\r\n        then Enum.GetUnderlyingType(t) |> Some\r\n        else None\r\n\r\n    let rec private _createTypeInfo (resolvedType: Type) : Fable.SimpleJson.TypeInfo =\r\n        match resolvedType with\r\n        | PrimitiveType typeInfo -> typeInfo\r\n        | FuncType (types) -> TypeInfo.Func <| lazyToDelayed (lazy (Array.map createTypeInfo types))\r\n        | RecordType fields ->\r\n            let l = lazy (\r\n                let fields =\r\n                    [| for (field, fieldName, fieldType) in fields ->\r\n                        { PropertyInfo = field\r\n                          FieldName = fieldName;\r\n                          FieldType = createTypeInfo fieldType } |]\r\n                fields, resolvedType)\r\n            TypeInfo.Record (lazyToDelayed l)\r\n\r\n        | UnionType cases ->\r\n            let l = lazy (\r\n                [| for (caseName, caseInfo, caseTypes) in cases ->\r\n                    { CaseName = caseName;\r\n                      Info = caseInfo;\r\n                      CaseTypes = Array.map createTypeInfo caseTypes } |], resolvedType)\r\n            TypeInfo.Union (lazyToDelayed l)\r\n\r\n        | EnumType elemType -> TypeInfo.Enum (lazyToDelayed <| lazy (createTypeInfo elemType, resolvedType))\r\n        | ListType elemType -> TypeInfo.List (lazyToDelayed <| lazy (createTypeInfo elemType))\r\n        | ResizeArrayType elemType -> TypeInfo.ResizeArray (lazyToDelayed <| lazy (createTypeInfo elemType))\r\n        | HashSetType elemType -> TypeInfo.HashSet (lazyToDelayed <| lazy (createTypeInfo elemType))\r\n        | ArrayType elemType -> TypeInfo.Array (lazyToDelayed <| lazy (createTypeInfo elemType))\r\n        // Checking for tuples has to happen after checking for arrays\r\n        | TupleType types -> TypeInfo.Tuple (lazyToDelayed <| lazy (Array.map createTypeInfo types))\r\n        | OptionType elemType -> TypeInfo.Option (lazyToDelayed <| lazy (createTypeInfo elemType))\r\n        | Nullable elemType -> TypeInfo.Option (lazyToDelayed <| lazy (createTypeInfo elemType))\r\n        | SetType elemType -> TypeInfo.Set (lazyToDelayed <| lazy (createTypeInfo elemType))\r\n        | MapType (keyType, valueType) -> TypeInfo.Map (lazyToDelayed <| lazy (createTypeInfo keyType, createTypeInfo valueType))\r\n        | DictionaryType (keyType, valueType) -> TypeInfo.Dictionary (lazyToDelayed <| lazy (createTypeInfo keyType, createTypeInfo valueType, valueType))\r\n        | SeqType elemType -> TypeInfo.Seq (lazyToDelayed <| lazy (createTypeInfo elemType))\r\n        | AsyncType elemType -> TypeInfo.Async (lazyToDelayed <| lazy (createTypeInfo elemType))\r\n        | PromiseType elemType -> TypeInfo.Promise (lazyToDelayed <| lazy (createTypeInfo elemType))\r\n        | _ -> TypeInfo.Any (lazyToDelayed <| lazy (resolvedType))\r\n\r\n    and private typeInfoCache = Dictionary<Type,Fable.SimpleJson.TypeInfo>()\r\n\r\n    and createTypeInfo (resolvedType: Type) : Fable.SimpleJson.TypeInfo =\r\n        match typeInfoCache.TryGetValue resolvedType with\r\n        | true, ti -> ti\r\n        | false, _ ->\r\n            let ti = _createTypeInfo resolvedType\r\n            // see https://github.com/fable-compiler/Fable/issues/1871\r\n            // Type equality doesn't work for anonymous records - all anon records are considered equal.\r\n            // For anonymous records, the name is the empty string.\r\n            let notAnonymousRecord =\r\n                not (String.IsNullOrEmpty resolvedType.FullName)\r\n                && not (resolvedType.FullName.EndsWith(\"`1[]\"))\r\n                && not (resolvedType.FullName.EndsWith(\"`2[]\"))\r\n\r\n            if notAnonymousRecord then\r\n                typeInfoCache.[resolvedType] <- ti\r\n                ti\r\n            else\r\n                ti\r\n\r\n    type Fable.SimpleJson.TypeInfo with\r\n        static member inline createFrom<'t> () : Fable.SimpleJson.TypeInfo =\r\n            createTypeInfo typeof<'t>\r\n\r\n    /// returns whether a type is primitive\r\n    let isPrimitive = function\r\n        | TypeInfo.Unit\r\n        | TypeInfo.String\r\n        | TypeInfo.UInt16\r\n        | TypeInfo.UInt32\r\n        | TypeInfo.UInt64\r\n        | TypeInfo.Int32\r\n        | TypeInfo.Bool\r\n        | TypeInfo.Float32\r\n        | TypeInfo.Float\r\n        | TypeInfo.Decimal\r\n        | TypeInfo.Short\r\n        | TypeInfo.Long\r\n        | TypeInfo.Byte\r\n        | TypeInfo.DateTime\r\n        | TypeInfo.DateTimeOffset\r\n        | TypeInfo.BigInt\r\n        | TypeInfo.Guid\r\n        | TypeInfo.Option _ -> true\r\n        | otherwise -> false\r\n\r\n    /// returns whether the discrimiated union type is like a enum\r\n    let enumUnion = function\r\n        | TypeInfo.Union getCases ->\r\n            getCases()\r\n            |> fst\r\n            |> Array.forall (fun case -> Array.isEmpty case.CaseTypes)\r\n        | otherwise -> false\r\n","import { Record } from \"../Types.js\";\r\nimport { record_type, array_type, int32_type } from \"../Reflection.js\";\r\nimport { op_LeftShift, op_BitwiseAnd, op_Addition, compare, op_Subtraction, op_Division, equals, fromInteger, op_Multiply, op_Modulus, toInt, fromBits } from \"../Long.js\";\r\nimport { copy, initialize, map, fill } from \"../Array.js\";\r\nimport { toArray, empty, head, tail, isEmpty, cons } from \"../List.js\";\r\nimport { int32ToString } from \"../Util.js\";\r\nimport { isNullOrEmpty, join } from \"../String.js\";\r\n\r\nexport class BigNat extends Record {\r\n    constructor(bound, digits) {\r\n        super();\r\n        this.bound = (bound | 0);\r\n        this.digits = digits;\r\n    }\r\n}\r\n\r\nexport function BigNat$reflection() {\r\n    return record_type(\"BigInt.BigNat\", [], BigNat, () => [[\"bound\", int32_type], [\"digits\", array_type(int32_type)]]);\r\n}\r\n\r\nexport function BigNatModule_FFT_pow32(x_mut, n_mut) {\r\n    BigNatModule_FFT_pow32:\r\n    while (true) {\r\n        const x = x_mut, n = n_mut;\r\n        if (n === 0) {\r\n            return 1;\r\n        }\r\n        else if ((n % 2) === 0) {\r\n            x_mut = (x * x);\r\n            n_mut = (~(~(n / 2)));\r\n            continue BigNatModule_FFT_pow32;\r\n        }\r\n        else {\r\n            return (x * BigNatModule_FFT_pow32(x * x, ~(~(n / 2)))) | 0;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function BigNatModule_FFT_leastBounding2Power(b) {\r\n    const findBounding2Power = (b_1_mut, tp_mut, i_mut) => {\r\n        findBounding2Power:\r\n        while (true) {\r\n            const b_1 = b_1_mut, tp = tp_mut, i = i_mut;\r\n            if (b_1 <= tp) {\r\n                return [tp, i];\r\n            }\r\n            else {\r\n                b_1_mut = b_1;\r\n                tp_mut = (tp * 2);\r\n                i_mut = (i + 1);\r\n                continue findBounding2Power;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    return findBounding2Power(b, 1, 0);\r\n}\r\n\r\nexport const BigNatModule_FFT_p = fromBits(2013265921, 0, false);\r\n\r\nconst BigNatModule_FFT_patternInput$004075 = [27, 15, 31, 440564289];\r\n\r\nexport const BigNatModule_FFT_w = BigNatModule_FFT_patternInput$004075[3];\r\n\r\nexport const BigNatModule_FFT_m = BigNatModule_FFT_patternInput$004075[1];\r\n\r\nexport const BigNatModule_FFT_k = BigNatModule_FFT_patternInput$004075[0];\r\n\r\nexport const BigNatModule_FFT_g = BigNatModule_FFT_patternInput$004075[2];\r\n\r\nexport const BigNatModule_FFT_primeP = BigNatModule_FFT_p;\r\n\r\nexport const BigNatModule_FFT_maxBitsInsideFp = 30;\r\n\r\nexport const BigNatModule_FFT_Fp_p = 2013265921;\r\n\r\nexport const BigNatModule_FFT_Fp_p64 = fromBits(2013265921, 0, true);\r\n\r\nexport function BigNatModule_FFT_Fp_toInt(x) {\r\n    return ~(~x);\r\n}\r\n\r\nexport function BigNatModule_FFT_Fp_ofInt32(x) {\r\n    return x >>> 0;\r\n}\r\n\r\nexport const BigNatModule_FFT_Fp_mzero = 0;\r\n\r\nexport const BigNatModule_FFT_Fp_mone = 1;\r\n\r\nexport const BigNatModule_FFT_Fp_mtwo = 2;\r\n\r\nexport function BigNatModule_FFT_Fp_mpow(x_mut, n_mut) {\r\n    BigNatModule_FFT_Fp_mpow:\r\n    while (true) {\r\n        const x = x_mut, n = n_mut;\r\n        if (n === 0) {\r\n            return BigNatModule_FFT_Fp_mone;\r\n        }\r\n        else if ((n % 2) === 0) {\r\n            x_mut = (toInt(op_Modulus(op_Multiply(fromInteger(x, true, 6), fromInteger(x, true, 6)), BigNatModule_FFT_Fp_p64)) >>> 0);\r\n            n_mut = (~(~(n / 2)));\r\n            continue BigNatModule_FFT_Fp_mpow;\r\n        }\r\n        else {\r\n            const y_2 = BigNatModule_FFT_Fp_mpow(toInt(op_Modulus(op_Multiply(fromInteger(x, true, 6), fromInteger(x, true, 6)), BigNatModule_FFT_Fp_p64)) >>> 0, ~(~(n / 2)));\r\n            return toInt(op_Modulus(op_Multiply(fromInteger(x, true, 6), fromInteger(y_2, true, 6)), BigNatModule_FFT_Fp_p64)) >>> 0;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function BigNatModule_FFT_Fp_mpowL(x_mut, n_mut) {\r\n    BigNatModule_FFT_Fp_mpowL:\r\n    while (true) {\r\n        const x = x_mut, n = n_mut;\r\n        if (equals(n, fromBits(0, 0, false))) {\r\n            return BigNatModule_FFT_Fp_mone;\r\n        }\r\n        else if (equals(op_Modulus(n, fromBits(2, 0, false)), fromBits(0, 0, false))) {\r\n            x_mut = (toInt(op_Modulus(op_Multiply(fromInteger(x, true, 6), fromInteger(x, true, 6)), BigNatModule_FFT_Fp_p64)) >>> 0);\r\n            n_mut = op_Division(n, fromBits(2, 0, false));\r\n            continue BigNatModule_FFT_Fp_mpowL;\r\n        }\r\n        else {\r\n            const y_2 = BigNatModule_FFT_Fp_mpowL(toInt(op_Modulus(op_Multiply(fromInteger(x, true, 6), fromInteger(x, true, 6)), BigNatModule_FFT_Fp_p64)) >>> 0, op_Division(n, fromBits(2, 0, false)));\r\n            return toInt(op_Modulus(op_Multiply(fromInteger(x, true, 6), fromInteger(y_2, true, 6)), BigNatModule_FFT_Fp_p64)) >>> 0;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function BigNatModule_FFT_Fp_m2PowNthRoot(n) {\r\n    return BigNatModule_FFT_Fp_mpow(BigNatModule_FFT_w >>> 0, BigNatModule_FFT_pow32(2, BigNatModule_FFT_k - n));\r\n}\r\n\r\nexport function BigNatModule_FFT_Fp_minv(x) {\r\n    return BigNatModule_FFT_Fp_mpowL(x, op_Subtraction(BigNatModule_FFT_primeP, fromBits(2, 0, false)));\r\n}\r\n\r\nexport function BigNatModule_FFT_computeFFT(lambda, mu, n, w, u, res, offset) {\r\n    let x_1, x_3, y_5;\r\n    if (n === 1) {\r\n        res[offset] = u[mu];\r\n    }\r\n    else {\r\n        const halfN = (~(~(n / 2))) | 0;\r\n        const ww = toInt(op_Modulus(op_Multiply(fromInteger(w, true, 6), fromInteger(w, true, 6)), BigNatModule_FFT_Fp_p64)) >>> 0;\r\n        const offsetHalfN = (offset + halfN) | 0;\r\n        BigNatModule_FFT_computeFFT(lambda * 2, mu, halfN, ww, u, res, offset);\r\n        BigNatModule_FFT_computeFFT(lambda * 2, lambda + mu, halfN, ww, u, res, offsetHalfN);\r\n        let wj = BigNatModule_FFT_Fp_mone;\r\n        for (let j = 0; j <= (halfN - 1); j++) {\r\n            const even = res[offset + j];\r\n            const odd = res[offsetHalfN + j];\r\n            res[offset + j] = ((even + ((x_1 = wj, toInt(op_Modulus(op_Multiply(fromInteger(x_1, true, 6), fromInteger(odd, true, 6)), BigNatModule_FFT_Fp_p64)) >>> 0))) % BigNatModule_FFT_Fp_p);\r\n            res[offsetHalfN + j] = (((even + BigNatModule_FFT_Fp_p) - ((x_3 = wj, toInt(op_Modulus(op_Multiply(fromInteger(x_3, true, 6), fromInteger(odd, true, 6)), BigNatModule_FFT_Fp_p64)) >>> 0))) % BigNatModule_FFT_Fp_p);\r\n            wj = ((y_5 = wj, toInt(op_Modulus(op_Multiply(fromInteger(w, true, 6), fromInteger(y_5, true, 6)), BigNatModule_FFT_Fp_p64)) >>> 0));\r\n        }\r\n    }\r\n}\r\n\r\nexport function BigNatModule_FFT_computFftInPlace(n, w, u) {\r\n    const res = fill(new Uint32Array(n), 0, n, BigNatModule_FFT_Fp_mzero);\r\n    BigNatModule_FFT_computeFFT(1, 0, n, w, u, res, 0);\r\n    return res;\r\n}\r\n\r\nexport function BigNatModule_FFT_computeInverseFftInPlace(n, w, uT) {\r\n    const bigKInv = BigNatModule_FFT_Fp_minv(n >>> 0);\r\n    return map((y) => (toInt(op_Modulus(op_Multiply(fromInteger(bigKInv, true, 6), fromInteger(y, true, 6)), BigNatModule_FFT_Fp_p64)) >>> 0), BigNatModule_FFT_computFftInPlace(n, BigNatModule_FFT_Fp_minv(w), uT), Uint32Array);\r\n}\r\n\r\nexport const BigNatModule_FFT_maxTwoPower = 29;\r\n\r\nexport const BigNatModule_FFT_twoPowerTable = initialize(BigNatModule_FFT_maxTwoPower - 1, (i) => BigNatModule_FFT_pow32(2, i), Int32Array);\r\n\r\nexport function BigNatModule_FFT_computeFftPaddedPolynomialProduct(bigK, k, u, v) {\r\n    const w = BigNatModule_FFT_Fp_m2PowNthRoot(k);\r\n    const n = bigK | 0;\r\n    const uT = BigNatModule_FFT_computFftInPlace(n, w, u);\r\n    const vT = BigNatModule_FFT_computFftInPlace(n, w, v);\r\n    return BigNatModule_FFT_computeInverseFftInPlace(n, w, initialize(n, (i) => {\r\n        const x = uT[i];\r\n        const y = vT[i];\r\n        return toInt(op_Modulus(op_Multiply(fromInteger(x, true, 6), fromInteger(y, true, 6)), BigNatModule_FFT_Fp_p64)) >>> 0;\r\n    }, Uint32Array));\r\n}\r\n\r\nexport function BigNatModule_FFT_padTo(n, u) {\r\n    const uBound = u.length | 0;\r\n    return initialize(n, (i) => ((i < uBound) ? BigNatModule_FFT_Fp_ofInt32(u[i]) : BigNatModule_FFT_Fp_mzero), Uint32Array);\r\n}\r\n\r\nexport function BigNatModule_FFT_computeFftPolynomialProduct(degu, u, degv, v) {\r\n    const patternInput = BigNatModule_FFT_leastBounding2Power((degu + degv) + 1);\r\n    const bigK = patternInput[0] | 0;\r\n    const w = BigNatModule_FFT_Fp_m2PowNthRoot(patternInput[1]);\r\n    const u_1 = BigNatModule_FFT_padTo(bigK, u);\r\n    const v_1 = BigNatModule_FFT_padTo(bigK, v);\r\n    const n = bigK | 0;\r\n    const uT = BigNatModule_FFT_computFftInPlace(n, w, u_1);\r\n    const vT = BigNatModule_FFT_computFftInPlace(n, w, v_1);\r\n    return map((x_1) => BigNatModule_FFT_Fp_toInt(x_1), BigNatModule_FFT_computeInverseFftInPlace(n, w, initialize(n, (i) => {\r\n        const x = uT[i];\r\n        const y = vT[i];\r\n        return toInt(op_Modulus(op_Multiply(fromInteger(x, true, 6), fromInteger(y, true, 6)), BigNatModule_FFT_Fp_p64)) >>> 0;\r\n    }, Uint32Array)), Int32Array);\r\n}\r\n\r\nexport const BigNatModule_FFT_mzero = BigNatModule_FFT_Fp_mzero;\r\n\r\nexport const BigNatModule_FFT_mone = BigNatModule_FFT_Fp_mone;\r\n\r\nexport const BigNatModule_FFT_maxFp = ((BigNatModule_FFT_Fp_p + BigNatModule_FFT_Fp_p) - BigNatModule_FFT_mone) % BigNatModule_FFT_Fp_p;\r\n\r\nexport function BigNatModule_bound(n) {\r\n    return n.bound;\r\n}\r\n\r\nexport function BigNatModule_setBound(n, v) {\r\n    n.bound = (v | 0);\r\n}\r\n\r\nexport function BigNatModule_coeff(n, i) {\r\n    return n.digits[i];\r\n}\r\n\r\nexport function BigNatModule_coeff64(n, i) {\r\n    return fromInteger(BigNatModule_coeff(n, i), false, 2);\r\n}\r\n\r\nexport function BigNatModule_setCoeff(n, i, v) {\r\n    n.digits[i] = (v | 0);\r\n}\r\n\r\nexport function BigNatModule_pow64(x_mut, n_mut) {\r\n    BigNatModule_pow64:\r\n    while (true) {\r\n        const x = x_mut, n = n_mut;\r\n        if (n === 0) {\r\n            return fromBits(1, 0, false);\r\n        }\r\n        else if ((n % 2) === 0) {\r\n            x_mut = op_Multiply(x, x);\r\n            n_mut = (~(~(n / 2)));\r\n            continue BigNatModule_pow64;\r\n        }\r\n        else {\r\n            return op_Multiply(x, BigNatModule_pow64(op_Multiply(x, x), ~(~(n / 2))));\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function BigNatModule_pow32(x_mut, n_mut) {\r\n    BigNatModule_pow32:\r\n    while (true) {\r\n        const x = x_mut, n = n_mut;\r\n        if (n === 0) {\r\n            return 1;\r\n        }\r\n        else if ((n % 2) === 0) {\r\n            x_mut = (x * x);\r\n            n_mut = (~(~(n / 2)));\r\n            continue BigNatModule_pow32;\r\n        }\r\n        else {\r\n            return (x * BigNatModule_pow32(x * x, ~(~(n / 2)))) | 0;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function BigNatModule_hash(n) {\r\n    let res = 0;\r\n    for (let i = 0; i <= (n.bound - 1); i++) {\r\n        res = ((n.digits[i] + (res << 3)) | 0);\r\n    }\r\n    return res | 0;\r\n}\r\n\r\nexport function BigNatModule_maxInt(a, b) {\r\n    if (a < b) {\r\n        return b | 0;\r\n    }\r\n    else {\r\n        return a | 0;\r\n    }\r\n}\r\n\r\nexport function BigNatModule_minInt(a, b) {\r\n    if (a < b) {\r\n        return a | 0;\r\n    }\r\n    else {\r\n        return b | 0;\r\n    }\r\n}\r\n\r\nexport const BigNatModule_baseBits = 24;\r\n\r\nexport const BigNatModule_baseN = 16777216;\r\n\r\nexport const BigNatModule_baseMask = 16777215;\r\n\r\nexport const BigNatModule_baseNi64 = fromBits(16777216, 0, false);\r\n\r\nexport const BigNatModule_baseMaski64 = fromBits(16777215, 0, false);\r\n\r\nexport const BigNatModule_baseMaskU = fromBits(16777215, 0, true);\r\n\r\nexport const BigNatModule_baseMask32A = 16777215;\r\n\r\nexport const BigNatModule_baseMask32B = 255;\r\n\r\nexport const BigNatModule_baseShift32B = 24;\r\n\r\nexport const BigNatModule_baseMask64A = 16777215;\r\n\r\nexport const BigNatModule_baseMask64B = 16777215;\r\n\r\nexport const BigNatModule_baseMask64C = 65535;\r\n\r\nexport const BigNatModule_baseShift64B = 24;\r\n\r\nexport const BigNatModule_baseShift64C = 48;\r\n\r\nexport function BigNatModule_divbase(x) {\r\n    return ~(~((x >>> 0) >>> BigNatModule_baseBits));\r\n}\r\n\r\nexport function BigNatModule_modbase(x) {\r\n    return x & BigNatModule_baseMask;\r\n}\r\n\r\nexport function BigNatModule_createN(b) {\r\n    return new BigNat(b, new Int32Array(b));\r\n}\r\n\r\nexport function BigNatModule_copyN(x) {\r\n    return new BigNat(x.bound, copy(x.digits));\r\n}\r\n\r\nexport function BigNatModule_normN(n) {\r\n    const findLeastBound = (na_mut, i_mut) => {\r\n        findLeastBound:\r\n        while (true) {\r\n            const na = na_mut, i = i_mut;\r\n            if ((i === -1) ? true : (na[i] !== 0)) {\r\n                return (i + 1) | 0;\r\n            }\r\n            else {\r\n                na_mut = na;\r\n                i_mut = (i - 1);\r\n                continue findLeastBound;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    const bound = findLeastBound(n.digits, n.bound - 1) | 0;\r\n    n.bound = (bound | 0);\r\n    return n;\r\n}\r\n\r\nexport const BigNatModule_boundInt = 2;\r\n\r\nexport const BigNatModule_boundInt64 = 3;\r\n\r\nexport const BigNatModule_boundBase = 1;\r\n\r\nexport function BigNatModule_embed(x) {\r\n    const x_1 = ((x < 0) ? 0 : x) | 0;\r\n    if (x_1 < BigNatModule_baseN) {\r\n        const r = BigNatModule_createN(1);\r\n        r.digits[0] = (x_1 | 0);\r\n        return BigNatModule_normN(r);\r\n    }\r\n    else {\r\n        const r_1 = BigNatModule_createN(BigNatModule_boundInt);\r\n        for (let i = 0; i <= (BigNatModule_boundInt - 1); i++) {\r\n            r_1.digits[i] = (((~(~(x_1 / BigNatModule_pow32(BigNatModule_baseN, i)))) % BigNatModule_baseN) | 0);\r\n        }\r\n        return BigNatModule_normN(r_1);\r\n    }\r\n}\r\n\r\nexport function BigNatModule_embed64(x) {\r\n    const x_1 = (compare(x, fromBits(0, 0, false)) < 0) ? fromBits(0, 0, false) : x;\r\n    const r = BigNatModule_createN(BigNatModule_boundInt64);\r\n    for (let i = 0; i <= (BigNatModule_boundInt64 - 1); i++) {\r\n        r.digits[i] = ((~(~toInt(op_Modulus(op_Division(x_1, BigNatModule_pow64(BigNatModule_baseNi64, i)), BigNatModule_baseNi64)))) | 0);\r\n    }\r\n    return BigNatModule_normN(r);\r\n}\r\n\r\nexport function BigNatModule_eval32(n) {\r\n    if (n.bound === 1) {\r\n        return n.digits[0] | 0;\r\n    }\r\n    else {\r\n        let acc = 0;\r\n        for (let i = n.bound - 1; i >= 0; i--) {\r\n            acc = ((n.digits[i] + (BigNatModule_baseN * acc)) | 0);\r\n        }\r\n        return acc | 0;\r\n    }\r\n}\r\n\r\nexport function BigNatModule_eval64(n) {\r\n    if (n.bound === 1) {\r\n        return fromInteger(n.digits[0], false, 2);\r\n    }\r\n    else {\r\n        let acc = fromBits(0, 0, false);\r\n        for (let i = n.bound - 1; i >= 0; i--) {\r\n            acc = op_Addition(fromInteger(n.digits[i], false, 2), op_Multiply(BigNatModule_baseNi64, acc));\r\n        }\r\n        return acc;\r\n    }\r\n}\r\n\r\nexport const BigNatModule_one = BigNatModule_embed(1);\r\n\r\nexport const BigNatModule_zero = BigNatModule_embed(0);\r\n\r\nexport function BigNatModule_restrictTo(d, n) {\r\n    return new BigNat(BigNatModule_minInt(d, n.bound), n.digits);\r\n}\r\n\r\nexport function BigNatModule_shiftUp(d, n) {\r\n    const m = BigNatModule_createN(n.bound + d);\r\n    for (let i = 0; i <= (n.bound - 1); i++) {\r\n        m.digits[i + d] = (n.digits[i] | 0);\r\n    }\r\n    return m;\r\n}\r\n\r\nexport function BigNatModule_shiftDown(d, n) {\r\n    if ((n.bound - d) <= 0) {\r\n        return BigNatModule_zero;\r\n    }\r\n    else {\r\n        const m = BigNatModule_createN(n.bound - d);\r\n        for (let i = 0; i <= (m.bound - 1); i++) {\r\n            m.digits[i] = (n.digits[i + d] | 0);\r\n        }\r\n        return m;\r\n    }\r\n}\r\n\r\nexport function BigNatModule_degree(n) {\r\n    return n.bound - 1;\r\n}\r\n\r\nexport function BigNatModule_addP(i_mut, n_mut, c_mut, p_mut, q_mut, r_mut) {\r\n    let z, i_1, z_1, i_2;\r\n    BigNatModule_addP:\r\n    while (true) {\r\n        const i = i_mut, n = n_mut, c = c_mut, p = p_mut, q = q_mut, r = r_mut;\r\n        if (i < n) {\r\n            const x = ((((z = p, (i_1 = (i | 0), (i_1 < z.bound) ? z.digits[i_1] : 0))) + ((z_1 = q, (i_2 = (i | 0), (i_2 < z_1.bound) ? z_1.digits[i_2] : 0)))) + c) | 0;\r\n            r.digits[i] = (BigNatModule_modbase(x) | 0);\r\n            i_mut = (i + 1);\r\n            n_mut = n;\r\n            c_mut = BigNatModule_divbase(x);\r\n            p_mut = p;\r\n            q_mut = q;\r\n            r_mut = r;\r\n            continue BigNatModule_addP;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function BigNatModule_add(p, q) {\r\n    const rbound = (1 + BigNatModule_maxInt(p.bound, q.bound)) | 0;\r\n    const r = BigNatModule_createN(rbound);\r\n    BigNatModule_addP(0, rbound, 0, p, q, r);\r\n    return BigNatModule_normN(r);\r\n}\r\n\r\nexport function BigNatModule_subP(i_mut, n_mut, c_mut, p_mut, q_mut, r_mut) {\r\n    let z, i_1, z_1, i_2;\r\n    BigNatModule_subP:\r\n    while (true) {\r\n        const i = i_mut, n = n_mut, c = c_mut, p = p_mut, q = q_mut, r = r_mut;\r\n        if (i < n) {\r\n            const x = ((((z = p, (i_1 = (i | 0), (i_1 < z.bound) ? z.digits[i_1] : 0))) - ((z_1 = q, (i_2 = (i | 0), (i_2 < z_1.bound) ? z_1.digits[i_2] : 0)))) + c) | 0;\r\n            if (x > 0) {\r\n                r.digits[i] = (BigNatModule_modbase(x) | 0);\r\n                i_mut = (i + 1);\r\n                n_mut = n;\r\n                c_mut = BigNatModule_divbase(x);\r\n                p_mut = p;\r\n                q_mut = q;\r\n                r_mut = r;\r\n                continue BigNatModule_subP;\r\n            }\r\n            else {\r\n                const x_1 = (x + BigNatModule_baseN) | 0;\r\n                r.digits[i] = (BigNatModule_modbase(x_1) | 0);\r\n                i_mut = (i + 1);\r\n                n_mut = n;\r\n                c_mut = (BigNatModule_divbase(x_1) - 1);\r\n                p_mut = p;\r\n                q_mut = q;\r\n                r_mut = r;\r\n                continue BigNatModule_subP;\r\n            }\r\n        }\r\n        else {\r\n            return c !== 0;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function BigNatModule_sub(p, q) {\r\n    const rbound = BigNatModule_maxInt(p.bound, q.bound) | 0;\r\n    const r = BigNatModule_createN(rbound);\r\n    if (BigNatModule_subP(0, rbound, 0, p, q, r)) {\r\n        return BigNatModule_embed(0);\r\n    }\r\n    else {\r\n        return BigNatModule_normN(r);\r\n    }\r\n}\r\n\r\nexport function BigNatModule_isZero(p) {\r\n    return p.bound === 0;\r\n}\r\n\r\nexport function BigNatModule_IsZero(p) {\r\n    return BigNatModule_isZero(p);\r\n}\r\n\r\nexport function BigNatModule_isOne(p) {\r\n    if (p.bound === 1) {\r\n        return p.digits[0] === 1;\r\n    }\r\n    else {\r\n        return false;\r\n    }\r\n}\r\n\r\nexport function BigNatModule_equal(p, q) {\r\n    if (p.bound === q.bound) {\r\n        const check = (pa_mut, qa_mut, i_mut) => {\r\n            check:\r\n            while (true) {\r\n                const pa = pa_mut, qa = qa_mut, i = i_mut;\r\n                if (i === -1) {\r\n                    return true;\r\n                }\r\n                else if (pa[i] === qa[i]) {\r\n                    pa_mut = pa;\r\n                    qa_mut = qa;\r\n                    i_mut = (i - 1);\r\n                    continue check;\r\n                }\r\n                else {\r\n                    return false;\r\n                }\r\n                break;\r\n            }\r\n        };\r\n        return check(p.digits, q.digits, p.bound - 1);\r\n    }\r\n    else {\r\n        return false;\r\n    }\r\n}\r\n\r\nexport function BigNatModule_shiftCompare(p, pn, q, qn) {\r\n    if ((p.bound + pn) < (q.bound + qn)) {\r\n        return -1;\r\n    }\r\n    else if ((p.bound + pn) > (q.bound + pn)) {\r\n        return 1;\r\n    }\r\n    else {\r\n        const check = (pa_mut, qa_mut, i_mut) => {\r\n            check:\r\n            while (true) {\r\n                const pa = pa_mut, qa = qa_mut, i = i_mut;\r\n                if (i === -1) {\r\n                    return 0;\r\n                }\r\n                else {\r\n                    const pai = ((i < pn) ? 0 : pa[i - pn]) | 0;\r\n                    const qai = ((i < qn) ? 0 : qa[i - qn]) | 0;\r\n                    if (pai === qai) {\r\n                        pa_mut = pa;\r\n                        qa_mut = qa;\r\n                        i_mut = (i - 1);\r\n                        continue check;\r\n                    }\r\n                    else if (pai < qai) {\r\n                        return -1;\r\n                    }\r\n                    else {\r\n                        return 1;\r\n                    }\r\n                }\r\n                break;\r\n            }\r\n        };\r\n        return check(p.digits, q.digits, (p.bound + pn) - 1) | 0;\r\n    }\r\n}\r\n\r\nexport function BigNatModule_compare(p, q) {\r\n    if (p.bound < q.bound) {\r\n        return -1;\r\n    }\r\n    else if (p.bound > q.bound) {\r\n        return 1;\r\n    }\r\n    else {\r\n        const check = (pa_mut, qa_mut, i_mut) => {\r\n            check:\r\n            while (true) {\r\n                const pa = pa_mut, qa = qa_mut, i = i_mut;\r\n                if (i === -1) {\r\n                    return 0;\r\n                }\r\n                else if (pa[i] === qa[i]) {\r\n                    pa_mut = pa;\r\n                    qa_mut = qa;\r\n                    i_mut = (i - 1);\r\n                    continue check;\r\n                }\r\n                else if (pa[i] < qa[i]) {\r\n                    return -1;\r\n                }\r\n                else {\r\n                    return 1;\r\n                }\r\n                break;\r\n            }\r\n        };\r\n        return check(p.digits, q.digits, p.bound - 1) | 0;\r\n    }\r\n}\r\n\r\nexport function BigNatModule_lt(p, q) {\r\n    return BigNatModule_compare(p, q) === -1;\r\n}\r\n\r\nexport function BigNatModule_gt(p, q) {\r\n    return BigNatModule_compare(p, q) === 1;\r\n}\r\n\r\nexport function BigNatModule_lte(p, q) {\r\n    return BigNatModule_compare(p, q) !== 1;\r\n}\r\n\r\nexport function BigNatModule_gte(p, q) {\r\n    return BigNatModule_compare(p, q) !== -1;\r\n}\r\n\r\nexport function BigNatModule_min(a, b) {\r\n    if (BigNatModule_lt(a, b)) {\r\n        return a;\r\n    }\r\n    else {\r\n        return b;\r\n    }\r\n}\r\n\r\nexport function BigNatModule_max(a, b) {\r\n    if (BigNatModule_lt(a, b)) {\r\n        return b;\r\n    }\r\n    else {\r\n        return a;\r\n    }\r\n}\r\n\r\nexport function BigNatModule_contributeArr(a_mut, i_mut, c_mut) {\r\n    BigNatModule_contributeArr:\r\n    while (true) {\r\n        const a = a_mut, i = i_mut, c = c_mut;\r\n        const x = op_Addition(fromInteger(a[i], false, 2), c);\r\n        const c_1 = op_Division(x, BigNatModule_baseNi64);\r\n        const x_3 = (~(~toInt(op_BitwiseAnd(x, BigNatModule_baseMaski64)))) | 0;\r\n        a[i] = (x_3 | 0);\r\n        if (compare(c_1, fromBits(0, 0, false)) > 0) {\r\n            a_mut = a;\r\n            i_mut = (i + 1);\r\n            c_mut = c_1;\r\n            continue BigNatModule_contributeArr;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function BigNatModule_scale(k, p) {\r\n    const r = BigNatModule_createN(p.bound + BigNatModule_boundInt);\r\n    const k_1 = fromInteger(k, false, 2);\r\n    for (let i = 0; i <= (p.bound - 1); i++) {\r\n        BigNatModule_contributeArr(r.digits, i, op_Multiply(k_1, fromInteger(p.digits[i], false, 2)));\r\n    }\r\n    return BigNatModule_normN(r);\r\n}\r\n\r\nexport function BigNatModule_mulSchoolBookBothSmall(p, q) {\r\n    const r = BigNatModule_createN(2);\r\n    const rak = op_Multiply(fromInteger(p, false, 2), fromInteger(q, false, 2));\r\n    BigNatModule_setCoeff(r, 0, ~(~toInt(op_BitwiseAnd(rak, BigNatModule_baseMaski64))));\r\n    BigNatModule_setCoeff(r, 1, ~(~toInt(op_Division(rak, BigNatModule_baseNi64))));\r\n    return BigNatModule_normN(r);\r\n}\r\n\r\nexport function BigNatModule_mulSchoolBookCarry(r_mut, c_mut, k_mut) {\r\n    BigNatModule_mulSchoolBookCarry:\r\n    while (true) {\r\n        const r = r_mut, c = c_mut, k = k_mut;\r\n        if (compare(c, fromBits(0, 0, false)) > 0) {\r\n            const rak = op_Addition(BigNatModule_coeff64(r, k), c);\r\n            BigNatModule_setCoeff(r, k, ~(~toInt(op_BitwiseAnd(rak, BigNatModule_baseMaski64))));\r\n            r_mut = r;\r\n            c_mut = op_Division(rak, BigNatModule_baseNi64);\r\n            k_mut = (k + 1);\r\n            continue BigNatModule_mulSchoolBookCarry;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function BigNatModule_mulSchoolBookOneSmall(p, q) {\r\n    const bp = BigNatModule_bound(p) | 0;\r\n    const r = BigNatModule_createN(bp + 1);\r\n    const q_1 = fromInteger(q, false, 2);\r\n    let c = fromBits(0, 0, false);\r\n    for (let i = 0; i <= (bp - 1); i++) {\r\n        const rak = op_Addition(op_Addition(c, BigNatModule_coeff64(r, i)), op_Multiply(BigNatModule_coeff64(p, i), q_1));\r\n        BigNatModule_setCoeff(r, i, ~(~toInt(op_BitwiseAnd(rak, BigNatModule_baseMaski64))));\r\n        c = op_Division(rak, BigNatModule_baseNi64);\r\n    }\r\n    BigNatModule_mulSchoolBookCarry(r, c, bp);\r\n    return BigNatModule_normN(r);\r\n}\r\n\r\nexport function BigNatModule_mulSchoolBookNeitherSmall(p, q) {\r\n    const r = BigNatModule_createN(p.bound + q.bound);\r\n    const ra = r.digits;\r\n    for (let i = 0; i <= (p.bound - 1); i++) {\r\n        const pai = fromInteger(p.digits[i], false, 2);\r\n        let c = fromBits(0, 0, false);\r\n        let k = i;\r\n        for (let j = 0; j <= (q.bound - 1); j++) {\r\n            const qaj = fromInteger(q.digits[j], false, 2);\r\n            const rak = op_Addition(op_Addition(fromInteger(ra[k], false, 2), c), op_Multiply(pai, qaj));\r\n            ra[k] = ((~(~toInt(op_BitwiseAnd(rak, BigNatModule_baseMaski64)))) | 0);\r\n            c = op_Division(rak, BigNatModule_baseNi64);\r\n            k = ((k + 1) | 0);\r\n        }\r\n        BigNatModule_mulSchoolBookCarry(r, c, k);\r\n    }\r\n    return BigNatModule_normN(r);\r\n}\r\n\r\nexport function BigNatModule_mulSchoolBook(p, q) {\r\n    const pSmall = BigNatModule_bound(p) === 1;\r\n    const qSmall = BigNatModule_bound(q) === 1;\r\n    if (pSmall ? qSmall : false) {\r\n        return BigNatModule_mulSchoolBookBothSmall(BigNatModule_coeff(p, 0), BigNatModule_coeff(q, 0));\r\n    }\r\n    else if (pSmall) {\r\n        return BigNatModule_mulSchoolBookOneSmall(q, BigNatModule_coeff(p, 0));\r\n    }\r\n    else if (qSmall) {\r\n        return BigNatModule_mulSchoolBookOneSmall(p, BigNatModule_coeff(q, 0));\r\n    }\r\n    else {\r\n        return BigNatModule_mulSchoolBookNeitherSmall(p, q);\r\n    }\r\n}\r\n\r\nexport class BigNatModule_encoding extends Record {\r\n    constructor(bigL, twoToBigL, k, bigK, bigN, split, splits) {\r\n        super();\r\n        this.bigL = (bigL | 0);\r\n        this.twoToBigL = (twoToBigL | 0);\r\n        this.k = (k | 0);\r\n        this.bigK = (bigK | 0);\r\n        this.bigN = (bigN | 0);\r\n        this.split = (split | 0);\r\n        this.splits = splits;\r\n    }\r\n}\r\n\r\nexport function BigNatModule_encoding$reflection() {\r\n    return record_type(\"BigInt.BigNatModule.encoding\", [], BigNatModule_encoding, () => [[\"bigL\", int32_type], [\"twoToBigL\", int32_type], [\"k\", int32_type], [\"bigK\", int32_type], [\"bigN\", int32_type], [\"split\", int32_type], [\"splits\", array_type(int32_type)]]);\r\n}\r\n\r\nexport function BigNatModule_mkEncoding(bigL, k, bigK, bigN) {\r\n    return new BigNatModule_encoding(bigL, BigNatModule_pow32(2, bigL), k, bigK, bigN, ~(~(BigNatModule_baseBits / bigL)), initialize(~(~(BigNatModule_baseBits / bigL)), (i) => BigNatModule_pow32(2, bigL * i), Int32Array));\r\n}\r\n\r\nexport const BigNatModule_table = [BigNatModule_mkEncoding(1, 28, 268435456, 268435456), BigNatModule_mkEncoding(2, 26, 67108864, 134217728), BigNatModule_mkEncoding(3, 24, 16777216, 50331648), BigNatModule_mkEncoding(4, 22, 4194304, 16777216), BigNatModule_mkEncoding(5, 20, 1048576, 5242880), BigNatModule_mkEncoding(6, 18, 262144, 1572864), BigNatModule_mkEncoding(7, 16, 65536, 458752), BigNatModule_mkEncoding(8, 14, 16384, 131072), BigNatModule_mkEncoding(9, 12, 4096, 36864), BigNatModule_mkEncoding(10, 10, 1024, 10240), BigNatModule_mkEncoding(11, 8, 256, 2816), BigNatModule_mkEncoding(12, 6, 64, 768), BigNatModule_mkEncoding(13, 4, 16, 208)];\r\n\r\nexport function BigNatModule_calculateTableTow(bigL) {\r\n    const k = (BigNatModule_FFT_maxBitsInsideFp - (2 * bigL)) | 0;\r\n    const bigK = BigNatModule_pow64(fromBits(2, 0, false), k);\r\n    return [bigL, k, bigK, op_Multiply(bigK, fromInteger(bigL, false, 2))];\r\n}\r\n\r\nexport function BigNatModule_encodingGivenResultBits(bitsRes) {\r\n    const selectFrom = (i_mut) => {\r\n        selectFrom:\r\n        while (true) {\r\n            const i = i_mut;\r\n            if (((i + 1) < BigNatModule_table.length) ? (bitsRes < BigNatModule_table[i + 1].bigN) : false) {\r\n                i_mut = (i + 1);\r\n                continue selectFrom;\r\n            }\r\n            else {\r\n                return BigNatModule_table[i];\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    if (bitsRes >= BigNatModule_table[0].bigN) {\r\n        throw (new Error(\"Product is huge, around 268435456 bits, beyond quickmul\"));\r\n    }\r\n    else {\r\n        return selectFrom(0);\r\n    }\r\n}\r\n\r\nexport const BigNatModule_bitmask = initialize(BigNatModule_baseBits, (i) => (BigNatModule_pow32(2, i) - 1), Int32Array);\r\n\r\nexport const BigNatModule_twopowers = initialize(BigNatModule_baseBits, (i) => BigNatModule_pow32(2, i), Int32Array);\r\n\r\nexport const BigNatModule_twopowersI64 = initialize(BigNatModule_baseBits, (i) => BigNatModule_pow64(fromBits(2, 0, false), i));\r\n\r\nexport function BigNatModule_wordBits(word) {\r\n    const hi = (k_mut) => {\r\n        hi:\r\n        while (true) {\r\n            const k = k_mut;\r\n            if (k === 0) {\r\n                return 0;\r\n            }\r\n            else if ((word & BigNatModule_twopowers[k - 1]) !== 0) {\r\n                return k | 0;\r\n            }\r\n            else {\r\n                k_mut = (k - 1);\r\n                continue hi;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    return hi(BigNatModule_baseBits) | 0;\r\n}\r\n\r\nexport function BigNatModule_bits(u) {\r\n    if (u.bound === 0) {\r\n        return 0;\r\n    }\r\n    else {\r\n        return ((BigNatModule_degree(u) * BigNatModule_baseBits) + BigNatModule_wordBits(u.digits[BigNatModule_degree(u)])) | 0;\r\n    }\r\n}\r\n\r\nexport function BigNatModule_extractBits(n, enc, bi) {\r\n    let z, i, z_1, i_1, z_2, i_2;\r\n    const biw = (~(~(bi / BigNatModule_baseBits))) | 0;\r\n    const bjw = (~(~(((bi + enc.bigL) - 1) / BigNatModule_baseBits))) | 0;\r\n    if (biw !== bjw) {\r\n        const xbit = (bi % BigNatModule_baseBits) | 0;\r\n        return (((((z = n, (i = (biw | 0), (i < z.bound) ? z.digits[i] : 0))) >> xbit) | (((z_1 = n, (i_1 = (bjw | 0), (i_1 < z_1.bound) ? z_1.digits[i_1] : 0))) << (BigNatModule_baseBits - xbit))) & BigNatModule_bitmask[enc.bigL]) | 0;\r\n    }\r\n    else {\r\n        return ((((z_2 = n, (i_2 = (biw | 0), (i_2 < z_2.bound) ? z_2.digits[i_2] : 0))) >> (bi % BigNatModule_baseBits)) & BigNatModule_bitmask[enc.bigL]) | 0;\r\n    }\r\n}\r\n\r\nexport function BigNatModule_encodePoly(enc, n) {\r\n    const poly = fill(new Uint32Array(enc.bigK), 0, enc.bigK, BigNatModule_FFT_Fp_ofInt32(0));\r\n    const biMax = (n.bound * BigNatModule_baseBits) | 0;\r\n    const encoder = (i_mut, bi_mut) => {\r\n        encoder:\r\n        while (true) {\r\n            const i = i_mut, bi = bi_mut;\r\n            if ((i === enc.bigK) ? true : (bi > biMax)) {\r\n            }\r\n            else {\r\n                const pi = BigNatModule_extractBits(n, enc, bi) | 0;\r\n                poly[i] = BigNatModule_FFT_Fp_ofInt32(pi);\r\n                i_mut = (i + 1);\r\n                bi_mut = (bi + enc.bigL);\r\n                continue encoder;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    encoder(0, 0);\r\n    return poly;\r\n}\r\n\r\nexport function BigNatModule_decodeResultBits(enc, poly) {\r\n    let n = 0;\r\n    for (let i = 0; i <= (poly.length - 1); i++) {\r\n        if (poly[i] !== BigNatModule_FFT_mzero) {\r\n            n = (i | 0);\r\n        }\r\n    }\r\n    return (((BigNatModule_FFT_maxBitsInsideFp + (enc.bigL * n)) + 1) + 1) | 0;\r\n}\r\n\r\nexport function BigNatModule_decodePoly(enc, poly) {\r\n    const rbound = ((~(~(BigNatModule_decodeResultBits(enc, poly) / BigNatModule_baseBits))) + 1) | 0;\r\n    const r = BigNatModule_createN(rbound);\r\n    const evaluate = (i_mut, j_mut, d_mut) => {\r\n        evaluate:\r\n        while (true) {\r\n            const i = i_mut, j = j_mut, d = d_mut;\r\n            if (i === enc.bigK) {\r\n            }\r\n            else {\r\n                if (j >= rbound) {\r\n                }\r\n                else {\r\n                    BigNatModule_contributeArr(r.digits, j, op_Multiply(fromInteger(BigNatModule_FFT_Fp_toInt(poly[i]), false, 2), BigNatModule_twopowersI64[d]));\r\n                }\r\n                const d_1 = (d + enc.bigL) | 0;\r\n                const patternInput = (d_1 >= BigNatModule_baseBits) ? [j + 1, d_1 - BigNatModule_baseBits] : [j, d_1];\r\n                i_mut = (i + 1);\r\n                j_mut = patternInput[0];\r\n                d_mut = patternInput[1];\r\n                continue evaluate;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    evaluate(0, 0, 0);\r\n    return BigNatModule_normN(r);\r\n}\r\n\r\nexport function BigNatModule_quickMulUsingFft(u, v) {\r\n    const enc = BigNatModule_encodingGivenResultBits(BigNatModule_bits(u) + BigNatModule_bits(v));\r\n    return BigNatModule_normN(BigNatModule_decodePoly(enc, BigNatModule_FFT_computeFftPaddedPolynomialProduct(enc.bigK, enc.k, BigNatModule_encodePoly(enc, u), BigNatModule_encodePoly(enc, v))));\r\n}\r\n\r\nexport const BigNatModule_minDigitsKaratsuba = 16;\r\n\r\nexport function BigNatModule_recMulKaratsuba(mul, p, q) {\r\n    const bmax = BigNatModule_maxInt(p.bound, q.bound) | 0;\r\n    if (bmax > BigNatModule_minDigitsKaratsuba) {\r\n        const k = (~(~(bmax / 2))) | 0;\r\n        const a0 = BigNatModule_restrictTo(k, p);\r\n        const a1 = BigNatModule_shiftDown(k, p);\r\n        const b0 = BigNatModule_restrictTo(k, q);\r\n        const b1 = BigNatModule_shiftDown(k, q);\r\n        const q0 = mul(a0, b0);\r\n        const q1 = mul(BigNatModule_add(a0, a1), BigNatModule_add(b0, b1));\r\n        const q2 = mul(a1, b1);\r\n        return BigNatModule_add(q0, BigNatModule_shiftUp(k, BigNatModule_add(BigNatModule_sub(q1, BigNatModule_add(q0, q2)), BigNatModule_shiftUp(k, q2))));\r\n    }\r\n    else {\r\n        return BigNatModule_mulSchoolBook(p, q);\r\n    }\r\n}\r\n\r\nexport function BigNatModule_mulKaratsuba(x, y) {\r\n    return BigNatModule_recMulKaratsuba((x_1, y_1) => BigNatModule_mulKaratsuba(x_1, y_1), x, y);\r\n}\r\n\r\nexport const BigNatModule_productDigitsUpperSchoolBook = ~(~(64000 / BigNatModule_baseBits));\r\n\r\nexport const BigNatModule_singleDigitForceSchoolBook = ~(~(32000 / BigNatModule_baseBits));\r\n\r\nexport const BigNatModule_productDigitsUpperFft = ~(~(BigNatModule_table[0].bigN / BigNatModule_baseBits));\r\n\r\nexport function BigNatModule_mul(p, q) {\r\n    return BigNatModule_mulSchoolBook(p, q);\r\n}\r\n\r\nexport function BigNatModule_scaleSubInPlace(x, f, a, n) {\r\n    const patternInput = [x.digits, BigNatModule_degree(x)];\r\n    const x_1 = patternInput[0];\r\n    const patternInput_1 = [a.digits, BigNatModule_degree(a)];\r\n    const ad = patternInput_1[1] | 0;\r\n    const a_1 = patternInput_1[0];\r\n    const f_1 = fromInteger(f, false, 2);\r\n    let j = 0;\r\n    let z = op_Multiply(f_1, fromInteger(a_1[0], false, 2));\r\n    while ((compare(z, fromBits(0, 0, false)) > 0) ? true : (j < ad)) {\r\n        if (j > patternInput[1]) {\r\n            throw (new Error(\"scaleSubInPlace: pre-condition did not apply, result would be -ve\"));\r\n        }\r\n        let zLo = ~(~toInt(op_BitwiseAnd(z, BigNatModule_baseMaski64)));\r\n        let zHi = op_Division(z, BigNatModule_baseNi64);\r\n        if (zLo <= x_1[j + n]) {\r\n            x_1[j + n] = ((x_1[j + n] - zLo) | 0);\r\n        }\r\n        else {\r\n            x_1[j + n] = ((x_1[j + n] + (BigNatModule_baseN - zLo)) | 0);\r\n            zHi = op_Addition(zHi, fromBits(1, 0, false));\r\n        }\r\n        if (j < ad) {\r\n            z = op_Addition(zHi, op_Multiply(f_1, fromInteger(a_1[j + 1], false, 2)));\r\n        }\r\n        else {\r\n            z = zHi;\r\n        }\r\n        j = ((j + 1) | 0);\r\n    }\r\n    void BigNatModule_normN(x);\r\n}\r\n\r\nexport function BigNatModule_scaleSub(x, f, a, n) {\r\n    const freshx = BigNatModule_add(x, BigNatModule_zero);\r\n    BigNatModule_scaleSubInPlace(freshx, f, a, n);\r\n    return BigNatModule_normN(freshx);\r\n}\r\n\r\nexport function BigNatModule_scaleAddInPlace(x, f, a, n) {\r\n    const patternInput = [x.digits, BigNatModule_degree(x)];\r\n    const x_1 = patternInput[0];\r\n    const patternInput_1 = [a.digits, BigNatModule_degree(a)];\r\n    const ad = patternInput_1[1] | 0;\r\n    const a_1 = patternInput_1[0];\r\n    const f_1 = fromInteger(f, false, 2);\r\n    let j = 0;\r\n    let z = op_Multiply(f_1, fromInteger(a_1[0], false, 2));\r\n    while ((compare(z, fromBits(0, 0, false)) > 0) ? true : (j < ad)) {\r\n        if (j > patternInput[1]) {\r\n            throw (new Error(\"scaleSubInPlace: pre-condition did not apply, result would be -ve\"));\r\n        }\r\n        let zLo = ~(~toInt(op_BitwiseAnd(z, BigNatModule_baseMaski64)));\r\n        let zHi = op_Division(z, BigNatModule_baseNi64);\r\n        if (zLo < (BigNatModule_baseN - x_1[j + n])) {\r\n            x_1[j + n] = ((x_1[j + n] + zLo) | 0);\r\n        }\r\n        else {\r\n            x_1[j + n] = ((zLo - (BigNatModule_baseN - x_1[j + n])) | 0);\r\n            zHi = op_Addition(zHi, fromBits(1, 0, false));\r\n        }\r\n        if (j < ad) {\r\n            z = op_Addition(zHi, op_Multiply(f_1, fromInteger(a_1[j + 1], false, 2)));\r\n        }\r\n        else {\r\n            z = zHi;\r\n        }\r\n        j = ((j + 1) | 0);\r\n    }\r\n    void BigNatModule_normN(x);\r\n}\r\n\r\nexport function BigNatModule_scaleAdd(x, f, a, n) {\r\n    const freshx = BigNatModule_add(x, BigNatModule_zero);\r\n    BigNatModule_scaleAddInPlace(freshx, f, a, n);\r\n    return BigNatModule_normN(freshx);\r\n}\r\n\r\nexport function BigNatModule_removeFactor(x, a, n) {\r\n    const patternInput = [BigNatModule_degree(a), BigNatModule_degree(x)];\r\n    const degx = patternInput[1] | 0;\r\n    const dega = patternInput[0] | 0;\r\n    if (degx < (dega + n)) {\r\n        return 0;\r\n    }\r\n    else {\r\n        const patternInput_1 = [a.digits, x.digits];\r\n        const xa = patternInput_1[1];\r\n        const aa = patternInput_1[0];\r\n        const f = ((dega === 0) ? ((degx === n) ? (~(~(xa[n] / aa[0]))) : (~(~toInt(op_Division(op_Addition(op_Multiply(fromInteger(xa[degx], false, 2), BigNatModule_baseNi64), fromInteger(xa[degx - 1], false, 2)), fromInteger(aa[0], false, 2)))))) : ((degx === (dega + n)) ? (~(~(xa[degx] / (aa[dega] + 1)))) : (~(~toInt(op_Division(op_Addition(op_Multiply(fromInteger(xa[degx], false, 2), BigNatModule_baseNi64), fromInteger(xa[degx - 1], false, 2)), op_Addition(fromInteger(aa[dega], false, 2), fromBits(1, 0, false)))))))) | 0;\r\n        if (f === 0) {\r\n            if (BigNatModule_shiftCompare(a, n, x, 0) !== 1) {\r\n                return 1;\r\n            }\r\n            else {\r\n                return 0;\r\n            }\r\n        }\r\n        else {\r\n            return f | 0;\r\n        }\r\n    }\r\n}\r\n\r\nexport function BigNatModule_divmod(b, a) {\r\n    if (BigNatModule_isZero(a)) {\r\n        throw (new Error());\r\n    }\r\n    else if (BigNatModule_degree(b) < BigNatModule_degree(a)) {\r\n        return [BigNatModule_zero, b];\r\n    }\r\n    else {\r\n        const x = BigNatModule_copyN(b);\r\n        const d = BigNatModule_createN(((BigNatModule_degree(b) - BigNatModule_degree(a)) + 1) + 1);\r\n        let p = BigNatModule_degree(b);\r\n        const m = BigNatModule_degree(a) | 0;\r\n        let n = p - m;\r\n        const Invariant = (tupledArg) => {\r\n        };\r\n        let finished = false;\r\n        while (!finished) {\r\n            Invariant([d, x, n, p]);\r\n            const f = BigNatModule_removeFactor(x, a, n) | 0;\r\n            if (f > 0) {\r\n                BigNatModule_scaleSubInPlace(x, f, a, n);\r\n                BigNatModule_scaleAddInPlace(d, f, BigNatModule_one, n);\r\n                Invariant([d, x, n, p]);\r\n            }\r\n            else {\r\n                finished = ((f === 0) ? (n === 0) : false);\r\n                if (!finished) {\r\n                    if (p === (m + n)) {\r\n                        Invariant([d, x, n - 1, p]);\r\n                        n = ((n - 1) | 0);\r\n                    }\r\n                    else {\r\n                        Invariant([d, x, n - 1, p - 1]);\r\n                        n = ((n - 1) | 0);\r\n                        p = ((p - 1) | 0);\r\n                    }\r\n                }\r\n            }\r\n        }\r\n        return [BigNatModule_normN(d), BigNatModule_normN(x)];\r\n    }\r\n}\r\n\r\nexport function BigNatModule_div(b, a) {\r\n    return BigNatModule_divmod(b, a)[0];\r\n}\r\n\r\nexport function BigNatModule_rem(b, a) {\r\n    return BigNatModule_divmod(b, a)[1];\r\n}\r\n\r\nexport function BigNatModule_bitAnd(a, b) {\r\n    const r = BigNatModule_createN(BigNatModule_minInt(a.bound, b.bound));\r\n    for (let i = 0; i <= (r.bound - 1); i++) {\r\n        r.digits[i] = ((a.digits[i] & b.digits[i]) | 0);\r\n    }\r\n    return BigNatModule_normN(r);\r\n}\r\n\r\nexport function BigNatModule_bitOr(a, b) {\r\n    const r = BigNatModule_createN(BigNatModule_maxInt(a.bound, b.bound));\r\n    for (let i = 0; i <= (a.bound - 1); i++) {\r\n        r.digits[i] = ((r.digits[i] | a.digits[i]) | 0);\r\n    }\r\n    for (let i_1 = 0; i_1 <= (b.bound - 1); i_1++) {\r\n        r.digits[i_1] = ((r.digits[i_1] | b.digits[i_1]) | 0);\r\n    }\r\n    return BigNatModule_normN(r);\r\n}\r\n\r\nexport function BigNatModule_bitXor(a, b) {\r\n    const r = BigNatModule_createN(BigNatModule_maxInt(a.bound, b.bound));\r\n    for (let i = 0; i <= (a.bound - 1); i++) {\r\n        r.digits[i] = ((r.digits[i] ^ a.digits[i]) | 0);\r\n    }\r\n    for (let i_1 = 0; i_1 <= (b.bound - 1); i_1++) {\r\n        r.digits[i_1] = ((r.digits[i_1] ^ b.digits[i_1]) | 0);\r\n    }\r\n    return BigNatModule_normN(r);\r\n}\r\n\r\nexport function BigNatModule_hcf(a, b) {\r\n    const hcfloop = (a_1_mut, b_1_mut) => {\r\n        hcfloop:\r\n        while (true) {\r\n            const a_1 = a_1_mut, b_1 = b_1_mut;\r\n            if (BigNatModule_equal(BigNatModule_zero, a_1)) {\r\n                return b_1;\r\n            }\r\n            else {\r\n                a_1_mut = BigNatModule_divmod(b_1, a_1)[1];\r\n                b_1_mut = a_1;\r\n                continue hcfloop;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    if (BigNatModule_lt(a, b)) {\r\n        return hcfloop(a, b);\r\n    }\r\n    else {\r\n        return hcfloop(b, a);\r\n    }\r\n}\r\n\r\nexport const BigNatModule_two = BigNatModule_embed(2);\r\n\r\nexport function BigNatModule_powi(x, n) {\r\n    const power = (acc_mut, x_1_mut, n_1_mut) => {\r\n        power:\r\n        while (true) {\r\n            const acc = acc_mut, x_1 = x_1_mut, n_1 = n_1_mut;\r\n            if (n_1 === 0) {\r\n                return acc;\r\n            }\r\n            else if ((n_1 % 2) === 0) {\r\n                acc_mut = acc;\r\n                x_1_mut = BigNatModule_mul(x_1, x_1);\r\n                n_1_mut = (~(~(n_1 / 2)));\r\n                continue power;\r\n            }\r\n            else {\r\n                acc_mut = BigNatModule_mul(x_1, acc);\r\n                x_1_mut = BigNatModule_mul(x_1, x_1);\r\n                n_1_mut = (~(~(n_1 / 2)));\r\n                continue power;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    return power(BigNatModule_one, x, n);\r\n}\r\n\r\nexport function BigNatModule_pow(x, n) {\r\n    const power = (acc_mut, x_1_mut, n_1_mut) => {\r\n        power:\r\n        while (true) {\r\n            const acc = acc_mut, x_1 = x_1_mut, n_1 = n_1_mut;\r\n            if (BigNatModule_isZero(n_1)) {\r\n                return acc;\r\n            }\r\n            else {\r\n                const patternInput = BigNatModule_divmod(n_1, BigNatModule_two);\r\n                const ndiv2 = patternInput[0];\r\n                if (BigNatModule_isZero(patternInput[1])) {\r\n                    acc_mut = acc;\r\n                    x_1_mut = BigNatModule_mul(x_1, x_1);\r\n                    n_1_mut = ndiv2;\r\n                    continue power;\r\n                }\r\n                else {\r\n                    acc_mut = BigNatModule_mul(x_1, acc);\r\n                    x_1_mut = BigNatModule_mul(x_1, x_1);\r\n                    n_1_mut = ndiv2;\r\n                    continue power;\r\n                }\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    return power(BigNatModule_one, x, n);\r\n}\r\n\r\nexport function BigNatModule_toFloat(n) {\r\n    const evalFloat = (acc_mut, k_mut, i_mut) => {\r\n        evalFloat:\r\n        while (true) {\r\n            const acc = acc_mut, k = k_mut, i = i_mut;\r\n            if (i === n.bound) {\r\n                return acc;\r\n            }\r\n            else {\r\n                acc_mut = (acc + (k * n.digits[i]));\r\n                k_mut = (k * BigNatModule_baseN);\r\n                i_mut = (i + 1);\r\n                continue evalFloat;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    return evalFloat(0, 1, 0);\r\n}\r\n\r\nexport function BigNatModule_ofInt32(n) {\r\n    return BigNatModule_embed(n);\r\n}\r\n\r\nexport function BigNatModule_ofInt64(n) {\r\n    return BigNatModule_embed64(n);\r\n}\r\n\r\nexport function BigNatModule_toUInt32(n) {\r\n    const matchValue = n.bound | 0;\r\n    switch (matchValue) {\r\n        case 0: {\r\n            return 0;\r\n        }\r\n        case 1: {\r\n            const value = n.digits[0] | 0;\r\n            return value >>> 0;\r\n        }\r\n        case 2: {\r\n            const patternInput = [n.digits[0], n.digits[1]];\r\n            const xB = patternInput[1] | 0;\r\n            if (xB > BigNatModule_baseMask32B) {\r\n                throw (new Error());\r\n            }\r\n            return ((patternInput[0] & BigNatModule_baseMask32A) >>> 0) + ((((xB & BigNatModule_baseMask32B) >>> 0) << BigNatModule_baseShift32B) >>> 0);\r\n        }\r\n        default: {\r\n            throw (new Error());\r\n        }\r\n    }\r\n}\r\n\r\nexport function BigNatModule_toUInt64(n) {\r\n    const matchValue = n.bound | 0;\r\n    switch (matchValue) {\r\n        case 0: {\r\n            return fromBits(0, 0, true);\r\n        }\r\n        case 1: {\r\n            return fromInteger(n.digits[0], true, 2);\r\n        }\r\n        case 2: {\r\n            const patternInput = [n.digits[0], n.digits[1]];\r\n            return op_Addition(fromInteger(patternInput[0] & BigNatModule_baseMask64A, true, 2), op_LeftShift(fromInteger(patternInput[1] & BigNatModule_baseMask64B, true, 2), BigNatModule_baseShift64B));\r\n        }\r\n        case 3: {\r\n            const patternInput_1 = [n.digits[0], n.digits[1], n.digits[2]];\r\n            const xC = patternInput_1[2] | 0;\r\n            if (xC > BigNatModule_baseMask64C) {\r\n                throw (new Error());\r\n            }\r\n            return op_Addition(op_Addition(fromInteger(patternInput_1[0] & BigNatModule_baseMask64A, true, 2), op_LeftShift(fromInteger(patternInput_1[1] & BigNatModule_baseMask64B, true, 2), BigNatModule_baseShift64B)), op_LeftShift(fromInteger(xC & BigNatModule_baseMask64C, true, 2), BigNatModule_baseShift64C));\r\n        }\r\n        default: {\r\n            throw (new Error());\r\n        }\r\n    }\r\n}\r\n\r\nexport function BigNatModule_toString(n) {\r\n    const degn = BigNatModule_degree(n) | 0;\r\n    const route = (prior_mut, k_mut, ten2k_mut) => {\r\n        route:\r\n        while (true) {\r\n            const prior = prior_mut, k = k_mut, ten2k = ten2k_mut;\r\n            if (BigNatModule_degree(ten2k) > degn) {\r\n                return cons([k, ten2k], prior);\r\n            }\r\n            else {\r\n                prior_mut = cons([k, ten2k], prior);\r\n                k_mut = (k + 1);\r\n                ten2k_mut = BigNatModule_mul(ten2k, ten2k);\r\n                continue route;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    const collect = (isLeading_mut, digits_mut, n_1_mut, _arg1_mut) => {\r\n        collect:\r\n        while (true) {\r\n            const isLeading = isLeading_mut, digits = digits_mut, n_1 = n_1_mut, _arg1 = _arg1_mut;\r\n            if (!isEmpty(_arg1)) {\r\n                const prior_1 = tail(_arg1);\r\n                const patternInput = BigNatModule_divmod(n_1, head(_arg1)[1]);\r\n                const nL = patternInput[1];\r\n                const nH = patternInput[0];\r\n                if (isLeading ? BigNatModule_isZero(nH) : false) {\r\n                    isLeading_mut = isLeading;\r\n                    digits_mut = digits;\r\n                    n_1_mut = nL;\r\n                    _arg1_mut = prior_1;\r\n                    continue collect;\r\n                }\r\n                else {\r\n                    isLeading_mut = isLeading;\r\n                    digits_mut = collect(false, digits, nL, prior_1);\r\n                    n_1_mut = nH;\r\n                    _arg1_mut = prior_1;\r\n                    continue collect;\r\n                }\r\n            }\r\n            else {\r\n                const n_2 = BigNatModule_eval32(n_1) | 0;\r\n                if (isLeading ? (n_2 === 0) : false) {\r\n                    return digits;\r\n                }\r\n                else {\r\n                    return cons(int32ToString(n_2), digits);\r\n                }\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    const digits_4 = collect(true, empty(), n, route(empty(), 0, BigNatModule_embed(10)));\r\n    if (isEmpty(digits_4)) {\r\n        return \"0\";\r\n    }\r\n    else {\r\n        return join(\"\", toArray(digits_4));\r\n    }\r\n}\r\n\r\nexport function BigNatModule_ofString(str) {\r\n    const len = str.length | 0;\r\n    if (isNullOrEmpty(str)) {\r\n        throw (new Error(\"empty string\\\\nParameter name: str\"));\r\n    }\r\n    const ten = BigNatModule_embed(10);\r\n    const build = (acc_mut, i_mut) => {\r\n        build:\r\n        while (true) {\r\n            const acc = acc_mut, i = i_mut;\r\n            if (i === len) {\r\n                return acc;\r\n            }\r\n            else {\r\n                const d = (str[i].charCodeAt(0) - \"0\".charCodeAt(0)) | 0;\r\n                if ((0 <= d) ? (d <= 9) : false) {\r\n                    acc_mut = BigNatModule_add(BigNatModule_mul(ten, acc), BigNatModule_embed(d));\r\n                    i_mut = (i + 1);\r\n                    continue build;\r\n                }\r\n                else {\r\n                    throw (new Error());\r\n                }\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    return build(BigNatModule_embed(0), 0);\r\n}\r\n\r\nexport function BigNatModule_isSmall(n) {\r\n    return n.bound <= 1;\r\n}\r\n\r\nexport function BigNatModule_getSmall(n) {\r\n    const z = n;\r\n    const i = 0;\r\n    if (i < z.bound) {\r\n        return z.digits[i] | 0;\r\n    }\r\n    else {\r\n        return 0;\r\n    }\r\n}\r\n\r\nexport function BigNatModule_factorial(n) {\r\n    const productR = (a, b) => {\r\n        if (BigNatModule_equal(a, b)) {\r\n            return a;\r\n        }\r\n        else {\r\n            const m = BigNatModule_div(BigNatModule_add(a, b), BigNatModule_ofInt32(2));\r\n            return BigNatModule_mul(productR(a, m), productR(BigNatModule_add(m, BigNatModule_one), b));\r\n        }\r\n    };\r\n    return productR(BigNatModule_one, n);\r\n}\r\n\r\n","import { BigNatModule_factorial, BigNatModule_ofString, BigNatModule_toFloat, BigNatModule_toUInt64, BigNatModule_toUInt32, BigNatModule_pow, BigNatModule_two, BigNatModule_rem, BigNatModule_lte, BigNatModule_hcf, BigNatModule_bitXor, BigNatModule_bitOr, BigNatModule_bitAnd, BigNatModule_divmod, BigNatModule_mul, BigNatModule_isOne, BigNatModule_sub, BigNatModule_gte, BigNatModule_scale, BigNatModule_one, BigNatModule_add, BigNatModule_ofInt64, BigNatModule_hash, BigNatModule_gt, BigNatModule_lt, BigNatModule_equal, BigNatModule_getSmall, BigNatModule_isSmall, BigNatModule_ofInt32, BigNatModule_toString, BigNatModule_isZero } from \"./n.js\";\r\nimport { Record, toString } from \"../Types.js\";\r\nimport { class_type } from \"../Reflection.js\";\r\nimport { initialize } from \"../Array.js\";\r\nimport { op_Addition, op_Multiply, fromValue, equals, fromBits, compare, fromInteger, op_UnaryNegation } from \"../Long.js\";\r\nimport { op_UnaryNegation_Int32 } from \"../Int32.js\";\r\nimport Decimal from \"../Decimal.js\";\r\n\r\nexport class BigInteger extends Record {\r\n    constructor(signInt, v) {\r\n        super();\r\n        this.signInt = (signInt | 0);\r\n        this.v = v;\r\n    }\r\n    toString() {\r\n        const x = this;\r\n        const matchValue = BigInteger__get_SignInt(x) | 0;\r\n        switch (matchValue) {\r\n            case -1: {\r\n                return BigNatModule_isZero(BigInteger__get_V(x)) ? \"0\" : (\"-\" + BigNatModule_toString(BigInteger__get_V(x)));\r\n            }\r\n            case 0: {\r\n                return \"0\";\r\n            }\r\n            case 1: {\r\n                return BigNatModule_toString(BigInteger__get_V(x));\r\n            }\r\n            default: {\r\n                throw (new Error(\"signs should be +/- 1 or 0\"));\r\n            }\r\n        }\r\n    }\r\n    Equals(obj) {\r\n        const this$ = this;\r\n        return (obj instanceof BigInteger) ? BigInteger_op_Equality_56F059C0(this$, obj) : false;\r\n    }\r\n    GetHashCode() {\r\n        const x = this;\r\n        return BigInteger_hash_Z665282C2(x) | 0;\r\n    }\r\n    toJSON(_key) {\r\n        const this$ = this;\r\n        return toString(this$);\r\n    }\r\n    CompareTo(obj) {\r\n        const this$ = this;\r\n        if (obj instanceof BigInteger) {\r\n            return BigInteger_compare_56F059C0(this$, obj) | 0;\r\n        }\r\n        else {\r\n            throw (new Error(\"the objects are not comparable\\\\nParameter name: obj\"));\r\n        }\r\n    }\r\n}\r\n\r\nexport function BigInteger$reflection() {\r\n    return class_type(\"BigInt.BigInteger\", void 0, BigInteger, class_type(\"System.ValueType\"));\r\n}\r\n\r\nexport function BigInteger_$ctor_Z2BE94A1(signInt, v) {\r\n    return new BigInteger(signInt, v);\r\n}\r\n\r\n(() => {\r\n    BigInteger.smallLim = 4096;\r\n    BigInteger.smallPosTab = initialize(BigInteger.smallLim, (n) => BigNatModule_ofInt32(n));\r\n    BigInteger.one = BigInteger_$ctor_Z524259A4(1);\r\n    BigInteger.two = BigInteger_$ctor_Z524259A4(2);\r\n    BigInteger.zero = BigInteger_$ctor_Z524259A4(0);\r\n})();\r\n\r\nexport function BigInteger_nat_Z67CCE57D(n) {\r\n    if (BigNatModule_isSmall(n) ? (BigNatModule_getSmall(n) < BigInteger.smallLim) : false) {\r\n        return BigInteger.smallPosTab[BigNatModule_getSmall(n)];\r\n    }\r\n    else {\r\n        return n;\r\n    }\r\n}\r\n\r\nexport function BigInteger_create_Z2BE94A1(s, n) {\r\n    return BigInteger_$ctor_Z2BE94A1(s, BigInteger_nat_Z67CCE57D(n));\r\n}\r\n\r\nexport function BigInteger_posn_Z67CCE57D(n) {\r\n    return BigInteger_$ctor_Z2BE94A1(1, BigInteger_nat_Z67CCE57D(n));\r\n}\r\n\r\nexport function BigInteger_negn_Z67CCE57D(n) {\r\n    return BigInteger_$ctor_Z2BE94A1(-1, BigInteger_nat_Z67CCE57D(n));\r\n}\r\n\r\nexport function BigInteger__get_Sign(x) {\r\n    if (BigInteger__get_IsZero(x)) {\r\n        return 0;\r\n    }\r\n    else {\r\n        return x.signInt | 0;\r\n    }\r\n}\r\n\r\nexport function BigInteger__get_SignInt(x) {\r\n    return x.signInt;\r\n}\r\n\r\nexport function BigInteger__get_V(x) {\r\n    return x.v;\r\n}\r\n\r\nexport function BigInteger_op_Equality_56F059C0(x, y) {\r\n    const matchValue = [BigInteger__get_SignInt(x), BigInteger__get_SignInt(y)];\r\n    let pattern_matching_result;\r\n    if (matchValue[0] === -1) {\r\n        if (matchValue[1] === -1) {\r\n            pattern_matching_result = 1;\r\n        }\r\n        else if (matchValue[1] === 0) {\r\n            pattern_matching_result = 8;\r\n        }\r\n        else if (matchValue[1] === 1) {\r\n            pattern_matching_result = 3;\r\n        }\r\n        else {\r\n            pattern_matching_result = 9;\r\n        }\r\n    }\r\n    else if (matchValue[0] === 0) {\r\n        if (matchValue[1] === -1) {\r\n            pattern_matching_result = 6;\r\n        }\r\n        else if (matchValue[1] === 0) {\r\n            pattern_matching_result = 4;\r\n        }\r\n        else if (matchValue[1] === 1) {\r\n            pattern_matching_result = 5;\r\n        }\r\n        else {\r\n            pattern_matching_result = 9;\r\n        }\r\n    }\r\n    else if (matchValue[0] === 1) {\r\n        if (matchValue[1] === -1) {\r\n            pattern_matching_result = 2;\r\n        }\r\n        else if (matchValue[1] === 0) {\r\n            pattern_matching_result = 7;\r\n        }\r\n        else if (matchValue[1] === 1) {\r\n            pattern_matching_result = 0;\r\n        }\r\n        else {\r\n            pattern_matching_result = 9;\r\n        }\r\n    }\r\n    else {\r\n        pattern_matching_result = 9;\r\n    }\r\n    switch (pattern_matching_result) {\r\n        case 0: {\r\n            return BigNatModule_equal(BigInteger__get_V(x), BigInteger__get_V(y));\r\n        }\r\n        case 1: {\r\n            return BigNatModule_equal(BigInteger__get_V(x), BigInteger__get_V(y));\r\n        }\r\n        case 2: {\r\n            if (BigNatModule_isZero(BigInteger__get_V(x))) {\r\n                return BigNatModule_isZero(BigInteger__get_V(y));\r\n            }\r\n            else {\r\n                return false;\r\n            }\r\n        }\r\n        case 3: {\r\n            if (BigNatModule_isZero(BigInteger__get_V(x))) {\r\n                return BigNatModule_isZero(BigInteger__get_V(y));\r\n            }\r\n            else {\r\n                return false;\r\n            }\r\n        }\r\n        case 4: {\r\n            return true;\r\n        }\r\n        case 5: {\r\n            return BigNatModule_isZero(BigInteger__get_V(y));\r\n        }\r\n        case 6: {\r\n            return BigNatModule_isZero(BigInteger__get_V(y));\r\n        }\r\n        case 7: {\r\n            return BigNatModule_isZero(BigInteger__get_V(x));\r\n        }\r\n        case 8: {\r\n            return BigNatModule_isZero(BigInteger__get_V(x));\r\n        }\r\n        case 9: {\r\n            throw (new Error(\"signs should be +/- 1 or 0\\\\nParameter name: x\"));\r\n        }\r\n    }\r\n}\r\n\r\nexport function BigInteger_op_Inequality_56F059C0(x, y) {\r\n    return !BigInteger_op_Equality_56F059C0(x, y);\r\n}\r\n\r\nexport function BigInteger_op_LessThan_56F059C0(x, y) {\r\n    const matchValue = [BigInteger__get_SignInt(x), BigInteger__get_SignInt(y)];\r\n    let pattern_matching_result;\r\n    if (matchValue[0] === -1) {\r\n        if (matchValue[1] === -1) {\r\n            pattern_matching_result = 1;\r\n        }\r\n        else if (matchValue[1] === 0) {\r\n            pattern_matching_result = 8;\r\n        }\r\n        else if (matchValue[1] === 1) {\r\n            pattern_matching_result = 3;\r\n        }\r\n        else {\r\n            pattern_matching_result = 9;\r\n        }\r\n    }\r\n    else if (matchValue[0] === 0) {\r\n        if (matchValue[1] === -1) {\r\n            pattern_matching_result = 6;\r\n        }\r\n        else if (matchValue[1] === 0) {\r\n            pattern_matching_result = 4;\r\n        }\r\n        else if (matchValue[1] === 1) {\r\n            pattern_matching_result = 5;\r\n        }\r\n        else {\r\n            pattern_matching_result = 9;\r\n        }\r\n    }\r\n    else if (matchValue[0] === 1) {\r\n        if (matchValue[1] === -1) {\r\n            pattern_matching_result = 2;\r\n        }\r\n        else if (matchValue[1] === 0) {\r\n            pattern_matching_result = 7;\r\n        }\r\n        else if (matchValue[1] === 1) {\r\n            pattern_matching_result = 0;\r\n        }\r\n        else {\r\n            pattern_matching_result = 9;\r\n        }\r\n    }\r\n    else {\r\n        pattern_matching_result = 9;\r\n    }\r\n    switch (pattern_matching_result) {\r\n        case 0: {\r\n            return BigNatModule_lt(BigInteger__get_V(x), BigInteger__get_V(y));\r\n        }\r\n        case 1: {\r\n            return BigNatModule_lt(BigInteger__get_V(y), BigInteger__get_V(x));\r\n        }\r\n        case 2: {\r\n            return false;\r\n        }\r\n        case 3: {\r\n            if (!BigNatModule_isZero(BigInteger__get_V(x))) {\r\n                return true;\r\n            }\r\n            else {\r\n                return !BigNatModule_isZero(BigInteger__get_V(y));\r\n            }\r\n        }\r\n        case 4: {\r\n            return false;\r\n        }\r\n        case 5: {\r\n            return !BigNatModule_isZero(BigInteger__get_V(y));\r\n        }\r\n        case 6: {\r\n            return false;\r\n        }\r\n        case 7: {\r\n            return false;\r\n        }\r\n        case 8: {\r\n            return !BigNatModule_isZero(BigInteger__get_V(x));\r\n        }\r\n        case 9: {\r\n            throw (new Error(\"signs should be +/- 1 or 0\\\\nParameter name: x\"));\r\n        }\r\n    }\r\n}\r\n\r\nexport function BigInteger_op_GreaterThan_56F059C0(x, y) {\r\n    const matchValue = [BigInteger__get_SignInt(x), BigInteger__get_SignInt(y)];\r\n    let pattern_matching_result;\r\n    if (matchValue[0] === -1) {\r\n        if (matchValue[1] === -1) {\r\n            pattern_matching_result = 1;\r\n        }\r\n        else if (matchValue[1] === 0) {\r\n            pattern_matching_result = 8;\r\n        }\r\n        else if (matchValue[1] === 1) {\r\n            pattern_matching_result = 3;\r\n        }\r\n        else {\r\n            pattern_matching_result = 9;\r\n        }\r\n    }\r\n    else if (matchValue[0] === 0) {\r\n        if (matchValue[1] === -1) {\r\n            pattern_matching_result = 6;\r\n        }\r\n        else if (matchValue[1] === 0) {\r\n            pattern_matching_result = 4;\r\n        }\r\n        else if (matchValue[1] === 1) {\r\n            pattern_matching_result = 5;\r\n        }\r\n        else {\r\n            pattern_matching_result = 9;\r\n        }\r\n    }\r\n    else if (matchValue[0] === 1) {\r\n        if (matchValue[1] === -1) {\r\n            pattern_matching_result = 2;\r\n        }\r\n        else if (matchValue[1] === 0) {\r\n            pattern_matching_result = 7;\r\n        }\r\n        else if (matchValue[1] === 1) {\r\n            pattern_matching_result = 0;\r\n        }\r\n        else {\r\n            pattern_matching_result = 9;\r\n        }\r\n    }\r\n    else {\r\n        pattern_matching_result = 9;\r\n    }\r\n    switch (pattern_matching_result) {\r\n        case 0: {\r\n            return BigNatModule_gt(BigInteger__get_V(x), BigInteger__get_V(y));\r\n        }\r\n        case 1: {\r\n            return BigNatModule_gt(BigInteger__get_V(y), BigInteger__get_V(x));\r\n        }\r\n        case 2: {\r\n            if (!BigNatModule_isZero(BigInteger__get_V(x))) {\r\n                return true;\r\n            }\r\n            else {\r\n                return !BigNatModule_isZero(BigInteger__get_V(y));\r\n            }\r\n        }\r\n        case 3: {\r\n            return false;\r\n        }\r\n        case 4: {\r\n            return false;\r\n        }\r\n        case 5: {\r\n            return false;\r\n        }\r\n        case 6: {\r\n            return !BigNatModule_isZero(BigInteger__get_V(y));\r\n        }\r\n        case 7: {\r\n            return !BigNatModule_isZero(BigInteger__get_V(x));\r\n        }\r\n        case 8: {\r\n            return false;\r\n        }\r\n        case 9: {\r\n            throw (new Error(\"signs should be +/- 1 or 0\\\\nParameter name: x\"));\r\n        }\r\n    }\r\n}\r\n\r\nexport function BigInteger_compare_56F059C0(n, nn) {\r\n    if (BigInteger_op_LessThan_56F059C0(n, nn)) {\r\n        return -1;\r\n    }\r\n    else if (BigInteger_op_Equality_56F059C0(n, nn)) {\r\n        return 0;\r\n    }\r\n    else {\r\n        return 1;\r\n    }\r\n}\r\n\r\nexport function BigInteger_hash_Z665282C2(z) {\r\n    if (BigInteger__get_SignInt(z) === 0) {\r\n        return 1;\r\n    }\r\n    else {\r\n        return (BigInteger__get_SignInt(z) + BigNatModule_hash(BigInteger__get_V(z))) | 0;\r\n    }\r\n}\r\n\r\nexport function BigInteger__get_StructuredDisplayString(x) {\r\n    return toString(x);\r\n}\r\n\r\nexport function BigInteger_$ctor_Z524259A4(n) {\r\n    if (n >= 0) {\r\n        return BigInteger_$ctor_Z2BE94A1(1, BigInteger_nat_Z67CCE57D(BigNatModule_ofInt32(n)));\r\n    }\r\n    else if (n === -2147483648) {\r\n        return BigInteger_$ctor_Z2BE94A1(-1, BigInteger_nat_Z67CCE57D(BigNatModule_ofInt64(op_UnaryNegation(fromInteger(n, false, 2)))));\r\n    }\r\n    else {\r\n        return BigInteger_$ctor_Z2BE94A1(-1, BigInteger_nat_Z67CCE57D(BigNatModule_ofInt32(op_UnaryNegation_Int32(n))));\r\n    }\r\n}\r\n\r\nexport function BigInteger_$ctor_Z524259C1(n) {\r\n    if (compare(n, fromBits(0, 0, false)) >= 0) {\r\n        return BigInteger_$ctor_Z2BE94A1(1, BigInteger_nat_Z67CCE57D(BigNatModule_ofInt64(n)));\r\n    }\r\n    else if (equals(n, fromBits(0, 2147483648, false))) {\r\n        return BigInteger_$ctor_Z2BE94A1(-1, BigInteger_nat_Z67CCE57D(BigNatModule_add(BigNatModule_ofInt64(fromBits(4294967295, 2147483647, false)), BigNatModule_one)));\r\n    }\r\n    else {\r\n        return BigInteger_$ctor_Z2BE94A1(-1, BigInteger_nat_Z67CCE57D(BigNatModule_ofInt64(op_UnaryNegation(n))));\r\n    }\r\n}\r\n\r\nexport function BigInteger_get_One() {\r\n    return BigInteger.one;\r\n}\r\n\r\nexport function BigInteger_get_Two() {\r\n    return BigInteger.two;\r\n}\r\n\r\nexport function BigInteger_get_Zero() {\r\n    return BigInteger.zero;\r\n}\r\n\r\nexport function BigInteger_op_UnaryNegation_Z665282C2(z) {\r\n    const matchValue = BigInteger__get_SignInt(z) | 0;\r\n    if (matchValue === 0) {\r\n        return BigInteger_get_Zero();\r\n    }\r\n    else {\r\n        return BigInteger_create_Z2BE94A1(op_UnaryNegation_Int32(matchValue), BigInteger__get_V(z));\r\n    }\r\n}\r\n\r\nexport function BigInteger_Scale_Z320F31E(k, z) {\r\n    if (BigInteger__get_SignInt(z) === 0) {\r\n        return BigInteger_get_Zero();\r\n    }\r\n    else if (k < 0) {\r\n        return BigInteger_create_Z2BE94A1(op_UnaryNegation_Int32(BigInteger__get_SignInt(z)), BigNatModule_scale(op_UnaryNegation_Int32(k), BigInteger__get_V(z)));\r\n    }\r\n    else {\r\n        return BigInteger_create_Z2BE94A1(BigInteger__get_SignInt(z), BigNatModule_scale(k, BigInteger__get_V(z)));\r\n    }\r\n}\r\n\r\nexport function BigInteger_subnn_6A57060(nx, ny) {\r\n    if (BigNatModule_gte(nx, ny)) {\r\n        return BigInteger_posn_Z67CCE57D(BigNatModule_sub(nx, ny));\r\n    }\r\n    else {\r\n        return BigInteger_negn_Z67CCE57D(BigNatModule_sub(ny, nx));\r\n    }\r\n}\r\n\r\nexport function BigInteger_addnn_6A57060(nx, ny) {\r\n    return BigInteger_posn_Z67CCE57D(BigNatModule_add(nx, ny));\r\n}\r\n\r\nexport function BigInteger__get_IsZero(x) {\r\n    if (BigInteger__get_SignInt(x) === 0) {\r\n        return true;\r\n    }\r\n    else {\r\n        return BigNatModule_isZero(BigInteger__get_V(x));\r\n    }\r\n}\r\n\r\nexport function BigInteger__get_IsOne(x) {\r\n    if (BigInteger__get_SignInt(x) === 1) {\r\n        return BigNatModule_isOne(BigInteger__get_V(x));\r\n    }\r\n    else {\r\n        return false;\r\n    }\r\n}\r\n\r\nexport function BigInteger_op_Addition_56F059C0(x, y) {\r\n    if (BigInteger__get_IsZero(y)) {\r\n        return x;\r\n    }\r\n    else if (BigInteger__get_IsZero(x)) {\r\n        return y;\r\n    }\r\n    else {\r\n        const matchValue = [BigInteger__get_SignInt(x), BigInteger__get_SignInt(y)];\r\n        let pattern_matching_result;\r\n        if (matchValue[0] === -1) {\r\n            if (matchValue[1] === -1) {\r\n                pattern_matching_result = 1;\r\n            }\r\n            else if (matchValue[1] === 1) {\r\n                pattern_matching_result = 3;\r\n            }\r\n            else {\r\n                pattern_matching_result = 4;\r\n            }\r\n        }\r\n        else if (matchValue[0] === 1) {\r\n            if (matchValue[1] === -1) {\r\n                pattern_matching_result = 2;\r\n            }\r\n            else if (matchValue[1] === 1) {\r\n                pattern_matching_result = 0;\r\n            }\r\n            else {\r\n                pattern_matching_result = 4;\r\n            }\r\n        }\r\n        else {\r\n            pattern_matching_result = 4;\r\n        }\r\n        switch (pattern_matching_result) {\r\n            case 0: {\r\n                return BigInteger_addnn_6A57060(BigInteger__get_V(x), BigInteger__get_V(y));\r\n            }\r\n            case 1: {\r\n                return BigInteger_op_UnaryNegation_Z665282C2(BigInteger_addnn_6A57060(BigInteger__get_V(x), BigInteger__get_V(y)));\r\n            }\r\n            case 2: {\r\n                return BigInteger_subnn_6A57060(BigInteger__get_V(x), BigInteger__get_V(y));\r\n            }\r\n            case 3: {\r\n                return BigInteger_subnn_6A57060(BigInteger__get_V(y), BigInteger__get_V(x));\r\n            }\r\n            case 4: {\r\n                throw (new Error(\"signs should be +/- 1\\\\nParameter name: x\"));\r\n            }\r\n        }\r\n    }\r\n}\r\n\r\nexport function BigInteger_op_Subtraction_56F059C0(x, y) {\r\n    if (BigInteger__get_IsZero(y)) {\r\n        return x;\r\n    }\r\n    else if (BigInteger__get_IsZero(x)) {\r\n        return BigInteger_op_UnaryNegation_Z665282C2(y);\r\n    }\r\n    else {\r\n        const matchValue = [BigInteger__get_SignInt(x), BigInteger__get_SignInt(y)];\r\n        let pattern_matching_result;\r\n        if (matchValue[0] === -1) {\r\n            if (matchValue[1] === -1) {\r\n                pattern_matching_result = 1;\r\n            }\r\n            else if (matchValue[1] === 1) {\r\n                pattern_matching_result = 3;\r\n            }\r\n            else {\r\n                pattern_matching_result = 4;\r\n            }\r\n        }\r\n        else if (matchValue[0] === 1) {\r\n            if (matchValue[1] === -1) {\r\n                pattern_matching_result = 2;\r\n            }\r\n            else if (matchValue[1] === 1) {\r\n                pattern_matching_result = 0;\r\n            }\r\n            else {\r\n                pattern_matching_result = 4;\r\n            }\r\n        }\r\n        else {\r\n            pattern_matching_result = 4;\r\n        }\r\n        switch (pattern_matching_result) {\r\n            case 0: {\r\n                return BigInteger_subnn_6A57060(BigInteger__get_V(x), BigInteger__get_V(y));\r\n            }\r\n            case 1: {\r\n                return BigInteger_subnn_6A57060(BigInteger__get_V(y), BigInteger__get_V(x));\r\n            }\r\n            case 2: {\r\n                return BigInteger_addnn_6A57060(BigInteger__get_V(x), BigInteger__get_V(y));\r\n            }\r\n            case 3: {\r\n                return BigInteger_op_UnaryNegation_Z665282C2(BigInteger_addnn_6A57060(BigInteger__get_V(x), BigInteger__get_V(y)));\r\n            }\r\n            case 4: {\r\n                throw (new Error(\"signs should be +/- 1\\\\nParameter name: x\"));\r\n            }\r\n        }\r\n    }\r\n}\r\n\r\nexport function BigInteger_op_Multiply_56F059C0(x, y) {\r\n    if (BigInteger__get_IsZero(x)) {\r\n        return x;\r\n    }\r\n    else if (BigInteger__get_IsZero(y)) {\r\n        return y;\r\n    }\r\n    else if (BigInteger__get_IsOne(x)) {\r\n        return y;\r\n    }\r\n    else if (BigInteger__get_IsOne(y)) {\r\n        return x;\r\n    }\r\n    else {\r\n        const m = BigNatModule_mul(BigInteger__get_V(x), BigInteger__get_V(y));\r\n        return BigInteger_create_Z2BE94A1(BigInteger__get_SignInt(x) * BigInteger__get_SignInt(y), m);\r\n    }\r\n}\r\n\r\nexport function BigInteger_DivRem_56F059C0(x, y) {\r\n    if (BigInteger__get_IsZero(y)) {\r\n        throw (new Error());\r\n    }\r\n    if (BigInteger__get_IsZero(x)) {\r\n        return [BigInteger_get_Zero(), BigInteger_get_Zero()];\r\n    }\r\n    else {\r\n        const patternInput = BigNatModule_divmod(BigInteger__get_V(x), BigInteger__get_V(y));\r\n        const r = patternInput[1];\r\n        const d = patternInput[0];\r\n        const matchValue = [BigInteger__get_SignInt(x), BigInteger__get_SignInt(y)];\r\n        let pattern_matching_result;\r\n        if (matchValue[0] === -1) {\r\n            if (matchValue[1] === -1) {\r\n                pattern_matching_result = 1;\r\n            }\r\n            else if (matchValue[1] === 1) {\r\n                pattern_matching_result = 3;\r\n            }\r\n            else {\r\n                pattern_matching_result = 4;\r\n            }\r\n        }\r\n        else if (matchValue[0] === 1) {\r\n            if (matchValue[1] === -1) {\r\n                pattern_matching_result = 2;\r\n            }\r\n            else if (matchValue[1] === 1) {\r\n                pattern_matching_result = 0;\r\n            }\r\n            else {\r\n                pattern_matching_result = 4;\r\n            }\r\n        }\r\n        else {\r\n            pattern_matching_result = 4;\r\n        }\r\n        switch (pattern_matching_result) {\r\n            case 0: {\r\n                return [BigInteger_posn_Z67CCE57D(d), BigInteger_posn_Z67CCE57D(r)];\r\n            }\r\n            case 1: {\r\n                return [BigInteger_posn_Z67CCE57D(d), BigInteger_negn_Z67CCE57D(r)];\r\n            }\r\n            case 2: {\r\n                return [BigInteger_negn_Z67CCE57D(d), BigInteger_posn_Z67CCE57D(r)];\r\n            }\r\n            case 3: {\r\n                return [BigInteger_negn_Z67CCE57D(d), BigInteger_negn_Z67CCE57D(r)];\r\n            }\r\n            case 4: {\r\n                throw (new Error(\"signs should be +/- 1\\\\nParameter name: x\"));\r\n            }\r\n        }\r\n    }\r\n}\r\n\r\nexport function BigInteger_op_Division_56F059C0(x, y) {\r\n    return BigInteger_DivRem_56F059C0(x, y)[0];\r\n}\r\n\r\nexport function BigInteger_op_Modulus_56F059C0(x, y) {\r\n    return BigInteger_DivRem_56F059C0(x, y)[1];\r\n}\r\n\r\nexport function BigInteger_op_RightShift_62E082A2(x, y) {\r\n    return BigInteger_op_Division_56F059C0(x, BigInteger_Pow_62E082A2(BigInteger_get_Two(), y));\r\n}\r\n\r\nexport function BigInteger_op_LeftShift_62E082A2(x, y) {\r\n    return BigInteger_op_Multiply_56F059C0(x, BigInteger_Pow_62E082A2(BigInteger_get_Two(), y));\r\n}\r\n\r\nexport function BigInteger_op_BitwiseAnd_56F059C0(x, y) {\r\n    return BigInteger_posn_Z67CCE57D(BigNatModule_bitAnd(BigInteger__get_V(x), BigInteger__get_V(y)));\r\n}\r\n\r\nexport function BigInteger_op_BitwiseOr_56F059C0(x, y) {\r\n    return BigInteger_posn_Z67CCE57D(BigNatModule_bitOr(BigInteger__get_V(x), BigInteger__get_V(y)));\r\n}\r\n\r\nexport function BigInteger_op_ExclusiveOr_56F059C0(x, y) {\r\n    return BigInteger_posn_Z67CCE57D(BigNatModule_bitXor(BigInteger__get_V(x), BigInteger__get_V(y)));\r\n}\r\n\r\nexport function BigInteger_GreatestCommonDivisor_56F059C0(x, y) {\r\n    const matchValue = [BigInteger__get_SignInt(x), BigInteger__get_SignInt(y)];\r\n    if (matchValue[0] === 0) {\r\n        if (matchValue[1] === 0) {\r\n            return BigInteger_get_Zero();\r\n        }\r\n        else {\r\n            return BigInteger_posn_Z67CCE57D(BigInteger__get_V(y));\r\n        }\r\n    }\r\n    else if (matchValue[1] === 0) {\r\n        return BigInteger_posn_Z67CCE57D(BigInteger__get_V(x));\r\n    }\r\n    else {\r\n        return BigInteger_posn_Z67CCE57D(BigNatModule_hcf(BigInteger__get_V(x), BigInteger__get_V(y)));\r\n    }\r\n}\r\n\r\nexport function BigInteger__get_IsNegative(x) {\r\n    if (BigInteger__get_SignInt(x) === -1) {\r\n        return !BigInteger__get_IsZero(x);\r\n    }\r\n    else {\r\n        return false;\r\n    }\r\n}\r\n\r\nexport function BigInteger__get_IsPositive(x) {\r\n    if (BigInteger__get_SignInt(x) === 1) {\r\n        return !BigInteger__get_IsZero(x);\r\n    }\r\n    else {\r\n        return false;\r\n    }\r\n}\r\n\r\nexport function BigInteger_Abs_Z665282C2(x) {\r\n    if (BigInteger__get_SignInt(x) === -1) {\r\n        return BigInteger_op_UnaryNegation_Z665282C2(x);\r\n    }\r\n    else {\r\n        return x;\r\n    }\r\n}\r\n\r\nexport function BigInteger_op_LessThanOrEqual_56F059C0(x, y) {\r\n    const matchValue = [BigInteger__get_SignInt(x), BigInteger__get_SignInt(y)];\r\n    let pattern_matching_result;\r\n    if (matchValue[0] === -1) {\r\n        if (matchValue[1] === -1) {\r\n            pattern_matching_result = 1;\r\n        }\r\n        else if (matchValue[1] === 0) {\r\n            pattern_matching_result = 6;\r\n        }\r\n        else if (matchValue[1] === 1) {\r\n            pattern_matching_result = 3;\r\n        }\r\n        else {\r\n            pattern_matching_result = 9;\r\n        }\r\n    }\r\n    else if (matchValue[0] === 0) {\r\n        if (matchValue[1] === -1) {\r\n            pattern_matching_result = 8;\r\n        }\r\n        else if (matchValue[1] === 0) {\r\n            pattern_matching_result = 4;\r\n        }\r\n        else if (matchValue[1] === 1) {\r\n            pattern_matching_result = 7;\r\n        }\r\n        else {\r\n            pattern_matching_result = 9;\r\n        }\r\n    }\r\n    else if (matchValue[0] === 1) {\r\n        if (matchValue[1] === -1) {\r\n            pattern_matching_result = 2;\r\n        }\r\n        else if (matchValue[1] === 0) {\r\n            pattern_matching_result = 5;\r\n        }\r\n        else if (matchValue[1] === 1) {\r\n            pattern_matching_result = 0;\r\n        }\r\n        else {\r\n            pattern_matching_result = 9;\r\n        }\r\n    }\r\n    else {\r\n        pattern_matching_result = 9;\r\n    }\r\n    switch (pattern_matching_result) {\r\n        case 0: {\r\n            return BigNatModule_lte(BigInteger__get_V(x), BigInteger__get_V(y));\r\n        }\r\n        case 1: {\r\n            return BigNatModule_lte(BigInteger__get_V(y), BigInteger__get_V(x));\r\n        }\r\n        case 2: {\r\n            if (BigNatModule_isZero(BigInteger__get_V(x))) {\r\n                return BigNatModule_isZero(BigInteger__get_V(y));\r\n            }\r\n            else {\r\n                return false;\r\n            }\r\n        }\r\n        case 3: {\r\n            return true;\r\n        }\r\n        case 4: {\r\n            return true;\r\n        }\r\n        case 5: {\r\n            return BigNatModule_isZero(BigInteger__get_V(x));\r\n        }\r\n        case 6: {\r\n            return true;\r\n        }\r\n        case 7: {\r\n            return true;\r\n        }\r\n        case 8: {\r\n            return BigNatModule_isZero(BigInteger__get_V(y));\r\n        }\r\n        case 9: {\r\n            throw (new Error(\"signs should be +/- 1 or 0\\\\nParameter name: x\"));\r\n        }\r\n    }\r\n}\r\n\r\nexport function BigInteger_op_GreaterThanOrEqual_56F059C0(x, y) {\r\n    const matchValue = [BigInteger__get_SignInt(x), BigInteger__get_SignInt(y)];\r\n    let pattern_matching_result;\r\n    if (matchValue[0] === -1) {\r\n        if (matchValue[1] === -1) {\r\n            pattern_matching_result = 1;\r\n        }\r\n        else if (matchValue[1] === 0) {\r\n            pattern_matching_result = 6;\r\n        }\r\n        else if (matchValue[1] === 1) {\r\n            pattern_matching_result = 3;\r\n        }\r\n        else {\r\n            pattern_matching_result = 9;\r\n        }\r\n    }\r\n    else if (matchValue[0] === 0) {\r\n        if (matchValue[1] === -1) {\r\n            pattern_matching_result = 8;\r\n        }\r\n        else if (matchValue[1] === 0) {\r\n            pattern_matching_result = 4;\r\n        }\r\n        else if (matchValue[1] === 1) {\r\n            pattern_matching_result = 7;\r\n        }\r\n        else {\r\n            pattern_matching_result = 9;\r\n        }\r\n    }\r\n    else if (matchValue[0] === 1) {\r\n        if (matchValue[1] === -1) {\r\n            pattern_matching_result = 2;\r\n        }\r\n        else if (matchValue[1] === 0) {\r\n            pattern_matching_result = 5;\r\n        }\r\n        else if (matchValue[1] === 1) {\r\n            pattern_matching_result = 0;\r\n        }\r\n        else {\r\n            pattern_matching_result = 9;\r\n        }\r\n    }\r\n    else {\r\n        pattern_matching_result = 9;\r\n    }\r\n    switch (pattern_matching_result) {\r\n        case 0: {\r\n            return BigNatModule_gte(BigInteger__get_V(x), BigInteger__get_V(y));\r\n        }\r\n        case 1: {\r\n            return BigNatModule_gte(BigInteger__get_V(y), BigInteger__get_V(x));\r\n        }\r\n        case 2: {\r\n            return true;\r\n        }\r\n        case 3: {\r\n            if (BigNatModule_isZero(BigInteger__get_V(x))) {\r\n                return BigNatModule_isZero(BigInteger__get_V(y));\r\n            }\r\n            else {\r\n                return false;\r\n            }\r\n        }\r\n        case 4: {\r\n            return true;\r\n        }\r\n        case 5: {\r\n            return true;\r\n        }\r\n        case 6: {\r\n            return BigNatModule_isZero(BigInteger__get_V(x));\r\n        }\r\n        case 7: {\r\n            return BigNatModule_isZero(BigInteger__get_V(y));\r\n        }\r\n        case 8: {\r\n            return true;\r\n        }\r\n        case 9: {\r\n            throw (new Error(\"signs should be +/- 1 or 0\\\\nParameter name: x\"));\r\n        }\r\n    }\r\n}\r\n\r\nexport function BigInteger_Pow_62E082A2(x, y) {\r\n    if (y < 0) {\r\n        throw (new Error(\"y\"));\r\n    }\r\n    const matchValue = [BigInteger__get_IsZero(x), y];\r\n    if (matchValue[0]) {\r\n        if (matchValue[1] === 0) {\r\n            return BigInteger_get_One();\r\n        }\r\n        else {\r\n            return BigInteger_get_Zero();\r\n        }\r\n    }\r\n    else {\r\n        const yval = BigInteger_$ctor_Z524259A4(y);\r\n        return BigInteger_create_Z2BE94A1(BigNatModule_isZero(BigNatModule_rem(BigInteger__get_V(yval), BigNatModule_two)) ? 1 : BigInteger__get_SignInt(x), BigNatModule_pow(BigInteger__get_V(x), BigInteger__get_V(yval)));\r\n    }\r\n}\r\n\r\nexport function BigInteger__get_ToInt32(x) {\r\n    if (BigInteger__get_IsZero(x)) {\r\n        return 0;\r\n    }\r\n    else {\r\n        const u = BigNatModule_toUInt32(BigInteger__get_V(x));\r\n        if (u <= (2147483647 >>> 0)) {\r\n            return (BigInteger__get_SignInt(x) * (~(~u))) | 0;\r\n        }\r\n        else if ((BigInteger__get_SignInt(x) === -1) ? (u === ((2147483647 + 1) >>> 0)) : false) {\r\n            return -2147483648;\r\n        }\r\n        else {\r\n            throw (new Error());\r\n        }\r\n    }\r\n}\r\n\r\nexport function BigInteger__get_ToUInt32(x) {\r\n    if (BigInteger__get_IsZero(x)) {\r\n        return 0;\r\n    }\r\n    else {\r\n        return BigNatModule_toUInt32(BigInteger__get_V(x));\r\n    }\r\n}\r\n\r\nexport function BigInteger__get_ToInt64(x) {\r\n    if (BigInteger__get_IsZero(x)) {\r\n        return fromBits(0, 0, false);\r\n    }\r\n    else {\r\n        const u = BigNatModule_toUInt64(BigInteger__get_V(x));\r\n        if (compare(u, fromValue(fromBits(4294967295, 2147483647, false), true)) <= 0) {\r\n            return op_Multiply(fromInteger(BigInteger__get_SignInt(x), false, 2), fromValue(u, false));\r\n        }\r\n        else if ((BigInteger__get_SignInt(x) === -1) ? equals(u, fromValue(op_Addition(fromBits(4294967295, 2147483647, false), fromBits(1, 0, false)), true)) : false) {\r\n            return fromBits(0, 2147483648, false);\r\n        }\r\n        else {\r\n            throw (new Error());\r\n        }\r\n    }\r\n}\r\n\r\nexport function BigInteger__get_ToUInt64(x) {\r\n    if (BigInteger__get_IsZero(x)) {\r\n        return fromBits(0, 0, true);\r\n    }\r\n    else {\r\n        return BigNatModule_toUInt64(BigInteger__get_V(x));\r\n    }\r\n}\r\n\r\nexport function BigInteger__get_ToDouble(x) {\r\n    const matchValue = BigInteger__get_SignInt(x) | 0;\r\n    switch (matchValue) {\r\n        case -1: {\r\n            return -BigNatModule_toFloat(BigInteger__get_V(x));\r\n        }\r\n        case 0: {\r\n            return 0;\r\n        }\r\n        case 1: {\r\n            return BigNatModule_toFloat(BigInteger__get_V(x));\r\n        }\r\n        default: {\r\n            throw (new Error(\"signs should be +/- 1 or 0\\\\nParameter name: x\"));\r\n        }\r\n    }\r\n}\r\n\r\nexport function BigInteger__get_ToSByte(x) {\r\n    return (BigInteger__get_ToInt32(x) + 0x80 & 0xFF) - 0x80;\r\n}\r\n\r\nexport function BigInteger__get_ToByte(x) {\r\n    return BigInteger__get_ToUInt32(x) & 0xFF;\r\n}\r\n\r\nexport function BigInteger__get_ToInt16(x) {\r\n    return (BigInteger__get_ToInt32(x) + 0x8000 & 0xFFFF) - 0x8000;\r\n}\r\n\r\nexport function BigInteger__get_ToUInt16(x) {\r\n    return BigInteger__get_ToUInt32(x) & 0xFFFF;\r\n}\r\n\r\nexport function BigInteger__get_ToSingle(x) {\r\n    return BigInteger__get_ToDouble(x);\r\n}\r\n\r\nexport function BigInteger__get_ToDecimal(x) {\r\n    return new Decimal(BigInteger__get_ToDouble(x));\r\n}\r\n\r\nexport function BigInteger_Parse_Z721C83C5(text) {\r\n    if (text == null) {\r\n        throw (new Error(\"text\"));\r\n    }\r\n    const text_1 = text.trim();\r\n    const len = text_1.length | 0;\r\n    if (len === 0) {\r\n        throw (new Error());\r\n    }\r\n    const matchValue = [text_1[0], len];\r\n    if (matchValue[0] === \"+\") {\r\n        if (matchValue[1] === 1) {\r\n            throw (new Error());\r\n        }\r\n        else {\r\n            return BigInteger_posn_Z67CCE57D(BigNatModule_ofString(text_1.slice(1, (len - 1) + 1)));\r\n        }\r\n    }\r\n    else if (matchValue[0] === \"-\") {\r\n        if (matchValue[1] === 1) {\r\n            throw (new Error());\r\n        }\r\n        else {\r\n            return BigInteger_negn_Z67CCE57D(BigNatModule_ofString(text_1.slice(1, (len - 1) + 1)));\r\n        }\r\n    }\r\n    else {\r\n        return BigInteger_posn_Z67CCE57D(BigNatModule_ofString(text_1));\r\n    }\r\n}\r\n\r\nexport function BigInteger__get_IsSmall(x) {\r\n    if (BigInteger__get_IsZero(x)) {\r\n        return true;\r\n    }\r\n    else {\r\n        return BigNatModule_isSmall(BigInteger__get_V(x));\r\n    }\r\n}\r\n\r\nexport function BigInteger_Factorial_Z665282C2(x) {\r\n    if (BigInteger__get_IsNegative(x)) {\r\n        throw (new Error(\"mustBeNonNegative\\\\nParameter name: x\"));\r\n    }\r\n    if (BigInteger__get_IsPositive(x)) {\r\n        return BigInteger_posn_Z67CCE57D(BigNatModule_factorial(BigInteger__get_V(x)));\r\n    }\r\n    else {\r\n        return BigInteger_get_One();\r\n    }\r\n}\r\n\r\nexport function BigInteger_op_UnaryPlus_Z665282C2(n1) {\r\n    return n1;\r\n}\r\n\r\nexport function BigInteger_FromInt64_Z524259C1(x) {\r\n    return BigInteger_$ctor_Z524259C1(x);\r\n}\r\n\r\nexport function BigInteger_FromInt32_Z524259A4(x) {\r\n    return BigInteger_$ctor_Z524259A4(x);\r\n}\r\n\r\n","import { BigInteger_op_Inequality_56F059C0, BigInteger_op_Equality_56F059C0, BigInteger_op_GreaterThanOrEqual_56F059C0, BigInteger_op_GreaterThan_56F059C0, BigInteger_op_LessThanOrEqual_56F059C0, BigInteger_op_LessThan_56F059C0, BigInteger_op_ExclusiveOr_56F059C0, BigInteger_op_BitwiseOr_56F059C0, BigInteger_op_BitwiseAnd_56F059C0, BigInteger_op_LeftShift_62E082A2, BigInteger_op_RightShift_62E082A2, BigInteger_op_UnaryPlus_Z665282C2, BigInteger_op_UnaryNegation_Z665282C2, BigInteger_op_Modulus_56F059C0, BigInteger_op_Division_56F059C0, BigInteger_op_Multiply_56F059C0, BigInteger_op_Subtraction_56F059C0, BigInteger_op_Addition_56F059C0, BigInteger__get_IsOne, BigInteger__get_IsZero, BigInteger__get_Sign, BigInteger__get_ToDecimal, BigInteger__get_ToDouble, BigInteger__get_ToSingle, BigInteger__get_ToUInt64, BigInteger__get_ToInt64, BigInteger__get_ToUInt32, BigInteger__get_ToInt32, BigInteger__get_ToUInt16, BigInteger__get_ToInt16, BigInteger__get_ToByte, BigInteger__get_ToSByte, BigInteger_$ctor_Z524259A4, BigInteger_$ctor_Z524259C1, BigInteger_get_Two, BigInteger_get_One, BigInteger_get_Zero, BigInteger_Abs_Z665282C2, BigInteger_Pow_62E082A2, BigInteger_GreatestCommonDivisor_56F059C0, BigInteger_DivRem_56F059C0, BigInteger_Parse_Z721C83C5, BigInteger } from \"./BigInt/z.js\";\r\nimport { fromInteger } from \"./Long.js\";\r\nimport { comparePrimitives, min, compare as compare_1, equals as equals_1, safeHash } from \"./Util.js\";\r\nimport { toString as toString_1 } from \"./Types.js\";\r\nimport { fold, empty, ofArrayWithTail, cons, toArray, head, skipWhile } from \"./List.js\";\r\nimport { fill, reverse } from \"./Array.js\";\r\n\r\nexport function isBigInt(x) {\r\n    return x instanceof BigInteger;\r\n}\r\n\r\nexport function tryParse(str, res) {\r\n    try {\r\n        res.contents = BigInteger_Parse_Z721C83C5(str);\r\n        return true;\r\n    }\r\n    catch (matchValue) {\r\n        return false;\r\n    }\r\n}\r\n\r\nexport function divRem(x, y, remainder) {\r\n    const patternInput = BigInteger_DivRem_56F059C0(x, y);\r\n    remainder.contents = patternInput[1];\r\n    return patternInput[0];\r\n}\r\n\r\nexport function parse(arg00) {\r\n    return BigInteger_Parse_Z721C83C5(arg00);\r\n}\r\n\r\nexport function greatestCommonDivisor(arg00, arg01) {\r\n    return BigInteger_GreatestCommonDivisor_56F059C0(arg00, arg01);\r\n}\r\n\r\nexport function pow(arg00, arg01) {\r\n    return BigInteger_Pow_62E082A2(arg00, arg01);\r\n}\r\n\r\nexport function abs(arg00) {\r\n    return BigInteger_Abs_Z665282C2(arg00);\r\n}\r\n\r\nexport const zero = BigInteger_get_Zero();\r\n\r\nexport const one = BigInteger_get_One();\r\n\r\nexport const two = BigInteger_get_Two();\r\n\r\nexport function fromString(s) {\r\n    return BigInteger_Parse_Z721C83C5(s);\r\n}\r\n\r\nexport function fromZero() {\r\n    return BigInteger_get_Zero();\r\n}\r\n\r\nexport function fromOne() {\r\n    return BigInteger_get_One();\r\n}\r\n\r\nexport function fromInt64(i) {\r\n    return BigInteger_$ctor_Z524259C1(i);\r\n}\r\n\r\nexport function fromInt32(i) {\r\n    if (i > 2147483647) {\r\n        return BigInteger_$ctor_Z524259C1(fromInteger(i, false, 6));\r\n    }\r\n    else {\r\n        return BigInteger_$ctor_Z524259A4(i);\r\n    }\r\n}\r\n\r\nexport function toSByte(x) {\r\n    return BigInteger__get_ToSByte(x);\r\n}\r\n\r\nexport function toByte(x) {\r\n    return BigInteger__get_ToByte(x);\r\n}\r\n\r\nexport function toInt16(x) {\r\n    return BigInteger__get_ToInt16(x);\r\n}\r\n\r\nexport function toUInt16(x) {\r\n    return BigInteger__get_ToUInt16(x);\r\n}\r\n\r\nexport function toInt32(x) {\r\n    return BigInteger__get_ToInt32(x);\r\n}\r\n\r\nexport function toUInt32(x) {\r\n    return BigInteger__get_ToUInt32(x);\r\n}\r\n\r\nexport function toInt64(x) {\r\n    return BigInteger__get_ToInt64(x);\r\n}\r\n\r\nexport function toUInt64(x) {\r\n    return BigInteger__get_ToUInt64(x);\r\n}\r\n\r\nexport function toSingle(x) {\r\n    return BigInteger__get_ToSingle(x);\r\n}\r\n\r\nexport function toDouble(x) {\r\n    return BigInteger__get_ToDouble(x);\r\n}\r\n\r\nexport function toDecimal(x) {\r\n    return BigInteger__get_ToDecimal(x);\r\n}\r\n\r\nexport function sign(x) {\r\n    return BigInteger__get_Sign(x);\r\n}\r\n\r\nexport function isZero(x) {\r\n    return BigInteger__get_IsZero(x);\r\n}\r\n\r\nexport function isOne(x) {\r\n    return BigInteger__get_IsOne(x);\r\n}\r\n\r\nexport function hash(x) {\r\n    return safeHash(x);\r\n}\r\n\r\nexport function compare(x, y) {\r\n    return x.CompareTo(y);\r\n}\r\n\r\nexport function equals(x, y) {\r\n    return equals_1(x, y);\r\n}\r\n\r\nexport function toString(x) {\r\n    return toString_1(x);\r\n}\r\n\r\nexport const get_Zero = BigInteger_get_Zero();\r\n\r\nexport const get_One = BigInteger_get_One();\r\n\r\nexport function op_Addition(arg00, arg01) {\r\n    return BigInteger_op_Addition_56F059C0(arg00, arg01);\r\n}\r\n\r\nexport function op_Subtraction(arg00, arg01) {\r\n    return BigInteger_op_Subtraction_56F059C0(arg00, arg01);\r\n}\r\n\r\nexport function op_Multiply(arg00, arg01) {\r\n    return BigInteger_op_Multiply_56F059C0(arg00, arg01);\r\n}\r\n\r\nexport function op_Division(arg00, arg01) {\r\n    return BigInteger_op_Division_56F059C0(arg00, arg01);\r\n}\r\n\r\nexport function op_Modulus(arg00, arg01) {\r\n    return BigInteger_op_Modulus_56F059C0(arg00, arg01);\r\n}\r\n\r\nexport function op_UnaryNegation(arg00) {\r\n    return BigInteger_op_UnaryNegation_Z665282C2(arg00);\r\n}\r\n\r\nexport function op_UnaryPlus(arg00) {\r\n    return BigInteger_op_UnaryPlus_Z665282C2(arg00);\r\n}\r\n\r\nexport function op_RightShift(arg00, arg01) {\r\n    return BigInteger_op_RightShift_62E082A2(arg00, arg01);\r\n}\r\n\r\nexport function op_LeftShift(arg00, arg01) {\r\n    return BigInteger_op_LeftShift_62E082A2(arg00, arg01);\r\n}\r\n\r\nexport function op_BitwiseAnd(arg00, arg01) {\r\n    return BigInteger_op_BitwiseAnd_56F059C0(arg00, arg01);\r\n}\r\n\r\nexport function op_BitwiseOr(arg00, arg01) {\r\n    return BigInteger_op_BitwiseOr_56F059C0(arg00, arg01);\r\n}\r\n\r\nexport function op_ExclusiveOr(arg00, arg01) {\r\n    return BigInteger_op_ExclusiveOr_56F059C0(arg00, arg01);\r\n}\r\n\r\nexport function op_LessThan(arg00, arg01) {\r\n    return BigInteger_op_LessThan_56F059C0(arg00, arg01);\r\n}\r\n\r\nexport function op_LessThanOrEqual(arg00, arg01) {\r\n    return BigInteger_op_LessThanOrEqual_56F059C0(arg00, arg01);\r\n}\r\n\r\nexport function op_GreaterThan(arg00, arg01) {\r\n    return BigInteger_op_GreaterThan_56F059C0(arg00, arg01);\r\n}\r\n\r\nexport function op_GreaterThanOrEqual(arg00, arg01) {\r\n    return BigInteger_op_GreaterThanOrEqual_56F059C0(arg00, arg01);\r\n}\r\n\r\nexport function op_Equality(arg00, arg01) {\r\n    return BigInteger_op_Equality_56F059C0(arg00, arg01);\r\n}\r\n\r\nexport function op_Inequality(arg00, arg01) {\r\n    return BigInteger_op_Inequality_56F059C0(arg00, arg01);\r\n}\r\n\r\nfunction flipTwosComplement(currByte, lowBitFound) {\r\n    const matchValue = [currByte, lowBitFound];\r\n    if (matchValue[1]) {\r\n        return [(currByte ^ 255) & 255, true];\r\n    }\r\n    else if (matchValue[0] === 0) {\r\n        return [0, false];\r\n    }\r\n    else {\r\n        return [(currByte ^ (254 << (new Int32Array([0, 1, 2, 3, 4, 5, 6, 7])).find((i) => ((currByte & (1 << i)) > 0)))) & 255, true];\r\n    }\r\n}\r\n\r\nexport function toByteArray(value) {\r\n    if (equals_1(value, zero)) {\r\n        return new Uint8Array([0]);\r\n    }\r\n    else {\r\n        const isPositive = compare_1(value, zero) > 0;\r\n        const value_1 = isPositive ? value : BigInteger_op_Multiply_56F059C0(BigInteger_$ctor_Z524259A4(-1), value);\r\n        const mask32 = fromInt64(fromInteger(4294967295, false, 6));\r\n        const loop = (accumBytes_mut, consumeValue_mut, lowBitFound_mut) => {\r\n            let value_6, value_8, value_9, value_10;\r\n            loop:\r\n            while (true) {\r\n                const accumBytes = accumBytes_mut, consumeValue = consumeValue_mut, lowBitFound = lowBitFound_mut;\r\n                if (compare_1(consumeValue, zero) <= 0) {\r\n                    const accumBytes_1 = isPositive ? skipWhile((b) => (b === 0), accumBytes) : skipWhile((b_1) => (b_1 === 255), accumBytes);\r\n                    const isHighBitOne = (head(accumBytes_1) & 128) !== 0;\r\n                    return reverse(toArray((isPositive ? isHighBitOne : false) ? cons(0, accumBytes_1) : (((!isPositive) ? (!isHighBitOne) : false) ? cons(255, accumBytes_1) : accumBytes_1)));\r\n                }\r\n                else {\r\n                    const currValue = toUInt32(BigInteger_op_BitwiseAnd_56F059C0(consumeValue, mask32));\r\n                    if (isPositive) {\r\n                        const b0 = currValue & 0xFF;\r\n                        let b1;\r\n                        const value_4 = currValue >>> 8;\r\n                        b1 = (value_4 & 0xFF);\r\n                        let b2;\r\n                        const value_5 = currValue >>> 16;\r\n                        b2 = (value_5 & 0xFF);\r\n                        accumBytes_mut = ofArrayWithTail([(value_6 = (currValue >>> 24), value_6 & 0xFF), b2, b1, b0], accumBytes);\r\n                        consumeValue_mut = BigInteger_op_RightShift_62E082A2(consumeValue, 32);\r\n                        lowBitFound_mut = false;\r\n                        continue loop;\r\n                    }\r\n                    else {\r\n                        const patternInput = flipTwosComplement(currValue & 0xFF, lowBitFound);\r\n                        const patternInput_1 = flipTwosComplement((value_8 = (currValue >>> 8), value_8 & 0xFF), patternInput[1]);\r\n                        const patternInput_2 = flipTwosComplement((value_9 = (currValue >>> 16), value_9 & 0xFF), patternInput_1[1]);\r\n                        const patternInput_3 = flipTwosComplement((value_10 = (currValue >>> 24), value_10 & 0xFF), patternInput_2[1]);\r\n                        accumBytes_mut = ofArrayWithTail([patternInput_3[0], patternInput_2[0], patternInput_1[0], patternInput[0]], accumBytes);\r\n                        consumeValue_mut = BigInteger_op_RightShift_62E082A2(consumeValue, 32);\r\n                        lowBitFound_mut = patternInput_3[1];\r\n                        continue loop;\r\n                    }\r\n                }\r\n                break;\r\n            }\r\n        };\r\n        return loop(empty(), value_1, false);\r\n    }\r\n}\r\n\r\nexport function fromByteArray(bytes) {\r\n    if (bytes == null) {\r\n        throw (new Error(\"bytes\"));\r\n    }\r\n    if (bytes.length === 0) {\r\n        return zero;\r\n    }\r\n    else {\r\n        const isPositive = (bytes[bytes.length - 1] & 128) === 0;\r\n        const buffer = fill(new Uint8Array(4), 0, 4, 0);\r\n        const loop = (accumUInt32_mut, currIndex_mut, bytesRemaining_mut, lowBitFound_mut) => {\r\n            loop:\r\n            while (true) {\r\n                const accumUInt32 = accumUInt32_mut, currIndex = currIndex_mut, bytesRemaining = bytesRemaining_mut, lowBitFound = lowBitFound_mut;\r\n                if (bytesRemaining === 0) {\r\n                    const value_2 = fold((acc, value) => BigInteger_op_Addition_56F059C0(BigInteger_op_LeftShift_62E082A2(acc, 32), fromInt64(fromInteger(value, false, 6))), zero, accumUInt32);\r\n                    if (isPositive) {\r\n                        return value_2;\r\n                    }\r\n                    else {\r\n                        return BigInteger_op_Multiply_56F059C0(BigInteger_$ctor_Z524259A4(-1), value_2);\r\n                    }\r\n                }\r\n                else {\r\n                    const bytesToProcess = min((x, y) => comparePrimitives(x, y), bytesRemaining, 4) | 0;\r\n                    for (let i_1 = 0; i_1 <= (bytesToProcess - 1); i_1++) {\r\n                        buffer[i_1] = bytes[currIndex + i_1];\r\n                    }\r\n                    if (isPositive) {\r\n                        fill(buffer, bytesToProcess, 4 - bytesToProcess, 0);\r\n                        accumUInt32_mut = cons((((((buffer[0] | ((buffer[1] << 8) >>> 0)) >>> 0) | ((buffer[2] << 16) >>> 0)) >>> 0) | ((buffer[3] << 24) >>> 0)) >>> 0, accumUInt32);\r\n                        currIndex_mut = (currIndex + bytesToProcess);\r\n                        bytesRemaining_mut = (bytesRemaining - bytesToProcess);\r\n                        lowBitFound_mut = false;\r\n                        continue loop;\r\n                    }\r\n                    else {\r\n                        fill(buffer, bytesToProcess, 4 - bytesToProcess, 255);\r\n                        const patternInput = flipTwosComplement(buffer[0], lowBitFound);\r\n                        const patternInput_1 = flipTwosComplement(buffer[1], patternInput[1]);\r\n                        const patternInput_2 = flipTwosComplement(buffer[2], patternInput_1[1]);\r\n                        const patternInput_3 = flipTwosComplement(buffer[3], patternInput_2[1]);\r\n                        accumUInt32_mut = cons((((((patternInput[0] | ((patternInput_1[0] << 8) >>> 0)) >>> 0) | ((patternInput_2[0] << 16) >>> 0)) >>> 0) | ((patternInput_3[0] << 24) >>> 0)) >>> 0, accumUInt32);\r\n                        currIndex_mut = (currIndex + bytesToProcess);\r\n                        bytesRemaining_mut = (bytesRemaining - bytesToProcess);\r\n                        lowBitFound_mut = patternInput_3[1];\r\n                        continue loop;\r\n                    }\r\n                }\r\n                break;\r\n            }\r\n        };\r\n        return loop(empty(), 0, bytes.length, false);\r\n    }\r\n}\r\n\r\n","import { equals, toIterator, getEnumerator } from \"./Util.js\";\r\nimport { iterate, map, delay, toArray, iterateIndexed, concat } from \"./Seq.js\";\r\nimport { FSharpRef } from \"./Types.js\";\r\nimport { class_type } from \"./Reflection.js\";\r\nimport { getItemFromDict, tryGetValue } from \"./MapUtil.js\";\r\nimport { format } from \"./String.js\";\r\n\r\nexport class Dictionary {\r\n    constructor(pairs, comparer) {\r\n        const this$ = new FSharpRef(null);\r\n        this.comparer = comparer;\r\n        this$.contents = this;\r\n        this.hashMap = (new Map([]));\r\n        this[\"init@8-1\"] = 1;\r\n        const enumerator = getEnumerator(pairs);\r\n        try {\r\n            while (enumerator[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n                const pair = enumerator[\"System.Collections.Generic.IEnumerator`1.get_Current\"]();\r\n                Dictionary__Add_5BDDA1(this$.contents, pair[0], pair[1]);\r\n            }\r\n        }\r\n        finally {\r\n            enumerator.Dispose();\r\n        }\r\n    }\r\n    get [Symbol.toStringTag]() {\r\n        return \"Dictionary\";\r\n    }\r\n    toJSON(_key) {\r\n        const this$ = this;\r\n        return Array.from(this$);\r\n    }\r\n    [\"System.Collections.IEnumerable.GetEnumerator\"]() {\r\n        const this$ = this;\r\n        return getEnumerator(this$);\r\n    }\r\n    GetEnumerator() {\r\n        const this$ = this;\r\n        return getEnumerator(concat(this$.hashMap.values()));\r\n    }\r\n    [Symbol.iterator]() {\r\n        return toIterator(this.GetEnumerator());\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.Add2B595\"](item) {\r\n        const this$ = this;\r\n        Dictionary__Add_5BDDA1(this$, item[0], item[1]);\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.Clear\"]() {\r\n        const this$ = this;\r\n        Dictionary__Clear(this$);\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.Contains2B595\"](item) {\r\n        const this$ = this;\r\n        const matchValue = Dictionary__TryFind_2B595(this$, item[0]);\r\n        let pattern_matching_result;\r\n        if (matchValue != null) {\r\n            if (equals(matchValue[1], item[1])) {\r\n                pattern_matching_result = 0;\r\n            }\r\n            else {\r\n                pattern_matching_result = 1;\r\n            }\r\n        }\r\n        else {\r\n            pattern_matching_result = 1;\r\n        }\r\n        switch (pattern_matching_result) {\r\n            case 0: {\r\n                return true;\r\n            }\r\n            case 1: {\r\n                return false;\r\n            }\r\n        }\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.CopyToZ2E171D71\"](array, arrayIndex) {\r\n        const this$ = this;\r\n        iterateIndexed((i, e) => {\r\n            array[arrayIndex + i] = e;\r\n        }, this$);\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.get_Count\"]() {\r\n        const this$ = this;\r\n        return Dictionary__get_Count(this$) | 0;\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.get_IsReadOnly\"]() {\r\n        return false;\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.Remove2B595\"](item) {\r\n        const this$ = this;\r\n        const matchValue = Dictionary__TryFind_2B595(this$, item[0]);\r\n        if (matchValue != null) {\r\n            if (equals(matchValue[1], item[1])) {\r\n                void Dictionary__Remove_2B595(this$, item[0]);\r\n            }\r\n            return true;\r\n        }\r\n        else {\r\n            return false;\r\n        }\r\n    }\r\n    [\"System.Collections.Generic.IDictionary`2.Add5BDDA1\"](key, value) {\r\n        const this$ = this;\r\n        Dictionary__Add_5BDDA1(this$, key, value);\r\n    }\r\n    [\"System.Collections.Generic.IDictionary`2.ContainsKey2B595\"](key) {\r\n        const this$ = this;\r\n        return Dictionary__ContainsKey_2B595(this$, key);\r\n    }\r\n    [\"System.Collections.Generic.IDictionary`2.get_Item2B595\"](key) {\r\n        const this$ = this;\r\n        return Dictionary__get_Item_2B595(this$, key);\r\n    }\r\n    [\"System.Collections.Generic.IDictionary`2.set_Item5BDDA1\"](key, v) {\r\n        const this$ = this;\r\n        Dictionary__set_Item_5BDDA1(this$, key, v);\r\n    }\r\n    [\"System.Collections.Generic.IDictionary`2.get_Keys\"]() {\r\n        const this$ = this;\r\n        return toArray(delay(() => map((pair) => pair[0], this$)));\r\n    }\r\n    [\"System.Collections.Generic.IDictionary`2.Remove2B595\"](key) {\r\n        const this$ = this;\r\n        return Dictionary__Remove_2B595(this$, key);\r\n    }\r\n    [\"System.Collections.Generic.IDictionary`2.TryGetValue23A0B95A\"](key, value) {\r\n        const this$ = this;\r\n        const matchValue = Dictionary__TryFind_2B595(this$, key);\r\n        if (matchValue != null) {\r\n            const pair = matchValue;\r\n            value.contents = pair[1];\r\n            return true;\r\n        }\r\n        else {\r\n            return false;\r\n        }\r\n    }\r\n    [\"System.Collections.Generic.IDictionary`2.get_Values\"]() {\r\n        const this$ = this;\r\n        return toArray(delay(() => map((pair) => pair[1], this$)));\r\n    }\r\n    get size() {\r\n        const this$ = this;\r\n        return Dictionary__get_Count(this$) | 0;\r\n    }\r\n    clear() {\r\n        const this$ = this;\r\n        Dictionary__Clear(this$);\r\n    }\r\n    delete(k) {\r\n        const this$ = this;\r\n        return Dictionary__Remove_2B595(this$, k);\r\n    }\r\n    entries() {\r\n        const this$ = this;\r\n        return map((p) => [p[0], p[1]], this$);\r\n    }\r\n    get(k) {\r\n        const this$ = this;\r\n        return Dictionary__get_Item_2B595(this$, k);\r\n    }\r\n    has(k) {\r\n        const this$ = this;\r\n        return Dictionary__ContainsKey_2B595(this$, k);\r\n    }\r\n    keys() {\r\n        const this$ = this;\r\n        return map((p) => p[0], this$);\r\n    }\r\n    set(k, v) {\r\n        const this$ = this;\r\n        Dictionary__set_Item_5BDDA1(this$, k, v);\r\n        return this$;\r\n    }\r\n    values() {\r\n        const this$ = this;\r\n        return map((p) => p[1], this$);\r\n    }\r\n    forEach(f, thisArg) {\r\n        const this$ = this;\r\n        iterate((p) => {\r\n            f(p[1], p[0], this$);\r\n        }, this$);\r\n    }\r\n}\r\n\r\nexport function Dictionary$reflection(gen0, gen1) {\r\n    return class_type(\"Fable.Collections.Dictionary\", [gen0, gen1], Dictionary);\r\n}\r\n\r\nexport function Dictionary_$ctor_6623D9B3(pairs, comparer) {\r\n    return new Dictionary(pairs, comparer);\r\n}\r\n\r\nfunction Dictionary__TryFindIndex_2B595(this$, k) {\r\n    const h = this$.comparer.GetHashCode(k) | 0;\r\n    let matchValue;\r\n    let outArg = null;\r\n    matchValue = [tryGetValue(this$.hashMap, h, new FSharpRef(() => outArg, (v) => {\r\n        outArg = v;\r\n    })), outArg];\r\n    if (matchValue[0]) {\r\n        return [true, h, matchValue[1].findIndex((pair) => this$.comparer.Equals(k, pair[0]))];\r\n    }\r\n    else {\r\n        return [false, h, -1];\r\n    }\r\n}\r\n\r\nexport function Dictionary__TryFind_2B595(this$, k) {\r\n    const matchValue = Dictionary__TryFindIndex_2B595(this$, k);\r\n    let pattern_matching_result;\r\n    if (matchValue[0]) {\r\n        if (matchValue[2] > -1) {\r\n            pattern_matching_result = 0;\r\n        }\r\n        else {\r\n            pattern_matching_result = 1;\r\n        }\r\n    }\r\n    else {\r\n        pattern_matching_result = 1;\r\n    }\r\n    switch (pattern_matching_result) {\r\n        case 0: {\r\n            return getItemFromDict(this$.hashMap, matchValue[1])[matchValue[2]];\r\n        }\r\n        case 1: {\r\n            return void 0;\r\n        }\r\n    }\r\n}\r\n\r\nexport function Dictionary__get_Comparer(this$) {\r\n    return this$.comparer;\r\n}\r\n\r\nexport function Dictionary__Clear(this$) {\r\n    this$.hashMap.clear();\r\n}\r\n\r\nexport function Dictionary__get_Count(this$) {\r\n    let count = 0;\r\n    let enumerator = getEnumerator(this$.hashMap.values());\r\n    try {\r\n        while (enumerator[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n            const pairs = enumerator[\"System.Collections.Generic.IEnumerator`1.get_Current\"]();\r\n            count = ((count + pairs.length) | 0);\r\n        }\r\n    }\r\n    finally {\r\n        enumerator.Dispose();\r\n    }\r\n    return count | 0;\r\n}\r\n\r\nexport function Dictionary__get_Item_2B595(this$, k) {\r\n    const matchValue = Dictionary__TryFind_2B595(this$, k);\r\n    if (matchValue != null) {\r\n        return matchValue[1];\r\n    }\r\n    else {\r\n        throw (new Error(\"The item was not found in collection\"));\r\n    }\r\n}\r\n\r\nexport function Dictionary__set_Item_5BDDA1(this$, k, v) {\r\n    const matchValue = Dictionary__TryFindIndex_2B595(this$, k);\r\n    let pattern_matching_result;\r\n    if (matchValue[0]) {\r\n        if (matchValue[2] > -1) {\r\n            pattern_matching_result = 0;\r\n        }\r\n        else {\r\n            pattern_matching_result = 1;\r\n        }\r\n    }\r\n    else {\r\n        pattern_matching_result = 1;\r\n    }\r\n    switch (pattern_matching_result) {\r\n        case 0: {\r\n            getItemFromDict(this$.hashMap, matchValue[1])[matchValue[2]] = [k, v];\r\n            break;\r\n        }\r\n        case 1: {\r\n            if (matchValue[0]) {\r\n                const value = void (getItemFromDict(this$.hashMap, matchValue[1]).push([k, v]));\r\n            }\r\n            else {\r\n                this$.hashMap.set(matchValue[1], [[k, v]]);\r\n            }\r\n            break;\r\n        }\r\n    }\r\n}\r\n\r\nexport function Dictionary__Add_5BDDA1(this$, k, v) {\r\n    const matchValue = Dictionary__TryFindIndex_2B595(this$, k);\r\n    let pattern_matching_result;\r\n    if (matchValue[0]) {\r\n        if (matchValue[2] > -1) {\r\n            pattern_matching_result = 0;\r\n        }\r\n        else {\r\n            pattern_matching_result = 1;\r\n        }\r\n    }\r\n    else {\r\n        pattern_matching_result = 1;\r\n    }\r\n    switch (pattern_matching_result) {\r\n        case 0: {\r\n            const msg = format(\"An item with the same key has already been added. Key: {0}\", k);\r\n            throw (new Error(msg));\r\n            break;\r\n        }\r\n        case 1: {\r\n            if (matchValue[0]) {\r\n                const value = void (getItemFromDict(this$.hashMap, matchValue[1]).push([k, v]));\r\n            }\r\n            else {\r\n                this$.hashMap.set(matchValue[1], [[k, v]]);\r\n            }\r\n            break;\r\n        }\r\n    }\r\n}\r\n\r\nexport function Dictionary__ContainsKey_2B595(this$, k) {\r\n    const matchValue = Dictionary__TryFindIndex_2B595(this$, k);\r\n    let pattern_matching_result;\r\n    if (matchValue[0]) {\r\n        if (matchValue[2] > -1) {\r\n            pattern_matching_result = 0;\r\n        }\r\n        else {\r\n            pattern_matching_result = 1;\r\n        }\r\n    }\r\n    else {\r\n        pattern_matching_result = 1;\r\n    }\r\n    switch (pattern_matching_result) {\r\n        case 0: {\r\n            return true;\r\n        }\r\n        case 1: {\r\n            return false;\r\n        }\r\n    }\r\n}\r\n\r\nexport function Dictionary__Remove_2B595(this$, k) {\r\n    const matchValue = Dictionary__TryFindIndex_2B595(this$, k);\r\n    let pattern_matching_result;\r\n    if (matchValue[0]) {\r\n        if (matchValue[2] > -1) {\r\n            pattern_matching_result = 0;\r\n        }\r\n        else {\r\n            pattern_matching_result = 1;\r\n        }\r\n    }\r\n    else {\r\n        pattern_matching_result = 1;\r\n    }\r\n    switch (pattern_matching_result) {\r\n        case 0: {\r\n            getItemFromDict(this$.hashMap, matchValue[1]).splice(matchValue[2], 1);\r\n            return true;\r\n        }\r\n        case 1: {\r\n            return false;\r\n        }\r\n    }\r\n}\r\n\r\n","namespace Fable.SimpleJson\r\n\r\nopen System\r\nopen Fable.Core\r\nopen FSharp.Reflection\r\nopen System.Numerics\r\nopen System.Collections\r\nopen System.Collections.Generic\r\nopen Fable.Core.JsInterop\r\n\r\nmodule Node =\r\n\r\n    [<Emit(\"Array.prototype.slice.call(Buffer.from($0, 'base64'))\")>]\r\n    /// Converts Base64 string into a byte array in Node environment\r\n    let bytesFromBase64 (value: string) : byte array = jsNative\r\n\r\nmodule Convert =\r\n    [<Emit(\"new Function(\\\"try {return this===window;}catch(e){ return false;}\\\")\")>]\r\n    let internal isBrowser : unit -> bool = jsNative\r\n\r\n    let insideBrowser = isBrowser()\r\n\r\n    [<Emit \"($0 === undefined)\">]\r\n    let private isUndefined (value: obj) : bool = jsNative\r\n    let private isDefined (value: obj) : bool = not (isUndefined value)\r\n\r\n    /// <summary>Uses internal representation of F# maps to determine whether we are using Fable 3 or not</summary>\r\n    let usingFable3() =\r\n        #if FABLE_COMPILER_3\r\n        true\r\n        #else\r\n        let map = JS.JSON.parse(JS.JSON.stringify (Map.ofList [ 1, 1; 2, 2 ]))\r\n        let tree = get \"tree\" map\r\n        isDefined tree && isDefined (get \"k\" tree) && isDefined (get \"v\" tree) && isDefined (get \"h\" tree)\r\n        #endif\r\n\r\n    let isUsingFable3 = usingFable3()\r\n\r\n    [<Emit(\"typeof WorkerGlobalScope !== 'undefined' && self instanceof WorkerGlobalScope\")>]\r\n    let internal insideWorker :  bool = jsNative\r\n\r\n    [<Emit(\"$0[$1] = $2\")>]\r\n    let internal setProp o k v = jsNative\r\n\r\n    type InternalMap =\r\n        | MapEmpty\r\n        | MapOne of string * Json\r\n        | MapNode of string * Json * InternalMap * InternalMap\r\n\r\n    let rec flattenMap = function\r\n        | MapEmpty -> [ ]\r\n        | MapOne (key, value) -> [ key, value ]\r\n        | MapNode (key, value, left, right) ->\r\n            [ yield! flattenMap left\r\n              yield! flattenMap right\r\n              yield  (key, value) ]\r\n\r\n    let (|KeyValue|_|) key (map: Map<string, Json>) =\r\n        map\r\n        |> Map.tryFind key\r\n        |> Option.map (fun value -> key, value, Map.remove key map)\r\n\r\n    let (|NonArray|_|) = function\r\n        | JArray _ -> None\r\n        | json -> Some json\r\n\r\n    let (|MapEmpty|_|) json =\r\n        match json with\r\n        | JString \"MapEmpty\" -> Some json\r\n        | _ -> None\r\n\r\n    let (|MapKey|_|) = function\r\n        | JNumber number -> Some (string number)\r\n        | JString key -> Some key\r\n        | _ -> None\r\n\r\n    let (|MapOne|_|) = function\r\n        | JArray [ JString \"MapOne\"; MapKey key; value ] -> Some (key, value)\r\n        | _ -> None\r\n\r\n    let (|MapNode|_|) = function\r\n        | JArray [ JString \"MapNode\"; MapKey key; value; left; right; JNumber _  ] ->\r\n            Some (key, value, left, right)\r\n        | _ -> None\r\n\r\n    let rec generateMap json =\r\n        match json with\r\n        | MapEmpty _ -> Some InternalMap.MapEmpty\r\n        | MapOne (key, value) -> Some (InternalMap.MapOne (key, value))\r\n        | MapNode (key, value, left, right) ->\r\n            match generateMap left, generateMap right with\r\n            | Some leftMap, Some rightMap ->\r\n                Some (InternalMap.MapNode(key, value, leftMap, rightMap))\r\n            | _ -> None\r\n        | _ -> None\r\n\r\n    let rec flatteFable3Map (tree: Map<string, Json>) =\r\n        [\r\n            match Map.tryFind \"k\" tree, Map.tryFind \"v\" tree with\r\n            | Some (JString key), Some value -> (key, value)\r\n            | _ -> ()\r\n\r\n            match Map.tryFind \"left\" tree with\r\n            | Some (JObject left) -> yield! flatteFable3Map left\r\n            | _ -> ()\r\n\r\n            match Map.tryFind \"right\" tree with\r\n            | Some (JObject right) -> yield! flatteFable3Map right\r\n            | _ -> ()\r\n        ]\r\n\r\n    let rec flattenFable3Lists (linkedList: Map<string, Json>) =\r\n        [\r\n            match Map.tryFind \"head\" linkedList with\r\n            | Some value -> value\r\n            | None -> ()\r\n\r\n            match Map.tryFind \"tail\" linkedList with\r\n            | Some (JObject tail) -> yield! flattenFable3Lists tail\r\n            | _ -> ()\r\n        ]\r\n\r\n    /// <summary>Returns whether the type information resembles a type of a sequence of elements (including tuples)</summary>\r\n    let arrayLike = function\r\n        | TypeInfo.Array _ -> true\r\n        | TypeInfo.List _ -> true\r\n        | TypeInfo.Seq _ -> true\r\n        | TypeInfo.Tuple _ -> true\r\n        | TypeInfo.Set _ -> true\r\n        | TypeInfo.ResizeArray _ -> true\r\n        | TypeInfo.HashSet _ -> true\r\n        | _ -> false\r\n\r\n    let isRecord = function\r\n        | TypeInfo.Record recordType -> true\r\n        | _ -> false\r\n\r\n    let unionOfRecords = function\r\n        | TypeInfo.Union getCases ->\r\n            let (unionCases, unionType) = getCases()\r\n            unionCases\r\n            |> Seq.forall (fun case -> case.CaseTypes.Length = 1 && isRecord case.CaseTypes.[0])\r\n        | _ ->\r\n            false\r\n\r\n    let optional = function\r\n        | TypeInfo.Option _ -> true\r\n        | _ -> false\r\n\r\n    let isQuoted (input: string) =\r\n        input.StartsWith \"\\\"\" && input.EndsWith \"\\\"\"\r\n\r\n    let betweenQuotes (input: string) = \"\\\"\" + input + \"\\\"\"\r\n\r\n    let removeQuotes (input: string) =\r\n        input.Substring(1, input.Length - 2)\r\n\r\n    let rec fromJsonAs (input: Json) (typeInfo: Fable.SimpleJson.TypeInfo) : obj =\r\n        match input, typeInfo with\r\n        | JNumber value, TypeInfo.Float -> unbox value\r\n        | JString value, TypeInfo.Float when value.ToLower() = \"nan\" -> unbox (Double.NaN)\r\n        | JString value, TypeInfo.Float -> unbox (float value)\r\n        | JNumber value, TypeInfo.Float32 -> unbox (float32 value)\r\n        | JString value, TypeInfo.Float32 when value.ToLower() = \"nan\" -> unbox (Double.NaN)\r\n        | JString value, TypeInfo.Float32 -> unbox (float32 value)\r\n        // reading number as int -> floor it\r\n        | JNumber value, TypeInfo.Int32 -> unbox (JS.Math.floor(value))\r\n        | JBool value, TypeInfo.Bool -> unbox value\r\n        // reading int from string -> parse it\r\n        | JString value, TypeInfo.Int32 -> unbox (int value)\r\n        | JString value, TypeInfo.Char -> unbox (char value)\r\n        | JNumber value, TypeInfo.Char -> unbox (char (unbox<int> value))\r\n        // reading into strings\r\n        | JString value, TypeInfo.String -> unbox value\r\n        | JNumber value, TypeInfo.String -> unbox (string value)\r\n        // decimals\r\n        | JString value, TypeInfo.Decimal -> unbox (decimal value)\r\n        | JNumber value, TypeInfo.Decimal -> unbox (decimal value)\r\n        | JString value, TypeInfo.Short -> unbox (int16 value)\r\n        | JNumber value, TypeInfo.Short -> unbox (int16 value)\r\n        // Unsigned integers\r\n        | JNumber value, TypeInfo.UInt16 -> unbox (uint16 value)\r\n        | JString value, TypeInfo.UInt16 -> unbox (uint16 value)\r\n        | JNumber value, TypeInfo.UInt32 -> unbox (uint32 value)\r\n        | JString value, TypeInfo.UInt32 -> unbox (uint32 value)\r\n        | JNumber value, TypeInfo.UInt64 -> unbox (uint64 value)\r\n        | JString value, TypeInfo.UInt64 -> unbox (uint64 value)\r\n        | JNumber value, TypeInfo.TimeSpan -> unbox (JS.Math.floor value)\r\n        | JString value, TypeInfo.Enum getlElemType ->\r\n            let (underlyingType, originalType) = getlElemType()\r\n            match underlyingType with\r\n            | TypeInfo.Int32 ->\r\n                match Int32.TryParse(value) with\r\n                | true, parsedNumber ->\r\n                    unbox parsedNumber\r\n                | false, _ ->\r\n                    failwithf \"The value '%s' is not valid for enum of type '%s'\" value originalType.Name\r\n            | TypeInfo.Long ->\r\n                match Int64.TryParse(value) with\r\n                | true, parsedNumber ->\r\n                    unbox parsedNumber\r\n                | false, _ ->\r\n                    failwithf \"The value '%s' is not valid for enum of type '%s'\" value originalType.Name\r\n            | other ->\r\n                failwithf \"The value '%s' cannot be converted to enum of type '%s'\" value originalType.Name\r\n        | JNumber value, TypeInfo.Enum getElemType ->\r\n            let (_, originalType) = getElemType()\r\n            unbox value\r\n        // byte[] coming from the server is serialized as base64 string\r\n        // convert it back to the actual byte array\r\n        | JString value, TypeInfo.Array getElemType ->\r\n            let elemType = getElemType()\r\n            match elemType with\r\n            | TypeInfo.Byte ->\r\n                if insideWorker || insideBrowser\r\n                then unbox (Convert.FromBase64String value)\r\n                else unbox (Node.bytesFromBase64 value)\r\n            | otherType -> failwithf \"Cannot convert arbitrary string '%s' to %A\" value otherType\r\n\r\n        // null values for strings are just the null string\r\n        | JNull, TypeInfo.String -> unbox null\r\n        | JNull, TypeInfo.Unit -> unbox ()\r\n        | genericJson, TypeInfo.Object -> unbox (SimpleJson.toPlainObject genericJson)\r\n        // int64 as string -> parse it\r\n        | JString value, TypeInfo.Long -> unbox (int64 value)\r\n        | JString value, TypeInfo.Byte -> unbox (byte value)\r\n        | JNumber value, TypeInfo.Byte -> unbox (byte value)\r\n        | JNumber value, TypeInfo.SByte -> unbox (sbyte value)\r\n        | JString value, TypeInfo.SByte -> unbox (sbyte value)\r\n        // BigInt as string -> parse it\r\n        | JString value, TypeInfo.BigInt -> unbox (BigInteger.Parse value)\r\n        | JNumber value, TypeInfo.BigInt -> unbox (bigint (JS.Math.floor(value)))\r\n        // parse formatted date time\r\n        | JString value, TypeInfo.DateTime -> unbox (DateTime.Parse(value))\r\n        // parse formatted date time offset\r\n        | JString value, TypeInfo.DateTimeOffset -> unbox (DateTimeOffset.Parse(value))\r\n        | JNumber value, TypeInfo.DateTimeOffset ->\r\n            let seconds = int64 (JS.Math.floor(value))\r\n            unbox (DateTimeOffset.FromUnixTimeSeconds seconds)\r\n\r\n        // deserialize union from objects\r\n        // { \"One\": 20 } or {\"One\": [20]} -> One of int\r\n        | JObject values, TypeInfo.Union (getTypes) ->\r\n            let (cases, unionType) = getTypes()\r\n            match Map.toList values with\r\n            | [ caseName, JArray values ] ->\r\n                cases\r\n                |> Array.tryFind (fun case -> case.CaseName = caseName)\r\n                |> function\r\n                    | None ->\r\n                        let caseNames = Array.map (fun case -> sprintf \" '%s' \" case.CaseName) cases\r\n                        let expectedCases = String.concat \", \" caseNames\r\n                        failwithf \"Case %s was not valid for type '%s', expected one of the cases [%s]\" caseName unionType.Name expectedCases\r\n                    | Some foundCase when Array.length foundCase.CaseTypes = 1 && arrayLike foundCase.CaseTypes.[0] ->\r\n                        let deserialized = fromJsonAs (JArray values) foundCase.CaseTypes.[0]\r\n                        FSharpValue.MakeUnion(foundCase.Info, [| deserialized |])\r\n                        |> unbox\r\n                    | Some foundCase when Array.length foundCase.CaseTypes = 1 && optional foundCase.CaseTypes.[0] ->\r\n                        let parsedOptional = unbox (fromJsonAs (JArray values) foundCase.CaseTypes.[0])\r\n                        FSharpValue.MakeUnion(foundCase.Info, [| parsedOptional |])\r\n                        |> unbox\r\n                    | Some foundCase ->\r\n                        if Array.length foundCase.CaseTypes = 1\r\n                            && not (arrayLike foundCase.CaseTypes.[0])\r\n                            && Array.length foundCase.CaseTypes <> List.length values\r\n                        then failwithf \"Expected case '%s' to have %d argument types but the JSON data only contained %d values\" foundCase.CaseName (Array.length foundCase.CaseTypes) (List.length values)\r\n                        let parsedValues =\r\n                            Array.ofList values\r\n                            |> Array.zip foundCase.CaseTypes\r\n                            |> Array.map (fun (valueType, value) -> fromJsonAs value valueType)\r\n                        FSharpValue.MakeUnion(foundCase.Info, parsedValues)\r\n                        |> unbox\r\n            | [ caseName, NonArray json ] ->\r\n                cases\r\n                |> Array.tryFind (fun case -> case.CaseName = caseName)\r\n                |> function\r\n                    | Some ({ CaseName = caseName; Info = caseInfo; CaseTypes = [| caseType |] }) ->\r\n                        FSharpValue.MakeUnion(caseInfo, [| unbox fromJsonAs json caseType |])\r\n                        |> unbox\r\n                    | _ ->\r\n                        let caseNames = Array.map (fun case -> sprintf \" '%s' \" case.CaseName) cases\r\n                        let expectedCases = String.concat \", \" caseNames\r\n                        failwithf \"Case %s was not valid for type '%s', expected one of the cases [%s]\" caseName unionType.Name expectedCases\r\n\r\n            // Specific for Fable 3\r\n            | otherwise when Map.containsKey \"tag\" values && Map.containsKey \"fields\" values && Map.count values = 2 ->\r\n                match Map.tryFind \"tag\" values, Map.tryFind \"fields\" values with\r\n                | Some (JNumber caseIndex), Some (JArray fieldValues) ->\r\n                    let foundCase = cases.[int caseIndex]\r\n                    let values =\r\n                        fieldValues\r\n                        |> Array.ofList\r\n                        |> Array.mapi (fun index value -> fromJsonAs value (foundCase.CaseTypes.[index]))\r\n\r\n                    FSharpValue.MakeUnion(foundCase.Info, values)\r\n                | _ ->\r\n                    failwithf \"Could not deserialize JSON(%s) into type %s\" (SimpleJson.toString (JObject values)) unionType.FullName\r\n\r\n            | otherwise when unionOfRecords typeInfo ->\r\n                let discriminators = [\"__typename\"; \"$typename\"; \"$type\" ]\r\n                let foundDiscriminatorKey =\r\n                    discriminators\r\n                    |> List.tryFind (fun keyword -> Map.containsKey keyword values)\r\n\r\n                match foundDiscriminatorKey with\r\n                | None ->\r\n                    failwithf \"Could not serialize the JSON object into the union of records of type %s because the JSON did not contain a known discriminator. Expected '__typename', '$typeName' or '$type'\" unionType.Name\r\n                | Some discriminatorKey ->\r\n                    let discriminatorValueJson = Map.find discriminatorKey values\r\n                    match discriminatorValueJson with\r\n                    | JString discriminatorValue ->\r\n                        let foundUnionCase =\r\n                            cases\r\n                            |> Seq.tryFind (fun case -> case.CaseName.ToUpperInvariant() = discriminatorValue.ToUpperInvariant())\r\n\r\n                        match foundUnionCase with\r\n                        | None ->\r\n                            failwithf \"Union of records of type '%s' does not have a matching case '%s'\" unionType.Name discriminatorValue\r\n                        | Some case ->\r\n                            // Assuming the case types is [recordType]\r\n                            // one element of types and the first element is a record\r\n                            // as satisfied by the unionOfRecords function\r\n                            let record = unbox (fromJsonAs (JObject values) (case.CaseTypes.[0]))\r\n                            FSharpValue.MakeUnion(case.Info, [| record |])\r\n                    | otherwise ->\r\n                        failwithf \"Union of records of type '%s' cannot be deserialized with the value of the discriminator key is not a string to match against a specific union case\" unionType.Name\r\n            | otherwise ->\r\n                // TODO!!! Better error messages here\r\n                let unexpectedJson = JS.JSON.stringify otherwise\r\n                let expectedType = JS.JSON.stringify cases\r\n                failwithf \"Expected JSON:\\n%s\\nto match the type\\n%s\" unexpectedJson expectedType\r\n        | JNull, TypeInfo.Option _ -> unbox None\r\n        | jsonValue, TypeInfo.Option optionalTypeDelayed when jsonValue <> JNull ->\r\n            let optionalType = optionalTypeDelayed()\r\n            let parsedOptional = unbox (fromJsonAs jsonValue optionalType)\r\n            unbox Some parsedOptional\r\n        | JString value, TypeInfo.Guid _ -> unbox (System.Guid.Parse(value))\r\n        // int64 as a number, convert it to int then to in64\r\n        | JNumber value , TypeInfo.Long _ -> unbox int64 (int value)\r\n        // int64 as the internal representation from Long.js\r\n        // then reconstruct it from the high/low (two integers) components\r\n        | JObject dict, TypeInfo.Long _ ->\r\n            let get key = Map.tryFind key dict\r\n            [ get \"low\"; get \"high\"; get \"unsigned\" ]\r\n            |> List.choose id\r\n            |> function\r\n                | [ JNumber low; JNumber high; JBool _ ] ->\r\n                    let lowBytes = BitConverter.GetBytes(int low)\r\n                    let highBytes = BitConverter.GetBytes(int high)\r\n                    let combinedBytes = Array.concat [ lowBytes; highBytes ]\r\n                    BitConverter.ToInt64(combinedBytes, 0)\r\n                    |> unbox\r\n                | _ -> failwithf \"Unable to construct int64 from object literal { low: int, high: int, unsigned: bool }\"\r\n        // convert a single case string to union\r\n        // \"One\" -> One, here is a special case where the case in quoted inside the string\r\n        | JString caseName, TypeInfo.Union getTypes when isQuoted caseName ->\r\n            let (caseTypes, unionType) = getTypes()\r\n            caseTypes\r\n            |> Array.tryFind (fun case -> case.CaseName = removeQuotes caseName)\r\n            |> function\r\n                | Some ({ Info = caseInfo }) -> unbox (FSharpValue.MakeUnion(caseInfo, [||]))\r\n                | None ->\r\n                    let caseNames = Array.map (fun case -> sprintf \" '%s' \" case.CaseName) caseTypes\r\n                    let expectedCases = String.concat \", \" caseNames\r\n                    failwithf \"Case %s was not valid for type '%s', expected one of the cases [%s]\" caseName unionType.Name expectedCases\r\n        // convert a single case string to union\r\n        // \"One\" -> One\r\n        | JString caseName, TypeInfo.Union getTypes ->\r\n            let (caseTypes, unionType) = getTypes()\r\n            caseTypes\r\n            |> Array.tryFind (fun case -> case.CaseName = caseName)\r\n            |> function\r\n                | Some ({ Info = caseInfo }) -> unbox (FSharpValue.MakeUnion(caseInfo, [||]))\r\n                | None ->\r\n                    let caseNames = Array.map (fun case -> sprintf \" '%s' \" case.CaseName) caseTypes\r\n                    let expectedCases = String.concat \", \" caseNames\r\n                    failwithf \"Case %s was not valid for type '%s', expected one of the cases [%s]\" caseName unionType.Name expectedCases\r\n        | JString serializedRecord, TypeInfo.Record getFields ->\r\n            fromJsonAs (SimpleJson.parse serializedRecord) typeInfo\r\n        // convert unions from arrays\r\n        // [\"One\", 20] -> One of int\r\n        | JArray caseValue, TypeInfo.Union getTypes ->\r\n            let (cases, unionType) = getTypes()\r\n            match caseValue with\r\n            // Union case without values\r\n            | [ JString caseName ] ->\r\n                cases\r\n                |> Array.tryFind (fun case -> case.CaseName = caseName)\r\n                |> function\r\n                    | Some ({ CaseName = caseName; Info = caseInfo; CaseTypes = caseInfoTypes }) ->\r\n                        // single case without values\r\n                        unbox (FSharpValue.MakeUnion(caseInfo, [||]))\r\n                    | None ->\r\n                        let caseNames = Array.map (fun case -> sprintf \" '%s' \" case.CaseName) cases\r\n                        let expectedCases = String.concat \", \" caseNames\r\n                        failwithf \"Case '%s' was not valid for type '%s', expected one of the cases [%s]\" caseName unionType.Name expectedCases\r\n            | JString caseName :: values ->\r\n                cases\r\n                |> Array.tryFind (fun case -> case.CaseName = caseName)\r\n                |> function\r\n                    | None ->\r\n                        let caseNames = Array.map (fun ({ CaseName = name }) -> name) cases\r\n                        let expectedCases = String.concat \", \" caseNames\r\n                        failwithf \"Case %s was not valid, expected one of [%s]\" caseName expectedCases\r\n                    | Some ({ CaseName = foundCaseName; Info = caseInfo; CaseTypes = types }) ->\r\n                        if Array.length types <> List.length values\r\n                        then failwithf \"The number of union case parameters for '%s' is different\" foundCaseName\r\n                        let parsedValues =\r\n                            Array.ofList values\r\n                            |> Array.zip types\r\n                            |> Array.map (fun (valueType, value) -> fromJsonAs value valueType)\r\n                        FSharpValue.MakeUnion(caseInfo, parsedValues)\r\n                        |> unbox\r\n            | otherwise ->\r\n                let unexpectedJson = JS.JSON.stringify otherwise\r\n                let expectedType = JS.JSON.stringify cases\r\n                failwithf \"Expected JSON:\\n%s\\nto match the type\\n%s\" unexpectedJson expectedType\r\n        // Arrays\r\n        | JArray values, TypeInfo.Array elementTypeDelayed ->\r\n            let elementType = elementTypeDelayed()\r\n            values\r\n            |> List.map (fun value -> unbox (fromJsonAs value elementType))\r\n            |> Array.ofList\r\n            |> unbox\r\n        // Lists\r\n        | JArray values, TypeInfo.List elementTypeDelayed ->\r\n            let elementType = elementTypeDelayed()\r\n            values\r\n            |> List.map (fun value -> unbox (fromJsonAs value elementType))\r\n            |> unbox\r\n\r\n        // Specific for Fable 3\r\n        | JObject linkedList, TypeInfo.List elementTypeDelayed ->\r\n            let elementType = elementTypeDelayed()\r\n            let flattenedList = flattenFable3Lists linkedList\r\n            flattenedList\r\n            |> List.map (fun value -> unbox (fromJsonAs value elementType))\r\n            |> unbox\r\n\r\n        | JArray values, TypeInfo.Set elementTypeDelayed ->\r\n            let elementType = elementTypeDelayed()\r\n            values\r\n            |> List.map (fun value -> unbox (fromJsonAs value elementType))\r\n            |> Set.ofList\r\n            |> unbox\r\n\r\n        | JArray values, TypeInfo.Seq elementTypeDelayed ->\r\n            let elementType = elementTypeDelayed()\r\n            let converted = List.map (fun value -> unbox (fromJsonAs value elementType)) values\r\n            unbox converted\r\n        // Tuples, become just arrays\r\n        | JArray array, TypeInfo.Tuple tupleTypesDelayed ->\r\n            let tupleTypes = tupleTypesDelayed()\r\n            array\r\n            |> Array.ofList\r\n            |> Array.zip tupleTypes\r\n            |> Array.map (fun (jsonType, jsonData) -> fromJsonAs jsonData jsonType)\r\n            |> unbox\r\n        // Records\r\n        | JObject dict, TypeInfo.Record getTypes ->\r\n            let fields, recordType = getTypes()\r\n            // Match the JSON object literal keys with their types\r\n            let recordValues =\r\n                let values = Map.toList dict\r\n                fields\r\n                |> Array.map (fun ({ FieldName = fieldName; FieldType = fieldType }) ->\r\n                    values\r\n                    |> List.tryFind (fun (key, value) -> fieldName = key)\r\n                    |> function\r\n                        | Some (key, value) -> unbox (fromJsonAs value fieldType)\r\n                        | None ->\r\n                            match fieldType with\r\n                            // field type is an option of something, just return None\r\n                            | TypeInfo.Option _ -> unbox None\r\n                            | _ ->\r\n                              // field type is required and it doens't exist in the JSON\r\n                              // then generate a nice error message\r\n                              let dictKeys =\r\n                                  Map.toList dict\r\n                                  |> List.map (fst >> sprintf \"'%s'\")\r\n                                  |> String.concat \", \"\r\n                                  |> sprintf \"[ %s ]\"\r\n                              let recordFields =\r\n                                  fields\r\n                                  |> Array.map (fun ({ FieldName = name; FieldType = innerFieldType }) ->\r\n                                      match innerFieldType with\r\n                                      | TypeInfo.Option _ -> sprintf \"optional('%s')\" name\r\n                                      | _ -> sprintf \"required('%s')\" name)\r\n                                  |> String.concat \", \"\r\n                                  |> sprintf \"[ %s ]\"\r\n                              failwithf \"Could not find the required key '%s' in the JSON object literal with keys %s to match with record type '%s' that has fields %s\" fieldName dictKeys recordType.Name recordFields)\r\n            unbox (FSharpValue.MakeRecord(recordType, recordValues))\r\n\r\n        | JArray tuples, TypeInfo.Map getTypes ->\r\n            let (keyType, valueType) = getTypes()\r\n            let pairs =\r\n                [ for keyValuePair in tuples do\r\n                    let tuple = fromJsonAs keyValuePair (TypeInfo.Tuple (let a = [| keyType; valueType |] in fun () -> a))\r\n                    yield tuple ]\r\n            match keyType with\r\n            | TypeInfo.Int32\r\n            | TypeInfo.String\r\n            | TypeInfo.Bool ->\r\n                pairs\r\n                |> unbox<(string * obj) list>\r\n                |> Map.ofList\r\n                |> unbox\r\n            | _ ->\r\n                pairs\r\n                |> unbox<(IStructuralComparable * obj) list>\r\n                |> Map.ofList\r\n                |> unbox\r\n\r\n        | JArray tuples, TypeInfo.Dictionary getTypes ->\r\n            let (keyType, valueType, originalType) = getTypes()\r\n            let pairs =\r\n                [ for keyValuePair in tuples do\r\n                    let tuple = fromJsonAs keyValuePair (TypeInfo.Tuple (fun () -> [| keyType; valueType |]))\r\n                    yield tuple ]\r\n\r\n            let output =\r\n                match keyType with\r\n                | TypeInfo.Union _ ->  Dictionary<Result<_, _>, _>()\r\n                | TypeInfo.Record _ -> Dictionary<{| dummy: int |}, _>() |> unbox\r\n                | _ -> Dictionary<IStructuralComparable, _>() |> unbox\r\n\r\n            for (key, value) in (unbox<(IStructuralComparable * obj) list> pairs) do output.Add(unbox key, value)\r\n            unbox output\r\n\r\n        | JObject dict, TypeInfo.Dictionary getTypes ->\r\n            let (keyType, valueType, originalType) = getTypes()\r\n            dict\r\n            |> Map.toList\r\n            |> List.map (fun (key, value) -> fromJsonAs (JString key) keyType, fromJsonAs value valueType )\r\n            |> fun pairs ->\r\n                let output =\r\n                    match keyType with\r\n                    | TypeInfo.Union _ -> Dictionary<Result<_, _>, _>()\r\n                    | TypeInfo.Record _ -> Dictionary<{| dummy: int |}, _>() |> unbox\r\n                    | _ -> Dictionary<IStructuralComparable, _>() |> unbox\r\n\r\n                for (key, value) in pairs do output.Add(unbox key, value)\r\n\r\n                unbox output\r\n\r\n        | JArray items, TypeInfo.HashSet getType ->\r\n            let elemType = getType()\r\n            let hashset =\r\n                match elemType with\r\n                | TypeInfo.Union _ -> HashSet<Result<_, _>>()\r\n                | TypeInfo.Record _ -> HashSet<{| dummy: int |}>() |> unbox\r\n                | _ -> HashSet<IStructuralComparable>() |> unbox\r\n\r\n            for item in items do\r\n                let deserialized = fromJsonAs item elemType\r\n                hashset.Add(unbox deserialized) |> ignore\r\n\r\n            unbox hashset\r\n\r\n        | JObject map, TypeInfo.Map getTypes ->\r\n            let (keyType, valueType) = getTypes()\r\n            // check whether the map is serialized to it's internal representation\r\n            // and convert that to back to a normal map from the data\r\n            match Map.tryFind \"comparer\" map, Map.tryFind \"tree\" map with\r\n            | Some (JObject comparer), Some (JArray tree) when Map.isEmpty comparer ->\r\n                match generateMap (JArray tree) with\r\n                | Some internalMap ->\r\n                    let pairs =\r\n                        flattenMap internalMap\r\n                        |> List.map (fun (key, value) ->\r\n                            let nextKey =\r\n                                if not (isQuoted key)\r\n                                then unbox (fromJsonAs (JString key) keyType)\r\n                                else unbox (fromJsonAs (SimpleJson.parseNative key) keyType)\r\n                            let nextValue = unbox (fromJsonAs value valueType)\r\n                            unbox<obj> nextKey, nextValue)\r\n                    match keyType with\r\n                    | TypeInfo.Int32\r\n                    | TypeInfo.String\r\n                    | TypeInfo.Bool ->\r\n                        pairs\r\n                        |> unbox<(string * obj) list>\r\n                        |> Map.ofList\r\n                        |> unbox\r\n                    | _ ->\r\n                        pairs\r\n                        |> unbox<(IStructuralComparable * obj) list>\r\n                        |> Map.ofList\r\n                        |> unbox\r\n\r\n                | None ->\r\n                    let inputJson = SimpleJson.toString (JArray tree)\r\n                    failwithf \"Could not generate map from JSON\\n %s\" inputJson\r\n\r\n            // Specific for Fable 3\r\n            | Some (JObject comparer), Some (JObject tree) when Map.isEmpty comparer ->\r\n                let flattenedMap = Map.ofList (flatteFable3Map tree)\r\n                fromJsonAs (JObject flattenedMap) typeInfo\r\n            | _ ->\r\n                // if comparer and tree are not present,\r\n                // assume we are parsing Fable 1 object literal\r\n                // and converting that to map\r\n                let pairs =\r\n                    map\r\n                    |> Map.toList\r\n                    |> List.map (fun (key, value) ->\r\n                        let nextKey =\r\n                            if not (isQuoted key)\r\n                            then\r\n                                if Converter.isPrimitive keyType || Converter.enumUnion keyType\r\n                                then\r\n                                    // for primitive type, just read them as string and parse\r\n                                    unbox (fromJsonAs (JString key) keyType)\r\n                                else\r\n                                    // server-side JSON can still be complex (for complex types)\r\n                                    // but doesn't have to be quoted, parse again here\r\n                                    unbox (fromJsonAs (SimpleJson.parseNative key) keyType)\r\n                            else\r\n                                unbox (fromJsonAs (SimpleJson.parseNative key) keyType)\r\n                        let nextValue = unbox (fromJsonAs value valueType)\r\n                        unbox<string> nextKey, nextValue)\r\n\r\n                match keyType with\r\n                | TypeInfo.Int32\r\n                | TypeInfo.String\r\n                | TypeInfo.Bool ->\r\n                    pairs\r\n                    |> unbox<(string * obj) list>\r\n                    |> Map.ofList\r\n                    |> unbox\r\n                | _ ->\r\n                    pairs\r\n                    |> unbox<(IStructuralComparable * obj) list>\r\n                    |> Map.ofList\r\n                    |> unbox\r\n        | _, TypeInfo.Any getType ->\r\n            let unknownType = getType()\r\n            failwithf \"Cannot convert %s to %s\" (SimpleJson.toString input) unknownType.FullName\r\n        | _ ->\r\n            failwithf \"Cannot convert %s to %s\" (SimpleJson.toString input) (JS.JSON.stringify typeInfo)\r\n\r\n    let fromJson<'t> json typeInfo =\r\n        unbox<'t> (fromJsonAs json typeInfo)\r\n\r\n    let quoteText (inputText: string) : string = importDefault \"./quote.js\"\r\n\r\n    let rec serialize value (typeInfo: TypeInfo) =\r\n        match typeInfo with\r\n        | TypeInfo.String ->\r\n            let content = unbox<string> value\r\n            if isNull content\r\n            then \"null\"\r\n            else quoteText content\r\n        | TypeInfo.Unit -> \"null\"\r\n        | TypeInfo.Float\r\n        | TypeInfo.Float32 ->\r\n            if Double.IsNaN(unbox value)\r\n            then quoteText \"NaN\"\r\n            else string (unbox<double> value)\r\n        | TypeInfo.Char -> quoteText (string (unbox<char> value))\r\n        | TypeInfo.Byte\r\n        | TypeInfo.SByte\r\n        | TypeInfo.UInt16\r\n        | TypeInfo.UInt32\r\n        | TypeInfo.Short\r\n        | TypeInfo.Enum _\r\n        | TypeInfo.TimeSpan\r\n        | TypeInfo.Int32 -> string (unbox<int> value)\r\n        | TypeInfo.UInt64\r\n        | TypeInfo.Long -> betweenQuotes (string (unbox<int64> value))\r\n        | TypeInfo.BigInt -> betweenQuotes (string (unbox<bigint> value))\r\n        | TypeInfo.Decimal -> betweenQuotes (string (unbox<decimal> value))\r\n        | TypeInfo.Bool -> if unbox<bool> value then \"true\" else \"false\"\r\n        | TypeInfo.Guid -> betweenQuotes ((unbox<Guid> value).ToString())\r\n        | TypeInfo.DateTime -> betweenQuotes ((unbox<DateTime> value).ToString(\"O\"))\r\n        | TypeInfo.DateTimeOffset -> betweenQuotes ((unbox<DateTimeOffset> value).ToString(\"O\"))\r\n        | TypeInfo.Record getFields ->\r\n            let (fieldTypes, recordType) = getFields()\r\n            let serializedFields =\r\n                fieldTypes\r\n                |> Array.map (fun field ->\r\n                    let fieldValue = FSharpValue.GetRecordField(value, field.PropertyInfo)\r\n                    sprintf \"\\\"%s\\\": %s\" field.FieldName (serialize fieldValue field.FieldType)\r\n                )\r\n\r\n            \"{\" + String.concat \", \" serializedFields + \"}\"\r\n\r\n        | TypeInfo.ResizeArray getElementType ->\r\n            let elementType = getElementType()\r\n            let values =\r\n                value\r\n                |> unbox<ResizeArray<obj>>\r\n                |> Seq.map (fun element -> serialize element elementType)\r\n                |> String.concat \", \"\r\n\r\n            \"[\" + values + \"]\"\r\n\r\n        | TypeInfo.HashSet getElementType ->\r\n            let elementType = getElementType()\r\n            let values =\r\n                value\r\n                |> unbox<HashSet<obj>>\r\n                |> Seq.map (fun element -> serialize element elementType)\r\n                |> String.concat \", \"\r\n\r\n            \"[\" + values + \"]\"\r\n\r\n        | TypeInfo.Set getElementType ->\r\n            let elementType = getElementType()\r\n            let values =\r\n                value\r\n                |> unbox<Set<IComparable>>\r\n                |> Seq.map (fun element -> serialize element elementType)\r\n                |> String.concat \", \"\r\n\r\n            \"[\" + values + \"]\"\r\n\r\n        | TypeInfo.Array getElementType ->\r\n            let elementType = getElementType()\r\n            let values =\r\n                value\r\n                |> unbox<obj []>\r\n                |> Array.map (fun element -> serialize element elementType)\r\n                |> String.concat \", \"\r\n\r\n            \"[\" + values + \"]\"\r\n\r\n        | TypeInfo.List getElementType ->\r\n            let elementType = getElementType()\r\n            let values =\r\n                value\r\n                |> unbox<obj list>\r\n                |> List.map (fun element -> serialize element elementType)\r\n                |> String.concat \", \"\r\n\r\n            \"[\" + values + \"]\"\r\n\r\n        | TypeInfo.Seq getElementType ->\r\n            let elementType = getElementType()\r\n            let values =\r\n                value\r\n                |> unbox<obj seq>\r\n                |> Seq.toArray\r\n                |> Array.map (fun element -> serialize element elementType)\r\n                |> String.concat \", \"\r\n\r\n            \"[\" + values + \"]\"\r\n\r\n        | TypeInfo.Option getElementType ->\r\n            match unbox<obj option> value with\r\n            | None -> \"null\"\r\n            | Some existingValue -> serialize existingValue (getElementType())\r\n\r\n        | TypeInfo.Union getCases ->\r\n            let (unionCases, unionType) = getCases()\r\n            let (usedCase, fields) = FSharpValue.GetUnionFields(value, unionType)\r\n            let caseTypes =\r\n                unionCases\r\n                |> Array.find (fun case -> case.CaseName = usedCase.Name)\r\n                |> fun case -> case.CaseTypes\r\n\r\n            if enumUnion typeInfo || Array.isEmpty caseTypes then\r\n                betweenQuotes usedCase.Name\r\n            elif caseTypes.Length = 1 then\r\n                \"{\" + betweenQuotes usedCase.Name + \": \" + serialize fields.[0] caseTypes.[0] + \"}\"\r\n            else\r\n                let serializedFields =\r\n                    caseTypes\r\n                    |> Array.mapi (fun index caseType -> serialize fields.[index] caseType)\r\n                    |> String.concat \", \"\r\n\r\n                \"{\" + betweenQuotes usedCase.Name + \": \" + \"[\" + serializedFields + \"] }\"\r\n\r\n        | TypeInfo.Map getPairTypes ->\r\n            let (keyType, valueType) = getPairTypes()\r\n\r\n            let serializedValues =\r\n                value\r\n                |> unbox<Map<IComparable, obj>>\r\n                |> Map.toArray\r\n                |> Array.map (fun (key, value) ->\r\n                    let serializedKey = serialize key keyType\r\n                    let serializedValue = serialize value valueType\r\n\r\n                    if isPrimitive keyType || enumUnion keyType then\r\n                        if not (isQuoted serializedKey)\r\n                        then (quoteText serializedKey) + \": \" + serializedValue\r\n                        else serializedKey + \": \" + serializedValue\r\n                    else\r\n                        \"[\" + serializedKey + \", \" + serializedValue + \"]\"\r\n                )\r\n                |> String.concat \", \"\r\n\r\n            if isPrimitive keyType || enumUnion keyType\r\n            then \"{\" + serializedValues + \"}\"\r\n            else \"[\" + serializedValues + \"]\"\r\n\r\n        | TypeInfo.Dictionary getPairTypes ->\r\n            let (keyType, valueType, originalType) = getPairTypes()\r\n            let serializedValues =\r\n                value\r\n                |> unbox<Dictionary<IComparable, obj>>\r\n                |> Seq.map (fun pair ->\r\n                    let (key, value) = pair.Key, pair.Value\r\n                    let serializedKey = serialize key keyType\r\n                    let serializedValue = serialize value valueType\r\n\r\n                    if isPrimitive keyType || enumUnion keyType then\r\n                        if not (isQuoted serializedKey)\r\n                        then (betweenQuotes serializedKey) + \": \" + serializedValue\r\n                        else serializedKey + \": \" + serializedValue\r\n                    else\r\n                        \"[\" + serializedKey + \", \" + serializedValue + \"]\"\r\n                )\r\n                |> String.concat \", \"\r\n\r\n            if isPrimitive keyType || enumUnion keyType\r\n            then \"{\" + serializedValues + \"}\"\r\n            else \"[\" + serializedValues + \"]\"\r\n\r\n        | TypeInfo.Tuple getTupleTypes ->\r\n            let tupleTypes = getTupleTypes()\r\n\r\n            if tupleTypes.Length = 1 then\r\n                \"[\" + serialize value tupleTypes.[0] + \"]\"\r\n            else\r\n                let serializedValues =\r\n                    value\r\n                    |> unbox<obj array>\r\n                    |> Array.mapi (fun index element -> serialize element tupleTypes.[index])\r\n                    |> String.concat \", \"\r\n\r\n                \"[\" + serializedValues + \"]\"\r\n\r\n        | TypeInfo.Object ->\r\n            SimpleJson.stringify value\r\n\r\n        | TypeInfo.Any getType ->\r\n            // fallback to low-level serialization\r\n            SimpleJson.stringify value\r\n\r\n        | _ ->\r\n            \"null\"\r\n\r\n[<AutoOpenAttribute>]\r\nmodule ConverterExtensions =\r\n    type Json with\r\n\r\n        /// <summary>\r\n        /// Serialized the input value object into JSON, uses built-in JSON.stringify and should be used with Fable 2.x or earlier\r\n        /// </summary>\r\n        static member stringify (value: obj) : string =\r\n            if Convert.isUsingFable3\r\n            then JS.console.warn(\"It looks like you using the function Json.stringify from Fable.SimpleJson while also using Fable 3 (nagareyama). Please use Json.serialize instead which supports both Fable 3 and Fable 2.x\")\r\n            SimpleJson.stringify value\r\n\r\n        /// <summary>\r\n        /// Serialized the input value into JSON using Reflection. Compatible with Fable 2.x and Fable 3 (codename: nagareyama)\r\n        /// </summary>\r\n        static member inline serialize<'t> (value: 't) : string =\r\n            let typeInfo = TypeInfo.createFrom<'t>()\r\n            Convert.serialize value typeInfo\r\n\r\n        /// Parses the input string as JSON and tries to convert it as the given type argument\r\n        static member inline parseAs<'t> (input: string) : 't =\r\n            match SimpleJson.tryParse input with\r\n            | None -> failwith \"Couldn't parse the input JSON string because it seems to be invalid\"\r\n            | Some inputJson ->\r\n                let typeInfo = TypeInfo.createFrom<'t> ()\r\n                Convert.fromJson<'t> inputJson typeInfo\r\n\r\n        /// Parses the input string as JSON using native parsing and tries to convert it as the given type argument\r\n        static member inline parseNativeAs<'t> (input: string) : 't =\r\n            let inputJson = SimpleJson.parseNative input\r\n            let typeInfo = TypeInfo.createFrom<'t> ()\r\n            Convert.fromJson<'t> inputJson typeInfo\r\n\r\n        /// Tries to parse the input string as JSON and tries to convert it as the given type argument, returing a (hopefully) useful error message when it fails\r\n        static member inline tryParseAs<'t> (input: string) : Result<'t, string> =\r\n            try Ok (Json.parseAs<'t> input)\r\n            with | ex -> Error ex.Message\r\n\r\n        /// Tries to parse the input string as JSON using native parsing and tries to convert it as the given type argument\r\n        static member inline tryParseNativeAs<'t> (input: string) : Result<'t, string> =\r\n            try Ok (Json.parseNativeAs<'t> input)\r\n            with | ex -> Error ex.Message\r\n\r\n        /// Tries to convert parsed JSON object as the given type parameter argument, this method is used when you want to apply transformations to the JSON object before parsing\r\n        static member inline convertFromJsonAs<'t> (input: Json) : 't =\r\n            let typeInfo = TypeInfo.createFrom<'t> ()\r\n            Convert.fromJson<'t> input typeInfo\r\n\r\n        /// Tries to convert parsed JSON object as the given type parameter argument, this method is used when you want to apply transformations to the JSON object before parsing\r\n        static member inline tryConvertFromJsonAs<'t> (input: Json) : Result<'t, string> =\r\n            try Ok (Json.convertFromJsonAs<'t> input)\r\n            with | ex -> Error ex.Message\r\n","/**\n * DateTimeOffset functions.\n *\n * Note: DateOffset instances are always DateObjects in local\n * timezone (because JS dates are all kinds of messed up).\n * A local date returns UTC epoc when `.getTime()` is called.\n *\n * However, this means that in order to construct an UTC date\n * from a DateOffset with offset of +5 hours, you first need\n * to subtract those 5 hours, than add the \"local\" offset.\n * As said, all kinds of messed up.\n *\n * Basically; invariant: date.getTime() always return UTC time.\n */\nimport { create as createDate, dateOffsetToString, daysInMonth, offsetRegex, parseRaw } from \"./Date.js\";\nimport { fromValue, ticksToUnixEpochMilliseconds, unixEpochMillisecondsToTicks } from \"./Long.js\";\nimport { compareDates, padWithZeros } from \"./Util.js\";\nexport default function DateTimeOffset(value, offset) {\n    checkOffsetInRange(offset);\n    const d = new Date(value);\n    d.offset = offset != null ? offset : new Date().getTimezoneOffset() * -60000;\n    return d;\n}\nfunction checkOffsetInRange(offset) {\n    if (offset != null && offset !== 0) {\n        if (offset % 60000 !== 0) {\n            throw new Error(\"Offset must be specified in whole minutes.\");\n        }\n        if (Math.abs(offset / 3600000) > 14) {\n            throw new Error(\"Offset must be within plus or minus 14 hours.\");\n        }\n    }\n}\nexport function fromDate(date, offset) {\n    let offset2 = 0;\n    switch (date.kind) {\n        case 1 /* UTC */:\n            if (offset != null && offset !== 0) {\n                throw new Error(\"The UTC Offset for Utc DateTime instances must be 0.\");\n            }\n            offset2 = 0;\n            break;\n        case 2 /* Local */:\n            offset2 = date.getTimezoneOffset() * -60000;\n            if (offset != null && offset !== offset2) {\n                throw new Error(\"The UTC Offset of the local dateTime parameter does not match the offset argument.\");\n            }\n            break;\n        case 0 /* Unspecified */:\n        default:\n            if (offset == null) {\n                offset2 = date.getTimezoneOffset() * -60000;\n            }\n            else {\n                offset2 = offset;\n            }\n            break;\n    }\n    return DateTimeOffset(date.getTime(), offset2);\n}\nexport function fromTicks(ticks, offset) {\n    ticks = fromValue(ticks);\n    const epoc = ticksToUnixEpochMilliseconds(ticks) - offset;\n    return DateTimeOffset(epoc, offset);\n}\nexport function getUtcTicks(date) {\n    return unixEpochMillisecondsToTicks(date.getTime(), 0);\n}\nexport function minValue() {\n    // This is \"0001-01-01T00:00:00.000Z\", actual JS min value is -8640000000000000\n    return DateTimeOffset(-62135596800000, 0);\n}\nexport function maxValue() {\n    // This is \"9999-12-31T23:59:59.999Z\", actual JS max value is 8640000000000000\n    return DateTimeOffset(253402300799999, 0);\n}\nexport function parse(str) {\n    const date = parseRaw(str);\n    const offsetMatch = offsetRegex.exec(str);\n    const offset = offsetMatch == null\n        ? date.getTimezoneOffset() * -60000\n        : (offsetMatch[0] === \"Z\"\n            ? 0\n            : parseInt(offsetMatch[1], 10) * 3600000\n                + parseInt(offsetMatch[2], 10) * 60000);\n    return DateTimeOffset(date.getTime(), offset);\n}\nexport function tryParse(v, defValue) {\n    try {\n        defValue.contents = parse(v);\n        return true;\n    }\n    catch (_err) {\n        return false;\n    }\n}\nexport function create(year, month, day, h, m, s, ms, offset) {\n    if (offset == null) {\n        offset = ms;\n        ms = 0;\n    }\n    checkOffsetInRange(offset);\n    let date;\n    if (offset === 0) {\n        date = new Date(Date.UTC(year, month - 1, day, h, m, s, ms));\n        if (year <= 99) {\n            date.setFullYear(year, month - 1, day);\n        }\n    }\n    else {\n        const str = padWithZeros(year, 4) + \"-\" +\n            padWithZeros(month, 2) + \"-\" +\n            padWithZeros(day, 2) + \"T\" +\n            padWithZeros(h, 2) + \":\" +\n            padWithZeros(m, 2) + \":\" +\n            padWithZeros(s, 2) + \".\" +\n            padWithZeros(ms, 3) +\n            dateOffsetToString(offset);\n        date = new Date(str);\n    }\n    const dateValue = date.getTime();\n    if (isNaN(dateValue)) {\n        throw new Error(\"The parameters describe an unrepresentable Date\");\n    }\n    return DateTimeOffset(dateValue, offset);\n}\nexport function now() {\n    const date = new Date();\n    const offset = date.getTimezoneOffset() * -60000;\n    return DateTimeOffset(date.getTime(), offset);\n}\nexport function utcNow() {\n    const date = now();\n    return DateTimeOffset(date.getTime(), 0);\n}\nexport function toUniversalTime(date) {\n    return DateTimeOffset(date.getTime(), 0);\n}\nexport function toLocalTime(date) {\n    return DateTimeOffset(date.getTime(), date.getTimezoneOffset() * -60000);\n}\nexport function timeOfDay(d) {\n    var _a;\n    const d2 = new Date(d.getTime() + ((_a = d.offset) !== null && _a !== void 0 ? _a : 0));\n    return d2.getUTCHours() * 3600000\n        + d2.getUTCMinutes() * 60000\n        + d2.getUTCSeconds() * 1000\n        + d2.getUTCMilliseconds();\n}\nexport function date(d) {\n    var _a;\n    const d2 = new Date(d.getTime() + ((_a = d.offset) !== null && _a !== void 0 ? _a : 0));\n    return createDate(d2.getUTCFullYear(), d2.getUTCMonth() + 1, d2.getUTCDate(), 0, 0, 0, 0);\n}\nexport function day(d) {\n    var _a;\n    return new Date(d.getTime() + ((_a = d.offset) !== null && _a !== void 0 ? _a : 0)).getUTCDate();\n}\nexport function hour(d) {\n    var _a;\n    return new Date(d.getTime() + ((_a = d.offset) !== null && _a !== void 0 ? _a : 0)).getUTCHours();\n}\nexport function millisecond(d) {\n    var _a;\n    return new Date(d.getTime() + ((_a = d.offset) !== null && _a !== void 0 ? _a : 0)).getUTCMilliseconds();\n}\nexport function minute(d) {\n    var _a;\n    return new Date(d.getTime() + ((_a = d.offset) !== null && _a !== void 0 ? _a : 0)).getUTCMinutes();\n}\nexport function month(d) {\n    var _a;\n    return new Date(d.getTime() + ((_a = d.offset) !== null && _a !== void 0 ? _a : 0)).getUTCMonth() + 1;\n}\nexport function second(d) {\n    var _a;\n    return new Date(d.getTime() + ((_a = d.offset) !== null && _a !== void 0 ? _a : 0)).getUTCSeconds();\n}\nexport function year(d) {\n    var _a;\n    return new Date(d.getTime() + ((_a = d.offset) !== null && _a !== void 0 ? _a : 0)).getUTCFullYear();\n}\nexport function dayOfWeek(d) {\n    var _a;\n    return new Date(d.getTime() + ((_a = d.offset) !== null && _a !== void 0 ? _a : 0)).getUTCDay();\n}\nexport function dayOfYear(d) {\n    var _a;\n    const d2 = new Date(d.getTime() + ((_a = d.offset) !== null && _a !== void 0 ? _a : 0));\n    const _year = d2.getUTCFullYear();\n    const _month = d2.getUTCMonth() + 1;\n    let _day = d2.getUTCDate();\n    for (let i = 1; i < _month; i++) {\n        _day += daysInMonth(_year, i);\n    }\n    return _day;\n}\nexport function add(d, ts) {\n    var _a;\n    return DateTimeOffset(d.getTime() + ts, ((_a = d.offset) !== null && _a !== void 0 ? _a : 0));\n}\nexport function addDays(d, v) {\n    var _a;\n    return DateTimeOffset(d.getTime() + v * 86400000, ((_a = d.offset) !== null && _a !== void 0 ? _a : 0));\n}\nexport function addHours(d, v) {\n    var _a;\n    return DateTimeOffset(d.getTime() + v * 3600000, ((_a = d.offset) !== null && _a !== void 0 ? _a : 0));\n}\nexport function addMinutes(d, v) {\n    var _a;\n    return DateTimeOffset(d.getTime() + v * 60000, ((_a = d.offset) !== null && _a !== void 0 ? _a : 0));\n}\nexport function addSeconds(d, v) {\n    var _a;\n    return DateTimeOffset(d.getTime() + v * 1000, ((_a = d.offset) !== null && _a !== void 0 ? _a : 0));\n}\nexport function addMilliseconds(d, v) {\n    var _a;\n    return DateTimeOffset(d.getTime() + v, ((_a = d.offset) !== null && _a !== void 0 ? _a : 0));\n}\nexport function addYears(d, v) {\n    var _a;\n    const newMonth = d.getUTCMonth() + 1;\n    const newYear = d.getUTCFullYear() + v;\n    const _daysInMonth = daysInMonth(newYear, newMonth);\n    const newDay = Math.min(_daysInMonth, d.getUTCDate());\n    return create(newYear, newMonth, newDay, d.getUTCHours(), d.getUTCMinutes(), d.getUTCSeconds(), d.getUTCMilliseconds(), ((_a = d.offset) !== null && _a !== void 0 ? _a : 0));\n}\nexport function addMonths(d, v) {\n    var _a, _b;\n    const d2 = new Date(d.getTime() + ((_a = d.offset) !== null && _a !== void 0 ? _a : 0));\n    let newMonth = d2.getUTCMonth() + 1 + v;\n    let newMonth_ = 0;\n    let yearOffset = 0;\n    if (newMonth > 12) {\n        newMonth_ = newMonth % 12;\n        yearOffset = Math.floor(newMonth / 12);\n        newMonth = newMonth_;\n    }\n    else if (newMonth < 1) {\n        newMonth_ = 12 + newMonth % 12;\n        yearOffset = Math.floor(newMonth / 12) + (newMonth_ === 12 ? -1 : 0);\n        newMonth = newMonth_;\n    }\n    const newYear = d2.getUTCFullYear() + yearOffset;\n    const _daysInMonth = daysInMonth(newYear, newMonth);\n    const newDay = Math.min(_daysInMonth, d2.getUTCDate());\n    return create(newYear, newMonth, newDay, d2.getUTCHours(), d2.getUTCMinutes(), d2.getUTCSeconds(), d2.getUTCMilliseconds(), ((_b = d.offset) !== null && _b !== void 0 ? _b : 0));\n}\nexport function subtract(d, that) {\n    var _a;\n    return typeof that === \"number\"\n        ? DateTimeOffset(d.getTime() - that, ((_a = d.offset) !== null && _a !== void 0 ? _a : 0))\n        : d.getTime() - that.getTime();\n}\nexport function equals(d1, d2) {\n    return d1.getTime() === d2.getTime();\n}\nexport function equalsExact(d1, d2) {\n    return d1.getTime() === d2.getTime() && d1.offset === d2.offset;\n}\nexport function compare(d1, d2) {\n    return compareDates(d1, d2);\n}\nexport const compareTo = compare;\nexport function op_Addition(x, y) {\n    return add(x, y);\n}\nexport function op_Subtraction(x, y) {\n    return subtract(x, y);\n}\nexport function toOffset(d, offset) {\n    return DateTimeOffset(d.getTime(), offset);\n}\n","import { FSharpRef } from \"./Types.js\";\nexport function tryParse(str, defValue) {\n    // TODO: test if value is valid and in range\n    if (str != null && /\\S/.test(str)) {\n        const v = +str.replace(\"_\", \"\");\n        if (!Number.isNaN(v)) {\n            defValue.contents = v;\n            return true;\n        }\n    }\n    return false;\n}\nexport function parse(str) {\n    const defValue = new FSharpRef(0);\n    if (tryParse(str, defValue)) {\n        return defValue.contents;\n    }\n    else {\n        throw new Error(\"Input string was not in a correct format.\");\n    }\n}\n// JS Number.isFinite function evals false for NaN\nexport function isInfinity(x) {\n    return x === Number.POSITIVE_INFINITY || x === Number.NEGATIVE_INFINITY;\n}\n","import { compare, physicalHash, equals, structuralHash } from \"./Util.js\";\r\n\r\nexport function HashIdentity_FromFunctions(hash, eq) {\r\n    return {\r\n        Equals(x, y) {\r\n            return eq(x, y);\r\n        },\r\n        GetHashCode(x_1) {\r\n            return hash(x_1);\r\n        },\r\n    };\r\n}\r\n\r\nexport function HashIdentity_Structural() {\r\n    return HashIdentity_FromFunctions((obj) => structuralHash(obj), (e1, e2) => equals(e1, e2));\r\n}\r\n\r\nexport function HashIdentity_Reference() {\r\n    return HashIdentity_FromFunctions((obj) => physicalHash(obj), (e1, e2) => (e1 === e2));\r\n}\r\n\r\nexport function ComparisonIdentity_FromFunction(comparer) {\r\n    return {\r\n        Compare(x, y) {\r\n            return comparer(x, y);\r\n        },\r\n    };\r\n}\r\n\r\nexport function ComparisonIdentity_Structural() {\r\n    return ComparisonIdentity_FromFunction((e1, e2) => compare(e1, e2));\r\n}\r\n\r\n","import { structuralHash, equals } from \"./Util.js\";\r\nimport { HashIdentity_Structural, ComparisonIdentity_Structural } from \"./FSharp.Collections.js\";\r\nimport { StringBuilder__Append_Z721C83C5 } from \"./System.Text.js\";\r\n\r\nexport const LanguagePrimitives_GenericEqualityComparer = {\r\n    [\"System.Collections.IEqualityComparer.Equals541DA560\"](x, y) {\r\n        return equals(x, y);\r\n    },\r\n    [\"System.Collections.IEqualityComparer.GetHashCode4E60E31B\"](x_1) {\r\n        return structuralHash(x_1);\r\n    },\r\n};\r\n\r\nexport const LanguagePrimitives_GenericEqualityERComparer = {\r\n    [\"System.Collections.IEqualityComparer.Equals541DA560\"](x, y) {\r\n        return equals(x, y);\r\n    },\r\n    [\"System.Collections.IEqualityComparer.GetHashCode4E60E31B\"](x_1) {\r\n        return structuralHash(x_1);\r\n    },\r\n};\r\n\r\nexport function LanguagePrimitives_FastGenericComparer() {\r\n    return ComparisonIdentity_Structural();\r\n}\r\n\r\nexport function LanguagePrimitives_FastGenericComparerFromTable() {\r\n    return ComparisonIdentity_Structural();\r\n}\r\n\r\nexport function LanguagePrimitives_FastGenericEqualityComparer() {\r\n    return HashIdentity_Structural();\r\n}\r\n\r\nexport function LanguagePrimitives_FastGenericEqualityComparerFromTable() {\r\n    return HashIdentity_Structural();\r\n}\r\n\r\nexport function Operators_Failure(message) {\r\n    return new Error(message);\r\n}\r\n\r\nexport function Operators_FailurePattern(exn) {\r\n    return exn.message;\r\n}\r\n\r\nexport function Operators_NullArg(x) {\r\n    throw (new Error(x));\r\n}\r\n\r\nexport function Operators_Using(resource, action) {\r\n    try {\r\n        return action(resource);\r\n    }\r\n    finally {\r\n        if (equals(resource, null)) {\r\n        }\r\n        else {\r\n            resource.Dispose();\r\n        }\r\n    }\r\n}\r\n\r\nexport function Operators_Lock(_lockObj, action) {\r\n    return action();\r\n}\r\n\r\nexport function ExtraTopLevelOperators_LazyPattern(input) {\r\n    return input.Value;\r\n}\r\n\r\nexport function PrintfModule_PrintFormatToStringBuilderThen(continuation, builder, format) {\r\n    return format.cont((s) => {\r\n        void StringBuilder__Append_Z721C83C5(builder, s);\r\n        return continuation();\r\n    });\r\n}\r\n\r\nexport function PrintfModule_PrintFormatToStringBuilder(builder, format) {\r\n    return PrintfModule_PrintFormatToStringBuilderThen(() => {\r\n    }, builder, format);\r\n}\r\n\r\n","import { record_type, bool_type, list_type, option_type, class_type } from \"./Reflection.js\";\r\nimport { some, value as value_1 } from \"./Option.js\";\r\nimport { toString, Record } from \"./Types.js\";\r\nimport { FSharpList, fold as fold_2, cons, singleton as singleton_1, empty as empty_1, ofArrayWithTail, tail, head, isEmpty as isEmpty_1 } from \"./List.js\";\r\nimport { fold as fold_1, fill } from \"./Array.js\";\r\nimport { structuralHash, toIterator, getEnumerator, isArrayLike } from \"./Util.js\";\r\nimport { join } from \"./String.js\";\r\nimport { fold as fold_3, reduce, iterate as iterate_1, map as map_1 } from \"./Seq.js\";\r\n\r\nexport class SetTreeLeaf$1 {\r\n    constructor(k) {\r\n        this.k = k;\r\n    }\r\n}\r\n\r\nexport function SetTreeLeaf$1$reflection(gen0) {\r\n    return class_type(\"Set.SetTreeLeaf`1\", [gen0], SetTreeLeaf$1);\r\n}\r\n\r\nexport function SetTreeLeaf$1_$ctor_2B595(k) {\r\n    return new SetTreeLeaf$1(k);\r\n}\r\n\r\nexport function SetTreeLeaf$1__get_Key(_) {\r\n    return _.k;\r\n}\r\n\r\nexport class SetTreeNode$1 extends SetTreeLeaf$1 {\r\n    constructor(v, left, right, h) {\r\n        super(v);\r\n        this.left = left;\r\n        this.right = right;\r\n        this.h = (h | 0);\r\n    }\r\n}\r\n\r\nexport function SetTreeNode$1$reflection(gen0) {\r\n    return class_type(\"Set.SetTreeNode`1\", [gen0], SetTreeNode$1, SetTreeLeaf$1$reflection(gen0));\r\n}\r\n\r\nexport function SetTreeNode$1_$ctor_Z6E7BE5F7(v, left, right, h) {\r\n    return new SetTreeNode$1(v, left, right, h);\r\n}\r\n\r\nexport function SetTreeNode$1__get_Left(_) {\r\n    return _.left;\r\n}\r\n\r\nexport function SetTreeNode$1__get_Right(_) {\r\n    return _.right;\r\n}\r\n\r\nexport function SetTreeNode$1__get_Height(_) {\r\n    return _.h;\r\n}\r\n\r\nexport function SetTreeModule_empty() {\r\n    return void 0;\r\n}\r\n\r\nexport function SetTreeModule_countAux(t_mut, acc_mut) {\r\n    SetTreeModule_countAux:\r\n    while (true) {\r\n        const t = t_mut, acc = acc_mut;\r\n        if (t != null) {\r\n            const t2 = t;\r\n            if (t2 instanceof SetTreeNode$1) {\r\n                t_mut = SetTreeNode$1__get_Left(t2);\r\n                acc_mut = SetTreeModule_countAux(SetTreeNode$1__get_Right(t2), acc + 1);\r\n                continue SetTreeModule_countAux;\r\n            }\r\n            else {\r\n                return (acc + 1) | 0;\r\n            }\r\n        }\r\n        else {\r\n            return acc | 0;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_count(s) {\r\n    return SetTreeModule_countAux(s, 0);\r\n}\r\n\r\nexport function SetTreeModule_mk(l, k, r) {\r\n    let hl;\r\n    const t = l;\r\n    if (t != null) {\r\n        const t2 = t;\r\n        hl = ((t2 instanceof SetTreeNode$1) ? SetTreeNode$1__get_Height(t2) : 1);\r\n    }\r\n    else {\r\n        hl = 0;\r\n    }\r\n    let hr;\r\n    const t_1 = r;\r\n    if (t_1 != null) {\r\n        const t2_1 = t_1;\r\n        hr = ((t2_1 instanceof SetTreeNode$1) ? SetTreeNode$1__get_Height(t2_1) : 1);\r\n    }\r\n    else {\r\n        hr = 0;\r\n    }\r\n    const m = ((hl < hr) ? hr : hl) | 0;\r\n    if (m === 0) {\r\n        return SetTreeLeaf$1_$ctor_2B595(k);\r\n    }\r\n    else {\r\n        return SetTreeNode$1_$ctor_Z6E7BE5F7(k, l, r, m + 1);\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_rebalance(t1, v, t2) {\r\n    let t_2, t2_3, t_3, t2_4;\r\n    let t1h;\r\n    const t = t1;\r\n    if (t != null) {\r\n        const t2_1 = t;\r\n        t1h = ((t2_1 instanceof SetTreeNode$1) ? SetTreeNode$1__get_Height(t2_1) : 1);\r\n    }\r\n    else {\r\n        t1h = 0;\r\n    }\r\n    let t2h;\r\n    const t_1 = t2;\r\n    if (t_1 != null) {\r\n        const t2_2 = t_1;\r\n        t2h = ((t2_2 instanceof SetTreeNode$1) ? SetTreeNode$1__get_Height(t2_2) : 1);\r\n    }\r\n    else {\r\n        t2h = 0;\r\n    }\r\n    if (t2h > (t1h + 2)) {\r\n        const matchValue = value_1(t2);\r\n        if (matchValue instanceof SetTreeNode$1) {\r\n            if (((t_2 = SetTreeNode$1__get_Left(matchValue), (t_2 != null) ? ((t2_3 = t_2, (t2_3 instanceof SetTreeNode$1) ? SetTreeNode$1__get_Height(t2_3) : 1)) : 0)) > (t1h + 1)) {\r\n                const matchValue_1 = value_1(SetTreeNode$1__get_Left(matchValue));\r\n                if (matchValue_1 instanceof SetTreeNode$1) {\r\n                    return SetTreeModule_mk(SetTreeModule_mk(t1, v, SetTreeNode$1__get_Left(matchValue_1)), SetTreeLeaf$1__get_Key(matchValue_1), SetTreeModule_mk(SetTreeNode$1__get_Right(matchValue_1), SetTreeLeaf$1__get_Key(matchValue), SetTreeNode$1__get_Right(matchValue)));\r\n                }\r\n                else {\r\n                    throw (new Error(\"internal error: Set.rebalance\"));\r\n                }\r\n            }\r\n            else {\r\n                return SetTreeModule_mk(SetTreeModule_mk(t1, v, SetTreeNode$1__get_Left(matchValue)), SetTreeLeaf$1__get_Key(matchValue), SetTreeNode$1__get_Right(matchValue));\r\n            }\r\n        }\r\n        else {\r\n            throw (new Error(\"internal error: Set.rebalance\"));\r\n        }\r\n    }\r\n    else if (t1h > (t2h + 2)) {\r\n        const matchValue_2 = value_1(t1);\r\n        if (matchValue_2 instanceof SetTreeNode$1) {\r\n            if (((t_3 = SetTreeNode$1__get_Right(matchValue_2), (t_3 != null) ? ((t2_4 = t_3, (t2_4 instanceof SetTreeNode$1) ? SetTreeNode$1__get_Height(t2_4) : 1)) : 0)) > (t2h + 1)) {\r\n                const matchValue_3 = value_1(SetTreeNode$1__get_Right(matchValue_2));\r\n                if (matchValue_3 instanceof SetTreeNode$1) {\r\n                    return SetTreeModule_mk(SetTreeModule_mk(SetTreeNode$1__get_Left(matchValue_2), SetTreeLeaf$1__get_Key(matchValue_2), SetTreeNode$1__get_Left(matchValue_3)), SetTreeLeaf$1__get_Key(matchValue_3), SetTreeModule_mk(SetTreeNode$1__get_Right(matchValue_3), v, t2));\r\n                }\r\n                else {\r\n                    throw (new Error(\"internal error: Set.rebalance\"));\r\n                }\r\n            }\r\n            else {\r\n                return SetTreeModule_mk(SetTreeNode$1__get_Left(matchValue_2), SetTreeLeaf$1__get_Key(matchValue_2), SetTreeModule_mk(SetTreeNode$1__get_Right(matchValue_2), v, t2));\r\n            }\r\n        }\r\n        else {\r\n            throw (new Error(\"internal error: Set.rebalance\"));\r\n        }\r\n    }\r\n    else {\r\n        return SetTreeModule_mk(t1, v, t2);\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_add(comparer, k, t) {\r\n    if (t != null) {\r\n        const t2 = t;\r\n        const c = comparer.Compare(k, SetTreeLeaf$1__get_Key(t2)) | 0;\r\n        if (t2 instanceof SetTreeNode$1) {\r\n            if (c < 0) {\r\n                return SetTreeModule_rebalance(SetTreeModule_add(comparer, k, SetTreeNode$1__get_Left(t2)), SetTreeLeaf$1__get_Key(t2), SetTreeNode$1__get_Right(t2));\r\n            }\r\n            else if (c === 0) {\r\n                return t;\r\n            }\r\n            else {\r\n                return SetTreeModule_rebalance(SetTreeNode$1__get_Left(t2), SetTreeLeaf$1__get_Key(t2), SetTreeModule_add(comparer, k, SetTreeNode$1__get_Right(t2)));\r\n            }\r\n        }\r\n        else {\r\n            const c_1 = comparer.Compare(k, SetTreeLeaf$1__get_Key(t2)) | 0;\r\n            if (c_1 < 0) {\r\n                return SetTreeNode$1_$ctor_Z6E7BE5F7(k, SetTreeModule_empty(), t, 2);\r\n            }\r\n            else if (c_1 === 0) {\r\n                return t;\r\n            }\r\n            else {\r\n                return SetTreeNode$1_$ctor_Z6E7BE5F7(k, t, SetTreeModule_empty(), 2);\r\n            }\r\n        }\r\n    }\r\n    else {\r\n        return SetTreeLeaf$1_$ctor_2B595(k);\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_balance(comparer, t1, k, t2) {\r\n    if (t1 != null) {\r\n        const t1$0027 = t1;\r\n        if (t2 != null) {\r\n            const t2$0027 = t2;\r\n            if (t1$0027 instanceof SetTreeNode$1) {\r\n                if (t2$0027 instanceof SetTreeNode$1) {\r\n                    if ((SetTreeNode$1__get_Height(t1$0027) + 2) < SetTreeNode$1__get_Height(t2$0027)) {\r\n                        return SetTreeModule_rebalance(SetTreeModule_balance(comparer, t1, k, SetTreeNode$1__get_Left(t2$0027)), SetTreeLeaf$1__get_Key(t2$0027), SetTreeNode$1__get_Right(t2$0027));\r\n                    }\r\n                    else if ((SetTreeNode$1__get_Height(t2$0027) + 2) < SetTreeNode$1__get_Height(t1$0027)) {\r\n                        return SetTreeModule_rebalance(SetTreeNode$1__get_Left(t1$0027), SetTreeLeaf$1__get_Key(t1$0027), SetTreeModule_balance(comparer, SetTreeNode$1__get_Right(t1$0027), k, t2));\r\n                    }\r\n                    else {\r\n                        return SetTreeModule_mk(t1, k, t2);\r\n                    }\r\n                }\r\n                else {\r\n                    return SetTreeModule_add(comparer, k, SetTreeModule_add(comparer, SetTreeLeaf$1__get_Key(t2$0027), t1));\r\n                }\r\n            }\r\n            else {\r\n                return SetTreeModule_add(comparer, k, SetTreeModule_add(comparer, SetTreeLeaf$1__get_Key(t1$0027), t2));\r\n            }\r\n        }\r\n        else {\r\n            return SetTreeModule_add(comparer, k, t1);\r\n        }\r\n    }\r\n    else {\r\n        return SetTreeModule_add(comparer, k, t2);\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_split(comparer, pivot, t) {\r\n    if (t != null) {\r\n        const t2 = t;\r\n        if (t2 instanceof SetTreeNode$1) {\r\n            const c = comparer.Compare(pivot, SetTreeLeaf$1__get_Key(t2)) | 0;\r\n            if (c < 0) {\r\n                const patternInput = SetTreeModule_split(comparer, pivot, SetTreeNode$1__get_Left(t2));\r\n                return [patternInput[0], patternInput[1], SetTreeModule_balance(comparer, patternInput[2], SetTreeLeaf$1__get_Key(t2), SetTreeNode$1__get_Right(t2))];\r\n            }\r\n            else if (c === 0) {\r\n                return [SetTreeNode$1__get_Left(t2), true, SetTreeNode$1__get_Right(t2)];\r\n            }\r\n            else {\r\n                const patternInput_1 = SetTreeModule_split(comparer, pivot, SetTreeNode$1__get_Right(t2));\r\n                return [SetTreeModule_balance(comparer, SetTreeNode$1__get_Left(t2), SetTreeLeaf$1__get_Key(t2), patternInput_1[0]), patternInput_1[1], patternInput_1[2]];\r\n            }\r\n        }\r\n        else {\r\n            const c_1 = comparer.Compare(SetTreeLeaf$1__get_Key(t2), pivot) | 0;\r\n            if (c_1 < 0) {\r\n                return [t, false, SetTreeModule_empty()];\r\n            }\r\n            else if (c_1 === 0) {\r\n                return [SetTreeModule_empty(), true, SetTreeModule_empty()];\r\n            }\r\n            else {\r\n                return [SetTreeModule_empty(), false, t];\r\n            }\r\n        }\r\n    }\r\n    else {\r\n        return [SetTreeModule_empty(), false, SetTreeModule_empty()];\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_spliceOutSuccessor(t) {\r\n    if (t != null) {\r\n        const t2 = t;\r\n        if (t2 instanceof SetTreeNode$1) {\r\n            if (SetTreeNode$1__get_Left(t2) == null) {\r\n                return [SetTreeLeaf$1__get_Key(t2), SetTreeNode$1__get_Right(t2)];\r\n            }\r\n            else {\r\n                const patternInput = SetTreeModule_spliceOutSuccessor(SetTreeNode$1__get_Left(t2));\r\n                return [patternInput[0], SetTreeModule_mk(patternInput[1], SetTreeLeaf$1__get_Key(t2), SetTreeNode$1__get_Right(t2))];\r\n            }\r\n        }\r\n        else {\r\n            return [SetTreeLeaf$1__get_Key(t2), SetTreeModule_empty()];\r\n        }\r\n    }\r\n    else {\r\n        throw (new Error(\"internal error: Set.spliceOutSuccessor\"));\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_remove(comparer, k, t) {\r\n    if (t != null) {\r\n        const t2 = t;\r\n        const c = comparer.Compare(k, SetTreeLeaf$1__get_Key(t2)) | 0;\r\n        if (t2 instanceof SetTreeNode$1) {\r\n            if (c < 0) {\r\n                return SetTreeModule_rebalance(SetTreeModule_remove(comparer, k, SetTreeNode$1__get_Left(t2)), SetTreeLeaf$1__get_Key(t2), SetTreeNode$1__get_Right(t2));\r\n            }\r\n            else if (c === 0) {\r\n                if (SetTreeNode$1__get_Left(t2) == null) {\r\n                    return SetTreeNode$1__get_Right(t2);\r\n                }\r\n                else if (SetTreeNode$1__get_Right(t2) == null) {\r\n                    return SetTreeNode$1__get_Left(t2);\r\n                }\r\n                else {\r\n                    const patternInput = SetTreeModule_spliceOutSuccessor(SetTreeNode$1__get_Right(t2));\r\n                    return SetTreeModule_mk(SetTreeNode$1__get_Left(t2), patternInput[0], patternInput[1]);\r\n                }\r\n            }\r\n            else {\r\n                return SetTreeModule_rebalance(SetTreeNode$1__get_Left(t2), SetTreeLeaf$1__get_Key(t2), SetTreeModule_remove(comparer, k, SetTreeNode$1__get_Right(t2)));\r\n            }\r\n        }\r\n        else if (c === 0) {\r\n            return SetTreeModule_empty();\r\n        }\r\n        else {\r\n            return t;\r\n        }\r\n    }\r\n    else {\r\n        return t;\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_mem(comparer_mut, k_mut, t_mut) {\r\n    SetTreeModule_mem:\r\n    while (true) {\r\n        const comparer = comparer_mut, k = k_mut, t = t_mut;\r\n        if (t != null) {\r\n            const t2 = t;\r\n            const c = comparer.Compare(k, SetTreeLeaf$1__get_Key(t2)) | 0;\r\n            if (t2 instanceof SetTreeNode$1) {\r\n                if (c < 0) {\r\n                    comparer_mut = comparer;\r\n                    k_mut = k;\r\n                    t_mut = SetTreeNode$1__get_Left(t2);\r\n                    continue SetTreeModule_mem;\r\n                }\r\n                else if (c === 0) {\r\n                    return true;\r\n                }\r\n                else {\r\n                    comparer_mut = comparer;\r\n                    k_mut = k;\r\n                    t_mut = SetTreeNode$1__get_Right(t2);\r\n                    continue SetTreeModule_mem;\r\n                }\r\n            }\r\n            else {\r\n                return c === 0;\r\n            }\r\n        }\r\n        else {\r\n            return false;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_iter(f_mut, t_mut) {\r\n    SetTreeModule_iter:\r\n    while (true) {\r\n        const f = f_mut, t = t_mut;\r\n        if (t != null) {\r\n            const t2 = t;\r\n            if (t2 instanceof SetTreeNode$1) {\r\n                SetTreeModule_iter(f, SetTreeNode$1__get_Left(t2));\r\n                f(SetTreeLeaf$1__get_Key(t2));\r\n                f_mut = f;\r\n                t_mut = SetTreeNode$1__get_Right(t2);\r\n                continue SetTreeModule_iter;\r\n            }\r\n            else {\r\n                f(SetTreeLeaf$1__get_Key(t2));\r\n            }\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_foldBackOpt(f_mut, t_mut, x_mut) {\r\n    SetTreeModule_foldBackOpt:\r\n    while (true) {\r\n        const f = f_mut, t = t_mut, x = x_mut;\r\n        if (t != null) {\r\n            const t2 = t;\r\n            if (t2 instanceof SetTreeNode$1) {\r\n                f_mut = f;\r\n                t_mut = SetTreeNode$1__get_Left(t2);\r\n                x_mut = f(SetTreeLeaf$1__get_Key(t2), SetTreeModule_foldBackOpt(f, SetTreeNode$1__get_Right(t2), x));\r\n                continue SetTreeModule_foldBackOpt;\r\n            }\r\n            else {\r\n                return f(SetTreeLeaf$1__get_Key(t2), x);\r\n            }\r\n        }\r\n        else {\r\n            return x;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_foldBack(f, m, x) {\r\n    return SetTreeModule_foldBackOpt(f, m, x);\r\n}\r\n\r\nexport function SetTreeModule_foldOpt(f_mut, x_mut, t_mut) {\r\n    SetTreeModule_foldOpt:\r\n    while (true) {\r\n        const f = f_mut, x = x_mut, t = t_mut;\r\n        if (t != null) {\r\n            const t2 = t;\r\n            if (t2 instanceof SetTreeNode$1) {\r\n                f_mut = f;\r\n                x_mut = f(SetTreeModule_foldOpt(f, x, SetTreeNode$1__get_Left(t2)), SetTreeLeaf$1__get_Key(t2));\r\n                t_mut = SetTreeNode$1__get_Right(t2);\r\n                continue SetTreeModule_foldOpt;\r\n            }\r\n            else {\r\n                return f(x, SetTreeLeaf$1__get_Key(t2));\r\n            }\r\n        }\r\n        else {\r\n            return x;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_fold(f, x, m) {\r\n    return SetTreeModule_foldOpt(f, x, m);\r\n}\r\n\r\nexport function SetTreeModule_forall(f_mut, t_mut) {\r\n    SetTreeModule_forall:\r\n    while (true) {\r\n        const f = f_mut, t = t_mut;\r\n        if (t != null) {\r\n            const t2 = t;\r\n            if (t2 instanceof SetTreeNode$1) {\r\n                if (f(SetTreeLeaf$1__get_Key(t2)) ? SetTreeModule_forall(f, SetTreeNode$1__get_Left(t2)) : false) {\r\n                    f_mut = f;\r\n                    t_mut = SetTreeNode$1__get_Right(t2);\r\n                    continue SetTreeModule_forall;\r\n                }\r\n                else {\r\n                    return false;\r\n                }\r\n            }\r\n            else {\r\n                return f(SetTreeLeaf$1__get_Key(t2));\r\n            }\r\n        }\r\n        else {\r\n            return true;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_exists(f_mut, t_mut) {\r\n    SetTreeModule_exists:\r\n    while (true) {\r\n        const f = f_mut, t = t_mut;\r\n        if (t != null) {\r\n            const t2 = t;\r\n            if (t2 instanceof SetTreeNode$1) {\r\n                if (f(SetTreeLeaf$1__get_Key(t2)) ? true : SetTreeModule_exists(f, SetTreeNode$1__get_Left(t2))) {\r\n                    return true;\r\n                }\r\n                else {\r\n                    f_mut = f;\r\n                    t_mut = SetTreeNode$1__get_Right(t2);\r\n                    continue SetTreeModule_exists;\r\n                }\r\n            }\r\n            else {\r\n                return f(SetTreeLeaf$1__get_Key(t2));\r\n            }\r\n        }\r\n        else {\r\n            return false;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_subset(comparer, a, b) {\r\n    return SetTreeModule_forall((x) => SetTreeModule_mem(comparer, x, b), a);\r\n}\r\n\r\nexport function SetTreeModule_properSubset(comparer, a, b) {\r\n    if (SetTreeModule_forall((x) => SetTreeModule_mem(comparer, x, b), a)) {\r\n        return SetTreeModule_exists((x_1) => (!SetTreeModule_mem(comparer, x_1, a)), b);\r\n    }\r\n    else {\r\n        return false;\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_filterAux(comparer_mut, f_mut, t_mut, acc_mut) {\r\n    SetTreeModule_filterAux:\r\n    while (true) {\r\n        const comparer = comparer_mut, f = f_mut, t = t_mut, acc = acc_mut;\r\n        if (t != null) {\r\n            const t2 = t;\r\n            if (t2 instanceof SetTreeNode$1) {\r\n                const acc_1 = f(SetTreeLeaf$1__get_Key(t2)) ? SetTreeModule_add(comparer, SetTreeLeaf$1__get_Key(t2), acc) : acc;\r\n                comparer_mut = comparer;\r\n                f_mut = f;\r\n                t_mut = SetTreeNode$1__get_Left(t2);\r\n                acc_mut = SetTreeModule_filterAux(comparer, f, SetTreeNode$1__get_Right(t2), acc_1);\r\n                continue SetTreeModule_filterAux;\r\n            }\r\n            else if (f(SetTreeLeaf$1__get_Key(t2))) {\r\n                return SetTreeModule_add(comparer, SetTreeLeaf$1__get_Key(t2), acc);\r\n            }\r\n            else {\r\n                return acc;\r\n            }\r\n        }\r\n        else {\r\n            return acc;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_filter(comparer, f, s) {\r\n    return SetTreeModule_filterAux(comparer, f, s, SetTreeModule_empty());\r\n}\r\n\r\nexport function SetTreeModule_diffAux(comparer_mut, t_mut, acc_mut) {\r\n    SetTreeModule_diffAux:\r\n    while (true) {\r\n        const comparer = comparer_mut, t = t_mut, acc = acc_mut;\r\n        if (acc == null) {\r\n            return acc;\r\n        }\r\n        else if (t != null) {\r\n            const t2 = t;\r\n            if (t2 instanceof SetTreeNode$1) {\r\n                comparer_mut = comparer;\r\n                t_mut = SetTreeNode$1__get_Left(t2);\r\n                acc_mut = SetTreeModule_diffAux(comparer, SetTreeNode$1__get_Right(t2), SetTreeModule_remove(comparer, SetTreeLeaf$1__get_Key(t2), acc));\r\n                continue SetTreeModule_diffAux;\r\n            }\r\n            else {\r\n                return SetTreeModule_remove(comparer, SetTreeLeaf$1__get_Key(t2), acc);\r\n            }\r\n        }\r\n        else {\r\n            return acc;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_diff(comparer, a, b) {\r\n    return SetTreeModule_diffAux(comparer, b, a);\r\n}\r\n\r\nexport function SetTreeModule_union(comparer, t1, t2) {\r\n    if (t1 != null) {\r\n        const t1$0027 = t1;\r\n        if (t2 != null) {\r\n            const t2$0027 = t2;\r\n            if (t1$0027 instanceof SetTreeNode$1) {\r\n                if (t2$0027 instanceof SetTreeNode$1) {\r\n                    if (SetTreeNode$1__get_Height(t1$0027) > SetTreeNode$1__get_Height(t2$0027)) {\r\n                        const patternInput = SetTreeModule_split(comparer, SetTreeLeaf$1__get_Key(t1$0027), t2);\r\n                        return SetTreeModule_balance(comparer, SetTreeModule_union(comparer, SetTreeNode$1__get_Left(t1$0027), patternInput[0]), SetTreeLeaf$1__get_Key(t1$0027), SetTreeModule_union(comparer, SetTreeNode$1__get_Right(t1$0027), patternInput[2]));\r\n                    }\r\n                    else {\r\n                        const patternInput_1 = SetTreeModule_split(comparer, SetTreeLeaf$1__get_Key(t2$0027), t1);\r\n                        return SetTreeModule_balance(comparer, SetTreeModule_union(comparer, SetTreeNode$1__get_Left(t2$0027), patternInput_1[0]), SetTreeLeaf$1__get_Key(t2$0027), SetTreeModule_union(comparer, SetTreeNode$1__get_Right(t2$0027), patternInput_1[2]));\r\n                    }\r\n                }\r\n                else {\r\n                    return SetTreeModule_add(comparer, SetTreeLeaf$1__get_Key(t2$0027), t1);\r\n                }\r\n            }\r\n            else {\r\n                return SetTreeModule_add(comparer, SetTreeLeaf$1__get_Key(t1$0027), t2);\r\n            }\r\n        }\r\n        else {\r\n            return t1;\r\n        }\r\n    }\r\n    else {\r\n        return t2;\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_intersectionAux(comparer_mut, b_mut, t_mut, acc_mut) {\r\n    SetTreeModule_intersectionAux:\r\n    while (true) {\r\n        const comparer = comparer_mut, b = b_mut, t = t_mut, acc = acc_mut;\r\n        if (t != null) {\r\n            const t2 = t;\r\n            if (t2 instanceof SetTreeNode$1) {\r\n                const acc_1 = SetTreeModule_intersectionAux(comparer, b, SetTreeNode$1__get_Right(t2), acc);\r\n                const acc_2 = SetTreeModule_mem(comparer, SetTreeLeaf$1__get_Key(t2), b) ? SetTreeModule_add(comparer, SetTreeLeaf$1__get_Key(t2), acc_1) : acc_1;\r\n                comparer_mut = comparer;\r\n                b_mut = b;\r\n                t_mut = SetTreeNode$1__get_Left(t2);\r\n                acc_mut = acc_2;\r\n                continue SetTreeModule_intersectionAux;\r\n            }\r\n            else if (SetTreeModule_mem(comparer, SetTreeLeaf$1__get_Key(t2), b)) {\r\n                return SetTreeModule_add(comparer, SetTreeLeaf$1__get_Key(t2), acc);\r\n            }\r\n            else {\r\n                return acc;\r\n            }\r\n        }\r\n        else {\r\n            return acc;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_intersection(comparer, a, b) {\r\n    return SetTreeModule_intersectionAux(comparer, b, a, SetTreeModule_empty());\r\n}\r\n\r\nexport function SetTreeModule_partition1(comparer, f, k, acc1, acc2) {\r\n    if (f(k)) {\r\n        return [SetTreeModule_add(comparer, k, acc1), acc2];\r\n    }\r\n    else {\r\n        return [acc1, SetTreeModule_add(comparer, k, acc2)];\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_partitionAux(comparer_mut, f_mut, t_mut, acc_0_mut, acc_1_mut) {\r\n    SetTreeModule_partitionAux:\r\n    while (true) {\r\n        const comparer = comparer_mut, f = f_mut, t = t_mut, acc_0 = acc_0_mut, acc_1 = acc_1_mut;\r\n        const acc = [acc_0, acc_1];\r\n        if (t != null) {\r\n            const t2 = t;\r\n            if (t2 instanceof SetTreeNode$1) {\r\n                const acc_2 = SetTreeModule_partitionAux(comparer, f, SetTreeNode$1__get_Right(t2), acc[0], acc[1]);\r\n                const acc_3 = SetTreeModule_partition1(comparer, f, SetTreeLeaf$1__get_Key(t2), acc_2[0], acc_2[1]);\r\n                comparer_mut = comparer;\r\n                f_mut = f;\r\n                t_mut = SetTreeNode$1__get_Left(t2);\r\n                acc_0_mut = acc_3[0];\r\n                acc_1_mut = acc_3[1];\r\n                continue SetTreeModule_partitionAux;\r\n            }\r\n            else {\r\n                return SetTreeModule_partition1(comparer, f, SetTreeLeaf$1__get_Key(t2), acc[0], acc[1]);\r\n            }\r\n        }\r\n        else {\r\n            return acc;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_partition(comparer, f, s) {\r\n    return SetTreeModule_partitionAux(comparer, f, s, SetTreeModule_empty(), SetTreeModule_empty());\r\n}\r\n\r\nexport function SetTreeModule_minimumElementAux(t_mut, n_mut) {\r\n    SetTreeModule_minimumElementAux:\r\n    while (true) {\r\n        const t = t_mut, n = n_mut;\r\n        if (t != null) {\r\n            const t2 = t;\r\n            if (t2 instanceof SetTreeNode$1) {\r\n                t_mut = SetTreeNode$1__get_Left(t2);\r\n                n_mut = SetTreeLeaf$1__get_Key(t2);\r\n                continue SetTreeModule_minimumElementAux;\r\n            }\r\n            else {\r\n                return SetTreeLeaf$1__get_Key(t2);\r\n            }\r\n        }\r\n        else {\r\n            return n;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_minimumElementOpt(t) {\r\n    if (t != null) {\r\n        const t2 = t;\r\n        if (t2 instanceof SetTreeNode$1) {\r\n            return some(SetTreeModule_minimumElementAux(SetTreeNode$1__get_Left(t2), SetTreeLeaf$1__get_Key(t2)));\r\n        }\r\n        else {\r\n            return some(SetTreeLeaf$1__get_Key(t2));\r\n        }\r\n    }\r\n    else {\r\n        return void 0;\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_maximumElementAux(t_mut, n_mut) {\r\n    SetTreeModule_maximumElementAux:\r\n    while (true) {\r\n        const t = t_mut, n = n_mut;\r\n        if (t != null) {\r\n            const t2 = t;\r\n            if (t2 instanceof SetTreeNode$1) {\r\n                t_mut = SetTreeNode$1__get_Right(t2);\r\n                n_mut = SetTreeLeaf$1__get_Key(t2);\r\n                continue SetTreeModule_maximumElementAux;\r\n            }\r\n            else {\r\n                return SetTreeLeaf$1__get_Key(t2);\r\n            }\r\n        }\r\n        else {\r\n            return n;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_maximumElementOpt(t) {\r\n    if (t != null) {\r\n        const t2 = t;\r\n        if (t2 instanceof SetTreeNode$1) {\r\n            return some(SetTreeModule_maximumElementAux(SetTreeNode$1__get_Right(t2), SetTreeLeaf$1__get_Key(t2)));\r\n        }\r\n        else {\r\n            return some(SetTreeLeaf$1__get_Key(t2));\r\n        }\r\n    }\r\n    else {\r\n        return void 0;\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_minimumElement(s) {\r\n    const matchValue = SetTreeModule_minimumElementOpt(s);\r\n    if (matchValue == null) {\r\n        throw (new Error(\"Set contains no elements\"));\r\n    }\r\n    else {\r\n        return value_1(matchValue);\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_maximumElement(s) {\r\n    const matchValue = SetTreeModule_maximumElementOpt(s);\r\n    if (matchValue == null) {\r\n        throw (new Error(\"Set contains no elements\"));\r\n    }\r\n    else {\r\n        return value_1(matchValue);\r\n    }\r\n}\r\n\r\nexport class SetTreeModule_SetIterator$1 extends Record {\r\n    constructor(stack, started) {\r\n        super();\r\n        this.stack = stack;\r\n        this.started = started;\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_SetIterator$1$reflection(gen0) {\r\n    return record_type(\"Set.SetTreeModule.SetIterator`1\", [gen0], SetTreeModule_SetIterator$1, () => [[\"stack\", list_type(option_type(SetTreeLeaf$1$reflection(gen0)))], [\"started\", bool_type]]);\r\n}\r\n\r\nexport function SetTreeModule_collapseLHS(stack_mut) {\r\n    SetTreeModule_collapseLHS:\r\n    while (true) {\r\n        const stack = stack_mut;\r\n        if (!isEmpty_1(stack)) {\r\n            const x = head(stack);\r\n            const rest = tail(stack);\r\n            if (x != null) {\r\n                const x2 = x;\r\n                if (x2 instanceof SetTreeNode$1) {\r\n                    stack_mut = ofArrayWithTail([SetTreeNode$1__get_Left(x2), SetTreeLeaf$1_$ctor_2B595(SetTreeLeaf$1__get_Key(x2)), SetTreeNode$1__get_Right(x2)], rest);\r\n                    continue SetTreeModule_collapseLHS;\r\n                }\r\n                else {\r\n                    return stack;\r\n                }\r\n            }\r\n            else {\r\n                stack_mut = rest;\r\n                continue SetTreeModule_collapseLHS;\r\n            }\r\n        }\r\n        else {\r\n            return empty_1();\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_mkIterator(s) {\r\n    return new SetTreeModule_SetIterator$1(SetTreeModule_collapseLHS(singleton_1(s)), false);\r\n}\r\n\r\nexport function SetTreeModule_notStarted() {\r\n    throw (new Error(\"Enumeration not started\"));\r\n}\r\n\r\nexport function SetTreeModule_alreadyFinished() {\r\n    throw (new Error(\"Enumeration already started\"));\r\n}\r\n\r\nexport function SetTreeModule_current(i) {\r\n    if (i.started) {\r\n        const matchValue = i.stack;\r\n        if (isEmpty_1(matchValue)) {\r\n            return SetTreeModule_alreadyFinished();\r\n        }\r\n        else if (head(matchValue) != null) {\r\n            const t = head(matchValue);\r\n            return SetTreeLeaf$1__get_Key(t);\r\n        }\r\n        else {\r\n            throw (new Error(\"Please report error: Set iterator, unexpected stack for current\"));\r\n        }\r\n    }\r\n    else {\r\n        return SetTreeModule_notStarted();\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_moveNext(i) {\r\n    if (i.started) {\r\n        const matchValue = i.stack;\r\n        if (!isEmpty_1(matchValue)) {\r\n            if (head(matchValue) != null) {\r\n                const t = head(matchValue);\r\n                if (t instanceof SetTreeNode$1) {\r\n                    throw (new Error(\"Please report error: Set iterator, unexpected stack for moveNext\"));\r\n                }\r\n                else {\r\n                    i.stack = SetTreeModule_collapseLHS(tail(matchValue));\r\n                    return !isEmpty_1(i.stack);\r\n                }\r\n            }\r\n            else {\r\n                throw (new Error(\"Please report error: Set iterator, unexpected stack for moveNext\"));\r\n            }\r\n        }\r\n        else {\r\n            return false;\r\n        }\r\n    }\r\n    else {\r\n        i.started = true;\r\n        return !isEmpty_1(i.stack);\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_mkIEnumerator(s) {\r\n    let i = SetTreeModule_mkIterator(s);\r\n    return {\r\n        [\"System.Collections.Generic.IEnumerator`1.get_Current\"]() {\r\n            return SetTreeModule_current(i);\r\n        },\r\n        [\"System.Collections.IEnumerator.get_Current\"]() {\r\n            return SetTreeModule_current(i);\r\n        },\r\n        [\"System.Collections.IEnumerator.MoveNext\"]() {\r\n            return SetTreeModule_moveNext(i);\r\n        },\r\n        [\"System.Collections.IEnumerator.Reset\"]() {\r\n            i = SetTreeModule_mkIterator(s);\r\n        },\r\n        Dispose() {\r\n        },\r\n    };\r\n}\r\n\r\nexport function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {\r\n    SetTreeModule_compareStacks:\r\n    while (true) {\r\n        const comparer = comparer_mut, l1 = l1_mut, l2 = l2_mut;\r\n        const matchValue = [l1, l2];\r\n        if (!isEmpty_1(matchValue[0])) {\r\n            if (!isEmpty_1(matchValue[1])) {\r\n                if (head(matchValue[1]) != null) {\r\n                    if (head(matchValue[0]) != null) {\r\n                        const x1_3 = head(matchValue[0]);\r\n                        const x2_3 = head(matchValue[1]);\r\n                        if (x1_3 instanceof SetTreeNode$1) {\r\n                            if (SetTreeNode$1__get_Left(x1_3) == null) {\r\n                                if (x2_3 instanceof SetTreeNode$1) {\r\n                                    if (SetTreeNode$1__get_Left(x2_3) == null) {\r\n                                        const c = comparer.Compare(SetTreeLeaf$1__get_Key(x1_3), SetTreeLeaf$1__get_Key(x2_3)) | 0;\r\n                                        if (c !== 0) {\r\n                                            return c | 0;\r\n                                        }\r\n                                        else {\r\n                                            comparer_mut = comparer;\r\n                                            l1_mut = cons(SetTreeNode$1__get_Right(x1_3), tail(matchValue[0]));\r\n                                            l2_mut = cons(SetTreeNode$1__get_Right(x2_3), tail(matchValue[1]));\r\n                                            continue SetTreeModule_compareStacks;\r\n                                        }\r\n                                    }\r\n                                    else {\r\n                                        const matchValue_3 = [l1, l2];\r\n                                        let pattern_matching_result, t1_6, x1_4, t2_6, x2_4;\r\n                                        if (!isEmpty_1(matchValue_3[0])) {\r\n                                            if (head(matchValue_3[0]) != null) {\r\n                                                pattern_matching_result = 0;\r\n                                                t1_6 = tail(matchValue_3[0]);\r\n                                                x1_4 = head(matchValue_3[0]);\r\n                                            }\r\n                                            else if (!isEmpty_1(matchValue_3[1])) {\r\n                                                if (head(matchValue_3[1]) != null) {\r\n                                                    pattern_matching_result = 1;\r\n                                                    t2_6 = tail(matchValue_3[1]);\r\n                                                    x2_4 = head(matchValue_3[1]);\r\n                                                }\r\n                                                else {\r\n                                                    pattern_matching_result = 2;\r\n                                                }\r\n                                            }\r\n                                            else {\r\n                                                pattern_matching_result = 2;\r\n                                            }\r\n                                        }\r\n                                        else if (!isEmpty_1(matchValue_3[1])) {\r\n                                            if (head(matchValue_3[1]) != null) {\r\n                                                pattern_matching_result = 1;\r\n                                                t2_6 = tail(matchValue_3[1]);\r\n                                                x2_4 = head(matchValue_3[1]);\r\n                                            }\r\n                                            else {\r\n                                                pattern_matching_result = 2;\r\n                                            }\r\n                                        }\r\n                                        else {\r\n                                            pattern_matching_result = 2;\r\n                                        }\r\n                                        switch (pattern_matching_result) {\r\n                                            case 0: {\r\n                                                if (x1_4 instanceof SetTreeNode$1) {\r\n                                                    comparer_mut = comparer;\r\n                                                    l1_mut = ofArrayWithTail([SetTreeNode$1__get_Left(x1_4), SetTreeNode$1_$ctor_Z6E7BE5F7(SetTreeLeaf$1__get_Key(x1_4), SetTreeModule_empty(), SetTreeNode$1__get_Right(x1_4), 0)], t1_6);\r\n                                                    l2_mut = l2;\r\n                                                    continue SetTreeModule_compareStacks;\r\n                                                }\r\n                                                else {\r\n                                                    comparer_mut = comparer;\r\n                                                    l1_mut = ofArrayWithTail([SetTreeModule_empty(), SetTreeLeaf$1_$ctor_2B595(SetTreeLeaf$1__get_Key(x1_4))], t1_6);\r\n                                                    l2_mut = l2;\r\n                                                    continue SetTreeModule_compareStacks;\r\n                                                }\r\n                                            }\r\n                                            case 1: {\r\n                                                if (x2_4 instanceof SetTreeNode$1) {\r\n                                                    comparer_mut = comparer;\r\n                                                    l1_mut = l1;\r\n                                                    l2_mut = ofArrayWithTail([SetTreeNode$1__get_Left(x2_4), SetTreeNode$1_$ctor_Z6E7BE5F7(SetTreeLeaf$1__get_Key(x2_4), SetTreeModule_empty(), SetTreeNode$1__get_Right(x2_4), 0)], t2_6);\r\n                                                    continue SetTreeModule_compareStacks;\r\n                                                }\r\n                                                else {\r\n                                                    comparer_mut = comparer;\r\n                                                    l1_mut = l1;\r\n                                                    l2_mut = ofArrayWithTail([SetTreeModule_empty(), SetTreeLeaf$1_$ctor_2B595(SetTreeLeaf$1__get_Key(x2_4))], t2_6);\r\n                                                    continue SetTreeModule_compareStacks;\r\n                                                }\r\n                                            }\r\n                                            case 2: {\r\n                                                throw (new Error(\"unexpected state in SetTree.compareStacks\"));\r\n                                            }\r\n                                        }\r\n                                    }\r\n                                }\r\n                                else {\r\n                                    const c_1 = comparer.Compare(SetTreeLeaf$1__get_Key(x1_3), SetTreeLeaf$1__get_Key(x2_3)) | 0;\r\n                                    if (c_1 !== 0) {\r\n                                        return c_1 | 0;\r\n                                    }\r\n                                    else {\r\n                                        comparer_mut = comparer;\r\n                                        l1_mut = cons(SetTreeNode$1__get_Right(x1_3), tail(matchValue[0]));\r\n                                        l2_mut = cons(SetTreeModule_empty(), tail(matchValue[1]));\r\n                                        continue SetTreeModule_compareStacks;\r\n                                    }\r\n                                }\r\n                            }\r\n                            else {\r\n                                const matchValue_4 = [l1, l2];\r\n                                let pattern_matching_result_1, t1_7, x1_5, t2_7, x2_5;\r\n                                if (!isEmpty_1(matchValue_4[0])) {\r\n                                    if (head(matchValue_4[0]) != null) {\r\n                                        pattern_matching_result_1 = 0;\r\n                                        t1_7 = tail(matchValue_4[0]);\r\n                                        x1_5 = head(matchValue_4[0]);\r\n                                    }\r\n                                    else if (!isEmpty_1(matchValue_4[1])) {\r\n                                        if (head(matchValue_4[1]) != null) {\r\n                                            pattern_matching_result_1 = 1;\r\n                                            t2_7 = tail(matchValue_4[1]);\r\n                                            x2_5 = head(matchValue_4[1]);\r\n                                        }\r\n                                        else {\r\n                                            pattern_matching_result_1 = 2;\r\n                                        }\r\n                                    }\r\n                                    else {\r\n                                        pattern_matching_result_1 = 2;\r\n                                    }\r\n                                }\r\n                                else if (!isEmpty_1(matchValue_4[1])) {\r\n                                    if (head(matchValue_4[1]) != null) {\r\n                                        pattern_matching_result_1 = 1;\r\n                                        t2_7 = tail(matchValue_4[1]);\r\n                                        x2_5 = head(matchValue_4[1]);\r\n                                    }\r\n                                    else {\r\n                                        pattern_matching_result_1 = 2;\r\n                                    }\r\n                                }\r\n                                else {\r\n                                    pattern_matching_result_1 = 2;\r\n                                }\r\n                                switch (pattern_matching_result_1) {\r\n                                    case 0: {\r\n                                        if (x1_5 instanceof SetTreeNode$1) {\r\n                                            comparer_mut = comparer;\r\n                                            l1_mut = ofArrayWithTail([SetTreeNode$1__get_Left(x1_5), SetTreeNode$1_$ctor_Z6E7BE5F7(SetTreeLeaf$1__get_Key(x1_5), SetTreeModule_empty(), SetTreeNode$1__get_Right(x1_5), 0)], t1_7);\r\n                                            l2_mut = l2;\r\n                                            continue SetTreeModule_compareStacks;\r\n                                        }\r\n                                        else {\r\n                                            comparer_mut = comparer;\r\n                                            l1_mut = ofArrayWithTail([SetTreeModule_empty(), SetTreeLeaf$1_$ctor_2B595(SetTreeLeaf$1__get_Key(x1_5))], t1_7);\r\n                                            l2_mut = l2;\r\n                                            continue SetTreeModule_compareStacks;\r\n                                        }\r\n                                    }\r\n                                    case 1: {\r\n                                        if (x2_5 instanceof SetTreeNode$1) {\r\n                                            comparer_mut = comparer;\r\n                                            l1_mut = l1;\r\n                                            l2_mut = ofArrayWithTail([SetTreeNode$1__get_Left(x2_5), SetTreeNode$1_$ctor_Z6E7BE5F7(SetTreeLeaf$1__get_Key(x2_5), SetTreeModule_empty(), SetTreeNode$1__get_Right(x2_5), 0)], t2_7);\r\n                                            continue SetTreeModule_compareStacks;\r\n                                        }\r\n                                        else {\r\n                                            comparer_mut = comparer;\r\n                                            l1_mut = l1;\r\n                                            l2_mut = ofArrayWithTail([SetTreeModule_empty(), SetTreeLeaf$1_$ctor_2B595(SetTreeLeaf$1__get_Key(x2_5))], t2_7);\r\n                                            continue SetTreeModule_compareStacks;\r\n                                        }\r\n                                    }\r\n                                    case 2: {\r\n                                        throw (new Error(\"unexpected state in SetTree.compareStacks\"));\r\n                                    }\r\n                                }\r\n                            }\r\n                        }\r\n                        else if (x2_3 instanceof SetTreeNode$1) {\r\n                            if (SetTreeNode$1__get_Left(x2_3) == null) {\r\n                                const c_2 = comparer.Compare(SetTreeLeaf$1__get_Key(x1_3), SetTreeLeaf$1__get_Key(x2_3)) | 0;\r\n                                if (c_2 !== 0) {\r\n                                    return c_2 | 0;\r\n                                }\r\n                                else {\r\n                                    comparer_mut = comparer;\r\n                                    l1_mut = cons(SetTreeModule_empty(), tail(matchValue[0]));\r\n                                    l2_mut = cons(SetTreeNode$1__get_Right(x2_3), tail(matchValue[1]));\r\n                                    continue SetTreeModule_compareStacks;\r\n                                }\r\n                            }\r\n                            else {\r\n                                const matchValue_5 = [l1, l2];\r\n                                let pattern_matching_result_2, t1_8, x1_6, t2_8, x2_6;\r\n                                if (!isEmpty_1(matchValue_5[0])) {\r\n                                    if (head(matchValue_5[0]) != null) {\r\n                                        pattern_matching_result_2 = 0;\r\n                                        t1_8 = tail(matchValue_5[0]);\r\n                                        x1_6 = head(matchValue_5[0]);\r\n                                    }\r\n                                    else if (!isEmpty_1(matchValue_5[1])) {\r\n                                        if (head(matchValue_5[1]) != null) {\r\n                                            pattern_matching_result_2 = 1;\r\n                                            t2_8 = tail(matchValue_5[1]);\r\n                                            x2_6 = head(matchValue_5[1]);\r\n                                        }\r\n                                        else {\r\n                                            pattern_matching_result_2 = 2;\r\n                                        }\r\n                                    }\r\n                                    else {\r\n                                        pattern_matching_result_2 = 2;\r\n                                    }\r\n                                }\r\n                                else if (!isEmpty_1(matchValue_5[1])) {\r\n                                    if (head(matchValue_5[1]) != null) {\r\n                                        pattern_matching_result_2 = 1;\r\n                                        t2_8 = tail(matchValue_5[1]);\r\n                                        x2_6 = head(matchValue_5[1]);\r\n                                    }\r\n                                    else {\r\n                                        pattern_matching_result_2 = 2;\r\n                                    }\r\n                                }\r\n                                else {\r\n                                    pattern_matching_result_2 = 2;\r\n                                }\r\n                                switch (pattern_matching_result_2) {\r\n                                    case 0: {\r\n                                        if (x1_6 instanceof SetTreeNode$1) {\r\n                                            comparer_mut = comparer;\r\n                                            l1_mut = ofArrayWithTail([SetTreeNode$1__get_Left(x1_6), SetTreeNode$1_$ctor_Z6E7BE5F7(SetTreeLeaf$1__get_Key(x1_6), SetTreeModule_empty(), SetTreeNode$1__get_Right(x1_6), 0)], t1_8);\r\n                                            l2_mut = l2;\r\n                                            continue SetTreeModule_compareStacks;\r\n                                        }\r\n                                        else {\r\n                                            comparer_mut = comparer;\r\n                                            l1_mut = ofArrayWithTail([SetTreeModule_empty(), SetTreeLeaf$1_$ctor_2B595(SetTreeLeaf$1__get_Key(x1_6))], t1_8);\r\n                                            l2_mut = l2;\r\n                                            continue SetTreeModule_compareStacks;\r\n                                        }\r\n                                    }\r\n                                    case 1: {\r\n                                        if (x2_6 instanceof SetTreeNode$1) {\r\n                                            comparer_mut = comparer;\r\n                                            l1_mut = l1;\r\n                                            l2_mut = ofArrayWithTail([SetTreeNode$1__get_Left(x2_6), SetTreeNode$1_$ctor_Z6E7BE5F7(SetTreeLeaf$1__get_Key(x2_6), SetTreeModule_empty(), SetTreeNode$1__get_Right(x2_6), 0)], t2_8);\r\n                                            continue SetTreeModule_compareStacks;\r\n                                        }\r\n                                        else {\r\n                                            comparer_mut = comparer;\r\n                                            l1_mut = l1;\r\n                                            l2_mut = ofArrayWithTail([SetTreeModule_empty(), SetTreeLeaf$1_$ctor_2B595(SetTreeLeaf$1__get_Key(x2_6))], t2_8);\r\n                                            continue SetTreeModule_compareStacks;\r\n                                        }\r\n                                    }\r\n                                    case 2: {\r\n                                        throw (new Error(\"unexpected state in SetTree.compareStacks\"));\r\n                                    }\r\n                                }\r\n                            }\r\n                        }\r\n                        else {\r\n                            const c_3 = comparer.Compare(SetTreeLeaf$1__get_Key(x1_3), SetTreeLeaf$1__get_Key(x2_3)) | 0;\r\n                            if (c_3 !== 0) {\r\n                                return c_3 | 0;\r\n                            }\r\n                            else {\r\n                                comparer_mut = comparer;\r\n                                l1_mut = tail(matchValue[0]);\r\n                                l2_mut = tail(matchValue[1]);\r\n                                continue SetTreeModule_compareStacks;\r\n                            }\r\n                        }\r\n                    }\r\n                    else {\r\n                        const x2 = head(matchValue[1]);\r\n                        const matchValue_1 = [l1, l2];\r\n                        let pattern_matching_result_3, t1_2, x1, t2_2, x2_1;\r\n                        if (!isEmpty_1(matchValue_1[0])) {\r\n                            if (head(matchValue_1[0]) != null) {\r\n                                pattern_matching_result_3 = 0;\r\n                                t1_2 = tail(matchValue_1[0]);\r\n                                x1 = head(matchValue_1[0]);\r\n                            }\r\n                            else if (!isEmpty_1(matchValue_1[1])) {\r\n                                if (head(matchValue_1[1]) != null) {\r\n                                    pattern_matching_result_3 = 1;\r\n                                    t2_2 = tail(matchValue_1[1]);\r\n                                    x2_1 = head(matchValue_1[1]);\r\n                                }\r\n                                else {\r\n                                    pattern_matching_result_3 = 2;\r\n                                }\r\n                            }\r\n                            else {\r\n                                pattern_matching_result_3 = 2;\r\n                            }\r\n                        }\r\n                        else if (!isEmpty_1(matchValue_1[1])) {\r\n                            if (head(matchValue_1[1]) != null) {\r\n                                pattern_matching_result_3 = 1;\r\n                                t2_2 = tail(matchValue_1[1]);\r\n                                x2_1 = head(matchValue_1[1]);\r\n                            }\r\n                            else {\r\n                                pattern_matching_result_3 = 2;\r\n                            }\r\n                        }\r\n                        else {\r\n                            pattern_matching_result_3 = 2;\r\n                        }\r\n                        switch (pattern_matching_result_3) {\r\n                            case 0: {\r\n                                if (x1 instanceof SetTreeNode$1) {\r\n                                    comparer_mut = comparer;\r\n                                    l1_mut = ofArrayWithTail([SetTreeNode$1__get_Left(x1), SetTreeNode$1_$ctor_Z6E7BE5F7(SetTreeLeaf$1__get_Key(x1), SetTreeModule_empty(), SetTreeNode$1__get_Right(x1), 0)], t1_2);\r\n                                    l2_mut = l2;\r\n                                    continue SetTreeModule_compareStacks;\r\n                                }\r\n                                else {\r\n                                    comparer_mut = comparer;\r\n                                    l1_mut = ofArrayWithTail([SetTreeModule_empty(), SetTreeLeaf$1_$ctor_2B595(SetTreeLeaf$1__get_Key(x1))], t1_2);\r\n                                    l2_mut = l2;\r\n                                    continue SetTreeModule_compareStacks;\r\n                                }\r\n                            }\r\n                            case 1: {\r\n                                if (x2_1 instanceof SetTreeNode$1) {\r\n                                    comparer_mut = comparer;\r\n                                    l1_mut = l1;\r\n                                    l2_mut = ofArrayWithTail([SetTreeNode$1__get_Left(x2_1), SetTreeNode$1_$ctor_Z6E7BE5F7(SetTreeLeaf$1__get_Key(x2_1), SetTreeModule_empty(), SetTreeNode$1__get_Right(x2_1), 0)], t2_2);\r\n                                    continue SetTreeModule_compareStacks;\r\n                                }\r\n                                else {\r\n                                    comparer_mut = comparer;\r\n                                    l1_mut = l1;\r\n                                    l2_mut = ofArrayWithTail([SetTreeModule_empty(), SetTreeLeaf$1_$ctor_2B595(SetTreeLeaf$1__get_Key(x2_1))], t2_2);\r\n                                    continue SetTreeModule_compareStacks;\r\n                                }\r\n                            }\r\n                            case 2: {\r\n                                throw (new Error(\"unexpected state in SetTree.compareStacks\"));\r\n                            }\r\n                        }\r\n                    }\r\n                }\r\n                else if (head(matchValue[0]) != null) {\r\n                    const x1_1 = head(matchValue[0]);\r\n                    const matchValue_2 = [l1, l2];\r\n                    let pattern_matching_result_4, t1_4, x1_2, t2_4, x2_2;\r\n                    if (!isEmpty_1(matchValue_2[0])) {\r\n                        if (head(matchValue_2[0]) != null) {\r\n                            pattern_matching_result_4 = 0;\r\n                            t1_4 = tail(matchValue_2[0]);\r\n                            x1_2 = head(matchValue_2[0]);\r\n                        }\r\n                        else if (!isEmpty_1(matchValue_2[1])) {\r\n                            if (head(matchValue_2[1]) != null) {\r\n                                pattern_matching_result_4 = 1;\r\n                                t2_4 = tail(matchValue_2[1]);\r\n                                x2_2 = head(matchValue_2[1]);\r\n                            }\r\n                            else {\r\n                                pattern_matching_result_4 = 2;\r\n                            }\r\n                        }\r\n                        else {\r\n                            pattern_matching_result_4 = 2;\r\n                        }\r\n                    }\r\n                    else if (!isEmpty_1(matchValue_2[1])) {\r\n                        if (head(matchValue_2[1]) != null) {\r\n                            pattern_matching_result_4 = 1;\r\n                            t2_4 = tail(matchValue_2[1]);\r\n                            x2_2 = head(matchValue_2[1]);\r\n                        }\r\n                        else {\r\n                            pattern_matching_result_4 = 2;\r\n                        }\r\n                    }\r\n                    else {\r\n                        pattern_matching_result_4 = 2;\r\n                    }\r\n                    switch (pattern_matching_result_4) {\r\n                        case 0: {\r\n                            if (x1_2 instanceof SetTreeNode$1) {\r\n                                comparer_mut = comparer;\r\n                                l1_mut = ofArrayWithTail([SetTreeNode$1__get_Left(x1_2), SetTreeNode$1_$ctor_Z6E7BE5F7(SetTreeLeaf$1__get_Key(x1_2), SetTreeModule_empty(), SetTreeNode$1__get_Right(x1_2), 0)], t1_4);\r\n                                l2_mut = l2;\r\n                                continue SetTreeModule_compareStacks;\r\n                            }\r\n                            else {\r\n                                comparer_mut = comparer;\r\n                                l1_mut = ofArrayWithTail([SetTreeModule_empty(), SetTreeLeaf$1_$ctor_2B595(SetTreeLeaf$1__get_Key(x1_2))], t1_4);\r\n                                l2_mut = l2;\r\n                                continue SetTreeModule_compareStacks;\r\n                            }\r\n                        }\r\n                        case 1: {\r\n                            if (x2_2 instanceof SetTreeNode$1) {\r\n                                comparer_mut = comparer;\r\n                                l1_mut = l1;\r\n                                l2_mut = ofArrayWithTail([SetTreeNode$1__get_Left(x2_2), SetTreeNode$1_$ctor_Z6E7BE5F7(SetTreeLeaf$1__get_Key(x2_2), SetTreeModule_empty(), SetTreeNode$1__get_Right(x2_2), 0)], t2_4);\r\n                                continue SetTreeModule_compareStacks;\r\n                            }\r\n                            else {\r\n                                comparer_mut = comparer;\r\n                                l1_mut = l1;\r\n                                l2_mut = ofArrayWithTail([SetTreeModule_empty(), SetTreeLeaf$1_$ctor_2B595(SetTreeLeaf$1__get_Key(x2_2))], t2_4);\r\n                                continue SetTreeModule_compareStacks;\r\n                            }\r\n                        }\r\n                        case 2: {\r\n                            throw (new Error(\"unexpected state in SetTree.compareStacks\"));\r\n                        }\r\n                    }\r\n                }\r\n                else {\r\n                    comparer_mut = comparer;\r\n                    l1_mut = tail(matchValue[0]);\r\n                    l2_mut = tail(matchValue[1]);\r\n                    continue SetTreeModule_compareStacks;\r\n                }\r\n            }\r\n            else {\r\n                return 1;\r\n            }\r\n        }\r\n        else if (isEmpty_1(matchValue[1])) {\r\n            return 0;\r\n        }\r\n        else {\r\n            return -1;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_compare(comparer, t1, t2) {\r\n    if (t1 == null) {\r\n        if (t2 == null) {\r\n            return 0;\r\n        }\r\n        else {\r\n            return -1;\r\n        }\r\n    }\r\n    else if (t2 == null) {\r\n        return 1;\r\n    }\r\n    else {\r\n        return SetTreeModule_compareStacks(comparer, singleton_1(t1), singleton_1(t2)) | 0;\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_choose(s) {\r\n    return SetTreeModule_minimumElement(s);\r\n}\r\n\r\nexport function SetTreeModule_toList(t) {\r\n    const loop = (t$0027_mut, acc_mut) => {\r\n        loop:\r\n        while (true) {\r\n            const t$0027 = t$0027_mut, acc = acc_mut;\r\n            if (t$0027 != null) {\r\n                const t2 = t$0027;\r\n                if (t2 instanceof SetTreeNode$1) {\r\n                    t$0027_mut = SetTreeNode$1__get_Left(t2);\r\n                    acc_mut = cons(SetTreeLeaf$1__get_Key(t2), loop(SetTreeNode$1__get_Right(t2), acc));\r\n                    continue loop;\r\n                }\r\n                else {\r\n                    return cons(SetTreeLeaf$1__get_Key(t2), acc);\r\n                }\r\n            }\r\n            else {\r\n                return acc;\r\n            }\r\n            break;\r\n        }\r\n    };\r\n    return loop(t, empty_1());\r\n}\r\n\r\nexport function SetTreeModule_copyToArray(s, arr, i) {\r\n    let j = i;\r\n    SetTreeModule_iter((x) => {\r\n        arr[j] = x;\r\n        j = ((j + 1) | 0);\r\n    }, s);\r\n}\r\n\r\nexport function SetTreeModule_toArray(s) {\r\n    const n = SetTreeModule_count(s) | 0;\r\n    const res = fill(new Array(n), 0, n, null);\r\n    SetTreeModule_copyToArray(s, res, 0);\r\n    return res;\r\n}\r\n\r\nexport function SetTreeModule_mkFromEnumerator(comparer_mut, acc_mut, e_mut) {\r\n    SetTreeModule_mkFromEnumerator:\r\n    while (true) {\r\n        const comparer = comparer_mut, acc = acc_mut, e = e_mut;\r\n        if (e[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n            comparer_mut = comparer;\r\n            acc_mut = SetTreeModule_add(comparer, e[\"System.Collections.Generic.IEnumerator`1.get_Current\"](), acc);\r\n            e_mut = e;\r\n            continue SetTreeModule_mkFromEnumerator;\r\n        }\r\n        else {\r\n            return acc;\r\n        }\r\n        break;\r\n    }\r\n}\r\n\r\nexport function SetTreeModule_ofArray(comparer, l) {\r\n    return fold_1((acc, k) => SetTreeModule_add(comparer, k, acc), SetTreeModule_empty(), l);\r\n}\r\n\r\nexport function SetTreeModule_ofList(comparer, l) {\r\n    return fold_2((acc, k) => SetTreeModule_add(comparer, k, acc), SetTreeModule_empty(), l);\r\n}\r\n\r\nexport function SetTreeModule_ofSeq(comparer, c) {\r\n    if (isArrayLike(c)) {\r\n        return SetTreeModule_ofArray(comparer, c);\r\n    }\r\n    else if (c instanceof FSharpList) {\r\n        return SetTreeModule_ofList(comparer, c);\r\n    }\r\n    else {\r\n        const ie = getEnumerator(c);\r\n        try {\r\n            return SetTreeModule_mkFromEnumerator(comparer, SetTreeModule_empty(), ie);\r\n        }\r\n        finally {\r\n            ie.Dispose();\r\n        }\r\n    }\r\n}\r\n\r\nexport class FSharpSet {\r\n    constructor(comparer, tree) {\r\n        this.comparer = comparer;\r\n        this.tree = tree;\r\n    }\r\n    GetHashCode() {\r\n        const this$ = this;\r\n        return FSharpSet__ComputeHashCode(this$) | 0;\r\n    }\r\n    Equals(that) {\r\n        const this$ = this;\r\n        return (that instanceof FSharpSet) ? (SetTreeModule_compare(FSharpSet__get_Comparer(this$), FSharpSet__get_Tree(this$), FSharpSet__get_Tree(that)) === 0) : false;\r\n    }\r\n    toString() {\r\n        const this$ = this;\r\n        return (\"set [\" + join(\"; \", map_1((x) => {\r\n            let copyOfStruct = x;\r\n            return toString(copyOfStruct);\r\n        }, this$))) + \"]\";\r\n    }\r\n    get [Symbol.toStringTag]() {\r\n        return \"FSharpSet\";\r\n    }\r\n    toJSON(_key) {\r\n        const this$ = this;\r\n        return Array.from(this$);\r\n    }\r\n    CompareTo(that) {\r\n        const s = this;\r\n        return SetTreeModule_compare(FSharpSet__get_Comparer(s), FSharpSet__get_Tree(s), FSharpSet__get_Tree(that)) | 0;\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.Add2B595\"](x) {\r\n        throw (new Error(\"ReadOnlyCollection\"));\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.Clear\"]() {\r\n        throw (new Error(\"ReadOnlyCollection\"));\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.Remove2B595\"](x) {\r\n        throw (new Error(\"ReadOnlyCollection\"));\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.Contains2B595\"](x) {\r\n        const s = this;\r\n        return SetTreeModule_mem(FSharpSet__get_Comparer(s), x, FSharpSet__get_Tree(s));\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.CopyToZ2E171D71\"](arr, i) {\r\n        const s = this;\r\n        SetTreeModule_copyToArray(FSharpSet__get_Tree(s), arr, i);\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.get_IsReadOnly\"]() {\r\n        return true;\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.get_Count\"]() {\r\n        const s = this;\r\n        return FSharpSet__get_Count(s) | 0;\r\n    }\r\n    [\"System.Collections.Generic.IReadOnlyCollection`1.get_Count\"]() {\r\n        const s = this;\r\n        return FSharpSet__get_Count(s) | 0;\r\n    }\r\n    GetEnumerator() {\r\n        const s = this;\r\n        return SetTreeModule_mkIEnumerator(FSharpSet__get_Tree(s));\r\n    }\r\n    [Symbol.iterator]() {\r\n        return toIterator(this.GetEnumerator());\r\n    }\r\n    [\"System.Collections.IEnumerable.GetEnumerator\"]() {\r\n        const s = this;\r\n        return SetTreeModule_mkIEnumerator(FSharpSet__get_Tree(s));\r\n    }\r\n    get size() {\r\n        const s = this;\r\n        return FSharpSet__get_Count(s) | 0;\r\n    }\r\n    add(k) {\r\n        const s = this;\r\n        throw (new Error(\"Set cannot be mutated\"));\r\n        return s;\r\n    }\r\n    clear() {\r\n        throw (new Error(\"Set cannot be mutated\"));\r\n    }\r\n    delete(k) {\r\n        throw (new Error(\"Set cannot be mutated\"));\r\n        return false;\r\n    }\r\n    has(k) {\r\n        const s = this;\r\n        return FSharpSet__Contains(s, k);\r\n    }\r\n    keys() {\r\n        const s = this;\r\n        return map_1((x) => x, s);\r\n    }\r\n    values() {\r\n        const s = this;\r\n        return map_1((x) => x, s);\r\n    }\r\n    entries() {\r\n        const s = this;\r\n        return map_1((v) => [v, v], s);\r\n    }\r\n    forEach(f, thisArg) {\r\n        const s = this;\r\n        iterate_1((x) => {\r\n            f(x, x, s);\r\n        }, s);\r\n    }\r\n}\r\n\r\nexport function FSharpSet$reflection(gen0) {\r\n    return class_type(\"Set.FSharpSet\", [gen0], FSharpSet);\r\n}\r\n\r\nexport function FSharpSet_$ctor(comparer, tree) {\r\n    return new FSharpSet(comparer, tree);\r\n}\r\n\r\nexport function FSharpSet__get_Comparer(set$) {\r\n    return set$.comparer;\r\n}\r\n\r\nexport function FSharpSet__get_Tree(set$) {\r\n    return set$.tree;\r\n}\r\n\r\nexport function FSharpSet_Empty(comparer) {\r\n    return FSharpSet_$ctor(comparer, SetTreeModule_empty());\r\n}\r\n\r\nexport function FSharpSet__Add(s, value) {\r\n    return FSharpSet_$ctor(FSharpSet__get_Comparer(s), SetTreeModule_add(FSharpSet__get_Comparer(s), value, FSharpSet__get_Tree(s)));\r\n}\r\n\r\nexport function FSharpSet__Remove(s, value) {\r\n    return FSharpSet_$ctor(FSharpSet__get_Comparer(s), SetTreeModule_remove(FSharpSet__get_Comparer(s), value, FSharpSet__get_Tree(s)));\r\n}\r\n\r\nexport function FSharpSet__get_Count(s) {\r\n    return SetTreeModule_count(FSharpSet__get_Tree(s));\r\n}\r\n\r\nexport function FSharpSet__Contains(s, value) {\r\n    return SetTreeModule_mem(FSharpSet__get_Comparer(s), value, FSharpSet__get_Tree(s));\r\n}\r\n\r\nexport function FSharpSet__Iterate(s, x) {\r\n    SetTreeModule_iter(x, FSharpSet__get_Tree(s));\r\n}\r\n\r\nexport function FSharpSet__Fold(s, f, z) {\r\n    const f_1 = f;\r\n    return SetTreeModule_fold((x, z_1) => f_1(z_1, x), z, FSharpSet__get_Tree(s));\r\n}\r\n\r\nexport function FSharpSet__get_IsEmpty(s) {\r\n    return FSharpSet__get_Tree(s) == null;\r\n}\r\n\r\nexport function FSharpSet__Partition(s, f) {\r\n    if (FSharpSet__get_Tree(s) == null) {\r\n        return [s, s];\r\n    }\r\n    else {\r\n        const patternInput = SetTreeModule_partition(FSharpSet__get_Comparer(s), f, FSharpSet__get_Tree(s));\r\n        return [FSharpSet_$ctor(FSharpSet__get_Comparer(s), patternInput[0]), FSharpSet_$ctor(FSharpSet__get_Comparer(s), patternInput[1])];\r\n    }\r\n}\r\n\r\nexport function FSharpSet__Filter(s, f) {\r\n    if (FSharpSet__get_Tree(s) == null) {\r\n        return s;\r\n    }\r\n    else {\r\n        return FSharpSet_$ctor(FSharpSet__get_Comparer(s), SetTreeModule_filter(FSharpSet__get_Comparer(s), f, FSharpSet__get_Tree(s)));\r\n    }\r\n}\r\n\r\nexport function FSharpSet__Map(s, f, comparer) {\r\n    return FSharpSet_$ctor(comparer, SetTreeModule_fold((acc, k) => SetTreeModule_add(comparer, f(k), acc), SetTreeModule_empty(), FSharpSet__get_Tree(s)));\r\n}\r\n\r\nexport function FSharpSet__Exists(s, f) {\r\n    return SetTreeModule_exists(f, FSharpSet__get_Tree(s));\r\n}\r\n\r\nexport function FSharpSet__ForAll(s, f) {\r\n    return SetTreeModule_forall(f, FSharpSet__get_Tree(s));\r\n}\r\n\r\nexport function FSharpSet_op_Subtraction(set1, set2) {\r\n    if (FSharpSet__get_Tree(set1) == null) {\r\n        return set1;\r\n    }\r\n    else if (FSharpSet__get_Tree(set2) == null) {\r\n        return set1;\r\n    }\r\n    else {\r\n        return FSharpSet_$ctor(FSharpSet__get_Comparer(set1), SetTreeModule_diff(FSharpSet__get_Comparer(set1), FSharpSet__get_Tree(set1), FSharpSet__get_Tree(set2)));\r\n    }\r\n}\r\n\r\nexport function FSharpSet_op_Addition(set1, set2) {\r\n    if (FSharpSet__get_Tree(set2) == null) {\r\n        return set1;\r\n    }\r\n    else if (FSharpSet__get_Tree(set1) == null) {\r\n        return set2;\r\n    }\r\n    else {\r\n        return FSharpSet_$ctor(FSharpSet__get_Comparer(set1), SetTreeModule_union(FSharpSet__get_Comparer(set1), FSharpSet__get_Tree(set1), FSharpSet__get_Tree(set2)));\r\n    }\r\n}\r\n\r\nexport function FSharpSet_Intersection(a, b) {\r\n    if (FSharpSet__get_Tree(b) == null) {\r\n        return b;\r\n    }\r\n    else if (FSharpSet__get_Tree(a) == null) {\r\n        return a;\r\n    }\r\n    else {\r\n        return FSharpSet_$ctor(FSharpSet__get_Comparer(a), SetTreeModule_intersection(FSharpSet__get_Comparer(a), FSharpSet__get_Tree(a), FSharpSet__get_Tree(b)));\r\n    }\r\n}\r\n\r\nexport function FSharpSet_IntersectionMany(sets) {\r\n    return reduce((s1, s2) => FSharpSet_Intersection(s1, s2), sets);\r\n}\r\n\r\nexport function FSharpSet_Equality(a, b) {\r\n    return SetTreeModule_compare(FSharpSet__get_Comparer(a), FSharpSet__get_Tree(a), FSharpSet__get_Tree(b)) === 0;\r\n}\r\n\r\nexport function FSharpSet_Compare(a, b) {\r\n    return SetTreeModule_compare(FSharpSet__get_Comparer(a), FSharpSet__get_Tree(a), FSharpSet__get_Tree(b));\r\n}\r\n\r\nexport function FSharpSet__get_Choose(x) {\r\n    return SetTreeModule_choose(FSharpSet__get_Tree(x));\r\n}\r\n\r\nexport function FSharpSet__get_MinimumElement(x) {\r\n    return SetTreeModule_minimumElement(FSharpSet__get_Tree(x));\r\n}\r\n\r\nexport function FSharpSet__get_MaximumElement(x) {\r\n    return SetTreeModule_maximumElement(FSharpSet__get_Tree(x));\r\n}\r\n\r\nexport function FSharpSet__IsSubsetOf(x, otherSet) {\r\n    return SetTreeModule_subset(FSharpSet__get_Comparer(x), FSharpSet__get_Tree(x), FSharpSet__get_Tree(otherSet));\r\n}\r\n\r\nexport function FSharpSet__IsSupersetOf(x, otherSet) {\r\n    return SetTreeModule_subset(FSharpSet__get_Comparer(x), FSharpSet__get_Tree(otherSet), FSharpSet__get_Tree(x));\r\n}\r\n\r\nexport function FSharpSet__IsProperSubsetOf(x, otherSet) {\r\n    return SetTreeModule_properSubset(FSharpSet__get_Comparer(x), FSharpSet__get_Tree(x), FSharpSet__get_Tree(otherSet));\r\n}\r\n\r\nexport function FSharpSet__IsProperSupersetOf(x, otherSet) {\r\n    return SetTreeModule_properSubset(FSharpSet__get_Comparer(x), FSharpSet__get_Tree(otherSet), FSharpSet__get_Tree(x));\r\n}\r\n\r\nexport function FSharpSet__ToList(x) {\r\n    return SetTreeModule_toList(FSharpSet__get_Tree(x));\r\n}\r\n\r\nexport function FSharpSet__ToArray(x) {\r\n    return SetTreeModule_toArray(FSharpSet__get_Tree(x));\r\n}\r\n\r\nexport function FSharpSet__ComputeHashCode(this$) {\r\n    let y;\r\n    let res = 0;\r\n    const enumerator = getEnumerator(this$);\r\n    try {\r\n        while (enumerator[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n            const x_1 = enumerator[\"System.Collections.Generic.IEnumerator`1.get_Current\"]();\r\n            res = (((y = (structuralHash(x_1) | 0), ((res << 1) + y) + 631)) | 0);\r\n        }\r\n    }\r\n    finally {\r\n        enumerator.Dispose();\r\n    }\r\n    return Math.abs(res) | 0;\r\n}\r\n\r\nexport function isEmpty(set$) {\r\n    return FSharpSet__get_IsEmpty(set$);\r\n}\r\n\r\nexport function contains(element, set$) {\r\n    return FSharpSet__Contains(set$, element);\r\n}\r\n\r\nexport function add(value, set$) {\r\n    return FSharpSet__Add(set$, value);\r\n}\r\n\r\nexport function singleton(value, comparer) {\r\n    return FSharpSet__Add(FSharpSet_Empty(comparer), value);\r\n}\r\n\r\nexport function remove(value, set$) {\r\n    return FSharpSet__Remove(set$, value);\r\n}\r\n\r\nexport function union(set1, set2) {\r\n    return FSharpSet_op_Addition(set1, set2);\r\n}\r\n\r\nexport function unionMany(sets, comparer) {\r\n    return fold_3((s1, s2) => FSharpSet_op_Addition(s1, s2), FSharpSet_Empty(comparer), sets);\r\n}\r\n\r\nexport function intersect(set1, set2) {\r\n    return FSharpSet_Intersection(set1, set2);\r\n}\r\n\r\nexport function intersectMany(sets) {\r\n    return FSharpSet_IntersectionMany(sets);\r\n}\r\n\r\nexport function iterate(action, set$) {\r\n    FSharpSet__Iterate(set$, action);\r\n}\r\n\r\nexport function empty(comparer) {\r\n    return FSharpSet_Empty(comparer);\r\n}\r\n\r\nexport function forAll(predicate, set$) {\r\n    return FSharpSet__ForAll(set$, predicate);\r\n}\r\n\r\nexport function exists(predicate, set$) {\r\n    return FSharpSet__Exists(set$, predicate);\r\n}\r\n\r\nexport function filter(predicate, set$) {\r\n    return FSharpSet__Filter(set$, predicate);\r\n}\r\n\r\nexport function partition(predicate, set$) {\r\n    return FSharpSet__Partition(set$, predicate);\r\n}\r\n\r\nexport function fold(folder, state, set$) {\r\n    return SetTreeModule_fold(folder, state, FSharpSet__get_Tree(set$));\r\n}\r\n\r\nexport function foldBack(folder, set$, state) {\r\n    return SetTreeModule_foldBack(folder, FSharpSet__get_Tree(set$), state);\r\n}\r\n\r\nexport function map(mapping, set$, comparer) {\r\n    return FSharpSet__Map(set$, mapping, comparer);\r\n}\r\n\r\nexport function count(set$) {\r\n    return FSharpSet__get_Count(set$);\r\n}\r\n\r\nexport function ofList(elements, comparer) {\r\n    return FSharpSet_$ctor(comparer, SetTreeModule_ofSeq(comparer, elements));\r\n}\r\n\r\nexport function ofArray(array, comparer) {\r\n    return FSharpSet_$ctor(comparer, SetTreeModule_ofArray(comparer, array));\r\n}\r\n\r\nexport function toList(set$) {\r\n    return FSharpSet__ToList(set$);\r\n}\r\n\r\nexport function toArray(set$) {\r\n    return FSharpSet__ToArray(set$);\r\n}\r\n\r\nexport function toSeq(set$) {\r\n    return map_1((x) => x, set$);\r\n}\r\n\r\nexport function ofSeq(elements, comparer) {\r\n    return FSharpSet_$ctor(comparer, SetTreeModule_ofSeq(comparer, elements));\r\n}\r\n\r\nexport function difference(set1, set2) {\r\n    return FSharpSet_op_Subtraction(set1, set2);\r\n}\r\n\r\nexport function isSubset(set1, set2) {\r\n    return SetTreeModule_subset(FSharpSet__get_Comparer(set1), FSharpSet__get_Tree(set1), FSharpSet__get_Tree(set2));\r\n}\r\n\r\nexport function isSuperset(set1, set2) {\r\n    return SetTreeModule_subset(FSharpSet__get_Comparer(set1), FSharpSet__get_Tree(set2), FSharpSet__get_Tree(set1));\r\n}\r\n\r\nexport function isProperSubset(set1, set2) {\r\n    return SetTreeModule_properSubset(FSharpSet__get_Comparer(set1), FSharpSet__get_Tree(set1), FSharpSet__get_Tree(set2));\r\n}\r\n\r\nexport function isProperSuperset(set1, set2) {\r\n    return SetTreeModule_properSubset(FSharpSet__get_Comparer(set1), FSharpSet__get_Tree(set2), FSharpSet__get_Tree(set1));\r\n}\r\n\r\nexport function minElement(set$) {\r\n    return FSharpSet__get_MinimumElement(set$);\r\n}\r\n\r\nexport function maxElement(set$) {\r\n    return FSharpSet__get_MaximumElement(set$);\r\n}\r\n\r\nexport function unionWith(s1, s2) {\r\n    return fold_3((acc, x) => acc.add(x), s1, s2);\r\n}\r\n\r\nexport function intersectWith(s1, s2, comparer) {\r\n    const s2_1 = ofSeq(s2, comparer);\r\n    const enumerator = getEnumerator(s1.keys());\r\n    try {\r\n        while (enumerator[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n            const x = enumerator[\"System.Collections.Generic.IEnumerator`1.get_Current\"]();\r\n            if (!FSharpSet__Contains(s2_1, x)) {\r\n                void s1.delete(x);\r\n            }\r\n        }\r\n    }\r\n    finally {\r\n        enumerator.Dispose();\r\n    }\r\n}\r\n\r\nexport function exceptWith(s1, s2) {\r\n    const enumerator = getEnumerator(s2);\r\n    try {\r\n        while (enumerator[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n            void s1.delete(enumerator[\"System.Collections.Generic.IEnumerator`1.get_Current\"]());\r\n        }\r\n    }\r\n    finally {\r\n        enumerator.Dispose();\r\n    }\r\n}\r\n\r\nexport function isSubsetOf(s1, s2, comparer) {\r\n    return isSubset(ofSeq(s1.values(), comparer), ofSeq(s2, comparer));\r\n}\r\n\r\nexport function isSupersetOf(s1, s2, comparer) {\r\n    return isSuperset(ofSeq(s1.values(), comparer), ofSeq(s2, comparer));\r\n}\r\n\r\nexport function isProperSubsetOf(s1, s2, comparer) {\r\n    return isProperSubset(ofSeq(s1.values(), comparer), ofSeq(s2, comparer));\r\n}\r\n\r\nexport function isProperSupersetOf(s1, s2, comparer) {\r\n    return isProperSuperset(ofSeq(s1.values(), comparer), ofSeq(s2, comparer));\r\n}\r\n\r\n","import { trim } from \"./String.js\";\n// RFC 4122 compliant. From https://stackoverflow.com/a/13653180/3922220\n// const guidRegex = /^[0-9a-f]{8}-[0-9a-f]{4}-[1-5][0-9a-f]{3}-[89ab][0-9a-f]{3}-[0-9a-f]{12}$/;\n// Relax GUID parsing, see #1637\nconst guidRegex = /^[\\(\\{]{0,2}[0-9a-f]{8}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{12}[\\)\\}]{0,2}$/;\nconst guidRegexNoHyphen = /^([0-9a-f]{8})([0-9a-f]{4})([0-9a-f]{4})([0-9a-f]{4})([0-9a-f]{12})$/;\nconst guidRegexHex = /^\\{0x[0-9a-f]{8},(0x[0-9a-f]{4},){2}\\{(0x[0-9a-f]{2},){7}0x[0-9a-f]{2}\\}\\}$/;\nconst guidHexCaptures = /^([0-9a-f]{8})-(([0-9a-f]{4})-)(([0-9a-f]{4})-)([0-9a-f]{2})([0-9a-f]{2})-([0-9a-f]{2})([0-9a-f]{2})([0-9a-f]{2})([0-9a-f]{2})([0-9a-f]{2})([0-9a-f]{2})$/;\nexport function toString(str, format, _provider) {\n    if (format && (format === null || format === void 0 ? void 0 : format.length) > 0) {\n        switch (format) {\n            case \"N\":\n                return str.replace(/-/g, '');\n            case \"D\":\n                return str;\n            case \"B\":\n                return \"{\" + str + \"}\";\n            case \"P\":\n                return \"(\" + str + \")\";\n            case \"X\":\n                return str.replace(guidHexCaptures, \"{0x$1,0x$3,0x$5,{0x$6,0x$7,0x$8,0x$9,0x$10,0x$11,0x$12,0x$13}}\");\n            default:\n                throw new Error(\"Unrecognized Guid print format\");\n        }\n    }\n    else {\n        return str;\n    }\n}\n/** Validates UUID as specified in RFC4122 (versions 1-5). */\nexport function parse(str) {\n    function hyphenateGuid(str) {\n        return str.replace(guidRegexNoHyphen, \"$1-$2-$3-$4-$5\");\n    }\n    const wsTrimAndLowered = str.trim().toLowerCase();\n    if (guidRegex.test(wsTrimAndLowered)) {\n        return trim(wsTrimAndLowered, \"{\", \"}\", \"(\", \")\");\n    }\n    else if (guidRegexNoHyphen.test(wsTrimAndLowered)) {\n        return hyphenateGuid(wsTrimAndLowered);\n    }\n    else if (guidRegexHex.test(wsTrimAndLowered)) {\n        return hyphenateGuid(wsTrimAndLowered.replace(/[\\{\\},]|0x/g, ''));\n    }\n    else {\n        throw new Error(\"Guid should contain 32 digits with 4 dashes: xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx\");\n    }\n}\nexport function tryParse(str, defValue) {\n    try {\n        defValue.contents = parse(str);\n        return true;\n    }\n    catch (_a) {\n        return false;\n    }\n}\n// From https://gist.github.com/LeverOne/1308368\nexport function newGuid() {\n    let b = \"\";\n    for (let a = 0; a++ < 36;) {\n        b += a * 51 & 52\n            ? (a ^ 15 ? 8 ^ Math.random() * (a ^ 20 ? 16 : 4) : 4).toString(16)\n            : \"-\";\n    }\n    return b;\n}\n// Maps for number <-> hex string conversion\nlet _convertMapsInitialized = false;\nlet _byteToHex;\nlet _hexToByte;\nfunction initConvertMaps() {\n    _byteToHex = new Array(256);\n    _hexToByte = {};\n    for (let i = 0; i < 256; i++) {\n        _byteToHex[i] = (i + 0x100).toString(16).substr(1);\n        _hexToByte[_byteToHex[i]] = i;\n    }\n    _convertMapsInitialized = true;\n}\n/** Parse a UUID into it's component bytes */\n// Adapted from https://github.com/zefferus/uuid-parse\nexport function guidToArray(s) {\n    if (!_convertMapsInitialized) {\n        initConvertMaps();\n    }\n    let i = 0;\n    const buf = new Uint8Array(16);\n    s.toLowerCase().replace(/[0-9a-f]{2}/g, ((oct) => {\n        switch (i) {\n            // .NET saves first three byte groups with different endianness\n            // See https://stackoverflow.com/a/16722909/3922220\n            case 0:\n            case 1:\n            case 2:\n            case 3:\n                buf[3 - i++] = _hexToByte[oct];\n                break;\n            case 4:\n            case 5:\n                buf[9 - i++] = _hexToByte[oct];\n                break;\n            case 6:\n            case 7:\n                buf[13 - i++] = _hexToByte[oct];\n                break;\n            case 8:\n            case 9:\n            case 10:\n            case 11:\n            case 12:\n            case 13:\n            case 14:\n            case 15:\n                buf[i++] = _hexToByte[oct];\n                break;\n        }\n    }));\n    // Zero out remaining bytes if string was short\n    while (i < 16) {\n        buf[i++] = 0;\n    }\n    return buf;\n}\n/** Convert UUID byte array into a string */\nexport function arrayToGuid(buf) {\n    if (buf.length !== 16) {\n        throw new Error(\"Byte array for GUID must be exactly 16 bytes long\");\n    }\n    if (!_convertMapsInitialized) {\n        initConvertMaps();\n    }\n    const guid = _byteToHex[buf[3]] + _byteToHex[buf[2]] +\n        _byteToHex[buf[1]] + _byteToHex[buf[0]] + \"-\" +\n        _byteToHex[buf[5]] + _byteToHex[buf[4]] + \"-\" +\n        _byteToHex[buf[7]] + _byteToHex[buf[6]] + \"-\" +\n        _byteToHex[buf[8]] + _byteToHex[buf[9]] + \"-\" +\n        _byteToHex[buf[10]] + _byteToHex[buf[11]] +\n        _byteToHex[buf[12]] + _byteToHex[buf[13]] +\n        _byteToHex[buf[14]] + _byteToHex[buf[15]];\n    return guid;\n}\n","import { toIterator, getEnumerator } from \"./Util.js\";\r\nimport { iterate, map, iterateIndexed, concat } from \"./Seq.js\";\r\nimport { FSharpRef } from \"./Types.js\";\r\nimport { class_type } from \"./Reflection.js\";\r\nimport { getItemFromDict, tryGetValue } from \"./MapUtil.js\";\r\nimport { some } from \"./Option.js\";\r\n\r\nexport class HashSet {\r\n    constructor(items, comparer) {\r\n        const this$ = new FSharpRef(null);\r\n        this.comparer = comparer;\r\n        this$.contents = this;\r\n        this.hashMap = (new Map([]));\r\n        this[\"init@8-2\"] = 1;\r\n        const enumerator = getEnumerator(items);\r\n        try {\r\n            while (enumerator[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n                void HashSet__Add_2B595(this$.contents, enumerator[\"System.Collections.Generic.IEnumerator`1.get_Current\"]());\r\n            }\r\n        }\r\n        finally {\r\n            enumerator.Dispose();\r\n        }\r\n    }\r\n    get [Symbol.toStringTag]() {\r\n        return \"HashSet\";\r\n    }\r\n    toJSON(_key) {\r\n        const this$ = this;\r\n        return Array.from(this$);\r\n    }\r\n    [\"System.Collections.IEnumerable.GetEnumerator\"]() {\r\n        const this$ = this;\r\n        return getEnumerator(this$);\r\n    }\r\n    GetEnumerator() {\r\n        const this$ = this;\r\n        return getEnumerator(concat(this$.hashMap.values()));\r\n    }\r\n    [Symbol.iterator]() {\r\n        return toIterator(this.GetEnumerator());\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.Add2B595\"](item) {\r\n        const this$ = this;\r\n        void HashSet__Add_2B595(this$, item);\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.Clear\"]() {\r\n        const this$ = this;\r\n        HashSet__Clear(this$);\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.Contains2B595\"](item) {\r\n        const this$ = this;\r\n        return HashSet__Contains_2B595(this$, item);\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.CopyToZ2E171D71\"](array, arrayIndex) {\r\n        const this$ = this;\r\n        iterateIndexed((i, e) => {\r\n            array[arrayIndex + i] = e;\r\n        }, this$);\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.get_Count\"]() {\r\n        const this$ = this;\r\n        return HashSet__get_Count(this$) | 0;\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.get_IsReadOnly\"]() {\r\n        return false;\r\n    }\r\n    [\"System.Collections.Generic.ICollection`1.Remove2B595\"](item) {\r\n        const this$ = this;\r\n        return HashSet__Remove_2B595(this$, item);\r\n    }\r\n    get size() {\r\n        const this$ = this;\r\n        return HashSet__get_Count(this$) | 0;\r\n    }\r\n    add(k) {\r\n        const this$ = this;\r\n        void HashSet__Add_2B595(this$, k);\r\n        return this$;\r\n    }\r\n    clear() {\r\n        const this$ = this;\r\n        HashSet__Clear(this$);\r\n    }\r\n    delete(k) {\r\n        const this$ = this;\r\n        return HashSet__Remove_2B595(this$, k);\r\n    }\r\n    has(k) {\r\n        const this$ = this;\r\n        return HashSet__Contains_2B595(this$, k);\r\n    }\r\n    keys() {\r\n        const this$ = this;\r\n        return map((x) => x, this$);\r\n    }\r\n    values() {\r\n        const this$ = this;\r\n        return map((x) => x, this$);\r\n    }\r\n    entries() {\r\n        const this$ = this;\r\n        return map((v) => [v, v], this$);\r\n    }\r\n    forEach(f, thisArg) {\r\n        const this$ = this;\r\n        iterate((x) => {\r\n            f(x, x, this$);\r\n        }, this$);\r\n    }\r\n}\r\n\r\nexport function HashSet$reflection(gen0) {\r\n    return class_type(\"Fable.Collections.HashSet\", [gen0], HashSet);\r\n}\r\n\r\nexport function HashSet_$ctor_Z6150332D(items, comparer) {\r\n    return new HashSet(items, comparer);\r\n}\r\n\r\nfunction HashSet__TryFindIndex_2B595(this$, k) {\r\n    const h = this$.comparer.GetHashCode(k) | 0;\r\n    let matchValue;\r\n    let outArg = null;\r\n    matchValue = [tryGetValue(this$.hashMap, h, new FSharpRef(() => outArg, (v) => {\r\n        outArg = v;\r\n    })), outArg];\r\n    if (matchValue[0]) {\r\n        return [true, h, matchValue[1].findIndex((v_1) => this$.comparer.Equals(k, v_1))];\r\n    }\r\n    else {\r\n        return [false, h, -1];\r\n    }\r\n}\r\n\r\nfunction HashSet__TryFind_2B595(this$, k) {\r\n    const matchValue = HashSet__TryFindIndex_2B595(this$, k);\r\n    let pattern_matching_result;\r\n    if (matchValue[0]) {\r\n        if (matchValue[2] > -1) {\r\n            pattern_matching_result = 0;\r\n        }\r\n        else {\r\n            pattern_matching_result = 1;\r\n        }\r\n    }\r\n    else {\r\n        pattern_matching_result = 1;\r\n    }\r\n    switch (pattern_matching_result) {\r\n        case 0: {\r\n            return some(getItemFromDict(this$.hashMap, matchValue[1])[matchValue[2]]);\r\n        }\r\n        case 1: {\r\n            return void 0;\r\n        }\r\n    }\r\n}\r\n\r\nexport function HashSet__get_Comparer(this$) {\r\n    return this$.comparer;\r\n}\r\n\r\nexport function HashSet__Clear(this$) {\r\n    this$.hashMap.clear();\r\n}\r\n\r\nexport function HashSet__get_Count(this$) {\r\n    let count = 0;\r\n    let enumerator = getEnumerator(this$.hashMap.values());\r\n    try {\r\n        while (enumerator[\"System.Collections.IEnumerator.MoveNext\"]()) {\r\n            const items = enumerator[\"System.Collections.Generic.IEnumerator`1.get_Current\"]();\r\n            count = ((count + items.length) | 0);\r\n        }\r\n    }\r\n    finally {\r\n        enumerator.Dispose();\r\n    }\r\n    return count | 0;\r\n}\r\n\r\nexport function HashSet__Add_2B595(this$, k) {\r\n    const matchValue = HashSet__TryFindIndex_2B595(this$, k);\r\n    let pattern_matching_result;\r\n    if (matchValue[0]) {\r\n        if (matchValue[2] > -1) {\r\n            pattern_matching_result = 0;\r\n        }\r\n        else {\r\n            pattern_matching_result = 1;\r\n        }\r\n    }\r\n    else {\r\n        pattern_matching_result = 1;\r\n    }\r\n    switch (pattern_matching_result) {\r\n        case 0: {\r\n            return false;\r\n        }\r\n        case 1: {\r\n            if (matchValue[0]) {\r\n                const value = void (getItemFromDict(this$.hashMap, matchValue[1]).push(k));\r\n                return true;\r\n            }\r\n            else {\r\n                this$.hashMap.set(matchValue[1], [k]);\r\n                return true;\r\n            }\r\n        }\r\n    }\r\n}\r\n\r\nexport function HashSet__Contains_2B595(this$, k) {\r\n    const matchValue = HashSet__TryFindIndex_2B595(this$, k);\r\n    let pattern_matching_result;\r\n    if (matchValue[0]) {\r\n        if (matchValue[2] > -1) {\r\n            pattern_matching_result = 0;\r\n        }\r\n        else {\r\n            pattern_matching_result = 1;\r\n        }\r\n    }\r\n    else {\r\n        pattern_matching_result = 1;\r\n    }\r\n    switch (pattern_matching_result) {\r\n        case 0: {\r\n            return true;\r\n        }\r\n        case 1: {\r\n            return false;\r\n        }\r\n    }\r\n}\r\n\r\nexport function HashSet__Remove_2B595(this$, k) {\r\n    const matchValue = HashSet__TryFindIndex_2B595(this$, k);\r\n    let pattern_matching_result;\r\n    if (matchValue[0]) {\r\n        if (matchValue[2] > -1) {\r\n            pattern_matching_result = 0;\r\n        }\r\n        else {\r\n            pattern_matching_result = 1;\r\n        }\r\n    }\r\n    else {\r\n        pattern_matching_result = 1;\r\n    }\r\n    switch (pattern_matching_result) {\r\n        case 0: {\r\n            getItemFromDict(this$.hashMap, matchValue[1]).splice(matchValue[2], 1);\r\n            return true;\r\n        }\r\n        case 1: {\r\n            return false;\r\n        }\r\n    }\r\n}\r\n\r\n","const littleEndian = true;\nfunction utf16le_encode(str) {\n    const bytes = new Uint8Array(str.length * 2);\n    const view = new DataView(bytes.buffer);\n    for (let i = 0; i < str.length; i++) {\n        const code = str.charCodeAt(i);\n        view.setUint16(i * 2, code, littleEndian);\n    }\n    return bytes;\n}\nfunction utf16le_decode(bytes) {\n    const array = ArrayBuffer.isView(bytes) ? bytes : Uint8Array.from(bytes);\n    const view = new DataView(array.buffer, array.byteOffset, array.byteLength);\n    const chars = new Array(view.byteLength / 2);\n    for (let i = 0; i < chars.length; i++) {\n        const code = view.getUint16(i * 2, littleEndian);\n        chars[i] = String.fromCharCode(code);\n    }\n    return chars.join(\"\");\n}\nfunction utf8_encode(str) {\n    let pos = 0;\n    let buf = new Uint8Array(str.length * 3);\n    for (let i = 0; i < str.length; i++) {\n        let code = str.charCodeAt(i);\n        if (code >= 0xD800 && code <= 0xDBFF) {\n            const nextCode = (i < str.length) ? str.charCodeAt(i + 1) : 0;\n            if (nextCode >= 0xDC00 && nextCode <= 0xDFFF) {\n                i += 1;\n                code = (code - 0xD800) * 0x400 + nextCode - 0xDC00 + 0x10000;\n                if (code > 0xFFFF) {\n                    buf[pos++] = (0x1E << 3) | (code >>> 18);\n                    buf[pos++] = (0x2 << 6) | ((code >>> 12) & 0x3F);\n                    buf[pos++] = (0x2 << 6) | ((code >>> 6) & 0x3F);\n                    buf[pos++] = (0x2 << 6) | (code & 0x3F);\n                }\n            }\n            else {\n                buf[pos++] = 0xEF;\n                buf[pos++] = 0xBF;\n                buf[pos++] = 0xBD;\n            }\n        }\n        else if (code <= 0x007F) {\n            buf[pos++] = (0x0 << 7) | code;\n        }\n        else if (code <= 0x07FF) {\n            buf[pos++] = (0x6 << 5) | (code >>> 6);\n            buf[pos++] = (0x2 << 6) | (code & 0x3F);\n        }\n        else {\n            buf[pos++] = (0xE << 4) | (code >>> 12);\n            buf[pos++] = (0x2 << 6) | ((code >>> 6) & 0x3F);\n            buf[pos++] = (0x2 << 6) | (code & 0x3F);\n        }\n    }\n    buf = new Uint8Array(buf.buffer.slice(0, pos));\n    return buf;\n}\nfunction utf8_decode(bytes) {\n    let pos = 0;\n    const decodeUtf8 = () => {\n        const i1 = bytes[pos++];\n        if ((i1 & 0x80) === 0) {\n            return i1;\n        }\n        else if ((i1 & 0xE0) === 0xC0) {\n            const i2 = bytes[pos++];\n            return ((i1 & 0x1F) << 6) | (i2 & 0x3F);\n        }\n        else if ((i1 & 0xF0) === 0xE0) {\n            const i2 = bytes[pos++];\n            const i3 = bytes[pos++];\n            return ((i1 & 0x0F) << 12) | ((i2 & 0x3F) << 6) | (i3 & 0x3F);\n        }\n        else if ((i1 & 0xF8) === 0xF0) {\n            const i2 = bytes[pos++];\n            const i3 = bytes[pos++];\n            const i4 = bytes[pos++];\n            return ((i1 & 0x07) << 18) | ((i2 & 0x3F) << 12) | ((i3 & 0x3F) << 6) | (i4 & 0x3F);\n        }\n        else {\n            throw new RangeError(\"Invalid UTF8 byte: \" + i1);\n        }\n    };\n    const chars = new Array();\n    while (pos < bytes.length) {\n        const code = decodeUtf8();\n        chars.push(String.fromCodePoint(code));\n    }\n    return chars.join(\"\");\n}\nclass UTF16LE {\n    getBytes(str, index, count) {\n        str = Array.isArray(str) ? str.join(\"\") : str;\n        if (index != null && count != null) {\n            str = str.substring(index, index + count);\n        }\n        else if (index != null) {\n            str = str.substring(index);\n        }\n        if (typeof Buffer !== \"undefined\") {\n            const bytes = Buffer.from(str, \"utf16le\");\n            return new Uint8Array(bytes.buffer, bytes.byteOffset, bytes.byteLength);\n        }\n        else {\n            return utf16le_encode(str); // polyfill\n        }\n    }\n    getString(bytes, index, count) {\n        const array = ArrayBuffer.isView(bytes) ? bytes : Uint8Array.from(bytes);\n        let buffer = new Uint8Array(array.buffer, array.byteOffset, array.byteLength);\n        if (index != null && count != null) {\n            buffer = buffer.subarray(index, index + count);\n        }\n        else if (index != null) {\n            buffer = buffer.subarray(index);\n        }\n        if (typeof TextDecoder !== \"undefined\") {\n            return new TextDecoder(\"utf-16le\").decode(buffer);\n        }\n        else if (typeof Buffer !== \"undefined\") {\n            return Buffer.from(buffer).toString(\"utf16le\");\n        }\n        else {\n            return utf16le_decode(buffer); // polyfill\n        }\n    }\n}\nclass UTF8 {\n    getBytes(str, index, count) {\n        str = Array.isArray(str) ? str.join(\"\") : str;\n        if (index != null && count != null) {\n            str = str.substring(index, index + count);\n        }\n        else if (index != null) {\n            str = str.substring(index);\n        }\n        if (typeof TextEncoder !== \"undefined\") {\n            return new TextEncoder().encode(str);\n        }\n        else if (typeof Buffer !== \"undefined\") {\n            const bytes = Buffer.from(str, \"utf8\");\n            return new Uint8Array(bytes.buffer, bytes.byteOffset, bytes.byteLength);\n        }\n        else {\n            return utf8_encode(str); // polyfill\n        }\n    }\n    getString(bytes, index, count) {\n        const array = ArrayBuffer.isView(bytes) ? bytes : Uint8Array.from(bytes);\n        let buffer = new Uint8Array(array.buffer, array.byteOffset, array.byteLength);\n        if (index != null && count != null) {\n            buffer = buffer.subarray(index, index + count);\n        }\n        else if (index != null) {\n            buffer = buffer.subarray(index);\n        }\n        if (typeof TextDecoder !== \"undefined\") {\n            return new TextDecoder().decode(buffer);\n        }\n        else if (typeof Buffer !== \"undefined\") {\n            return Buffer.from(buffer).toString(\"utf8\");\n        }\n        else {\n            return utf8_decode(buffer); // polyfill\n        }\n    }\n}\nconst _UTF16 = new UTF16LE();\nconst _UTF8 = new UTF8();\nexport function get_Unicode() { return _UTF16; }\nexport function get_UTF8() { return _UTF8; }\n","export default function quote(inputText) {\r\n    var escapable = /[\\\\\\\"\\x00-\\x1f\\x7f-\\x9f\\u00ad\\u0600-\\u0604\\u070f\\u17b4\\u17b5\\u200c-\\u200f\\u2028-\\u202f\\u2060-\\u206f\\ufeff\\ufff0-\\uffff]/g;\r\n    var meta = {\r\n        '\\b': '\\\\b',\r\n        '\\t': '\\\\t',\r\n        '\\n': '\\\\n',\r\n        '\\f': '\\\\f',\r\n        '\\r': '\\\\r',\r\n        '\"': '\\\\\"',\r\n        '\\\\': '\\\\\\\\'\r\n    }\r\n\r\n    escapable.lastIndex = 0;\r\n    return escapable.test(inputText) ?\r\n        '\"' + inputText.replace(escapable, function (a) {\r\n            var c = meta[a];\r\n            return typeof c === 'string' ? c :\r\n                '\\\\u' + ('0000' + a.charCodeAt(0).toString(16)).slice(-4);\r\n        }) + '\"' :\r\n        '\"' + inputText + '\"';\r\n}","export class CancellationToken {\n    constructor(cancelled = false) {\n        this._id = 0;\n        this._cancelled = cancelled;\n        this._listeners = new Map();\n    }\n    get isCancelled() {\n        return this._cancelled;\n    }\n    cancel() {\n        if (!this._cancelled) {\n            this._cancelled = true;\n            for (const [, listener] of this._listeners) {\n                listener();\n            }\n        }\n    }\n    addListener(f) {\n        const id = this._id;\n        this._listeners.set(this._id++, f);\n        return id;\n    }\n    removeListener(id) {\n        return this._listeners.delete(id);\n    }\n    register(f, state) {\n        const $ = this;\n        const id = this.addListener(state == null ? f : () => f(state));\n        return { Dispose() { $.removeListener(id); } };\n    }\n}\nexport class OperationCanceledError extends Error {\n    constructor() {\n        super(\"The operation was canceled\");\n        Object.setPrototypeOf(this, OperationCanceledError.prototype);\n    }\n}\nexport class Trampoline {\n    constructor() {\n        this.callCount = 0;\n    }\n    static get maxTrampolineCallCount() {\n        return 2000;\n    }\n    incrementAndCheck() {\n        return this.callCount++ > Trampoline.maxTrampolineCallCount;\n    }\n    hijack(f) {\n        this.callCount = 0;\n        setTimeout(f, 0);\n    }\n}\nexport function protectedCont(f) {\n    return (ctx) => {\n        if (ctx.cancelToken.isCancelled) {\n            ctx.onCancel(new OperationCanceledError());\n        }\n        else if (ctx.trampoline.incrementAndCheck()) {\n            ctx.trampoline.hijack(() => {\n                try {\n                    f(ctx);\n                }\n                catch (err) {\n                    ctx.onError(err);\n                }\n            });\n        }\n        else {\n            try {\n                f(ctx);\n            }\n            catch (err) {\n                ctx.onError(err);\n            }\n        }\n    };\n}\nexport function protectedBind(computation, binder) {\n    return protectedCont((ctx) => {\n        computation({\n            onSuccess: (x) => {\n                try {\n                    binder(x)(ctx);\n                }\n                catch (ex) {\n                    ctx.onError(ex);\n                }\n            },\n            onError: ctx.onError,\n            onCancel: ctx.onCancel,\n            cancelToken: ctx.cancelToken,\n            trampoline: ctx.trampoline,\n        });\n    });\n}\nexport function protectedReturn(value) {\n    return protectedCont((ctx) => ctx.onSuccess(value));\n}\nexport class AsyncBuilder {\n    Bind(computation, binder) {\n        return protectedBind(computation, binder);\n    }\n    Combine(computation1, computation2) {\n        return this.Bind(computation1, () => computation2);\n    }\n    Delay(generator) {\n        return protectedCont((ctx) => generator()(ctx));\n    }\n    For(sequence, body) {\n        const iter = sequence[Symbol.iterator]();\n        let cur = iter.next();\n        return this.While(() => !cur.done, this.Delay(() => {\n            const res = body(cur.value);\n            cur = iter.next();\n            return res;\n        }));\n    }\n    Return(value) {\n        return protectedReturn(value);\n    }\n    ReturnFrom(computation) {\n        return computation;\n    }\n    TryFinally(computation, compensation) {\n        return protectedCont((ctx) => {\n            computation({\n                onSuccess: (x) => {\n                    compensation();\n                    ctx.onSuccess(x);\n                },\n                onError: (x) => {\n                    compensation();\n                    ctx.onError(x);\n                },\n                onCancel: (x) => {\n                    compensation();\n                    ctx.onCancel(x);\n                },\n                cancelToken: ctx.cancelToken,\n                trampoline: ctx.trampoline,\n            });\n        });\n    }\n    TryWith(computation, catchHandler) {\n        return protectedCont((ctx) => {\n            computation({\n                onSuccess: ctx.onSuccess,\n                onCancel: ctx.onCancel,\n                cancelToken: ctx.cancelToken,\n                trampoline: ctx.trampoline,\n                onError: (ex) => {\n                    try {\n                        catchHandler(ex)(ctx);\n                    }\n                    catch (ex2) {\n                        ctx.onError(ex2);\n                    }\n                },\n            });\n        });\n    }\n    Using(resource, binder) {\n        return this.TryFinally(binder(resource), () => resource.Dispose());\n    }\n    While(guard, computation) {\n        if (guard()) {\n            return this.Bind(computation, () => this.While(guard, computation));\n        }\n        else {\n            return this.Return(void 0);\n        }\n    }\n    Zero() {\n        return protectedCont((ctx) => ctx.onSuccess(void 0));\n    }\n}\nexport const singleton = new AsyncBuilder();\n","import { Union } from \"./Types.js\";\r\nimport { union_type } from \"./Reflection.js\";\r\nimport { some } from \"./Option.js\";\r\n\r\nexport class FSharpResult$2 extends Union {\r\n    constructor(tag, ...fields) {\r\n        super();\r\n        this.tag = (tag | 0);\r\n        this.fields = fields;\r\n    }\r\n    cases() {\r\n        return [\"Ok\", \"Error\"];\r\n    }\r\n}\r\n\r\nexport function FSharpResult$2$reflection(gen0, gen1) {\r\n    return union_type(\"FSharp.Core.FSharpResult`2\", [gen0, gen1], FSharpResult$2, () => [[[\"ResultValue\", gen0]], [[\"ErrorValue\", gen1]]]);\r\n}\r\n\r\nexport function Result_Map(mapping, result) {\r\n    if (result.tag === 0) {\r\n        return new FSharpResult$2(0, mapping(result.fields[0]));\r\n    }\r\n    else {\r\n        return new FSharpResult$2(1, result.fields[0]);\r\n    }\r\n}\r\n\r\nexport function Result_MapError(mapping, result) {\r\n    if (result.tag === 0) {\r\n        return new FSharpResult$2(0, result.fields[0]);\r\n    }\r\n    else {\r\n        return new FSharpResult$2(1, mapping(result.fields[0]));\r\n    }\r\n}\r\n\r\nexport function Result_Bind(binder, result) {\r\n    if (result.tag === 0) {\r\n        return binder(result.fields[0]);\r\n    }\r\n    else {\r\n        return new FSharpResult$2(1, result.fields[0]);\r\n    }\r\n}\r\n\r\nexport class FSharpChoice$2 extends Union {\r\n    constructor(tag, ...fields) {\r\n        super();\r\n        this.tag = (tag | 0);\r\n        this.fields = fields;\r\n    }\r\n    cases() {\r\n        return [\"Choice1Of2\", \"Choice2Of2\"];\r\n    }\r\n}\r\n\r\nexport function FSharpChoice$2$reflection(gen0, gen1) {\r\n    return union_type(\"FSharp.Core.FSharpChoice`2\", [gen0, gen1], FSharpChoice$2, () => [[[\"Item\", gen0]], [[\"Item\", gen1]]]);\r\n}\r\n\r\nexport class FSharpChoice$3 extends Union {\r\n    constructor(tag, ...fields) {\r\n        super();\r\n        this.tag = (tag | 0);\r\n        this.fields = fields;\r\n    }\r\n    cases() {\r\n        return [\"Choice1Of3\", \"Choice2Of3\", \"Choice3Of3\"];\r\n    }\r\n}\r\n\r\nexport function FSharpChoice$3$reflection(gen0, gen1, gen2) {\r\n    return union_type(\"FSharp.Core.FSharpChoice`3\", [gen0, gen1, gen2], FSharpChoice$3, () => [[[\"Item\", gen0]], [[\"Item\", gen1]], [[\"Item\", gen2]]]);\r\n}\r\n\r\nexport class FSharpChoice$4 extends Union {\r\n    constructor(tag, ...fields) {\r\n        super();\r\n        this.tag = (tag | 0);\r\n        this.fields = fields;\r\n    }\r\n    cases() {\r\n        return [\"Choice1Of4\", \"Choice2Of4\", \"Choice3Of4\", \"Choice4Of4\"];\r\n    }\r\n}\r\n\r\nexport function FSharpChoice$4$reflection(gen0, gen1, gen2, gen3) {\r\n    return union_type(\"FSharp.Core.FSharpChoice`4\", [gen0, gen1, gen2, gen3], FSharpChoice$4, () => [[[\"Item\", gen0]], [[\"Item\", gen1]], [[\"Item\", gen2]], [[\"Item\", gen3]]]);\r\n}\r\n\r\nexport class FSharpChoice$5 extends Union {\r\n    constructor(tag, ...fields) {\r\n        super();\r\n        this.tag = (tag | 0);\r\n        this.fields = fields;\r\n    }\r\n    cases() {\r\n        return [\"Choice1Of5\", \"Choice2Of5\", \"Choice3Of5\", \"Choice4Of5\", \"Choice5Of5\"];\r\n    }\r\n}\r\n\r\nexport function FSharpChoice$5$reflection(gen0, gen1, gen2, gen3, gen4) {\r\n    return union_type(\"FSharp.Core.FSharpChoice`5\", [gen0, gen1, gen2, gen3, gen4], FSharpChoice$5, () => [[[\"Item\", gen0]], [[\"Item\", gen1]], [[\"Item\", gen2]], [[\"Item\", gen3]], [[\"Item\", gen4]]]);\r\n}\r\n\r\nexport class FSharpChoice$6 extends Union {\r\n    constructor(tag, ...fields) {\r\n        super();\r\n        this.tag = (tag | 0);\r\n        this.fields = fields;\r\n    }\r\n    cases() {\r\n        return [\"Choice1Of6\", \"Choice2Of6\", \"Choice3Of6\", \"Choice4Of6\", \"Choice5Of6\", \"Choice6Of6\"];\r\n    }\r\n}\r\n\r\nexport function FSharpChoice$6$reflection(gen0, gen1, gen2, gen3, gen4, gen5) {\r\n    return union_type(\"FSharp.Core.FSharpChoice`6\", [gen0, gen1, gen2, gen3, gen4, gen5], FSharpChoice$6, () => [[[\"Item\", gen0]], [[\"Item\", gen1]], [[\"Item\", gen2]], [[\"Item\", gen3]], [[\"Item\", gen4]], [[\"Item\", gen5]]]);\r\n}\r\n\r\nexport class FSharpChoice$7 extends Union {\r\n    constructor(tag, ...fields) {\r\n        super();\r\n        this.tag = (tag | 0);\r\n        this.fields = fields;\r\n    }\r\n    cases() {\r\n        return [\"Choice1Of7\", \"Choice2Of7\", \"Choice3Of7\", \"Choice4Of7\", \"Choice5Of7\", \"Choice6Of7\", \"Choice7Of7\"];\r\n    }\r\n}\r\n\r\nexport function FSharpChoice$7$reflection(gen0, gen1, gen2, gen3, gen4, gen5, gen6) {\r\n    return union_type(\"FSharp.Core.FSharpChoice`7\", [gen0, gen1, gen2, gen3, gen4, gen5, gen6], FSharpChoice$7, () => [[[\"Item\", gen0]], [[\"Item\", gen1]], [[\"Item\", gen2]], [[\"Item\", gen3]], [[\"Item\", gen4]], [[\"Item\", gen5]], [[\"Item\", gen6]]]);\r\n}\r\n\r\nexport function Choice_makeChoice1Of2(x) {\r\n    return new FSharpChoice$2(0, x);\r\n}\r\n\r\nexport function Choice_makeChoice2Of2(x) {\r\n    return new FSharpChoice$2(1, x);\r\n}\r\n\r\nexport function Choice_tryValueIfChoice1Of2(x) {\r\n    if (x.tag === 0) {\r\n        return some(x.fields[0]);\r\n    }\r\n    else {\r\n        return void 0;\r\n    }\r\n}\r\n\r\nexport function Choice_tryValueIfChoice2Of2(x) {\r\n    if (x.tag === 1) {\r\n        return some(x.fields[0]);\r\n    }\r\n    else {\r\n        return void 0;\r\n    }\r\n}\r\n\r\n","import { OperationCanceledError, Trampoline } from \"./AsyncBuilder.js\";\nimport { CancellationToken } from \"./AsyncBuilder.js\";\nimport { protectedCont } from \"./AsyncBuilder.js\";\nimport { protectedBind } from \"./AsyncBuilder.js\";\nimport { protectedReturn } from \"./AsyncBuilder.js\";\nimport { Choice_makeChoice1Of2, Choice_makeChoice2Of2 } from \"./Choice.js\";\n// Implemented just for type references\nexport class Async {\n}\nfunction emptyContinuation(_x) {\n    // NOP\n}\n// MakeAsync: body:(AsyncActivation<'T> -> AsyncReturn) -> Async<'T>\nexport function makeAsync(body) {\n    return body;\n}\n// Invoke: computation: Async<'T> -> ctxt:AsyncActivation<'T> -> AsyncReturn\nexport function invoke(computation, ctx) {\n    return computation(ctx);\n}\n// CallThenInvoke: ctxt:AsyncActivation<'T> -> result1:'U -> part2:('U -> Async<'T>) -> AsyncReturn\nexport function callThenInvoke(ctx, result1, part2) {\n    return part2(result1)(ctx);\n}\n// Bind: ctxt:AsyncActivation<'T> -> part1:Async<'U> -> part2:('U -> Async<'T>) -> AsyncReturn\nexport function bind(ctx, part1, part2) {\n    return protectedBind(part1, part2)(ctx);\n}\nexport function createCancellationToken(arg) {\n    const token = new CancellationToken(typeof arg === \"boolean\" ? arg : false);\n    if (typeof arg === \"number\") {\n        setTimeout(() => { token.cancel(); }, arg);\n    }\n    return token;\n}\nexport function cancel(token) {\n    token.cancel();\n}\nexport function cancelAfter(token, ms) {\n    setTimeout(() => { token.cancel(); }, ms);\n}\nexport function isCancellationRequested(token) {\n    return token != null && token.isCancelled;\n}\nexport function throwIfCancellationRequested(token) {\n    if (token != null && token.isCancelled) {\n        throw new Error(\"Operation is cancelled\");\n    }\n}\nexport function startChild(computation) {\n    const promise = startAsPromise(computation);\n    // JS Promises are hot, computation has already started\n    // but we delay returning the result\n    return protectedCont((ctx) => protectedReturn(awaitPromise(promise))(ctx));\n}\nexport function awaitPromise(p) {\n    return fromContinuations((conts) => p.then(conts[0]).catch((err) => (err instanceof OperationCanceledError\n        ? conts[2] : conts[1])(err)));\n}\nexport function cancellationToken() {\n    return protectedCont((ctx) => ctx.onSuccess(ctx.cancelToken));\n}\nexport const defaultCancellationToken = new CancellationToken();\nexport function catchAsync(work) {\n    return protectedCont((ctx) => {\n        work({\n            onSuccess: (x) => ctx.onSuccess(Choice_makeChoice1Of2(x)),\n            onError: (ex) => ctx.onSuccess(Choice_makeChoice2Of2(ex)),\n            onCancel: ctx.onCancel,\n            cancelToken: ctx.cancelToken,\n            trampoline: ctx.trampoline,\n        });\n    });\n}\nexport function fromContinuations(f) {\n    return protectedCont((ctx) => f([ctx.onSuccess, ctx.onError, ctx.onCancel]));\n}\nexport function ignore(computation) {\n    return protectedBind(computation, (_x) => protectedReturn(void 0));\n}\nexport function parallel(computations) {\n    return awaitPromise(Promise.all(Array.from(computations, (w) => startAsPromise(w))));\n}\nexport function sleep(millisecondsDueTime) {\n    return protectedCont((ctx) => {\n        let tokenId;\n        const timeoutId = setTimeout(() => {\n            ctx.cancelToken.removeListener(tokenId);\n            ctx.onSuccess(void 0);\n        }, millisecondsDueTime);\n        tokenId = ctx.cancelToken.addListener(() => {\n            clearTimeout(timeoutId);\n            ctx.onCancel(new OperationCanceledError());\n        });\n    });\n}\nexport function start(computation, cancellationToken) {\n    return startWithContinuations(computation, cancellationToken);\n}\nexport function startImmediate(computation, cancellationToken) {\n    return start(computation, cancellationToken);\n}\nexport function startWithContinuations(computation, continuation, exceptionContinuation, cancellationContinuation, cancelToken) {\n    if (typeof continuation !== \"function\") {\n        cancelToken = continuation;\n        continuation = undefined;\n    }\n    const trampoline = new Trampoline();\n    computation({\n        onSuccess: continuation ? continuation : emptyContinuation,\n        onError: exceptionContinuation ? exceptionContinuation : emptyContinuation,\n        onCancel: cancellationContinuation ? cancellationContinuation : emptyContinuation,\n        cancelToken: cancelToken ? cancelToken : defaultCancellationToken,\n        trampoline,\n    });\n}\nexport function startAsPromise(computation, cancellationToken) {\n    return new Promise((resolve, reject) => startWithContinuations(computation, resolve, reject, reject, cancellationToken ? cancellationToken : defaultCancellationToken));\n}\nexport default Async;\n","import { Choice_tryValueIfChoice1Of2, Choice_tryValueIfChoice2Of2 } from \"./Choice.js\";\nimport { value } from \"./Option.js\";\nexport class Observer {\n    constructor(onNext, onError, onCompleted) {\n        this.OnNext = onNext;\n        this.OnError = onError || ((_e) => { return; });\n        this.OnCompleted = onCompleted || (() => { return; });\n    }\n}\nclass Observable {\n    constructor(subscribe) {\n        this.Subscribe = subscribe;\n    }\n}\nexport function protect(f, succeed, fail) {\n    try {\n        return succeed(f());\n    }\n    catch (e) {\n        fail(e);\n    }\n}\nexport function add(callback, source) {\n    source.Subscribe(new Observer(callback));\n}\nexport function choose(chooser, source) {\n    return new Observable((observer) => source.Subscribe(new Observer((t) => protect(() => chooser(t), (u) => { if (u != null) {\n        observer.OnNext(value(u));\n    } }, observer.OnError), observer.OnError, observer.OnCompleted)));\n}\nexport function filter(predicate, source) {\n    return choose((x) => predicate(x) ? x : null, source);\n}\nexport function map(mapping, source) {\n    return new Observable((observer) => source.Subscribe(new Observer((t) => {\n        protect(() => mapping(t), observer.OnNext, observer.OnError);\n    }, observer.OnError, observer.OnCompleted)));\n}\nexport function merge(source1, source2) {\n    return new Observable((observer) => {\n        let stopped = false;\n        let completed1 = false;\n        let completed2 = false;\n        const h1 = source1.Subscribe(new Observer((v) => { if (!stopped) {\n            observer.OnNext(v);\n        } }, (e) => {\n            if (!stopped) {\n                stopped = true;\n                observer.OnError(e);\n            }\n        }, () => {\n            if (!stopped) {\n                completed1 = true;\n                if (completed2) {\n                    stopped = true;\n                    observer.OnCompleted();\n                }\n            }\n        }));\n        const h2 = source2.Subscribe(new Observer((v) => { if (!stopped) {\n            observer.OnNext(v);\n        } }, (e) => {\n            if (!stopped) {\n                stopped = true;\n                observer.OnError(e);\n            }\n        }, () => {\n            if (!stopped) {\n                completed2 = true;\n                if (completed1) {\n                    stopped = true;\n                    observer.OnCompleted();\n                }\n            }\n        }));\n        return {\n            Dispose() {\n                h1.Dispose();\n                h2.Dispose();\n            },\n        };\n    });\n}\nexport function pairwise(source) {\n    return new Observable((observer) => {\n        let last;\n        return source.Subscribe(new Observer((next) => {\n            if (last != null) {\n                observer.OnNext([last, next]);\n            }\n            last = next;\n        }, observer.OnError, observer.OnCompleted));\n    });\n}\nexport function partition(predicate, source) {\n    return [filter(predicate, source), filter((x) => !predicate(x), source)];\n}\nexport function scan(collector, state, source) {\n    return new Observable((observer) => {\n        return source.Subscribe(new Observer((t) => {\n            protect(() => collector(state, t), (u) => { state = u; observer.OnNext(u); }, observer.OnError);\n        }, observer.OnError, observer.OnCompleted));\n    });\n}\nexport function split(splitter, source) {\n    return [\n        choose((v) => Choice_tryValueIfChoice1Of2(splitter(v)), source),\n        choose((v) => Choice_tryValueIfChoice2Of2(splitter(v)), source)\n    ];\n}\nexport function subscribe(callback, source) {\n    return source.Subscribe(new Observer(callback));\n}\n","import { Observer } from \"./Observable.js\";\nimport { some, value } from \"./Option.js\";\nimport { Choice_tryValueIfChoice1Of2, Choice_tryValueIfChoice2Of2 } from \"./Choice.js\";\nexport class Event {\n    constructor() {\n        this.delegates = [];\n    }\n    Add(f) {\n        this._addHandler(f);\n    }\n    get Publish() {\n        return this;\n    }\n    Trigger(senderOrValue, valueOrUndefined) {\n        let sender;\n        let value;\n        if (valueOrUndefined === undefined) {\n            sender = null;\n            value = senderOrValue;\n        }\n        else {\n            sender = senderOrValue;\n            value = valueOrUndefined;\n        }\n        this.delegates.forEach((f) => f.length === 1 ? f(value) : f(sender, value));\n    }\n    // IDelegateEvent<T> methods\n    AddHandler(handler) {\n        this._addHandler(handler);\n    }\n    RemoveHandler(handler) {\n        this._removeHandler(handler);\n    }\n    // IObservable<T> methods\n    Subscribe(arg) {\n        const callback = typeof arg === \"function\"\n            ? arg\n            : arg.OnNext;\n        this._addHandler(callback);\n        return { Dispose: () => { this._removeHandler(callback); } };\n    }\n    _addHandler(f) {\n        this.delegates.push(f);\n    }\n    _removeHandler(f) {\n        const index = this.delegates.indexOf(f);\n        if (index > -1) {\n            this.delegates.splice(index, 1);\n        }\n    }\n}\nexport function add(callback, sourceEvent) {\n    if (sourceEvent instanceof Event) {\n        sourceEvent.Add(callback);\n    }\n    else {\n        sourceEvent.Subscribe(new Observer(callback));\n    }\n}\nexport function choose(chooser, sourceEvent) {\n    const ev = new Event();\n    add((t) => {\n        const u = chooser(t);\n        if (u != null) {\n            ev.Trigger(value(u));\n        }\n    }, sourceEvent);\n    return ev;\n}\nexport function filter(predicate, sourceEvent) {\n    return choose((x) => predicate(x) ? some(x) : undefined, sourceEvent);\n}\nexport function map(mapping, sourceEvent) {\n    const ev = new Event();\n    add((t) => ev.Trigger(mapping(t)), sourceEvent);\n    return ev;\n}\nexport function merge(event1, event2) {\n    const ev = new Event();\n    const fn = (x) => ev.Trigger(x);\n    add(fn, event1);\n    add(fn, event2);\n    return ev;\n}\nexport function pairwise(sourceEvent) {\n    const ev = new Event();\n    let last;\n    let haveLast = false;\n    add((next) => {\n        if (haveLast) {\n            ev.Trigger([last, next]);\n        }\n        last = next;\n        haveLast = true;\n    }, sourceEvent);\n    return ev;\n}\nexport function partition(predicate, sourceEvent) {\n    return [filter(predicate, sourceEvent), filter((x) => !predicate(x), sourceEvent)];\n}\nexport function scan(collector, state, sourceEvent) {\n    return map((t) => state = collector(state, t), sourceEvent);\n}\nexport function split(splitter, sourceEvent) {\n    return [\n        choose((v) => Choice_tryValueIfChoice1Of2(splitter(v)), sourceEvent),\n        choose((v) => Choice_tryValueIfChoice2Of2(splitter(v)), sourceEvent),\n    ];\n}\nexport function createEvent(addHandler, removeHandler) {\n    return {\n        AddHandler(h) { addHandler(h); },\n        RemoveHandler(h) { removeHandler(h); },\n        Subscribe(r) {\n            const h = (_, args) => r.OnNext(args);\n            addHandler(h);\n            return {\n                Dispose() { removeHandler(h); }\n            };\n        }\n    };\n}\nexport default Event;\n","import Event from \"./Event.js\";\nexport class Timer {\n    constructor(interval) {\n        this._enabled = false;\n        this._isDisposed = false;\n        this._intervalId = 0;\n        this._timeoutId = 0;\n        this.Interval = interval && interval > 0 ? interval : 100;\n        this.AutoReset = true;\n        this._elapsed = new Event();\n    }\n    Elapsed() {\n        return this._elapsed;\n    }\n    get Enabled() {\n        return this._enabled;\n    }\n    set Enabled(x) {\n        if (!this._isDisposed && this._enabled !== x) {\n            this._enabled = x;\n            if (this._enabled) {\n                if (this.AutoReset) {\n                    this._intervalId = setInterval(() => {\n                        if (!this.AutoReset) {\n                            this.Enabled = false;\n                        }\n                        this._elapsed.Trigger(new Date());\n                    }, this.Interval);\n                }\n                else {\n                    this._timeoutId = setTimeout(() => {\n                        this.Enabled = false;\n                        this._timeoutId = 0;\n                        if (this.AutoReset) {\n                            this.Enabled = true;\n                        }\n                        this._elapsed.Trigger(new Date());\n                    }, this.Interval);\n                }\n            }\n            else {\n                if (this._timeoutId) {\n                    clearTimeout(this._timeoutId);\n                    this._timeoutId = 0;\n                }\n                if (this._intervalId) {\n                    clearInterval(this._intervalId);\n                    this._intervalId = 0;\n                }\n            }\n        }\n    }\n    Dispose() {\n        this.Enabled = false;\n        this._isDisposed = true;\n    }\n    Close() {\n        this.Dispose();\n    }\n    Start() {\n        this.Enabled = true;\n    }\n    Stop() {\n        this.Enabled = false;\n    }\n}\nexport default Timer;\n","namespace Elmish\n\n(**\nLog\n---------\nBasic cross-platform logging API.\n\n*)\nmodule internal Log =\n\n#if FABLE_COMPILER\n    open Fable.Core.JS\n\n    let onError (text: string, ex: exn) = console.error (text,ex)\n    let toConsole(text: string, o: #obj) = console.log(text,o)\n\n#else\n#if NETSTANDARD2_0\n    let onError (text: string, ex: exn) = System.Diagnostics.Trace.TraceError(\"{0}: {1}\", text, ex)\n    let toConsole(text: string, o: #obj) = printfn \"%s: %A\" text o\n#else\n    let onError (text: string, ex: exn) = System.Console.Error.WriteLine(\"{0}: {1}\", text, ex)\n    let toConsole(text: string, o: #obj) = printfn \"%s: %A\" text o\n#endif\n#endif\n\n#if FABLE_COMPILER\nmodule internal Timer =\n    open System.Timers\n    let delay interval callback =\n        let t = new Timer(float interval, AutoReset = false)\n        t.Elapsed.Add callback\n        t.Enabled <- true\n        t.Start()\n#endif\n","(**\nCmd\n---------\nCore abstractions for dispatching messages in Elmish.\n\n*)\n\nnamespace Elmish\n\nopen System\n\n/// Dispatch - feed new message into the processing loop\ntype Dispatch<'msg> = 'msg -> unit\n\n/// Subscription - return immediately, but may schedule dispatch of a message at any time\ntype Sub<'msg> = Dispatch<'msg> -> unit\n\n/// Cmd - container for subscriptions that may produce messages\ntype Cmd<'msg> = Sub<'msg> list\n\n/// Cmd module for creating and manipulating commands\n[<RequireQualifiedAccess>]\nmodule Cmd =\n    /// Execute the commands using the supplied dispatcher\n    let internal exec onError (dispatch: Dispatch<'msg>) (cmd: Cmd<'msg>) =\n        cmd |> List.iter (fun call -> try call dispatch with ex -> onError ex)\n\n    /// None - no commands, also known as `[]`\n    let none : Cmd<'msg> =\n        []\n\n    /// When emitting the message, map to another type\n    let map (f: 'a -> 'msg) (cmd: Cmd<'a>) : Cmd<'msg> =\n        cmd |> List.map (fun g -> (fun dispatch -> f >> dispatch) >> g)\n\n    /// Aggregate multiple commands\n    let batch (cmds: #seq<Cmd<'msg>>) : Cmd<'msg> =\n        cmds |> List.concat\n\n    /// Command to call the subscriber\n    let ofSub (sub: Sub<'msg>) : Cmd<'msg> =\n        [sub]\n\n    module OfFunc =\n        /// Command to evaluate a simple function and map the result\n        /// into success or error (of exception)\n        let either (task: 'a -> _) (arg: 'a) (ofSuccess: _ -> 'msg) (ofError: _ -> 'msg) : Cmd<'msg> =\n            let bind dispatch =\n                try\n                    task arg\n                    |> (ofSuccess >> dispatch)\n                with x ->\n                    x |> (ofError >> dispatch)\n            [bind]\n\n        /// Command to evaluate a simple function and map the success to a message\n        /// discarding any possible error\n        let perform (task: 'a -> _) (arg: 'a) (ofSuccess: _ -> 'msg) : Cmd<'msg> =\n            let bind dispatch =\n                try\n                    task arg\n                    |> (ofSuccess >> dispatch)\n                with x ->\n                    ()\n            [bind]\n\n        /// Command to evaluate a simple function and map the error (in case of exception)\n        let attempt (task: 'a -> unit) (arg: 'a) (ofError: _ -> 'msg) : Cmd<'msg> =\n            let bind dispatch =\n                try\n                    task arg\n                with x ->\n                    x |> (ofError >> dispatch)\n            [bind]\n\n        /// Command to issue a specific message\n        let result (msg:'msg) : Cmd<'msg> =\n            [fun dispatch -> dispatch msg]\n\n    module OfAsyncWith =\n        /// Command that will evaluate an async block and map the result\n        /// into success or error (of exception)\n        let either (start: Async<unit> -> unit) \n                   (task: 'a -> Async<_>)\n                   (arg: 'a)\n                   (ofSuccess: _ -> 'msg)\n                   (ofError: _ -> 'msg) : Cmd<'msg> =\n            let bind dispatch =\n                async {\n                    let! r = task arg |> Async.Catch\n                    dispatch (match r with\n                             | Choice1Of2 x -> ofSuccess x\n                             | Choice2Of2 x -> ofError x)\n                }\n            [bind >> start]\n\n        /// Command that will evaluate an async block and map the success\n        let perform (start: Async<unit> -> unit) \n                    (task: 'a -> Async<_>)\n                    (arg: 'a)\n                    (ofSuccess: _ -> 'msg) : Cmd<'msg> =\n            let bind dispatch =\n                async {\n                    let! r = task arg |> Async.Catch\n                    match r with\n                    | Choice1Of2 x -> dispatch (ofSuccess x)\n                    | _ -> ()\n                }\n            [bind >> start]\n\n        /// Command that will evaluate an async block and map the error (of exception)\n        let attempt (start: Async<unit> -> unit) \n                    (task: 'a -> Async<_>)\n                    (arg: 'a)\n                    (ofError: _ -> 'msg) : Cmd<'msg> =\n            let bind dispatch =\n                async {\n                    let! r = task arg |> Async.Catch\n                    match r with\n                    | Choice2Of2 x -> dispatch (ofError x)\n                    | _ -> ()\n                }\n            [bind >> start]\n\n        /// Command that will evaluate an async block to the message\n        let result (start: Async<unit> -> unit) \n                   (task: Async<'msg>) : Cmd<'msg> =\n            let bind dispatch =\n                async {\n                    let! r = task\n                    dispatch r\n                }\n            [bind >> start]\n\n    module OfAsync =\n#if FABLE_COMPILER\n        let start x = Timer.delay 0 (fun _ -> Async.StartImmediate x)\n#else\n        let inline start x = Async.Start x\n#endif    \n        /// Command that will evaluate an async block and map the result\n        /// into success or error (of exception)\n        let inline either (task: 'a -> Async<_>)\n                          (arg: 'a)\n                          (ofSuccess: _ -> 'msg)\n                          (ofError: _ -> 'msg) : Cmd<'msg> =\n            OfAsyncWith.either start task arg ofSuccess ofError\n\n        /// Command that will evaluate an async block and map the success\n        let inline perform (task: 'a -> Async<_>)\n                           (arg: 'a)\n                           (ofSuccess: _ -> 'msg) : Cmd<'msg> =\n            OfAsyncWith.perform start task arg ofSuccess\n\n        /// Command that will evaluate an async block and map the error (of exception)\n        let inline attempt (task: 'a -> Async<_>)\n                           (arg: 'a)\n                           (ofError: _ -> 'msg) : Cmd<'msg> =\n            OfAsyncWith.attempt start task arg ofError\n\n        /// Command that will evaluate an async block to the message\n        let inline result (task: Async<'msg>) : Cmd<'msg> =\n            OfAsyncWith.result start task\n\n    module OfAsyncImmediate =\n        /// Command that will evaluate an async block and map the result\n        /// into success or error (of exception)\n        let inline either (task: 'a -> Async<_>)\n                          (arg: 'a)\n                          (ofSuccess: _ -> 'msg)\n                          (ofError: _ -> 'msg) : Cmd<'msg> =\n            OfAsyncWith.either Async.StartImmediate task arg ofSuccess ofError\n\n        /// Command that will evaluate an async block and map the success\n        let inline perform (task: 'a -> Async<_>)\n                           (arg: 'a)\n                           (ofSuccess: _ -> 'msg) : Cmd<'msg> =\n            OfAsyncWith.perform Async.StartImmediate task arg ofSuccess\n\n        /// Command that will evaluate an async block and map the error (of exception)\n        let inline attempt (task: 'a -> Async<_>)\n                           (arg: 'a)\n                           (ofError: _ -> 'msg) : Cmd<'msg> =\n            OfAsyncWith.attempt Async.StartImmediate task arg ofError\n\n        /// Command that will evaluate an async block to the message\n        let inline result (task: Async<'msg>) : Cmd<'msg> =\n            OfAsyncWith.result Async.StartImmediate task\n\n#if FABLE_COMPILER\n    module OfPromise =\n        /// Command to call `promise` block and map the results\n        let either (task: 'a -> Fable.Core.JS.Promise<_>)\n                   (arg:'a)\n                   (ofSuccess: _ -> 'msg)\n                   (ofError: #exn -> 'msg) : Cmd<'msg> =\n            let bind dispatch =\n                (task arg)\n                    .``then``(ofSuccess >> dispatch)\n                    .catch(unbox >> ofError >> dispatch)\n                    |> ignore\n            [bind]\n\n        /// Command to call `promise` block and map the success\n        let perform (task: 'a -> Fable.Core.JS.Promise<_>)\n                   (arg:'a)\n                   (ofSuccess: _ -> 'msg) =\n            let bind dispatch =\n                (task arg)\n                    .``then``(ofSuccess >> dispatch)\n                    |> ignore\n            [bind]\n\n        /// Command to call `promise` block and map the error\n        let attempt (task: 'a -> Fable.Core.JS.Promise<_>)\n                    (arg:'a)\n                    (ofError: #exn -> 'msg) : Cmd<'msg> =\n            let bind dispatch =\n                (task arg)\n                    .catch(unbox >> ofError >> dispatch)\n                    |> ignore\n            [bind]\n\n        /// Command to dispatch the `promise` result\n        let result (task: Fable.Core.JS.Promise<'msg>) =\n            let bind dispatch =\n                task.``then`` dispatch\n                |> ignore\n            [bind]\n\n    [<Obsolete(\"Use `OfPromise.either` instead\")>]\n    let inline ofPromise (task: 'a -> Fable.Core.JS.Promise<_>)\n                         (arg:'a)\n                         (ofSuccess: _ -> 'msg)\n                         (ofError: _ -> 'msg) : Cmd<'msg> =\n        OfPromise.either task arg ofSuccess ofError                     \n#else\n    open System.Threading.Tasks\n    module OfTask =\n        /// Command to call a task and map the results\n        let inline either (task: 'a -> Task<_>)\n                          (arg:'a)\n                          (ofSuccess: _ -> 'msg)\n                          (ofError: _ -> 'msg) : Cmd<'msg> =\n            OfAsync.either (task >> Async.AwaitTask) arg ofSuccess ofError\n\n        /// Command to call a task and map the success\n        let inline perform (task: 'a -> Task<_>)\n                           (arg:'a)\n                           (ofSuccess: _ -> 'msg) : Cmd<'msg> =\n            OfAsync.perform (task >> Async.AwaitTask) arg ofSuccess\n\n        /// Command to call a task and map the error\n        let inline attempt (task: 'a -> Task<_>)\n                           (arg:'a)\n                           (ofError: _ -> 'msg) : Cmd<'msg> =\n            OfAsync.attempt (task >> Async.AwaitTask) arg ofError\n\n        /// Command and map the task success\n        let inline result (task: Task<'msg>) : Cmd<'msg> =\n            OfAsync.result (task |> Async.AwaitTask)\n\n    [<Obsolete(\"Use OfTask.either instead\")>]\n    let inline ofTask (task: 'a -> Task<_>)\n                      (arg:'a)\n                      (ofSuccess: _ -> 'msg)\n                      (ofError: _ -> 'msg) : Cmd<'msg> =\n        OfTask.either task arg ofSuccess ofError\n#endif\n\n    // Synonymous with `OfFunc.result`, may be removed in the future\n    let inline ofMsg (msg:'msg) : Cmd<'msg> =\n        OfFunc.result msg\n\n    [<Obsolete(\"Use `Cmd.OfAsync.either` instead\")>]\n    let inline ofAsync (task: 'a -> Async<_>)\n                       (arg: 'a)\n                       (ofSuccess: _ -> 'msg)\n                       (ofError: _ -> 'msg) : Cmd<'msg> =\n        OfAsync.either task arg ofSuccess ofError\n\n    [<Obsolete(\"Use `Cmd.OfFunc.either` instead\")>]\n    let inline ofFunc (task: 'a -> _) (arg: 'a) (ofSuccess: _ -> 'msg) (ofError: _ -> 'msg) : Cmd<'msg> =\n        OfFunc.either task arg ofSuccess ofError\n\n    [<Obsolete(\"Use `Cmd.OfFunc.perform` instead\")>]\n    let inline performFunc (task: 'a -> _) (arg: 'a) (ofSuccess: _ -> 'msg) : Cmd<'msg> =\n        OfFunc.perform task arg ofSuccess\n\n    [<Obsolete(\"Use `Cmd.OfFunc.attempt` instead\")>]\n    let attemptFunc (task: 'a -> unit) (arg: 'a) (ofError: _ -> 'msg) : Cmd<'msg> =\n        OfFunc.attempt task arg ofError\n\n","import { compare } from \"./Util.js\";\r\nimport { unfold, delay } from \"./Seq.js\";\r\nimport { op_Addition, fromZero } from \"./BigInt.js\";\r\nimport { op_Addition as op_Addition_1, fromParts } from \"./Decimal.js\";\r\nimport { op_Addition as op_Addition_2, fromBits } from \"./Long.js\";\r\n\r\nexport function makeRangeStepFunction(step, stop, zero, add) {\r\n    const stepComparedWithZero = compare(step, zero) | 0;\r\n    if (stepComparedWithZero === 0) {\r\n        throw (new Error(\"The step of a range cannot be zero\"));\r\n    }\r\n    const stepGreaterThanZero = stepComparedWithZero > 0;\r\n    return (x) => {\r\n        const comparedWithLast = compare(x, stop) | 0;\r\n        return ((stepGreaterThanZero ? (comparedWithLast <= 0) : false) ? true : ((!stepGreaterThanZero) ? (comparedWithLast >= 0) : false)) ? [x, add(x, step)] : (void 0);\r\n    };\r\n}\r\n\r\nexport function integralRangeStep(start, step, stop, zero, add) {\r\n    const stepFn = makeRangeStepFunction(step, stop, zero, add);\r\n    return delay(() => unfold(stepFn, start));\r\n}\r\n\r\nexport function rangeBigInt(start, step, stop) {\r\n    return integralRangeStep(start, step, stop, fromZero(), (x, y) => op_Addition(x, y));\r\n}\r\n\r\nexport function rangeDecimal(start, step, stop) {\r\n    return integralRangeStep(start, step, stop, fromParts(0, 0, 0, false, 0), (x, y) => op_Addition_1(x, y));\r\n}\r\n\r\nexport function rangeDouble(start, step, stop) {\r\n    return integralRangeStep(start, step, stop, 0, (x, y) => (x + y));\r\n}\r\n\r\nexport function rangeInt64(start, step, stop) {\r\n    return integralRangeStep(start, step, stop, fromBits(0, 0, false), (x, y) => op_Addition_2(x, y));\r\n}\r\n\r\nexport function rangeUInt64(start, step, stop) {\r\n    return integralRangeStep(start, step, stop, fromBits(0, 0, true), (x, y) => op_Addition_2(x, y));\r\n}\r\n\r\nexport function rangeChar(start, stop) {\r\n    const intStop = stop.charCodeAt(0) | 0;\r\n    return delay(() => unfold((c) => {\r\n        if (c <= intStop) {\r\n            return [String.fromCharCode(c), c + 1];\r\n        }\r\n        else {\r\n            return void 0;\r\n        }\r\n    }, start.charCodeAt(0)));\r\n}\r\n\r\n","namespace Elmish\nopen System\n\n[<Struct>]\ntype internal RingState<'item> =\n    | Writable of wx:'item array * ix:int\n    | ReadWritable of rw:'item array * wix:int * rix:int\n\ntype internal RingBuffer<'item>(size) =\n    let doubleSize ix (items: 'item array) =\n        seq { yield! items |> Seq.skip ix\n              yield! items |> Seq.take ix\n              for _ in 0..items.Length do\n                yield Unchecked.defaultof<'item> }\n        |> Array.ofSeq\n\n    let mutable state : 'item RingState =\n        Writable (Array.zeroCreate (max size 10), 0)\n\n    member __.Pop() =\n        match state with\n        | ReadWritable (items, wix, rix) ->\n            let rix' = (rix + 1) % items.Length\n            match rix' = wix with\n            | true -> \n                state <- Writable(items, wix)\n            | _ ->\n                state <- ReadWritable(items, wix, rix')\n            Some items.[rix]\n        | _ ->\n            None\n\n    member __.Push (item:'item) =\n        match state with\n        | Writable (items, ix) ->\n            items.[ix] <- item\n            let wix = (ix + 1) % items.Length\n            state <- ReadWritable(items, wix, ix)\n        | ReadWritable (items, wix, rix) ->\n            items.[wix] <- item\n            let wix' = (wix + 1) % items.Length\n            match wix' = rix with\n            | true -> \n                state <- ReadWritable(items |> doubleSize rix, items.Length, 0)\n            | _ -> \n                state <- ReadWritable(items, wix', rix)","(**\nProgram\n---------\nCore abstractions for creating and running the dispatch loop.\n\n*)\n\nnamespace Elmish\n\n\n/// Program type captures various aspects of program behavior\ntype Program<'arg, 'model, 'msg, 'view> = private {\n    init : 'arg -> 'model * Cmd<'msg>\n    update : 'msg -> 'model -> 'model * Cmd<'msg>\n    subscribe : 'model -> Cmd<'msg>\n    view : 'model -> Dispatch<'msg> -> 'view\n    setState : 'model -> Dispatch<'msg> -> unit\n    onError : (string*exn) -> unit\n    syncDispatch: Dispatch<'msg> -> Dispatch<'msg>\n}\n\n/// Program module - functions to manipulate program instances\n[<RequireQualifiedAccess>]\n[<CompilationRepresentation(CompilationRepresentationFlags.ModuleSuffix)>]\nmodule Program =\n    /// Typical program, new commands are produced by `init` and `update` along with the new state.\n    let mkProgram \n        (init : 'arg -> 'model * Cmd<'msg>) \n        (update : 'msg -> 'model -> 'model * Cmd<'msg>)\n        (view : 'model -> Dispatch<'msg> -> 'view) =\n        { init = init\n          update = update\n          view = view\n          setState = fun model -> view model >> ignore\n          subscribe = fun _ -> Cmd.none\n          onError = Log.onError\n          syncDispatch = id }\n\n    /// Simple program that produces only new state with `init` and `update`.\n    let mkSimple \n        (init : 'arg -> 'model) \n        (update : 'msg -> 'model -> 'model)\n        (view : 'model -> Dispatch<'msg> -> 'view) =\n        { init = init >> fun state -> state,Cmd.none\n          update = fun msg -> update msg >> fun state -> state,Cmd.none\n          view = view\n          setState = fun model -> view model >> ignore\n          subscribe = fun _ -> Cmd.none\n          onError = Log.onError\n          syncDispatch = id }\n\n    /// Subscribe to external source of events.\n    /// The subscription is called once - with the initial model, but can dispatch new messages at any time.\n    let withSubscription (subscribe : 'model -> Cmd<'msg>) (program: Program<'arg, 'model, 'msg, 'view>) =\n        let sub model =\n            Cmd.batch [ program.subscribe model\n                        subscribe model ]\n        { program with subscribe = sub }\n\n    /// Trace all the updates to the console\n    let withConsoleTrace (program: Program<'arg, 'model, 'msg, 'view>) =\n        let traceInit (arg:'arg) =\n            let initModel,cmd = program.init arg\n            Log.toConsole (\"Initial state:\", initModel)\n            initModel,cmd\n\n        let traceUpdate msg model =\n            Log.toConsole (\"New message:\", msg)\n            let newModel,cmd = program.update msg model\n            Log.toConsole (\"Updated state:\", newModel)\n            newModel,cmd\n\n        { program with\n            init = traceInit \n            update = traceUpdate }\n\n    /// Trace all the messages as they update the model\n    let withTrace trace (program: Program<'arg, 'model, 'msg, 'view>) =\n        let update msg model =\n            let state,cmd = program.update msg model\n            trace msg state\n            state,cmd\n        { program\n            with update = update }\n\n    /// Handle dispatch loop exceptions\n    let withErrorHandler onError (program: Program<'arg, 'model, 'msg, 'view>) =\n        { program\n            with onError = onError }\n\n    /// For library authors only: map existing error handler and return new `Program` \n    let mapErrorHandler map (program: Program<'arg, 'model, 'msg, 'view>) =\n        { program\n            with onError = map program.onError }\n\n    /// For library authors only: get the current error handler \n    let onError (program: Program<'arg, 'model, 'msg, 'view>) =\n        program.onError\n\n    /// For library authors only: function to render the view with the latest state \n    let withSetState (setState:'model -> Dispatch<'msg> -> unit)\n                     (program: Program<'arg, 'model, 'msg, 'view>) =        \n        { program\n            with setState = setState }\n\n    /// For library authors only: return the function to render the state \n    let setState (program: Program<'arg, 'model, 'msg, 'view>) =        \n        program.setState\n\n    /// For library authors only: return the view function \n    let view (program: Program<'arg, 'model, 'msg, 'view>) =        \n        program.view\n\n    /// For library authors only: function to synchronize the dispatch function\n    let withSyncDispatch (syncDispatch:Dispatch<'msg> -> Dispatch<'msg>)\n                         (program: Program<'arg, 'model, 'msg, 'view>) =        \n        { program\n            with syncDispatch = syncDispatch }\n\n    /// For library authors only: map the program type\n    let map mapInit mapUpdate mapView mapSetState mapSubscribe\n            (program: Program<'arg, 'model, 'msg, 'view>) =\n        { init = mapInit program.init\n          update = mapUpdate program.update\n          view = mapView program.view\n          setState = mapSetState program.setState\n          subscribe = mapSubscribe program.subscribe\n          onError = program.onError\n          syncDispatch = id }\n\n    /// Start the program loop.\n    /// arg: argument to pass to the init() function.\n    /// program: program created with 'mkSimple' or 'mkProgram'.\n    let runWith (arg: 'arg) (program: Program<'arg, 'model, 'msg, 'view>) =\n        let (model,cmd) = program.init arg\n        let rb = RingBuffer 10\n        let mutable reentered = false\n        let mutable state = model        \n        let rec dispatch msg = \n            if reentered then\n                rb.Push msg\n            else\n                reentered <- true\n                let mutable nextMsg = Some msg\n                while Option.isSome nextMsg do\n                    let msg = nextMsg.Value\n                    try\n                        let (model',cmd') = program.update msg state\n                        program.setState model' syncDispatch\n                        cmd' |> Cmd.exec (fun ex -> program.onError (sprintf \"Error in command while handling: %A\" msg, ex)) syncDispatch\n                        state <- model'\n                    with ex ->\n                        program.onError (sprintf \"Unable to process the message: %A\" msg, ex)\n                    nextMsg <- rb.Pop()\n                reentered <- false\n        and syncDispatch = program.syncDispatch dispatch            \n\n        program.setState model syncDispatch\n        let sub = \n            try \n                program.subscribe model \n            with ex ->\n                program.onError (\"Unable to subscribe:\", ex)\n                Cmd.none\n        Cmd.batch [sub; cmd]\n        |> Cmd.exec (fun ex -> program.onError (\"Error intitializing:\", ex)) syncDispatch\n\n    /// Start the dispatch loop with `unit` for the init() function.\n    let run (program: Program<unit, 'model, 'msg, 'view>) = runWith () program\n","namespace Elmish.React\n\nopen Fable.React\nopen Elmish\n\ntype LazyProps<'model> = {\n    model:'model\n    render:unit->ReactElement\n    equal:'model->'model->bool\n}\n\nmodule Components =\n    type LazyView<'model>(props) =\n        inherit Component<LazyProps<'model>,obj>(props)\n\n        override this.shouldComponentUpdate(nextProps, _nextState) =\n            not <| this.props.equal this.props.model nextProps.model\n\n        override this.render () =\n            this.props.render ()\n\n[<AutoOpen>]\nmodule Common =\n    /// Avoid rendering the view unless the model has changed.\n    /// equal: function to compare the previous and the new states\n    /// view: function to render the model\n    /// state: new state to render\n    let lazyViewWith (equal:'model->'model->bool)\n                     (view:'model->ReactElement)\n                     (state:'model) =\n        ofType<Components.LazyView<_>,_,_>\n            { render = fun () -> view state\n              equal = equal\n              model = state }\n            []\n\n    /// Avoid rendering the view unless the model has changed.\n    /// equal: function to compare the previous and the new states\n    /// view: function to render the model using the dispatch\n    /// state: new state to render\n    /// dispatch: dispatch function\n    let lazyView2With (equal:'model->'model->bool)\n                      (view:'model->'msg Dispatch->ReactElement)\n                      (state:'model)\n                      (dispatch:'msg Dispatch) =\n        ofType<Components.LazyView<_>,_,_>\n            { render = fun () -> view state dispatch\n              equal = equal\n              model = state }\n            []\n\n    /// Avoid rendering the view unless the model has changed.\n    /// equal: function to compare the previous and the new model (a tuple of two states)\n    /// view: function to render the model using the dispatch\n    /// state1: new state to render\n    /// state2: new state to render\n    /// dispatch: dispatch function\n    let lazyView3With (equal:_->_->bool) (view:_->_->_->ReactElement) state1 state2 (dispatch:'msg Dispatch) =\n        ofType<Components.LazyView<_>,_,_>\n            { render = fun () -> view state1 state2 dispatch\n              equal = equal\n              model = (state1,state2) }\n            []\n\n    /// Avoid rendering the view unless the model has changed.\n    /// view: function of model to render the view\n    let lazyView (view:'model->ReactElement) =\n        lazyViewWith (=) view\n\n    /// Avoid rendering the view unless the model has changed.\n    /// view: function of two arguments to render the model using the dispatch\n    let lazyView2 (view:'model->'msg Dispatch->ReactElement) =\n        lazyView2With (=) view\n\n    /// Avoid rendering the view unless the model has changed.\n    /// view: function of three arguments to render the model using the dispatch\n    let lazyView3 (view:_->_->_->ReactElement) =\n        lazyView3With (=) view\n\n\n","namespace Elmish.React\n\n[<AutoOpen>]\nmodule Helpers =\n    open Fable.React.Props\n    open Fable.Core.JsInterop\n\n    /// `Ref` callback that sets the value of an input textbox after DOM element is created.\n    /// Can be used instead of `DefaultValue` and `Value` props to override input box value.\n    let inline valueOrDefault value =\n        Ref <| (fun e -> if e |> isNull |> not && !!e?value <> !!value then e?value <- !!value)\n\n[<RequireQualifiedAccess>]\nmodule Program =\n\n    module Internal =\n\n        open Fable.React\n        open Browser\n        open Elmish\n\n        let withReactBatchedUsing lazyView2With placeholderId (program:Program<_,_,_,_>) =\n            let mutable lastRequest = None\n            let setState model dispatch =\n                match lastRequest with\n                | Some r -> window.cancelAnimationFrame r\n                | _ -> ()\n\n                lastRequest <- Some (window.requestAnimationFrame (fun _ ->\n                    ReactDom.render(\n                        lazyView2With (fun x y -> obj.ReferenceEquals(x,y)) (Program.view program) model dispatch,\n                        document.getElementById placeholderId\n                    )))\n\n            program\n            |> Program.withSetState setState\n\n        let withReactSynchronousUsing lazyView2With placeholderId (program:Elmish.Program<_,_,_,_>) =\n            let setState model dispatch =\n                ReactDom.render(\n                    lazyView2With (fun x y -> obj.ReferenceEquals(x,y)) (Program.view program) model dispatch,\n                    document.getElementById placeholderId\n                )\n\n            program\n            |> Program.withSetState setState\n\n        let withReactHydrateUsing lazyView2With placeholderId (program:Elmish.Program<_,_,_,_>) =\n            let setState model dispatch =\n                ReactDom.hydrate(\n                    lazyView2With (fun x y -> obj.ReferenceEquals(x,y)) (Program.view program) model dispatch,\n                    document.getElementById placeholderId\n                )\n\n            program\n            |> Program.withSetState setState\n\n\n    /// Renders React root component inside html element identified by placeholderId.\n    /// Uses `requestAnimationFrame` to batch updates to prevent drops in frame rate.\n    /// NOTE: This may have unexpected effects in React controlled inputs, see https://github.com/elmish/react/issues/12\n    let withReactBatched placeholderId (program:Elmish.Program<_,_,_,_>) =\n        Internal.withReactBatchedUsing lazyView2With placeholderId program\n\n    /// Renders React root component inside html element identified by placeholderId.\n    /// New renders are triggered immediately after an update.\n    let withReactSynchronous placeholderId (program:Elmish.Program<_,_,_,_>) =\n        Internal.withReactSynchronousUsing lazyView2With placeholderId program\n\n    [<System.Obsolete(\"Use withReactBatched\")>]\n    let withReact placeholderId (program:Elmish.Program<_,_,_,_>) =\n        Internal.withReactBatchedUsing lazyView2With placeholderId program\n\n    [<System.Obsolete(\"Use withReactSynchronous\")>]\n    let withReactUnoptimized placeholderId (program:Elmish.Program<_,_,_,_>) =\n        Internal.withReactSynchronousUsing lazyView2With placeholderId program\n\n    /// Renders React root component inside html element identified by placeholderId using `React.hydrate`.\n    let withReactHydrate placeholderId (program:Elmish.Program<_,_,_,_>) =\n        Internal.withReactHydrateUsing lazyView2With placeholderId program\n","namespace Fable.Remoting.Client \r\n\r\nopen System\r\n\r\ntype HttpMethod = GET | POST \r\n\r\ntype RequestBody = \r\n    | Empty\r\n    | Json of string \r\n    | Binary of byte[] \r\n\r\ntype CustomResponseSerializer = byte[] -> Type -> obj\r\n\r\ntype HttpRequest = {\r\n    HttpMethod: HttpMethod\r\n    Url: string \r\n    Headers: (string * string) list  \r\n    RequestBody : RequestBody\r\n    WithCredentials : bool\r\n}\r\n \r\ntype HttpResponse = {\r\n    StatusCode: int \r\n    ResponseBody: string\r\n}\r\n\r\ntype RemoteBuilderOptions = {\r\n    CustomHeaders : (string * string) list\r\n    BaseUrl  : string option\r\n    Authorization : string option\r\n    WithCredentials : bool\r\n    RouteBuilder : (string -> string -> string)\r\n    CustomResponseSerialization : CustomResponseSerializer option\r\n}\r\n\r\ntype ProxyRequestException(response: HttpResponse, errorMsg, reponseText: string) = \r\n    inherit System.Exception(errorMsg)\r\n    member this.Response = response \r\n    member this.StatusCode = response.StatusCode\r\n    member this.ResponseText = reponseText ","// tslint:disable:max-line-length\nimport { fromNumber, op_Division, op_Multiply, toNumber } from \"./Long.js\";\nimport { comparePrimitives, padLeftAndRightWithZeros, padWithZeros } from \"./Util.js\";\n// TimeSpan in runtime just becomes a number representing milliseconds\n/**\n * Calls:\n * - `Math.ceil` if the `value` is **negative**\n * - `Math.floor` if the `value` is **positive**\n * @param value Value to round\n */\nfunction signedRound(value) {\n    return value < 0 ? Math.ceil(value) : Math.floor(value);\n}\nexport function create(d = 0, h = 0, m = 0, s = 0, ms = 0) {\n    switch (arguments.length) {\n        case 1:\n            // ticks\n            return fromTicks(arguments[0]);\n        case 3:\n            // h,m,s\n            d = 0, h = arguments[0], m = arguments[1], s = arguments[2], ms = 0;\n            break;\n        default:\n            // d,h,m,s,ms\n            break;\n    }\n    return d * 86400000 + h * 3600000 + m * 60000 + s * 1000 + ms;\n}\nexport function fromTicks(ticks) {\n    return toNumber(op_Division(ticks, 10000));\n}\nexport function fromDays(d) {\n    return create(d, 0, 0, 0);\n}\nexport function fromHours(h) {\n    return create(h, 0, 0);\n}\nexport function fromMinutes(m) {\n    return create(0, m, 0);\n}\nexport function fromSeconds(s) {\n    return create(0, 0, s);\n}\nexport function days(ts) {\n    return signedRound(ts / 86400000);\n}\nexport function hours(ts) {\n    return signedRound(ts % 86400000 / 3600000);\n}\nexport function minutes(ts) {\n    return signedRound(ts % 3600000 / 60000);\n}\nexport function seconds(ts) {\n    return signedRound(ts % 60000 / 1000);\n}\nexport function milliseconds(ts) {\n    return signedRound(ts % 1000);\n}\nexport function ticks(ts) {\n    return op_Multiply(fromNumber(ts), 10000);\n}\nexport function totalDays(ts) {\n    return ts / 86400000;\n}\nexport function totalHours(ts) {\n    return ts / 3600000;\n}\nexport function totalMinutes(ts) {\n    return ts / 60000;\n}\nexport function totalSeconds(ts) {\n    return ts / 1000;\n}\nexport function negate(ts) {\n    return ts * -1;\n}\nexport function add(ts1, ts2) {\n    return ts1 + ts2;\n}\nexport function subtract(ts1, ts2) {\n    return ts1 - ts2;\n}\nexport const op_Addition = add;\nexport const op_Subtraction = subtract;\nexport const compare = comparePrimitives;\nexport const compareTo = comparePrimitives;\nexport function duration(x) {\n    return Math.abs(x);\n}\nexport function toString(ts, format = \"c\", _provider) {\n    if ([\"c\", \"g\", \"G\"].indexOf(format) === -1) {\n        throw new Error(\"Custom formats are not supported\");\n    }\n    const d = Math.abs(days(ts));\n    const h = Math.abs(hours(ts));\n    const m = Math.abs(minutes(ts));\n    const s = Math.abs(seconds(ts));\n    const ms = Math.abs(milliseconds(ts));\n    const sign = ts < 0 ? \"-\" : \"\";\n    return `${sign}${d === 0 && (format === \"c\" || format === \"g\") ? \"\" : format === \"c\" ? d + \".\" : d + \":\"}${format === \"g\" ? h : padWithZeros(h, 2)}:${padWithZeros(m, 2)}:${padWithZeros(s, 2)}${ms === 0 && (format === \"c\" || format === \"g\") ? \"\" : format === \"g\" ? \".\" + padWithZeros(ms, 3) : \".\" + padLeftAndRightWithZeros(ms, 3, 7)}`;\n}\nexport function parse(str) {\n    const firstDot = str.search(\"\\\\.\");\n    const firstColon = str.search(\"\\\\:\");\n    if (firstDot === -1 && firstColon === -1) { // There is only a day ex: 4\n        const d = parseInt(str, 0);\n        if (isNaN(d)) {\n            throw new Error(`String '${str}' was not recognized as a valid TimeSpan.`);\n        }\n        else {\n            return create(d, 0, 0, 0, 0);\n        }\n    }\n    if (firstColon > 0) { // process time part\n        // WIP: (-?)(((\\d+)\\.)?([0-9]|0[0-9]|1[0-9]|2[0-3]):(\\d+)(:\\d+(\\.\\d{1,7})?)?|\\d+(?:(?!\\.)))\n        const r = /^(-?)((\\d+)\\.)?(?:0*)([0-9]|0[0-9]|1[0-9]|2[0-3]):(?:0*)([0-5][0-9]|[0-9])(:(?:0*)([0-5][0-9]|[0-9]))?\\.?(\\d+)?$/.exec(str);\n        if (r != null && r[4] != null && r[5] != null) {\n            let d = 0;\n            let ms = 0;\n            let s = 0;\n            const sign = r[1] != null && r[1] === \"-\" ? -1 : 1;\n            const h = +r[4];\n            const m = +r[5];\n            if (r[3] != null) {\n                d = +r[3];\n            }\n            if (r[7] != null) {\n                s = +r[7];\n            }\n            if (r[8] != null) {\n                // Depending on the number of decimals passed, we need to adapt the numbers\n                switch (r[8].length) {\n                    case 1:\n                        ms = +r[8] * 100;\n                        break;\n                    case 2:\n                        ms = +r[8] * 10;\n                        break;\n                    case 3:\n                        ms = +r[8];\n                        break;\n                    case 4:\n                        ms = +r[8] / 10;\n                        break;\n                    case 5:\n                        ms = +r[8] / 100;\n                        break;\n                    case 6:\n                        ms = +r[8] / 1000;\n                        break;\n                    case 7:\n                        ms = +r[8] / 10000;\n                        break;\n                    default:\n                        throw new Error(`String '${str}' was not recognized as a valid TimeSpan.`);\n                }\n            }\n            return sign * create(d, h, m, s, ms);\n        }\n    }\n    throw new Error(`String '${str}' was not recognized as a valid TimeSpan.`);\n}\nexport function tryParse(v, defValue) {\n    try {\n        defValue.contents = parse(v);\n        return true;\n    }\n    catch (_a) {\n        return false;\n    }\n}\n","namespace Fable.Remoting.Client\r\n\r\nopen System\r\nopen Browser.Types\r\nopen Fable.Core\r\nopen Fable.Core.JsInterop\r\nopen System.Runtime.CompilerServices\r\n\r\n/// Utilities for working with binary data types in the browser\r\nmodule InternalUtilities =\r\n    [<Emit(\"new FileReader()\")>]\r\n    /// Creates a new instance of a FileReader\r\n    let createFileReader() : FileReader = jsNative\r\n    [<Emit(\"new Uint8Array($0)\")>]\r\n    let createUInt8Array(x: 'a) : byte[]  = jsNative\r\n    /// Creates a Blob from the given input string\r\n    [<Emit(\"new Blob([$0.buffer], { type: $1 })\")>]\r\n    let createBlobFromBytesAndMimeType (value: byte[]) (mimeType: string) : Blob = jsNative\r\n    [<Emit(\"window.URL.createObjectURL($0)\")>]\r\n    /// Creates an object URL (also known as data url) from a Blob\r\n    let createObjectUrl (blob: Blob) : string = jsNative\r\n    [<Emit \"URL.revokeObjectURL($0)\">]\r\n    /// Releases an existing object URL which was previously created by calling createObjectURL(). Call this method when you've finished using an object URL to let the browser know not to keep the reference to the file any longer.\r\n    let revokeObjectUrl (dataUrl: string) : unit = jsNative\r\n    [<Emit \"$0 instanceof Uint8Array\">]\r\n    /// Returns whether the input byte array is a typed array of type Uint8Array\r\n    let isUInt8Array (data: byte[]) : bool = jsNative\r\n    /// Creates a typed byte array of binary data if it not already typed\r\n    let toUInt8Array(data: byte[]) : byte[] =\r\n        if isUInt8Array data\r\n        then data\r\n        else createUInt8Array data\r\n\r\n[<AutoOpenAttribute>]\r\nmodule BrowserFileExtensions =\r\n\r\n    type File with\r\n\r\n        /// Asynchronously reads the File content as byte[]\r\n        member instance.ReadAsByteArray() =\r\n            Async.FromContinuations <| fun (resolve, _, _) ->\r\n                let reader = InternalUtilities.createFileReader()\r\n                reader.onload <- fun _ ->\r\n                    if reader.readyState = FileReaderState.DONE\r\n                    then resolve(InternalUtilities.createUInt8Array(reader.result))\r\n\r\n                reader.readAsArrayBuffer(instance)\r\n\r\n        /// Asynchronously reads the File content as a data url string\r\n        member instance.ReadAsDataUrl() =\r\n            Async.FromContinuations <| fun (resolve, _, _) ->\r\n                let reader = InternalUtilities.createFileReader()\r\n                reader.onload <- fun _ ->\r\n                    if reader.readyState = FileReaderState.DONE\r\n                    then resolve(unbox<string> reader.result)\r\n\r\n                reader.readAsDataURL(instance)\r\n\r\n        /// Asynchronously reads the File contents as text\r\n        member instance.ReadAsText() =\r\n            Async.FromContinuations <| fun (resolve, _, _) ->\r\n                let reader = InternalUtilities.createFileReader()\r\n                reader.onload <- fun _ ->\r\n                    if reader.readyState = FileReaderState.DONE\r\n                    then resolve(unbox<string> reader.result)\r\n\r\n                reader.readAsText(instance)\r\n\r\n[<Extension>]\r\ntype ByteArrayExtensions =\r\n    [<Extension>]\r\n    /// Saves the binary content as a file using the provided file name.\r\n    static member SaveFileAs(content: byte[], fileName: string) =\r\n\r\n        if String.IsNullOrWhiteSpace(fileName) then\r\n            ()\r\n        else\r\n        let mimeType = \"application/octet-stream\"\r\n        let binaryData = InternalUtilities.toUInt8Array content\r\n        let blob = InternalUtilities.createBlobFromBytesAndMimeType binaryData mimeType\r\n        let dataUrl = InternalUtilities.createObjectUrl blob\r\n        let anchor =  (Browser.Dom.document.createElement \"a\")\r\n        anchor?style <- \"display: none\"\r\n        anchor?href <- dataUrl\r\n        anchor?download <- fileName\r\n        anchor?rel <- \"noopener\"\r\n        anchor.click()\r\n        // clean up\r\n        anchor.remove()\r\n        // clean up the created object url because it is being kept in memory\r\n        Browser.Dom.window.setTimeout(unbox(fun () -> InternalUtilities.revokeObjectUrl(dataUrl)), 40 * 1000)\r\n        |> ignore\r\n\r\n    [<Extension>]\r\n    /// Saves the binary content as a file using the provided file name.\r\n    static member SaveFileAs(content: byte[], fileName: string, mimeType: string) =\r\n\r\n        if String.IsNullOrWhiteSpace(fileName) then\r\n            ()\r\n        else\r\n        let binaryData = InternalUtilities.toUInt8Array content\r\n        let blob = InternalUtilities.createBlobFromBytesAndMimeType binaryData mimeType\r\n        let dataUrl = InternalUtilities.createObjectUrl blob\r\n        let anchor =  Browser.Dom.document.createElement \"a\"\r\n        anchor?style <- \"display: none\"\r\n        anchor?href <- dataUrl\r\n        anchor?download <- fileName\r\n        anchor?rel <- \"noopener\"\r\n        anchor.click()\r\n        // clean up element\r\n        anchor.remove()\r\n        // clean up the created object url because it is being kept in memory\r\n        Browser.Dom.window.setTimeout(unbox(fun () -> InternalUtilities.revokeObjectUrl(dataUrl)), 40 * 1000)\r\n        |> ignore\r\n\r\n    [<Extension>]\r\n    /// Converts the binary content into a data url by first converting it to a Blob of type \"application/octet-stream\" and reading it as a data url.\r\n    static member AsDataUrl(content: byte[]) : string =\r\n        let binaryData = InternalUtilities.toUInt8Array content\r\n        let blob = InternalUtilities.createBlobFromBytesAndMimeType binaryData \"application/octet-stream\"\r\n        let dataUrl = InternalUtilities.createObjectUrl blob\r\n        dataUrl\r\n\r\n    [<Extension>]\r\n    /// Converts the binary content into a data url by first converting it to a Blob of the provided mime-type and reading it as a data url.\r\n    static member AsDataUrl(content: byte[], mimeType:string) : string =\r\n        let binaryData = InternalUtilities.toUInt8Array content\r\n        let blob = InternalUtilities.createBlobFromBytesAndMimeType binaryData mimeType\r\n        let dataUrl = InternalUtilities.createObjectUrl blob\r\n        dataUrl","namespace Fable.Remoting.Client\r\n\r\nopen System.Threading\r\nopen Browser\r\nopen Browser.Types\r\n\r\nmodule Http =\r\n\r\n    /// Constructs default values for HttpRequest\r\n    let private defaultRequestConfig : HttpRequest = {\r\n        HttpMethod = GET\r\n        Url = \"/\"\r\n        Headers = [ ]\r\n        WithCredentials = false\r\n        RequestBody = Empty\r\n    }\r\n\r\n    /// Creates a GET request to the specified url\r\n    let get (url: string) : HttpRequest =\r\n        { defaultRequestConfig\r\n            with Url = url\r\n                 HttpMethod = GET }\r\n\r\n    /// Creates a POST request to the specified url\r\n    let post (url: string) : HttpRequest =\r\n        { defaultRequestConfig\r\n            with Url = url\r\n                 HttpMethod = POST }\r\n\r\n    /// Creates a request using the given method and url\r\n    let request method url =\r\n        { defaultRequestConfig\r\n            with Url = url\r\n                 HttpMethod = method }\r\n\r\n    /// Appends a request with headers as key-value pairs\r\n    let withHeaders headers (req: HttpRequest) = { req with Headers = headers  }\r\n\r\n    /// Sets the withCredentials option on the XHR request, useful for CORS requests\r\n    let withCredentials withCredentials (req: HttpRequest) =\r\n        { req with WithCredentials = withCredentials }\r\n\r\n    /// Appends a request with string body content\r\n    let withBody body (req: HttpRequest) = { req with RequestBody = body }\r\n\r\n    let private sendAndRead (preparation:(XMLHttpRequest -> unit) option) resultMapper (req: HttpRequest) = async {\r\n        let! token = Async.CancellationToken\r\n        let request = Async.FromContinuations <| fun (resolve, _, cancel) ->\r\n            let xhr = XMLHttpRequest.Create()\r\n\r\n            match req.HttpMethod with\r\n            | GET -> xhr.``open``(\"GET\", req.Url)\r\n            | POST -> xhr.``open``(\"POST\", req.Url)\r\n\r\n            match preparation with\r\n            | Some f ->  f xhr\r\n            | _ -> ignore()\r\n\r\n            token.Register(fun _ ->\r\n                xhr.abort()\r\n                cancel(System.OperationCanceledException(token))\r\n            ) |> ignore\r\n\r\n            // set the headers, must be after opening the request\r\n            for (key, value) in req.Headers do\r\n                xhr.setRequestHeader(key, value)\r\n\r\n            xhr.withCredentials <- req.WithCredentials\r\n\r\n            xhr.onreadystatechange <- fun _ ->\r\n                match xhr.readyState with\r\n                | ReadyState.Done when not token.IsCancellationRequested ->\r\n                    xhr |> resultMapper |> resolve\r\n                | _ -> ignore()\r\n\r\n            match req.RequestBody with\r\n            | Empty -> xhr.send()\r\n            | RequestBody.Json content -> xhr.send(content)\r\n            | Binary content -> xhr.send(InternalUtilities.toUInt8Array content)\r\n\r\n        return! request\r\n    }\r\n\r\n    /// Sends the request to the server and asynchronously returns a response\r\n    let send = sendAndRead None (fun xhr  -> { StatusCode = unbox xhr.status; ResponseBody = xhr.responseText })\r\n\r\n    /// Sends the request to the server and asynchronously returns the response as byte array\r\n    let sendAndReadBinary =\r\n        sendAndRead\r\n            (Some (fun xhr -> xhr.responseType <- \"arraybuffer\" )) // read response as byte array\r\n            (fun xhr ->\r\n                let bytes = InternalUtilities.createUInt8Array xhr.response\r\n                (bytes, xhr.status))\r\n\r\n","namespace Fable.Remoting.Client\r\n\r\nopen System\r\nopen Fable.Core\r\nopen Fable.SimpleJson\r\nopen Browser.Types\r\n\r\nmodule internal Blob =\r\n    /// Creates a Blob from the given input string\r\n    [<Emit(\"new Blob([$0.buffer], { type: 'text/plain' })\")>]\r\n    let fromBinaryEncodedText (value: byte[]) : Blob = jsNative\r\n\r\n    /// Asynchronously reads the blob data content as string\r\n    let readBlobAsText (blob: Blob) : Async<string> =\r\n        Async.FromContinuations <| fun (resolve, _, _) ->\r\n            let reader = InternalUtilities.createFileReader()\r\n            reader.onload <- fun _ ->\r\n                if reader.readyState = FileReaderState.DONE\r\n                then resolve (unbox reader.result)\r\n\r\n            reader.readAsText(blob)\r\n\r\nmodule Proxy =\r\n    let combineRouteWithBaseUrl route (baseUrl: string option) =\r\n        match baseUrl with\r\n        | None -> route\r\n        | Some url -> sprintf \"%s%s\" (url.TrimEnd('/')) route\r\n\r\n    let isByteArray = function\r\n        | TypeInfo.Array getElemType ->\r\n            match getElemType() with\r\n            | TypeInfo.Byte -> true\r\n            | otherwise -> false\r\n        | otherwise -> false\r\n\r\n    let isAsyncOfByteArray = function\r\n        | TypeInfo.Async getAsyncType ->\r\n            match getAsyncType() with\r\n            | TypeInfo.Array getElemType ->\r\n                match getElemType() with\r\n                | TypeInfo.Byte -> true\r\n                | otherwise -> false\r\n            | otherwise -> false\r\n        | otherwise -> false\r\n\r\n    let rec getReturnType typ =\r\n        if Reflection.FSharpType.IsFunction typ then\r\n            let _, res = Reflection.FSharpType.GetFunctionElements typ\r\n            getReturnType res\r\n        elif typ.IsGenericType then\r\n            typ.GetGenericArguments () |> Array.head\r\n        else\r\n            typ\r\n\r\n    let proxyFetch options typeName (func: RecordField) fieldType =\r\n        let funcArgs : (TypeInfo [ ]) =\r\n            match func.FieldType with\r\n            | TypeInfo.Async inner -> [| func.FieldType |]\r\n            | TypeInfo.Promise inner -> [| func.FieldType |]\r\n            | TypeInfo.Func getArgs -> getArgs()\r\n            | _ -> failwithf \"Field %s does not have a valid definiton\" func.FieldName\r\n\r\n        let argumentCount = (Array.length funcArgs) - 1\r\n        let returnTypeAsync = Array.last funcArgs\r\n\r\n        let binaryInput =\r\n            match func.FieldType with\r\n            | TypeInfo.Func getArgs ->\r\n                match getArgs() with\r\n                | [| input; output |] -> isByteArray input\r\n                | otherwise -> false\r\n            | otherwise -> false\r\n\r\n        let route = options.RouteBuilder typeName func.FieldName\r\n        let url = combineRouteWithBaseUrl route options.BaseUrl\r\n        let funcNeedParameters =\r\n            match funcArgs with\r\n            | [| TypeInfo.Async _ |] -> false\r\n            | [| TypeInfo.Promise _ |] -> false\r\n            | [| TypeInfo.Unit; TypeInfo.Async _ |] -> false\r\n            | otherwise -> true\r\n\r\n        let contentType =\r\n            if binaryInput\r\n            then \"application/octet-stream\"\r\n            else \"application/json; charset=utf-8\"\r\n\r\n        let inputArgumentTypes = Array.take argumentCount funcArgs\r\n\r\n        let headers = [\r\n            yield \"Content-Type\", contentType\r\n            yield \"x-remoting-proxy\", \"true\"\r\n            yield! options.CustomHeaders\r\n            match options.Authorization with\r\n            | Some authToken -> yield \"Authorization\", authToken\r\n            | None -> () ]\r\n\r\n        let executeRequest =\r\n            if options.CustomResponseSerialization.IsSome || isAsyncOfByteArray returnTypeAsync then\r\n                let onOk =\r\n                    match options.CustomResponseSerialization with\r\n                    | Some serializer ->\r\n                        let returnType = getReturnType fieldType\r\n                        fun response -> serializer response returnType\r\n                    | _ -> box\r\n\r\n                fun requestBody -> async {\r\n                    // read as arraybuffer and deserialize\r\n                    let! (response, statusCode) =\r\n                        if funcNeedParameters then\r\n                            Http.post url\r\n                            |> Http.withBody requestBody\r\n                            |> Http.withHeaders headers\r\n                            |> Http.sendAndReadBinary\r\n                        else\r\n                            Http.get url\r\n                            |> Http.withHeaders headers\r\n                            |> Http.sendAndReadBinary\r\n\r\n                    match statusCode with\r\n                    | 200 ->\r\n                        return onOk response\r\n                    | n ->\r\n                        let responseAsBlob = Blob.fromBinaryEncodedText response\r\n                        let! responseText = Blob.readBlobAsText responseAsBlob\r\n                        let response = { StatusCode = statusCode; ResponseBody = responseText }\r\n                        let errorMsg = if n = 500 then sprintf \"Internal server error (500) while making request to %s\" url else sprintf \"Http error (%d) while making request to %s\" n url\r\n                        return! raise (ProxyRequestException(response, errorMsg, response.ResponseBody))\r\n                }\r\n            else\r\n                let returnType =\r\n                    match returnTypeAsync with\r\n                    | TypeInfo.Async getAsyncTypeArgument -> getAsyncTypeArgument()\r\n                    | TypeInfo.Promise getPromiseTypeArgument -> getPromiseTypeArgument()\r\n                    | _ -> failwithf \"Expected field %s to have a return type of Async<'t>\" func.FieldName\r\n\r\n                fun requestBody -> async {\r\n                    // make plain RPC request and let it go through the deserialization pipeline\r\n                    let! response =\r\n                        if funcNeedParameters then\r\n                            Http.post url\r\n                            |> Http.withBody requestBody\r\n                            |> Http.withHeaders headers\r\n                            |> Http.send\r\n                        else\r\n                            Http.get url\r\n                            |> Http.withHeaders headers\r\n                            |> Http.send\r\n\r\n                    match response.StatusCode with\r\n                    | 200 ->\r\n                        let parsedJson = SimpleJson.parseNative response.ResponseBody\r\n                        return Convert.fromJsonAs parsedJson returnType\r\n                    | 500 -> return! raise (ProxyRequestException(response, sprintf \"Internal server error (500) while making request to %s\" url, response.ResponseBody))\r\n                    | n ->   return! raise (ProxyRequestException(response, sprintf \"Http error (%d) from server occured while making request to %s\" n url, response.ResponseBody))\r\n                }\r\n\r\n        fun arg0 arg1 arg2 arg3 arg4 arg5 arg6 arg7 ->\r\n            let inputArguments =\r\n               if funcNeedParameters\r\n               then Array.take argumentCount [| box arg0;box arg1;box arg2;box arg3; box arg4; box arg5; box arg6; box arg7 |]\r\n               else [| |]\r\n\r\n            let requestBody =\r\n                if binaryInput then\r\n                    RequestBody.Binary (unbox arg0)\r\n                else\r\n                    match inputArgumentTypes.Length with\r\n                    | 1 when not (Convert.arrayLike inputArgumentTypes.[0]) ->\r\n                        let typeInfo = TypeInfo.Tuple(fun _ -> inputArgumentTypes)\r\n                        let requestBodyJson = Convert.serialize inputArguments.[0] typeInfo\r\n                        RequestBody.Json requestBodyJson\r\n                    | 1 ->\r\n                        // for array-like types, use an explicit array surranding the input array argument\r\n                        let requestBodyJson = Convert.serialize [| inputArguments.[0] |] (TypeInfo.Array (fun _ -> inputArgumentTypes.[0]))\r\n                        RequestBody.Json requestBodyJson\r\n                    | n ->\r\n                        let typeInfo = TypeInfo.Tuple(fun _ -> inputArgumentTypes)\r\n                        let requestBodyJson = Convert.serialize inputArguments typeInfo\r\n                        RequestBody.Json requestBodyJson\r\n\r\n            executeRequest requestBody\r\n","module Feliz.Bulma.ElementBuilders\r\n\r\nopen Feliz\r\nopen Feliz.Bulma\r\n\r\nmodule Helpers =\r\n    let [<Literal>] private ClassName = \"className\"\r\n\r\n    let inline internal getClasses (xs:IReactProperty list) =\r\n        xs\r\n        |> List.choose (unbox<string * obj> >> function\r\n            | (k, v) when k = ClassName -> Some (string v)\r\n            | _ -> None)\r\n\r\n    let extractClasses (xs:IReactProperty list) =\r\n        xs\r\n        |> List.rev\r\n        |> List.fold (fun (classes, props) x ->\r\n            match unbox<string * obj> x with\r\n            | (k, v) when k = ClassName -> string v :: classes, props\r\n            | _ -> classes, x :: props) ([], [])\r\n\r\n    let combineClasses cn (xs:IReactProperty list) =\r\n        xs\r\n        |> extractClasses\r\n        |> fun (classes, props) -> (cn :: classes |> prop.classes) :: props\r\n\r\nmodule Div =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.div (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.div [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n    let inline valueStr (cn:string) (value:string) = Html.div [ prop.className cn; prop.text value ]\r\n    let inline valueInt (cn:string) (value:int) = Html.div [ prop.className cn; prop.text value ]\r\n\r\nmodule Nav =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.nav (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.nav [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n\r\nmodule Article =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.article (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.article [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n\r\nmodule Section =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.section (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.section [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n\r\nmodule Footer =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.footer (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.footer [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n\r\nmodule Label =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.label (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.label [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n    let inline valueStr (cn:string) (value:string) = Html.label [ prop.className cn; prop.text value ]\r\n    let inline valueInt (cn:string) (value:int) = Html.label [ prop.className cn; prop.text value ]\r\n\r\nmodule Input =\r\n    let inline propsWithType (cn:string) (typ: IReactProperty) (xs:IReactProperty list) =\r\n        Html.input (typ :: Helpers.combineClasses cn xs)\r\n\r\nmodule Textarea =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.textarea (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.textarea [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n\r\nmodule Button =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.button (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.button [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n    let inline valueStr (cn:string) (value:string) = Html.button [ prop.className cn; prop.text value ]\r\n    let inline valueInt (cn:string) (value:int) = Html.button [ prop.className cn; prop.text value ]\r\n\r\nmodule Span =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.span (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.span [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n    let inline valueStr (cn:string) (value:string) = Html.span [ prop.className cn; prop.text value ]\r\n    let inline valueInt (cn:string) (value:int) = Html.span [ prop.className cn; prop.text value ]\r\n\r\nmodule Figure =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.figure (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.figure [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n\r\nmodule Progress =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.progress (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.progress [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n    let inline valueStr (cn:string) (value:string) = Html.progress [ prop.className cn; prop.text value ]\r\n    let inline valueInt (cn:string) (value:int) = Html.progress [ prop.className cn; prop.text value ]\r\n\r\nmodule Table =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.table (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.table [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n\r\nmodule H1 =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.h1 (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.h1 [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n    let inline valueStr (cn:string) (value:string) = Html.h1 [ prop.className cn; prop.text value ]\r\n    let inline valueInt (cn:string) (value:int) = Html.h1 [ prop.className cn; prop.text value ]\r\n\r\nmodule H2 =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.h2 (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.h2 [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n    let inline valueStr (cn:string) (value:string) = Html.h2 [ prop.className cn; prop.text value ]\r\n    let inline valueInt (cn:string) (value:int) = Html.h2 [ prop.className cn; prop.text value ]\r\n\r\nmodule H3 =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.h3 (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.h3 [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n    let inline valueStr (cn:string) (value:string) = Html.h3 [ prop.className cn; prop.text value ]\r\n    let inline valueInt (cn:string) (value:int) = Html.h3 [ prop.className cn; prop.text value ]\r\n\r\nmodule H4 =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.h4 (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.h4 [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n    let inline valueStr (cn:string) (value:string) = Html.h4 [ prop.className cn; prop.text value ]\r\n    let inline valueInt (cn:string) (value:int) = Html.h4 [ prop.className cn; prop.text value ]\r\n\r\nmodule H5 =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.h5 (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.h5 [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n    let inline valueStr (cn:string) (value:string) = Html.h5 [ prop.className cn; prop.text value ]\r\n    let inline valueInt (cn:string) (value:int) = Html.h5 [ prop.className cn; prop.text value ]\r\n\r\nmodule H6 =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.h6 (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.h6 [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n    let inline valueStr (cn:string) (value:string) = Html.h6 [ prop.className cn; prop.text value ]\r\n    let inline valueInt (cn:string) (value:int) = Html.h6 [ prop.className cn; prop.text value ]\r\n\r\nmodule Hr =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.hr (Helpers.combineClasses cn xs)\r\n\r\nmodule Aside =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.aside (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.aside [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n\r\nmodule P =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.p (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.p [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n    let inline valueStr (cn:string) (value:string) = Html.p [ prop.className cn; prop.text value ]\r\n    let inline valueInt (cn:string) (value:int) = Html.p [ prop.className cn; prop.text value ]\r\n\r\nmodule Ul =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.ul (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.ul [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n\r\nmodule Li =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.li (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.li [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n\r\nmodule Header =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.header (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.header [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n\r\nmodule A =\r\n    let inline props (cn:string) (xs:IReactProperty list) = Html.a (Helpers.combineClasses cn xs)\r\n    let inline children (cn:string) (children:seq<ReactElement>) = Html.a [ prop.className cn; prop.children children ]\r\n    let inline valueElm (cn:string) (value:ReactElement) = value |> List.singleton |> children cn\r\n    let inline valueStr (cn:string) (value:string) = Html.a [ prop.className cn; prop.text value ]\r\n    let inline valueInt (cn:string) (value:int) = Html.a [ prop.className cn; prop.text value ]\r\n","namespace Fable.Remoting.Client\r\n\r\nopen Fable.Core\r\nopen Fable.SimpleJson\r\nopen System\r\nopen Microsoft.FSharp.Reflection\r\nopen Fable.Remoting\r\n\r\nmodule Remoting =\r\n    /// Starts with default configuration for building a proxy\r\n    let createApi() = {\r\n        CustomHeaders = [ ]\r\n        BaseUrl = None\r\n        Authorization = None\r\n        WithCredentials = false\r\n        RouteBuilder = sprintf (\"/%s/%s\")\r\n        CustomResponseSerialization = None\r\n    }\r\n\r\n    /// Defines how routes are built using the type name and method name. By default, the generated routes are of the form `/typeName/methodName`.\r\n    let withRouteBuilder builder (options: RemoteBuilderOptions) =\r\n        { options with RouteBuilder = builder }\r\n\r\n    /// Sets the base url for the request. Useful if you are making cross-domain requests\r\n    let withBaseUrl url (options: RemoteBuilderOptions) =\r\n        { options with BaseUrl = Some url }\r\n\r\n    /// Adds custom headers to each request of the proxy\r\n    let withCustomHeader headers (options: RemoteBuilderOptions) =\r\n        { options with CustomHeaders = headers }\r\n\r\n    /// Sets the authorization header of every request from the proxy\r\n    let withAuthorizationHeader token (options: RemoteBuilderOptions) =\r\n        { options with Authorization = Some token }\r\n\r\n    /// Sets the withCredentials option on the XHR request, which is useful for CORS scenarios\r\n    let withCredentials withCredentials (options: RemoteBuilderOptions) =\r\n        { options with WithCredentials = withCredentials }\r\n\r\n    /// Specifies that the API uses binary serialization for responses\r\n    let withBinarySerialization (options: RemoteBuilderOptions) =\r\n        let serializer response returnType = MsgPack.Read.Reader(response).Read returnType\r\n        { options with CustomResponseSerialization = Some serializer }\r\n\r\ntype Remoting() =\r\n    static member buildProxy<'t>(options: RemoteBuilderOptions, [<Inject>] ?resolver: ITypeResolver<'t>) : 't =\r\n        let resolvedType = resolver.Value.ResolveType()\r\n        let schemaType = createTypeInfo resolvedType\r\n        match schemaType with\r\n        | TypeInfo.Record getFields ->\r\n            let (fields, recordType) = getFields()\r\n            let fieldTypes = Reflection.FSharpType.GetRecordFields recordType |> Array.map (fun prop -> prop.Name, prop.PropertyType)\r\n            let recordFields = [|\r\n                for field in fields do\r\n                    let normalize n =\r\n                        let fieldType = fieldTypes |> Array.pick (fun (name, typ) -> if name = field.FieldName then Some typ else None)\r\n                        let fn = Proxy.proxyFetch options recordType.Name field fieldType\r\n                        match n with\r\n                        | 0 -> box (fn null null null null null null null null)\r\n                        | 1 -> box (fun a ->\r\n                            fn a null null null null null null null)\r\n                        | 2 ->\r\n                            let proxyF a b = fn a b null null null null null null\r\n                            unbox (System.Func<_,_,_> proxyF)\r\n                        | 3 ->\r\n                            let proxyF a b c = fn a b c null null null null null\r\n                            unbox (System.Func<_,_,_,_> proxyF)\r\n                        | 4 ->\r\n                            let proxyF a b c d = fn a b c d null null null null\r\n                            unbox (System.Func<_,_,_,_,_> proxyF)\r\n                        | 5 ->\r\n                            let proxyF a b c d e = fn a b c d e null null null\r\n                            unbox (System.Func<_,_,_,_,_,_> proxyF)\r\n                        | 6 ->\r\n                            let proxyF a b c d e f = fn a b c d e f null null\r\n                            unbox (System.Func<_,_,_,_,_,_,_> proxyF)\r\n                        | 7 ->\r\n                            let proxyF a b c d e f g = fn a b c d e f g null\r\n                            unbox (System.Func<_,_,_,_,_,_,_,_> proxyF)\r\n                        | 8 ->\r\n                            let proxyF a b c d e f g h = fn a b c d e f g h\r\n                            unbox (System.Func<_,_,_,_,_,_,_,_,_> proxyF)\r\n                        | _ ->\r\n                            failwithf \"Cannot generate proxy function for %s. Only up to 8 arguments are supported. Consider using a record type as input\" field.FieldName\r\n\r\n                    let argumentCount =\r\n                        match field.FieldType with\r\n                        | TypeInfo.Async _  -> 0\r\n                        | TypeInfo.Promise _  -> 0\r\n                        | TypeInfo.Func getArgs -> Array.length (getArgs()) - 1\r\n                        | _ -> 0\r\n\r\n                    normalize argumentCount\r\n                |]\r\n\r\n            let proxy = FSharpValue.MakeRecord(recordType, recordFields)\r\n            unbox proxy\r\n        | _ ->\r\n            failwithf \"Cannot build proxy. Exepected type %s to be a valid protocol definition which is a record of functions\" resolvedType.FullName\r\n\r\n","module Index\r\n\r\nopen Elmish\r\nopen Fable.Remoting.Client\r\nopen Shared\r\n\r\ntype Status =\r\n    | Initial\r\n    | Getting\r\n    | Done of tableCount:int\r\n    | Error of string\r\n\r\ntype Model =\r\n    {\r\n        Url: string\r\n        Status : Status\r\n    }\r\n\r\ntype Msg =\r\n    | SetUrl of string\r\n    | GetTables\r\n    | GotTables of Result<NamedWorkBook, string>\r\n\r\nlet api =\r\n    Remoting.createApi ()\r\n    |> Remoting.withRouteBuilder Route.builder\r\n    |> Remoting.buildProxy<IApi>\r\n\r\nlet init () : Model * Cmd<Msg> =\r\n    let model =\r\n        {\r\n            Url = \"https://www.w3schools.com/html/html_tables.asp\"\r\n            Status = Initial\r\n        }\r\n\r\n    let cmd = Cmd.none\r\n\r\n    model, cmd\r\n\r\nlet update (msg: Msg) (model: Model) : Model * Cmd<Msg> =\r\n    match msg with\r\n    | SetUrl value ->\r\n        { model with Url = value; Status = Initial }, Cmd.none\r\n    | GetTables ->\r\n        let cmd = Cmd.OfAsync.perform api.getTables model.Url GotTables\r\n        { model with Status = Getting }, cmd\r\n    | GotTables result ->\r\n        match result with\r\n        | Result.Ok {Name = name; TableCount = tableCount; Bytes = bytes} ->\r\n            bytes.SaveFileAs(name)\r\n            { model with Status = Done tableCount }, Cmd.none\r\n        | Result.Error m ->\r\n            { model with Status = Error m }, Cmd.none\r\n\r\nopen Feliz\r\nopen Feliz.Bulma\r\n\r\nlet navBrand =\r\n    Bulma.navbarBrand.div [\r\n        Bulma.navbarItem.a [\r\n            prop.href \"https://safe-stack.github.io/\"\r\n            navbarItem.isActive\r\n            prop.children [\r\n                Html.img [\r\n                    prop.src \"/favicon.png\"\r\n                    prop.alt \"Logo\"\r\n                ]\r\n            ]\r\n        ]\r\n    ]\r\n\r\nlet messagePanel color (heading : string) (message : string)  =\r\n    Bulma.message [\r\n        color\r\n        prop.children [\r\n            Bulma.messageHeader [ prop.text heading ]\r\n            Bulma.messageBody [ message |> prop.text ]\r\n        ]\r\n     ]\r\n\r\nlet containerBox (model: Model) (dispatch: Msg -> unit) =\r\n    Bulma.box [\r\n        prop.style [style.backgroundColor \"#D5F5E3\"]\r\n        prop.children [\r\n            Bulma.field.div [\r\n                field.isGrouped\r\n                prop.children [\r\n                    Bulma.control.p [\r\n                        control.isExpanded\r\n                        prop.children [\r\n                            Bulma.input.text [\r\n                                prop.value model.Url\r\n                                prop.style [ style.backgroundColor \"White\"]\r\n                                prop.placeholder \"E.g. https://en.wikipedia.org/wiki/Asteroid\"\r\n                                prop.onChange (SetUrl >> dispatch)\r\n                                prop.onKeyPress (fun kp -> if kp.key = \"Enter\" then GetTables |> dispatch)\r\n                            ]\r\n                        ]\r\n                    ]\r\n                    Bulma.control.p [\r\n                        Bulma.button.a [\r\n                            color.isDark\r\n                            if model.Status = Getting then Bulma.button.isLoading\r\n                            prop.disabled (Model.isValid model.Url |> not)\r\n                            prop.onClick (fun _ -> dispatch GetTables)\r\n                            prop.text \"Download\"\r\n                        ]\r\n                    ]\r\n                ]\r\n            ]\r\n        ]\r\n    ]\r\n\r\nlet view (model: Model) (dispatch: Msg -> unit) =\r\n    Bulma.hero [\r\n        hero.isFullHeight\r\n        prop.style [style.backgroundColor \"#F8F9F9\"]\r\n        prop.children [\r\n            Bulma.column [\r\n                column.is8\r\n                column.isOffset2\r\n                prop.children [\r\n                    Bulma.content [\r\n                        Bulma.text.hasTextLeft\r\n                        let bullet =\r\n                            Html.span [\r\n                                prop.style [\r\n                                    style.fontSize 25\r\n                                    style.paddingLeft 16\r\n                                    style.paddingRight 8\r\n                                    style.color \"Green\"\r\n                                ]\r\n                                prop.text \"✔\"\r\n                            ]\r\n                        let bulletLine (text : string) =\r\n                            Html.p [\r\n                                prop.style [ style.marginBottom 0]\r\n                                prop.children [\r\n                                    bullet\r\n                                    Html.span [ prop.text text ]\r\n                                ]\r\n                            ]\r\n                        prop.children [\r\n                            Html.h1 [ prop.text \"Get the tables from a web page as an Excel spreadsheet\" ]\r\n                            bulletLine \"Enter the URL of a website that has HTML tables.\"\r\n                            bulletLine \"Click \\\"Download\\\".\"\r\n                            bulletLine \"Check your browser downloads.\"\r\n                            bulletLine \"Each table is in a tab in the spreadsheet.\"\r\n                        ]\r\n                    ]\r\n                ]\r\n            ]\r\n            Bulma.column [\r\n                column.is8\r\n                column.isOffset2\r\n                prop.children [\r\n                    containerBox model dispatch\r\n                ]\r\n            ]\r\n            Bulma.container [\r\n                Bulma.column [\r\n                    column.is8\r\n                    column.isOffset2\r\n                    prop.children [\r\n                        match model.Status with\r\n                        | Initial\r\n                        | Getting ->\r\n                            ()\r\n                        | Done tc ->\r\n                            let noun = if tc = 1 then \"table\" else \"tables\"\r\n                            messagePanel color.isSuccess \"Yay!\" $\"Extracted {tc} {noun} - see your browser downloads.\"\r\n                        | Error e ->\r\n                            messagePanel color.isDanger \"Oopsie!\" e\r\n                        Html.img [\r\n                            prop.style [ style.backgroundColor \"White\"]\r\n                            prop.src \"/push-button-receive-table.png\"\r\n                        ]\r\n                    ]\r\n                ]\r\n            ]\r\n        ]\r\n    ]\r\n","namespace Shared\n\nopen System\n\ntype NamedWorkBook =\n    {\n        Name : string\n        TableCount : int\n        Bytes : byte[]\n    }\n\ntype Todo = { Id: Guid; Description: string }\n\nmodule Model =\n    let isValid (url: string) =\n        String.IsNullOrWhiteSpace url |> not\n\nmodule Route =\n    let builder typeName methodName =\n        sprintf \"/api/%s/%s\" typeName methodName\n\ntype IApi =\n    { getTables: string -> Async<Result<NamedWorkBook, string>> }\n","module App\n\nopen Elmish\nopen Elmish.React\n\n#if DEBUG\nopen Elmish.Debug\nopen Elmish.HMR\n#endif\n\nProgram.mkProgram Index.init Index.update Index.view\n#if DEBUG\n|> Program.withConsoleTrace\n#endif\n|> Program.withReactSynchronous \"elmish-app\"\n#if DEBUG\n|> Program.withDebugger\n#endif\n|> Program.run\n"],"sourceRoot":""}