()
| 495 | |
| 496 | |
| 497 | public int minIndex() { |
| 498 | checkMinMax("minIndex"); |
| 499 | double m; |
| 500 | int mi = -1; |
| 501 | for (int i = 0; i < count; i++) { |
| 502 | // find one good value to start |
| 503 | if (data[i] == data[i]) { |
| 504 | m = data[i]; |
| 505 | mi = i; |
| 506 | |
| 507 | // calculate the rest |
| 508 | for (int j = i+1; j < count; j++) { |
| 509 | double d = data[j]; |
| 510 | if (!Double.isNaN(d) && (d < m)) { |
| 511 | m = data[j]; |
| 512 | mi = j; |
| 513 | } |
| 514 | } |
| 515 | break; |
| 516 | } |
| 517 | } |
| 518 | return mi; |
| 519 | } |
| 520 | |
| 521 | |
| 522 | /** |