Safe Haskell | None |
---|---|
Language | Haskell2010 |
Documentation
A list with O(1) size access and O(1) conversion to normal list
Instances
Foldable SList Source # | |
Defined in Data.Equality.Utils.SizedList fold :: Monoid m => SList m -> m # foldMap :: Monoid m => (a -> m) -> SList a -> m # foldMap' :: Monoid m => (a -> m) -> SList a -> m # foldr :: (a -> b -> b) -> b -> SList a -> b # foldr' :: (a -> b -> b) -> b -> SList a -> b # foldl :: (b -> a -> b) -> b -> SList a -> b # foldl' :: (b -> a -> b) -> b -> SList a -> b # foldr1 :: (a -> a -> a) -> SList a -> a # foldl1 :: (a -> a -> a) -> SList a -> a # elem :: Eq a => a -> SList a -> Bool # maximum :: Ord a => SList a -> a # minimum :: Ord a => SList a -> a # | |
Traversable SList Source # | |
Functor SList Source # | |
Monoid (SList a) Source # | |
Semigroup (SList a) Source # | |
IsList (SList a) Source # | |
type Item (SList a) Source # | |
Defined in Data.Equality.Utils.SizedList |