mirror of
https://github.com/OpenHFT/Chronicle-Map.git
synced 2021-09-13 01:26:12 +00:00
177 lines
4.4 KiB
Java
177 lines
4.4 KiB
Java
/*
|
|
* Copyright (C) 2015 higherfrequencytrading.com
|
|
*
|
|
* This program 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 3 of the License.
|
|
*
|
|
* This program 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 program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
package net.openhft.chronicle.set;
|
|
|
|
import net.openhft.chronicle.hash.Data;
|
|
import net.openhft.chronicle.hash.serialization.internal.DummyValue;
|
|
import net.openhft.chronicle.map.ChronicleMap;
|
|
import org.jetbrains.annotations.NotNull;
|
|
|
|
import java.io.File;
|
|
import java.io.IOException;
|
|
import java.io.Serializable;
|
|
import java.util.AbstractSet;
|
|
import java.util.Collection;
|
|
import java.util.Iterator;
|
|
import java.util.Set;
|
|
import java.util.function.Consumer;
|
|
import java.util.function.Predicate;
|
|
|
|
import static net.openhft.chronicle.hash.serialization.internal.DummyValue.DUMMY_VALUE;
|
|
|
|
class SetFromMap<E> extends AbstractSet<E>
|
|
implements ChronicleSet<E>, Serializable {
|
|
|
|
private final ChronicleMap<E, DummyValue> m; // The backing map
|
|
private transient Set<E> s; // Its keySet
|
|
|
|
SetFromMap(ChronicleMap<E, DummyValue> map) {
|
|
m = map;
|
|
s = map.keySet();
|
|
}
|
|
|
|
public void clear() {
|
|
m.clear();
|
|
}
|
|
|
|
public int size() {
|
|
return m.size();
|
|
}
|
|
|
|
public boolean isEmpty() {
|
|
return m.isEmpty();
|
|
}
|
|
|
|
public boolean contains(Object o) {
|
|
return m.containsKey(o);
|
|
}
|
|
|
|
public boolean remove(Object o) {
|
|
return m.remove(o, DUMMY_VALUE);
|
|
}
|
|
|
|
public boolean add(E e) {
|
|
return m.putIfAbsent(e, DUMMY_VALUE) == null;
|
|
}
|
|
|
|
public Iterator<E> iterator() {
|
|
return s.iterator();
|
|
}
|
|
|
|
public Object[] toArray() {
|
|
return s.toArray();
|
|
}
|
|
|
|
public <T> T[] toArray(T[] a) {
|
|
return s.toArray(a);
|
|
}
|
|
|
|
public String toString() {
|
|
return s.toString();
|
|
}
|
|
|
|
public int hashCode() {
|
|
return s.hashCode();
|
|
}
|
|
|
|
public boolean equals(Object o) {
|
|
return o == this || s.equals(o);
|
|
}
|
|
|
|
// TODO optimize in case of stateless clients -- because bulk ops are optimized on maps
|
|
// but on key set they delegate to individual element queries => individual remote calls
|
|
public boolean containsAll(Collection<?> c) {
|
|
return s.containsAll(c);
|
|
}
|
|
|
|
public boolean removeAll(Collection<?> c) {
|
|
return s.removeAll(c);
|
|
}
|
|
|
|
public boolean retainAll(Collection<?> c) {
|
|
return s.retainAll(c);
|
|
}
|
|
// addAll is the only inherited implementation
|
|
|
|
private static final long serialVersionUID = 2454657854757543876L;
|
|
|
|
private void readObject(java.io.ObjectInputStream stream)
|
|
throws IOException, ClassNotFoundException {
|
|
stream.defaultReadObject();
|
|
s = m.keySet();
|
|
}
|
|
|
|
@Override
|
|
public long longSize() {
|
|
return m.longSize();
|
|
}
|
|
|
|
@Override
|
|
public Class<E> keyClass() {
|
|
return m.keyClass();
|
|
}
|
|
|
|
@NotNull
|
|
@Override
|
|
public ExternalSetQueryContext<E, ?> queryContext(E key) {
|
|
//TODO
|
|
throw new UnsupportedOperationException();
|
|
}
|
|
|
|
@NotNull
|
|
@Override
|
|
public ExternalSetQueryContext<E, ?> queryContext(Data<E> key) {
|
|
//TODO
|
|
throw new UnsupportedOperationException();
|
|
}
|
|
|
|
@Override
|
|
public SetSegmentContext<E, ?> segmentContext(int segmentIndex) {
|
|
throw new UnsupportedOperationException();
|
|
}
|
|
|
|
@Override
|
|
public int segments() {
|
|
return m.segments();
|
|
}
|
|
|
|
@Override
|
|
public boolean forEachEntryWhile(Predicate<? super SetEntry<E>> predicate) {
|
|
throw new UnsupportedOperationException();
|
|
}
|
|
|
|
@Override
|
|
public void forEachEntry(Consumer<? super SetEntry<E>> action) {
|
|
throw new UnsupportedOperationException();
|
|
}
|
|
|
|
@Override
|
|
public File file() {
|
|
return m.file();
|
|
}
|
|
|
|
@Override
|
|
public void close() {
|
|
m.close();
|
|
}
|
|
|
|
@Override
|
|
public boolean isOpen() {
|
|
return m.isOpen();
|
|
}
|
|
}
|