| Copyright | (C) 2012-2016 Edward Kmett | 
|---|---|
| License | BSD-style (see the file LICENSE) | 
| Maintainer | Edward Kmett <ekmett@gmail.com> | 
| Stability | experimental | 
| Portability | non-portable | 
| Safe Haskell | Safe | 
| Language | Haskell98 | 
Control.Lens.Internal.Fold
Description
- newtype Folding f a = Folding {
- getFolding :: f a
 
 - newtype Traversed a f = Traversed {
- getTraversed :: f a
 
 - newtype Sequenced a m = Sequenced {
- getSequenced :: m a
 
 - data Max a
 - getMax :: Max a -> Maybe a
 - data Min a
 - getMin :: Min a -> Maybe a
 - data Leftmost a
 - getLeftmost :: Leftmost a -> Maybe a
 - data Rightmost a
 - getRightmost :: Rightmost a -> Maybe a
 - data ReifiedMonoid a :: * -> * = ReifiedMonoid {
- reifiedMappend :: a -> a -> a
 - reifiedMempty :: a
 
 - newtype NonEmptyDList a = NonEmptyDList {
- getNonEmptyDList :: [a] -> NonEmpty a
 
 
Monoids for folding
A Monoid for a Contravariant Applicative.
Constructors
| Folding | |
Fields 
  | |
Instances
| (Contravariant f, Apply f) => Semigroup (Folding f a) Source # | |
| (Contravariant f, Applicative f) => Monoid (Folding f a) Source # | |
newtype Traversed a f Source #
Used internally by traverseOf_ and the like.
The argument a of the result should not be used!
Constructors
| Traversed | |
Fields 
  | |
newtype Sequenced a m Source #
Used internally by mapM_ and the like.
The argument a of the result should not be used!
Constructors
| Sequenced | |
Fields 
  | |
Used for maximumOf.
Used for minimumOf.
Used for preview.
getLeftmost :: Leftmost a -> Maybe a Source #
Used for lastOf.
getRightmost :: Rightmost a -> Maybe a Source #
data ReifiedMonoid a :: * -> * #
Constructors
| ReifiedMonoid | |
Fields 
  | |
Semigroups for folding
newtype NonEmptyDList a Source #
Constructors
| NonEmptyDList | |
Fields 
  | |
Instances