Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- newtype EnumSet k = EnumSet {}
- empty :: EnumSet k
- singleton :: Enum k => k -> EnumSet k
- fromList :: Enum k => [k] -> EnumSet k
- fromAscList :: Enum k => [k] -> EnumSet k
- fromDistinctAscList :: Enum k => [k] -> EnumSet k
- insert :: Enum k => k -> EnumSet k -> EnumSet k
- delete :: Enum k => k -> EnumSet k -> EnumSet k
- 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
- null :: EnumSet k -> Bool
- size :: EnumSet k -> Int
- isSubsetOf :: EnumSet k -> EnumSet k -> Bool
- isProperSubsetOf :: EnumSet k -> EnumSet k -> Bool
- disjoint :: EnumSet k -> EnumSet k -> Bool
- union :: EnumSet k -> EnumSet k -> EnumSet k
- unions :: forall f k. (Foldable f, Coercible (f IntSet) (f (EnumSet k))) => f (EnumSet k) -> EnumSet k
- difference :: EnumSet k -> EnumSet k -> EnumSet k
- (\\) :: 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)
- splitRoot :: EnumSet k -> [EnumSet k]
- map :: (Enum k1, Enum k2) => (k1 -> k2) -> EnumSet k1 -> EnumSet k2
- 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 :: Enum k => 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]
- toAscList :: Enum k => EnumSet k -> [k]
- toDescList :: Enum k => EnumSet k -> [k]
Set type
Instances
IsList (EnumSet k) Source # | |
Eq (EnumSet k) Source # | |
Data k => Data (EnumSet k) Source # | |
Defined in Data.EnumSet.Wrapper gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> EnumSet k -> c (EnumSet k) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (EnumSet k) # toConstr :: EnumSet k -> Constr # dataTypeOf :: EnumSet k -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (EnumSet k)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (EnumSet k)) # gmapT :: (forall b. Data b => b -> b) -> EnumSet k -> EnumSet k # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> EnumSet k -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> EnumSet k -> r # gmapQ :: (forall d. Data d => d -> u) -> EnumSet k -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> EnumSet k -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> EnumSet k -> m (EnumSet k) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> EnumSet k -> m (EnumSet k) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> EnumSet k -> m (EnumSet k) # | |
Ord (EnumSet k) Source # | |
Defined in Data.EnumSet.Wrapper | |
(Enum k, Read k) => Read (EnumSet k) Source # | |
(Enum k, Show k) => Show (EnumSet k) Source # | |
Semigroup (EnumSet k) Source # | |
Monoid (EnumSet k) Source # | |
NFData (EnumSet k) Source # | |
Defined in Data.EnumSet.Wrapper | |
type Item (EnumSet k) Source # | |
Defined in Data.EnumSet.Wrapper |
Construction
fromAscList :: Enum k => [k] -> EnumSet k Source #
fromDistinctAscList :: Enum k => [k] -> EnumSet k Source #
Insertion
Deletion
Query
Combine
unions :: forall f k. (Foldable f, Coercible (f IntSet) (f (EnumSet k))) => f (EnumSet k) -> EnumSet k Source #
Filter
Map
Folds
Strict folds
Legacy folds
Min/Max
Conversion
List
toDescList :: Enum k => EnumSet k -> [k] Source #