()
| 608 | |
| 609 | |
| 610 | public int maxIndex() { |
| 611 | checkMinMax("maxIndex"); |
| 612 | double m = Double.NaN; |
| 613 | int mi = -1; |
| 614 | for (int i = 0; i < count; i++) { |
| 615 | // find one good value to start |
| 616 | if (data[i] == data[i]) { |
| 617 | m = data[i]; |
| 618 | mi = i; |
| 619 | |
| 620 | // calculate the rest |
| 621 | for (int j = i+1; j < count; j++) { |
| 622 | double d = data[j]; |
| 623 | if (!Double.isNaN(d) && (d > m)) { |
| 624 | m = data[j]; |
| 625 | mi = j; |
| 626 | } |
| 627 | } |
| 628 | break; |
| 629 | } |
| 630 | } |
| 631 | return mi; |
| 632 | } |
| 633 | |
| 634 | |
| 635 | public double sum() { |