Îõ³h))ë'ÜÉ      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGH0.3 Safe-Inferred(1Úäë'0>I kind-integer'J if the distance between a and b is less than 0.5. kind-integerThis should be exported by  Data.Type.Ord. kind-integerThis should be exported by  Data.Type.Ord. kind-integerThis should be exported by  Data.Type.Ord. kind-integerThis should be exported by  Data.Type.Ord. kind-integerRound up towards positive infinity. kind-integerRound down+ towards negative infinity. Also known as Prelude's K'. This is the type of rounding used by Prelude's L, M, N, O, P. kind-integerRound towards zero. Also known as Prelude's Q(. This is the type of rounding used by Prelude's R, S, T. kind-integerRound away from zero.  kind-integer&Round towards the closest integer. If half!way between two integers, round up towards positive infinity.  kind-integer&Round towards the closest integer. If half!way between two integers, round down towards negative infinity.  kind-integer&Round towards the closest integer. If half)way between two integers, round towards zero.  kind-integer&Round towards the closest integer. If half!way between two integers, round away from zero.  kind-integer&Round towards the closest integer. If half5way between two integers, round towards the closest even integer. Also known as Prelude's U. kind-integer&Round towards the closest integer. If half5way between two integers, round towards the closest odd integer.V kind-integer9An internal data type that is only used for defining the  pattern synonym. kind-integer Singleton type for a type-level ' i. kind-integerComparison of type-level 's, as a function.W kind-integer$Least Common Multiple of type-level Xs a and b. kind-integer$Least Common Multiple of type-level ' numbers a and b. Returns a X5, since the Least Common Multiple is always positive.Y kind-integer&Greatest Common Divisor of type-level Xs a and b. kind-integer&Greatest Common Divisor of type-level ' numbers a and b. Returns a X7, since the Greatest Common Divisor is always positive. kind-integer Log base 2 (Ked) of type-level 's. Logarithm of zero doesn't type-check.0Logarithm of negative number doesn't type-check. kind-integerDivide of type-level ' a by b, using the specified ing r. Division by zero doesn't type-check. kind-integer%ainder of the division of type-level ' a by b, using the specified ing r.  forall (r :: ) (a :: ') (b :: '). (b  0) =>  r a b  a  b   r a b  Division by zero doesn't type-check. kind-integerGet both the quotient and the ainder of the ision of type-level 's a and b using the specified ing r.  forall (r :: ) (a :: ') (b :: '). (b  0) =>  r a b  '( r a b,  r a b)  kind-integerSubtraction of type-level 's. kind-integerExponentiation of type-level 's.Exponentiation by negative ' doesn't type-check. kind-integerMultiplication of type-level 's. kind-integerAddition of type-level 's. kind-integerAbsolute value of a type-level ', as a type-level X. kind-integerSign of type-level 's.& 0 if zero.& 1 if positive.% 1 if negative. kind-integerNegation of type-level 's. kind-integerWhether a type-level X is even. Zero is considered even. kind-integerWhether a type-level X is odd. Zero is not considered odd.Z kind-integer Construct a  d %egative type-level '.=To be used for producing all negative outputs in this module.  kind-integer Make sure zero is represented as & 0 , not as % 0!Notice that all the tools in the  KindInteger can readily handle non- d inputs. This  Ô type-family is offered offered only as a convenience in case you want to simplify your dealing with zeros.! kind-integer(This type represents unknown type-level '.# kind-integer÷This class gives the integer associated with a type-level integer. There are instances of the class for every integer.% kind-integerA negative number -x is represented as % x.Zero can be represented as % 0 (but often isn't, see notes at ').& kind-integerA positive number +x is represented as & x.Zero can be represented as & 0 (see notes at ').' kind-integerType-level version of [, only ever used as a kind for & and %A positive number +x is represented as & x.A negative number -x is represented as % x.Zero can be represented as & 0 or % 0. For consistency, all zero$ outputs from type families in this  KindInteger module use the & 0Ó, but don't assume that this will be the case elsewhere. So, if you need to treat zero: specially in some situation, be sure to handle both the & 0 and % 0 cases.NB: '= is mostly used as a kind, with its types constructed using & and %Í. However, it might also be used as type, with its terms constructed using + . One reason why you may want a 'Ô at the term-level is so that you embed it in larger data-types (for example, the  KindRational module from the  1https://hackage.haskell.org/package/kind-rational kind-rational library embeds this  in its  type)( kind-integer7A explicitly bidirectional pattern synonym relating an  to a # constraint.As an  expression: Constructs an explicit  i value from an implicit # i constraint:  @i :: # i =>  i As a pattern: Matches on an explicit  i value bringing an implicit # i constraint into scope: f :: 0 i -> .. f SInteger = {- SInteger i in scope -} ) kind-integer Shows the '+ as it appears literally at the type-level.This is different from normal \ for '$, which shows the term-level value. ] 0 (+ 8) "z" == "8z" ) 0 (+ 8) "z" == "P 8z" * kind-integerConvert a term-level  KindInteger ' into a term-level Prelude [. + . * == ^ * . + == ^ + kind-integerObtain a term-level  KindInteger ' from a term-level Prelude [. This can fail if the Prelude [É is infinite, or if it is so big that it would exhaust system resources. + . * == ^ * . + == ^ .This function can be handy if you are passing  KindInteger's '0 around for some reason. But, other than this,  KindInteger; doesn't offer any tool to deal with the internals of its '., kind-integer Term-level [" representation of the type-level ' i.- kind-integerConvert a term-level [ into an unknown type-level '.. kind-integerÕWe either get evidence that this function was instantiated with the same type-level 's, or _./ kind-integerLike ., but if the type-level '5s aren't equal, this additionally provides proof of ` or a.b kind-integer8An internal function that is only used for defining the  pattern synonym.0 kind-integerReturn the term-level [ number corresponding to i in a  i value.1 kind-integerConvert an explicit  i value into an implicit # i constraint.2 kind-integer Convert a [ number into an  n value, where n is a fresh type-level '.3 kind-integerDivide a by a using the specified ing. Return the quotient q. See 5.4 kind-integerDivide a by a using the specified ing. Return the remainder m. See 5.5 kind-integerDivide a by a using the specified ing. Return the quotient q and the remainder m.  forall (r :: ) (a :: [) (b :: [). (b c 0) => case 5 r a b of (q, m) -> m d a e b f q 6 kind-integerSame as Prelude [.7 kind-integerSame as Prelude [.g kind-integer Data.Type.Ord support for type-level 's.= kind-integerNegative numbers and zero.> kind-integerPositive numbers and zero.3 kind-integer Dividend a. kind-integerDivisor b. kind-integer Quotient q.4 kind-integer Dividend a. kind-integerDivisor b. kind-integer Remainder m.5 kind-integer Dividend a. kind-integerDivisor b. kind-integer Quotient q and remainder m.h kind-integer:Negative -> divRem RoundDown -> divRem RoundDown -> Result kind-integerDividend kind-integerDivisor6'&% *+)#$,!"-.(021  345/6'&% *+)#$,!"-.(021  345/ 4444776876é      !"#$%&'(()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSQR7QRTQRUQVQVWQRXQRYQR8QRZQR[\]^_`ab^cQdeQdfQghQijNOkNOlmNnNn QoQo pqòkind-integer-0.3-inplace KindInteger kind-integerIInteger KindRationalRational/=/=?====?RoundRoundUp RoundDown RoundZero RoundAway RoundHalfUp RoundHalfDown RoundHalfZero RoundHalfAway RoundHalfEven RoundHalfOddSInteger CmpIntegerLCMGCDLog2DivRemDivRem-^*+AbsSignNegateEvenOdd Normalize SomeInteger KnownInteger integerSingNPshowsPrecTypeLit toPrelude fromPrelude integerValsomeIntegerVal sameInteger cmpInteger fromSIntegerwithKnownIntegerwithSomeSIntegerdivremdivRem $fReadInteger $fShowInteger $fOrdInteger $fEqInteger$fTestCoercionIntegerSInteger$fTestEqualityIntegerSInteger$fShowSInteger$fKnownIntegerN_$fKnownIntegerP_$fReadSomeInteger$fShowSomeInteger$fOrdSomeInteger$fEqSomeInteger $fEqRound $fOrdRound $fShowRound $fReadRound $fEnumRound$fBoundedRoundHalfLTghc-prim GHC.TypesTruebaseGHC.RealfloormoddivMod GHC.TypeNatsModtruncatequotquotRemroundKnownIntegeregerInstanceNatLCM ghc-bignumGHC.Num.NaturalNaturalNatGCDNNGHC.Num.IntegerGHC.ShowshowshowsGHC.Baseid GHC.MaybeNothingLTGTknownIntegerInstance GHC.ClassesGHC.NumD:R:CompareIntegerab _divRemHalf