Safe Haskell | Safe-Inferred |
---|
OrdMap
Description
Finite mappings with ordered keys.
Red-Black trees. Implementation based on work by Norris Boyd, Andrew W. Appel, David R. Tarditi, and Stephen J. Bevan.
- data OrdMap a b
- empty :: OrdMap a b
- singleton :: Ord a => (a, b) -> OrdMap a b
- union :: Ord a => OrdMap a b -> OrdMap a b -> OrdMap a b
- unionMany :: Ord a => [OrdMap a b] -> OrdMap a b
- add :: Ord a => (a, b) -> OrdMap a b -> OrdMap a b
- (//) :: Ord a => OrdMap a b -> [(a, b)] -> OrdMap a b
- toList :: OrdMap a b -> [(a, b)]
- fromList :: Ord a => [(a, b)] -> OrdMap a b
- length :: OrdMap a b -> Int
- null :: OrdMap a b -> Bool
- isSingleton :: OrdMap a b -> Bool
- elems :: OrdMap a b -> [b]
- indices :: OrdMap a b -> [a]
- lookup :: Ord a => a -> OrdMap a b -> Maybe b
- lookupWithDefault :: Ord a => OrdMap a b -> b -> a -> b