133 |
|
* public boolean op(Student s) { return s.credits > 90; } |
134 |
|
* } |
135 |
|
* static final IsSenior isSenior = new IsSenior(); |
136 |
< |
* static final class GpaField implements ObjectToDouble<Student> { |
136 |
> |
* static final class GpaField implements ObjectToDouble<Student> { |
137 |
|
* public double op(Student s) { return s.gpa; } |
138 |
|
* } |
139 |
|
* static final GpaField gpaField = new GpaField(); |
526 |
|
* 2, 3}, and the reducer operation adds numbers, then after |
527 |
|
* invocation of this method, the contents would be {@code 0, 1, |
528 |
|
* 3} (that is, {@code 0, 0+1, 0+1+2}, and the return value |
529 |
< |
* would be 6 (that is, {@code 1+2+3}). |
529 |
> |
* would be 6 (that is, {@code 1+2+3}). |
530 |
|
* @param reducer the reducer |
531 |
|
* @param base the result for an empty array |
532 |
|
* @return the total reduction |
551 |
|
* Sorts the array, assuming all elements are Comparable. Unlike |
552 |
|
* Arrays.sort, this sort does not guarantee that elements |
553 |
|
* with equal keys maintain their relative position in the array. |
554 |
– |
* @throws ClassCastException if any element is not Comparable |
554 |
|
* @return this (to simplify use in expressions) |
555 |
+ |
* @throws ClassCastException if any element is not Comparable |
556 |
|
*/ |
557 |
|
public ParallelArray<T> sort() { |
558 |
|
super.sort(); |