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

public class WeakHashSet extends AbstractSet implements Set {
    private transient WeakHashMap map;

    public WeakHashSet() {
        map = new WeakHashMap();
    }

From source file NumberedSet.java

/**
 * Class which keeps a set of values and assigns each value a unique positive index.  The index
 * can be accessed using the #getIndex() method.
 * @author tsmorton
 *
 */

From source file IndexedSet.java

/**
 *
 * @author  Andreou Dimitris, email: jim.andreou (at) gmail (dot) com 
 */
public class IndexedSet<T> extends AbstractCollection<T> implements Set<T> {
    private final List<T> list = new ArrayList<T>();

From source file ListSet.java

/**
 * A thin wrapper around a <code>List</code> transforming it into a modifiable
 * <code>Set</code>.
 * 
 * @version <tt>$Revision: 2800 $</tt>
 * @author <a href="mailto:jason@planet57.com">Jason Dillon</a>

From source file ConcurrentSet.java

/**
 * @author Ben Meadowcroft
 */
public class ConcurrentSet<Q> implements Set<Q> {
    /** Piggy back off a concurrent hash map to get "weekly consistent" iterators etc */
    private ConcurrentHashMap<Q, Object> map = new ConcurrentHashMap<Q, Object>();

From source file SetList.java

/*********************************************************************
 * 
 * A List that, like a Set, contains no duplicate Elements.
 * 
 * @author <a href="http://www.CroftSoft.com/">David Wallace Croft</a>
 * @version 1998-11-23

From source file WeakHashSet.java

/**
 * A <tt>Set</tt> implementation with <em>weak elements</em>.
 * This class implements the <tt>Set</tt> interface, backed by a hash table with
 * weak keys (actually a <tt>WeakHashMap</tt> instance).
 * An element in a <tt>WeakHashSet</tt> will automatically be removed when it
 * is no longer in ordinary use.

From source file de.dhke.projects.cutil.collections.immutable.GenericImmutableSet.java

/**
 *
 * @param <T> 
 * @param <S> 
 * @author Peter Wullinger <java@dhke.de>
 */

From source file com.evolveum.midpoint.web.page.admin.users.dto.TreeStateSet.java

/**
 * @author lazyman
 */
public class TreeStateSet<T extends Serializable> implements Set<T>, Serializable {

    private Set<T> set = new HashSet<T>();

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