Searched refs:reversedArray (Results 1 – 2 of 2) sorted by relevance
1017 byte[] reversedArray = new byte[arraySize]; in test_sort$B()1019 reversedArray[counter] = (byte) (arraySize - counter - 1); in test_sort$B()1020 Arrays.sort(reversedArray); in test_sort$B()1023 reversedArray[counter] == (byte) counter); in test_sort$B()1033 byte[] reversedArray = new byte[arraySize]; in test_sort$BII()1036 reversedArray[counter] = (byte) (arraySize - counter - 1); in test_sort$BII()1037 originalReversedArray[counter] = reversedArray[counter]; in test_sort$BII()1039 Arrays.sort(reversedArray, startIndex, endIndex); in test_sort$BII()1042 reversedArray[counter] == originalReversedArray[counter]); in test_sort$BII()1045 reversedArray[counter] <= reversedArray[counter + 1]); in test_sort$BII()[all …]
120 double[] reversedArray = new double[100]; in test_sort$D() local121 for (int counter = 0; counter < reversedArray.length; counter++) { in test_sort$D()122 reversedArray[counter] = (reversedArray.length - counter - 1); in test_sort$D()124 Arrays.sort(reversedArray); in test_sort$D()125 for (int counter = 0; counter < reversedArray.length; counter++) { in test_sort$D()127 reversedArray[counter] == counter); in test_sort$D()157 float[] reversedArray = new float[100]; in test_sort$F() local158 for (int counter = 0; counter < reversedArray.length; counter++) { in test_sort$F()159 reversedArray[counter] = (reversedArray.length - counter - 1); in test_sort$F()161 Arrays.sort(reversedArray); in test_sort$F()[all …]