| 18 |
|
* to prevent interference among threads during traversal. |
| 19 |
|
* <li>Mutative operations(add, set, remove, etc) are expensive |
| 20 |
|
* since they usually entail copying the entire underlying array. |
| 21 |
– |
* <li>Loops involving repeated element-by-element mutative operations |
| 22 |
– |
* are so expensive that they should generally be avoided. |
| 21 |
|
* <li>Iterators do not support the mutative remove operation |
| 22 |
|
* <li>Traversal via iterators is very fast and cannot ever encounter |
| 23 |
|
* interference from other threads. Iterators rely on |
