Safe Haskell	None
Language	Haskell2010

Data.MonoTraversable.Instances

Contents

Orphan instances

Orphan instances

GrowingAppend (DList a) #

Instance details

MonoComonad (Tree a) #

Instance details

Methods

oextract :: Tree a -> Element (Tree a) #

oextend :: (Tree a -> Element (Tree a)) -> Tree a -> Tree a #

MonoComonad (NonEmpty a) #

Instance details

Methods

oextract :: NonEmpty a -> Element (NonEmpty a) #

oextend :: (NonEmpty a -> Element (NonEmpty a)) -> NonEmpty a -> NonEmpty a #

MonoComonad (Identity a) #

Instance details

Methods

oextract :: Identity a -> Element (Identity a) #

oextend :: (Identity a -> Element (Identity a)) -> Identity a -> Identity a #

MonoFoldable (DList a) #

Instance details

Methods

ofoldMap :: Monoid m => (Element (DList a) -> m) -> DList a -> m #

ofoldr :: (Element (DList a) -> b -> b) -> b -> DList a -> b #

ofoldl' :: (a0 -> Element (DList a) -> a0) -> a0 -> DList a -> a0 #

otoList :: DList a -> [Element (DList a)] #

oall :: (Element (DList a) -> Bool) -> DList a -> Bool #

oany :: (Element (DList a) -> Bool) -> DList a -> Bool #

onull :: DList a -> Bool #

olength :: DList a -> Int #

olength64 :: DList a -> Int64 #

ocompareLength :: Integral i => DList a -> i -> Ordering #

otraverse_ :: Applicative f => (Element (DList a) -> f b) -> DList a -> f () #

ofor_ :: Applicative f => DList a -> (Element (DList a) -> f b) -> f () #

omapM_ :: Applicative m => (Element (DList a) -> m ()) -> DList a -> m () #

oforM_ :: Applicative m => DList a -> (Element (DList a) -> m ()) -> m () #

ofoldlM :: Monad m => (a0 -> Element (DList a) -> m a0) -> a0 -> DList a -> m a0 #

ofoldMap1Ex :: Semigroup m => (Element (DList a) -> m) -> DList a -> m #

ofoldr1Ex :: (Element (DList a) -> Element (DList a) -> Element (DList a)) -> DList a -> Element (DList a) #

ofoldl1Ex' :: (Element (DList a) -> Element (DList a) -> Element (DList a)) -> DList a -> Element (DList a) #

headEx :: DList a -> Element (DList a) #

lastEx :: DList a -> Element (DList a) #

unsafeHead :: DList a -> Element (DList a) #

unsafeLast :: DList a -> Element (DList a) #

maximumByEx :: (Element (DList a) -> Element (DList a) -> Ordering) -> DList a -> Element (DList a) #

minimumByEx :: (Element (DList a) -> Element (DList a) -> Ordering) -> DList a -> Element (DList a) #

oelem :: Element (DList a) -> DList a -> Bool #

onotElem :: Element (DList a) -> DList a -> Bool #

MonoFunctor (DList a) #

Instance details

Methods

omap :: (Element (DList a) -> Element (DList a)) -> DList a -> DList a #

MonoPointed (DList a) #

Instance details

Methods

opoint :: Element (DList a) -> DList a #

MonoTraversable (DList a) #

Instance details

Methods

otraverse :: Applicative f => (Element (DList a) -> f (Element (DList a))) -> DList a -> f (DList a) #

omapM :: Applicative m => (Element (DList a) -> m (Element (DList a))) -> DList a -> m (DList a) #

IsSequence (DList a) #

Instance details

Methods

fromList :: [Element (DList a)] -> DList a #

lengthIndex :: DList a -> Index (DList a) #

break :: (Element (DList a) -> Bool) -> DList a -> (DList a, DList a) #

span :: (Element (DList a) -> Bool) -> DList a -> (DList a, DList a) #

dropWhile :: (Element (DList a) -> Bool) -> DList a -> DList a #

takeWhile :: (Element (DList a) -> Bool) -> DList a -> DList a #

splitAt :: Index (DList a) -> DList a -> (DList a, DList a) #

unsafeSplitAt :: Index (DList a) -> DList a -> (DList a, DList a) #

take :: Index (DList a) -> DList a -> DList a #

unsafeTake :: Index (DList a) -> DList a -> DList a #

drop :: Index (DList a) -> DList a -> DList a #

unsafeDrop :: Index (DList a) -> DList a -> DList a #

dropEnd :: Index (DList a) -> DList a -> DList a #

partition :: (Element (DList a) -> Bool) -> DList a -> (DList a, DList a) #

uncons :: DList a -> Maybe (Element (DList a), DList a) #

unsnoc :: DList a -> Maybe (DList a, Element (DList a)) #

filter :: (Element (DList a) -> Bool) -> DList a -> DList a #

filterM :: Monad m => (Element (DList a) -> m Bool) -> DList a -> m (DList a) #

replicate :: Index (DList a) -> Element (DList a) -> DList a #

replicateM :: Monad m => Index (DList a) -> m (Element (DList a)) -> m (DList a) #

groupBy :: (Element (DList a) -> Element (DList a) -> Bool) -> DList a -> [DList a] #

