Example usage for java.util AbstractSet subclass-usage

Introduction

In this page you can find the example usage for java.util AbstractSet subclass-usage.

Usage

public class SimpleSet extends AbstractSet implements Cloneable {
    Object[] elementObjects;
    int count = 0;

    public SimpleSet() {
        this(2);

From source file WeakHashSet.java

/**  
 * Implements a HashSet where the objects given are stored in weak references.
 * 
 * <p>
 * Uses the WeakHashMap class as a backing store to implement a set of objects that are
 * stored as weak references. All information concerning using keys in the WeakHashMap

From source file CompactHashSet.java

/**
 * INTERNAL: Implements the Set interface more compactly than java.util.HashSet
 * by using a closed hashtable.
 */
public class CompactHashSet<E> extends java.util.AbstractSet<E> {

From source file org.springmodules.xt.model.introductor.collections.IntroductorSet.java

/**
 * {@link java.util.Set} decorator, which makes all the contained objects implementing a given array of interfaces, leaving
 * the original target set unmodified.<br>
 * This builds on top of {@link DynamicIntroductor} implementations.<br>
 * <b>Important</b>: Changes to this decorated collection are reflected in the original set, and vice-versa.
 *

From source file de.dhke.projects.cutil.collections.frozen.FrozenSortedList.java

/**
 *
 * @author Peter Wullinger <java@dhke.de>
 */
public class FrozenSortedList<T extends Comparable<? super T>> extends AbstractSet<T>
        implements Comparable<FrozenSortedList<T>> {

From source file WeakCanonicalSet.java

/**
 * A thread-safe Set that manages canonical objects: sharable objects that are
 * typically immutable. Call the {@link #put put} method for supplying the
 * WeakCanonicalSet with candidate canonical instances.
 * <p>
 * Objects that do not customize the hashCode and equals methods don't make

From source file ConcurrentHashSet.java

/**
 * This class implements the <tt>Set</tt> interface, backed by a ConcurrentHashMap instance.
 * 
 * @author Matt Tucker
 * @param <E>
 */

From source file com.github.helenusdriver.driver.impl.PersistedSet.java

/**
 * The <code>PersistedSet</code> class provides a {@link Set} implementation
 * suitable to hold persisted values.
 *
 * @copyright 2015-2015 The Helenus Driver Project Authors
 *

From source file xbird.util.collections.IndexedSet.java

/**
 * 
 * <DIV lang="en"></DIV>
 * <DIV lang="ja"></DIV>
 * 
 * @author Makoto YUI (yuin405+xbird@gmail.com)

From source file ShortPriorityQueue.java

/**
 * A {@code ShortPriorityQueue<E>} is a length-bounded priority queue
 * optimized for short lengths.  Rather than maintaining tree or heap
 * data structures, it keeps elements in an array and uses a simple
 * bubble sort.
 *