| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Unison.Util.BiMap
Synopsis
- data BiMap k v = BiMap {}
- empty :: (Ord k, Ord v) => BiMap k v
- singleton :: k -> v -> BiMap k v
- fromList :: (Ord k, Ord v) => [(k, v)] -> BiMap k v
- fromMap :: (Ord k, Ord v) => Map k v -> BiMap k v
- toList :: BiMap k v -> [(k, v)]
- toMapL :: BiMap k v -> Map k v
- toMapR :: BiMap k v -> Map v k
- lookupL :: Ord k => k -> BiMap k v -> Maybe v
- lookupR :: Ord v => v -> BiMap k v -> Maybe k
- union :: (Ord k, Ord v) => BiMap k v -> BiMap k v -> BiMap k v
- difference :: (Ord k, Ord v) => BiMap k v -> BiMap k v -> BiMap k v
- insert :: (Ord k, Ord v) => k -> v -> BiMap k v -> BiMap k v
- deleteL :: (Ord k, Ord v) => k -> BiMap k v -> BiMap k v
- deleteR :: (Ord v, Ord k) => v -> BiMap k v -> BiMap k v
- keysSetL :: BiMap k v -> Set k
- keysSetR :: BiMap k v -> Set v
Documentation
A bidirectional map between keys of type k and values of type v.
Instances
| (Ord k, Ord v) => Monoid (BiMap k v) Source # | |
| (Ord k, Ord v) => Semigroup (BiMap k v) Source # | Combine two BiMaps. In case of key or value collisions, the entries from the second BiMap take precedence. |
| (Show k, Show v) => Show (BiMap k v) Source # | |
| (Eq k, Eq v) => Eq (BiMap k v) Source # | |
| (Ord k, Ord v) => Ord (BiMap k v) Source # | |