Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Non-empty binary trees
Instances
Foldable1 Fork1 Source # | |
Defined in Fresnel.Semigroup.Fork1 fold1 :: Semigroup m => Fork1 m -> m # foldMap1 :: Semigroup m => (a -> m) -> Fork1 a -> m # foldMap1' :: Semigroup m => (a -> m) -> Fork1 a -> m # toNonEmpty :: Fork1 a -> NonEmpty a # maximum :: Ord a => Fork1 a -> a # minimum :: Ord a => Fork1 a -> a # foldrMap1 :: (a -> b) -> (a -> b -> b) -> Fork1 a -> b # foldlMap1' :: (a -> b) -> (b -> a -> b) -> Fork1 a -> b # foldlMap1 :: (a -> b) -> (b -> a -> b) -> Fork1 a -> b # foldrMap1' :: (a -> b) -> (a -> b -> b) -> Fork1 a -> b # | |
Applicative Fork1 Source # | |
Functor Fork1 Source # | |
Foldable Fork1 Source # | |
Defined in Fresnel.Semigroup.Fork1 fold :: Monoid m => Fork1 m -> m # foldMap :: Monoid m => (a -> m) -> Fork1 a -> m # foldMap' :: Monoid m => (a -> m) -> Fork1 a -> m # foldr :: (a -> b -> b) -> b -> Fork1 a -> b # foldr' :: (a -> b -> b) -> b -> Fork1 a -> b # foldl :: (b -> a -> b) -> b -> Fork1 a -> b # foldl' :: (b -> a -> b) -> b -> Fork1 a -> b # foldr1 :: (a -> a -> a) -> Fork1 a -> a # foldl1 :: (a -> a -> a) -> Fork1 a -> a # elem :: Eq a => a -> Fork1 a -> Bool # maximum :: Ord a => Fork1 a -> a # minimum :: Ord a => Fork1 a -> a # | |
Traversable Fork1 Source # | |
Alt Fork1 Source # | |
Apply Fork1 Source # | |
Semigroup (Fork1 a) Source # | |
Show a => Show (Fork1 a) Source # | |