summaryrefslogtreecommitdiff
path: root/src/library/scala/collection/immutable/List.scala
diff options
context:
space:
mode:
Diffstat (limited to 'src/library/scala/collection/immutable/List.scala')
-rw-r--r--src/library/scala/collection/immutable/List.scala4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/library/scala/collection/immutable/List.scala b/src/library/scala/collection/immutable/List.scala
index 9a205e97c4..38ddfee8b5 100644
--- a/src/library/scala/collection/immutable/List.scala
+++ b/src/library/scala/collection/immutable/List.scala
@@ -74,7 +74,7 @@ sealed abstract class List[+A] extends LinearSequence[A]
*/
def :::[B >: A](prefix: List[B]): List[B] =
if (isEmpty) prefix
- else (new ListBuffer[B] ++ prefix).prependToList(this)
+ else (new ListBuffer[B] ++= prefix).prependToList(this)
/** Reverse the given prefix and append the current list to that.
* This function is equivalent to an application of <code>reverse</code>
@@ -807,7 +807,7 @@ object List extends SequenceFactory[List] {
* <code>[a<sub>0</sub>, ..., a<sub>k</sub>]</code>,
* <code>[b<sub>0</sub>, ..., b<sub>l</sub>]</code> and
* <code>n = min(k,l)</code>
- * @deprecated use (xs, ys).forall(f) instead
+ * @deprecated use (xs, ys).exists(f) instead
*/
@deprecated def exists2[A,B](xs: List[A], ys: List[B])(f: (A, B) => Boolean): Boolean = {
var xc = xs