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
|
/*
* Copyright (C) 2012 The Guava Authors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.google.common.collect;
import static com.google.common.base.Preconditions.checkNotNull;
import static com.google.common.base.Preconditions.checkPositionIndex;
import com.google.common.annotations.GwtCompatible;
import com.google.common.base.Predicate;
import com.google.common.base.Predicates;
import java.util.Collection;
import java.util.Collections;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import javax.annotation.Nullable;
/**
* Implementation of {@link Multimaps#filterKeys(Multimap, Predicate)}.
*
* @author Louis Wasserman
*/
@GwtCompatible
class FilteredKeyMultimap<K, V> extends FilteredMultimap<K, V> {
final Predicate<? super K> keyPredicate;
FilteredKeyMultimap(Multimap<K, V> unfiltered, Predicate<? super K> keyPredicate) {
super(unfiltered);
this.keyPredicate = checkNotNull(keyPredicate);
}
@Override
Predicate<? super Entry<K, V>> entryPredicate() {
return Predicates.compose(keyPredicate, Maps.<K>keyFunction());
}
@Override
public int size() {
int size = 0;
for (Collection<V> collection : asMap().values()) {
size += collection.size();
}
return size;
}
@Override
public boolean containsKey(@Nullable Object key) {
if (unfiltered.containsKey(key)) {
@SuppressWarnings("unchecked") // k is equal to a K, if not one itself
K k = (K) key;
return keyPredicate.apply(k);
}
return false;
}
@Override
public Collection<V> removeAll(Object key) {
return containsKey(key) ? unfiltered.removeAll(key) : unmodifiableEmptyCollection();
}
Collection<V> unmodifiableEmptyCollection() {
if (unfiltered instanceof SetMultimap) {
return ImmutableSet.of();
} else {
return ImmutableList.of();
}
}
@Override
public void clear() {
keySet().clear();
}
@Override
Set<K> createKeySet() {
return Sets.filter(unfiltered.keySet(), keyPredicate);
}
@Override
public Collection<V> get(K key) {
if (keyPredicate.apply(key)) {
return unfiltered.get(key);
} else if (unfiltered instanceof SetMultimap) {
return new AddRejectingSet<K, V>(key);
} else {
return new AddRejectingList<K, V>(key);
}
}
static class AddRejectingSet<K, V> extends ForwardingSet<V> {
final K key;
AddRejectingSet(K key) {
this.key = key;
}
@Override
public boolean add(V element) {
throw new IllegalArgumentException("Key does not satisfy predicate: " + key);
}
@Override
public boolean addAll(Collection<? extends V> collection) {
checkNotNull(collection);
throw new IllegalArgumentException("Key does not satisfy predicate: " + key);
}
@Override
protected Set<V> delegate() {
return Collections.emptySet();
}
}
static class AddRejectingList<K, V> extends ForwardingList<V> {
final K key;
AddRejectingList(K key) {
this.key = key;
}
@Override
public boolean add(V v) {
add(0, v);
return true;
}
@Override
public boolean addAll(Collection<? extends V> collection) {
addAll(0, collection);
return true;
}
@Override
public void add(int index, V element) {
checkPositionIndex(index, 0);
throw new IllegalArgumentException("Key does not satisfy predicate: " + key);
}
@Override
public boolean addAll(int index, Collection<? extends V> elements) {
checkNotNull(elements);
checkPositionIndex(index, 0);
throw new IllegalArgumentException("Key does not satisfy predicate: " + key);
}
@Override
protected List<V> delegate() {
return Collections.emptyList();
}
}
@Override
Iterator<Entry<K, V>> entryIterator() {
return Iterators.filter(
unfiltered.entries().iterator(), Predicates.compose(keyPredicate, Maps.<K>keyFunction()));
}
@Override
Collection<Entry<K, V>> createEntries() {
return new Multimaps.Entries<K, V>() {
@Override
Multimap<K, V> multimap() {
return FilteredKeyMultimap.this;
}
@Override
public Iterator<Entry<K, V>> iterator() {
return entryIterator();
}
@Override
@SuppressWarnings("unchecked")
public boolean remove(@Nullable Object o) {
if (o instanceof Entry) {
Entry<?, ?> entry = (Entry<?, ?>) o;
if (unfiltered.containsEntry(entry.getKey(), entry.getValue())
&& keyPredicate.apply((K) entry.getKey())) {
return unfiltered.remove(entry.getKey(), entry.getValue());
}
}
return false;
}
@Override
public boolean removeAll(Collection<?> c) {
Predicate<Entry<K, ?>> combinedPredicate = Predicates.and(
Predicates.compose(keyPredicate, Maps.<K>keyFunction()), Predicates.in(c));
return Iterators.removeIf(unfiltered.entries().iterator(), combinedPredicate);
}
@Override
public boolean retainAll(Collection<?> c) {
Predicate<Entry<K, ?>> combinedPredicate = Predicates.and(
Predicates.compose(keyPredicate, Maps.<K>keyFunction()),
Predicates.not(Predicates.in(c)));
return Iterators.removeIf(unfiltered.entries().iterator(), combinedPredicate);
}
};
}
@Override
Map<K, Collection<V>> createAsMap() {
return Maps.filterKeys(unfiltered.asMap(), keyPredicate);
}
@Override
Multiset<K> createKeys() {
return Multisets.filter(unfiltered.keys(), keyPredicate);
}
}
|