enummaps-0.6.2.1.4: Enum wrappers for IntMap and IntSet

Safe HaskellNone
LanguageHaskell2010

Data.EnumMap.Strict

Contents

Description

 
Synopsis

Map type

newtype EnumMap k a Source #

Constructors

EnumMap 

Fields

Instances
Functor (EnumMap k) Source # 
Instance details

Defined in Data.EnumMap.Wrapper

Methods

fmap :: (a -> b) -> EnumMap k a -> EnumMap k b #

(<$) :: a -> EnumMap k b -> EnumMap k a #

Foldable (EnumMap k) Source # 
Instance details

Defined in Data.EnumMap.Wrapper

Methods

fold :: Monoid m => EnumMap k m -> m #

foldMap :: Monoid m => (a -> m) -> EnumMap k a -> m #

foldr :: (a -> b -> b) -> b -> EnumMap k a -> b #

foldr' :: (a -> b -> b) -> b -> EnumMap k a -> b #

foldl :: (b -> a -> b) -> b -> EnumMap k a -> b #

foldl' :: (b -> a -> b) -> b -> EnumMap k a -> b #

foldr1 :: (a -> a -> a) -> EnumMap k a -> a #

foldl1 :: (a -> a -> a) -> EnumMap k a -> a #

toList :: EnumMap k a -> [a] #

null :: EnumMap k a -> Bool #

length :: EnumMap k a -> Int #

elem :: Eq a => a -> EnumMap k a -> Bool #

maximum :: Ord a => EnumMap k a -> a #

minimum :: Ord a => EnumMap k a -> a #

sum :: Num a => EnumMap k a -> a #

product :: Num a => EnumMap k a -> a #

Traversable (EnumMap k) Source # 
Instance details

Defined in Data.EnumMap.Wrapper

Methods

traverse :: Applicative f => (a -> f b) -> EnumMap k a -> f (EnumMap k b) #

sequenceA :: Applicative f => EnumMap k (f a) -> f (EnumMap k a) #

mapM :: Monad m => (a -> m b) -> EnumMap k a -> m (EnumMap k b) #

sequence :: Monad m => EnumMap k (m a) -> m (EnumMap k a) #

Eq1 (EnumMap k) Source # 
Instance details

Defined in Data.EnumMap.Wrapper

Methods

liftEq :: (a -> b -> Bool) -> EnumMap k a -> EnumMap k b -> Bool #

Ord1 (EnumMap k) Source # 
Instance details

Defined in Data.EnumMap.Wrapper

Methods

liftCompare :: (a -> b -> Ordering) -> EnumMap k a -> EnumMap k b -> Ordering #

Read1 (EnumMap k) Source # 
Instance details

Defined in Data.EnumMap.Wrapper

Methods

liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (EnumMap k a) #

liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [EnumMap k a] #

liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (EnumMap k a) #

liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [EnumMap k a] #

Show1 (EnumMap k) Source # 
Instance details

Defined in Data.EnumMap.Wrapper

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> EnumMap k a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [EnumMap k a] -> ShowS #

IsList (EnumMap k a) Source # 
Instance details

Defined in Data.EnumMap.Wrapper

Associated Types

type Item (EnumMap k a) :: Type #

Methods

fromList :: [Item (EnumMap k a)] -> EnumMap k a #

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

toList :: EnumMap k a -> [Item (EnumMap k a)] #

Eq a => Eq (EnumMap k a) Source # 
Instance details

Defined in Data.EnumMap.Wrapper

Methods

(==) :: EnumMap k a -> EnumMap k a -> Bool #

(/=) :: EnumMap k a -> EnumMap k a -> Bool #

(Data k, Data a) => Data (EnumMap k a) Source # 
Instance details

Defined in Data.EnumMap.Wrapper

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> EnumMap k a -> c (EnumMap k a) #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (EnumMap k a) #

toConstr :: EnumMap k a -> Constr #

dataTypeOf :: EnumMap k a -> DataType #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (EnumMap k a)) #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (EnumMap k a)) #

gmapT :: (forall b. Data b => b -> b) -> EnumMap k a -> EnumMap k a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> EnumMap k a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> EnumMap k a -> r #

