利用ConcurrentHashMap來實現(xiàn)一個ConcurrentHashSet

package hashset;import java.io.Serializable; import java.util.AbstractSet; import java.util.Iterator; import java.util.Set; import java.util.concurrent.ConcurrentHashMap;/*** @author xfyou* @date 2018/9/3*/ public class ConcurrentHashSet<E> extends AbstractSet<E> implements Set<E>, Serializable {private static final long serialVersionUID = -8672117787651310382L;private static final Object PRESENT = new Object();private final ConcurrentHashMap<E, Object> map;public ConcurrentHashSet() {this.map = new ConcurrentHashMap<>();}public ConcurrentHashSet(int initialCapacity) {this.map = new ConcurrentHashMap<>(initialCapacity);}@Overridepublic Iterator<E> iterator() {return map.keySet().iterator();}@Overridepublic boolean isEmpty() {return map.isEmpty();}@Overridepublic boolean contains(Object o) {return map.containsKey(o);}@Overridepublic boolean add(E e) {return map.put(e, PRESENT) == null;}@Overridepublic boolean remove(Object o) {return map.remove(o) == PRESENT;}@Overridepublic void clear() {map.clear();}@Overridepublic int size() {return map.size();}}

?

轉(zhuǎn)載于:https://www.cnblogs.com/frankyou/p/9580585.html

總結(jié)

以上是生活随笔為你收集整理的利用ConcurrentHashMap来实现一个ConcurrentHashSet的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。