| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.MonoTraversable.Instances
Contents
Orphan instances
| GrowingAppend (DList a) Source # | |||||
| MonoComonad (Tree a) Source # | |||||
| MonoComonad (NonEmpty a) Source # | |||||
| MonoComonad (Identity a) Source # | |||||
| MonoFoldable (DList a) Source # | |||||
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 # | |||||
| MonoFunctor (DList a) Source # | |||||
| MonoPointed (DList a) Source # | |||||
| MonoTraversable (DList a) Source # | |||||
| IsSequence (DList a) Source # | |||||
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 # | |||||
| SemiSequence (DList a) Source # | |||||
Associated Types
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 # | |||||
| MonoComonad (Arg a b) Source # | |||||
| MonoComonad (e, a) Source # | |||||
| Monoid m => MonoComonad (m -> a) Source # | |||||
| Functor f => MonoFunctor (MaybeApply f a) Source # | |||||
| Functor f => MonoFunctor (WrappedApplicative f a) Source # | |||||
| MonoPointed (MaybeApply f a) Source # | |||||
| Applicative f => MonoPointed (WrappedApplicative f a) Source # | |||||
| Comonad w => MonoComonad (EnvT e w a) Source # | |||||
| Comonad w => MonoComonad (StoreT s w a) Source # | |||||
| (Comonad w, Monoid m) => MonoComonad (TracedT m w a) Source # | |||||
| Comonad w => MonoComonad (IdentityT w a) Source # | |||||
| Functor w => MonoFunctor (EnvT e w a) Source # | |||||
| Functor w => MonoFunctor (StoreT s w a) Source # | |||||
| Functor w => MonoFunctor (TracedT m w a) Source # | |||||
| Functor f => MonoFunctor (Static f a b) Source # | |||||
| Applicative f => MonoPointed (Static f a b) Source # | |||||
| MonoFunctor (Cokleisli w a b) Source # | |||||
| MonoPointed (Cokleisli w a b) Source # | |||||