groupAllOn :: Eq b => (Element (DList a) -> b) -> DList a -> [DList a] #

subsequences :: DList a -> [DList a] #

permutations :: DList a -> [DList a] #

tailEx :: DList a -> DList a #

tailMay :: DList a -> Maybe (DList a) #

initEx :: DList a -> DList a #

initMay :: DList a -> Maybe (DList a) #

unsafeTail :: DList a -> DList a #

unsafeInit :: DList a -> DList a #

index :: DList a -> Index (DList a) -> Maybe (Element (DList a)) #

indexEx :: DList a -> Index (DList a) -> Element (DList a) #

unsafeIndex :: DList a -> Index (DList a) -> Element (DList a) #

splitWhen :: (Element (DList a) -> Bool) -> DList a -> [DList a] #

tails :: DList a -> [DList a] #

inits :: DList a -> [DList a] #

initTails :: DList a -> [(DList a, DList a)] #

SemiSequence (DList a) #

Instance details

Associated Types

type Index (DList a)
Instance details Defined in Data.MonoTraversable.Instances type Index (DList a) = Int

Methods

intersperse :: Element (DList a) -> DList a -> DList a #

reverse :: DList a -> DList a #

find :: (Element (DList a) -> Bool) -> DList a -> Maybe (Element (DList a)) #

sortBy :: (Element (DList a) -> Element (DList a) -> Ordering) -> DList a -> DList a #

cons :: Element (DList a) -> DList a -> DList a #

snoc :: DList a -> Element (DList a) -> DList a #

MonoComonad (Arg a b) #

Instance details

Methods

oextract :: Arg a b -> Element (Arg a b) #

oextend :: (Arg a b -> Element (Arg a b)) -> Arg a b -> Arg a b #

MonoComonad (e, a) #

Instance details

Methods

oextract :: (e, a) -> Element (e, a) #

oextend :: ((e, a) -> Element (e, a)) -> (e, a) -> (e, a) #

Monoid m => MonoComonad (m -> a) #

Instance details

Methods

oextract :: (m -> a) -> Element (m -> a) #

oextend :: ((m -> a) -> Element (m -> a)) -> (m -> a) -> m -> a #

Functor f => MonoFunctor (MaybeApply f a) #

Instance details

Methods

omap :: (Element (MaybeApply f a) -> Element (MaybeApply f a)) -> MaybeApply f a -> MaybeApply f a #

Functor f => MonoFunctor (WrappedApplicative f a) #

Instance details

Methods

omap :: (Element (WrappedApplicative f a) -> Element (WrappedApplicative f a)) -> WrappedApplicative f a -> WrappedApplicative f a #

MonoPointed (MaybeApply f a) #

Instance details

Methods

opoint :: Element (MaybeApply f a) -> MaybeApply f a #

Applicative f => MonoPointed (WrappedApplicative f a) #

Instance details

Methods

opoint :: Element (WrappedApplicative f a) -> WrappedApplicative f a #

Comonad w => MonoComonad (EnvT e w a) #

Instance details

Methods

oextract :: EnvT e w a -> Element (EnvT e w a) #

oextend :: (EnvT e w a -> Element (EnvT e w a)) -> EnvT e w a -> EnvT e w a #

Comonad w => MonoComonad (StoreT s w a) #

Instance details

Methods

oextract :: StoreT s w a -> Element (StoreT s w a) #

oextend :: (StoreT s w a -> Element (StoreT s w a)) -> StoreT s w a -> StoreT s w a #

(Comonad w, Monoid m) => MonoComonad (TracedT m w a) #

Instance details

Methods

oextract :: TracedT m w a -> Element (TracedT m w a) #

oextend :: (TracedT m w a -> Element (TracedT m w a)) -> TracedT m w a -> TracedT m w a #

Comonad w => MonoComonad (IdentityT w a) #

Instance details

Methods

oextract :: IdentityT w a -> Element (IdentityT w a) #

oextend :: (IdentityT w a -> Element (IdentityT w a)) -> IdentityT w a -> IdentityT w a #

Functor w => MonoFunctor (EnvT e w a) #

Instance details

Methods

omap :: (Element (EnvT e w a) -> Element (EnvT e w a)) -> EnvT e w a -> EnvT e w a #

Functor w => MonoFunctor (StoreT s w a) #

Instance details

Methods

omap :: (Element (StoreT s w a) -> Element (StoreT s w a)) -> StoreT s w a -> StoreT s w a #

Functor w => MonoFunctor (TracedT m w a) #

Instance details

Methods

omap :: (Element (TracedT m w a) -> Element (TracedT m w a)) -> TracedT m w a -> TracedT m w a #

Functor f => MonoFunctor (Static f a b) #

Instance details

Methods

omap :: (Element (Static f a b) -> Element (Static f a b)) -> Static f a b -> Static f a b #

Applicative f => MonoPointed (Static f a b) #

Instance details

Methods

opoint :: Element (Static f a b) -> Static f a b #

MonoFunctor (Cokleisli w a b) #

Instance details

Methods

omap :: (Element (Cokleisli w a b) -> Element (Cokleisli w a b)) -> Cokleisli w a b -> Cokleisli w a b #

MonoPointed (Cokleisli w a b) #

Instance details

Methods

opoint :: Element (Cokleisli w a b) -> Cokleisli w a b #