212 |
|
} |
213 |
|
|
214 |
|
/** |
215 |
< |
* Increments i, mod modulus. |
215 |
> |
* Circularly increments i, mod modulus. |
216 |
|
* Precondition and postcondition: 0 <= i < modulus. |
217 |
|
*/ |
218 |
|
static final int inc(int i, int modulus) { |
221 |
|
} |
222 |
|
|
223 |
|
/** |
224 |
< |
* Decrements i, mod modulus. |
224 |
> |
* Circularly decrements i, mod modulus. |
225 |
|
* Precondition and postcondition: 0 <= i < modulus. |
226 |
|
*/ |
227 |
|
static final int dec(int i, int modulus) { |
234 |
|
* Precondition: 0 <= i < modulus, 0 <= distance <= modulus. |
235 |
|
* @return index 0 <= i < modulus |
236 |
|
*/ |
237 |
< |
static final int add(int i, int distance, int modulus) { |
237 |
> |
static final int inc(int i, int distance, int modulus) { |
238 |
|
if ((i += distance) - modulus >= 0) i -= modulus; |
239 |
|
return i; |
240 |
|
} |
244 |
|
* Index i must be logically ahead of index j. |
245 |
|
* Precondition: 0 <= i < modulus, 0 <= j < modulus. |
246 |
|
* @return the "circular distance" from j to i; corner case i == j |
247 |
< |
* is diambiguated to "empty", returning 0. |
247 |
> |
* is disambiguated to "empty", returning 0. |
248 |
|
*/ |
249 |
|
static final int sub(int i, int j, int modulus) { |
250 |
|
if ((i -= j) < 0) i += modulus; |
840 |
|
final int i, n; |
841 |
|
return ((n = sub(getFence(), i = cursor, es.length) >> 1) <= 0) |
842 |
|
? null |
843 |
< |
: new DeqSpliterator(i, cursor = add(i, n, es.length)); |
843 |
> |
: new DeqSpliterator(i, cursor = inc(i, n, es.length)); |
844 |
|
} |
845 |
|
|
846 |
|
public void forEachRemaining(Consumer<? super E> action) { |