IdeSession.Strict.Map

Wrapper around Data.Map that guarantees elements are evaluated when the Map is. containers-0.5 provides this out of the box, but alas ghc 7.4 is built against containers-0.4.

Documentation

toList :: Strict (Map k) v -> [(k, v)]

fromList :: Ord k => [(k, v)] -> Strict (Map k) v

map :: (a -> b) -> Strict (Map k) a -> Strict (Map k) b

mapWithKey :: (k -> a -> b) -> Strict (Map k) a -> Strict (Map k) b

mapKeys :: Ord k' => (k -> k') -> Strict (Map k) v -> Strict (Map k') v

empty :: Strict (Map k) v

insert :: Ord k => k -> v -> Strict (Map k) v -> Strict (Map k) v

union :: Ord k => Strict (Map k) v -> Strict (Map k) v -> Strict (Map k) v

Left biased union

unions :: Ord k => [Strict (Map k) v] -> Strict (Map k) v

filterWithKey :: Ord k => (k -> v -> Bool) -> Strict (Map k) v -> Strict (Map k) v

lookup :: Ord k => k -> Strict (Map k) v -> Maybe v

findWithDefault :: Ord k => v -> k -> Strict (Map k) v -> v

keysSet :: Strict (Map k) v -> Set k

(\\) :: Ord k => Strict (Map k) a -> Strict (Map k) b -> Strict (Map k) a

alter :: forall k a. Ord k => (Maybe a -> Maybe a) -> k -> Strict (Map k) a -> Strict (Map k) a

adjust :: forall k v. Ord k => (v -> v) -> k -> Strict (Map k) v -> Strict (Map k) v

member :: Ord k => k -> Strict (Map k) v -> Bool

(!) :: Ord k => Strict (Map k) v -> k -> v

keys :: Strict (Map k) a -> [k]

elems :: Strict (Map k) a -> [a]

delete :: Ord k => k -> Strict (Map k) a -> Strict (Map k) a

accessor :: Ord k => k -> Accessor (Strict (Map k) a) (Maybe a)

accessorDefault :: Ord k => v -> k -> Accessor (Strict (Map k) v) v