Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Documentation
IntMap | |
|
Instances
Foldable IntMap Source # | |
Defined in Language.Parser.Ptera.Data.Symbolic.IntMap fold :: Monoid m => IntMap m -> m Source # foldMap :: Monoid m => (a -> m) -> IntMap a -> m Source # foldMap' :: Monoid m => (a -> m) -> IntMap a -> m Source # foldr :: (a -> b -> b) -> b -> IntMap a -> b Source # foldr' :: (a -> b -> b) -> b -> IntMap a -> b Source # foldl :: (b -> a -> b) -> b -> IntMap a -> b Source # foldl' :: (b -> a -> b) -> b -> IntMap a -> b Source # foldr1 :: (a -> a -> a) -> IntMap a -> a Source # foldl1 :: (a -> a -> a) -> IntMap a -> a Source # toList :: IntMap a -> [a] Source # null :: IntMap a -> Bool Source # length :: IntMap a -> Int Source # elem :: Eq a => a -> IntMap a -> Bool Source # maximum :: Ord a => IntMap a -> a Source # minimum :: Ord a => IntMap a -> a Source # | |
Traversable IntMap Source # | |
Defined in Language.Parser.Ptera.Data.Symbolic.IntMap | |
Functor IntMap Source # | |
Show a => Show (IntMap a) Source # | |
Eq a => Eq (IntMap a) Source # | |