summaryrefslogtreecommitdiff
path: root/src/library
diff options
context:
space:
mode:
authorMartin Odersky <odersky@gmail.com>2010-01-18 14:57:18 +0000
committerMartin Odersky <odersky@gmail.com>2010-01-18 14:57:18 +0000
commit0b77c407e7822b466a2fad439d5e6336ebee4bd2 (patch)
tree3642529234aab1a6859e80adee16c88ddf577fed /src/library
parent1184fd68b0bddeaf20b3a7de55d4be2efce61410 (diff)
downloadscala-0b77c407e7822b466a2fad439d5e6336ebee4bd2.tar.gz
scala-0b77c407e7822b466a2fad439d5e6336ebee4bd2.tar.bz2
scala-0b77c407e7822b466a2fad439d5e6336ebee4bd2.zip
some more performance tunings. No review.
Diffstat (limited to 'src/library')
-rw-r--r--src/library/scala/collection/Iterator.scala2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/library/scala/collection/Iterator.scala b/src/library/scala/collection/Iterator.scala
index c23765c9bc..de0ec5275f 100644
--- a/src/library/scala/collection/Iterator.scala
+++ b/src/library/scala/collection/Iterator.scala
@@ -554,7 +554,7 @@ trait Iterator[+A] { self =>
* of the returned iterator is the maximum of the lengths of this iterator and `that`.
* If this iterator is shorter than `that`, `thisElem` values are used to pad the result.
* If `that` is shorter than this iterator, `thatElem` values are used to pad the result.
- * @usecase def zipAll[B](that: Iterator[B], thisElem: A, thatElem: B): Iterator[(A, B1)]
+ * @usecase def zipAll[B](that: Iterator[B], thisElem: A, thatElem: B): Iterator[(A, B)]
*/
def zipAll[B, A1 >: A, B1 >: B](that: Iterator[B], thisElem: A1, thatElem: B1) = new Iterator[(A1, B1)] {
def hasNext = self.hasNext || that.hasNext