Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.List.Trace

Synopsis

data Trace a b
- = Cons b ( Trace a b)
- | Nil a
ppTrace :: (a -> String ) -> (b -> String ) -> Trace a b -> String
toList :: Trace a b -> [b]
fromList :: a -> [b] -> Trace a b
head :: Trace a b -> b
tail :: Trace a b -> Trace a b
filter :: (b -> Bool ) -> Trace a b -> Trace a b
length :: Trace a b -> Int

Documentation

data Trace a b Source #

A cons list with polymorphic nil , thus an octopus.

Trace Void a is an infinite stream
Trace () a is isomorphic to [a]

Usually used with a being a non empty sum type.

Constructors

Cons b ( Trace a b)
Nil a

Instances

Instances details

Bitraversable Trace Source #
Instance details Defined in Data.List.Trace Methods bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Trace a b -> f ( Trace c d) Source #
Bifoldable Trace Source #
Instance details Defined in Data.List.Trace Methods bifold :: Monoid m => Trace m m -> m Source # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Trace a b -> m Source # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Trace a b -> c Source # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Trace a b -> c Source #
Bifunctor Trace Source #
Instance details Defined in Data.List.Trace Methods bimap :: (a -> b) -> (c -> d) -> Trace a c -> Trace b d Source # first :: (a -> b) -> Trace a c -> Trace b c Source # second :: (b -> c) -> Trace a b -> Trace a c Source #
Monoid a => Monad ( Trace a) Source #
Instance details Defined in Data.List.Trace Methods (>>=) :: Trace a a0 -> (a0 -> Trace a b) -> Trace a b Source # (>>) :: Trace a a0 -> Trace a b -> Trace a b Source # return :: a0 -> Trace a a0 Source #
Functor ( Trace a) Source #
Instance details Defined in Data.List.Trace Methods fmap :: (a0 -> b) -> Trace a a0 -> Trace a b Source # (<$) :: a0 -> Trace a b -> Trace a a0 Source #
Monoid a => MonadFix ( Trace a) Source #
Instance details Defined in Data.List.Trace Methods mfix :: (a0 -> Trace a a0) -> Trace a a0 Source #
Monoid a => MonadFail ( Trace a) Source #
Instance details Defined in Data.List.Trace Methods fail :: String -> Trace a a0 Source #
Monoid a => Applicative ( Trace a) Source #
Instance details Defined in Data.List.Trace Methods pure :: a0 -> Trace a a0 Source # (<>) :: Trace a (a0 -> b) -> Trace a a0 -> Trace a b Source # liftA2 :: (a0 -> b -> c) -> Trace a a0 -> Trace a b -> Trace a c Source # (>) :: Trace a a0 -> Trace a b -> Trace a b Source # (<*) :: Trace a a0 -> Trace a b -> Trace a a0 Source #
Eq a => Eq1 ( Trace a) Source #
Instance details Defined in Data.List.Trace Methods liftEq :: (a0 -> b -> Bool ) -> Trace a a0 -> Trace a b -> Bool Source #
Ord a => Ord1 ( Trace a) Source #
Instance details Defined in Data.List.Trace Methods liftCompare :: (a0 -> b -> Ordering ) -> Trace a a0 -> Trace a b -> Ordering Source #
Show a => Show1 ( Trace a) Source #
Instance details Defined in Data.List.Trace Methods liftShowsPrec :: ( Int -> a0 -> ShowS ) -> ([a0] -> ShowS ) -> Int -> Trace a a0 -> ShowS Source # liftShowList :: ( Int -> a0 -> ShowS ) -> ([a0] -> ShowS ) -> [ Trace a a0] -> ShowS Source #
Monoid a => Alternative ( Trace a) Source #
Instance details Defined in Data.List.Trace Methods empty :: Trace a a0 Source # (<\|>) :: Trace a a0 -> Trace a a0 -> Trace a a0 Source # some :: Trace a a0 -> Trace a [a0] Source # many :: Trace a a0 -> Trace a [a0] Source #
Monoid a => MonadPlus ( Trace a) Source #
Instance details Defined in Data.List.Trace Methods mzero :: Trace a a0 Source # mplus :: Trace a a0 -> Trace a a0 -> Trace a a0 Source #
( Eq b, Eq a) => Eq ( Trace a b) Source #
Instance details Defined in Data.List.Trace Methods (==) :: Trace a b -> Trace a b -> Bool Source # (/=) :: Trace a b -> Trace a b -> Bool Source #
( Ord b, Ord a) => Ord ( Trace a b) Source #
Instance details Defined in Data.List.Trace Methods compare :: Trace a b -> Trace a b -> Ordering Source # (<) :: Trace a b -> Trace a b -> Bool Source # (<=) :: Trace a b -> Trace a b -> Bool Source # (>) :: Trace a b -> Trace a b -> Bool Source # (>=) :: Trace a b -> Trace a b -> Bool Source # max :: Trace a b -> Trace a b -> Trace a b Source # min :: Trace a b -> Trace a b -> Trace a b Source #
( Show b, Show a) => Show ( Trace a b) Source #
Instance details Defined in Data.List.Trace Methods showsPrec :: Int -> Trace a b -> ShowS Source # show :: Trace a b -> String Source # showList :: [ Trace a b] -> ShowS Source #
Semigroup a => Semigroup ( Trace a b) Source #
Instance details Defined in Data.List.Trace Methods (<>) :: Trace a b -> Trace a b -> Trace a b Source # sconcat :: NonEmpty ( Trace a b) -> Trace a b Source # stimes :: Integral b0 => b0 -> Trace a b -> Trace a b Source #
Monoid a => Monoid ( Trace a b) Source #
Instance details Defined in Data.List.Trace Methods mempty :: Trace a b Source # mappend :: Trace a b -> Trace a b -> Trace a b Source # mconcat :: [ Trace a b] -> Trace a b Source #

ppTrace :: (a -> String ) -> (b -> String ) -> Trace a b -> String Source #

Pretty print an Trace .

toList :: Trace a b -> [b] Source #

fromList :: a -> [b] -> Trace a b Source #

head :: Trace a b -> b Source #

tail :: Trace a b -> Trace a b Source #

filter :: (b -> Bool ) -> Trace a b -> Trace a b Source #

length :: Trace a b -> Int Source #