Lines Matching refs:begin
143 public void setData(final double[] values, final int begin, final int length) {
150 super.setData(values, begin, length);
204 * <code>values[begin]</code> if <code>length = 1 </code></li>
228 * position <code>begin</code> in the array and including <code>length</code>
236 * <li>Returns (for any value of <code>p</code>) <code>values[begin]</code>
239 * is null , <code>begin</code> or <code>length</code> is invalid, or
249 * @param begin the first (0-based) element to include in the computation
255 public double evaluate(final double[] values, final int begin,
258 test(values, begin, length);
268 return values[begin]; // always return single value for n = 1
282 System.arraycopy(values, begin, work, 0, length);
311 int begin = 0;
315 while (end - begin > MIN_SELECT_SIZE) {
324 pivot = partition(work, begin, end, medianOf3(work, begin, end));
339 begin = pivot + 1;
347 insertionSort(work, begin, end);
354 * @param begin index of the first element of the slice
359 int medianOf3(final double[] work, final int begin, final int end) {
362 final int middle = begin + (inclusiveEnd - begin) / 2;
363 final double wBegin = work[begin];
371 return (wBegin < wEnd) ? inclusiveEnd : begin;
375 return begin;
391 * @param begin index of the first element of the slice
396 private int partition(final double[] work, final int begin, final int end, final int pivot) {
399 work[pivot] = work[begin];
401 int i = begin + 1;
421 work[begin] = work[i];
430 * @param begin index of the first element of the slice to sort
433 private void insertionSort(final double[] work, final int begin, final int end) {
434 for (int j = begin + 1; j < end; j++) {
437 while ((i >= begin) && (saved < work[i])) {
