Safe Haskell | Trustworthy |
---|---|
Language | Haskell2010 |
Refer to the documentation for Data.IntSet.
Synopsis
- newtype EnumSet k = EnumSet {}
- (\\) :: forall k. EnumSet k -> EnumSet k -> EnumSet k
- null :: forall k. EnumSet k -> Bool
- size :: forall k. EnumSet k -> Int
- member :: forall k. Enum k => k -> EnumSet k -> Bool
- notMember :: forall k. Enum k => k -> EnumSet k -> Bool
- lookupLT :: forall k. Enum k => k -> EnumSet k -> Maybe k
- lookupGT :: forall k. Enum k => k -> EnumSet k -> Maybe k
- lookupLE :: forall k. Enum k => k -> EnumSet k -> Maybe k
- lookupGE :: forall k. Enum k => k -> EnumSet k -> Maybe k
- isSubsetOf :: forall k. EnumSet k -> EnumSet k -> Bool
- isProperSubsetOf :: forall k. EnumSet k -> EnumSet k -> Bool
- empty :: forall k. EnumSet k
- singleton :: forall k. Enum k => k -> EnumSet k
- insert :: forall k. Enum k => k -> EnumSet k -> EnumSet k
- delete :: forall k. Enum k => k -> EnumSet k -> EnumSet k
- union :: forall k. EnumSet k -> EnumSet k -> EnumSet k
- unions :: forall k (f :: Type -> Type). (Functor f, Foldable f) => f (EnumSet k) -> EnumSet k
- difference :: forall k. EnumSet k -> EnumSet k -> EnumSet k
- intersection :: forall k. EnumSet k -> EnumSet k -> EnumSet k
- filter :: forall k. Enum k => (k -> Bool) -> EnumSet k -> EnumSet k
- partition :: forall k. Enum k => (k -> Bool) -> EnumSet k -> (EnumSet k, EnumSet k)
- split :: forall k. Enum k => k -> EnumSet k -> (EnumSet k, EnumSet k)
- splitMember :: forall k. Enum k => k -> EnumSet k -> (EnumSet k, Bool, EnumSet k)
- map :: forall k k'. (Enum k, Enum k') => (k -> k') -> EnumSet k -> EnumSet k'
- foldr :: forall k (b :: Type). Enum k => (k -> b -> b) -> b -> EnumSet k -> b
- foldl :: forall k (a :: Type). Enum k => (a -> k -> a) -> a -> EnumSet k -> a
- foldr' :: forall k (b :: Type). Enum k => (k -> b -> b) -> b -> EnumSet k -> b
- foldl' :: forall k (a :: Type). Enum k => (a -> k -> a) -> a -> EnumSet k -> a
- findMin :: forall k. Enum k => EnumSet k -> k
- findMax :: forall k. Enum k => EnumSet k -> k
- deleteMin :: forall k. EnumSet k -> EnumSet k
- deleteMax :: forall k. EnumSet k -> EnumSet k
- deleteFindMin :: forall k. Enum k => EnumSet k -> (k, EnumSet k)
- deleteFindMax :: forall k. Enum k => EnumSet k -> (k, EnumSet k)
- maxView :: forall k. Enum k => EnumSet k -> Maybe (k, EnumSet k)
- minView :: forall k. Enum k => EnumSet k -> Maybe (k, EnumSet k)
- elems :: forall k. Enum k => EnumSet k -> [k]
- toList :: forall k. Enum k => EnumSet k -> [k]
- fromList :: forall k. Enum k => [k] -> EnumSet k
- toAscList :: forall k. Enum k => EnumSet k -> [k]
- toDescList :: forall k. Enum k => EnumSet k -> [k]
- fromAscList :: forall k. Enum k => [k] -> EnumSet k
- fromDistinctAscList :: forall k. Enum k => [k] -> EnumSet k
- showTree :: forall k. EnumSet k -> String
- showTreeWith :: forall k. Bool -> Bool -> EnumSet k -> String
Documentation
Instances
Eq (EnumSet k) Source # | |
Data k => Data (EnumSet k) Source # | |
Defined in Data.EnumSet 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 | |
(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 |
Operators
Query
Construction
Combine
unions :: forall k (f :: Type -> Type). (Functor f, Foldable f) => f (EnumSet k) -> EnumSet k Source #
Filter
Map
Folds
Strict folds
Min/Max
Conversion: List
Conversion: Ordered list
toDescList :: forall k. Enum k => EnumSet k -> [k] Source #
fromAscList :: forall k. Enum k => [k] -> EnumSet k Source #
fromDistinctAscList :: forall k. Enum k => [k] -> EnumSet k Source #