/libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/ |
H A D | StreamCloseTest.java | 42 try (Stream<Integer> ints = countTo(100).stream()) { 43 ints.forEach(i -> {}); 51 try (Stream<Integer> ints = countTo(100).stream()) { 52 ints.onClose(closer); 53 ints.forEach(i -> {}); 58 try (Stream<Integer> ints = countTo(100).stream().onClose(closer)) { 59 ints.forEach(i -> {}); 64 try (Stream<Integer> ints = countTo(100).stream().filter(e -> true).onClose(closer)) { 65 ints.forEach(i -> {}); 70 try (Stream<Integer> ints [all...] |
/libcore/ojluni/src/test/java/util/stream/bootlib/java/util/stream/ |
H A D | IntStreamTestDataProvider.java | 84 final int[] ints = (int[]) data[1]; 87 name, TestData.Factory.ofArray("array:" + name, ints)}); 90 for (int i : ints) { 96 list.add(streamDataDescr("IntStream.intRange(0,l): " + ints.length, 97 () -> IntStream.range(0, ints.length))); 98 list.add(streamDataDescr("IntStream.rangeClosed(0,l): " + ints.length, 99 () -> IntStream.rangeClosed(0, ints.length))); 108 final int[] ints = (int[]) data[1]; 111 for (int i : ints) { 116 () -> Arrays.spliterator(ints))); [all...] |
H A D | StreamTestDataProvider.java | 90 final Integer[] ints = (Integer[])data[1]; 91 final List<Integer> intsAsList = Arrays.asList(ints); 93 list.add(arrayDataDescr("array:" + name, ints)); 105 (ints.length) <= 1 ? aList.subList(0, 0) : aList.subList(1, ints.length / 2))); 146 final Integer[] ints = (Integer[])data[1]; 149 () -> Arrays.spliterator(ints))); 151 () -> Arrays.spliterator(ints, 0, ints.length/2))); 155 for (Integer i : ints) [all...] |
/libcore/ojluni/src/test/java/util/stream/testlib/org/openjdk/testlib/java/util/stream/ |
H A D | IntStreamTestDataProvider.java | 85 final int[] ints = (int[]) data[1]; 88 name, TestData.Factory.ofArray("array:" + name, ints)}); 91 for (int i : ints) { 97 list.add(streamDataDescr("IntStream.intRange(0,l): " + ints.length, 98 () -> IntStream.range(0, ints.length))); 99 list.add(streamDataDescr("IntStream.rangeClosed(0,l): " + ints.length, 100 () -> IntStream.rangeClosed(0, ints.length))); 109 final int[] ints = (int[]) data[1]; 112 for (int i : ints) { 117 () -> Arrays.spliterator(ints))); [all...] |
H A D | StreamTestDataProvider.java | 93 final Integer[] ints = (Integer[])data[1]; 94 final List<Integer> intsAsList = Arrays.asList(ints); 96 list.add(arrayDataDescr("array:" + name, ints)); 108 (ints.length) <= 1 ? aList.subList(0, 0) : aList.subList(1, ints.length / 2))); 149 final Integer[] ints = (Integer[])data[1]; 152 () -> Arrays.spliterator(ints))); 154 () -> Arrays.spliterator(ints, 0, ints.length/2))); 158 for (Integer i : ints) [all...] |
/libcore/jsr166-tests/src/test/java/jsr166/ |
H A D | AbstractQueueTest.java | 147 Integer[] ints = new Integer[SIZE]; 149 q.addAll(Arrays.asList(ints)); 160 Integer[] ints = new Integer[SIZE]; 162 ints[i] = new Integer(i); 164 q.addAll(Arrays.asList(ints)); 174 Integer[] ints = new Integer[SIZE]; 176 ints[i] = new Integer(i); 178 q.addAll(Arrays.asList(ints));
|
H A D | PriorityQueueTest.java | 96 Integer[] ints = new Integer[SIZE]; 98 ints[i] = new Integer(i); 100 new PriorityQueue(Arrays.asList(ints)); 109 Integer[] ints = new Integer[SIZE]; 111 ints[i] = new Integer(i); 112 PriorityQueue q = new PriorityQueue(Arrays.asList(ints)); 114 assertEquals(ints[i], q.poll()); 124 Integer[] ints = new Integer[SIZE]; 126 ints[i] = new Integer(i); 127 q.addAll(Arrays.asList(ints)); [all...] |
H A D | ConcurrentLinkedQueueTest.java | 78 Integer[] ints = new Integer[SIZE]; 80 ints[i] = new Integer(i); 82 new ConcurrentLinkedQueue(Arrays.asList(ints)); 91 Integer[] ints = new Integer[SIZE]; 93 ints[i] = new Integer(i); 94 ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(Arrays.asList(ints)); 96 assertEquals(ints[i], q.poll()); 209 Integer[] ints = new Integer[SIZE]; 211 ints[i] = new Integer(i); 213 q.addAll(Arrays.asList(ints)); [all...] |
H A D | PriorityBlockingQueueTest.java | 125 Integer[] ints = new Integer[SIZE]; 127 ints[i] = i; 128 Collection<Integer> elements = Arrays.asList(ints); 139 Integer[] ints = new Integer[SIZE]; 141 ints[i] = i; 142 PriorityBlockingQueue q = new PriorityBlockingQueue(Arrays.asList(ints)); 144 assertEquals(ints[i], q.poll()); 154 Integer[] ints = new Integer[SIZE]; 156 ints[i] = new Integer(i); 157 q.addAll(Arrays.asList(ints)); [all...] |
H A D | ThreadLocalRandom8Test.java | 39 * Invoking sized ints, long, doubles, with negative sizes throws 45 () -> r.ints(-1L), 46 () -> r.ints(-1L, 2, 3), 56 * Invoking bounded ints, long, doubles, with illegal bounds throws 62 () -> r.ints(2, 1), 63 () -> r.ints(10, 42, 42), 73 * A parallel sized stream of ints generates the given number of values 81 r.ints(size).parallel().forEach(x -> counter.increment()); 118 * Each of a parallel sized stream of bounded ints is within bounds 127 r.ints(siz [all...] |
H A D | ConcurrentSkipListSetTest.java | 59 * Returns a new set of first 5 ints. 104 Integer[] ints = new Integer[SIZE]; 106 ints[i] = new Integer(i); 108 new ConcurrentSkipListSet(Arrays.asList(ints)); 117 Integer[] ints = new Integer[SIZE]; 119 ints[i] = new Integer(i); 120 ConcurrentSkipListSet q = new ConcurrentSkipListSet(Arrays.asList(ints)); 122 assertEquals(ints[i], q.pollFirst()); 132 Integer[] ints = new Integer[SIZE]; 134 ints[ [all...] |
H A D | TreeSetTest.java | 63 * Returns a new set of first 5 ints. 108 Integer[] ints = new Integer[SIZE]; 110 ints[i] = new Integer(i); 112 new TreeSet(Arrays.asList(ints)); 121 Integer[] ints = new Integer[SIZE]; 123 ints[i] = new Integer(i); 124 TreeSet q = new TreeSet(Arrays.asList(ints)); 126 assertEquals(ints[i], q.pollFirst()); 136 Integer[] ints = new Integer[SIZE]; 138 ints[ [all...] |
H A D | LinkedBlockingQueueTest.java | 117 Integer[] ints = new Integer[SIZE]; 119 ints[i] = new Integer(i); 120 Collection<Integer> elements = Arrays.asList(ints); 131 Integer[] ints = new Integer[SIZE]; 133 ints[i] = new Integer(i); 134 LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints)); 136 assertEquals(ints[i], q.poll()); 211 Integer[] ints = new Integer[SIZE]; 213 ints[i] = new Integer(i); 214 Collection<Integer> elements = Arrays.asList(ints); [all...] |
H A D | ConcurrentSkipListSubSetTest.java | 58 * Returns a new set of first 5 ints. 76 * Returns a new set of first 5 negative ints. 195 Integer[] ints = new Integer[SIZE]; 197 q.addAll(Arrays.asList(ints)); 208 Integer[] ints = new Integer[SIZE]; 210 ints[i] = new Integer(i + SIZE); 212 q.addAll(Arrays.asList(ints)); 222 Integer[] ints = new Integer[SIZE]; 224 ints[i] = new Integer(SIZE - 1 - i); 227 assertTrue(q.addAll(Arrays.asList(ints))); [all...] |
H A D | TreeSubSetTest.java | 58 * Returns a new set of first 5 ints. 192 Integer[] ints = new Integer[SIZE]; 194 q.addAll(Arrays.asList(ints)); 205 Integer[] ints = new Integer[SIZE]; 207 ints[i] = new Integer(i + SIZE); 209 q.addAll(Arrays.asList(ints)); 219 Integer[] ints = new Integer[SIZE]; 221 ints[i] = new Integer(SIZE - 1 - i); 224 assertTrue(q.addAll(Arrays.asList(ints))); 423 Integer[] ints [all...] |
H A D | LinkedListTest.java | 66 Integer[] ints = new Integer[SIZE]; 68 ints[i] = i; 69 LinkedList q = new LinkedList(Arrays.asList(ints)); 71 assertEquals(ints[i], q.poll()); 149 Integer[] ints = new Integer[SIZE]; 151 ints[i] = i; 154 assertTrue(q.addAll(Arrays.asList(ints))); 156 assertEquals(ints[i], q.poll()); 352 Integer[] ints = new Integer[SIZE]; 353 Integer[] array = q.toArray(ints); [all...] |
H A D | SynchronousQueueTest.java | 112 Integer[] ints = new Integer[1]; 113 for (int i = 0; i < ints.length; i++) 114 ints[i] = i; 115 Collection<Integer> coll = Arrays.asList(ints); 363 Integer[] ints = new Integer[1]; ints[0] = zero; 364 assertFalse(q.containsAll(Arrays.asList(ints))); 376 Integer[] ints = new Integer[1]; ints[0] = zero; 377 assertFalse(q.retainAll(Arrays.asList(ints))); [all...] |
H A D | ArrayBlockingQueueTest.java | 113 Integer[] ints = new Integer[SIZE]; 115 ints[i] = i; 116 Collection<Integer> elements = Arrays.asList(ints); 127 Integer[] ints = new Integer[SIZE]; 129 ints[i] = i; 130 Collection<Integer> elements = Arrays.asList(ints); 141 Integer[] ints = new Integer[SIZE]; 143 ints[i] = i; 144 Collection<Integer> elements = Arrays.asList(ints); 147 assertEquals(ints[ [all...] |
H A D | ConcurrentLinkedDequeTest.java | 81 Integer[] ints = new Integer[SIZE]; 83 ints[i] = new Integer(i); 85 new ConcurrentLinkedDeque(Arrays.asList(ints)); 94 Integer[] ints = new Integer[SIZE]; 96 ints[i] = new Integer(i); 97 ConcurrentLinkedDeque q = new ConcurrentLinkedDeque(Arrays.asList(ints)); 99 assertEquals(ints[i], q.poll()); 337 Integer[] ints = new Integer[SIZE]; 339 ints[i] = new Integer(i); 341 q.addAll(Arrays.asList(ints)); [all...] |
H A D | LinkedTransferQueueTest.java | 97 Integer[] ints = new Integer[SIZE]; 99 ints[i] = i; 100 Collection<Integer> elements = Arrays.asList(ints); 111 Integer[] ints = new Integer[SIZE]; 113 ints[i] = i; 115 List intList = Arrays.asList(ints); 127 assertEquals(ints[i], q.poll()); 165 Integer[] ints = new Integer[SIZE]; 167 ints[i] = i; 169 q.addAll(Arrays.asList(ints)); [all...] |
H A D | ArrayDequeTest.java | 77 Integer[] ints = new Integer[SIZE]; 79 ints[i] = new Integer(i); 81 new ArrayDeque(Arrays.asList(ints)); 90 Integer[] ints = new Integer[SIZE]; 92 ints[i] = new Integer(i); 93 ArrayDeque q = new ArrayDeque(Arrays.asList(ints)); 95 assertEquals(ints[i], q.pollFirst()); 322 Integer[] ints = new Integer[SIZE]; 324 ints[i] = new Integer(i); 326 q.addAll(Arrays.asList(ints)); [all...] |
/libcore/luni/src/test/java/libcore/java/lang/reflect/ |
H A D | ArrayTest.java | 28 private static int[] ints; field in class:ArrayTest 39 ints = new int[] { 0xffffffff }; 50 try { Array.getBoolean(ints, 0); fail(); } catch (IllegalArgumentException expected) {} 62 try { Array.getByte(ints, 0); fail(); } catch (IllegalArgumentException expected) {} 74 try { Array.getChar(ints, 0); fail(); } catch (IllegalArgumentException expected) {} 86 assertEquals((double) ints[0], Array.getDouble(ints, 0)); 98 assertEquals((float) ints[0], Array.getFloat(ints, 0)); 110 assertEquals(ints[ [all...] |
/libcore/luni/src/test/java/libcore/java/util/ |
H A D | RandomTest.java | 54 int[] streamRands = new Random(0).ints().limit(limit).toArray(); 67 int[] streamRands = new Random(0).ints(size).toArray(); 69 assertEquals(size, new Random(0).ints(size).count()); 72 new Random(0).ints(-1); 87 int[] streamRands = new Random(0).ints(origin, bound).limit(limit).toArray(); 91 new Random(0).ints(100, 0); 106 int[] streamRands = new Random(0).ints(size, origin, bound).toArray(); 108 assertEquals(size, new Random(0).ints(size, origin, bound).count()); 111 new Random(0).ints(-1, 10, 20); 115 new Random(0).ints(1 [all...] |
H A D | PrimitiveIteratorTest.java | 32 private final int[] ints; field in class:PrimitiveIteratorTest.CannedIntIterator 35 public CannedIntIterator(int[] ints) { argument 36 this.ints = ints; 42 return ints[idx++]; 47 return idx < ints.length;
|
/libcore/luni/src/main/java/java/math/ |
H A D | NativeBN.java | 47 public static native void litEndInts2bn(int[] ints, int len, boolean neg, long ret); argument
|