enummaps-0.6.2.1.7: Enum wrappers for IntMap and IntSet

Safe HaskellNone
LanguageHaskell2010

Data.EnumSet

Contents

Description

 
Synopsis

Set type

newtype EnumSet k Source #

Constructors

EnumSet 

Fields

Instances
IsList (EnumSet k) Source # 
Instance details

Defined in Data.EnumSet.Wrapper

Associated Types

type Item (EnumSet k) :: Type #

Methods

fromList :: [Item (EnumSet k)] -> EnumSet k #

fromListN :: Int -> [Item (EnumSet k)] -> EnumSet k #

toList :: EnumSet k -> [Item (EnumSet k)] #

Eq (EnumSet k) Source # 
Instance details

Defined in Data.EnumSet.Wrapper

Methods

(==) :: EnumSet k -> EnumSet k -> Bool #

(/=) :: EnumSet k -> EnumSet k -> Bool #

Data k => Data (EnumSet k) Source # 
Instance details

Defined in Data.EnumSet.Wrapper

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.Wrapper

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.Wrapper

(Enum k, Show k) => Show (EnumSet k) Source # 
Instance details

Defined in Data.EnumSet.Wrapper

Methods

showsPrec :: Int -> EnumSet k -> ShowS #

show :: EnumSet k -> String #

showList :: [EnumSet k] -> ShowS #

Semigroup (EnumSet k) Source # 
Instance details

Defined in Data.EnumSet.Wrapper

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.Wrapper

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.Wrapper

Methods

rnf :: EnumSet k -> () #

type Item (EnumSet k) Source # 
Instance details

Defined in Data.EnumSet.Wrapper

type Item (EnumSet k) = Item IntSet

Construction

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

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

fromAscList :: Enum k => [k] -> EnumSet k Source #

Insertion

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

Deletion

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

Query

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

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

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

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

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

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

Combine

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

Filter

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

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

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

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

Map

map :: (Enum k1, Enum k2) => (k1 -> k2) -> EnumSet k1 -> EnumSet k2 Source #

Folds

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

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

Strict folds

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

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

Legacy folds

fold :: Enum k => (k -> b -> b) -> b -> EnumSet k -> b Source #

Min/Max

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

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

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

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

Conversion

List

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

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

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

toDescList :: Enum k => EnumSet k -> [k] Source #