enummapset-th-0.6.2: TH-generated EnumSet/EnumMap wrappers around IntSet/IntMap.

Safe HaskellTrustworthy
LanguageHaskell2010

Data.EnumSet

Contents

Description

Refer to the documentation for Data.IntSet.

Synopsis

Documentation

newtype EnumSet k Source #

Constructors

EnumSet 

Fields

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

(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 -> () #

Operators

(\\) :: forall k. EnumSet k -> EnumSet k -> EnumSet k Source #

Query

null :: forall k. EnumSet k -> Bool Source #

size :: forall k. EnumSet k -> Int Source #

member :: forall k. Enum k => k -> EnumSet k -> Bool Source #

notMember :: forall k. Enum k => k -> EnumSet k -> Bool Source #

lookupLT :: forall k. Enum k => k -> EnumSet k -> Maybe k Source #

lookupGT :: forall k. Enum k => k -> EnumSet k -> Maybe k Source #

lookupLE :: forall k. Enum k => k -> EnumSet k -> Maybe k Source #

lookupGE :: forall k. Enum k => k -> EnumSet k -> Maybe k Source #

isSubsetOf :: forall k. EnumSet k -> EnumSet k -> Bool Source #

isProperSubsetOf :: forall k. EnumSet k -> EnumSet k -> Bool Source #

Construction

empty :: forall k. EnumSet k Source #

singleton :: forall k. Enum k => k -> EnumSet k Source #

insert :: forall k. Enum k => k -> EnumSet k -> EnumSet k Source #

delete :: forall k. Enum k => k -> EnumSet k -> EnumSet k Source #

Combine

union :: forall k. EnumSet k -> EnumSet k -> EnumSet k Source #

unions :: forall k (f :: Type -> Type). (Functor f, Foldable f) => f (EnumSet k) -> EnumSet k Source #

difference :: forall k. EnumSet k -> EnumSet k -> EnumSet k Source #

intersection :: forall k. EnumSet k -> EnumSet k -> EnumSet k Source #

Filter

filter :: forall k. Enum k => (k -> Bool) -> EnumSet k -> EnumSet k Source #

partition :: forall k. Enum k => (k -> Bool) -> EnumSet k -> (EnumSet k, EnumSet k) Source #

split :: forall k. Enum k => k -> EnumSet k -> (EnumSet k, EnumSet k) Source #

splitMember :: forall k. Enum k => k -> EnumSet k -> (EnumSet k, Bool, EnumSet k) Source #

Map

map :: forall k k'. (Enum k, Enum k') => (k -> k') -> EnumSet k -> EnumSet k' Source #

Folds

foldr :: forall k (b :: Type). Enum k => (k -> b -> b) -> b -> EnumSet k -> b Source #

foldl :: forall k (a :: Type). Enum k => (a -> k -> a) -> a -> EnumSet k -> a Source #

Strict folds

foldr' :: forall k (b :: Type). Enum k => (k -> b -> b) -> b -> EnumSet k -> b Source #

foldl' :: forall k (a :: Type). Enum k => (a -> k -> a) -> a -> EnumSet k -> a Source #

Min/Max

findMin :: forall k. Enum k => EnumSet k -> k Source #

findMax :: forall k. Enum k => EnumSet k -> k Source #

deleteMin :: forall k. EnumSet k -> EnumSet k Source #

deleteMax :: forall k. EnumSet k -> EnumSet k Source #

deleteFindMin :: forall k. Enum k => EnumSet k -> (k, EnumSet k) Source #

deleteFindMax :: forall k. Enum k => EnumSet k -> (k, EnumSet k) Source #

maxView :: forall k. Enum k => EnumSet k -> Maybe (k, EnumSet k) Source #

minView :: forall k. Enum k => EnumSet k -> Maybe (k, EnumSet k) Source #

Conversion: List

elems :: forall k. Enum k => EnumSet k -> [k] Source #

toList :: forall k. Enum k => EnumSet k -> [k] Source #

fromList :: forall k. Enum k => [k] -> EnumSet k Source #

Conversion: Ordered list

toAscList :: forall k. Enum k => EnumSet k -> [k] Source #

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 #

Debugging

showTree :: forall k. EnumSet k -> String Source #

showTreeWith :: forall k. Bool -> Bool -> EnumSet k -> String Source #