The iterators returned by this class's {@code iterator} isfail-fast: if the list is structurally modified at any time after the iterator is created, in any way except through the Iterator's own {@code remove}or {@code set} methods, the iterator will throw a {@link ConcurrentModificationException}. Thus, in the face of concurrent modification, the iterator fails quickly and cleanly, rather than risking arbitrary, non-deterministic behavior at an undetermined time in the future.
Note that the fail-fast behavior of an iterator cannot be guaranteed as it is, generally speaking, impossible to make any hard guarantees in the presence of unsynchronized concurrent modification. Fail-fast iterators throw {@code ConcurrentModificationException}on a best-effort basis. Therefore, it would be wrong to write a program that depended on this exception for its correctness: the fail-fast behavior of iterators should be used only to detect bugs. @see TLinkedList @see Tensor @author Dmitry Bolotin @author Stanislav Poslavsky
| |