Example usage for java.util RandomAccess interface-usage

Introduction

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

Usage

From source file com.asakusafw.runtime.flow.FileMapListBuffer.java

/**
 * Implementation of {@link ListBuffer} using a file as backing store.
 * @param <E> element type
 * @since 0.1.0
 * @version 0.7.0
 */

From source file Tree.java

/**
 * TreeSet and TreeMap are both Balanced Trees that don't allow duplicate keys.
 * This class is designed to provide a generic tree that allows duplicates.
 */
public class Tree<T extends Tree<T>> implements Collection<T>, RandomAccess, Iterable<T> {
    protected CopyOnWriteArrayList<T> subtrees;

From source file org.kuali.coeus.common.budget.framework.query.QueryList.java

public final class QueryList<E> implements List<E>, RandomAccess, Cloneable, Serializable {

    private static final long serialVersionUID = -3215265492607686197L;
    private static final org.apache.commons.logging.Log LOG = org.apache.commons.logging.LogFactory
            .getLog(QueryList.class);
    //using delegation to make it easier to swap out underlying implementation

From source file lineage2.commons.collections.LazyArrayList.java

/**
 * @author Mobius
 * @version $Revision: 1.0 $
 */
@SuppressWarnings("unchecked")
public class LazyArrayList<E> implements List<E>, RandomAccess, Cloneable, java.io.Serializable {

From source file org.kuali.kra.budget.calculator.QueryList.java

/**
 * This class...
 */
public final class QueryList<E> implements List<E>, RandomAccess, Cloneable, Serializable {

    private static final long serialVersionUID = -3215265492607686197L;

From source file CopyOnWriteArrayList.java

/**
 * A thread-safe variant of {@link java.util.ArrayList} in which all mutative
 * operations (<tt>add</tt>, <tt>set</tt>, and so on) are implemented by
 * making a fresh copy of the underlying array.
 *
 * <p> This is ordinarily too costly, but may be <em>more</em> efficient