41 |
|
|
42 |
|
/** |
43 |
|
* Returns the index of some element equal to given target, or |
44 |
< |
* -1 if not present |
44 |
> |
* -1 if not present. |
45 |
|
* @param target the element to search for |
46 |
|
* @return the index or -1 if not present |
47 |
|
*/ |
77 |
|
public abstract ParallelLongArrayWithBounds cumulate(LongReducer reducer, long base); |
78 |
|
|
79 |
|
/** |
80 |
< |
* Replaces each element with the running sum |
80 |
> |
* Replaces each element with the running sum. |
81 |
|
* @return this (to simplify use in expressions) |
82 |
|
*/ |
83 |
|
public abstract ParallelLongArrayWithBounds cumulateSum(); |
93 |
|
public abstract long precumulate(LongReducer reducer, long base); |
94 |
|
|
95 |
|
/** |
96 |
< |
* Replaces each element with its prefix sum |
96 |
> |
* Replaces each element with its prefix sum. |
97 |
|
* @return the total sum |
98 |
|
*/ |
99 |
|
public abstract long precumulateSum(); |
113 |
|
* Comparable. Unlike Arrays.sort, this sort does not |
114 |
|
* guarantee that elements with equal keys maintain their relative |
115 |
|
* position in the array. |
116 |
< |
* @throws ClassCastException if any element is not Comparable. |
116 |
> |
* @throws ClassCastException if any element is not Comparable |
117 |
|
* @return this (to simplify use in expressions) |
118 |
|
*/ |
119 |
|
public abstract ParallelLongArrayWithBounds sort(); |
120 |
|
|
121 |
|
} |
122 |
– |
|