Safe Haskell	Trustworthy
Language	Haskell2010

Data.EnumSet

Contents

Operators
Query
Construction
Combine
Filter
Map
Folds
Strict folds
Min/Max
Conversion: List
Conversion: Ordered list
Debugging

Description

Refer to the documentation for Data.IntSet.

Synopsis

newtype EnumSet k = EnumSet {
- unEnumSet :: IntSet
}
(\\) :: 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

newtype EnumSet k Source #

Constructors

EnumSet
Fields unEnumSet :: IntSet

Instances

Eq (EnumSet k) Source #
Instance details Defined in Data.EnumSet Methods (==) :: EnumSet k -> EnumSet k -> Bool # (/=) :: EnumSet k -> EnumSet k -> Bool #
Data k => Data (EnumSet k) Source #
Instance details Defined in Data.EnumSet Methods 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 #
Instance details Defined in Data.EnumSet Methods compare :: EnumSet k -> EnumSet k -> Ordering # (<) :: EnumSet k -> EnumSet k -> Bool # (<=) :: EnumSet k -> EnumSet k -> Bool # (>) :: EnumSet k -> EnumSet k -> Bool # (>=) :: EnumSet k -> EnumSet k -> Bool # max :: EnumSet k -> EnumSet k -> EnumSet k # min :: EnumSet k -> EnumSet k -> EnumSet k #
(Enum k, Read k) => Read (EnumSet k) Source #
Instance details Defined in Data.EnumSet Methods readsPrec :: Int -> ReadS (EnumSet k) # readList :: ReadS [EnumSet k] # readPrec :: ReadPrec (EnumSet k) # readListPrec :: ReadPrec [EnumSet k] #
(Enum k, Show k) => Show (EnumSet k) Source #
Instance details Defined in Data.EnumSet Methods showsPrec :: Int -> EnumSet k -> ShowS # show :: EnumSet k -> String # showList :: [EnumSet k] -> ShowS #
Semigroup (EnumSet k) Source #
Instance details Defined in Data.EnumSet Methods (<>) :: EnumSet k -> EnumSet k -> EnumSet k # sconcat :: NonEmpty (EnumSet k) -> EnumSet k # stimes :: Integral b => b -> EnumSet k -> EnumSet k #
Monoid (EnumSet k) Source #
Instance details Defined in Data.EnumSet Methods mempty :: EnumSet k # mappend :: EnumSet k -> EnumSet k -> EnumSet k # mconcat :: [EnumSet k] -> EnumSet k #
NFData (EnumSet k) Source #
Instance details Defined in Data.EnumSet Methods rnf :: EnumSet k -> () #