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
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
|
/* readonlymap.vala
*
* Copyright (C) 2007-2008 Jürg Billeter
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
* Author:
* Jürg Billeter <j@bitron.ch>
*/
using GLib;
/**
* Read-only view for {@link Map} collections.
*
* This class decorates any class which implements the {@link Map} interface
* by making it read only. Any method which normally modify data will throw an
* error.
*
* @see Map
*/
internal class Gee.ReadOnlyMap<K,V> : Object, Traversable<Map.Entry<K,V>>, Iterable<Map.Entry<K,V>>, Map<K,V> {
/**
* {@inheritDoc}
*/
public int size {
get { return _map.size; }
}
/**
* {@inheritDoc}
*/
public bool is_empty {
get { return _map.is_empty; }
}
/**
* {@inheritDoc}
*/
public bool read_only {
get { return true; }
}
/**
* {@inheritDoc}
*/
public Set<K> keys {
owned get {
return _map.keys;
}
}
/**
* {@inheritDoc}
*/
public Collection<V> values {
owned get {
return _map.values;
}
}
/**
* {@inheritDoc}
*/
public Set<Map.Entry<K,V>> entries {
owned get {
return _map.entries;
}
}
protected Map<K,V> _map;
/**
* Constructs a read-only map that mirrors the content of the specified map.
*
* @param map the map to decorate.
*/
public ReadOnlyMap (Map<K,V> map) {
this._map = map;
}
/**
* {@inheritDoc}
*/
public bool has_key (K key) {
return _map.has_key (key);
}
/**
* {@inheritDoc}
*/
public bool contains (K key) {
return _map.has_key (key);
}
/**
* {@inheritDoc}
*/
public bool has (K key, V value) {
return _map.has (key, value);
}
/**
* {@inheritDoc}
*/
public new V? get (K key) {
return _map.get (key);
}
/**
* Unimplemented method (read only map).
*/
public new void set (K key, V value) {
assert_not_reached ();
}
/**
* Unimplemented method (read only map).
*/
public bool unset (K key, out V? value = null) {
assert_not_reached ();
}
/**
* Unimplemented method (read only map).
*/
public bool remove (K key, out V? value = null) {
assert_not_reached ();
}
/**
* Unimplemented method (read only map).
*/
public void clear () {
assert_not_reached ();
}
/**
* {@inheritDoc}
*/
public Gee.MapIterator<K,V> map_iterator () {
return new MapIterator<K,V> (_map.map_iterator ());
}
/**
* Unimplemented method (read only map).
*/
public void set_all (Map<K,V> map) {
assert_not_reached ();
}
/**
* Unimplemented method (read only map).
*/
public bool unset_all (Map<K,V> map) {
assert_not_reached ();
}
/**
* Unimplemented method (read only map).
*/
public bool remove_all (Map<K,V> map) {
assert_not_reached ();
}
/**
* {@inheritDoc}
*/
public bool has_all (Map<K,V> map) {
return _map.has_all (map);
}
/**
* {@inheritDoc}
*/
public bool contains_all (Map<K,V> map) {
return _map.has_all (map);
}
public virtual Map<K,V> read_only_view {
owned get { return this; }
}
/**
* {@inheritDoc}
*/
public Type key_type {
get { return typeof (K); }
}
/**
* {@inheritDoc}
*/
public Type value_type {
get { return typeof (V); }
}
/**
* {@inheritDoc}
*/
public Type element_type {
get { return typeof (Map.Entry); }
}
/**
* {@inheritDoc}
*/
public Iterator<Map.Entry<K,V>> iterator () {
return entries.iterator ();
}
/**
* {@inheritDoc}
*/
public bool foreach (ForallFunc<Map.Entry<K, V>> f) {
return _map.foreach (f);
}
/**
* {@inheritDoc}
*/
public Iterator<A> stream<A> (owned StreamFunc<Map.Entry<K, V>, A> f) {
return _map.stream<A> ((owned) f);
}
public Iterator<Map.Entry<K, V>> filter (owned Predicate<Map.Entry<K, V>> f) {
return _map.filter ((owned)f);
}
public Iterator<Map.Entry<K, V>> chop (int offset, int length = -1) {
return _map.chop (offset, length);
}
internal class MapIterator<K,V> : Object, Gee.MapIterator<K,V> {
protected Gee.MapIterator<K,V> _iter;
public MapIterator (Gee.MapIterator<K,V> iterator) {
_iter = iterator;
}
public bool next () {
return _iter.next ();
}
public bool has_next () {
return _iter.has_next ();
}
public K get_key () {
return _iter.get_key ();
}
public V get_value () {
return _iter.get_value ();
}
public void set_value (V value) {
assert_not_reached ();
}
public void unset () {
assert_not_reached ();
}
public bool read_only {
get {
return true;
}
}
public bool mutable {
get {
return false;
}
}
public bool valid {
get {
return _iter.valid;
}
}
}
}
|