Lines Matching refs:result
160 int[] result = new int[values.length];
162 result[values[i]] = i;
165 return result;
192 int[] result = new int[limit-start];
193 for (int i=0; i < result.length; i++) {
194 result[i] = i + start;
197 // now we'll sort result[], with the following comparison:
198 // result[i] lessthan result[j] iff values[result[i]] < values[result[j]]
201 for (int i=0; i < result.length-1; i++) {
203 int currentValue = values[result[minIndex]];
204 for (int j=i; j < result.length; j++) {
205 if (values[result[j]] < currentValue) {
207 currentValue = values[result[minIndex]];
210 int temp = result[i];
211 result[i] = result[minIndex];
212 result[minIndex] = temp;
215 // shift result by start:
217 for (int i=0; i < result.length; i++) {
218 result[i] -= start;
224 for (k=0; k < result.length; k++) {
225 if (result[k] != k) {
230 if (k == result.length) {
234 // now return inverse of result:
235 return createInverseMap(result);
296 int[] result = new int[limit-start];
306 System.arraycopy(values, start, result, 0, limit-start);
309 for (int j=0; j < result.length; j++) {
310 result[j] = values[j+start] - baseValue;
314 return result;