--- a/src/share/classes/java/util/stream/Nodes.java Tue Apr 23 15:04:24 2013 -0700+++ b/src/share/classes/java/util/stream/Nodes.java Tue Apr 23 19:34:32 2013 -0700@@ -68,8 +68,8 @@ /** * Produces an empty node whose count is zero, has no children and no content. *- * @param shape the shape of the node to be created.- * @param <T> the type of elements of the created node.+ * @param <T> the type of elements of the created node+ * @param shape the shape of the node to be created * @return an empty node. */ @SuppressWarnings("unchecked")@@ -95,9 +95,9 @@ * <p>The result may be a concatenated node, the input sole node if the size * of the list is 1, or an empty node. *+ * @param <T> the type of elements of the concatenated node * @param shape the shape of the concatenated node to be created * @param nodes the input nodes- * @param <T> the type of elements of the concatenated node * @return a {@code Node} covering the elements of the input nodes * @throws IllegalStateException if all {@link Node} elements of the list * are an not instance of type supported by this factory.@@ -155,11 +155,11 @@ * Truncate a {@link Node}, returning a node describing a subsequence of * the contents of the input node. *+ * @param <T> the type of elements of the input node and truncated node * @param input the input node * @param from the starting offset to include in the truncated node (inclusive) * @param to the ending offset ot include in the truncated node (exclusive) * @param generator the array factory (only used for reference nodes)- * @param <T> the type of elements of the input node and truncated node * @return the truncated node */ @SuppressWarnings("unchecked")@@ -226,11 +226,11 @@ /** * Produces a {@link Node} describing an array.- * <p>- * The node will hold a reference to the array and will not make a copy. *- * @param array the array.+ * <p>The node will hold a reference to the array and will not make a copy.+ * * @param <T> the type of elements held by the node+ * @param array the array * @return a node holding an array */ static<T> Node<T> node(T[] array) {@@ -242,9 +242,9 @@ * <p> * The node will hold a reference to the collection and will not make a copy. *- * @param c the collection.- * @param <T> the type of elements held by the node.- * @return a node holding a collection.+ * @param <T> the type of elements held by the node+ * @param c the collection+ * @return a node holding a collection */ static<T> Node<T> node(Collection<T> c) { return new CollectionNode<>(c);@@ -280,8 +280,8 @@ /** * Produces a {@link Node.OfInt} describing an int[] array.- * <p>- * The node will hold a reference to the array and will not make a copy.+ *+ * <p>The node will hold a reference to the array and will not make a copy. * * @param array the array * @return a node holding an array@@ -354,8 +354,8 @@ /** * Produces a {@link Node.OfDouble} describing a double[] array.- * <p>- * The node will hold a reference to the array and will not make a copy.+ *+ * <p>The node will hold a reference to the array and will not make a copy. * * @param array the array * @return a node holding an array@@ -442,6 +442,7 @@ * of the computation. This conc-node can then be flattened in * parallel to produce a flat {@code Node.OfInt} if desired. *+ * @param <P_IN> the type of elements from the source Spliterator * @param helper the pipeline helper describing the pipeline * @param flattenTree whether a conc node should be flattened into a node * describing an array before returning@@ -479,6 +480,7 @@ * of the computation. This conc-node can then be flattened in * parallel to produce a flat {@code Node.OfLong} if desired. *+ * @param <P_IN> the type of elements from the source Spliterator * @param helper the pipeline helper describing the pipeline * @param flattenTree whether a conc node should be flattened into a node * describing an array before returning@@ -516,6 +518,7 @@ * of the computation. This conc-node can then be flattened in * parallel to produce a flat {@code Node.OfDouble} if desired. *+ * @param <P_IN> the type of elements from the source Spliterator * @param helper the pipeline helper describing the pipeline * @param flattenTree whether a conc node should be flattened into a node * describing an array before returning@@ -550,9 +553,9 @@ * and leaf node elements are placed in the array concurrently by leaf tasks * at the correct offsets. *+ * @param <T> type of elements contained by the node * @param node the node to flatten * @param generator the array factory used to create array instances- * @param <T> type of elements contained by the node * @return a flat {@code Node} */ public static <T> Node<T> flatten(Node<T> node, IntFunction<T[]> generator) {@@ -823,7 +826,9 @@ } }- /** Node class for an internal node with two or more children */+ /**+ * Node class for an internal node with two or more children+ */ static final class ConcNode<T> implements Node<T> { private final Node<T> left; private final Node<T> right;@@ -1204,7 +1209,9 @@ } }- /** Fixed-sized builder class for reference nodes */+ /**+ * Fixed-sized builder class for reference nodes+ */ private static final class FixedNodeBuilder<T> extends ArrayNode<T> implements Node.Builder<T> {@@ -1254,7 +1261,9 @@ } }- /** Variable-sized builder class for reference nodes */+ /**+ * Variable-sized builder class for reference nodes+ */ private static final class SpinedNodeBuilder<T> extends SpinedBuffer<T> implements Node<T>, Node.Builder<T> {