debug-tracy-0.1.0.1: More useful trace functions for investigating bugs
Debug.Tracy
Synopsis
module Debug.Trace
tracy :: Show a => String -> a -> a Source #
trace with show and a delimiter built in
keanu :: a -> a Source #
Spit out a random Keanu Reaves quote when a is evauluated
a
arnold :: a -> a Source #
spit out a random Arnold Schwarzenegger quote when a is evaluated
hasLength :: Foldable t => String -> t a -> t a Source #
Inspect the size of a collection
isFound :: Foldable t => String -> t a -> t a Source #
Inspect if t a is null
t a
data Find a Source #
Wrapper for inspecting a usage of the Maybe Monad
Instances
Methods
(>>=) :: Find a -> (a -> Find b) -> Find b #
(>>) :: Find a -> Find b -> Find b #
return :: a -> Find a #
fail :: String -> Find a #
fmap :: (a -> b) -> Find a -> Find b #
(<$) :: a -> Find b -> Find a #
pure :: a -> Find a #
(<*>) :: Find (a -> b) -> Find a -> Find b #
liftA2 :: (a -> b -> c) -> Find a -> Find b -> Find c #
(*>) :: Find a -> Find b -> Find b #
(<*) :: Find a -> Find b -> Find a #
fold :: Monoid m => Find m -> m #
foldMap :: Monoid m => (a -> m) -> Find a -> m #
foldr :: (a -> b -> b) -> b -> Find a -> b #
foldr' :: (a -> b -> b) -> b -> Find a -> b #
foldl :: (b -> a -> b) -> b -> Find a -> b #
foldl' :: (b -> a -> b) -> b -> Find a -> b #
foldr1 :: (a -> a -> a) -> Find a -> a #
foldl1 :: (a -> a -> a) -> Find a -> a #
toList :: Find a -> [a] #
null :: Find a -> Bool #
length :: Find a -> Int #
elem :: Eq a => a -> Find a -> Bool #
maximum :: Ord a => Find a -> a #
minimum :: Ord a => Find a -> a #
sum :: Num a => Find a -> a #
product :: Num a => Find a -> a #
(==) :: Find a -> Find a -> Bool #
(/=) :: Find a -> Find a -> Bool #
compare :: Find a -> Find a -> Ordering #
(<) :: Find a -> Find a -> Bool #
(<=) :: Find a -> Find a -> Bool #
(>) :: Find a -> Find a -> Bool #
(>=) :: Find a -> Find a -> Bool #
max :: Find a -> Find a -> Find a #
min :: Find a -> Find a -> Find a #
showsPrec :: Int -> Find a -> ShowS #
show :: Find a -> String #
showList :: [Find a] -> ShowS #
data FindT m a Source #
Wrapper for inspecting a usage of the MaybeT Monad Transformer
(>>=) :: FindT m a -> (a -> FindT m b) -> FindT m b #
(>>) :: FindT m a -> FindT m b -> FindT m b #
return :: a -> FindT m a #
fail :: String -> FindT m a #
fmap :: (a -> b) -> FindT m a -> FindT m b #
(<$) :: a -> FindT m b -> FindT m a #
pure :: a -> FindT m a #
(<*>) :: FindT m (a -> b) -> FindT m a -> FindT m b #
liftA2 :: (a -> b -> c) -> FindT m a -> FindT m b -> FindT m c #
(*>) :: FindT m a -> FindT m b -> FindT m b #
(<*) :: FindT m a -> FindT m b -> FindT m a #