Copyright | ©2020 James Alexander Feldman-Crough |
---|---|
License | MPL-2.0 |
Maintainer | alex@fldcr.com |
Safe Haskell | Safe |
Language | Haskell2010 |
Documentation
A newtype wrapper around an unordered collection of unique elements.
Currently, this is implemented as a wrapper around a HashSet
.
Instances
Foldable Set Source # | |
Defined in Prosidy.Types.Set fold :: Monoid m => Set m -> m # foldMap :: Monoid m => (a -> m) -> Set a -> m # foldMap' :: Monoid m => (a -> m) -> Set a -> m # foldr :: (a -> b -> b) -> b -> Set a -> b # foldr' :: (a -> b -> b) -> b -> Set a -> b # foldl :: (b -> a -> b) -> b -> Set a -> b # foldl' :: (b -> a -> b) -> b -> Set a -> b # foldr1 :: (a -> a -> a) -> Set a -> a # foldl1 :: (a -> a -> a) -> Set a -> a # elem :: Eq a => a -> Set a -> Bool # maximum :: Ord a => Set a -> a # | |
Eq a => Eq (Set a) Source # | |
Show a => Show (Set a) Source # | |
Generic (Set a) Source # | |
(Hashable a, Eq a) => Semigroup (Set a) Source # | |
(Hashable a, Eq a) => Monoid (Set a) Source # | |
Hashable a => Hashable (Set a) Source # | |
Defined in Prosidy.Types.Set | |
(Hashable a, Eq a, ToJSONKey a) => ToJSON (Set a) Source # | |
Defined in Prosidy.Internal.JSON | |
(Hashable a, Eq a, FromJSONKey a) => FromJSON (Set a) Source # | |
(Eq a, Hashable a, Binary a) => Binary (Set a) Source # | |
NFData a => NFData (Set a) Source # | |
Defined in Prosidy.Types.Set | |
Pretty a => Pretty (Set a) Source # | |
Defined in Prosidy.Types.Set | |
type Rep (Set a) Source # | |
Defined in Prosidy.Types.Set |