| 20 |
|
/** |
| 21 |
|
* A variant of {@link java.util.ArrayList} in which all mutative |
| 22 |
|
* operations (add, set, and so on) are implemented by making a fresh |
| 23 |
< |
* copy of the underlying array. <p> |
| 23 |
> |
* copy of the underlying array. |
| 24 |
|
* |
| 25 |
< |
* This is ordinarily too costly, but may be <em>more</em> efficient |
| 25 |
> |
* <p> This is ordinarily too costly, but may be <em>more</em> efficient |
| 26 |
|
* than alternatives when traversal operations vastly outnumber |
| 27 |
|
* mutations, and is useful when you cannot or don't want to |
| 28 |
|
* synchronize traversals, yet need to preclude interference among |
| 822 |
|
} |
| 823 |
|
|
| 824 |
|
/** |
| 825 |
< |
* Returns the hash code value for this List. <p> This |
| 826 |
< |
* implementation uses the definition in {@link List#hashCode}. |
| 825 |
> |
* Returns the hash code value for this List. |
| 826 |
> |
* |
| 827 |
> |
* <p> This implementation uses the definition in {@link |
| 828 |
> |
* List#hashCode}. |
| 829 |
|
* @return the hash code |
| 830 |
|
*/ |
| 831 |
|
public int hashCode() { |
