Hoogle Search

Within LTS Haskell 24.67 (ghc-9.10.3)

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

  1. pcallTrace :: NumArgs -> NumResults -> LuaE e Status

    hslua-core HsLua.Core.Trace

    Like pcall, but sets an appropriate message handler function, thereby adding a stack traceback if an error occurs.

  2. gallopingSearchLeftP :: (PrimMonad m, MVector v e) => (e -> Bool) -> v (PrimState m) e -> m Int

    vector-algorithms Data.Vector.Algorithms.Search

    Given a predicate that is guaranteed to be monotone on the vector elements in order, finds the index at which the predicate turns from False to True. The length of the vector is returned if the predicate is False for the entire vector. Begins searching at the start of the vector, in increasing steps of size 2^n.

  3. gallopingSearchLeftPBounds :: (PrimMonad m, MVector v e) => (e -> Bool) -> v (PrimState m) e -> Int -> Int -> m Int

    vector-algorithms Data.Vector.Algorithms.Search

    Given a predicate that is guaranteed to be monotone on the indices [l,u) in a given vector, finds the index in [l,u] at which the predicate turns from False to True (yielding u if the entire interval is False). Begins searching at l, going right in increasing (2^n)-steps.

  4. gallopingSearchRightP :: (PrimMonad m, MVector v e) => (e -> Bool) -> v (PrimState m) e -> m Int

    vector-algorithms Data.Vector.Algorithms.Search

    Given a predicate that is guaranteed to be monotone on the vector elements in order, finds the index at which the predicate turns from False to True. The length of the vector is returned if the predicate is False for the entire vector. Begins searching at the end of the vector, in increasing steps of size 2^n.

  5. gallopingSearchRightPBounds :: (PrimMonad m, MVector v e) => (e -> Bool) -> v (PrimState m) e -> Int -> Int -> m Int

    vector-algorithms Data.Vector.Algorithms.Search

    Given a predicate that is guaranteed to be monotone on the indices [l,u) in a given vector, finds the index in [l,u] at which the predicate turns from False to True (yielding u if the entire interval is False). Begins searching at u, going left in increasing (2^n)-steps.

  6. WallTime :: Column

    weigh Weigh

    Rough execution time. For general indication, not a benchmark tool.

  7. maxAllocs :: Word64 -> Weight -> Maybe String

    weigh Weigh

    Make a validator that set sthe maximum allocations.

  8. weightAllocatedBytes :: Weight -> !Word64

    weigh Weigh

    No documentation available.

  9. weightWallTime :: Weight -> !Double

    weigh Weigh

    No documentation available.

  10. package call-stack

    Use GHC call-stacks in a backward compatible way Use GHC call-stacks in a backward compatible way

Page 409 of many | Previous | Next