diff options
author | Martin Odersky <odersky@gmail.com> | 2010-04-09 17:25:34 +0000 |
---|---|---|
committer | Martin Odersky <odersky@gmail.com> | 2010-04-09 17:25:34 +0000 |
commit | 261e399ba3a11a5844e057526a6161970b75e8d3 (patch) | |
tree | 21b7cd014d5758cf8a442b3e26c4e89321ddf082 /src/library/scala/collection/IndexedSeqLike.scala | |
parent | 0d80fa2d50c287837f45fb26e8ab3b69e278a9bb (diff) | |
download | scala-261e399ba3a11a5844e057526a6161970b75e8d3.tar.gz scala-261e399ba3a11a5844e057526a6161970b75e8d3.tar.bz2 scala-261e399ba3a11a5844e057526a6161970b75e8d3.zip |
Updated documentation
Diffstat (limited to 'src/library/scala/collection/IndexedSeqLike.scala')
-rw-r--r-- | src/library/scala/collection/IndexedSeqLike.scala | 9 |
1 files changed, 4 insertions, 5 deletions
diff --git a/src/library/scala/collection/IndexedSeqLike.scala b/src/library/scala/collection/IndexedSeqLike.scala index ea6e1bb493..453b4384f7 100644 --- a/src/library/scala/collection/IndexedSeqLike.scala +++ b/src/library/scala/collection/IndexedSeqLike.scala @@ -23,21 +23,20 @@ import scala.annotation.tailrec * However, see `IndexedSeqOptimized` for an implementation trait that overrides operations * to make them run faster under the assumption of fast random access with `apply`. * - * @author Sean McDirmid - * @author Martin Odersky - * @version 2.8 - * @since 2.8 * @define Coll IndexedSeq * @define indexedSeqInfo * Indexed sequences support constant-time or near constant-time element * access and length computation. They are defined in terms of abstract methods - * `apply` fpor indexing and `length`. + * `apply` for indexing and `length`. * * Indexed sequences do not add any new methods wrt `Seq`, but promise * efficient implementations of random access patterns. * * @tparam A the element type of the $coll * @tparam Repr the type of the actual $coll containing the elements. + * @author Martin Odersky + * @version 2.8 + * @since 2.8 * @define willNotTerminateInf * @define mayNotTerminateInf */ |