Example usage for java.util Set interface-usage

Introduction

In this page you can find the example usage for java.util Set interface-usage.

Usage

/**
 * An implementation of Set that manages a map of soft references to the set
 * values. The map is keyed by the value hashCode and so this is only useful for
 * value whose hashCode is a valid identity representation (String, primative
 * wrappers, etc).
 *

From source file IdentitySet.java

/**
 * An IdentitySet that uses reference-equality instead of object-equality. According
 * to its special function it violates some design contracts of the <code>Set</code>
 * interface.
 * 
 * @author <a href="mailto:ralf DOT joachim AT syscon DOT eu">Ralf Joachim</a>

From source file InsertionOrderedSet.java

/**
 * Set with values iterated in insertion order. This is similar to the Java 1.4
 * java.util.LinkedHashSet class, but compatible with earlier JVM versions. This
 * implementation is for insert-only sets.
 */
public class InsertionOrderedSet implements Set {

From source file org.largecollections.CacheSetWithUnqToString.java

public class CacheSetWithUnqToString<K> implements Set<K>, Closeable, IDb {
    public static final long serialVersionUID = 10l;
    private final static Random rnd = new Random();

    protected String folder = Constants.DEFAULT_FOLDER;
    protected int cacheSize = Constants.DEFAULT_CACHE_SIZE;

From source file org.largecollections.CacheSetWithUnqHashCode.java

public class CacheSetWithUnqHashCode<K> implements Set<K>, Closeable, IDb {
    public static final long serialVersionUID = 10l;
    private final static Random rnd = new Random();

    protected String folder = Constants.DEFAULT_FOLDER;
    protected int cacheSize = Constants.DEFAULT_CACHE_SIZE;

From source file com.github.jsonj.JsonSet.java

/**
 * Representation of json arrays that behaves like a set.
 */
public class JsonSet extends JsonArray implements Set<JsonElement> {
    private static final long serialVersionUID = 753773658521455994L;
    private IdStrategy strategy = null;

From source file org.largecollections.CacheSet.java

public class CacheSet<K> implements Set<K>, Closeable, IDb {
    public static final long serialVersionUID = 10l;
    private final static Random rnd = new Random();

    protected String folder = Constants.DEFAULT_FOLDER;
    protected int cacheSize = Constants.DEFAULT_CACHE_SIZE;

From source file org.apache.openjpa.util.AbstractLRSProxyCollection.java

/**
 * A collection proxy designed for collections backed by extremely large
 * result sets in which each call to {@link #iterator} may perform a database
 * query. Changes to the collection are tracked through a
 * {@link ChangeTracker}. This collection has the following limitations:
 * <ul>

From source file edu.umd.cfar.lamp.viper.util.Range.java

/**
 * This class represents a set of Intervals. Note that 
 * all indexes must all be Comparable.
 */
public class Range implements Cloneable, Set, IntervalIndexList {
    /**

From source file io.sweers.arraysetbackport.ArraySet.java

/**
 * ArraySet is a generic set data structure that is designed to be more memory efficient than a
 * traditional {@link java.util.HashSet}.  The design is very similar to
 * {@link ArrayMap}, with all of the caveats described there.  This implementation is
 * separate from ArrayMap, however, so the Object array contains only one item for each
 * entry in the set (instead of a pair for a mapping).