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/LinearSeqLike.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/LinearSeqLike.scala')
-rw-r--r-- | src/library/scala/collection/LinearSeqLike.scala | 7 |
1 files changed, 3 insertions, 4 deletions
diff --git a/src/library/scala/collection/LinearSeqLike.scala b/src/library/scala/collection/LinearSeqLike.scala index 1c99d4a3d9..208cbcdd50 100644 --- a/src/library/scala/collection/LinearSeqLike.scala +++ b/src/library/scala/collection/LinearSeqLike.scala @@ -25,10 +25,6 @@ import scala.util.control.Breaks._ * However, see `LinearSeqOptimized` for an implementation trait that overrides operations * to make them run faster under the assumption of fast linear access with `head` and `tail`. * - * @author Martin Odersky - * @version 2.8 - * @since 2.8 - * * @define linearSeqInfo * Linear sequences are defined in terms of three abstract methods, which are assumed * to have efficient implementations. These are: @@ -41,6 +37,9 @@ import scala.util.control.Breaks._ * * Linear sequences do not add any new methods to `Seq`, but promise efficient implementations * of linear access patterns. + * @author Martin Odersky + * @version 2.8 + * @since 2.8 * * @tparam A the element type of the $coll * @tparam Repr the type of the actual $coll containing the elements. |