Îõ³h,Á4     1.0.4(c) 2011 Daniel FischerMIT1Daniel Fischer  ProvisionalNon-portable (GHC extensions) TrustworthyÌ(c) 2011 Daniel FischerMIT1Daniel Fischer  ProvisionalNon-portable (GHC extensions) TrustworthyÌ £ÏCalculate the integer logarithm for an arbitrary base. The base must be greater than 1, the second argument, the number whose logarithm is sought, must be positive, otherwise an error is thrown. If  base == 2Û, the specialised version is called, which is more efficient than the general algorithm. Satisfies: Æbase ^ integerLogBase base m <= m < base ^ (integerLogBase base m + 1)for base > 1 and m > 0.&Calculate the integer logarithm of an Ë to base 2. The argument must be positive, otherwise an error is thrown.ÎCacluate the integer logarithm for an arbitrary base. The base must be greater than 1, the second argument, the number whose logarithm is sought, must be positive, otherwise an error is thrown. If  base == 2Û, the specialised version is called, which is more efficient than the general algorithm. Satisfies: Æbase ^ integerLogBase base m <= m < base ^ (integerLogBase base m + 1)for base > 1 and m > 0.&Calculate the natural logarithm of an Ë to base 2. The argument must be non-zero, otherwise an error is thrown.&Calculate the integer logarithm of an Ë to base 2. The argument must be positive, otherwise an error is thrown.%Calculate the integer logarithm of a Ë to base 2. The argument must be positive, otherwise an error is thrown. Same as Ô, but without checks, saves a little time when called often for known good input.Same as Ô, but without checks, saves a little time when called often for known good input. Same as Ô, but without checks, saves a little time when called often for known good input. Same as Ô, but without checks, saves a little time when called often for known good input. &Calculate the integer logarithm of an Ì to base 10. The argument must be positive, otherwise an error is thrown. &Calculate the integer logarithm of an Ì to base 10. The argument must be not zero, otherwise an error is thrown.Same as  ð, but without a check for a positive argument. Saves a little time when called often for known good input.Same as  ð, but without a check for a positive argument. Saves a little time when called often for known good input.Same as Ô, but without checks, saves a little time when called often for known good input.Same as Ô, but without checks, saves a little time when called often for known good input.         (c) 2011-2014 Daniel FischerMIT1Daniel Fischer  ProvisionalNon-portable (GHC extensions)Safer Power of an ¯ by the left-to-right repeated squaring algorithm. This needs two multiplications in each step while the right-to-left algorithm needs only one multiplication for 0-bits, but here the two factors always have approximately the same size, which on average gains a bit when the result is large.8For small results, it is unlikely to be any faster than Ç, quite possibly slower (though the difference shouldn't be large), and for exponents with few bits set, the same holds. But for exponents with many bits set, the speedup can be significant.Warning:þ No check for the negativity of the exponent is performed, a negative exponent is interpreted as a large positive exponent.Same as , but for exponents of type .(c) 2011-2014 Daniel FischerMIT1Daniel Fischer  ProvisionalNon-portable (GHC extensions)Safe+ Power of an ¯ by the left-to-right repeated squaring algorithm. This needs two multiplications in each step while the right-to-left algorithm needs only one multiplication for 0-bits, but here the two factors always have approximately the same size, which on average gains a bit when the result is large.8For small results, it is unlikely to be any faster than Ç, quite possibly slower (though the difference shouldn't be large), and for exponents with few bits set, the same holds. But for exponents with many bits set, the speedup can be significant.Warning:þ No check for the negativity of the exponent is performed, a negative exponent is interpreted as a large positive exponent.Same as , but for exponents of type .      !"#!"$%&'()*/integer-logarithms-1.0.4-2842m8yODPzDxSC49txVRsGHC.Integer.Logarithms.CompatMath.NumberTheory.Logarithms Math.NumberTheory.Powers.Integer Math.NumberTheory.Powers.Naturalinteger-logarithms ghc-internalGHC.Internal.Integer.Logarithms wordLog2# integerLog2#integerLogBase#integerLogBase integerLog2naturalLogBase naturalLog2intLog2wordLog2 integerLog2'intLog2' wordLog2' integerLog10 naturalLog10 integerLog10'integerLogBase' integerPowerintegerWordPower naturalPowernaturalWordPower ghc-bignumGHC.Num.IntegerIntegerGHC.Num.NaturalNaturalghc-prim GHC.TypesIntWord naturalLog2' naturalLog10'naturalLogBase'GHC.Internal.Real^