Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell98 |
Documentation
Instances
Foldable T Source # | |
Defined in Data.Empty fold :: Monoid m => T m -> m # foldMap :: Monoid m => (a -> m) -> T a -> m # foldMap' :: Monoid m => (a -> m) -> T a -> m # foldr :: (a -> b -> b) -> b -> T a -> b # foldr' :: (a -> b -> b) -> b -> T a -> b # foldl :: (b -> a -> b) -> b -> T a -> b # foldl' :: (b -> a -> b) -> b -> T a -> b # foldr1 :: (a -> a -> a) -> T a -> a # foldl1 :: (a -> a -> a) -> T a -> a # elem :: Eq a => a -> T a -> Bool # maximum :: Ord a => T a -> a # | |
Traversable T Source # | |
Functor T Source # | |
Arbitrary T Source # | |
Empty T Source # | |
Defined in Data.Empty | |
Gen T Source # | |
Iterate T Source # | |
Defined in Data.Empty | |
Ix T Source # | |
Defined in Data.Empty range :: Ix i => (T i, T i) -> [T i] Source # index :: Ix i => (T i, T i) -> T i -> Int Source # inRange :: Ix i => (T i, T i) -> T i -> Bool Source # rangeSize :: Ix i => (T i, T i) -> Int Source # rangeSizeIndex :: Ix i => (T i, T i) -> (Int, T i -> Int) Source # indexHorner :: Ix i => (T i, T i) -> Int -> T i -> Int Source # | |
NFData T Source # | |
Repeat T Source # | |
Defined in Data.Empty | |
Reverse T Source # | |
Show T Source # | |
Sort T Source # | |
SortBy T Source # | |
View T Source # | |
Defined in Data.Empty | |
ViewL T Source # | |
ViewR T Source # | |
Zip T Source # | |
Choose T Source # | |
Defined in Data.NonEmpty.Mixed | |
Insert T Source # | |
InsertBy T Source # | |
Arbitrary (T a) Source # | |
Ix i => Ix (T i) Source # | |
Show (T a) Source # | |
NFData (T a) Source # | |
Defined in Data.Empty | |
Eq (T a) Source # | |
Ord (T a) Source # | |