| Copyright | (c) 2011-2019 Michal Terepeta (c) 2019-2022 Mikolaj Konarski and others (see git history)  | 
|---|---|
| License | BSD3 | 
| Maintainer | mikolaj.konarski@funktory.com | 
| Stability | alpha | 
| Portability | uses DeriveDataTypeable and GeneralizedNewtypeDeriving | 
| Safe Haskell | Safe-Inferred | 
| Language | Haskell2010 | 
Data.EnumSet
Description
Synopsis
- data EnumSet k
 - intSetToEnumSet :: IntSet -> EnumSet k
 - enumSetToIntSet :: EnumSet k -> IntSet
 - (\\) :: EnumSet k -> EnumSet k -> EnumSet k
 - null :: EnumSet k -> Bool
 - size :: EnumSet k -> Int
 - member :: Enum k => k -> EnumSet k -> Bool
 - notMember :: Enum k => k -> EnumSet k -> Bool
 - lookupLT :: Enum k => k -> EnumSet k -> Maybe k
 - lookupGT :: Enum k => k -> EnumSet k -> Maybe k
 - lookupLE :: Enum k => k -> EnumSet k -> Maybe k
 - lookupGE :: Enum k => k -> EnumSet k -> Maybe k
 - isSubsetOf :: EnumSet k -> EnumSet k -> Bool
 - isProperSubsetOf :: EnumSet k -> EnumSet k -> Bool
 - empty :: EnumSet k
 - singleton :: Enum k => k -> EnumSet k
 - insert :: Enum k => k -> EnumSet k -> EnumSet k
 - delete :: Enum k => k -> EnumSet k -> EnumSet k
 - union :: EnumSet k -> EnumSet k -> EnumSet k
 - unions :: [EnumSet k] -> EnumSet k
 - difference :: EnumSet k -> EnumSet k -> EnumSet k
 - intersection :: EnumSet k -> EnumSet k -> EnumSet k
 - filter :: Enum k => (k -> Bool) -> EnumSet k -> EnumSet k
 - partition :: Enum k => (k -> Bool) -> EnumSet k -> (EnumSet k, EnumSet k)
 - split :: Enum k => k -> EnumSet k -> (EnumSet k, EnumSet k)
 - splitMember :: Enum k => k -> EnumSet k -> (EnumSet k, Bool, EnumSet k)
 - map :: Enum k => (k -> k) -> EnumSet k -> EnumSet k
 - foldr :: Enum k => (k -> b -> b) -> b -> EnumSet k -> b
 - foldl :: Enum k => (a -> k -> a) -> a -> EnumSet k -> a
 - foldr' :: Enum k => (k -> b -> b) -> b -> EnumSet k -> b
 - foldl' :: Enum k => (a -> k -> a) -> a -> EnumSet k -> a
 - fold :: Enum k => (k -> b -> b) -> b -> EnumSet k -> b
 - findMin :: Enum k => EnumSet k -> k
 - findMax :: Enum k => EnumSet k -> k
 - deleteMin :: EnumSet k -> EnumSet k
 - deleteMax :: EnumSet k -> EnumSet k
 - deleteFindMin :: Enum k => EnumSet k -> (k, EnumSet k)
 - deleteFindMax :: Enum k => EnumSet k -> (k, EnumSet k)
 - maxView :: Enum k => EnumSet k -> Maybe (k, EnumSet k)
 - minView :: Enum k => EnumSet k -> Maybe (k, EnumSet k)
 - elems :: Enum k => EnumSet k -> [k]
 - toList :: Enum k => EnumSet k -> [k]
 - fromList :: Enum k => [k] -> EnumSet k
 - toAscList :: Enum k => EnumSet k -> [k]
 - toDescList :: Enum k => EnumSet k -> [k]
 - fromAscList :: Enum k => [k] -> EnumSet k
 - fromDistinctAscList :: Enum k => [k] -> EnumSet k
 
Documentation
Instances
| FromJSON a => FromJSON (EnumSet a) Source # | |
| ToJSON (EnumSet a) Source # | |
Defined in Data.EnumSet  | |
| Monoid (EnumSet k) Source # | |
| Semigroup (EnumSet k) Source # | |
| (Enum k, Read k) => Read (EnumSet k) Source # | |
| (Enum k, Show k) => Show (EnumSet k) Source # | |
| NFData (EnumSet k) Source # | |
Defined in Data.EnumSet  | |
| Eq (EnumSet k) Source # | |
| Ord (EnumSet k) Source # | |
Wrapping/unwrapping
Operators
Query
Construction
Combine
Filter
Map
Folds
Strict folds
Legacy folds
Min/Max
Conversion
List
Ordered list
toDescList :: Enum k => EnumSet k -> [k] Source #
fromAscList :: Enum k => [k] -> EnumSet k Source #
fromDistinctAscList :: Enum k => [k] -> EnumSet k Source #