1.1 --- a/emul/compact/src/main/java/java/util/RandomAccess.java	Fri Mar 22 16:59:47 2013 +0100
     1.2 +++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.3 @@ -1,68 +0,0 @@
     1.4 -/*
     1.5 - * Copyright (c) 2000, 2006, Oracle and/or its affiliates. All rights reserved.
     1.6 - * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
     1.7 - *
     1.8 - * This code is free software; you can redistribute it and/or modify it
     1.9 - * under the terms of the GNU General Public License version 2 only, as
    1.10 - * published by the Free Software Foundation.  Oracle designates this
    1.11 - * particular file as subject to the "Classpath" exception as provided
    1.12 - * by Oracle in the LICENSE file that accompanied this code.
    1.13 - *
    1.14 - * This code is distributed in the hope that it will be useful, but WITHOUT
    1.15 - * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
    1.16 - * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
    1.17 - * version 2 for more details (a copy is included in the LICENSE file that
    1.18 - * accompanied this code).
    1.19 - *
    1.20 - * You should have received a copy of the GNU General Public License version
    1.21 - * 2 along with this work; if not, write to the Free Software Foundation,
    1.22 - * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
    1.23 - *
    1.24 - * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
    1.25 - * or visit www.oracle.com if you need additional information or have any
    1.26 - * questions.
    1.27 - */
    1.28 -
    1.29 -package java.util;
    1.30 -
    1.31 -/**
    1.32 - * Marker interface used by <tt>List</tt> implementations to indicate that
    1.33 - * they support fast (generally constant time) random access.  The primary
    1.34 - * purpose of this interface is to allow generic algorithms to alter their
    1.35 - * behavior to provide good performance when applied to either random or
    1.36 - * sequential access lists.
    1.37 - *
    1.38 - * <p>The best algorithms for manipulating random access lists (such as
    1.39 - * <tt>ArrayList</tt>) can produce quadratic behavior when applied to
    1.40 - * sequential access lists (such as <tt>LinkedList</tt>).  Generic list
    1.41 - * algorithms are encouraged to check whether the given list is an
    1.42 - * <tt>instanceof</tt> this interface before applying an algorithm that would
    1.43 - * provide poor performance if it were applied to a sequential access list,
    1.44 - * and to alter their behavior if necessary to guarantee acceptable
    1.45 - * performance.
    1.46 - *
    1.47 - * <p>It is recognized that the distinction between random and sequential
    1.48 - * access is often fuzzy.  For example, some <tt>List</tt> implementations
    1.49 - * provide asymptotically linear access times if they get huge, but constant
    1.50 - * access times in practice.  Such a <tt>List</tt> implementation
    1.51 - * should generally implement this interface.  As a rule of thumb, a
    1.52 - * <tt>List</tt> implementation should implement this interface if,
    1.53 - * for typical instances of the class, this loop:
    1.54 - * <pre>
    1.55 - *     for (int i=0, n=list.size(); i &lt; n; i++)
    1.56 - *         list.get(i);
    1.57 - * </pre>
    1.58 - * runs faster than this loop:
    1.59 - * <pre>
    1.60 - *     for (Iterator i=list.iterator(); i.hasNext(); )
    1.61 - *         i.next();
    1.62 - * </pre>
    1.63 - *
    1.64 - * <p>This interface is a member of the
    1.65 - * <a href="{@docRoot}/../technotes/guides/collections/index.html">
    1.66 - * Java Collections Framework</a>.
    1.67 - *
    1.68 - * @since 1.4
    1.69 - */
    1.70 -public interface RandomAccess {
    1.71 -}