/libcore/ojluni/src/main/java/java/util/ |
Collections.java | 92 * two implementations, one of which is appropriate for RandomAccess 263 * does not implement the {@link RandomAccess} interface and is large, 285 if (list instanceof RandomAccess || list.size()<BINARYSEARCH_THRESHOLD) 364 * does not implement the {@link RandomAccess} interface and is large, 392 if (list instanceof RandomAccess || list.size()<BINARYSEARCH_THRESHOLD) 449 if (size < REVERSE_THRESHOLD || list instanceof RandomAccess) { 484 * implement the {@link RandomAccess} interface and is large, this 515 * implement the {@link RandomAccess} interface and is large, this 529 if (size < SHUFFLE_THRESHOLD || list instanceof RandomAccess) { 597 if (size < FILL_THRESHOLD || list instanceof RandomAccess) { [all...] |
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
AbstractListTest.java | 29 import java.util.RandomAccess; 165 al.subList(3, 7) instanceof RandomAccess); 173 !(ll.subList(3, 7) instanceof RandomAccess));
|
/libcore/luni/src/test/java/libcore/java/lang/reflect/ |
ReflectionTest.java | 32 import java.util.RandomAccess; 179 assertEquals(RandomAccess.class, bounds[2]); 380 public <T extends Comparable<T> & Serializable & RandomAccess> T methodFour(Set<T> t) {
|
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
IterablesTest.java | 44 import java.util.RandomAccess; 434 assertTrue(iterator.next() instanceof RandomAccess); 435 assertTrue(iterator.next() instanceof RandomAccess); 442 // Even though the input list doesn't implement RandomAccess, the output 444 assertTrue(iterator.next() instanceof RandomAccess); 445 assertTrue(iterator.next() instanceof RandomAccess); [all...] |
MapConstraintsTest.java | 39 import java.util.RandomAccess; 272 assertFalse(multimap.get("foo") instanceof RandomAccess); 285 assertTrue(multimap.get("foo") instanceof RandomAccess);
|
IteratorsTest.java | 40 import java.util.RandomAccess; 791 assertTrue(partitions.next() instanceof RandomAccess); 792 assertTrue(partitions.next() instanceof RandomAccess); [all...] |
/external/guava/guava-tests/test/com/google/common/collect/ |
MultimapsTest.java | 54 import java.util.RandomAccess; 137 assertTrue(multimap.get("foo") instanceof RandomAccess); 138 assertTrue(multimap.get("bar") instanceof RandomAccess); 147 assertFalse(multimap.get("foo") instanceof RandomAccess); 148 assertFalse(multimap.get("bar") instanceof RandomAccess); 676 assertFalse(multimap.get(Color.BLUE) instanceof RandomAccess); [all...] |
MapConstraintsTest.java | 41 import java.util.RandomAccess; 274 assertFalse(multimap.get("foo") instanceof RandomAccess); 287 assertTrue(multimap.get("foo") instanceof RandomAccess);
|
IteratorsTest.java | 57 import java.util.RandomAccess; 945 assertTrue(partitions.next() instanceof RandomAccess); 946 assertTrue(partitions.next() instanceof RandomAccess); [all...] |
/external/guava/guava/src/com/google/common/collect/ |
SortedLists.java | 26 import java.util.RandomAccess; 262 if (!(list instanceof RandomAccess)) {
|
ArrayListMultimap.java | 52 * #replaceValues} all implement {@link java.util.RandomAccess}.
|
Ordering.java | 609 * @return an immutable {@code RandomAccess} list of the {@code k} least 643 * @return an immutable {@code RandomAccess} list of the {@code k} least 767 * @return an immutable {@code RandomAccess} list of the {@code k} greatest 787 * @return an immutable {@code RandomAccess} list of the {@code k} greatest [all...] |
ImmutableList.java | 33 import java.util.RandomAccess; 64 implements List<E>, RandomAccess { 493 // this loop is faster for RandomAccess instances, which ImmutableLists are
|
Synchronized.java | 39 import java.util.RandomAccess; 303 return (list instanceof RandomAccess) 403 extends SynchronizedList<E> implements RandomAccess { [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
ImmutableList.java | 29 import java.util.RandomAccess; 41 implements List<E>, RandomAccess {
|
ArrayListMultimap.java | 47 * #replaceValues} all implement {@link java.util.RandomAccess}.
|
Synchronized.java | 33 import java.util.RandomAccess; 287 return (list instanceof RandomAccess) 387 extends SynchronizedList<E> implements RandomAccess {
|
AbstractMapBasedMultimap.java | 37 import java.util.RandomAccess; 329 return (list instanceof RandomAccess) 826 implements RandomAccess { [all...] |
Iterables.java | 35 import java.util.RandomAccess; 174 if (removeFrom instanceof RandomAccess && removeFrom instanceof List) { 509 * RandomAccess}, whether or not the input list does. [all...] |
/prebuilts/misc/common/swig/include/2.0.11/gcj/ |
javaprims.i | 309 class RandomAccess;
|
/external/eigen/Eigen/src/Core/ |
Functors.h | 580 template <typename Scalar, bool RandomAccess> struct linspaced_op_impl; 647 template <typename Scalar, bool RandomAccess = true> struct linspaced_op; 648 template <typename Scalar, bool RandomAccess> struct functor_traits< linspaced_op<Scalar,RandomAccess> > 650 template <typename Scalar, bool RandomAccess> struct linspaced_op 682 const linspaced_op_impl<Scalar,RandomAccess> impl; [all...] |
/external/guava/guava/src/com/google/common/primitives/ |
Booleans.java | 35 import java.util.RandomAccess; 355 implements RandomAccess, Serializable {
|
Bytes.java | 32 import java.util.RandomAccess; 269 implements RandomAccess, Serializable {
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
OpenMapRealVector.java | 233 OpenIntToDoubleHashMap randomAccess = copyThis ? entries : v.entries; 237 if (randomAccess.containsKey(key)) { 238 res.setEntry(key, randomAccess.get(key) + iter.value());
|
/libcore/luni/src/test/java/libcore/java/util/ |
OldCollectionsTest.java | 32 import java.util.RandomAccess; 719 && (a instanceof RandomAccess == b instanceof RandomAccess);
|