net.sf.ehcache.util.LargeCollection Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of ehcache-core Show documentation
Show all versions of ehcache-core Show documentation
Internal ehcache-core module. This artifact is not meant to be used directly
/**
* Copyright Terracotta, Inc.
*
* 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 net.sf.ehcache.util;
import java.util.AbstractCollection;
import java.util.ArrayList;
import java.util.Collection;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
/**
* Collection for large set. The general purpose is not to iterator through
* all the keys for add and remove operations.
* @author Nabib El-Rahman
* @param
*/
public abstract class LargeCollection < E > extends AbstractCollection < E > {
/**
* Set that keeps tabs on add add() to collection.
*/
private final Collection < E > addSet;
/**
* Set that keeps tabs of all remove() to collection.
*/
private final Collection < Object > removeSet;
/**
* default constructor.
*/
public LargeCollection() {
this.addSet = new HashSet();
this.removeSet = new HashSet();
}
/**
* {@inheritDoc}
*/
@Override
public final boolean add(final E obj) {
return this.addSet.add(obj);
}
/**
* {@inheritDoc}
*/
@Override
public final boolean contains(final Object obj) {
return !removeSet.contains(obj) ? addSet.contains(obj)
|| super.contains(obj) : false;
}
/**
* {@inheritDoc}
*/
@Override
public final boolean remove(final Object obj) {
return removeSet.add(obj);
}
/**
* {@inheritDoc}
*/
public final boolean removeAll(final Collection < ? > removeCandidates) {
boolean remove = true;
for (Iterator iter = removeCandidates.iterator(); iter.hasNext();) {
remove = remove(iter.next()) & remove;
}
return remove;
}
/**
* Iterator for addSet.
* @return Iterator < E >
*/
private Iterator < E > additionalIterator() {
return addSet.iterator();
}
/**
* {@inheritDoc}
*/
public final Iterator < E > iterator() {
List < Iterator < E > > iterators = new ArrayList();
iterators.add(sourceIterator());
iterators.add(additionalIterator());
return new AggregateIterator(removeSet, iterators);
}
/**
* {@inheritDoc}
*/
public final int size() {
return Math.max(0, sourceSize() + addSet.size() - removeSet.size());
}
/**
* Iterator of initial set of entries.
* @return {@code Iterator}
*/
public abstract Iterator < E > sourceIterator();
/**
* Initial set of entries size.
* @return integer
*/
public abstract int sourceSize();
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy