Safe Haskell	Safe-Inferred
Language	Haskell2010

Fresnel.Monoid.Fork

Contents

Binary trees
Construction

Synopsis

newtype Fork a = Fork {
- runFork :: forall r. (r -> r -> r) -> (a -> r) -> r -> r
}
singleton :: a -> Fork a

Binary trees

newtype Fork a Source #

Constructors

Fork
Fields runFork :: forall r. (r -> r -> r) -> (a -> r) -> r -> r

Instances

Instances details

Functor Fork Source #
Instance details Defined in Fresnel.Monoid.Fork Methods fmap :: (a -> b) -> Fork a -> Fork b # (<$) :: a -> Fork b -> Fork a #
Applicative Fork Source #
Instance details Defined in Fresnel.Monoid.Fork Methods pure :: a -> Fork a # (<>) :: Fork (a -> b) -> Fork a -> Fork b # liftA2 :: (a -> b -> c) -> Fork a -> Fork b -> Fork c # (>) :: Fork a -> Fork b -> Fork b # (<*) :: Fork a -> Fork b -> Fork a #
Foldable Fork Source #
Instance details Defined in Fresnel.Monoid.Fork Methods fold :: Monoid m => Fork m -> m # foldMap :: Monoid m => (a -> m) -> Fork a -> m # foldMap' :: Monoid m => (a -> m) -> Fork a -> m # foldr :: (a -> b -> b) -> b -> Fork a -> b # foldr' :: (a -> b -> b) -> b -> Fork a -> b # foldl :: (b -> a -> b) -> b -> Fork a -> b # foldl' :: (b -> a -> b) -> b -> Fork a -> b # foldr1 :: (a -> a -> a) -> Fork a -> a # foldl1 :: (a -> a -> a) -> Fork a -> a # toList :: Fork a -> [a] # null :: Fork a -> Bool # length :: Fork a -> Int # elem :: Eq a => a -> Fork a -> Bool # maximum :: Ord a => Fork a -> a # minimum :: Ord a => Fork a -> a # sum :: Num a => Fork a -> a # product :: Num a => Fork a -> a #
Alternative Fork Source #
Instance details Defined in Fresnel.Monoid.Fork Methods empty :: Fork a # (<\|>) :: Fork a -> Fork a -> Fork a # some :: Fork a -> Fork [a] # many :: Fork a -> Fork [a] #
Show a => Show (Fork a) Source #
Instance details Defined in Fresnel.Monoid.Fork Methods showsPrec :: Int -> Fork a -> ShowS # show :: Fork a -> String # showList :: [Fork a] -> ShowS #
Semigroup (Fork a) Source #
Instance details Defined in Fresnel.Monoid.Fork Methods (<>) :: Fork a -> Fork a -> Fork a # sconcat :: NonEmpty (Fork a) -> Fork a # stimes :: Integral b => b -> Fork a -> Fork a #
Monoid (Fork a) Source #
Instance details Defined in Fresnel.Monoid.Fork Methods mempty :: Fork a # mappend :: Fork a -> Fork a -> Fork a # mconcat :: [Fork a] -> Fork a #

Construction

singleton :: a -> Fork a Source #