Hoogle Search

Within LTS Haskell 24.63 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. getAllSysAttrs :: IOStateArrow s b Attributes

    hxt Text.XML.HXT.Arrow.XmlState.TypeDefs

    read all attributes from global state

  2. stringAll :: Eq a => [a] -> [a] -> [Int]

    hxt Text.XML.HXT.DOM.Util

    find all positions where a string occurs within another string

  3. naturalLog10 :: Natural -> Int

    integer-logarithms Math.NumberTheory.Logarithms

    Calculate the integer logarithm of an Integer to base 10. The argument must be not zero, otherwise an error is thrown.

  4. naturalLog2 :: Natural -> Int

    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.

  5. naturalLogBase :: Natural -> Natural -> Int

    integer-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.

  6. integralLaws :: (Integral a, Arbitrary a, Show a) => Proxy a -> Laws

    quickcheck-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)

  7. liftCallCC :: CallCC m (Either e a) (Either e b) -> CallCC (ExceptT e m) a b

    selective Control.Selective.Trans.Except

    No documentation available.

  8. delAllLEdge :: (DynGraph gr, Eq b) => LEdge b -> gr a b -> gr a b

    fgl Data.Graph.Inductive.Graph

    Remove all edges equal to the one specified.

  9. mergeAll :: Ord a => [Heap a b] -> Heap a b

    fgl Data.Graph.Inductive.Internal.Heap

    No documentation available.

  10. ExplicitForAll :: Extension

    ghc-boot-th GHC.LanguageExtensions.Type

    No documentation available.

Page 425 of many | Previous | Next