Copyright | (C) 2012-2015 Edward Kmett |
---|---|
License | BSD-style (see the file LICENSE) |
Maintainer | Edward Kmett <ekmett@gmail.com> |
Stability | provisional |
Portability | portable |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
Documentation
Provides a consistent View
for peeling off the bottom node of a path.
Instances
Functor f => Functor (View f) Source # | |
Foldable f => Foldable (View f) Source # | |
Defined in Data.LCA.View fold :: Monoid m => View f m -> m # foldMap :: Monoid m => (a -> m) -> View f a -> m # foldMap' :: Monoid m => (a -> m) -> View f a -> m # foldr :: (a -> b -> b) -> b -> View f a -> b # foldr' :: (a -> b -> b) -> b -> View f a -> b # foldl :: (b -> a -> b) -> b -> View f a -> b # foldl' :: (b -> a -> b) -> b -> View f a -> b # foldr1 :: (a -> a -> a) -> View f a -> a # foldl1 :: (a -> a -> a) -> View f a -> a # elem :: Eq a => a -> View f a -> Bool # maximum :: Ord a => View f a -> a # minimum :: Ord a => View f a -> a # | |
Traversable f => Traversable (View f) Source # | |
(Eq a, Eq (f a)) => Eq (View f a) Source # | |
(Ord a, Ord (f a)) => Ord (View f a) Source # | |
Defined in Data.LCA.View | |
(Read a, Read (f a)) => Read (View f a) Source # | |
(Show a, Show (f a)) => Show (View f a) Source # | |