| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Data.Multwomap
Synopsis
- data Multwomap k v
- empty :: Multwomap k v
- null :: Multwomap k v -> Bool
- size :: Multwomap k v -> Int
- union :: Ord k => Multwomap k v -> Multwomap k v -> Multwomap k v
- insert :: Ord k => k -> v -> Multwomap k v -> Multwomap k v
- arbitraryKey :: Multwomap k v -> Maybe k
- extract :: Ord k => k -> Multwomap k v -> Maybe (v, Multwomap k v)
Documentation
A multimap where each key can have at most two entries. Note that this is an unsafe data structure: attempting to add a key twice will crash the program.
Instances
| (Show k, Show v) => Show (Multwomap k v) Source # | |
| (Eq k, Eq v) => Eq (Multwomap k v) Source # | |
| (Ord k, Ord v) => Ord (Multwomap k v) Source # | |
Defined in Data.Multwomap Methods compare :: Multwomap k v -> Multwomap k v -> Ordering # (<) :: Multwomap k v -> Multwomap k v -> Bool # (<=) :: Multwomap k v -> Multwomap k v -> Bool # (>) :: Multwomap k v -> Multwomap k v -> Bool # (>=) :: Multwomap k v -> Multwomap k v -> Bool # | |