ExtendedSet.java
4.77 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
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
/*
* Copyright 2015-present Open Networking Laboratory
*
* 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 org.onlab.util;
import java.util.Collection;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;
import java.util.concurrent.atomic.AtomicBoolean;
import java.util.function.Predicate;
import com.google.common.collect.Iterators;
import static com.google.common.base.Preconditions.checkNotNull;
/**
* A Set providing additional get, insertOrReplace and conditionalRemove methods.
*/
public class ExtendedSet<E> implements Set<E> {
private final Map<E, E> map;
/**
* Constructs a new instance by backing it with the supplied Map.
* <p>
* Constructed ExtendedSet will have the same concurrency properties as that of the supplied Map.
*
* @param map input map.
*/
public ExtendedSet(Map<E, E> map) {
this.map = map;
}
/**
* Returns set element that is equal to the specified object.
* @param o object
* @return set element that is equal to the input argument or null if no such set element exists
*/
public E get(Object o) {
return map.get(o);
}
/**
* Inserts the entry if it is not already in the set otherwise replaces the existing entry
* if the supplied predicate evaluates to true.
* @param entry entry to add
* @param entryTest predicate that is used to evaluate if the existing entry should be replaced
* @return true if the set is updated; false otherwise
*/
public boolean insertOrReplace(E entry, Predicate<E> entryTest) {
AtomicBoolean updated = new AtomicBoolean(false);
map.compute(checkNotNull(entry), (k, v) -> {
if (v == null || entryTest.test(v)) {
updated.set(true);
return entry;
}
return v;
});
return updated.get();
}
/**
* Removes the entry if the supplied predicate evaluates to true.
* @param entry entry to remove
* @param entryTest predicate that is used to evaluated aginst the existing entry. Return value of
* true implies value should be removed.
* @return true if the set is updated; false otherwise
*/
public boolean conditionalRemove(E entry, Predicate<E> entryTest) {
AtomicBoolean updated = new AtomicBoolean(false);
map.compute(entry, (k, v) -> {
if (entryTest.test(v)) {
updated.set(true);
return null;
}
return v;
});
return updated.get();
}
@Override
public int size() {
return map.size();
}
@Override
public boolean isEmpty() {
return map.isEmpty();
}
@Override
public boolean contains(Object o) {
return map.containsKey(o);
}
@Override
public Iterator<E> iterator() {
return Iterators.transform(map.entrySet().iterator(), Map.Entry::getValue);
}
@Override
public Object[] toArray() {
return map.values().toArray();
}
@Override
public <T> T[] toArray(T[] a) {
return map.values().toArray(a);
}
@Override
public boolean add(E e) {
return map.putIfAbsent(e, e) == null;
}
@Override
public boolean remove(Object o) {
return map.remove(o) != null;
}
@Override
public boolean containsAll(Collection<?> c) {
return c.stream()
.map(map::containsKey)
.reduce(Boolean::logicalAnd)
.orElse(true);
}
@Override
public boolean addAll(Collection<? extends E> c) {
return c.stream()
.map(e -> map.putIfAbsent(e, e) == null)
.reduce(Boolean::logicalOr)
.orElse(false);
}
@Override
public boolean retainAll(Collection<?> c) {
return c.stream()
.filter(e -> !map.containsKey(e))
.map(e -> map.remove(e) != null)
.reduce(Boolean::logicalOr)
.orElse(false);
}
@Override
public boolean removeAll(Collection<?> c) {
return c.stream()
.map(e -> map.remove(e) != null)
.reduce(Boolean::logicalOr)
.orElse(false);
}
@Override
public void clear() {
map.clear();
}
}