Lines Matching defs:work
4 * this work for additional information regarding copyright ownership.
275 double[] work;
278 work = getDataRef();
281 work = new double[length];
282 System.arraycopy(values, begin, work, 0, length);
288 return select(work, pivotsHeap, 0);
291 return select(work, pivotsHeap, length - 1);
293 double lower = select(work, pivotsHeap, intPos - 1);
294 double upper = select(work, pivotsHeap, intPos);
299 * Select the k<sup>th</sup> smallest element from work array
300 * @param work work array (will be reorganized during the call)
309 private double select(final double[] work, final int[] pivotsHeap, final int k) {
312 int end = work.length;
323 // select a pivot and partition work array around it
324 pivot = partition(work, begin, end, medianOf3(work, begin, end));
332 return work[k];
347 insertionSort(work, begin, end);
348 return work[k];
353 * @param work data array
359 int medianOf3(final double[] work, final int begin, final int end) {
363 final double wBegin = work[begin];
364 final double wMiddle = work[middle];
365 final double wEnd = work[inclusiveEnd];
390 * @param work data array
396 private int partition(final double[] work, final int begin, final int end, final int pivot) {
398 final double value = work[pivot];
399 work[pivot] = work[begin];
404 while ((i < j) && (work[j] >= value)) {
407 while ((i < j) && (work[i] <= value)) {
412 final double tmp = work[i];
413 work[i++] = work[j];
414 work[j--] = tmp;
418 if ((i >= end) || (work[i] > value)) {
421 work[begin] = work[i];
422 work[i] = value;
429 * @param work array to sort
433 private void insertionSort(final double[] work, final int begin, final int end) {
435 final double saved = work[j];
437 while ((i >= begin) && (saved < work[i])) {
438 work[i + 1] = work[i];
441 work[i + 1] = saved;