Safe Haskell | Safe-Inferred |
---|---|

Language | Haskell2010 |

This module contains strict versions of some standard data structures.

# Documentation

Strict list type.

#### Instances

Functor List Source # | |

Foldable List Source # | |

Defined in Rattus.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 # |

listToMaybe' :: List a -> Maybe' a Source #

Strict pair type.

!a :* !b infixr 2 |