blob: 51ea63f2a7a03fde10f98ac072349fc4fee447cf (
plain) (
blame)
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
|
package mill.util
import scala.collection.mutable
import mill.api.Strict.Agg
/**
* A map from keys to collections of values: you can assign multiple values
* to any particular key. Also allows lookups in both directions: what values
* are assigned to a key or what key a value is assigned to.
*/
trait MultiBiMap[K, V]{
def containsValue(v: V): Boolean
def lookupKey(k: K): Agg[V]
def lookupValue(v: V): K
def lookupValueOpt(v: V): Option[K]
def add(k: K, v: V): Unit
def removeAll(k: K): Agg[V]
def addAll(k: K, vs: TraversableOnce[V]): Unit
def keys(): Iterator[K]
def items(): Iterator[(K, Agg[V])]
def values(): Iterator[Agg[V]]
def keyCount: Int
}
object MultiBiMap{
class Mutable[K, V]() extends MultiBiMap[K, V]{
private[this] val valueToKey = mutable.LinkedHashMap.empty[V, K]
private[this] val keyToValues = mutable.LinkedHashMap.empty[K, Agg.Mutable[V]]
def containsValue(v: V) = valueToKey.contains(v)
def lookupKey(k: K) = keyToValues(k)
def lookupKeyOpt(k: K) = keyToValues.get(k)
def lookupValue(v: V) = valueToKey(v)
def lookupValueOpt(v: V) = valueToKey.get(v)
def add(k: K, v: V): Unit = {
valueToKey(v) = k
keyToValues.getOrElseUpdate(k, new Agg.Mutable[V]()).append(v)
}
def removeAll(k: K): Agg[V] = keyToValues.get(k) match {
case None => Agg()
case Some(vs) =>
vs.foreach(valueToKey.remove)
keyToValues.remove(k)
vs
}
def addAll(k: K, vs: TraversableOnce[V]): Unit = vs.foreach(this.add(k, _))
def keys() = keyToValues.keysIterator
def values() = keyToValues.valuesIterator
def items() = keyToValues.iterator
def keyCount = keyToValues.size
}
}
|
