diff options
| author | Vlad Ureche <vlad.ureche@gmail.com> | 2012-03-19 22:48:08 +0100 |
|---|---|---|
| committer | Vlad Ureche <vlad.ureche@gmail.com> | 2012-03-20 01:22:53 +0100 |
| commit | 75ef45161d0599e43c33cbba8d253088bdfa9a79 (patch) | |
| tree | cd6dadf014b4a8db0a8070370687140e4e735ee1 /src/library/scala/collection/parallel/ParSeqLike.scala | |
| parent | c7d852558302c5c4abc2eadacf42d51d5050c7f2 (diff) | |
| download | scala-75ef45161d0599e43c33cbba8d253088bdfa9a79.tar.gz scala-75ef45161d0599e43c33cbba8d253088bdfa9a79.tar.bz2 scala-75ef45161d0599e43c33cbba8d253088bdfa9a79.zip | |
Adapted usecases to full signature display
Diffstat (limited to 'src/library/scala/collection/parallel/ParSeqLike.scala')
| -rw-r--r-- | src/library/scala/collection/parallel/ParSeqLike.scala | 16 |
1 files changed, 10 insertions, 6 deletions
diff --git a/src/library/scala/collection/parallel/ParSeqLike.scala b/src/library/scala/collection/parallel/ParSeqLike.scala index 9f28a286ca..b3c527da84 100644 --- a/src/library/scala/collection/parallel/ParSeqLike.scala +++ b/src/library/scala/collection/parallel/ParSeqLike.scala @@ -285,7 +285,6 @@ self => } /** Computes the multiset intersection between this $coll and another sequence. - * $mayNotTerminateInf * * @param that the sequence of elements to intersect with. * @tparam B the element type of the returned $coll. @@ -296,12 +295,17 @@ self => * If an element value `x` appears * ''n'' times in `that`, then the first ''n'' occurrences of `x` will be retained * in the result, but any following occurrences will be omitted. + * * @usecase def intersect(that: Seq[T]): $Coll[T] - * @return a new $coll which contains all elements of this $coll - * which also appear in `that`. - * If an element value `x` appears - * ''n'' times in `that`, then the first ''n'' occurrences of `x` will be retained - * in the result, but any following occurrences will be omitted. + * @inheritdoc + * + * $mayNotTerminateInf + * + * @return a new $coll which contains all elements of this $coll + * which also appear in `that`. + * If an element value `x` appears + * ''n'' times in `that`, then the first ''n'' occurrences of `x` will be retained + * in the result, but any following occurrences will be omitted. */ def intersect[U >: T](that: GenSeq[U]) = sequentially { _ intersect that |