Language.Parser.Ptera.Data.Symbolic.IntMap

Documentation

type T = IntMap

type Key = Int

data IntMap a

Constructors

IntMap

Fields

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

Instances

Functor IntMap

Defined in Language.Parser.Ptera.Data.Symbolic.IntMap

Methods

fmap :: (a -> b) -> IntMap a -> IntMap b

(<$) :: a -> IntMap b -> IntMap a

Foldable IntMap

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

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)

Defined in Language.Parser.Ptera.Data.Symbolic.IntMap

Methods

(==) :: IntMap a -> IntMap a -> Bool

(/=) :: IntMap a -> IntMap a -> Bool

Show a => Show (IntMap a)

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

full :: a -> IntMap a

singleton :: Key -> a -> IntMap a

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

insert :: Key -> a -> IntMap a -> IntMap a

insertBulk :: T -> a -> IntMap a -> IntMap a

delete :: Key -> IntMap a -> IntMap a

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

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

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

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

keys :: IntMap a -> T

restrictKeys :: IntMap a -> T -> IntMap a

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

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