| Safe Haskell | Safe-Inferred |
|---|
Data.SetMap
- data SetMap k v
- null :: SetMap k a -> Bool
- size :: SetMap k a -> Int
- numKeys :: SetMap k a -> Word32
- numValues :: SetMap k a -> Word32
- member :: Ord k => SetMap k a -> k -> Bool
- notMember :: Ord k => SetMap k a -> k -> Bool
- lookup :: Ord k => k -> SetMap k a -> Set a
- (!) :: Ord k => SetMap k a -> k -> Set a
- empty :: SetMap k a
- insert :: (Ord k, Ord a) => k -> a -> SetMap k a -> SetMap k a
- delete :: Ord k => k -> SetMap k a -> SetMap k a
- map :: (Ord a, Ord b) => (a -> b) -> SetMap k a -> SetMap k b
- elems :: SetMap k a -> [[a]]
- keys :: SetMap k a -> [k]
- toMap :: SetMap k a -> Map k (Set a)
SetMap type
A SetMap with keys k and values v.
Query
numKeys :: SetMap k a -> Word32Source
O(1). The number of keys in the multimap.
As this is a multimap, the number of keys is not necessarily equal to the number of values.
numValues :: SetMap k a -> Word32Source
O(1). The number of values in the multimap.
As this is a multimap, the number of keys is not necessarily equal to the number of values.
notMember :: Ord k => SetMap k a -> k -> BoolSource
O(log n). Is the key not a member of the multimap?
lookup :: Ord k => k -> SetMap k a -> Set aSource
O(log n). Lookup the value at a key in the map.
The function will return the corrsponding values as a List, or the empty list if no values are associated witht the given key.
Operators
Construction
Insertion
insert :: (Ord k, Ord a) => k -> a -> SetMap k a -> SetMap k aSource
Insert a new key and value in the map.
Deletion
Traversal
map :: (Ord a, Ord b) => (a -> b) -> SetMap k a -> SetMap k bSource
Map a function over all values in the map.