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. currentCallStack :: IO [String]

    relude Relude.Base

    Returns a [String] representing the current call stack. This can be useful for debugging. The implementation uses the call-stack simulation maintained by the profiler, so it only works if the program was compiled with -prof and contains suitable SCC annotations (e.g. by using -fprof-auto). Otherwise, the list returned is likely to be empty or uninformative.

  2. getCallStack :: CallStack -> [([Char], SrcLoc)]

    relude Relude.Base

    Extract a list of call-sites from the CallStack. The list is ordered by most recent call.

  3. prettyCallStack :: CallStack -> String

    relude Relude.Base

    Pretty print a CallStack.

  4. withFrozenCallStack :: HasCallStack => (HasCallStack => a) -> a

    relude Relude.Base

    Perform some computation without adding new entries to the CallStack.

  5. module Relude.Extra.CallStack

    Contains useful functions to work with GHC callstack.

  6. callerName :: HasCallStack => String

    relude Relude.Extra.CallStack

    This function returns the name of its caller of the caller function, but it requires that the caller function and caller of the caller function have HasCallStack constraint. Otherwise, it returns "unknown". It's useful for logging:

    >>> log :: HasCallStack => String -> IO (); log s = putStrLn $ callerName ++ ":" ++ s
    
    >>> greeting :: HasCallStack => IO (); greeting = log "Starting..." >> putStrLn "Hello!" >> log "Ending..."
    
    >>> greeting
    greeting:Starting...
    Hello!
    greeting:Ending...
    

  7. biall :: Bifoldable t => (a -> Bool) -> (b -> Bool) -> t a b -> Bool

    relude Relude.Foldable.Reexport

    Determines whether all elements of the structure satisfy their appropriate predicate argument. Empty structures yield True.

    Examples

    Basic usage:
    >>> biall even isDigit (27, 't')
    False
    
    >>> biall even isDigit (26, '8')
    True
    
    >>> biall even isDigit (Left 27)
    False
    
    >>> biall even isDigit (Left 26)
    True
    
    >>> biall even isDigit (BiList [26, 52] ['3', '8'])
    True
    
    Empty structures yield True:
    >>> biall even isDigit (BiList [] [])
    True
    

  8. atomically :: MonadIO m => STM a -> m a

    relude Relude.Lifted.Concurrent

    Lifted to MonadIO version of atomically.

  9. getAll :: All -> Bool

    relude Relude.Monoid

    No documentation available.

  10. module Data.Vinyl.ARec.Internal.SmallArray

    Helper functions for SmallArray# This module exposes _unsafe_ functions to work with SmallArrays. That means that specifically neither index bounds nor element types are checked So this functionality should only be used in a context that enforces them by some other means, e.g. ARec's type index

Page 465 of many | Previous | Next