/openjdk10/jdk/test/java/awt/image/DrawImage/ |
H A D | IncorrectDestinationOffset.java | 46 private static final int SIZE = 128; field in class:IncorrectDestinationOffset 54 VolatileImage vi = gc.createCompatibleVolatileImage(SIZE, SIZE); 55 BufferedImage bi = new BufferedImage(SIZE, SIZE, 63 g2d.fillRect(0, 0, SIZE, SIZE); 77 g.fillRect(0, 0, SIZE / 2, SIZE / 2); 79 g.fillRect(SIZE / [all...] |
H A D | UnmanagedDrawImagePerformance.java | 60 private static final int SIZE = 1000; field in class:UnmanagedDrawImagePerformance 86 p.addPoint(SIZE, 0); 87 p.addPoint(0, SIZE); 88 p.addPoint(SIZE, SIZE); 106 return gc.createCompatibleVolatileImage(SIZE, SIZE, type); 110 final BufferedImage img = new BufferedImage(SIZE, SIZE, type);
|
/openjdk10/hotspot/test/compiler/intrinsics/string/ |
H A D | TestStringIntrinsicRangeChecks.java | 42 private static int SIZE = 16; field in class:TestStringIntrinsicRangeChecks 43 private static byte[] byteArray = new byte[SIZE]; 44 private static char[] charArray = new char[SIZE]; 91 for (int srcOff = 0; srcOff < SIZE; ++srcOff) { 92 for (int dstOff = 0; dstOff < SIZE; ++dstOff) { 93 for (int len = 0; len < SIZE; ++len) { 95 boolean srcOverflow = (srcOff + len) > SIZE; 96 boolean srcOverflowB = (2*srcOff + 2*len) > SIZE; 97 boolean dstOverflow = (dstOff + len) > SIZE; 98 boolean dstOverflowB = (2*dstOff + 2*len) > SIZE; [all...] |
/openjdk10/jdk/src/java.desktop/share/classes/com/sun/java/swing/plaf/motif/ |
H A D | MotifTreeUI.java | 54 static final int SIZE = 14; field in class:MotifTreeUI 114 g.drawLine(x, y, x+SIZE-1, y); 115 g.drawLine(x, y+1, x, y+SIZE-1); 118 g.drawLine(x+SIZE-1, y+1, x+SIZE-1, y+SIZE-1); 119 g.drawLine(x+1, y+SIZE-1, x+SIZE-1, y+SIZE-1); 122 g.fillRect(x+1, y+1, SIZE [all...] |
/openjdk10/jdk/test/sun/java2d/OpenGL/ |
H A D | bug7181438.java | 43 private static final int SIZE = 500; field in class:bug7181438 55 for (int i = 0; i < SIZE; ++i) { 56 for (int j = 0; j < SIZE; ++j) { 70 return gc.createCompatibleVolatileImage(SIZE, SIZE, 75 final BufferedImage bi = new BufferedImage(SIZE, SIZE, 80 bg.fillRect(0, 0, SIZE, SIZE);
|
/openjdk10/jdk/test/java/util/concurrent/tck/ |
H A D | PriorityQueueTest.java | 89 assertEquals(0, new PriorityQueue(SIZE).size()); 117 new PriorityQueue(Arrays.asList(new Integer[SIZE])); 126 Integer[] ints = new Integer[SIZE]; 127 for (int i = 0; i < SIZE - 1; ++i) 139 Integer[] ints = new Integer[SIZE]; 140 for (int i = 0; i < SIZE; ++i) 143 for (int i = 0; i < SIZE; ++i) 152 PriorityQueue q = new PriorityQueue(SIZE, cmp); 154 Integer[] ints = new Integer[SIZE]; 155 for (int i = 0; i < SIZE; [all...] |
H A D | ConcurrentLinkedQueueTest.java | 100 new ConcurrentLinkedQueue(Arrays.asList(new Integer[SIZE])); 109 Integer[] ints = new Integer[SIZE]; 110 for (int i = 0; i < SIZE - 1; ++i) 122 Integer[] ints = new Integer[SIZE]; 123 for (int i = 0; i < SIZE; ++i) 126 for (int i = 0; i < SIZE; ++i) 148 ConcurrentLinkedQueue q = populatedQueue(SIZE); 149 for (int i = 0; i < SIZE; ++i) { 150 assertEquals(SIZE - i, q.size()); 153 for (int i = 0; i < SIZE; [all...] |
H A D | AtomicIntegerArray9Test.java | 52 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); 53 for (int index : new int[] { -1, SIZE }) { 79 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); 80 for (int i = 0; i < SIZE; i++) { 94 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); 95 for (int i = 0; i < SIZE; i++) { 109 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); 110 for (int i = 0; i < SIZE; i++) { 124 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); 125 for (int i = 0; i < SIZE; [all...] |
H A D | AtomicLongArray9Test.java | 51 AtomicLongArray aa = new AtomicLongArray(SIZE); 52 for (int index : new int[] { -1, SIZE }) { 78 AtomicLongArray aa = new AtomicLongArray(SIZE); 79 for (int i = 0; i < SIZE; i++) { 93 AtomicLongArray aa = new AtomicLongArray(SIZE); 94 for (int i = 0; i < SIZE; i++) { 108 AtomicLongArray aa = new AtomicLongArray(SIZE); 109 for (int i = 0; i < SIZE; i++) { 123 AtomicLongArray aa = new AtomicLongArray(SIZE); 124 for (int i = 0; i < SIZE; [all...] |
H A D | AtomicIntegerArrayTest.java | 55 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); 56 for (int i = 0; i < SIZE; i++) 86 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); 87 for (int index : new int[] { -1, SIZE }) { 123 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); 124 for (int i = 0; i < SIZE; i++) { 138 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); 139 for (int i = 0; i < SIZE; i++) { 153 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); 154 for (int i = 0; i < SIZE; [all...] |
H A D | AtomicLongArrayTest.java | 54 AtomicLongArray aa = new AtomicLongArray(SIZE); 55 for (int i = 0; i < SIZE; i++) 85 AtomicLongArray aa = new AtomicLongArray(SIZE); 86 for (int index : new int[] { -1, SIZE }) { 122 AtomicLongArray aa = new AtomicLongArray(SIZE); 123 for (int i = 0; i < SIZE; i++) { 137 AtomicLongArray aa = new AtomicLongArray(SIZE); 138 for (int i = 0; i < SIZE; i++) { 152 AtomicLongArray aa = new AtomicLongArray(SIZE); 153 for (int i = 0; i < SIZE; [all...] |
H A D | LinkedListTest.java | 105 Integer[] ints = new Integer[SIZE]; 106 for (int i = 0; i < SIZE; ++i) 109 for (int i = 0; i < SIZE; ++i) 131 LinkedList q = populatedQueue(SIZE); 132 for (int i = 0; i < SIZE; ++i) { 133 assertEquals(SIZE - i, q.size()); 136 for (int i = 0; i < SIZE; ++i) { 166 for (int i = 0; i < SIZE; ++i) { 188 Integer[] ints = new Integer[SIZE]; 189 for (int i = 0; i < SIZE; [all...] |
H A D | LinkedBlockingDequeTest.java | 62 return new LinkedBlockingDeque(SIZE); 120 LinkedBlockingDeque q = populatedDeque(SIZE); 121 for (int i = 0; i < SIZE; ++i) { 122 assertEquals(SIZE - i, q.size()); 125 for (int i = 0; i < SIZE; ++i) { 175 LinkedBlockingDeque q = populatedDeque(SIZE); 176 for (int i = 0; i < SIZE; ++i) { 186 LinkedBlockingDeque q = populatedDeque(SIZE); 187 for (int i = SIZE - 1; i >= 0; --i) { 197 LinkedBlockingDeque q = populatedDeque(SIZE); [all...] |
H A D | ArrayBlockingQueueTest.java | 65 return populatedQueue(0, SIZE, 2 * SIZE, fair); 81 return populatedQueue(0, SIZE, 2 * SIZE, true); 87 return populatedQueue(0, SIZE, 2 * SIZE, false); 129 assertEquals(SIZE, new ArrayBlockingQueue(SIZE).remainingCapacity()); 164 Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); 166 new ArrayBlockingQueue(SIZE, fals [all...] |
H A D | LinkedBlockingQueueTest.java | 62 return new LinkedBlockingQueue(SIZE); 106 assertEquals(SIZE, new LinkedBlockingQueue(SIZE).remainingCapacity()); 134 Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); 146 Integer[] ints = new Integer[SIZE]; 147 for (int i = 0; i < SIZE - 1; ++i) 160 Integer[] ints = new Integer[SIZE]; 161 for (int i = 0; i < SIZE; ++i) 164 for (int i = 0; i < SIZE; ++i) 187 BlockingQueue q = populatedQueue(SIZE); [all...] |
H A D | AtomicReferenceArray9Test.java | 51 AtomicReferenceArray<Integer> aa = new AtomicReferenceArray<>(SIZE); 52 for (int index : new int[] { -1, SIZE }) { 78 AtomicReferenceArray<Integer> aa = new AtomicReferenceArray<>(SIZE); 79 for (int i = 0; i < SIZE; i++) { 93 AtomicReferenceArray<Integer> aa = new AtomicReferenceArray<>(SIZE); 94 for (int i = 0; i < SIZE; i++) { 108 AtomicReferenceArray<Integer> aa = new AtomicReferenceArray<>(SIZE); 109 for (int i = 0; i < SIZE; i++) { 123 AtomicReferenceArray<Integer> aa = new AtomicReferenceArray<>(SIZE); 124 for (int i = 0; i < SIZE; [all...] |
H A D | PriorityBlockingQueueTest.java | 63 return new PriorityBlockingQueue(SIZE); 116 new PriorityBlockingQueue(SIZE).remainingCapacity()); 143 Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); 154 Integer[] ints = new Integer[SIZE]; 155 for (int i = 0; i < SIZE - 1; ++i) 168 Integer[] ints = new Integer[SIZE]; 169 for (int i = 0; i < SIZE; ++i) 172 for (int i = 0; i < SIZE; ++i) 181 PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE, cmp); 183 Integer[] ints = new Integer[SIZE]; [all...] |
H A D | ConcurrentLinkedDequeTest.java | 104 new ConcurrentLinkedDeque(Arrays.asList(new Integer[SIZE])); 113 Integer[] ints = new Integer[SIZE]; 114 for (int i = 0; i < SIZE - 1; ++i) 126 Integer[] ints = new Integer[SIZE]; 127 for (int i = 0; i < SIZE; ++i) 130 for (int i = 0; i < SIZE; ++i) 152 ConcurrentLinkedDeque q = populatedDeque(SIZE); 153 for (int i = 0; i < SIZE; ++i) { 154 assertEquals(SIZE - i, q.size()); 157 for (int i = 0; i < SIZE; [all...] |
H A D | ConcurrentHashMap8Test.java | 586 static final int SIZE = 10000; field in class:ConcurrentHashMap8Test 591 longMap = new ConcurrentHashMap<Long, Long>(SIZE); 592 for (int i = 0; i < SIZE; ++i) 614 assertEquals(adder.sum(), SIZE * (SIZE - 1) / 2); 624 assertEquals(adder.sum(), SIZE * (SIZE - 1)); 634 assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); 644 assertEquals(adder.sum(), 3 * SIZE * (SIZ [all...] |
/openjdk10/jdk/test/java/util/stream/test/org/openjdk/tests/java/util/ |
H A D | SplittableRandomTest.java | 90 static final int SIZE = 1 << 16; field in class:SplittableRandomTest 123 sf -> StreamSupport.stream(new RandomBoxedSpliterator<>(new SplittableRandom(), 0, SIZE, sf), false). 130 String.format("new SplittableRandom().ints().limit(%d)", SIZE), 131 () -> new SplittableRandom().ints().limit(SIZE)), 132 randomAsserter(SIZE, Integer.MAX_VALUE, 0) 137 String.format("new SplittableRandom().ints(%d)", SIZE), 138 () -> new SplittableRandom().ints(SIZE)), 139 randomAsserter(SIZE, Integer.MAX_VALUE, 0) 144 String.format("new RandomBoxedSpliterator(0, %d, sr -> sr.nextInt())", SIZE), 146 randomAsserter(SIZE, Intege [all...] |
/openjdk10/jdk/test/java/awt/Graphics/IncorrectFractionalClip/ |
H A D | IncorrectFractionalClip.java | 47 private static final int SIZE = 128; field in class:IncorrectFractionalClip 70 bi = new BufferedImage(SIZE, SIZE, TYPE_INT_ARGB); 71 gold = new BufferedImage(SIZE, SIZE, TYPE_INT_ARGB); 119 final int destSize = (int) Math.ceil(SIZE / scale); 124 destH = SIZE; 126 destW = SIZE; 132 g.setClip(step, 0, 1, SIZE); 134 g.setClip(new Area(new Rectangle(step, 0, 1, SIZE))); [all...] |
/openjdk10/jdk/test/javax/swing/JComponent/6683775/ |
H A D | bug6683775.java | 43 SIZE = 200; field in class:bug6683775 61 backgroundFrame.setBounds(LOC, LOC, SIZE, SIZE); 70 testFrame.setBounds(LOC, LOC, SIZE, SIZE); 79 robot.createScreenCapture(new Rectangle(LOC, LOC, SIZE, SIZE)); 82 if (redRGB != capture.getRGB(SIZE/2, SIZE/2)) {
|
/openjdk10/jdk/test/java/util/Collections/ |
H A D | Swap.java | 34 static final int SIZE = 100; field in class:Swap 39 for (int i=0; i < SIZE-1; i++) 43 l2.set(SIZE-1, Boolean.TRUE);
|
H A D | Rotate.java | 35 static final int SIZE = 120; field in class:Rotate 44 for (int j=0; j<SIZE; j++) 53 totalDist = (totalDist + dist) % SIZE; 55 totalDist += SIZE; 57 for (int k=totalDist; k<SIZE; k++, index++)
|
/openjdk10/jdk/test/java/awt/Graphics2D/DrawString/ |
H A D | DrawRotatedString.java | 42 private static final int SIZE = 500; field in class:DrawRotatedString 53 for (int i = 0; i < SIZE; ++i) { 65 final BufferedImage bi = new BufferedImage(SIZE, SIZE, 72 bg.fillRect(0, 0, SIZE, SIZE);
|