gmapQ :: (forall d. Data d => d -> u) -> EnumMap k a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> EnumMap k a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> EnumMap k a -> m (EnumMap k a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> EnumMap k a -> m (EnumMap k a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> EnumMap k a -> m (EnumMap k a) #

Ord a => Ord (EnumMap k a) Source # 
Instance details

Defined in Data.EnumMap.Wrapper

Methods

compare :: EnumMap k a -> EnumMap k a -> Ordering #

(<) :: EnumMap k a -> EnumMap k a -> Bool #

(<=) :: EnumMap k a -> EnumMap k a -> Bool #

(>) :: EnumMap k a -> EnumMap k a -> Bool #

(>=) :: EnumMap k a -> EnumMap k a -> Bool #

max :: EnumMap k a -> EnumMap k a -> EnumMap k a #

min :: EnumMap k a -> EnumMap k a -> EnumMap k a #

Read a => Read (EnumMap k a) Source # 
Instance details

Defined in Data.EnumMap.Wrapper

Show a => Show (EnumMap k a) Source # 
Instance details

Defined in Data.EnumMap.Wrapper

Methods

showsPrec :: Int -> EnumMap k a -> ShowS #

show :: EnumMap k a -> String #

showList :: [EnumMap k a] -> ShowS #

Semigroup (EnumMap k a) Source # 
Instance details

Defined in Data.EnumMap.Wrapper

Methods

(<>) :: EnumMap k a -> EnumMap k a -> EnumMap k a #

sconcat :: NonEmpty (EnumMap k a) -> EnumMap k a #

stimes :: Integral b => b -> EnumMap k a -> EnumMap k a #

Monoid (EnumMap k a) Source # 
Instance details

Defined in Data.EnumMap.Wrapper

Methods

mempty :: EnumMap k a #

mappend :: EnumMap k a -> EnumMap k a -> EnumMap k a #

mconcat :: [EnumMap k a] -> EnumMap k a #

NFData a => NFData (EnumMap k a) Source # 
Instance details

Defined in Data.EnumMap.Wrapper

Methods

rnf :: EnumMap k a -> () #

type Item (EnumMap k a) Source # 
Instance details

Defined in Data.EnumMap.Wrapper

type Item (EnumMap k a) = Item (IntMap a)

Construction

empty :: forall k a. EnumMap k a Source #

singleton :: forall k a. Enum k => k -> a -> EnumMap k a Source #

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

From Unordered Lists

fromList :: Enum k => [(k, a)] -> EnumMap k a Source #

fromListWith :: Enum k => (a -> a -> a) -> [(k, a)] -> EnumMap k a Source #

fromListWithKey :: Enum k => (k -> a -> a -> a) -> [(k, a)] -> EnumMap k a Source #

From Ascending Lists

fromAscList :: Enum k => [(k, a)] -> EnumMap k a Source #

fromAscListWith :: Enum k => (a -> a -> a) -> [(k, a)] -> EnumMap k a Source #

fromAscListWithKey :: Enum k => (k -> a -> a -> a) -> [(k, a)] -> EnumMap k a Source #

fromDistinctAscList :: Enum k => [(k, a)] -> EnumMap k a Source #

Insertion

insert :: forall k a. Enum k => k -> a -> EnumMap k a -> EnumMap k a Source #

insertWith :: Enum k => (a -> a -> a) -> k -> a -> EnumMap k a -> EnumMap k a Source #

insertWithKey :: Enum k => (k -> a -> a -> a) -> k -> a -> EnumMap k a -> EnumMap k a Source #

insertLookupWithKey :: Enum k => (k -> a -> a -> a) -> k -> a -> EnumMap k a -> (Maybe a, EnumMap k a) Source #

Deletion/Update

delete :: forall k a. Enum k => k -> EnumMap k a -> EnumMap k a Source #

adjust :: Enum k => (a -> a) -> k -> EnumMap k a -> EnumMap k a Source #

adjustWithKey :: Enum k => (k -> a -> a) -> k -> EnumMap k a -> EnumMap k a Source #

update :: Enum k => (a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a Source #

updateWithKey :: Enum k => (k -> a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a Source #

updateLookupWithKey :: Enum k => (k -> a -> Maybe a) -> k -> EnumMap k a -> (Maybe a, EnumMap k a) Source #

alter :: Enum k => (Maybe a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a Source #

alterF :: (Enum k, Functor f) => (Maybe a -> f (Maybe a)) -> k -> EnumMap k a -> f (EnumMap k a) Source #

Query

Lookup

lookup :: forall k a. Enum k => k -> EnumMap k a -> Maybe a Source #

(!?) :: Enum k => EnumMap k a -> k -> Maybe a infixl 9 Source #

(!) :: Enum k => EnumMap k a -> k -> a Source #

findWithDefault :: Enum k => a -> k -> EnumMap k a -> a Source #

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

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

lookupLT :: forall k a. Enum k => k -> EnumMap k a -> Maybe (k, a) Source #

lookupGT :: forall k a. Enum k => k -> EnumMap k a -> Maybe (k, a) Source #

lookupLE :: forall k a. Enum k => k -> EnumMap k a -> Maybe (k, a) Source #

lookupGE :: forall k a. Enum k => k -> EnumMap k a -> Maybe (k, a) Source #

Size

null :: forall k a. EnumMap k a -> Bool Source #

size :: forall k a. EnumMap k a -> Int Source #

Combine

Union

union :: forall k a. EnumMap k a -> EnumMap k a -> EnumMap k a Source #

unionWith :: forall k a. (a -> a -> a) -> EnumMap k a -> EnumMap k a -> EnumMap k a Source #

unionWithKey :: Enum k => (k -> a -> a -> a) -> EnumMap k a -> EnumMap k a -> EnumMap k a Source #

unions :: forall f k a. (Foldable f, Coercible (f (IntMap a)) (f (EnumMap k a))) => f (EnumMap k a) -> EnumMap k a Source #

unionsWith :: forall f k a. (Foldable f, Coercible (f (IntMap a)) (f (EnumMap k a))) => (a -> a -> a) -> f (EnumMap k a) -> EnumMap k a Source #

Difference

difference :: forall k a b. EnumMap k a -> EnumMap k b -> EnumMap k a Source #

(\\) :: forall k a b. EnumMap k a -> EnumMap k b -> EnumMap k a infixl 9 Source #

differenceWith :: forall k a b. (a -> b -> Maybe a) -> EnumMap k a -> EnumMap k b -> EnumMap k a Source #

differenceWithKey :: Enum k => (k -> a -> b -> Maybe a) -> EnumMap k a -> EnumMap k b -> EnumMap k a Source #

Intersection

intersection :: forall k a b. EnumMap k a -> EnumMap k b -> EnumMap k a Source #

intersectionWith :: forall k a b c. (a -> b -> c) -> EnumMap k a -> EnumMap k b -> EnumMap k c Source #

intersectionWithKey :: Enum k => (k -> a -> b -> c) -> EnumMap k a -> EnumMap k b -> EnumMap k c Source #

Disjoint

disjoint :: forall k a b. EnumMap k a -> EnumMap k b -> Bool Source #

Universal combining function

mergeWithKey :: Enum k => (k -> a -> b -> Maybe c) -> (EnumMap k a -> EnumMap k c) -> (EnumMap k b -> EnumMap k c) -> EnumMap k a -> EnumMap k b -> EnumMap k c Source #

Traversal

Map

map :: forall k a b. (a -> b) -> EnumMap k a -> EnumMap k b Source #

mapWithKey :: Enum k => (k -> a -> b) -> EnumMap k a -> EnumMap k b Source #

traverseWithKey :: (Enum k, Applicative t) => (k -> a -> t b) -> EnumMap k a -> t (EnumMap k b) Source #

mapAccum :: forall k a b c. (a -> b -> (a, c)) -> a -> EnumMap k b -> (a, EnumMap k c) Source #

mapAccumWithKey :: Enum k => (a -> k -> b -> (a, c)) -> a -> EnumMap k b -> (a, EnumMap k c) Source #

mapAccumRWithKey :: Enum k => (a -> k -> b -> (a, c)) -> a -> EnumMap k b -> (a, EnumMap k c) Source #

mapKeys :: forall k1 k2 a. (Enum k1, Enum k2) => (k1 -> k2) -> EnumMap k1 a -> EnumMap k2 a Source #

mapKeysWith :: (Enum k1, Enum k2) => (a -> a -> a) -> (k1 -> k2) -> EnumMap k1 a -> EnumMap k2 a Source #

mapKeysMonotonic :: forall k1 k2 a. (Enum k1, Enum k2) => (k1 -> k2) -> EnumMap k1 a -> EnumMap k2 a Source #

Folds

foldr :: forall k a b. (a -> b -> b) -> b -> EnumMap k a -> b Source #

foldl :: forall k a b. (a -> b -> a) -> a -> EnumMap k b -> a Source #

foldrWithKey :: Enum k => (k -> a -> b -> b) -> b -> EnumMap k a -> b Source #

foldlWithKey :: Enum k => (a -> k -> b -> a) -> a -> EnumMap k b -> a Source #

foldMapWithKey :: (Enum k, Monoid m) => (k -> a -> m) -> EnumMap k a -> m Source #

Strict folds

foldr' :: forall k a b. (a -> b -> b) -> b -> EnumMap k a -> b Source #

foldl' :: forall k a b. (a -> b -> a) -> a -> EnumMap k b -> a Source #

foldrWithKey' :: Enum k => (k -> a -> b -> b) -> b -> EnumMap k a -> b Source #

foldlWithKey' :: Enum k => (a -> k -> b -> a) -> a -> EnumMap k b -> a Source #

Conversion

elems :: forall k a. EnumMap k a -> [a] Source #

keys :: forall k a. Enum k => EnumMap k a -> [k] Source #

assocs :: forall k a. Enum k => EnumMap k a -> [(k, a)] Source #

keysSet :: forall k a. EnumMap k a -> EnumSet k Source #

Lists

toList :: forall k a. Enum k => EnumMap k a -> [(k, a)] Source #

Ordered lists

toAscList :: forall k a. Enum k => EnumMap k a -> [(k, a)] Source #

toDescList :: forall k a. Enum k => EnumMap k a -> [(k, a)] Source #

Filter

filter :: forall k a. (a -> Bool) -> EnumMap k a -> EnumMap k a Source #

filterWithKey :: Enum k => (k -> a -> Bool) -> EnumMap k a -> EnumMap k a Source #

restrictKeys :: forall k a. EnumMap k a -> EnumSet k -> EnumMap k a Source #

withoutKeys :: forall k a. EnumMap k a -> EnumSet k -> EnumMap k a Source #

partition :: forall k a. (a -> Bool) -> EnumMap k a -> (EnumMap k a, EnumMap k a) Source #

partitionWithKey :: Enum k => (k -> a -> Bool) -> EnumMap k a -> (EnumMap k a, EnumMap k a) Source #

mapMaybe :: forall k a b. (a -> Maybe b) -> EnumMap k a -> EnumMap k b Source #

mapMaybeWithKey :: Enum k => (k -> a -> Maybe b) -> EnumMap k a -> EnumMap k b Source #

mapEither :: forall k a b c. (a -> Either b c) -> EnumMap k a -> (EnumMap k b, EnumMap k c) Source #

mapEitherWithKey :: Enum k => (k -> a -> Either b c) -> EnumMap k a -> (EnumMap k b, EnumMap k c) Source #

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

splitLookup :: forall k a. Enum k => k -> EnumMap k a -> (EnumMap k a, Maybe a, EnumMap k a) Source #

splitRoot :: forall k a. EnumMap k a -> [EnumMap k a] Source #

Submap

isSubmapOf :: forall k a. Eq a => EnumMap k a -> EnumMap k a -> Bool Source #

isSubmapOfBy :: forall k a b. (a -> b -> Bool) -> EnumMap k a -> EnumMap k b -> Bool Source #

isProperSubmapOf :: forall k a. Eq a => EnumMap k a -> EnumMap k a -> Bool Source #

isProperSubmapOfBy :: forall k a b. (a -> b -> Bool) -> EnumMap k a -> EnumMap k b -> Bool Source #

Min/Max

lookupMin :: forall k a. Enum k => EnumMap k a -> Maybe (k, a) Source #

lookupMax :: forall k a. Enum k => EnumMap k a -> Maybe (k, a) Source #

findMin :: forall k a. Enum k => EnumMap k a -> (k, a) Source #

findMax :: forall k a. Enum k => EnumMap k a -> (k, a) Source #

deleteMin :: forall k a. EnumMap k a -> EnumMap k a Source #

deleteMax :: forall k a. EnumMap k a -> EnumMap k a Source #

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

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

updateMin :: forall k a. (a -> Maybe a) -> EnumMap k a -> EnumMap k a Source #

updateMax :: forall k a. (a -> Maybe a) -> EnumMap k a -> EnumMap k a Source #

updateMinWithKey :: Enum k => (k -> a -> Maybe a) -> EnumMap k a -> EnumMap k a Source #

updateMaxWithKey :: Enum k => (k -> a -> Maybe a) -> EnumMap k a -> EnumMap k a Source #

minView :: forall k a. EnumMap k a -> Maybe (a, EnumMap k a) Source #

maxView :: forall k a. EnumMap k a -> Maybe (a, EnumMap k a) Source #

minViewWithKey :: forall k a. Enum k => EnumMap k a -> Maybe ((k, a), EnumMap k a) Source #

maxViewWithKey :: forall k a. Enum k => EnumMap k a -> Maybe ((k, a), EnumMap k a) Source #