Doing a little polishing on the parallel collec...

Doing a little polishing on the parallel collections refactor (which
overall looks like a big improvement.) I went for some simpler wording
and moved a number of scaladoc tags around because the rug had been
pulled out from under their feet.

This leaves a lot undone, but since many of the docs need to be reworded
before they can move from e.g. SeqLike to GenSeqLike, and I'm not well
informed on exactly how these abstractions are being presented, I stayed
in the safe zone. Review by prokopec.

1 files changed, 9 insertions, 6 deletions

diff --git a/src/library/scala/collection/GenSetLike.scala b/src/library/scala/collection/GenSetLike.scala
index 91e90c1499..dc4a82688c 100644
--- a/src/library/scala/collection/GenSetLike.scala
+++ b/src/library/scala/collection/GenSetLike.scala
@@ -6,12 +6,8 @@
 **                          |/                                          **
 \*                                                                      */
 
-
 package scala.collection
 
-
-
-
 /** A template trait for sets which may possibly
  *  have their operations implemented in parallel.
  *
@@ -19,12 +15,19 @@ package scala.collection
  *  @author Aleksandar Prokopec
  *  @since 2.9
  */
-trait GenSetLike[A, +Repr] extends GenIterableLike[A, Repr] with (A => Boolean) with Equals with Parallelizable[A, parallel.ParSet[A]] {
-  def seq: Set[A]
+trait GenSetLike[A, +Repr]
+       extends GenIterableLike[A, Repr]
+          with (A => Boolean)
+          with Equals
+          with Parallelizable[A, parallel.ParSet[A]] {
+
+  def iterator: Iterator[A]
   def contains(elem: A): Boolean
   def +(elem: A): Repr
   def -(elem: A): Repr
 
+  def seq: Set[A]
+
   /** Tests if some element is contained in this set.
    *
    *  This method is equivalent to `contains`. It allows sets to be interpreted as predicates.