Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
This module contains strict versions of some standard data structures.
Synopsis
- data List a
- singleton :: a -> List a
- fromList :: [a] -> List a
- toList :: List a -> [a]
- init' :: List a -> List a
- reverse' :: List a -> List a
- (+++) :: List a -> List a -> List a
- listToMaybe' :: List a -> Maybe' a
- map' :: (a -> b) -> List a -> List b
- zip' :: List a -> List b -> List (a :* b)
- zipWith' :: (a -> b -> c) -> List a -> List b -> List c
- mapMaybe' :: (a -> Maybe' b) -> List a -> List b
- data a :* b = !a :* !b
- data Maybe' a
- maybe' :: b -> (a -> b) -> Maybe' a -> b
- fromMaybe' :: a -> Maybe' a -> a
- fst' :: (a :* b) -> a
- snd' :: (a :* b) -> b
- curry' :: ((a :* b) -> c) -> a -> b -> c
- uncurry' :: (a -> b -> c) -> (a :* b) -> c
Documentation
Strict list type.
Instances
Foldable List Source # | |
Defined in AsyncRattus.Strict fold :: Monoid m => List m -> m # foldMap :: Monoid m => (a -> m) -> List a -> m # foldMap' :: Monoid m => (a -> m) -> List a -> m # foldr :: (a -> b -> b) -> b -> List a -> b # foldr' :: (a -> b -> b) -> b -> List a -> b # foldl :: (b -> a -> b) -> b -> List a -> b # foldl' :: (b -> a -> b) -> b -> List a -> b # foldr1 :: (a -> a -> a) -> List a -> a # foldl1 :: (a -> a -> a) -> List a -> a # elem :: Eq a => a -> List a -> Bool # maximum :: Ord a => List a -> a # | |
Functor List Source # | |
Show a => Show (List a) Source # | |
Eq a => Eq (List a) Source # | |
init' :: List a -> List a Source #
Remove the last element from a list if there is one, otherwise
return Nil
.
listToMaybe' :: List a -> Maybe' a Source #
Strict pair type.
!a :* !b infixr 2 |
fromMaybe' :: a -> Maybe' a -> a Source #