1334 |
|
|
1335 |
|
// Track the current rightmost node at each level. Uses an |
1336 |
|
// ArrayList to avoid committing to initial or maximum level. |
1337 |
< |
ArrayList<Index<K,V>> preds = new ArrayList<Index<K,V>>(); |
1337 |
> |
ArrayList<Index<K,V>> preds = new ArrayList<>(); |
1338 |
|
|
1339 |
|
// initialize |
1340 |
|
for (int i = 0; i <= h.level; ++i) |
1436 |
|
|
1437 |
|
HeadIndex<K,V> h = head; |
1438 |
|
Node<K,V> basepred = h.node; |
1439 |
< |
ArrayList<Index<K,V>> preds = new ArrayList<Index<K,V>>(); |
1439 |
> |
ArrayList<Index<K,V>> preds = new ArrayList<>(); |
1440 |
|
for (int i = 0; i <= h.level; ++i) |
1441 |
|
preds.add(null); |
1442 |
|
Index<K,V> q = h; |