src/share/classes/java/util/LinkedList.java
Print this page
@@ -24,18 +24,19 @@
*/
package java.util;
/**
- * 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 insert} an element at the
- * beginning and end of the list. These operations allow linked lists to be
- * used as a stack, {@linkplain Queue queue}, or {@linkplain Deque
- * double-ended queue}.
+ * 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 (<i>operation</i>{@code First}) and end
+ * (<i>operation</i>{@code Last}) of the list. These operations allow
+ * linked lists to be used as a stack, {@linkplain Queue queue}, or
+ * {@linkplain Deque double-ended queue}.
*
* <p>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.
*