mono-traversable-instances-0.1.1.0: Extra typeclass instances for mono-traversable

Safe Haskell | None
Language | Haskell2010

Data.MonoTraversable.Instances

Contents

- Orphan instances

# Orphan instances

GrowingAppend (DList a) Source # |
Instance details
MonoComonad (Tree a) Source # |
Instance details Methods oextract :: Tree a -> Element (Tree a) Source # oextend :: (Tree a -> Element (Tree a)) -> Tree a -> Tree a Source #
MonoComonad (NonEmpty a) Source # |
Instance details Methods oextract :: NonEmpty a -> Element (NonEmpty a) Source # oextend :: (NonEmpty a -> Element (NonEmpty a)) -> NonEmpty a -> NonEmpty a Source #
MonoComonad (Identity a) Source # |
Instance details Methods oextract :: Identity a -> Element (Identity a) Source # oextend :: (Identity a -> Element (Identity a)) -> Identity a -> Identity a Source #
MonoFoldable (DList a) Source # |

Instance details

Methods

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

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

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

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

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

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

onull :: DList a -> Bool Source #

olength :: DList a -> Int Source #

olength64 :: DList a -> Int64 Source #

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

MonoFunctor (DList a) Source # |
Instance details Methods omap :: (Element (DList a) -> Element (DList a)) -> DList a -> DList a Source #
MonoPointed (DList a) Source # |
Instance details Methods opoint :: Element (DList a) -> DList a Source #
MonoTraversable (DList a) Source # |
Instance details Methods otraverse :: Applicative f => (Element (DList a) -> f (Element (DList a))) -> DList a -> f (DList a) Source # omapM :: Applicative m => (Element (DList a) -> m (Element (DList a))) -> DList a -> m (DList a) Source #
IsSequence (DList a) Source # |

Instance details

Methods

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tailEx :: DList a -> DList a Source #

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

initEx :: DList a -> DList a Source #

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

unsafeTail :: DList a -> DList a Source #

unsafeInit :: DList a -> DList a Source #

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

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

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

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

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

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

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

SemiSequence (DList a) Source # |

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 Source #

reverse :: DList a -> DList a Source #

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

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

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

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

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