192 |
|
* @return a Spliterator covering approximately half of the |
193 |
|
* elements |
194 |
|
* @throws IllegalStateException if this Spliterator has |
195 |
< |
* already commenced traversing elements. |
195 |
> |
* already commenced traversing elements |
196 |
|
*/ |
197 |
|
Spliterator<T> split(); |
198 |
|
|
204 |
|
* |
205 |
|
* @return a Spliterator covering the same range as this Spliterator. |
206 |
|
* @throws IllegalStateException if this Spliterator has |
207 |
< |
* already commenced traversing elements. |
207 |
> |
* already commenced traversing elements |
208 |
|
*/ |
209 |
|
Spliterator<T> clone(); |
210 |
|
} |
806 |
|
} |
807 |
|
|
808 |
|
/** |
809 |
< |
* Find or add a node |
809 |
> |
* Finds or adds a node. |
810 |
|
* @return null if added |
811 |
|
*/ |
812 |
|
@SuppressWarnings("unchecked") // suppress Comparable cast warning |
2012 |
|
} |
2013 |
|
|
2014 |
|
/** |
2015 |
< |
* Split a normal bin with list headed by e into lo and hi parts; |
2016 |
< |
* install in given table |
2015 |
> |
* Splits a normal bin with list headed by e into lo and hi parts; |
2016 |
> |
* installs in given table. |
2017 |
|
*/ |
2018 |
|
private static void splitBin(Node[] nextTab, int i, Node e) { |
2019 |
|
int bit = nextTab.length >>> 1; // bit to split on |
2043 |
|
} |
2044 |
|
|
2045 |
|
/** |
2046 |
< |
* Split a tree bin into lo and hi parts; install in given table |
2046 |
> |
* Splits a tree bin into lo and hi parts; installs in given table. |
2047 |
|
*/ |
2048 |
|
private static void splitTreeBin(Node[] nextTab, int i, TreeBin t) { |
2049 |
|
int bit = nextTab.length >>> 1; |