Safe Haskell	None
Language	Haskell2010

Language.Parser.Ptera.Data.Symbolic.IntMap

Documentation

type T = IntMap Source #

type Key = Int Source #

data IntMap a Source #

Constructors

IntMap
Fields intMapStraight :: IntMap (Maybe a) intMapNegative :: Maybe a

Instances

Instances details

Functor IntMap Source #
Instance details Defined in Language.Parser.Ptera.Data.Symbolic.IntMap Methods fmap :: (a -> b) -> IntMap a -> IntMap b # (<$) :: a -> IntMap b -> IntMap a #
Foldable IntMap Source #
Instance details Defined in Language.Parser.Ptera.Data.Symbolic.IntMap Methods fold :: Monoid m => IntMap m -> m # foldMap :: Monoid m => (a -> m) -> IntMap a -> m # foldMap' :: Monoid m => (a -> m) -> IntMap a -> m # foldr :: (a -> b -> b) -> b -> IntMap a -> b # foldr' :: (a -> b -> b) -> b -> IntMap a -> b # foldl :: (b -> a -> b) -> b -> IntMap a -> b # foldl' :: (b -> a -> b) -> b -> IntMap a -> b # foldr1 :: (a -> a -> a) -> IntMap a -> a # foldl1 :: (a -> a -> a) -> IntMap a -> a # toList :: IntMap a -> [a] # null :: IntMap a -> Bool # length :: IntMap a -> Int # elem :: Eq a => a -> IntMap a -> Bool # maximum :: Ord a => IntMap a -> a # minimum :: Ord a => IntMap a -> a # sum :: Num a => IntMap a -> a # product :: Num a => IntMap a -> a #
Traversable IntMap Source #
Instance details Defined in Language.Parser.Ptera.Data.Symbolic.IntMap Methods traverse :: Applicative f => (a -> f b) -> IntMap a -> f (IntMap b) # sequenceA :: Applicative f => IntMap (f a) -> f (IntMap a) # mapM :: Monad m => (a -> m b) -> IntMap a -> m (IntMap b) # sequence :: Monad m => IntMap (m a) -> m (IntMap a) #
Eq a => Eq (IntMap a) Source #
Instance details Defined in Language.Parser.Ptera.Data.Symbolic.IntMap Methods (==) :: IntMap a -> IntMap a -> Bool # (/=) :: IntMap a -> IntMap a -> Bool #
Show a => Show (IntMap a) Source #
Instance details Defined in Language.Parser.Ptera.Data.Symbolic.IntMap Methods showsPrec :: Int -> IntMap a -> ShowS # show :: IntMap a -> String # showList :: [IntMap a] -> ShowS #

empty :: IntMap a Source #

full :: a -> IntMap a Source #

singleton :: Key -> a -> IntMap a Source #

normalize :: Eq a => IntMap a -> IntMap a Source #

insert :: Key -> a -> IntMap a -> IntMap a Source #

insertBulk :: T -> a -> IntMap a -> IntMap a Source #

delete :: Key -> IntMap a -> IntMap a Source #

update :: (a -> Maybe a) -> Key -> IntMap a -> IntMap a Source #

alter :: (Maybe a -> Maybe a) -> Key -> IntMap a -> IntMap a Source #

alterBulk :: (Maybe a -> Maybe a) -> T -> IntMap a -> IntMap a Source #

lookup :: Key -> IntMap a -> Maybe a Source #

keys :: IntMap a -> T Source #

restrictKeys :: IntMap a -> T -> IntMap a Source #

merge :: (a -> b -> Maybe c) -> (a -> Maybe c) -> (b -> Maybe c) -> IntMap a -> IntMap b -> IntMap c Source #

groupBy :: Eq b => Hashable b => (a -> b) -> IntMap a -> HashMap b T Source #