# | Line 244 | Line 244 | public class ArrayDeque<E> extends Abstr | |
---|---|---|
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; |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |