| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell98 |
Autolib.Data.Map
Description
impedance matching: provide old Data.FiniteMap interface but use new Data.Map implementation
Synopsis
- type FiniteMap k a = Map k a
- emptyFM :: Map k a
- isEmptyFM :: Map k a -> Bool
- sizeFM :: Map k a -> Int
- unitFM :: k -> a -> Map k a
- eltsFM :: Map k a -> [a]
- keysFM :: Map k a -> [k]
- fmToList :: Map k a -> [(k, a)]
- listToFM :: Ord k => [(k, a)] -> Map k a
- delFromFM :: Ord a1 => Map a1 a2 -> a1 -> Map a1 a2
- foldFM :: (k -> a -> b -> b) -> b -> Map k a -> b
- lookupFM :: Ord k => FiniteMap k a -> k -> Maybe a
- lookupWithDefaultFM :: Ord k => Map k a -> a -> k -> a
- elemFM :: Ord k => k -> Map k a -> Bool
- mapFM :: (k -> a -> b) -> Map k a -> Map k b
- addToFM :: Ord k => Map k a -> k -> a -> Map k a
- addToFM_C :: Ord k => (a -> a -> a) -> Map k a -> k -> a -> Map k a
- addListToFM :: (Foldable t, Ord k) => Map k a -> t (k, a) -> Map k a
- addListToFM_C :: (Foldable t, Ord k) => (a -> a -> a) -> Map k a -> t (k, a) -> Map k a
- plusFM :: Ord k => Map k a -> Map k a -> Map k a
- plusFM_C :: Ord k => (a -> a -> a) -> Map k a -> Map k a -> Map k a
- filterFM :: (k -> a -> Bool) -> Map k a -> Map k a
- intersectFM_C :: Ord k => (a -> b -> c) -> Map k a -> Map k b -> Map k c