Repository navigation
Expand file tree
/
Copy pathMultiHashMap.hs
More file actions
146 lines (126 loc) · 3.59 KB
/
Copy pathMultiHashMap.hs
File metadata and controls
146 lines (126 loc) · 3.59 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
module Data.MultiHashMap where
import Data.Bifunctor
import Data.Foldable
import Data.HashMap.Lazy(HashMap)
import Data.HashSet(HashSet)
import Data.Hashable
import Data.Semigroup
import qualified Data.HashMap.Lazy as HashMap
import qualified Data.HashSet as HashSet
import qualified Data.Maybe as Maybe
newtype MultiHashMap k v = MultiHashMap { toMap :: HashMap k (HashSet v) }
deriving (Eq, Show)
instance (Eq k, Hashable k, Eq v, Hashable v) => Semigroup (MultiHashMap k v) where
(<>) = union
instance (Eq k, Hashable k, Eq v, Hashable v) => Monoid (MultiHashMap k v) where
mempty = MultiHashMap mempty
mappend = union
insert
:: (Eq k, Hashable k, Eq v, Hashable v)
=> k
-> v
-> MultiHashMap k v
-> MultiHashMap k v
insert k = inserts k . HashSet.singleton
inserts
:: (Eq k, Hashable k, Eq v, Hashable v)
=> k
-> HashSet v
-> MultiHashMap k v
-> MultiHashMap k v
inserts k vs (MultiHashMap m)
= MultiHashMap
$ HashMap.insertWith HashSet.union k vs m
lookup
:: (Eq k, Hashable k, Eq v, Hashable v)
=> k
-> MultiHashMap k v
-> HashSet v
lookup k (MultiHashMap m) = HashMap.lookupDefault mempty k m
lookupDefault
:: (Eq k, Hashable k, Eq v, Hashable v)
=> HashSet v
-> k
-> MultiHashMap k v
-> HashSet v
lookupDefault d k (MultiHashMap m) = case HashMap.lookup k m of
Nothing -> d
Just s
| HashSet.null s -> d
| otherwise -> s
union
:: (Eq k, Hashable k, Eq v, Hashable v)
=> MultiHashMap k v
-> MultiHashMap k v
-> MultiHashMap k v
union (MultiHashMap m1) (MultiHashMap m2)
= MultiHashMap
$ HashMap.unionWith HashSet.union m1 m2
unions
:: (Eq k, Hashable k, Eq v, Hashable v)
=> [MultiHashMap k v]
-> MultiHashMap k v
unions = foldl' union mempty
intersection
:: (Eq k, Hashable k, Eq v, Hashable v)
=> MultiHashMap k v
-> MultiHashMap k w
-> MultiHashMap k v
intersection (MultiHashMap m1) (MultiHashMap m2) = MultiHashMap $ HashMap.intersection m1 m2
setIntersection
:: (Eq k, Hashable k, Eq v, Hashable v)
=> MultiHashMap k v
-> HashSet k
-> MultiHashMap k v
setIntersection (MultiHashMap m1) s = MultiHashMap $ HashMap.intersection m1 $ HashSet.toMap s
fromList
:: (Eq k, Hashable k, Eq v, Hashable v)
=> [(k, v)]
-> MultiHashMap k v
fromList = foldr (uncurry insert) mempty
toList
:: (Eq k, Hashable k, Eq v, Hashable v)
=> MultiHashMap k v
-> [(k, v)]
toList m = [(k, v) | (k, s) <- toMultiList m, v <- HashSet.toList s]
fromMultiList
:: (Eq k, Hashable k, Eq v, Hashable v)
=> [(k, HashSet v)]
-> MultiHashMap k v
fromMultiList = foldr (uncurry inserts) mempty
toMultiList
:: (Eq k, Hashable k, Eq v, Hashable v)
=> MultiHashMap k v
-> [(k, HashSet v)]
toMultiList (MultiHashMap m) = HashMap.toList m
map
:: (Eq k, Hashable k, Eq v, Hashable v, Eq v', Hashable v')
=> (v -> v')
-> MultiHashMap k v
-> MultiHashMap k v'
map f (MultiHashMap m)
= MultiHashMap
$ fmap (HashSet.map f) m
mapMaybe
:: (Eq k, Hashable k, Eq v, Hashable v, Eq v', Hashable v')
=> (v -> Maybe v')
-> MultiHashMap k v
-> MultiHashMap k v'
mapMaybe p (MultiHashMap m)
= MultiHashMap
$ HashMap.mapMaybe (nothingWhenEmpty . Maybe.mapMaybe p . HashSet.toList) m
where
nothingWhenEmpty [] = Nothing
nothingWhenEmpty xs = Just $ HashSet.fromList xs
mapKeys
:: (Eq k, Hashable k, Eq k', Hashable k', Eq v, Hashable v)
=> (k -> k')
-> MultiHashMap k v
-> MultiHashMap k' v
mapKeys f = fromMultiList . Prelude.map (first f) . toMultiList
mapWithKey
:: (Eq v', Hashable v')
=> (k -> v -> v')
-> MultiHashMap k v
-> MultiHashMap k v'
mapWithKey f (MultiHashMap m) = MultiHashMap $ HashMap.mapWithKey (HashSet.map . f) m