int-like-0.1.1: Newtype wrappers over IntSet and IntMap
Safe HaskellSafe-Inferred
LanguageHaskell2010

IntLike.Map

Documentation

newtype IntLikeMap x a Source #

Constructors

IntLikeMap 

Fields

Instances

Instances details
Foldable (IntLikeMap x) Source # 
Instance details

Defined in IntLike.Map

Methods

fold :: Monoid m => IntLikeMap x m -> m #

foldMap :: Monoid m => (a -> m) -> IntLikeMap x a -> m #

foldMap' :: Monoid m => (a -> m) -> IntLikeMap x a -> m #

foldr :: (a -> b -> b) -> b -> IntLikeMap x a -> b #

foldr' :: (a -> b -> b) -> b -> IntLikeMap x a -> b #

foldl :: (b -> a -> b) -> b -> IntLikeMap x a -> b #

foldl' :: (b -> a -> b) -> b -> IntLikeMap x a -> b #

foldr1 :: (a -> a -> a) -> IntLikeMap x a -> a #

foldl1 :: (a -> a -> a) -> IntLikeMap x a -> a #

toList :: IntLikeMap x a -> [a] #

null :: IntLikeMap x a -> Bool #

length :: IntLikeMap x a -> Int #

elem :: Eq a => a -> IntLikeMap x a -> Bool #

maximum :: Ord a => IntLikeMap x a -> a #

minimum :: Ord a => IntLikeMap x a -> a #

sum :: Num a => IntLikeMap x a -> a #

product :: Num a => IntLikeMap x a -> a #

Traversable (IntLikeMap x) Source # 
Instance details

Defined in IntLike.Map

Methods

traverse :: Applicative f => (a -> f b) -> IntLikeMap x a -> f (IntLikeMap x b) #

sequenceA :: Applicative f => IntLikeMap x (f a) -> f (IntLikeMap x a) #

mapM :: Monad m => (a -> m b) -> IntLikeMap x a -> m (IntLikeMap x b) #

sequence :: Monad m => IntLikeMap x (m a) -> m (IntLikeMap x a) #

Functor (IntLikeMap x) Source # 
Instance details

Defined in IntLike.Map

Methods

fmap :: (a -> b) -> IntLikeMap x a -> IntLikeMap x b #

(<$) :: a -> IntLikeMap x b -> IntLikeMap x a #

Monoid (IntLikeMap x a) Source # 
Instance details

Defined in IntLike.Map

Methods

mempty :: IntLikeMap x a #

mappend :: IntLikeMap x a -> IntLikeMap x a -> IntLikeMap x a #

mconcat :: [IntLikeMap x a] -> IntLikeMap x a #

Semigroup (IntLikeMap x a) Source # 
Instance details

Defined in IntLike.Map

Methods

(<>) :: IntLikeMap x a -> IntLikeMap x a -> IntLikeMap x a #

sconcat :: NonEmpty (IntLikeMap x a) -> IntLikeMap x a #

stimes :: Integral b => b -> IntLikeMap x a -> IntLikeMap x a #

Show a => Show (IntLikeMap x a) Source # 
Instance details

Defined in IntLike.Map

Methods

showsPrec :: Int -> IntLikeMap x a -> ShowS #

show :: IntLikeMap x a -> String #

showList :: [IntLikeMap x a] -> ShowS #

NFData a => NFData (IntLikeMap x a) Source # 
Instance details

Defined in IntLike.Map

Methods

rnf :: IntLikeMap x a -> () #

Eq a => Eq (IntLikeMap x a) Source # 
Instance details

Defined in IntLike.Map

Methods

(==) :: IntLikeMap x a -> IntLikeMap x a -> Bool #

(/=) :: IntLikeMap x a -> IntLikeMap x a -> Bool #

singleton :: Coercible x Int => x -> a -> IntLikeMap x a Source #

fromList :: Coercible x Int => [(x, a)] -> IntLikeMap x a Source #

member :: Coercible x Int => x -> IntLikeMap x a -> Bool Source #

toList :: Coercible x Int => IntLikeMap x a -> [(x, a)] Source #

keys :: Coercible x Int => IntLikeMap x a -> [x] Source #

elems :: IntLikeMap x a -> [a] Source #

lookup :: Coercible x Int => x -> IntLikeMap x a -> Maybe a Source #

findWithDefault :: Coercible x Int => a -> x -> IntLikeMap x a -> a Source #

insert :: Coercible x Int => x -> a -> IntLikeMap x a -> IntLikeMap x a Source #

insertWith :: Coercible x Int => (a -> a -> a) -> x -> a -> IntLikeMap x a -> IntLikeMap x a Source #

adjust :: Coercible x Int => (a -> a) -> x -> IntLikeMap x a -> IntLikeMap x a Source #

alter :: Coercible x Int => (Maybe a -> Maybe a) -> x -> IntLikeMap x a -> IntLikeMap x a Source #

delete :: Coercible x Int => x -> IntLikeMap x a -> IntLikeMap x a Source #

filter :: (a -> Bool) -> IntLikeMap x a -> IntLikeMap x a Source #

map :: (a -> b) -> IntLikeMap x a -> IntLikeMap x b Source #

insertState :: Coercible x Int => (Maybe a -> b) -> x -> a -> IntLikeMap x a -> (b, IntLikeMap x a) Source #

mapWithKey :: Coercible x Int => (x -> a -> b) -> IntLikeMap x a -> IntLikeMap x b Source #