Safe Haskell | None |
---|---|
Language | Haskell98 |
- data SnocList a
- data SnocList1 a
- data List1 a
- data Maybe' a
- maybe' :: b -> (a -> b) -> Maybe' a -> b
- data Pair' a b = Pair' !a !b
- newtype N a s = N {
- runN :: a
- newtype S a s = S {
- runS :: a
- data Tree a
- data Tree1 a
- newtype An a = An a
- data Box a = Box a
- newtype FreeMonoid a = FreeMonoid {
- runFreeMonoid :: forall m. Monoid m => (a -> m) -> m
- foldDeRef :: forall f a. (MuRef1 f, Bifoldable (DeRef1 f)) => f a -> FreeMonoid a
- newtype FreeSemigroup a = FreeSemigroup {
- runFreeSemigroup :: forall m. Semigroup m => (a -> m) -> m
- foldDeRef1 :: forall f a. (MuRef1 f, Bifoldable1 (DeRef1 f)) => f a -> FreeSemigroup a
Documentation
Reversed '[]'
Strict Maybe
Strict Pair
Pair' !a !b |
(Eq b, Eq a) => Eq (Pair' a b) Source # | |
(Data b, Data a) => Data (Pair' a b) Source # | |
(Ord b, Ord a) => Ord (Pair' a b) Source # | |
(Read b, Read a) => Read (Pair' a b) Source # | |
(Show b, Show a) => Show (Pair' a b) Source # | |
(Semigroup a, Semigroup b) => Semigroup (Pair' a b) Source # | |
(Monoid a, Monoid b) => Monoid (Pair' a b) Source # | |
A reified Monoid
.
A reified Semigroup
.
The shape of a foldMap
An a |
Box a |
newtype FreeMonoid a Source #
FreeMonoid | |
|
Functor FreeMonoid Source # | |
Foldable FreeMonoid Source # | |
Cosieve M FreeMonoid # | |
MonadReader (FreeMonoid a) (M a) # | |
foldDeRef :: forall f a. (MuRef1 f, Bifoldable (DeRef1 f)) => f a -> FreeMonoid a Source #
newtype FreeSemigroup a Source #
FreeSemigroup | |
|
foldDeRef1 :: forall f a. (MuRef1 f, Bifoldable1 (DeRef1 f)) => f a -> FreeSemigroup a Source #