Example usage for java.util Collection interface-usage

Introduction

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

Usage

From source file IteratorCollection.java

/**
 * INTERNAL: A wrapper class for presenting a collection view on iterators. The
 * wrapped iterator will be lazily traversed.</p>
 */

public class IteratorCollection<T> implements Collection<T> {

From source file Main.java

interface Collection2<T> extends Collection<T> {
    default void forEachIf(Consumer<T> action, Predicate<T> filter) {
        this.stream().filter(filter).forEach(action);
    }
}

From source file logicProteinHypernetwork.analysis.complexes.Complex.java

/**
 * Class Complex models a list of proteins that are in one complex.
 * 
 * @author Johannes Kster <johannes.koester@tu-dortmund.de>
 */
public class Complex extends ArrayList<Protein> implements Collection<Protein>, Comparable<Complex> {

From source file org.grails.datastore.mapping.riak.collection.AbstractRiakCollection.java

/**
 * @author J. Brisbin <jon@jbrisbin.com>
 */
@SuppressWarnings("rawtypes")
public abstract class AbstractRiakCollection<T> implements Collection, RiakCollection {

From source file com.phoenixst.collections.AbstractSingletonCollection.java

/**
 *  A modifiable, lazy singleton <code>Collection</code> view.  This
 *  view may be empty at any given point in time.
 *
 *  @version    $Revision: 1.11 $
 *  @author     Ray A. Conner

From source file SortedMultiSet.java

/**
 * 
 * @author Marc Woerlein (woerlein@informatik.uni-erlangen.de)
 * 
 * @param <Type>
 */

From source file de.fraunhofer.iosb.ilt.sta.model.core.EntitySet.java

/**
 * Should be implemented by all collections of entities.
 *
 * @author jab
 * @param <T> Type of the collection items. Must implement Entity
 */

From source file CharPrefixTree.java

public class CharPrefixTree implements Collection<String> {
    private static class Node {
        public Map<Character, Node> children = new HashMap<Character, Node>();
    }

    Node root = null;

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

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

From source file edu.uci.ics.jung.utils.MapBinaryHeap.java

/**
 * An array-based binary heap implementation of a priority queue, 
 * which also provides
 * efficient <code>update()</code> and <code>contains</code> operations.
 * It contains extra infrastructure (a hash table) to keep track of the 
 * position of each element in the array; thus, if the key value of an element