Control.Monad.Trans.List

Documentation

newtype ListT m a

Constructors

ListT

Fields

• runListT :: m (Maybe (a, ListT m a))

Instances

MonadTrans ListT

Methods

lift :: Monad m => m a -> ListT m a

Monad m => Monad (ListT m)

Methods

(>>=) :: ListT m a -> (a -> ListT m b) -> ListT m b

(>>) :: ListT m a -> ListT m b -> ListT m b

return :: a -> ListT m a

fail :: String -> ListT m a

Functor m => Functor (ListT m)

Methods

fmap :: (a -> b) -> ListT m a -> ListT m b

(<$) :: a -> ListT m b -> ListT m a

MonadFix m => MonadFix (ListT m)

Methods

mfix :: (a -> ListT m a) -> ListT m a

Applicative p => Applicative (ListT p)

Methods

pure :: a -> ListT p a

(<*>) :: ListT p (a -> b) -> ListT p a -> ListT p b

(*>) :: ListT p a -> ListT p b -> ListT p b

(<*) :: ListT p a -> ListT p b -> ListT p a

Foldable m => Foldable (ListT m)

Methods

fold :: Monoid m => ListT m m -> m

foldMap :: Monoid m => (a -> m) -> ListT m a -> m

foldr :: (a -> b -> b) -> b -> ListT m a -> b

foldr' :: (a -> b -> b) -> b -> ListT m a -> b

foldl :: (b -> a -> b) -> b -> ListT m a -> b

foldl' :: (b -> a -> b) -> b -> ListT m a -> b

foldr1 :: (a -> a -> a) -> ListT m a -> a

foldl1 :: (a -> a -> a) -> ListT m a -> a

toList :: ListT m a -> [a]

null :: ListT m a -> Bool

length :: ListT m a -> Int

elem :: Eq a => a -> ListT m a -> Bool

maximum :: Ord a => ListT m a -> a

minimum :: Ord a => ListT m a -> a

sum :: Num a => ListT m a -> a

product :: Num a => ListT m a -> a

Traversable m => Traversable (ListT m)

Methods

traverse :: Applicative f => (a -> f b) -> ListT m a -> f (ListT m b)

sequenceA :: Applicative f => ListT m (f a) -> f (ListT m a)

mapM :: Monad m => (a -> m b) -> ListT m a -> m (ListT m b)

sequence :: Monad m => ListT m (m a) -> m (ListT m a)

Eq1 m => Eq1 (ListT m)

Methods

liftEq :: (a -> b -> Bool) -> ListT m a -> ListT m b -> Bool

Ord1 m => Ord1 (ListT m)

Methods

liftCompare :: (a -> b -> Ordering) -> ListT m a -> ListT m b -> Ordering

Show1 m => Show1 (ListT m)

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> ListT m a -> ShowS

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [ListT m a] -> ShowS

Applicative p => Alternative (ListT p)

Methods

empty :: ListT p a

(<|>) :: ListT p a -> ListT p a -> ListT p a

some :: ListT p a -> ListT p [a]

many :: ListT p a -> ListT p [a]

Monad m => MonadPlus (ListT m)

Methods

mzero :: ListT m a

mplus :: ListT m a -> ListT m a -> ListT m a

(Eq a, Eq1 m) => Eq (ListT m a)

Methods

(==) :: ListT m a -> ListT m a -> Bool

(/=) :: ListT m a -> ListT m a -> Bool

(Ord a, Ord1 m) => Ord (ListT m a)

Methods

compare :: ListT m a -> ListT m a -> Ordering

(<) :: ListT m a -> ListT m a -> Bool

(<=) :: ListT m a -> ListT m a -> Bool

(>) :: ListT m a -> ListT m a -> Bool

(>=) :: ListT m a -> ListT m a -> Bool

max :: ListT m a -> ListT m a -> ListT m a

min :: ListT m a -> ListT m a -> ListT m a

(Show a, Show1 m) => Show (ListT m a)

Methods

showsPrec :: Int -> ListT m a -> ShowS

show :: ListT m a -> String

showList :: [ListT m a] -> ShowS

fromList :: (Foldable f, Applicative p) => f a -> ListT p a

toListM :: Monad m => ListT m a -> m [a]

toReverseListM :: Monad m => ListT m a -> m [a]

foldlM :: Monad m => (b -> a -> m b) -> b -> ListT m a -> m b

traverseM :: Monad m => (a -> m b) -> ListT m a -> ListT m b

consF :: Functor f => f a -> ListT f a -> ListT f a

unfoldrF :: Functor f => (b -> f (Maybe (a, b))) -> b -> ListT f a

splitAtM :: (Monad m, Integral n) => n -> ListT m a -> m ([a], ListT m a)