hedgehog-1.4: Release with confidence.
Safe HaskellSafe-Inferred
LanguageHaskell2010

Hedgehog.Internal.Source

Synopsis

Documentation

newtype LineNo Source #

Constructors

LineNo 

Fields

Instances

Instances details
Enum LineNo Source # 
Instance details

Defined in Hedgehog.Internal.Source

Num LineNo Source # 
Instance details

Defined in Hedgehog.Internal.Source

Integral LineNo Source # 
Instance details

Defined in Hedgehog.Internal.Source

Real LineNo Source # 
Instance details

Defined in Hedgehog.Internal.Source

Show LineNo Source # 
Instance details

Defined in Hedgehog.Internal.Source

Eq LineNo Source # 
Instance details

Defined in Hedgehog.Internal.Source

Methods

(==) :: LineNo -> LineNo -> Bool #

(/=) :: LineNo -> LineNo -> Bool #

Ord LineNo Source # 
Instance details

Defined in Hedgehog.Internal.Source

newtype ColumnNo Source #

Constructors

ColumnNo 

Fields

Instances

Instances details
Enum ColumnNo Source # 
Instance details

Defined in Hedgehog.Internal.Source

Num ColumnNo Source # 
Instance details

Defined in Hedgehog.Internal.Source

Integral ColumnNo Source # 
Instance details

Defined in Hedgehog.Internal.Source

Real ColumnNo Source # 
Instance details

Defined in Hedgehog.Internal.Source

Show ColumnNo Source # 
Instance details

Defined in Hedgehog.Internal.Source

Eq ColumnNo Source # 
Instance details

Defined in Hedgehog.Internal.Source

Ord ColumnNo Source # 
Instance details

Defined in Hedgehog.Internal.Source

data Span Source #

Instances

Instances details
Show Span Source # 
Instance details

Defined in Hedgehog.Internal.Source

Methods

showsPrec :: Int -> Span -> ShowS #

show :: Span -> String #

showList :: [Span] -> ShowS #

Eq Span Source # 
Instance details

Defined in Hedgehog.Internal.Source

Methods

(==) :: Span -> Span -> Bool #

(/=) :: Span -> Span -> Bool #

Ord Span Source # 
Instance details

Defined in Hedgehog.Internal.Source

Methods

compare :: Span -> Span -> Ordering #

(<) :: Span -> Span -> Bool #

(<=) :: Span -> Span -> Bool #

(>) :: Span -> Span -> Bool #

(>=) :: Span -> Span -> Bool #

max :: Span -> Span -> Span #

min :: Span -> Span -> Span #

Re-exports from GHC.Stack

data CallStack #

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.

Since: base-4.8.1.0

Instances

Instances details
IsList CallStack

Be aware that 'fromList . toList = id' only for unfrozen CallStacks, since toList removes frozenness information.

Since: base-4.9.0.0

Instance details

Defined in GHC.Exts

Associated Types

type Item CallStack #

Show CallStack

Since: base-4.9.0.0

Instance details

Defined in GHC.Show

NFData CallStack

Since: deepseq-1.4.2.0

Instance details

Defined in Control.DeepSeq

Methods

rnf :: CallStack -> () #

type Item CallStack 
Instance details

Defined in GHC.Exts

type HasCallStack = ?callStack :: CallStack #

Request a CallStack.

NOTE: The implicit parameter ?callStack :: CallStack is an implementation detail and should not be considered part of the CallStack API, we may decide to change the implementation in the future.

Since: base-4.9.0.0

callStack :: HasCallStack => CallStack #

Return the current CallStack.

Does *not* include the call-site of callStack.

Since: base-4.9.0.0

withFrozenCallStack :: HasCallStack => (HasCallStack => a) -> a #

Perform some computation without adding new entries to the CallStack.

Since: base-4.9.0.0