h,o-א      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                "(c) The University of Glasgow 2009see libraries/ghc-prim/LICENSEghc-devs@haskell.orginternalnon-portable (GHC Extensions)None)*01e70#The character type # represents Unicode codespace and its elements are code points as in definitions  =https://www.unicode.org/versions/Unicode15.0.0/ch03.pdf#G2212"D9 and D10 of the Unicode Standard.1Character literals in Haskell are single-quoted: 'Q', '' or ''). To represent a single quote itself use '\''#, and to represent a backslash use '\\':. The full grammar can be found in the section 2.6 of the  >https://www.haskell.org/definition/haskell2010.pdf#section.2.6Haskell 2010 Language Report.To specify a character by its code point one can use decimal, hexadecimal or octal notation: '\65', '\x41' and '\o101' are all alternative forms of 'A'. The largest code point is  '\x10ffff'.>There is a special escape syntax for ASCII control characters:Escape AlternativesMeaning"'\NUL''\0'null character'\SOH''\1'start of heading'\STX''\2' start of text'\ETX''\3' end of text'\EOT''\4'end of transmission'\ENQ''\5'enquiry'\ACK''\6' acknowledge'\BEL''\7', '\a' bell (alert)'\BS''\8', '\b' backspace'\HT''\9', '\t'horizontal tab'\LF''\10', '\n'line feed (new line)'\VT''\11', '\v' vertical tab'\FF''\12', '\f' form feed'\CR''\13', '\r'carriage return'\SO''\14' shift out'\SI''\15'shift in'\DLE''\16'data link escape'\DC1''\17'device control 1'\DC2''\18'device control 2'\DC3''\19'device control 3'\DC4''\20'device control 4'\NAK''\21'negative acknowledge'\SYN''\22'synchronous idle'\ETB''\23'end of transmission block'\CAN''\24'cancel'\EM''\25' end of medium'\SUB''\26' substitute'\ESC''\27'escape'\FS''\28'file separator'\GS''\29'group separator'\RS''\30'record separator'\US''\31'unit separator'\SP''\32', ' 'space'\DEL''\127'delete Intor length :: List a -> IntThey are fully equivalent, and List a will be normalised to [a].UsageLists are constructed recursively using the right-associative constructor operator (or cons) (:) :: a -> [a] -> [a];, which prepends an element to a list, and the empty list []. 6(1 : 2 : 3 : []) == (1 : (2 : (3 : []))) == [1, 2, 3] ?Lists can also be constructed using list literals of the form [x_1, x_2, ..., x_n]( which are syntactic sugar and, unless -XOverloadedLists* is enabled, are translated into uses of (:) and [] literals, like "I  hs",, are translated into Lists of characters, ['I', ' ', '', ' ', 'h', 's'].ImplementationInternally and in memory, all the above are represented like this, with arrows being pointers to locations in memory. JJJJJJJJJJJJ JJJJJJJJJJJJ JJJJJJJJJJJJ JJJJJJ J(:)J J JJJJ>J(:)J J JJJJ>J(:)J J JJJJ>J [] J JJJJJJJJJJJJ JJJJJJJJJJJJ JJJJJJJJJJJJ JJJJJJ v v v 1 2 3Examples 2>>> ['H', 'a', 's', 'k', 'e', 'l', 'l'] "Haskell"  !>>> 1 : [4, 1, 5, 9] [1,4,1,5,9] >>> [] : [] : [] [[],[]] 8Lifted, homogeneous equality. By lifted, we mean that it can be bogus (deferred type error). By homogeneous, the two types a and b must have the same kinds.9Lifted, heterogeneous equality. By lifted, we mean that it can be bogus (deferred type error). By heterogeneous, the two types a and b% might have different kinds. Because ~~ can appear unexpectedly in error messages to users who do not care about the difference between heterogeneous equality ~~ and homogeneous equality ~, this is printed as ~ unless -fprint-equality-relations is set.In 0.7.0, the fixity was set to infix 4 to match the fixity of .=A value of type = a is a computation which, when performed, does some I/O before returning a value of type a.There is really only one way to "perform" an I/O action: bind it to  Main.main in your program. When your program is run, the I/O will be performed. It isn't possible to perform I/O from an arbitrary function, unless that function is itself in the => monad and called at some point, directly or indirectly, from  Main.main.= is a monad, so == actions can be combined using either the do-notation or the  and  operations from the  class.?A ?5 is an unsigned integral type, with the same size as *.J2The kind of types with lifted values. For example  Int :: Type.K0The kind of boxed, unlifted values, for example Array#. or a user-defined unlifted data type, using -XUnliftedDataTypes.NThe kind of lifted constraintsO+Whether a boxed type is lifted or unlifted.PGHC maintains a property that the kind of all inhabited types (as distinct from type constructors or type-level data) tells us the runtime representation of values of that type. This datatype encodes the choice of runtime value. Note that L is parameterised by P; this is precisely what we mean by the fact that a type's kind encodes the runtime representation.For boxed values (that is, values that are represented by a pointer), a further distinction is made, between lifted types (that contain E), and unlifted ones (that don't).QLength of a SIMD vector typeRElement of a SIMD vector typeS+The runtime representation of lifted types.T-The runtime representation of unlifted types.UThe runtime representation of a zero-width tuple, represented by no bits at allV.The kind of the empty unboxed tuple type (# #)ZThe representation produced by GHC for conjuring up the kind of a .\The type constructor \ is type to which you can unsafely coerce any lifted type, and back. More concretely, for a lifted type t and value x :: t, )unsafeCoerce (unsafeCoerce x :: Any) :: t is equivalent to x.]ghc-prim Coercible7 is a two-parameter class that has instances for types a and b if the compiler can infer that they have the same representation. This class does not have regular instances; instead they are created on-the-fly during type-checking. Trying to manually declare an instance of  Coercible is an error.Nevertheless one can pretend that the following three kinds of instances exist. First, as a trivial base-case: instance Coercible a aFurthermore, for every type constructor there is an instance that allows to coerce under the type constructor. For example, let D% be a prototypical type constructor (data or newtype.) with three type arguments, which have roles nominal, representational resp. phantom-. Then there is an instance of the form :instance Coercible b b' => Coercible (D a b c) (D a b' c')Note that the nominal% type arguments are equal, the representational5 type arguments can differ, but need to have a  Coercible instance themself, and the phantom1 type arguments can be changed arbitrarily.,The third kind of instance exists for every newtype NT = MkNT T( and comes in two variants, namely (instance Coercible a T => Coercible a NT (instance Coercible T b => Coercible NT b0This instance is only usable if the constructor MkNT is in scope.3If, as a library author of a type constructor like Set a, you want to prevent a user of your module to write coerce :: Set T -> Set NT$, you need to set the role of Set's type parameter to nominal, by writing type role Set nominal;For more details about this feature, please refer to  http://research.microsoft.com/en-us/um/people/simonpj/papers/ext-f/coercible.pdfSafe Coercions by Joachim Breitner, Richard A. Eisenberg, Simon Peyton Jones and Stephanie Weirich._ghc-prim_ is used by GHC in the  SpecConstr pass in order to inform the compiler when to be particularly aggressive. In particular, it tells GHC to specialize regardless of size or the number of specializations. However, not all loops fall into this category.$Libraries can specify this by using _ data type to inform which loops should be aggressively specialized. For example, instead of loop x where loop arg = ...write #loop SPEC x where loop !_ arg = ...(There is no semantic difference between _ and , we just need a type with two constructors lest it is optimised away before  SpecConstr.This type is reexported from GHC.Exts since GHC 9.0 and  base-4.15:. For compatibility with earlier releases import it from  GHC.Types in ghc-prim package.The regular function type.(Kind) This is the kind of type-level symbols.StaticDynamica SIMD vector type"An unboxed tuple of the given reps An unboxed sum of the given repsboxed; represented by a pointersigned, word-sized valuesigned, 8-bit valuesigned, 16-bit valuesigned, 32-bit valuesigned, 64-bit valueunsigned, word-sized valueunsigned, 8-bit valueunsigned, 16-bit valueunsigned, 32-bit valueunsigned, 64-bit valueA pointer, but not to a Haskell valuea 32-bit floating point numbera 64-bit floating point number Data type Dict provides a simple way to wrap up a (lifted) constraint as a type(A de Bruijn index for a binder within a Z. Alias for  ?. Returns True if its parameter is 1# and False if it is 0#.Fingerprint (high)Fingerprint (low)Module in which this is definedType constructor name%How many kind variables do we accept?#A representation of the type's kind Package name Module name=ZX3_YW[ML\ #]N%'*OS/bPJTKQR?UV89 #*?'%3=/_\89]LMOPSTJKNUVQRbXYW[Z89"(c) The University of Glasgow 20013BSD-style (see the file libraries/ghc-prim/LICENSE)libraries@haskell.org experimentalnon-portable (GHC extensions) TrustworthyMghc-prim The unit datatype Unit8 has one non-undefined member, the nullary constructor ().Solo, is the canonical lifted 1-tuple, just like - is the canonical lifted 2-tuple (pair) and * is the canonical lifted 3-tuple (triple).The most important feature of Solo is that it is possible to force its "outside" (usually by pattern matching) without forcing its "inside", because it is defined as a datatype rather than a newtype. One situation where this can be useful is when writing a function to extract a value from a data structure. Suppose you write an implementation of arrays and offer only this function to index into them: index :: Array a -> Int -> a Now imagine that someone wants to extract a value from an array and store it in a lazy-valued finite map/dictionary: insert "hello" (arr index 12) m This can actually lead to a space leak. The value is not actually extracted from the array until that value (now buried in a map) is forced. That means the entire array may be kept live by just that value! Often, the solution is to use a strict map, or to force the value before storing it, but for some purposes that's undesirable.One common solution is to include an indexing function that can produce its result in an arbitrary  Applicative context: 1indexA :: Applicative f => Array a -> Int -> f a  When using indexA in a pure context, Solo serves as a handy  Applicative functor to hold the result. You could write a non-leaky version of the above example thus:  case arr indexA& 12 of Solo a -> insert "hello" a m While such simple extraction functions are the most common uses for unary tuples, they can also be useful for fine-grained control of strict-spined data structure traversals, and for unifying the implementations of lazy and strict mapping functions.ghc-prim A tuple of two elements.ghc-prim A tuple of three elements.ghc-prim A tuple of four elements.ghc-prim A tuple of five elements.ghc-prim A tuple of six elements.ghc-prim A tuple of seven elements.ghc-prim A tuple of eight elements.ghc-prim A tuple of nine elements.ghc-prim A tuple of ten elements.ghc-prim A tuple of eleven elements.ghc-prim A tuple of twelve elements.ghc-prim A tuple of 13 elements.ghc-prim A tuple of 14 elements.ghc-prim A tuple of 15 elements.ghc-prim A tuple of 16 elements.ghc-prim A tuple of 17 elements.ghc-prim A tuple of 18 elements.ghc-prim A tuple of 19 elements.ghc-prim A tuple of 20 elements.A tuple of 21 elements.ghc-prim A tuple of 22 elements.ghc-prim A tuple of 23 elements.ghc-prim A tuple of 24 elements.ghc-prim A tuple of 25 elements.ghc-prim A tuple of 26 elements.ghc-prim A tuple of 27 elements.ghc-prim A tuple of 28 elements.ghc-prim A tuple of 29 elements.ghc-prim A tuple of 30 elements.ghc-prim A tuple of 31 elements.ghc-prim A tuple of 32 elements.ghc-prim A tuple of 33 elements.ghc-prim A tuple of 34 elements.ghc-prim A tuple of 35 elements.ghc-prim A tuple of 36 elements.ghc-prim A tuple of 37 elements.ghc-prim A tuple of 38 elements.ghc-prim A tuple of 39 elements.ghc-prim A tuple of 40 elements.ghc-prim A tuple of 41 elements.ghc-prim A tuple of 42 elements.ghc-prim A tuple of 43 elements.ghc-prim A tuple of 44 elements.ghc-prim A tuple of 45 elements.ghc-prim A tuple of 46 elements.ghc-prim A tuple of 47 elements.ghc-prim A tuple of 48 elements.ghc-prim A tuple of 49 elements.ghc-prim A tuple of 50 elements.ghc-prim A tuple of 51 elements.ghc-prim A tuple of 52 elements.ghc-prim A tuple of 53 elements.ghc-prim A tuple of 54 elements.ghc-prim A tuple of 55 elements.ghc-prim A tuple of 56 elements.ghc-prim A tuple of 57 elements.ghc-prim A tuple of 58 elements.ghc-prim A tuple of 59 elements.ghc-prim A tuple of 60 elements.ghc-prim A tuple of 61 elements.ghc-prim A tuple of 62 elements.ghc-prim A tuple of 63 elements.ghc-prim A tuple of 64 elements.ghc-prim &A tuple of one element, a synonym for .ghc-prim (A tuple of zero elements, a synonym for .Extract the value from a . Very often, values should be extracted directly using pattern matching, to control just what gets evaluated when. getSolo= is for convenience in situations where that is not the case:When the result is passed to a strict function, it makes no difference whether the pattern matching is done on the "outside" or on the "inside": Data.Set.insert (getSolo sol) set === case sol of Solo v -> Data.Set.insert v set  A traversal may be performed in 9 in order to control evaluation internally, while using getSolo to extract the final result. A strict mapping function, for example, could be defined map' :: Traversable t => (a -> b) -> t a -> t b map' f = getSolo . traverse ((Solo $!) . f)  None                                                        see libraries/ghc-prim/LICENSEghc-devs@haskell.orginternalnon-portable (GHC Extensions)Unsafe014;Compare the underlying pointers of two values for equality.Returns 1 if the pointers are equal and 0 otherwise.1The two values must be of the same type, of kind Type . See also (, which doesn't have such restrictions.Compare the underlying pointers of two unlifted values for equality.This is less dangerous than , since the arguments are guaranteed to be evaluated. This means there is no risk of accidentally comparing a thunk. It's however still more dangerous than e.g. ..Compare the underlying pointers of two arrays.6Compare the underlying pointers of two mutable arrays.4Compare the underlying pointers of two small arrays. b=. Values of this type are functions taking inputs of type a" and producing outputs of type b&. The multiplicity of the input is m. Note that ( m a b0 permits representation polymorphism in both a and b, so that types like ) -> ) can still be well-kinded.2 A mutable  ByteAray#". It can be created in three ways:: Create an unpinned array.": This will create a pinned array,;: This will create a pinned array, with a custom alignment.Unpinned arrays can be moved around during garbage collection, so you must not store or pass pointers to these values if there is a chance for the garbage collector to kick in. That said, even unpinned arrays can be passed to unsafe FFI calls, because no garbage collection happens during these unsafe calls (see  https://ghc.gitlab.haskell.org/ghc/doc/users_guide/exts/ffi.html#guaranteed-call-safetyGuaranteed Call Safety in the GHC Manual). For safe FFI calls, byte arrays must be not only pinned, but also kept alive by means of the keepAlive# function for the duration of a call (that's because garbage collection cannot move a pinned array, but is free to scrap it altogether).4A shared mutable variable (not the same as a <7!). (Note: in a non-concurrent implementation, (4 a) can be represented by (< (Maybe a)).) 5+A shared I/O port is almost the same as an 4. The main difference is that IOPort has no deadlock detection or deadlock breaking code that forcibly releases the lock. 66 is deeply magical. It is  primitive, but it is not unlifted (hence ptrArg/). We never manipulate values of type 65; it's only used in the type system, to parameterise :. :: is the primitive, unlifted type of states. It has one type parameter, thus : 6, or : s, where s is a type variable. The only purpose of the type parameter is to keep different state threads separate. It is represented by nothing at all. <A <- behaves like a single-element mutable array.D(In a non-concurrent implementation, this can be a singleton type, whose (unique) value is returned by  0. The other operations can be omitted.)EPrimitive bytecode type. HHaskell representation of a  StgStack*3 that was created (cloned) with a function in GHC.Stack.CloneStack. Please check the documentation in that module for more detailed explanations. ISee GHC.Prim#continuations. ^The type constructor ^ is used to bear witness to some type variable. It's used when you want to pass around proxy values for doing things like modelling type applications. A ^ is not only unboxed, it also has a polymorphic kind, and has no runtime representation, being totally free. cWarning: this is only available on LLVM.dWarning: this is only available on LLVM.eWarning: this is only available on LLVM.fWarning: this is only available on LLVM.gWarning: this is only available on LLVM.hWarning: this is only available on LLVM.iWarning: this is only available on LLVM.jWarning: this is only available on LLVM.kWarning: this is only available on LLVM.lWarning: this is only available on LLVM.mWarning: this is only available on LLVM.nWarning: this is only available on LLVM.oWarning: this is only available on LLVM.pWarning: this is only available on LLVM.qWarning: this is only available on LLVM.rWarning: this is only available on LLVM.sWarning: this is only available on LLVM.tWarning: this is only available on LLVM.uWarning: this is only available on LLVM.vWarning: this is only available on LLVM.wWarning: this is only available on LLVM.xWarning: this is only available on LLVM.yWarning: this is only available on LLVM.zWarning: this is only available on LLVM.{Warning: this is only available on LLVM.|Warning: this is only available on LLVM.}Warning: this is only available on LLVM.~Warning: this is only available on LLVM.Warning: this is only available on LLVM.Warning: this is only available on LLVM.$Low word of signed integer multiply.Return a triple (isHighNeeded,high,low) where high and low are respectively the high and low bits of the double-word result. isHighNeeded is a cheap way to test if the high word is a sign-extension of the low word (isHighNeeded = 0#) or not (isHighNeeded = 1#).Return non-zero if there is any possibility that the upper word of a signed integer multiply might contain useful information. Return zero only if you are completely sure that no overflow can occur. On a 32-bit platform, the recommended implementation is to do a 32 x 32 -> 64 signed multiply, and subtract result[63:32] from (result[31] >>signed 31). If this is zero, meaning that the upper word is merely a sign extension of the lower one, no overflow can occur.On a 64-bit platform it is not always possible to acquire the top 64 bits of the result. Therefore, a recommended implementation is to take the absolute value of both operands, and return 0 iff bits[63:31] of them are zero, since that means that their magnitudes fit within 31 bits, so the magnitude of the product must fit into 62 bits.If in doubt, return non-zero, but do make an effort to create the correct answer for small args, since otherwise the performance of $(*) :: Integer -> Integer -> Integer will be poor.Rounds towards zero. The behavior is undefined if the second argument is zero. Satisfies ( x y)  y  ( x y) == x?. The behavior is undefined if the second argument is zero.Rounds towards zero.Bitwise "and". Bitwise "or".Bitwise "xor".3Bitwise "not", also known as the binary complement.'Unary negation. Since the negative )8 range extends one further than the positive range,  of the most negative number is an identity operation. This way,  is always its own inverse.Add signed integers reporting overflow. First member of result is the sum truncated to an )=; second member is zero if the true sum fits in an ), nonzero if overflow occurred (the sum is either too large or too small to fit in an )).Subtract signed integers reporting overflow. First member of result is the difference truncated to an ); second member is zero if the true difference fits in an ), nonzero if overflow occurred (the difference is either too large or too small to fit in an )). Convert an ) to the corresponding & with the same integral value (up to truncation due to floating-point precision). e.g.  1# == 1.0# Convert an ) to the corresponding $ with the same integral value (up to truncation due to floating-point precision). e.g.  1# == 1.0## Convert an > to the corresponding & with the same integral value (up to truncation due to floating-point precision). e.g.  1## == 1.0# Convert an > to the corresponding $ with the same integral value (up to truncation due to floating-point precision). e.g.  1## == 1.0##Shift left. Result undefined if shift amount is not in the range 0 to word size - 1 inclusive.Shift right arithmetic. Result undefined if shift amount is not in the range 0 to word size - 1 inclusive.Shift right logical. Result undefined if shift amount is not in the range 0 to word size - 1 inclusive.Add unsigned integers reporting overflow. The first element of the pair is the result. The second element is the carry flag, which is nonzero on overflow. See also .Subtract unsigned integers reporting overflow. The first element of the pair is the result. The second element is the carry flag, which is nonzero on overflow.Add unsigned integers, with the high part (carry) in the first component of the returned pair and the low part in the second component of the pair. See also .Takes high word of dividend, then low word of dividend, then divisor. Requires that high word < divisor.Shift left logical. Result undefined if shift amount is not in the range 0 to word size - 1 inclusive.Shift right logical. Result undefined if shift amount is not in the range 0 to word size - 1 inclusive.;Count the number of set bits in the lower 8 bits of a word. Word -> Word pdep src mask = go 0 src mask where go :: Word -> Word -> Word -> Word go result _ 0 = result go result src mask = go newResult newSrc newMask where maskCtz = countTrailingZeros mask newResult = if testBit src 0 then setBit result maskCtz else result newSrc = src `shiftR` 1 newMask = clearBit mask maskCtzghc-primExtract bits from lower 8 bits of a word at locations specified by a mask.ghc-primExtract bits from lower 16 bits of a word at locations specified by a mask.ghc-primExtract bits from lower 32 bits of a word at locations specified by a mask.ghc-prim:Extract bits from a word at locations specified by a mask.ghc-primExtract bits from a word at locations specified by a mask, aka  https://en.wikipedia.org/wiki/Bit_Manipulation_Instruction_Sets#Parallel_bit_deposit_and_extractparallel bit extract.Software emulation: pext :: Word -> Word -> Word pext src mask = loop 0 0 0 where loop i count result | i >= finiteBitSize (0 :: Word) = result | testBit mask i = loop (i + 1) (count + 1) (if testBit src i then setBit result count else result) | otherwise = loop (i + 1) count result2Count leading zeros in the lower 8 bits of a word.3Count leading zeros in the lower 16 bits of a word.3Count leading zeros in the lower 32 bits of a word.%Count leading zeros in a 64-bit word.Count leading zeros in a word.3Count trailing zeros in the lower 8 bits of a word.4Count trailing zeros in the lower 16 bits of a word.4Count trailing zeros in the lower 32 bits of a word.&Count trailing zeros in a 64-bit word.Count trailing zeros in a word.Swap bytes in the lower 16 bits of a word. The higher bytes are undefined. Swap bytes in the lower 32 bits of a word. The higher bytes are undefined. "Swap bytes in a 64 bits of a word.Swap bytes in a word..Reverse the order of the bits in a 8-bit word./Reverse the order of the bits in a 16-bit word./Reverse the order of the bits in a 32-bit word./Reverse the order of the bits in a 64-bit word.(Reverse the order of the bits in a word. Truncates a $ value to the nearest ). Results are undefined if the truncation if truncation yields a value outside the range of ).Exponentiation.Convert to integer. First component of the result is -1 or 1, indicating the sign of the mantissa. The next two are the high and low 32 bits of the mantissa respectively, and the last is the exponent.Decode $# into mantissa and base-2 exponent. Bitcast a $ into a C Bitcast a C into a $ Truncates a & value to the nearest ). Results are undefined if the truncation if truncation yields a value outside the range of ).Convert to integers. First )3 in result is the mantissa; second is the exponent. Bitcast a & into a B Bitcast a B into a &Fused multiply-add operation x*y+z. See  GHC.Prim#fma."Fused multiply-subtract operation x*y-z. See  GHC.Prim#fma.$Fused negate-multiply-add operation -x*y+z. See  GHC.Prim#fma.)Fused negate-multiply-subtract operation -x*y-z. See  GHC.Prim#fma.Fused multiply-add operation x*y+z. See  GHC.Prim#fma."Fused multiply-subtract operation x*y-z. See  GHC.Prim#fma.$Fused negate-multiply-add operation -x*y+z. See  GHC.Prim#fma.)Fused negate-multiply-subtract operation -x*y-z. See  GHC.Prim#fma.Create a new mutable array with the specified number of elements, in the specified state thread, with each element containing the specified initial value.Read from specified index of mutable array. Result is not yet evaluated.Warning:+ this can fail with an unchecked exception.*Write to specified index of mutable array.Warning:+ this can fail with an unchecked exception.+Return the number of elements in the array.+Return the number of elements in the array.Read from the specified index of an immutable array. The result is packaged into an unboxed unary tuple; the result itself is not yet evaluated. Pattern matching on the tuple forces the indexing of the array to happen but does not evaluate the element itself. Evaluating the thunk prevents additional thunks from building up on the heap. Avoiding these thunks, in turn, reduces references to the argument array, allowing it to be garbage collected more promptly.0Make a mutable array immutable, without copying.1Make an immutable array mutable, without copying.Given a source array, an offset into the source array, a destination array, an offset into the destination array, and a number of elements to copy, copy the elements from the source array to the destination array. Both arrays must fully contain the specified ranges, but this is not checked. The two arrays must not be the same array in different states, but this is not checked either.Warning:+ this can fail with an unchecked exception.Given a source array, an offset into the source array, a destination array, an offset into the destination array, and a number of elements to copy, copy the elements from the source array to the destination array. Both arrays must fully contain the specified ranges, but this is not checked. In the case where the source and destination are the same array the source and destination regions may overlap.Warning:+ this can fail with an unchecked exception.Given a source array, an offset into the source array, and a number of elements to copy, create a new array with the elements from the source array. The provided array must fully contain the specified range, but this is not checked.Warning:+ this can fail with an unchecked exception.Given a source array, an offset into the source array, and a number of elements to copy, create a new array with the elements from the source array. The provided array must fully contain the specified range, but this is not checked.Warning:+ this can fail with an unchecked exception.Given a source array, an offset into the source array, and a number of elements to copy, create a new array with the elements from the source array. The provided array must fully contain the specified range, but this is not checked.Warning:+ this can fail with an unchecked exception.Given a source array, an offset into the source array, and a number of elements to copy, create a new array with the elements from the source array. The provided array must fully contain the specified range, but this is not checked.Warning:+ this can fail with an unchecked exception.Given an array, an offset, the expected old value, and the new value, perform an atomic compare and swap (i.e. write the new value if the current value and the old value are the same pointer). Returns 0 if the swap succeeds and 1 if it fails. Additionally, returns the element at the offset after the operation completes. This means that on a success the new value is returned, and on a failure the actual old value (not the expected one) is returned. Implies a full memory barrier. The use of a pointer equality on a boxed value makes this function harder to use correctly than  '. All of the difficulties of using   correctly apply to  as well.Warning:+ this can fail with an unchecked exception.Create a new mutable array with the specified number of elements, in the specified state thread, with each element containing the specified initial value.ghc-primShrink mutable array to new specified size, in the specified state thread. The new size argument must be less than or equal to the current size as reported by .Assuming the non-profiling RTS, for the copying garbage collector (default) this primitive compiles to an O(1) operation in C--, modifying the array in-place. For the non-moving garbage collector, however, the time is proportional to the number of elements shrinked out. Backends bypassing C-- representation (such as JavaScript) might behave differently.Warning:+ this can fail with an unchecked exception.Read from specified index of mutable array. Result is not yet evaluated.Warning:+ this can fail with an unchecked exception.*Write to specified index of mutable array.Warning:+ this can fail with an unchecked exception.+Return the number of elements in the array.,Return the number of elements in the array.  Deprecated%, it is unsafe in the presence of  and resizeSmallMutableArray#/ operations on the same small mutable array.ghc-primReturn the number of elements in the array, correctly accounting for the effect of  and resizeSmallMutableArray#.Read from specified index of immutable array. Result is packaged into an unboxed singleton; the result itself is not yet evaluated.0Make a mutable array immutable, without copying.1Make an immutable array mutable, without copying.Given a source array, an offset into the source array, a destination array, an offset into the destination array, and a number of elements to copy, copy the elements from the source array to the destination array. Both arrays must fully contain the specified ranges, but this is not checked. The two arrays must not be the same array in different states, but this is not checked either.Warning:+ this can fail with an unchecked exception.Given a source array, an offset into the source array, a destination array, an offset into the destination array, and a number of elements to copy, copy the elements from the source array to the destination array. The source and destination arrays can refer to the same array. Both arrays must fully contain the specified ranges, but this is not checked. The regions are allowed to overlap, although this is only possible when the same array is provided as both the source and the destination. Warning:+ this can fail with an unchecked exception.Given a source array, an offset into the source array, and a number of elements to copy, create a new array with the elements from the source array. The provided array must fully contain the specified range, but this is not checked.Warning:+ this can fail with an unchecked exception.Given a source array, an offset into the source array, and a number of elements to copy, create a new array with the elements from the source array. The provided array must fully contain the specified range, but this is not checked.Warning:+ this can fail with an unchecked exception.Given a source array, an offset into the source array, and a number of elements to copy, create a new array with the elements from the source array. The provided array must fully contain the specified range, but this is not checked.Warning:+ this can fail with an unchecked exception.Given a source array, an offset into the source array, and a number of elements to copy, create a new array with the elements from the source array. The provided array must fully contain the specified range, but this is not checked.Warning:+ this can fail with an unchecked exception.Unsafe, machine-level atomic compare and swap on an element within an array. See the documentation of .Warning:+ this can fail with an unchecked exception.Create a new mutable byte array of specified size (in bytes), in the specified state thread. The size of the memory underlying the array will be rounded up to the platform's word size.Like " but GC guarantees not to move it.Like  but allow specifying an arbitrary alignment, which must be a power of two.Warning:+ this can fail with an unchecked exception.Determine whether a 2( is guaranteed not to move during GC.Determine whether a !% is guaranteed not to move during GC.;Intended for use with pinned arrays; otherwise very unsafe!;Intended for use with pinned arrays; otherwise very unsafe!ghc-primShrink mutable byte array to new specified size (in bytes), in the specified state thread. The new size argument must be less than or equal to the current size as reported by  .Assuming the non-profiling RTS, this primitive compiles to an O(1) operation in C--, modifying the array in-place. Backends bypassing C-- representation (such as JavaScript) might behave differently.Warning:+ this can fail with an unchecked exception.ghc-primResize mutable byte array to new specified size (in bytes), shrinking or growing it. The returned 2 is either the original 2 resized in-place or, if not possible, a newly allocated (unpinned) 2- (with the original content copied over).+To avoid undefined behaviour, the original 2+ shall not be accessed anymore after a  has been performed. Moreover, no reference to the old one should be kept in order to allow garbage collection of the original 2 in case a new 2 had to be allocated.5Make a mutable byte array immutable, without copying.ghc-prim 6Make an immutable byte array mutable, without copying.&Return the size of the array in bytes.'Return the size of the array in bytes.  Deprecated%, it is unsafe in the presence of  and 1 operations on the same mutable byte array. ghc-primReturn the number of elements in the array, correctly accounting for the effect of  and . )Read an 8-bit character; offset in bytes. 0Read a 32-bit character; offset in 4-byte words. 3Read a word-sized integer; offset in machine words. Read a single-precision floating-point value; offset in bytes. >Read a double-precision floating-point value; offset in bytes. Read a 7 value; offset in bytes. .Read a 16-bit signed integer; offset in bytes. 0Read a 16-bit unsigned integer; offset in bytes. .Read a 32-bit signed integer; offset in bytes. 0Read a 32-bit unsigned integer; offset in bytes. .Read a 64-bit signed integer; offset in bytes. 0Read a 64-bit unsigned integer; offset in bytes. )Read an 8-bit character; offset in bytes.Warning:+ this can fail with an unchecked exception. 0Read a 32-bit character; offset in 4-byte words.Warning:+ this can fail with an unchecked exception. 3Read a word-sized integer; offset in machine words.Warning:+ this can fail with an unchecked exception. Read a single-precision floating-point value; offset in bytes.Warning:+ this can fail with an unchecked exception. >Read a double-precision floating-point value; offset in bytes.Warning:+ this can fail with an unchecked exception. Read a 7 value; offset in bytes.Warning:+ this can fail with an unchecked exception. .Read a 16-bit signed integer; offset in bytes.Warning:+ this can fail with an unchecked exception. 0Read a 16-bit unsigned integer; offset in bytes.Warning:+ this can fail with an unchecked exception. .Read a 32-bit signed integer; offset in bytes.Warning:+ this can fail with an unchecked exception. 0Read a 32-bit unsigned integer; offset in bytes.Warning:+ this can fail with an unchecked exception. .Read a 64-bit signed integer; offset in bytes.Warning:+ this can fail with an unchecked exception. 0Read a 64-bit unsigned integer; offset in bytes.Warning:+ this can fail with an unchecked exception. *Write an 8-bit character; offset in bytes.Warning:+ this can fail with an unchecked exception. 1Write a 32-bit character; offset in 4-byte words.Warning:+ this can fail with an unchecked exception. 4Write a word-sized integer; offset in machine words.Warning:+ this can fail with an unchecked exception. =Write a word-sized unsigned integer; offset in machine words.Warning:+ this can fail with an unchecked exception. 1Write a machine address; offset in machine words.Warning:+ this can fail with an unchecked exception. Write a single-precision floating-point value; offset in 4-byte words.Warning:+ this can fail with an unchecked exception. Write a double-precision floating-point value; offset in 8-byte words.Warning:+ this can fail with an unchecked exception. Write a 7 value; offset in machine words.Warning:+ this can fail with an unchecked exception. /Write an 8-bit signed integer; offset in bytes.Warning:+ this can fail with an unchecked exception. 1Write an 8-bit unsigned integer; offset in bytes.Warning:+ this can fail with an unchecked exception. 6Write a 16-bit signed integer; offset in 2-byte words.Warning:+ this can fail with an unchecked exception. 8Write a 16-bit unsigned integer; offset in 2-byte words.Warning:+ this can fail with an unchecked exception. 6Write a 32-bit signed integer; offset in 4-byte words.Warning:+ this can fail with an unchecked exception. 8Write a 32-bit unsigned integer; offset in 4-byte words.Warning:+ this can fail with an unchecked exception. 6Write a 64-bit signed integer; offset in 8-byte words.Warning:+ this can fail with an unchecked exception. 8Write a 64-bit unsigned integer; offset in 8-byte words.Warning:+ this can fail with an unchecked exception. *Write an 8-bit character; offset in bytes.Warning:+ this can fail with an unchecked exception. *Write a 32-bit character; offset in bytes.Warning:+ this can fail with an unchecked exception. ,Write a word-sized integer; offset in bytes.Warning:+ this can fail with an unchecked exception. 5Write a word-sized unsigned integer; offset in bytes.Warning:+ this can fail with an unchecked exception. )Write a machine address; offset in bytes.Warning:+ this can fail with an unchecked exception. ?Write a single-precision floating-point value; offset in bytes.Warning:+ this can fail with an unchecked exception. ?Write a double-precision floating-point value; offset in bytes.Warning:+ this can fail with an unchecked exception. Write a 7 value; offset in bytes.Warning:+ this can fail with an unchecked exception. /Write a 16-bit signed integer; offset in bytes.Warning:+ this can fail with an unchecked exception. 1Write a 16-bit unsigned integer; offset in bytes.Warning:+ this can fail with an unchecked exception. /Write a 32-bit signed integer; offset in bytes.Warning:+ this can fail with an unchecked exception. 1Write a 32-bit unsigned integer; offset in bytes.Warning:+ this can fail with an unchecked exception. /Write a 64-bit signed integer; offset in bytes.Warning:+ this can fail with an unchecked exception. 1Write a 64-bit unsigned integer; offset in bytes.Warning:+ this can fail with an unchecked exception. ghc-prim  src1 src1_ofs src2 src2_ofs n compares n bytes starting at offset src1_ofs in the first ! src1 to the range of n1 bytes (i.e. same length) starting at offset src2_ofs of the second ! src2. Both arrays must fully contain the specified ranges, but this is not checked. Returns an ) less than, equal to, or greater than zero if the range is found, respectively, to be byte-wise lexicographically less than, to match, or be greater than the second range.   src src_ofs dst dst_ofs len) copies the range starting at offset src_ofs of length len from the ! src to the 2 dst starting at offset dst_ofs. Both arrays must fully contain the specified ranges, but this is not checked. The two arrays must not be the same array in different states, but this is not checked either.Warning:+ this can fail with an unchecked exception.   src src_ofs dst dst_ofs len) copies the range starting at offset src_ofs of length len from the 2 src to the 2 dst starting at offset dst_ofs. Both arrays must fully contain the specified ranges, but this is not checked. The regions are allowed to overlap, although this is only possible when the same array is provided as both the source and the destination.Warning:+ this can fail with an unchecked exception. ghc-prim   src src_ofs dst dst_ofs len) copies the range starting at offset src_ofs of length len from the 2 src to the 2 dst starting at offset dst_ofs. Both arrays must fully contain the specified ranges, but this is not checked. The regions are not6 allowed to overlap, but this is also not checked.Warning:+ this can fail with an unchecked exception. Copy a range of the ByteArray# to the memory range starting at the Addr#. The ByteArray# and the memory region at Addr# must fully contain the specified ranges, but this is not checked. The Addr# must not point into the ByteArray# (e.g. if the ByteArray# were pinned), but this is not checked either.Warning:+ this can fail with an unchecked exception. Copy a range of the MutableByteArray# to the memory range starting at the Addr#. The MutableByteArray# and the memory region at Addr# must fully contain the specified ranges, but this is not checked. The Addr# must not point into the MutableByteArray# (e.g. if the MutableByteArray# were pinned), but this is not checked either.Warning:+ this can fail with an unchecked exception. Copy a memory range starting at the Addr# to the specified range in the MutableByteArray#. The memory region at Addr# and the ByteArray# must fully contain the specified ranges, but this is not checked. The Addr# must not point into the MutableByteArray# (e.g. if the MutableByteArray# were pinned), but this is not checked either.Warning:+ this can fail with an unchecked exception. ghc-prim   src dest len copies len bytes from src to dest2. These two memory ranges are allowed to overlap.%Analogous to the standard C function memmove*, but with a different argument order.Warning:+ this can fail with an unchecked exception. ghc-prim   src dest len copies len bytes from src to dest5. As the name suggests, these two memory ranges must not overlap-, although this pre-condition is not checked.%Analogous to the standard C function memcpy*, but with a different argument order.Warning:+ this can fail with an unchecked exception.   ba off len c sets the byte range [off, off+len) of the 2 to the byte c.Warning:+ this can fail with an unchecked exception. ghc-prim   dest len c sets all of the bytes in [dest, dest+len) to the value c.%Analogous to the standard C function memset*, but with a different argument order.Warning:+ this can fail with an unchecked exception. Given an array and an offset in machine words, read an element. The index is assumed to be in bounds. Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. Given an array and an offset in machine words, write an element. The index is assumed to be in bounds. Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. Given an array, an offset in machine words, the expected old value, and the new value, perform an atomic compare and swap i.e. write the new value if the current value matches the provided old value. Returns the value of the element before the operation. Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. Given an array, an offset in bytes, the expected old value, and the new value, perform an atomic compare and swap i.e. write the new value if the current value matches the provided old value. Returns the value of the element before the operation. Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. Given an array, an offset in 16 bit units, the expected old value, and the new value, perform an atomic compare and swap i.e. write the new value if the current value matches the provided old value. Returns the value of the element before the operation. Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. Given an array, an offset in 32 bit units, the expected old value, and the new value, perform an atomic compare and swap i.e. write the new value if the current value matches the provided old value. Returns the value of the element before the operation. Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. Given an array, an offset in 64 bit units, the expected old value, and the new value, perform an atomic compare and swap i.e. write the new value if the current value matches the provided old value. Returns the value of the element before the operation. Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. Given an array, and offset in machine words, and a value to add, atomically add the value to the element. Returns the value of the element before the operation. Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. Given an array, and offset in machine words, and a value to subtract, atomically subtract the value from the element. Returns the value of the element before the operation. Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. Given an array, and offset in machine words, and a value to AND, atomically AND the value into the element. Returns the value of the element before the operation. Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. Given an array, and offset in machine words, and a value to NAND, atomically NAND the value into the element. Returns the value of the element before the operation. Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. Given an array, and offset in machine words, and a value to OR, atomically OR the value into the element. Returns the value of the element before the operation. Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. Given an array, and offset in machine words, and a value to XOR, atomically XOR the value into the element. Returns the value of the element before the operation. Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. Result is meaningless if two s are so far apart that their difference doesn't fit in an ). Return the remainder when the  arg, treated like an ), is divided by the ) arg. $Coerce directly from address to int. $Coerce directly from int to address. )Read an 8-bit character; offset in bytes. 0Read a 32-bit character; offset in 4-byte words.On some platforms, the access may fail for an insufficiently aligned Addr#. 3Read a word-sized integer; offset in machine words.On some platforms, the access may fail for an insufficiently aligned Addr#. Read a single-precision floating-point value; offset in bytes. >Read a double-precision floating-point value; offset in bytes. Read a 7 value; offset in bytes. .Read a 16-bit signed integer; offset in bytes. 0Read a 16-bit unsigned integer; offset in bytes. .Read a 32-bit signed integer; offset in bytes. 0Read a 32-bit unsigned integer; offset in bytes. .Read a 64-bit signed integer; offset in bytes. 0Read a 64-bit unsigned integer; offset in bytes. )Read an 8-bit character; offset in bytes.Warning:+ this can fail with an unchecked exception. 0Read a 32-bit character; offset in 4-byte words.On some platforms, the access may fail for an insufficiently aligned Addr#.Warning:+ this can fail with an unchecked exception. 3Read a word-sized integer; offset in machine words.On some platforms, the access may fail for an insufficiently aligned Addr#.Warning:+ this can fail with an unchecked exception. Read a single-precision floating-point value; offset in bytes.Warning:+ this can fail with an unchecked exception. >Read a double-precision floating-point value; offset in bytes.Warning:+ this can fail with an unchecked exception. Read a 7 value; offset in bytes.Warning:+ this can fail with an unchecked exception. .Read a 16-bit signed integer; offset in bytes.Warning:+ this can fail with an unchecked exception. 0Read a 16-bit unsigned integer; offset in bytes.Warning:+ this can fail with an unchecked exception. .Read a 32-bit signed integer; offset in bytes.Warning:+ this can fail with an unchecked exception. 0Read a 32-bit unsigned integer; offset in bytes.Warning:+ this can fail with an unchecked exception. .Read a 64-bit signed integer; offset in bytes.Warning:+ this can fail with an unchecked exception. 0Read a 64-bit unsigned integer; offset in bytes.Warning:+ this can fail with an unchecked exception. *Write an 8-bit character; offset in bytes.Warning:+ this can fail with an unchecked exception. 1Write a 32-bit character; offset in 4-byte words.On some platforms, the access may fail for an insufficiently aligned Addr#.Warning:+ this can fail with an unchecked exception. 4Write a word-sized integer; offset in machine words.On some platforms, the access may fail for an insufficiently aligned Addr#.Warning:+ this can fail with an unchecked exception. =Write a word-sized unsigned integer; offset in machine words.On some platforms, the access may fail for an insufficiently aligned Addr#.Warning:+ this can fail with an unchecked exception. 1Write a machine address; offset in machine words.On some platforms, the access may fail for an insufficiently aligned Addr#.Warning:+ this can fail with an unchecked exception. Write a single-precision floating-point value; offset in 4-byte words.On some platforms, the access may fail for an insufficiently aligned Addr#.Warning:+ this can fail with an unchecked exception. Write a double-precision floating-point value; offset in 8-byte words.On some platforms, the access may fail for an insufficiently aligned Addr#.Warning:+ this can fail with an unchecked exception. Write a 7 value; offset in machine words.On some platforms, the access may fail for an insufficiently aligned Addr#.Warning:+ this can fail with an unchecked exception. /Write an 8-bit signed integer; offset in bytes.Warning:+ this can fail with an unchecked exception. 1Write an 8-bit unsigned integer; offset in bytes.Warning:+ this can fail with an unchecked exception. 6Write a 16-bit signed integer; offset in 2-byte words.On some platforms, the access may fail for an insufficiently aligned Addr#.Warning:+ this can fail with an unchecked exception. 8Write a 16-bit unsigned integer; offset in 2-byte words.On some platforms, the access may fail for an insufficiently aligned Addr#.Warning:+ this can fail with an unchecked exception. 6Write a 32-bit signed integer; offset in 4-byte words.On some platforms, the access may fail for an insufficiently aligned Addr#.Warning:+ this can fail with an unchecked exception. 8Write a 32-bit unsigned integer; offset in 4-byte words.On some platforms, the access may fail for an insufficiently aligned Addr#.Warning:+ this can fail with an unchecked exception. 6Write a 64-bit signed integer; offset in 8-byte words.On some platforms, the access may fail for an insufficiently aligned Addr#.Warning:+ this can fail with an unchecked exception. 8Write a 64-bit unsigned integer; offset in 8-byte words.On some platforms, the access may fail for an insufficiently aligned Addr#.Warning:+ this can fail with an unchecked exception. *Write an 8-bit character; offset in bytes.Warning:+ this can fail with an unchecked exception. *Write a 32-bit character; offset in bytes.Warning:+ this can fail with an unchecked exception. ,Write a word-sized integer; offset in bytes.Warning:+ this can fail with an unchecked exception. 5Write a word-sized unsigned integer; offset in bytes.Warning:+ this can fail with an unchecked exception. )Write a machine address; offset in bytes.Warning:+ this can fail with an unchecked exception. ?Write a single-precision floating-point value; offset in bytes.Warning:+ this can fail with an unchecked exception. ?Write a double-precision floating-point value; offset in bytes.Warning:+ this can fail with an unchecked exception. Write a 7 value; offset in bytes.Warning:+ this can fail with an unchecked exception. /Write a 16-bit signed integer; offset in bytes.Warning:+ this can fail with an unchecked exception. 1Write a 16-bit unsigned integer; offset in bytes.Warning:+ this can fail with an unchecked exception. /Write a 32-bit signed integer; offset in bytes.Warning:+ this can fail with an unchecked exception. 1Write a 32-bit unsigned integer; offset in bytes.Warning:+ this can fail with an unchecked exception. /Write a 64-bit signed integer; offset in bytes.Warning:+ this can fail with an unchecked exception. 1Write a 64-bit unsigned integer; offset in bytes.Warning:+ this can fail with an unchecked exception. The atomic exchange operation. Atomically exchanges the value at the first address with the Addr# given as second argument. Implies a read barrier.Warning:+ this can fail with an unchecked exception. The atomic exchange operation. Atomically exchanges the value at the address with the given value. Returns the old value. Implies a read barrier.Warning:+ this can fail with an unchecked exception. 1Compare and swap on a word-sized memory location.;Use as: s -> atomicCasAddrAddr# location expected desired sThis version always returns the old value read. This follows the normal protocol for CAS operations (and matches the underlying instruction on most architectures).Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. =Compare and swap on a word-sized and aligned memory location.;Use as: s -> atomicCasWordAddr# location expected desired sThis version always returns the old value read. This follows the normal protocol for CAS operations (and matches the underlying instruction on most architectures).Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. >Compare and swap on a 8 bit-sized and aligned memory location. atomicCasWordAddr8# location expected desired sThis version always returns the old value read. This follows the normal protocol for CAS operations (and matches the underlying instruction on most architectures).Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. ?Compare and swap on a 16 bit-sized and aligned memory location.=Use as: s -> atomicCasWordAddr16# location expected desired sThis version always returns the old value read. This follows the normal protocol for CAS operations (and matches the underlying instruction on most architectures).Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. ?Compare and swap on a 32 bit-sized and aligned memory location.=Use as: s -> atomicCasWordAddr32# location expected desired sThis version always returns the old value read. This follows the normal protocol for CAS operations (and matches the underlying instruction on most architectures).Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. ?Compare and swap on a 64 bit-sized and aligned memory location.=Use as: s -> atomicCasWordAddr64# location expected desired sThis version always returns the old value read. This follows the normal protocol for CAS operations (and matches the underlying instruction on most architectures).Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. Given an address, and a value to add, atomically add the value to the element. Returns the value of the element before the operation. Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. Given an address, and a value to subtract, atomically subtract the value from the element. Returns the value of the element before the operation. Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. Given an address, and a value to AND, atomically AND the value into the element. Returns the value of the element before the operation. Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. Given an address, and a value to NAND, atomically NAND the value into the element. Returns the value of the element before the operation. Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. Given an address, and a value to OR, atomically OR the value into the element. Returns the value of the element before the operation. Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. Given an address, and a value to XOR, atomically XOR the value into the element. Returns the value of the element before the operation. Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. Given an address, read a machine word. Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. Given an address, write a machine word. Implies a full memory barrier.Warning:+ this can fail with an unchecked exception. Create <8 with specified initial value in specified state thread. Read contents of <. Result is not yet evaluated. Write contents of <. #Atomically exchange the value of a <. Modify the contents of a <', returning the previous contents x :: a and the result of applying the given function to the previous contents f x :: c.The data type c (not a newtype=!) must be a record whose first field is of lifted type  a :: Type6 and is not unpacked. For example, product types  c ~ Solo a or  c ~ (a, b) work well. If the record type is both monomorphic and strict in its first field, it's recommended to mark the latter {-# NOUNPACK #-} explicitly.Under the hood  . atomically replaces a pointer to an old x :: a$ with a pointer to a selector thunk fst r , where fst5 is a selector for the first field of the record and r& is a function application thunk r = f x.atomicModifyIORef2Native from atomic-modify-general9 package makes an effort to reflect restrictions on c< faithfully, providing a well-typed high-level wrapper. Modify the contents of a <, returning the previous contents and the result of applying the given function to the previous contents. Compare-and-swap: perform a pointer equality test between the first value passed to this function and the value stored inside the <. If the pointers are equal, replace the stored value with the second value passed to this function, otherwise do nothing. Returns the final value stored inside the < . The )0 indicates whether a swap took place, with 1#" meaning that we didn't swap, and 0# that we did. Implies a full memory barrier. Because the comparison is done on the level of pointers, all of the difficulties of using   correctly apply to   as well.   k handler s evaluates k s , invoking handler on any exceptions thrown.Note that the result type here isn't quite as unrestricted as the polymorphic type might suggest; see the section "RuntimeRep polymorphism in continuation-style primops" for details.   k s evaluates k s such that asynchronous exceptions are deferred until after evaluation has finished.Note that the result type here isn't quite as unrestricted as the polymorphic type might suggest; see the section "RuntimeRep polymorphism in continuation-style primops" for details.   k s evaluates k s such that asynchronous exceptions are deferred until after evaluation has finished.Note that the result type here isn't quite as unrestricted as the polymorphic type might suggest; see the section "RuntimeRep polymorphism in continuation-style primops" for details. unmaskAsyncUninterruptible# k s evaluates k s5 such that asynchronous exceptions are unmasked.Note that the result type here isn't quite as unrestricted as the polymorphic type might suggest; see the section "RuntimeRep polymorphism in continuation-style primops" for details. See GHC.Prim#continuations. See GHC.Prim#continuations. See GHC.Prim#continuations. Warning:+ this can fail with an unchecked exception.  Create a new F# holding a specified initial value. Read contents of F6 inside an STM transaction, i.e. within a call to  .. Does not force evaluation of the result. Read contents of F outside an STM transaction. Does not force evaluation of the result. Write contents of F.  Create new 4; initially empty. If 4 is empty, block until it becomes full. Then remove and return its contents, and set it empty. If 4 is empty, immediately return with integer 0 and value undefined. Otherwise, return with integer 1 and contents of 4 , and set 4 empty. If 4 is full, block until it becomes empty. Then store value arg as its new contents. If 4 is full, immediately return with integer 0. Otherwise, store value arg as 'MVar#''*s new contents, and return with integer 1. If 4 is empty, block until it becomes full. Then read its contents without modifying the MVar, without possibility of intervention from other threads. If 4 is empty, immediately return with integer 0 and value undefined. Otherwise, return with integer 1 and contents of 4.  Return 1 if 4 is empty; 0 otherwise.  Create new 5; initially empty. If 5 is empty, block until it becomes full. Then remove and return its contents, and set it empty. Throws an IOPortException6 if another thread is already waiting to read this 5. If 5= is full, immediately return with integer 0, throwing an IOPortException$. Otherwise, store value arg as  'IOPort#''/s new contents, and return with integer 1. 'Sleep specified number of microseconds.  IO (Maybe ByteArray#) , with a 1# tag denoting Just. ghc-prim 2Get the status of the given thread. Result is "(ThreadStatus, Capability, Locked) where  ThreadStatus/ is one of the status constants defined in rts/Constants.h,  Capability is the number of the capability which currently owns the thread, and Locked is a boolean indicating whether the thread is bound to that capability. ghc-prim Returns an array of the threads started by the program. Note that this threads which have finished execution may or may not be present in this list, depending upon whether they have been collected by the garbage collector.   k v finalizer s# creates a weak reference to value k2, with an associated reference to some value v. If k is still alive then v can be retrieved using  . Note that the type of k5 must be represented by a pointer (i.e. of kind TYPE ' LiftedRep or TYPE ' UnliftedRep@).   fptr ptr flag eptr w$ attaches a C function pointer fptr to a weak pointer w as a finalizer. If flag is zero, fptr( will be called with one argument, ptr8. Otherwise, it will be called with two arguments, eptr and ptr.  $ returns 1 on success, or 0 if w is already dead. Finalize a weak pointer. The return value is an unboxed tuple containing the new state of the world and an "unboxed Maybe", represented by an )7 and a (possibly invalid) finalization action. An ) of 1> indicates that the finalizer is valid. The return value b' from the finalizer should be ignored. Create a new CNF with a single compact block. The argument is the capacity of the compact block (in bytes, not words). The capacity is rounded up to a multiple of the allocator block size and is capped to one mega block. Set the new allocation size of the CNF. This value (in bytes) determines the capacity of each compact block in the CNF. It does not retroactively affect existing compact blocks in the CNF. Returns 1# if the object is contained in the CNF, 0# otherwise. =Returns 1# if the object is in any CNF at all, 0# otherwise. Returns the address and the utilized size (in bytes) of the first compact block of a CNF. Given a CNF and the address of one its compact blocks, returns the next compact block and its utilized size, or = if the argument was the last compact block in the CNF. Attempt to allocate a compact block with the capacity (in bytes) given by the first argument. The ; is a pointer to previous compact block of the CNF or 6 to create a new CNF with a single compact block.6The resulting block is not known to the GC until   is called on it, and care must be taken so that the address does not escape or memory will be leaked. Given the pointer to the first block of a CNF and the address of the root object in the old address space, fix up the internal pointers inside the CNF to account for a different position in memory than when it was serialized. This method must be called exactly once after importing a serialized CNF. It returns the new CNF and the new adjusted root address. ?Recursively add a closure and its transitive closure to a G (a CNF), evaluating any unevaluated components at the same time. Note:  6 is not thread-safe, so only one thread may call   with a particular G at any given time. The primop does not enforce any mutual exclusion; the caller is expected to arrange this. Like  7, but retains sharing and cycles during compaction. Return the total capacity (in bytes) of all the compact blocks in the CNF. Returns 1#% if the given pointers are equal and 0# otherwise. 6Returns the number of sparks in the local spark pool.   x s k keeps the value x4 alive during the execution of the computation k.Note that the result type here isn't quite as unrestricted as the polymorphic type might suggest; see the section "RuntimeRep polymorphism in continuation-style primops" for details. Used internally to implement  dataToTag#;: Use that function instead! This one normally offers  no advantage and comes with no stability guarantees: it may change its type, its name, or its behavior with  no warning between compiler releases.It is expected that this function will be un-exposed in a future release of ghc.For more details, look at Note [DataToTag overview]; in GHC.Tc.Instance.Class in the source code for ,the specific compiler version you are using. Used internally to implement  dataToTag#2: Use that function instead! This one offers  no advantage and comes with no stability guarantees: it may change its type, its name, or its behavior with  no warning between compiler releases.It is expected that this function will be un-exposed in a future release of ghc.For more details, look at Note [DataToTag overview]; in GHC.Tc.Instance.Class in the source code for ,the specific compiler version you are using.  Convert an  to a followable Any type. Retrieve the address of any Haskell value. This is essentially an  unsafeCoerce#, but if implemented as such the core lint pass complains and fails to compile. As a primop, it is opaque to core/stg, and only appears in cmm (where the copy propagation pass will get rid of it). Note that "a" must be a value, not a thunk! It's too late for strictness analysis to enforce this, so you're on your own to guarantee this. Also note that  is not a GC pointer - up to you to guarantee that it does not become a dangling pointer immediately after you get it. Wrap a BCO in a AP_UPD thunk which will be updated with the value of the BCO when evaluated.  instrs lits ptrs arity bitmap creates a new bytecode object. The resulting object encodes a function of the given arity with the instructions encoded in instrs:, and a static reference table usage bitmap given by bitmap.  closure copies the closure and pointers in the payload of the given closure into two new arrays, and returns a pointer to the first word of the closure's info table, a non-pointer array for the raw bytes of the closure, and a pointer array for the pointers in the payload.  closure> returns the size of the given closure in machine words. Returns the current CostCentreStack (value is NULL if not profiling). Takes a dummy argument which can be used to avoid the call to  being floated out by the simplifier, which would result in an uninformative stack (CAF). Run the supplied IO action with an empty CCS. For example, this is used by the interpreter to run an interpreted computation without the call stack showing that it was invoked from GHC.  Fills the given buffer with the  InfoProvEnt6 for the info table of the given object. Returns 1# on success and 0# otherwise.Emits an event via the RTS tracing framework. The contents of the event is the zero-terminated byte string passed as the first argument. The event will be emitted either to the  .eventlog> file, or to stderr, depending on the runtime RTS flags. Emits an event via the RTS tracing framework. The contents of the event is the binary object passed as the first argument with the given length passed as the second argument. The event will be emitted to the  .eventlog file. Emits a marker event via the RTS tracing framework. The contents of the event is the zero-terminated byte string passed as the first argument. The event will be emitted either to the  .eventlog> file, or to stderr, depending on the runtime RTS flags. Sets the allocation counter for the current thread to the given value. 0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.0Broadcast a scalar to all elements of a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.5Pack the elements of an unboxed tuple into a vector. Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.8Unpack the elements of a vector into an unboxed tuple. #Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.3Insert a scalar at the given position in a vector. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.Add two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Subtract two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.#Multiply two vectors element-wise. Warning: this is only available on LLVM.!Divide two vectors element-wise. Warning: this is only available on LLVM.!Divide two vectors element-wise. Warning: this is only available on LLVM.!Divide two vectors element-wise. Warning: this is only available on LLVM.!Divide two vectors element-wise. Warning: this is only available on LLVM.!Divide two vectors element-wise. Warning: this is only available on LLVM.!Divide two vectors element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM."Rounds towards zero element-wise. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM. Satisfies (quot# x y) times# y plus# (rem# x y) == x. Warning: this is only available on LLVM.Negate element-wise. Warning: this is only available on LLVM.Negate element-wise. Warning: this is only available on LLVM.Negate element-wise. Warning: this is only available on LLVM.Negate element-wise. Warning: this is only available on LLVM.Negate element-wise. Warning: this is only available on LLVM.Negate element-wise. Warning: this is only available on LLVM.Negate element-wise. Warning: this is only available on LLVM.Negate element-wise. Warning: this is only available on LLVM.Negate element-wise. Warning: this is only available on LLVM.Negate element-wise. Warning: this is only available on LLVM.Negate element-wise. Warning: this is only available on LLVM.Negate element-wise. Warning: this is only available on LLVM.Negate element-wise. Warning: this is only available on LLVM.Negate element-wise. Warning: this is only available on LLVM.Negate element-wise. Warning: this is only available on LLVM.Negate element-wise. Warning: this is only available on LLVM.Negate element-wise. Warning: this is only available on LLVM.Negate element-wise. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.7Read a vector from specified index of immutable array. Warning: this is only available on LLVM.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.5Read a vector from specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.4Write a vector to specified index of mutable array. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Reads vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Write vector; offset in bytes. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of immutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Read a vector from specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.Write a vector to specified index of mutable array of scalars; offset is in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Reads vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception.)Write vector; offset in scalar elements. Warning: this is only available on LLVM and can fail with an unchecked exception. (                                                                                                                    E!"G$|~(&{}5),hld-mei.fjn+cgk4<12I^6`a;7H:FD0>AtxpByquCrvz@osw ("+@,A-B.C)>$&1`a!2  < I F 4 5 :6D 0 7; G E ( ^Hcdefghijklmnopqrstuvwxyz{|}~$%%&%%&&"(c) The University of Glasgow 2009see libraries/ghc-prim/LICENSEghc-devs@haskell.orginternalnon-portable (GHC Extensions)Unsafe /01ghc-prim The constraint  cls meth1 can be solved when evidence for the constraint cls6 can be provided in the form of a dictionary of type meth. This requires cls8 to be a class constraint whose single method has type meth.5For more (important) details on how this works, see Note [withDict] in GHC.Tc.Instance.Class in GHC."(c) The University of Glasgow 2009see libraries/ghc-prim/LICENSEghc-devs@haskell.orginternalnon-portable (GHC Extensions) Trustworthy01The < function restrains strictness analysis a little. The call lazy e means the same as e, but  has a magical property so far as strictness analysis is concerned: it is lazy in its first argument, even though its semantics is strict. After strictness analysis has run, calls to * are inlined to be the identity function.This behaviour is occasionally useful when controlling evaluation order. Notably, ' is used in the library definition of '(: 9par :: a -> b -> b par x y = case (par# x) of _ -> lazy yIf  were not lazy, '( would look strict in y) which would defeat the whole purpose of '(.The  function can be used to give a hint to the compiler that its argument will be called at most once, which may (or may not) enable certain optimizations. It can be useful to improve the performance of code in continuation passing style.If  is used wrongly, then it may be that computations whose result that would otherwise be shared are re-evaluated every time they are used. Otherwise, the use of  is safe. is representation-polymorphic: the type variables may refer to lifted or unlifted types.Apply a function to a : 6. token. When manually applying a function to , it is necessary to use NOINLINE0 to prevent semantically undesirable floating.  is inlined, but only very late in compilation after all floating is complete. The call inline f arranges that f? is inlined, regardless of its size. More precisely, the call inline f% rewrites to the right-hand side of f's definition. This allows the programmer to control inlining from a particular call site rather than the definition site of the function (c.f. INLINE pragmas).This inlining occurs regardless of the argument to the call or the size of f='s definition; it is unconditional. The main caveat is that f's definition must be visible to the compiler; it is therefore recommended to mark the function with an  INLINABLE pragma at its definition so that GHC guarantees to record its unfolding regardless of size. If no inlining takes place, the  function expands to the identity function in Phase zero, so its use imposes no overhead. The call  noinline f arranges that f will not be inlined. It is removed during CorePrep so that its use imposes no overhead (besides the fact that it blocks inlining.) evaluates its argument and returns the index (starting at zero) of the constructor used to produce that argument. Any algebraic data type with all of its constructors in scope may be used with  dataToTag#.dataToTag# (Left ())0#dataToTag# (Right undefined)1#None Displays "Oops! Entered absent arg" ++ errormsg and exits the program.Closure introduced by GHC.Stg.Unarise for unused unboxed sum fields.5See Note [aBSENT_SUM_FIELD_ERROR_ID] in GHC.Core.MakeDisplay the CString whose address is given as an argument and exit.  Trustworthy "(c) The University of Glasgow 2011see libraries/ghc-prim/LICENSEghc-devs@haskell.orginternalnon-portable (GHC Extensions)None Compute the length of a NUL-terminated string. This address must refer to immutable memory. GHC includes a built-in rule for constant folding when the argument is a statically-known literal. That is, a core-to-core pass reduces the expression cstringLength# "hello"# to the constant 5#.Take the current address, read unicode char of the given size. We obviously want the number of bytes, but we have to read one byte to determine the number of bytes for the current codepoint so we might as well reuse it and avoid a read.Side Note: We don't dare to decode all 4 possibilities at once. Reading past the end of the addr might trigger an exception. For this reason we really have to check the width first and only decode after.   ((c) The University of Glasgow, 1992-2002see libraries/base/LICENSEghc-devs@haskell.orginternalnon-portable (GHC extensions) Trustworthy/17+ The  class defines equality () and inequality (,). All the basic datatypes exported by the Prelude are instances of , and  may be derived for any datatype whose constituents are also instances of .'The Haskell Report defines no laws for . However, instances are encouraged to follow these properties:  Reflexivityx == x = Symmetryx == y = y == x Transitivityif x == y && y == z = , then x == z = Extensionalityif x == y =  and f4 is a function whose return type is an instance of , then  f x == f y = Negationx /= y =  not (x == y)The - class is used for totally ordered datatypes. Instances of  can be derived for any user-defined datatype whose constituent types are in . The declared order of the constructors in the data declaration determines the ordering in derived  instances. The 3 datatype allows a single comparison to determine the precise ordering of two objects., as defined by the Haskell report, implements a total order and has the following properties:  Comparabilityx <= y || y <= x =  Transitivityif x <= y && y <= z = , then x <= z =  Reflexivityx <= x =  Antisymmetryif x <= y && y <= x = , then x == y = 9The following operator interactions are expected to hold: x >= y = y <= xx < y = x <= y && x /= yx > y = y < xx < y = compare x y == LTx > y = compare x y == GTx == y = compare x y == EQ"min x y == if x <= y then x else y = "max x y == if x >= y then x else y = Note that (7.) and (8.) do not require  and  to return either of their arguments. The result is merely required to equal# one of the arguments in terms of .$Minimal complete definition: either  or  . Using ) can be more efficient for complex types. The syntax ?x :: a is desugared into IP "x" a IP is declared very early, so that libraries can take advantage of the implicit-call-stack feature*Boolean "and", lazy in the second argument)Boolean "or", lazy in the second argument Boolean "not"!Note that due to the presence of NaN, %'s ( instance does not satisfy reflexivity.0/0 == (0/0 :: Double)FalseAlso note that %'s * instance does not satisfy substitutivity:0 == (-0 :: Double)Truerecip 0 == recip (-0 :: Double)False!Note that due to the presence of NaN, ''s ( instance does not satisfy reflexivity.0/0 == (0/0 :: Float)FalseAlso note that ''s * instance does not satisfy extensionality:0 == (-0 :: Float)Truerecip 0 == recip (-0 :: Float)False IEEE 754 %-precision type includes not only numbers, but also positive and negative infinities and a special element called NaN! (which can be quiet or signal).IEEE 754-2008, section 5.11 requires that if at least one of arguments of , , ,  is NaN& then the result of the comparison is , and instance  % complies with this requirement. This violates the reflexivity: both NaN  NaN and NaN  NaN are .$IEEE 754-2008, section 5.10 defines  totalOrder predicate. Unfortunately,  on %s violates the IEEE standard and does not define a total order. More specifically, both  NaN x and  x NaN always return .2Thus, users must be extremely cautious when using instance  %. For instance, one should avoid ordered containers with keys represented by %, because data loss and corruption may happen. An IEEE-compliant  is available in fp-ieee package as TotallyOrdered newtype.!Moving further, the behaviour of  and  with regards to NaN is also non-compliant. IEEE 754-2008, section 5.3.1 defines that quiet NaN) should be treated as a missing data by minNum and maxNum functions, for example, #minNum(NaN, 1) = minNum(1, NaN) = 1. Some languages such as Java deviate from the standard implementing %minNum(NaN, 1) = minNum(1, NaN) = NaN . However,  /  in base are even worse:  NaN 1 is 1, but  1 NaN is NaN.IEEE 754-2008 compliant  /  can be found in ieee754 package under minNum / maxNum( names. Implementations compliant with  minimumNumber /  maximumNumber from a newer  https://grouper.ieee.org/groups/msc/ANSI_IEEE-Std-754-2019/background/ IEEE 754-2019", section 9.6 are available from fp-ieee package.See instance  %5 for discussion of deviations from IEEE 754 standard. )*+,-./01    23456789:;<=>?@ABCDE#FGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~p                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                             ,)/*+-.01ghc-primGHC.Prim.PanicGHC.Prim GHC.CString GHC.Classes GHC.MagicGHC.Magic.Dict GHC.Types GHC.TupleGHC.PrimopWrappersGHC.Prim.PtrEq GHC.Prim.ExtGHC.Prim.Exception GHC.DebugPreludeminBoundmaxBoundBounded Data.StringStringData.Type.Equality:~~:>>>>=Monad Data.TypeableTypeRep4GHC.ExtsreallyUnsafePtrEquality#GHC.Exception.TypeoverflowExceptionunderflowExceptiondivZeroExceptionrunRW#067Control.Parallelpar$dm/=$dm<$dm<=$dm==$dm>$dm>= $dmcompare$dmmax$dmmin32 absentErrorabsentConstraintErrorseqabsentSumFieldError realWorld#unpackCStringUtf8#unpackAppendCStringUtf8#unpackFoldrCStringUtf8#unpackCString#unpackAppendCString#unpackFoldrCString#void#divInt#modInt#cstringLength# nullAddr#lazyoneShotinlinenoinlinecoerce==>=proxy#EqOrdWithDict DataToTagIPAddr#Array#Bool ByteArray#Char#CharDouble#DoubleFloat#FloatFUNInt#IntInt8#Int16#Int32#Int64#ListWeak# MutableArray#MutableByteArray#OrderingMVar#IOPort# RealWorld StablePtr#~~~State# StableName#MutVar#IOWord#WordWord8#Word16#Word32#Word64# ThreadId#BCOTVar#Compact#StackSnapshot# PromptTag#Type UnliftedTypeTYPE CONSTRAINT ConstraintLevity RuntimeRepVecCountVecElem LiftedRep UnliftedRep ZeroBitRep ZeroBitTypeTyConModuleTrNameKindRep TypeLitSortAny CoercibleProxy#SPEC SmallArray#SmallMutableArray# MultiplicityInt8X16#Int16X8#Int32X4#Int64X2#Int8X32# Int16X16#Int32X8#Int64X4#Int8X64# Int16X32# Int32X16#Int64X8# Word8X16# Word16X8# Word32X4# Word64X2# Word8X32# Word16X16# Word32X8# Word64X4# Word8X64# Word16X32# Word32X16# Word64X8#FloatX4# DoubleX2#FloatX8# DoubleX4# FloatX16# DoubleX8#SymbolUnitSoloTuple2Tuple3Tuple4Tuple5Tuple6Tuple7Tuple8Tuple9Tuple10Tuple11Tuple12Tuple13Tuple14Tuple15Tuple16Tuple17Tuple18Tuple19Tuple20Tuple21Tuple22Tuple23Tuple24Tuple25Tuple26Tuple27Tuple28Tuple29Tuple30Tuple31Tuple32Tuple33Tuple34Tuple35Tuple36Tuple37Tuple38Tuple39Tuple40Tuple41Tuple42Tuple43Tuple44Tuple45Tuple46Tuple47Tuple48Tuple49Tuple50Tuple51Tuple52Tuple53Tuple54Tuple55Tuple56Tuple57Tuple58Tuple59Tuple60Tuple61Tuple62Tuple63Tuple64Unit#Solo#Tuple2#Tuple3#Tuple4#Tuple5#Tuple6#Tuple7#Tuple8#Tuple9#Tuple10#Tuple11#Tuple12#Tuple13#Tuple14#Tuple15#Tuple16#Tuple17#Tuple18#Tuple19#Tuple20#Tuple21#Tuple22#Tuple23#Tuple24#Tuple25#Tuple26#Tuple27#Tuple28#Tuple29#Tuple30#Tuple31#Tuple32#Tuple33#Tuple34#Tuple35#Tuple36#Tuple37#Tuple38#Tuple39#Tuple40#Tuple41#Tuple42#Tuple43#Tuple44#Tuple45#Tuple46#Tuple47#Tuple48#Tuple49#Tuple50#Tuple51#Tuple52#Tuple53#Tuple54#Tuple55#Tuple56#Tuple57#Tuple58#Tuple59#Tuple60#Tuple61#Tuple62#Tuple63#Tuple64#C#D#FalseF#I#TrueW#LTEQGTTrNameSTrNameDVecRepTupleRepSumRepBoxedRepIntRepInt8RepInt16RepInt32RepInt64RepWordRepWord8Rep Word16Rep Word32Rep Word64RepAddrRepFloatRep DoubleRepLiftedUnliftedVec2Vec4Vec8Vec16Vec32Vec64 Int8ElemRep Int16ElemRep Int32ElemRep Int64ElemRep Word8ElemRep Word16ElemRep Word32ElemRep Word64ElemRep FloatElemRep DoubleElemRepKindRepTyConApp KindRepVar KindRepApp KindRepFun KindRepTYPEKindRepTypeLitSKindRepTypeLitD TypeLitSymbol TypeLitNat TypeLitCharOneMany()MkSolo(,)(,,)(,,,)(,,,,)(,,,,,)(,,,,,,) (,,,,,,,) (,,,,,,,,) (,,,,,,,,,) (,,,,,,,,,,) (,,,,,,,,,,,)(,,,,,,,,,,,,)(,,,,,,,,,,,,,)(,,,,,,,,,,,,,,)(,,,,,,,,,,,,,,,)(,,,,,,,,,,,,,,,,)(,,,,,,,,,,,,,,,,,)(,,,,,,,,,,,,,,,,,,)(,,,,,,,,,,,,,,,,,,,)(,,,,,,,,,,,,,,,,,,,,)(,,,,,,,,,,,,,,,,,,,,,)(,,,,,,,,,,,,,,,,,,,,,,)(,,,,,,,,,,,,,,,,,,,,,,,)(,,,,,,,,,,,,,,,,,,,,,,,,)(,,,,,,,,,,,,,,,,,,,,,,,,,)(,,,,,,,,,,,,,,,,,,,,,,,,,,)(,,,,,,,,,,,,,,,,,,,,,,,,,,,)(,,,,,,,,,,,,,,,,,,,,,,,,,,,,)(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)!(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)"(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)#(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)$(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)%(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)&(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)'(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)((,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,))(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)*(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)+(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,),(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)-(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,).(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)/(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)0(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)1(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)2(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)3(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)4(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)5(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)6(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)7(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)8(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)9(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,):(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,);(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)<(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)=(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)>(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)?(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,)gtChar#geChar#eqChar#neChar#ltChar#leChar#ord# int8ToInt# intToInt8# negateInt8# plusInt8#subInt8# timesInt8# quotInt8#remInt8# quotRemInt8#uncheckedShiftLInt8#uncheckedShiftRAInt8#uncheckedShiftRLInt8# int8ToWord8#eqInt8#geInt8#gtInt8#leInt8#ltInt8#neInt8# word8ToWord# wordToWord8# plusWord8# subWord8# timesWord8# quotWord8# remWord8# quotRemWord8# andWord8#orWord8# xorWord8# notWord8#uncheckedShiftLWord8#uncheckedShiftRLWord8# word8ToInt8#eqWord8#geWord8#gtWord8#leWord8#ltWord8#neWord8# int16ToInt# intToInt16# negateInt16# plusInt16# subInt16# timesInt16# quotInt16# remInt16# quotRemInt16#uncheckedShiftLInt16#uncheckedShiftRAInt16#uncheckedShiftRLInt16#int16ToWord16#eqInt16#geInt16#gtInt16#leInt16#ltInt16#neInt16# word16ToWord# wordToWord16# plusWord16# subWord16# timesWord16# quotWord16# remWord16#quotRemWord16# andWord16# orWord16# xorWord16# notWord16#uncheckedShiftLWord16#uncheckedShiftRLWord16#word16ToInt16# eqWord16# geWord16# gtWord16# leWord16# ltWord16# neWord16# int32ToInt# intToInt32# negateInt32# plusInt32# subInt32# timesInt32# quotInt32# remInt32# quotRemInt32#uncheckedShiftLInt32#uncheckedShiftRAInt32#uncheckedShiftRLInt32#int32ToWord32#eqInt32#geInt32#gtInt32#leInt32#ltInt32#neInt32# word32ToWord# wordToWord32# plusWord32# subWord32# timesWord32# quotWord32# remWord32#quotRemWord32# andWord32# orWord32# xorWord32# notWord32#uncheckedShiftLWord32#uncheckedShiftRLWord32#word32ToInt32# eqWord32# geWord32# gtWord32# leWord32# ltWord32# neWord32# int64ToInt# intToInt64# negateInt64# plusInt64# subInt64# timesInt64# quotInt64# remInt64#uncheckedIShiftL64#uncheckedIShiftRA64#uncheckedIShiftRL64#int64ToWord64#eqInt64#geInt64#gtInt64#leInt64#ltInt64#neInt64# word64ToWord# wordToWord64# plusWord64# subWord64# timesWord64# quotWord64# remWord64#and64#or64#xor64#not64#uncheckedShiftL64#uncheckedShiftRL64#word64ToInt64# eqWord64# geWord64# gtWord64# leWord64# ltWord64# neWord64#+#-#*# timesInt2#mulIntMayOflo#quotInt#remInt# quotRemInt#andI#orI#xorI#notI# negateInt#addIntC#subIntC#>#>=#==#/=#<#<=#chr# int2Word# int2Float# int2Double# word2Float# word2Double#uncheckedIShiftL#uncheckedIShiftRA#uncheckedIShiftRL# plusWord# addWordC# subWordC# plusWord2# minusWord# timesWord# timesWord2# quotWord#remWord# quotRemWord# quotRemWord2#and#or#xor#not#uncheckedShiftL#uncheckedShiftRL# word2Int#gtWord#geWord#eqWord#neWord#ltWord#leWord#popCnt8# popCnt16# popCnt32# popCnt64#popCnt#pdep8#pdep16#pdep32#pdep64#pdep#pext8#pext16#pext32#pext64#pext#clz8#clz16#clz32#clz64#clz#ctz8#ctz16#ctz32#ctz64#ctz# byteSwap16# byteSwap32# byteSwap64# byteSwap# bitReverse8# bitReverse16# bitReverse32# bitReverse64# bitReverse# narrow8Int# narrow16Int# narrow32Int# narrow8Word# narrow16Word# narrow32Word#>##>=##==##/=##<##<=##+##-##*##/## negateDouble# fabsDouble# double2Int# double2Float# expDouble# expm1Double# logDouble# log1pDouble# sqrtDouble# sinDouble# cosDouble# tanDouble# asinDouble# acosDouble# atanDouble# sinhDouble# coshDouble# tanhDouble# asinhDouble# acoshDouble# atanhDouble#**##decodeDouble_2Int#decodeDouble_Int64#castDoubleToWord64#castWord64ToDouble#gtFloat#geFloat#eqFloat#neFloat#ltFloat#leFloat# plusFloat# minusFloat# timesFloat# divideFloat# negateFloat# fabsFloat# float2Int# expFloat# expm1Float# logFloat# log1pFloat# sqrtFloat# sinFloat# cosFloat# tanFloat# asinFloat# acosFloat# atanFloat# sinhFloat# coshFloat# tanhFloat# asinhFloat# acoshFloat# atanhFloat# powerFloat# float2Double#decodeFloat_Int#castFloatToWord32#castWord32ToFloat# fmaddFloat# fmsubFloat# fnmaddFloat# fnmsubFloat# fmaddDouble# fmsubDouble# fnmaddDouble# fnmsubDouble# newArray# readArray# writeArray# sizeofArray#sizeofMutableArray# indexArray#unsafeFreezeArray#unsafeThawArray# copyArray#copyMutableArray# cloneArray#cloneMutableArray# freezeArray# thawArray# casArray#newSmallArray#shrinkSmallMutableArray#readSmallArray#writeSmallArray#sizeofSmallArray#sizeofSmallMutableArray#getSizeofSmallMutableArray#indexSmallArray#unsafeFreezeSmallArray#unsafeThawSmallArray#copySmallArray#copySmallMutableArray#cloneSmallArray#cloneSmallMutableArray#freezeSmallArray#thawSmallArray#casSmallArray# newByteArray#newPinnedByteArray#newAlignedPinnedByteArray#isMutableByteArrayPinned#isByteArrayPinned#byteArrayContents#mutableByteArrayContents#shrinkMutableByteArray#resizeMutableByteArray#unsafeFreezeByteArray#unsafeThawByteArray#sizeofByteArray#sizeofMutableByteArray#getSizeofMutableByteArray#indexCharArray#indexWideCharArray#indexIntArray#indexWordArray#indexAddrArray#indexFloatArray#indexDoubleArray#indexStablePtrArray#indexInt8Array#indexWord8Array#indexInt16Array#indexWord16Array#indexInt32Array#indexWord32Array#indexInt64Array#indexWord64Array#indexWord8ArrayAsChar#indexWord8ArrayAsWideChar#indexWord8ArrayAsInt#indexWord8ArrayAsWord#indexWord8ArrayAsAddr#indexWord8ArrayAsFloat#indexWord8ArrayAsDouble#indexWord8ArrayAsStablePtr#indexWord8ArrayAsInt16#indexWord8ArrayAsWord16#indexWord8ArrayAsInt32#indexWord8ArrayAsWord32#indexWord8ArrayAsInt64#indexWord8ArrayAsWord64#readCharArray#readWideCharArray# readIntArray#readWordArray#readAddrArray#readFloatArray#readDoubleArray#readStablePtrArray#readInt8Array#readWord8Array#readInt16Array#readWord16Array#readInt32Array#readWord32Array#readInt64Array#readWord64Array#readWord8ArrayAsChar#readWord8ArrayAsWideChar#readWord8ArrayAsInt#readWord8ArrayAsWord#readWord8ArrayAsAddr#readWord8ArrayAsFloat#readWord8ArrayAsDouble#readWord8ArrayAsStablePtr#readWord8ArrayAsInt16#readWord8ArrayAsWord16#readWord8ArrayAsInt32#readWord8ArrayAsWord32#readWord8ArrayAsInt64#readWord8ArrayAsWord64#writeCharArray#writeWideCharArray#writeIntArray#writeWordArray#writeAddrArray#writeFloatArray#writeDoubleArray#writeStablePtrArray#writeInt8Array#writeWord8Array#writeInt16Array#writeWord16Array#writeInt32Array#writeWord32Array#writeInt64Array#writeWord64Array#writeWord8ArrayAsChar#writeWord8ArrayAsWideChar#writeWord8ArrayAsInt#writeWord8ArrayAsWord#writeWord8ArrayAsAddr#writeWord8ArrayAsFloat#writeWord8ArrayAsDouble#writeWord8ArrayAsStablePtr#writeWord8ArrayAsInt16#writeWord8ArrayAsWord16#writeWord8ArrayAsInt32#writeWord8ArrayAsWord32#writeWord8ArrayAsInt64#writeWord8ArrayAsWord64#compareByteArrays#copyByteArray#copyMutableByteArray##copyMutableByteArrayNonOverlapping#copyByteArrayToAddr#copyMutableByteArrayToAddr#copyAddrToByteArray#copyAddrToAddr#copyAddrToAddrNonOverlapping# setByteArray# setAddrRange#atomicReadIntArray#atomicWriteIntArray# casIntArray# casInt8Array#casInt16Array#casInt32Array#casInt64Array#fetchAddIntArray#fetchSubIntArray#fetchAndIntArray#fetchNandIntArray#fetchOrIntArray#fetchXorIntArray# plusAddr# minusAddr#remAddr# addr2Int# int2Addr#gtAddr#geAddr#eqAddr#neAddr#ltAddr#leAddr#indexCharOffAddr#indexWideCharOffAddr#indexIntOffAddr#indexWordOffAddr#indexAddrOffAddr#indexFloatOffAddr#indexDoubleOffAddr#indexStablePtrOffAddr#indexInt8OffAddr#indexWord8OffAddr#indexInt16OffAddr#indexWord16OffAddr#indexInt32OffAddr#indexWord32OffAddr#indexInt64OffAddr#indexWord64OffAddr#indexWord8OffAddrAsChar#indexWord8OffAddrAsWideChar#indexWord8OffAddrAsInt#indexWord8OffAddrAsWord#indexWord8OffAddrAsAddr#indexWord8OffAddrAsFloat#indexWord8OffAddrAsDouble#indexWord8OffAddrAsStablePtr#indexWord8OffAddrAsInt16#indexWord8OffAddrAsWord16#indexWord8OffAddrAsInt32#indexWord8OffAddrAsWord32#indexWord8OffAddrAsInt64#indexWord8OffAddrAsWord64#readCharOffAddr#readWideCharOffAddr#readIntOffAddr#readWordOffAddr#readAddrOffAddr#readFloatOffAddr#readDoubleOffAddr#readStablePtrOffAddr#readInt8OffAddr#readWord8OffAddr#readInt16OffAddr#readWord16OffAddr#readInt32OffAddr#readWord32OffAddr#readInt64OffAddr#readWord64OffAddr#readWord8OffAddrAsChar#readWord8OffAddrAsWideChar#readWord8OffAddrAsInt#readWord8OffAddrAsWord#readWord8OffAddrAsAddr#readWord8OffAddrAsFloat#readWord8OffAddrAsDouble#readWord8OffAddrAsStablePtr#readWord8OffAddrAsInt16#readWord8OffAddrAsWord16#readWord8OffAddrAsInt32#readWord8OffAddrAsWord32#readWord8OffAddrAsInt64#readWord8OffAddrAsWord64#writeCharOffAddr#writeWideCharOffAddr#writeIntOffAddr#writeWordOffAddr#writeAddrOffAddr#writeFloatOffAddr#writeDoubleOffAddr#writeStablePtrOffAddr#writeInt8OffAddr#writeWord8OffAddr#writeInt16OffAddr#writeWord16OffAddr#writeInt32OffAddr#writeWord32OffAddr#writeInt64OffAddr#writeWord64OffAddr#writeWord8OffAddrAsChar#writeWord8OffAddrAsWideChar#writeWord8OffAddrAsInt#writeWord8OffAddrAsWord#writeWord8OffAddrAsAddr#writeWord8OffAddrAsFloat#writeWord8OffAddrAsDouble#writeWord8OffAddrAsStablePtr#writeWord8OffAddrAsInt16#writeWord8OffAddrAsWord16#writeWord8OffAddrAsInt32#writeWord8OffAddrAsWord32#writeWord8OffAddrAsInt64#writeWord8OffAddrAsWord64#atomicExchangeAddrAddr#atomicExchangeWordAddr#atomicCasAddrAddr#atomicCasWordAddr#atomicCasWord8Addr#atomicCasWord16Addr#atomicCasWord32Addr#atomicCasWord64Addr#fetchAddWordAddr#fetchSubWordAddr#fetchAndWordAddr#fetchNandWordAddr#fetchOrWordAddr#fetchXorWordAddr#atomicReadWordAddr#atomicWriteWordAddr# newMutVar# readMutVar# writeMutVar#atomicSwapMutVar#atomicModifyMutVar2#atomicModifyMutVar_# casMutVar#catch#raise#raiseUnderflow#raiseOverflow# raiseDivZero#raiseIO#maskAsyncExceptions#maskUninterruptible#unmaskAsyncExceptions#getMaskingState# newPromptTag#prompt# control0# atomically#retry# catchRetry# catchSTM#newTVar# readTVar# readTVarIO# writeTVar#newMVar# takeMVar# tryTakeMVar#putMVar# tryPutMVar# readMVar# tryReadMVar# isEmptyMVar# newIOPort# readIOPort# writeIOPort#delay# waitRead# waitWrite#fork#forkOn# killThread#yield# myThreadId# labelThread#isCurrentThreadBound# noDuplicate# threadLabel# threadStatus# listThreads#mkWeak#mkWeakNoFinalizer#addCFinalizerToWeak# deRefWeak# finalizeWeak#touch#makeStablePtr#deRefStablePtr# eqStablePtr#makeStableName#stableNameToInt# compactNew#compactResize#compactContains#compactContainsAny#compactGetFirstBlock#compactGetNextBlock#compactAllocateBlock#compactFixupPointers# compactAdd#compactAddWithSharing# compactSize#par#spark#seq# getSpark# numSparks# keepAlive#dataToTagSmall#dataToTagLarge# tagToEnum# addrToAny# anyToAddr# mkApUpd0#newBCO#unpackClosure# closureSize#getApStackVal# getCCSOf#getCurrentCCS# clearCCS# whereFrom# traceEvent#traceBinaryEvent# traceMarker#setThreadAllocationCounter#broadcastInt8X16#broadcastInt16X8#broadcastInt32X4#broadcastInt64X2#broadcastInt8X32#broadcastInt16X16#broadcastInt32X8#broadcastInt64X4#broadcastInt8X64#broadcastInt16X32#broadcastInt32X16#broadcastInt64X8#broadcastWord8X16#broadcastWord16X8#broadcastWord32X4#broadcastWord64X2#broadcastWord8X32#broadcastWord16X16#broadcastWord32X8#broadcastWord64X4#broadcastWord8X64#broadcastWord16X32#broadcastWord32X16#broadcastWord64X8#broadcastFloatX4#broadcastDoubleX2#broadcastFloatX8#broadcastDoubleX4#broadcastFloatX16#broadcastDoubleX8# packInt8X16# packInt16X8# packInt32X4# packInt64X2# packInt8X32# packInt16X16# packInt32X8# packInt64X4# packInt8X64# packInt16X32# packInt32X16# packInt64X8# packWord8X16# packWord16X8# packWord32X4# packWord64X2# packWord8X32#packWord16X16# packWord32X8# packWord64X4# packWord8X64#packWord16X32#packWord32X16# packWord64X8# packFloatX4# packDoubleX2# packFloatX8# packDoubleX4# packFloatX16# packDoubleX8#unpackInt8X16#unpackInt16X8#unpackInt32X4#unpackInt64X2#unpackInt8X32#unpackInt16X16#unpackInt32X8#unpackInt64X4#unpackInt8X64#unpackInt16X32#unpackInt32X16#unpackInt64X8#unpackWord8X16#unpackWord16X8#unpackWord32X4#unpackWord64X2#unpackWord8X32#unpackWord16X16#unpackWord32X8#unpackWord64X4#unpackWord8X64#unpackWord16X32#unpackWord32X16#unpackWord64X8#unpackFloatX4#unpackDoubleX2#unpackFloatX8#unpackDoubleX4#unpackFloatX16#unpackDoubleX8#insertInt8X16#insertInt16X8#insertInt32X4#insertInt64X2#insertInt8X32#insertInt16X16#insertInt32X8#insertInt64X4#insertInt8X64#insertInt16X32#insertInt32X16#insertInt64X8#insertWord8X16#insertWord16X8#insertWord32X4#insertWord64X2#insertWord8X32#insertWord16X16#insertWord32X8#insertWord64X4#insertWord8X64#insertWord16X32#insertWord32X16#insertWord64X8#insertFloatX4#insertDoubleX2#insertFloatX8#insertDoubleX4#insertFloatX16#insertDoubleX8# plusInt8X16# plusInt16X8# plusInt32X4# plusInt64X2# plusInt8X32# plusInt16X16# plusInt32X8# plusInt64X4# plusInt8X64# plusInt16X32# plusInt32X16# plusInt64X8# plusWord8X16# plusWord16X8# plusWord32X4# plusWord64X2# plusWord8X32#plusWord16X16# plusWord32X8# plusWord64X4# plusWord8X64#plusWord16X32#plusWord32X16# plusWord64X8# plusFloatX4# plusDoubleX2# plusFloatX8# plusDoubleX4# plusFloatX16# plusDoubleX8# minusInt8X16# minusInt16X8# minusInt32X4# minusInt64X2# minusInt8X32#minusInt16X16# minusInt32X8# minusInt64X4# minusInt8X64#minusInt16X32#minusInt32X16# minusInt64X8#minusWord8X16#minusWord16X8#minusWord32X4#minusWord64X2#minusWord8X32#minusWord16X16#minusWord32X8#minusWord64X4#minusWord8X64#minusWord16X32#minusWord32X16#minusWord64X8# minusFloatX4#minusDoubleX2# minusFloatX8#minusDoubleX4#minusFloatX16#minusDoubleX8# timesInt8X16# timesInt16X8# timesInt32X4# timesInt64X2# timesInt8X32#timesInt16X16# timesInt32X8# timesInt64X4# timesInt8X64#timesInt16X32#timesInt32X16# timesInt64X8#timesWord8X16#timesWord16X8#timesWord32X4#timesWord64X2#timesWord8X32#timesWord16X16#timesWord32X8#timesWord64X4#timesWord8X64#timesWord16X32#timesWord32X16#timesWord64X8# timesFloatX4#timesDoubleX2# timesFloatX8#timesDoubleX4#timesFloatX16#timesDoubleX8#divideFloatX4#divideDoubleX2#divideFloatX8#divideDoubleX4#divideFloatX16#divideDoubleX8# quotInt8X16# quotInt16X8# quotInt32X4# quotInt64X2# quotInt8X32# quotInt16X16# quotInt32X8# quotInt64X4# quotInt8X64# quotInt16X32# quotInt32X16# quotInt64X8# quotWord8X16# quotWord16X8# quotWord32X4# quotWord64X2# quotWord8X32#quotWord16X16# quotWord32X8# quotWord64X4# quotWord8X64#quotWord16X32#quotWord32X16# quotWord64X8# remInt8X16# remInt16X8# remInt32X4# remInt64X2# remInt8X32# remInt16X16# remInt32X8# remInt64X4# remInt8X64# remInt16X32# remInt32X16# remInt64X8# remWord8X16# remWord16X8# remWord32X4# remWord64X2# remWord8X32# remWord16X16# remWord32X8# remWord64X4# remWord8X64# remWord16X32# remWord32X16# remWord64X8#negateInt8X16#negateInt16X8#negateInt32X4#negateInt64X2#negateInt8X32#negateInt16X16#negateInt32X8#negateInt64X4#negateInt8X64#negateInt16X32#negateInt32X16#negateInt64X8#negateFloatX4#negateDoubleX2#negateFloatX8#negateDoubleX4#negateFloatX16#negateDoubleX8#indexInt8X16Array#indexInt16X8Array#indexInt32X4Array#indexInt64X2Array#indexInt8X32Array#indexInt16X16Array#indexInt32X8Array#indexInt64X4Array#indexInt8X64Array#indexInt16X32Array#indexInt32X16Array#indexInt64X8Array#indexWord8X16Array#indexWord16X8Array#indexWord32X4Array#indexWord64X2Array#indexWord8X32Array#indexWord16X16Array#indexWord32X8Array#indexWord64X4Array#indexWord8X64Array#indexWord16X32Array#indexWord32X16Array#indexWord64X8Array#indexFloatX4Array#indexDoubleX2Array#indexFloatX8Array#indexDoubleX4Array#indexFloatX16Array#indexDoubleX8Array#readInt8X16Array#readInt16X8Array#readInt32X4Array#readInt64X2Array#readInt8X32Array#readInt16X16Array#readInt32X8Array#readInt64X4Array#readInt8X64Array#readInt16X32Array#readInt32X16Array#readInt64X8Array#readWord8X16Array#readWord16X8Array#readWord32X4Array#readWord64X2Array#readWord8X32Array#readWord16X16Array#readWord32X8Array#readWord64X4Array#readWord8X64Array#readWord16X32Array#readWord32X16Array#readWord64X8Array#readFloatX4Array#readDoubleX2Array#readFloatX8Array#readDoubleX4Array#readFloatX16Array#readDoubleX8Array#writeInt8X16Array#writeInt16X8Array#writeInt32X4Array#writeInt64X2Array#writeInt8X32Array#writeInt16X16Array#writeInt32X8Array#writeInt64X4Array#writeInt8X64Array#writeInt16X32Array#writeInt32X16Array#writeInt64X8Array#writeWord8X16Array#writeWord16X8Array#writeWord32X4Array#writeWord64X2Array#writeWord8X32Array#writeWord16X16Array#writeWord32X8Array#writeWord64X4Array#writeWord8X64Array#writeWord16X32Array#writeWord32X16Array#writeWord64X8Array#writeFloatX4Array#writeDoubleX2Array#writeFloatX8Array#writeDoubleX4Array#writeFloatX16Array#writeDoubleX8Array#indexInt8X16OffAddr#indexInt16X8OffAddr#indexInt32X4OffAddr#indexInt64X2OffAddr#indexInt8X32OffAddr#indexInt16X16OffAddr#indexInt32X8OffAddr#indexInt64X4OffAddr#indexInt8X64OffAddr#indexInt16X32OffAddr#indexInt32X16OffAddr#indexInt64X8OffAddr#indexWord8X16OffAddr#indexWord16X8OffAddr#indexWord32X4OffAddr#indexWord64X2OffAddr#indexWord8X32OffAddr#indexWord16X16OffAddr#indexWord32X8OffAddr#indexWord64X4OffAddr#indexWord8X64OffAddr#indexWord16X32OffAddr#indexWord32X16OffAddr#indexWord64X8OffAddr#indexFloatX4OffAddr#indexDoubleX2OffAddr#indexFloatX8OffAddr#indexDoubleX4OffAddr#indexFloatX16OffAddr#indexDoubleX8OffAddr#readInt8X16OffAddr#readInt16X8OffAddr#readInt32X4OffAddr#readInt64X2OffAddr#readInt8X32OffAddr#readInt16X16OffAddr#readInt32X8OffAddr#readInt64X4OffAddr#readInt8X64OffAddr#readInt16X32OffAddr#readInt32X16OffAddr#readInt64X8OffAddr#readWord8X16OffAddr#readWord16X8OffAddr#readWord32X4OffAddr#readWord64X2OffAddr#readWord8X32OffAddr#readWord16X16OffAddr#readWord32X8OffAddr#readWord64X4OffAddr#readWord8X64OffAddr#readWord16X32OffAddr#readWord32X16OffAddr#readWord64X8OffAddr#readFloatX4OffAddr#readDoubleX2OffAddr#readFloatX8OffAddr#readDoubleX4OffAddr#readFloatX16OffAddr#readDoubleX8OffAddr#writeInt8X16OffAddr#writeInt16X8OffAddr#writeInt32X4OffAddr#writeInt64X2OffAddr#writeInt8X32OffAddr#writeInt16X16OffAddr#writeInt32X8OffAddr#writeInt64X4OffAddr#writeInt8X64OffAddr#writeInt16X32OffAddr#writeInt32X16OffAddr#writeInt64X8OffAddr#writeWord8X16OffAddr#writeWord16X8OffAddr#writeWord32X4OffAddr#writeWord64X2OffAddr#writeWord8X32OffAddr#writeWord16X16OffAddr#writeWord32X8OffAddr#writeWord64X4OffAddr#writeWord8X64OffAddr#writeWord16X32OffAddr#writeWord32X16OffAddr#writeWord64X8OffAddr#writeFloatX4OffAddr#writeDoubleX2OffAddr#writeFloatX8OffAddr#writeDoubleX4OffAddr#writeFloatX16OffAddr#writeDoubleX8OffAddr#indexInt8ArrayAsInt8X16#indexInt16ArrayAsInt16X8#indexInt32ArrayAsInt32X4#indexInt64ArrayAsInt64X2#indexInt8ArrayAsInt8X32#indexInt16ArrayAsInt16X16#indexInt32ArrayAsInt32X8#indexInt64ArrayAsInt64X4#indexInt8ArrayAsInt8X64#indexInt16ArrayAsInt16X32#indexInt32ArrayAsInt32X16#indexInt64ArrayAsInt64X8#indexWord8ArrayAsWord8X16#indexWord16ArrayAsWord16X8#indexWord32ArrayAsWord32X4#indexWord64ArrayAsWord64X2#indexWord8ArrayAsWord8X32#indexWord16ArrayAsWord16X16#indexWord32ArrayAsWord32X8#indexWord64ArrayAsWord64X4#indexWord8ArrayAsWord8X64#indexWord16ArrayAsWord16X32#indexWord32ArrayAsWord32X16#indexWord64ArrayAsWord64X8#indexFloatArrayAsFloatX4#indexDoubleArrayAsDoubleX2#indexFloatArrayAsFloatX8#indexDoubleArrayAsDoubleX4#indexFloatArrayAsFloatX16#indexDoubleArrayAsDoubleX8#readInt8ArrayAsInt8X16#readInt16ArrayAsInt16X8#readInt32ArrayAsInt32X4#readInt64ArrayAsInt64X2#readInt8ArrayAsInt8X32#readInt16ArrayAsInt16X16#readInt32ArrayAsInt32X8#readInt64ArrayAsInt64X4#readInt8ArrayAsInt8X64#readInt16ArrayAsInt16X32#readInt32ArrayAsInt32X16#readInt64ArrayAsInt64X8#readWord8ArrayAsWord8X16#readWord16ArrayAsWord16X8#readWord32ArrayAsWord32X4#readWord64ArrayAsWord64X2#readWord8ArrayAsWord8X32#readWord16ArrayAsWord16X16#readWord32ArrayAsWord32X8#readWord64ArrayAsWord64X4#readWord8ArrayAsWord8X64#readWord16ArrayAsWord16X32#readWord32ArrayAsWord32X16#readWord64ArrayAsWord64X8#readFloatArrayAsFloatX4#readDoubleArrayAsDoubleX2#readFloatArrayAsFloatX8#readDoubleArrayAsDoubleX4#readFloatArrayAsFloatX16#readDoubleArrayAsDoubleX8#writeInt8ArrayAsInt8X16#writeInt16ArrayAsInt16X8#writeInt32ArrayAsInt32X4#writeInt64ArrayAsInt64X2#writeInt8ArrayAsInt8X32#writeInt16ArrayAsInt16X16#writeInt32ArrayAsInt32X8#writeInt64ArrayAsInt64X4#writeInt8ArrayAsInt8X64#writeInt16ArrayAsInt16X32#writeInt32ArrayAsInt32X16#writeInt64ArrayAsInt64X8#writeWord8ArrayAsWord8X16#writeWord16ArrayAsWord16X8#writeWord32ArrayAsWord32X4#writeWord64ArrayAsWord64X2#writeWord8ArrayAsWord8X32#writeWord16ArrayAsWord16X16#writeWord32ArrayAsWord32X8#writeWord64ArrayAsWord64X4#writeWord8ArrayAsWord8X64#writeWord16ArrayAsWord16X32#writeWord32ArrayAsWord32X16#writeWord64ArrayAsWord64X8#writeFloatArrayAsFloatX4#writeDoubleArrayAsDoubleX2#writeFloatArrayAsFloatX8#writeDoubleArrayAsDoubleX4#writeFloatArrayAsFloatX16#writeDoubleArrayAsDoubleX8#indexInt8OffAddrAsInt8X16#indexInt16OffAddrAsInt16X8#indexInt32OffAddrAsInt32X4#indexInt64OffAddrAsInt64X2#indexInt8OffAddrAsInt8X32#indexInt16OffAddrAsInt16X16#indexInt32OffAddrAsInt32X8#indexInt64OffAddrAsInt64X4#indexInt8OffAddrAsInt8X64#indexInt16OffAddrAsInt16X32#indexInt32OffAddrAsInt32X16#indexInt64OffAddrAsInt64X8#indexWord8OffAddrAsWord8X16#indexWord16OffAddrAsWord16X8#indexWord32OffAddrAsWord32X4#indexWord64OffAddrAsWord64X2#indexWord8OffAddrAsWord8X32#indexWord16OffAddrAsWord16X16#indexWord32OffAddrAsWord32X8#indexWord64OffAddrAsWord64X4#indexWord8OffAddrAsWord8X64#indexWord16OffAddrAsWord16X32#indexWord32OffAddrAsWord32X16#indexWord64OffAddrAsWord64X8#indexFloatOffAddrAsFloatX4#indexDoubleOffAddrAsDoubleX2#indexFloatOffAddrAsFloatX8#indexDoubleOffAddrAsDoubleX4#indexFloatOffAddrAsFloatX16#indexDoubleOffAddrAsDoubleX8#readInt8OffAddrAsInt8X16#readInt16OffAddrAsInt16X8#readInt32OffAddrAsInt32X4#readInt64OffAddrAsInt64X2#readInt8OffAddrAsInt8X32#readInt16OffAddrAsInt16X16#readInt32OffAddrAsInt32X8#readInt64OffAddrAsInt64X4#readInt8OffAddrAsInt8X64#readInt16OffAddrAsInt16X32#readInt32OffAddrAsInt32X16#readInt64OffAddrAsInt64X8#readWord8OffAddrAsWord8X16#readWord16OffAddrAsWord16X8#readWord32OffAddrAsWord32X4#readWord64OffAddrAsWord64X2#readWord8OffAddrAsWord8X32#readWord16OffAddrAsWord16X16#readWord32OffAddrAsWord32X8#readWord64OffAddrAsWord64X4#readWord8OffAddrAsWord8X64#readWord16OffAddrAsWord16X32#readWord32OffAddrAsWord32X16#readWord64OffAddrAsWord64X8#readFloatOffAddrAsFloatX4#readDoubleOffAddrAsDoubleX2#readFloatOffAddrAsFloatX8#readDoubleOffAddrAsDoubleX4#readFloatOffAddrAsFloatX16#readDoubleOffAddrAsDoubleX8#writeInt8OffAddrAsInt8X16#writeInt16OffAddrAsInt16X8#writeInt32OffAddrAsInt32X4#writeInt64OffAddrAsInt64X2#writeInt8OffAddrAsInt8X32#writeInt16OffAddrAsInt16X16#writeInt32OffAddrAsInt32X8#writeInt64OffAddrAsInt64X4#writeInt8OffAddrAsInt8X64#writeInt16OffAddrAsInt16X32#writeInt32OffAddrAsInt32X16#writeInt64OffAddrAsInt64X8#writeWord8OffAddrAsWord8X16#writeWord16OffAddrAsWord16X8#writeWord32OffAddrAsWord32X4#writeWord64OffAddrAsWord64X2#writeWord8OffAddrAsWord8X32#writeWord16OffAddrAsWord16X16#writeWord32OffAddrAsWord32X8#writeWord64OffAddrAsWord64X4#writeWord8OffAddrAsWord8X64#writeWord16OffAddrAsWord16X32#writeWord32OffAddrAsWord32X16#writeWord64OffAddrAsWord64X8#writeFloatOffAddrAsFloatX4#writeDoubleOffAddrAsDoubleX2#writeFloatOffAddrAsFloatX8#writeDoubleOffAddrAsDoubleX4#writeFloatOffAddrAsFloatX16#writeDoubleOffAddrAsDoubleX8#prefetchByteArray3#prefetchMutableByteArray3#prefetchAddr3#prefetchValue3#prefetchByteArray2#prefetchMutableByteArray2#prefetchAddr2#prefetchValue2#prefetchByteArray1#prefetchMutableByteArray1#prefetchAddr1#prefetchValue1#prefetchByteArray0#prefetchMutableByteArray0#prefetchAddr0#prefetchValue0#WordBox MkWordBoxIntBoxMkIntBoxFloatBox MkFloatBox DoubleBox MkDoubleBoxDictBox MkDictBoxCUnitCSoloCTuple2CTuple3CTuple4CTuple5CTuple6CTuple7CTuple8CTuple9CTuple10CTuple11CTuple12CTuple13CTuple14CTuple15CTuple16CTuple17CTuple18CTuple19CTuple20CTuple21CTuple22CTuple23CTuple24CTuple25CTuple26CTuple27CTuple28CTuple29CTuple30CTuple31CTuple32CTuple33CTuple34CTuple35CTuple36CTuple37CTuple38CTuple39CTuple40CTuple41CTuple42CTuple43CTuple44CTuple45CTuple46CTuple47CTuple48CTuple49CTuple50CTuple51CTuple52CTuple53CTuple54CTuple55CTuple56CTuple57CTuple58CTuple59CTuple60CTuple61CTuple62CTuple63CTuple64Tuple1#Tuple0#KindBndrVoid#SPEC2MultMulisTrue#Tuple1Tuple0getSoloreallyUnsafePtrEqualityunsafePtrEquality# sameArray#sameMutableArray#sameSmallArray#sameSmallMutableArray#sameByteArray#sameMutableByteArray# sameMutVar# sameTVar# sameMVar# sameIOPort#samePromptTag# eqStableName#getThreadAllocationCounter# raiseOverflowraiseUnderflow raiseDivZerowithDict dataToTag# panicErrordebugLn debugErrLn unpackNBytes#CTuple1CTuple0compare<<=>maxmin/=ipeqWordneWordeqCharneChareqFloateqDoubleeqIntneIntgtIntgeIntltIntleInt compareInt compareInt#gtWordgeWordltWordleWord compareWord compareWord#&&||notdivInt8# divInt16# divInt32#modInt8# modInt16# modInt32# divModInt# divModInt8# divModInt16# divModInt32# $fEqTyCon$fEqInt $fEqDouble $fEqFloat$fEqChar$fEqWord $fEqTrName$fEqList $fOrdWord$fOrdInt $fOrdDouble $fOrdFloat $fOrdChar $fOrdList $fOrdTyCon$fCUnit$fCSoloa $fCTuple2c1c2$fCTuple3c1c2c3$fCTuple4c1c2c3c4$fCTuple5c1c2c3c4c5$fCTuple6c1c2c3c4c5c6$fCTuple7c1c2c3c4c5c6c7$fCTuple8c1c2c3c4c5c6c7c8$fCTuple9c1c2c3c4c5c6c7c8c9$fCTuple10c1c2c3c4c5c6c7c8c9c10"$fCTuple11c1c2c3c4c5c6c7c8c9c10c11%$fCTuple12c1c2c3c4c5c6c7c8c9c10c11c12($fCTuple13c1c2c3c4c5c6c7c8c9c10c11c12c13+$fCTuple14c1c2c3c4c5c6c7c8c9c10c11c12c13c14.$fCTuple15c1c2c3c4c5c6c7c8c9c10c11c12c13c14c151$fCTuple16c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c164$fCTuple17c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c177$fCTuple18c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18:$fCTuple19c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19=$fCTuple20c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20$fCTuple21c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21$fCTuple22c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22$fCTuple23c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23$fCTuple24c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24$fCTuple25c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25$fCTuple26c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26$fCTuple27c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27$fCTuple28c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28$fCTuple29c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29$fCTuple30c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30$fCTuple31c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31$fCTuple32c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32$fCTuple33c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33$fCTuple34c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34$fCTuple35c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35$fCTuple36c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36$fCTuple37c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37$fCTuple38c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38$fCTuple39c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39$fCTuple40c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40$fCTuple41c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41$fCTuple42c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41c42$fCTuple43c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41c42c43$fCTuple44c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41c42c43c44$fCTuple45c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41c42c43c44c45$fCTuple46c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41c42c43c44c45c46$fCTuple47c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41c42c43c44c45c46c47$fCTuple48c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41c42c43c44c45c46c47c48$fCTuple49c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41c42c43c44c45c46c47c48c49$fCTuple50c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41c42c43c44c45c46c47c48c49c50$fCTuple51c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41c42c43c44c45c46c47c48c49c50c51$fCTuple52c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41c42c43c44c45c46c47c48c49c50c51c52$fCTuple53c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41c42c43c44c45c46c47c48c49c50c51c52c53$fCTuple54c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41c42c43c44c45c46c47c48c49c50c51c52c53c54$fCTuple55c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41c42c43c44c45c46c47c48c49c50c51c52c53c54c55$fCTuple56c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41c42c43c44c45c46c47c48c49c50c51c52c53c54c55c56$fCTuple57c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41c42c43c44c45c46c47c48c49c50c51c52c53c54c55c56c57$fCTuple58c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41c42c43c44c45c46c47c48c49c50c51c52c53c54c55c56c57c58$fCTuple59c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41c42c43c44c45c46c47c48c49c50c51c52c53c54c55c56c57c58c59$fCTuple60c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41c42c43c44c45c46c47c48c49c50c51c52c53c54c55c56c57c58c59c60$fCTuple61c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41c42c43c44c45c46c47c48c49c50c51c52c53c54c55c56c57c58c59c60c61$fCTuple62c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41c42c43c44c45c46c47c48c49c50c51c52c53c54c55c56c57c58c59c60c61c62$fCTuple63c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41c42c43c44c45c46c47c48c49c50c51c52c53c54c55c56c57c58c59c60c61c62c63$fCTuple64c1c2c3c4c5c6c7c8c9c10c11c12c13c14c15c16c17c18c19c20c21c22c23c24c25c26c27c28c29c30c31c32c33c34c35c36c37c38c39c40c41c42c43c44c45c46c47c48c49c50c51c52c53c54c55c56c57c58c59c60c61c62c63c64 $fOrdOrdering $fOrdBool $fOrdTuple15 $fOrdTuple14 $fOrdTuple13 $fOrdTuple12 $fOrdTuple11 $fOrdTuple10 $fOrdTuple9 $fOrdTuple8 $fOrdTuple7 $fOrdTuple6 $fOrdTuple5 $fOrdTuple4 $fOrdTuple3 $fOrdTuple2 $fOrdSolo $fOrdUnit $fEqOrdering$fEqBool $fEqModule $fEqTuple15 $fEqTuple14 $fEqTuple13 $fEqTuple12 $fEqTuple11 $fEqTuple10 $fEqTuple9 $fEqTuple8 $fEqTuple7 $fEqTuple6 $fEqTuple5 $fEqTuple4 $fEqTuple3 $fEqTuple2$fEqSolo$fEqUnitSum2#Sum3#Sum4#Sum5#Sum6#Sum7#Sum8#Sum9#Sum10#Sum11#Sum12#Sum13#Sum14#Sum15#Sum16#Sum17#Sum18#Sum19#Sum20#Sum21#Sum22#Sum23#Sum24#Sum25#Sum26#Sum27#Sum28#Sum29#Sum30#Sum31#Sum32#Sum33#Sum34#Sum35#Sum36#Sum37#Sum38#Sum39#Sum40#Sum41#Sum42#Sum43#Sum44#Sum45#Sum46#Sum47#Sum48#Sum49#Sum50#Sum51#Sum52#Sum53#Sum54#Sum55#Sum56#Sum57#Sum58#Sum59#Sum60#Sum61#Sum62#Sum63#->unpackUtf8Char#