The class implements the {@code Deque} interface, providing - * first-in-first-out queue operations for {@code add}, - * {@code poll}, along with other stack and deque operations. + * Linked list implementation of the {@code List} interface. + * Implements all optional list operations, and permits all elements + * (including {@code null}). In addition to implementing the {@code + * List} interface, the {@code LinkedList} class provides uniformly + * named methods to {@code get}, {@code remove} and {@code add} an + * element at the beginning (operation{@code First}) and end + * (operation{@code Last}) of the list. These operations allow + * linked lists to be used as a stack, {@linkplain Queue queue}, or + * {@linkplain Deque deque} (double-ended queue); by implementing the + * {@link Deque} interface, support is included for first-in-first-out + * operations for {@code add} and {@code poll}. * *
All of the operations perform as could be expected for a doubly-linked * list. Operations that index into the list will traverse the list from