Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

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

Exact lookup

1. data CallStack

   relude	Relude.Base

   CallStacks are a lightweight method of obtaining a partial call-stack at any point in the program. A function can request its call-site with the HasCallStack constraint. For example, we can define

   putStrLnWithCallStack :: HasCallStack => String -> IO ()
   

   as a variant of putStrLn that will get its call-site and print it, along with the string given as argument. We can access the call-stack inside putStrLnWithCallStack with callStack.

   >>> :{
   putStrLnWithCallStack :: HasCallStack => String -> IO ()
   putStrLnWithCallStack msg = do
   putStrLn msg
   putStrLn (prettyCallStack callStack)
   :}
   

   Thus, if we call putStrLnWithCallStack we will get a formatted call-stack alongside our string.

   >>> putStrLnWithCallStack "hello"
   hello
   CallStack (from HasCallStack):
   putStrLnWithCallStack, called at <interactive>:... in interactive:Ghci...
   

   GHC solves HasCallStack constraints in three steps:
   1. If there is a CallStack in scope -- i.e. the enclosing function has a HasCallStack constraint -- GHC will append the new call-site to the existing CallStack.
   2. If there is no CallStack in scope -- e.g. in the GHCi session above -- and the enclosing definition does not have an explicit type signature, GHC will infer a HasCallStack constraint for the enclosing definition (subject to the monomorphism restriction).
   3. If there is no CallStack in scope and the enclosing definition has an explicit type signature, GHC will solve the HasCallStack constraint for the singleton CallStack containing just the current call-site.
   CallStacks do not interact with the RTS and do not require compilation with -prof. On the other hand, as they are built up explicitly via the HasCallStack constraints, they will generally not contain as much information as the simulated call-stacks maintained by the RTS. A CallStack is a [(String, SrcLoc)]. The String is the name of function that was called, the SrcLoc is the call-site. The list is ordered with the most recently called function at the head. NOTE: The intrepid user may notice that HasCallStack is just an alias for an implicit parameter ?callStack :: CallStack. This is an implementation detail and should not be considered part of the CallStack API, we may decide to change the implementation in the future.

2. callStack :: HasCallStack => CallStack

   relude	Relude.Base

   Return the current CallStack. Does *not* include the call-site of callStack.

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

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

   relude	Relude.Base

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

5. prettyCallStack :: CallStack -> String

   relude	Relude.Base

   Pretty print a CallStack.

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

   relude	Relude.Base

   Perform some computation without adding new entries to the CallStack.

7. module Relude.Extra.CallStack

   Contains useful functions to work with GHC callstack.

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

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

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

    relude	Relude.Lifted.Concurrent

    Lifted to MonadIO version of atomically.

Page 465 of many | Previous | Next