Safe Haskell	None
Language	Haskell2010

Data.MonoTraversable.Instances

Contents

Orphan instances

Orphan instances

SemiSequence (DList a) Source #
Associated Types type Index (DList a) :: * # 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 #
IsSequence (DList a) Source #
Methods fromList :: [Element (DList a)] -> 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 # 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] #
MonoFunctor (DList a) Source #
Methods omap :: (Element (DList a) -> Element (DList a)) -> DList a -> DList a #
MonoFoldable (DList a) Source #
Methods ofoldMap :: Monoid m => (Element (DList a) -> m) -> DList a -> m # ofoldr :: (Element (DList a) -> b -> b) -> b -> DList a -> b # ofoldl' :: (a -> Element (DList a) -> a) -> a -> DList a -> a # 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 => (a -> Element (DList a) -> m a) -> a -> DList a -> m a # 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) #
MonoTraversable (DList a) Source #
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) #
MonoPointed (DList a) Source #
Methods opoint :: Element (DList a) -> DList a #
MonoComonad (Identity a) Source #
Methods oextract :: Identity a -> Element (Identity a) # oextend :: (Identity a -> Element (Identity a)) -> Identity a -> Identity a #
MonoComonad (NonEmpty a) Source #
Methods oextract :: NonEmpty a -> Element (NonEmpty a) # oextend :: (NonEmpty a -> Element (NonEmpty a)) -> NonEmpty a -> NonEmpty a #
MonoComonad (Tree a) Source #
Methods oextract :: Tree a -> Element (Tree a) # oextend :: (Tree a -> Element (Tree a)) -> Tree a -> Tree a #
GrowingAppend (DList a) Source #

Functor f => MonoFunctor (WrappedApplicative f a) Source #
Methods omap :: (Element (WrappedApplicative f a) -> Element (WrappedApplicative f a)) -> WrappedApplicative f a -> WrappedApplicative f a #
Functor f => MonoFunctor (MaybeApply f a) Source #
Methods omap :: (Element (MaybeApply f a) -> Element (MaybeApply f a)) -> MaybeApply f a -> MaybeApply f a #
Applicative f => MonoPointed (WrappedApplicative f a) Source #
Methods opoint :: Element (WrappedApplicative f a) -> WrappedApplicative f a #
MonoPointed (MaybeApply f a) Source #
Methods opoint :: Element (MaybeApply f a) -> MaybeApply f a #
Monoid m => MonoComonad (m -> a) Source #
Methods oextract :: (m -> a) -> Element (m -> a) # oextend :: ((m -> a) -> Element (m -> a)) -> (m -> a) -> m -> a #
MonoComonad (e, a) Source #
Methods oextract :: (e, a) -> Element (e, a) # oextend :: ((e, a) -> Element (e, a)) -> (e, a) -> (e, a) #
MonoComonad (Arg a b) Source #
Methods oextract :: Arg a b -> Element (Arg a b) # oextend :: (Arg a b -> Element (Arg a b)) -> Arg a b -> Arg a b #
Functor w => MonoFunctor (TracedT m w a) Source #
Methods omap :: (Element (TracedT m w a) -> Element (TracedT m w a)) -> TracedT m w a -> TracedT m w a #
Functor w => MonoFunctor (StoreT s w a) Source #
Methods omap :: (Element (StoreT s w a) -> Element (StoreT s w a)) -> StoreT s w a -> StoreT s w a #
Functor w => MonoFunctor (EnvT e w a) Source #
Methods omap :: (Element (EnvT e w a) -> Element (EnvT e w a)) -> EnvT e w a -> EnvT e w a #
MonoFunctor (Cokleisli w a b) Source #
Methods omap :: (Element (Cokleisli w a b) -> Element (Cokleisli w a b)) -> Cokleisli w a b -> Cokleisli w a b #
Functor f => MonoFunctor (Static f a b) Source #
Methods omap :: (Element (Static f a b) -> Element (Static f a b)) -> Static f a b -> Static f a b #
MonoPointed (Cokleisli w a b) Source #
Methods opoint :: Element (Cokleisli w a b) -> Cokleisli w a b #
Applicative f => MonoPointed (Static f a b) Source #
Methods opoint :: Element (Static f a b) -> Static f a b #
(Comonad w, Monoid m) => MonoComonad (TracedT m w a) Source #
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 (StoreT s w a) Source #
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 => MonoComonad (EnvT e w a) Source #
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 (IdentityT * w a) Source #
Methods oextract :: IdentityT * w a -> Element (IdentityT * w a) # oextend :: (IdentityT * w a -> Element (IdentityT * w a)) -> IdentityT * w a -> IdentityT * w a #