Hoogle Search
Within LTS Haskell 24.51 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
integer-logarithms Math.NumberTheory.Logarithms Calculate the natural logarithm of an Natural to base 2. The argument must be non-zero, otherwise an error is thrown.
naturalLogBase :: Natural -> Natural -> Intinteger-logarithms Math.NumberTheory.Logarithms 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.evaluateEvenPolynomialL :: Num a => a -> [a] -> amath-functions Numeric.Polynomial No documentation available.
evaluateOddPolynomialL :: Num a => a -> [a] -> amath-functions Numeric.Polynomial No documentation available.
evaluatePolynomialL :: Num a => a -> [a] -> amath-functions Numeric.Polynomial No documentation available.
integralLaws :: (Integral a, Arbitrary a, Show a) => Proxy a -> Lawsquickcheck-classes-base Test.QuickCheck.Classes.Base Tests the following properties:
- Quotient Remainder (quot x y) * y + (rem x y) ≡ x
- Division Modulus (div x y) * y + (mod x y) ≡ x
- Integer Roundtrip fromInteger (toInteger x) ≡ x
- QuotRem is (Quot, Rem) quotRem x y ≡ (quot x y, rem x y)
- DivMod is (Div, Mod) divMod x y ≡ (div x y, mod x y)
liftCallCC :: CallCC m (Either e a) (Either e b) -> CallCC (ExceptT e m) a bselective Control.Selective.Trans.Except No documentation available.
delAllLEdge :: (DynGraph gr, Eq b) => LEdge b -> gr a b -> gr a bfgl Data.Graph.Inductive.Graph Remove all edges equal to the one specified.
mergeAll :: Ord a => [Heap a b] -> Heap a bfgl Data.Graph.Inductive.Internal.Heap No documentation available.
-
ghc-boot-th GHC.LanguageExtensions.Type No documentation available.