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
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
|
/* __ *\
** ________ ___ / / ___ Scala API **
** / __/ __// _ | / / / _ | (c) 2003, LAMP/EPFL **
** __\ \/ /__/ __ |/ /__/ __ | **
** /____/\___/_/ |_/____/_/ | | **
** |/ **
** $Id$
\* */
package scala.collection;
/** This trait defines the interface of collections that unambiguously map
* keys to values (i.e. a key is mapped to at least one value).
* Trait <code>Map</code> may only be used for
* accessing elements from map implementations. Two different extensions
* of trait <code>Map</code> in the package <code>scala.collections.mutable</code>
* and <code>scala.collections.immutable</code> provide functionality for
* adding new key/value mappings to a map. The trait in the first package is
* implemented by maps that are modified destructively, whereas the trait in
* the second package is used by functional map implementations that rely on
* immutable data structures.
*
* @author Matthias Zenger
* @version 1.1, 02/05/2004
*/
trait Map[A, +B] extends AnyRef with PartialFunction[A, B] with Iterable[Pair[A, B]] {
/** Compute the number of key-to-value mappings.
*
* @return the number of mappings
*/
def size: Int;
/** Check if this map maps <code>key</code> to a value and return the
* value if it exists.
*
* @param key the key of the mapping of interest
* @return the value of the mapping, if it exists
*/
def get(key: A): Option[B];
/** Is this an empty map?
*
* @return true, iff the map is empty.
*/
def isEmpty: Boolean = (size == 0);
/** Retrieve the value which is associated with the given key. This
* method throws an exception if there is no mapping from the given
* key to a value.
*
* @param key the key
* @return the value associated with the given key.
*/
def apply(key: A): B = get(key) match {
case None => default
case Some(value) => value
}
/** Is the given key mapped to a value by this map?
*
* @param key the key
* @return true, iff there is a mapping for key in this map
*/
def contains(key: A): Boolean = get(key) match {
case None => false
case Some(_) => true
}
/** Does this map contain a mapping from the given key to a value?
*
* @param key the key
* @return true, iff there is a mapping for key in this map
*/
def isDefinedAt(key: A) = contains(key);
/** Creates an iterator for all keys.
*
* @return an iterator over all keys.
*/
def keys: Iterator[A] = new Iterator[A] {
val iter = Map.this.elements;
def hasNext = iter.hasNext;
def next = iter.next._1;
}
/** Creates an iterator for a contained values.
*
* @return an iterator over all values.
*/
def values: Iterator[B] = new Iterator[B] {
val iter = Map.this.elements;
def hasNext = iter.hasNext;
def next = iter.next._2;
}
/** Executes the given function for all (key, value) pairs
* contained in this map.
*
* @param f the function to execute.
*/
def foreach(f: (A, B) => Unit) = {
val iter = elements;
while (iter.hasNext) {
val Pair(key, value) = iter.next;
f(key, value);
}
}
/** Applies the given predicate to all (key, value) mappings
* contained in this map and returns true if this predicate
* yields true for all mappings.
*
* @param p the predicate
* @return true, iff p yields true for all mappings.
*/
def forall(p: (A, B) => Boolean): Boolean = elements.forall {
case Pair(key, value) => p(key, value)
}
/** Applies the given predicate to all (key, value) mappings
* contained in this map and returns true if there is at least
* one mapping for which this predicate yields true.
*
* @param p the predicate
* @return true, iff there is at least one mapping for which
* p yields true.
*/
def exists(p: (A, B) => Boolean): Boolean = elements.exists {
case Pair(key, value) => p(key, value)
}
/** Compares two maps structurally; i.e. checks if all mappings
* contained in this map are also contained in the other map,
* and vice versa.
*
* @return true, iff both maps contain exactly the same mappings.
*/
override def equals(that: Any): Boolean = that match {
case other: Map[A, B] =>
this.size == other.size && this.elements.forall {
case Pair(key, value) => other.get(key) match {
case None => false;
case Some(otherval) => value == otherval;
}
}
case _ => false
}
/** Returns the mappings of this map as a list.
*
* @return a list containing all mappings
*/
def toList: List[Pair[A, B]] = elements.toList;
/** Creates a string representation for this map.
*
* @return a string showing all mappings
*/
override def toString() =
if (size == 0)
"{}"
else
"{" + {
val iter = elements;
var res = iter.next.toString();
while (iter.hasNext) {
res = res + ", " + iter.next;
}
res;
} + "}";
/** The default value for the map, returned when a key is not found
* The method implemented here yields an error,
* but it might be overridden in subclasses.
*/
def default: B =
error("key not found")
}
|
