99 |
|
/** |
100 |
|
* The number of elements in the priority queue. |
101 |
|
*/ |
102 |
< |
private int size; |
102 |
> |
int size; |
103 |
|
|
104 |
|
/** |
105 |
|
* The comparator, or null if priority queue uses elements' |
609 |
|
* avoid missing traversing elements. |
610 |
|
*/ |
611 |
|
@SuppressWarnings("unchecked") |
612 |
< |
private E removeAt(int i) { |
612 |
> |
E removeAt(int i) { |
613 |
|
// assert i >= 0 && i < size; |
614 |
|
modCount++; |
615 |
|
int s = --size; |
826 |
|
private int fence; // -1 until first use |
827 |
|
private int expectedModCount; // initialized when fence set |
828 |
|
|
829 |
< |
/** Creates new spliterator covering the given range */ |
829 |
> |
/** Creates new spliterator covering the given range. */ |
830 |
|
PriorityQueueSpliterator(PriorityQueue<E> pq, int origin, int fence, |
831 |
< |
int expectedModCount) { |
831 |
> |
int expectedModCount) { |
832 |
|
this.pq = pq; |
833 |
|
this.index = origin; |
834 |
|
this.fence = fence; |