--- jsr166/src/jsr166x/LinkedBlockingDeque.java 2011/12/05 04:48:16 1.9 +++ jsr166/src/jsr166x/LinkedBlockingDeque.java 2012/12/29 23:55:19 1.13 @@ -14,7 +14,7 @@ import java.util.concurrent.locks.*; * An optionally-bounded {@linkplain BlockingDeque blocking deque} based on * linked nodes. * - *

The optional capacity bound constructor argument serves as a + *

The optional capacity bound constructor argument serves as a * way to prevent excessive expansion. The capacity, if unspecified, * is equal to {@link Integer#MAX_VALUE}. Linked nodes are * dynamically created upon each insertion unless this would bring the @@ -149,7 +149,7 @@ public class LinkedBlockingDeque } /** - * Remove and return first element, or null if empty + * Removes and returns first element, or null if empty. */ private E unlinkFirst() { Node f = first; @@ -167,7 +167,7 @@ public class LinkedBlockingDeque } /** - * Remove and return last element, or null if empty + * Removes and returns last element, or null if empty. */ private E unlinkLast() { Node l = last; @@ -444,7 +444,7 @@ public class LinkedBlockingDeque /** * Returns the number of elements in this deque. * - * @return the number of elements in this deque. + * @return the number of elements in this deque */ public int size() { lock.lock(); @@ -647,7 +647,7 @@ public class LinkedBlockingDeque * construction of the iterator, and may (but is not guaranteed to) * reflect any modifications subsequent to construction. * - * @return an iterator over the elements in this deque in proper sequence. + * @return an iterator over the elements in this deque in proper sequence */ public Iterator iterator() { return new Itr(); @@ -664,7 +664,7 @@ public class LinkedBlockingDeque * an element exists in hasNext(), we must return item read * under lock (in advance()) even if it was in the process of * being removed when hasNext() was called. - **/ + */ private E nextItem; /**