Agda-2.2.6: A dependently typed functional programming language and proof assistantSource codeContentsIndex
Agda.Utils.Trace
Documentation
type Trace = CurrentCallSource
type SiblingCall = ChildCallSource
data CurrentCall a Source
Constructors
Current a (ParentCall a) [SiblingCall a] [ChildCall a]
TopLevel [ChildCall a]
data ParentCall a Source
Constructors
Parent a (ParentCall a) [SiblingCall a]
NoParent
data ChildCall a Source
Constructors
Child a [ChildCall a]
newCall :: a -> Trace a -> Trace aSource
updateCall :: a -> Trace a -> Trace aSource
matchCall :: (call -> Maybe a) -> Trace call -> Maybe aSource
matchCalls :: (call -> Maybe a) -> Trace call -> [a]Source
matchTrace :: Monoid m => (ChildCall call -> m) -> Trace call -> mSource
Produced by Haddock version 2.6.0