cn.hutool.core.collection.ConcurrentHashSet Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of hutool-core Show documentation
Hutool核心，包括集合、字符串、Bean等工具
The newest version!
package cn.hutool.core.collection;

import cn.hutool.core.map.SafeConcurrentHashMap;

import java.util.AbstractSet;
import java.util.Collection;
import java.util.Iterator;

/**
 * 通过{@link SafeConcurrentHashMap}实现的线程安全HashSet
 *
 * @author Looly
 *
 * @param  元素类型
 * @since 3.1.0
 */
public class ConcurrentHashSet extends AbstractSet implements java.io.Serializable {
	private static final long serialVersionUID = 7997886765361607470L;

	/** 持有对象。如果值为此对象表示有数据，否则无数据 */
	private static final Boolean PRESENT = true;
	private final SafeConcurrentHashMap map;

	// ----------------------------------------------------------------------------------- Constructor start
	/**
	 * 构造

	 * 触发因子为默认的0.75
	 */
	public ConcurrentHashSet() {
		map = new SafeConcurrentHashMap<>();
	}

	/**
	 * 构造

	 * 触发因子为默认的0.75
	 *
	 * @param initialCapacity 初始大小
	 */
	public ConcurrentHashSet(int initialCapacity) {
		map = new SafeConcurrentHashMap<>(initialCapacity);
	}

	/**
	 * 构造
	 *
	 * @param initialCapacity 初始大小
	 * @param loadFactor 加载因子。此参数决定数据增长时触发的百分比
	 */
	public ConcurrentHashSet(int initialCapacity, float loadFactor) {
		map = new SafeConcurrentHashMap<>(initialCapacity, loadFactor);
	}

	/**
	 * 构造
	 *
	 * @param initialCapacity 初始大小
	 * @param loadFactor 触发因子。此参数决定数据增长时触发的百分比
	 * @param concurrencyLevel 线程并发度
	 */
	public ConcurrentHashSet(int initialCapacity, float loadFactor, int concurrencyLevel) {
		map = new SafeConcurrentHashMap<>(initialCapacity, loadFactor, concurrencyLevel);
	}

	/**
	 * 从已有集合中构造
	 * @param iter {@link Iterable}
	 */
	public ConcurrentHashSet(Iterable iter) {
		if(iter instanceof Collection) {
			final Collection collection = (Collection)iter;
			map = new SafeConcurrentHashMap<>((int)(collection.size() / 0.75f));
			this.addAll(collection);
		}else {
			map = new SafeConcurrentHashMap<>();
			for (E e : iter) {
				this.add(e);
			}
		}
	}
	// ----------------------------------------------------------------------------------- Constructor end

	@Override
	public Iterator iterator() {
		return map.keySet().iterator();
	}

	@Override
	public int size() {
		return map.size();
	}

	@Override
	public boolean isEmpty() {
		return map.isEmpty();
	}

	@Override
	public boolean contains(Object o) {
		//noinspection SuspiciousMethodCalls
		return map.containsKey(o);
	}

	@Override
	public boolean add(E e) {
		return map.put(e, PRESENT) == null;
	}

	@Override
	public boolean remove(Object o) {
		return PRESENT.equals(map.remove(o));
	}

	@Override
	public void clear() {
		map.clear();
	}
}