From 9ab6ce7c351e428d09a690cc8c841f0750fe8973 Mon Sep 17 00:00:00 2001
From: Martin Odersky <odersky@gmail.com>
Date: Fri, 29 Jul 2016 12:51:03 +0200
Subject: Drop on LinearSeq needs to return collection of same type as it was
 called on.

This is achieved by putting it into a new trait, LinearSeqLike.
---
 src/strawman/collections/CollectionStrawMan6.scala | 46 ++++++++++++++++++----
 1 file changed, 38 insertions(+), 8 deletions(-)

(limited to 'src/strawman')

diff --git a/src/strawman/collections/CollectionStrawMan6.scala b/src/strawman/collections/CollectionStrawMan6.scala
index d3d54d89b..86ec660f3 100644
--- a/src/strawman/collections/CollectionStrawMan6.scala
+++ b/src/strawman/collections/CollectionStrawMan6.scala
@@ -124,28 +124,36 @@ object CollectionStrawMan6 extends LowPriority {
     def length: Int
   }
 
-  /** Base trait for linearly accessed sequences */
-  trait LinearSeq[+A] extends Seq[A] with SeqLike[A, LinearSeq] { self =>
+  /** Base trait for linearly accessed sequences that have efficient `head` and
+   *  `tail` operations.
+   *  Known subclasses: List, LazyList
+   */
+  trait LinearSeq[+A] extends Seq[A] with LinearSeqLike[A, LinearSeq] { self =>
 
     /** To be overridden in implementations: */
     def isEmpty: Boolean
     def head: A
     def tail: LinearSeq[A]
 
+    /** `iterator` is overridden in terms of `head` and `tail` */
     def iterator = new Iterator[A] {
       private[this] var current: Seq[A] = self
       def hasNext = !current.isEmpty
       def next = { val r = current.head; current = current.tail; r }
     }
 
+    /** `length is defined in terms of `iterator` */
     def length: Int = iterator.length
 
-    @tailrec final def apply(n: Int): A =
-      if (n == 0) head else tail.apply(n - 1)
-
-    /** Optimized version of `drop` that avoids copying */
-    @tailrec final override def drop(n: Int) =
-      if (n <= 0) this else tail.drop(n - 1)
+    /** `apply` is defined in terms of `drop`, which is in turn defined in
+     *  terms of `tail`.
+     */
+    override def apply(n: Int): A = {
+      if (n < 0) throw new IndexOutOfBoundsException(n.toString)
+      val skipped = drop(n)
+      if (skipped.isEmpty) throw new IndexOutOfBoundsException(n.toString)
+      skipped.head
+    }
   }
 
   /** Base trait for strict collections that can be built using a builder.
@@ -221,6 +229,28 @@ object CollectionStrawMan6 extends LowPriority {
   extends IterableLike[A, C]
      with SeqMonoTransforms[A, C[A @uncheckedVariance]] // sound bcs of VarianceNote
 
+  /** Base trait for linear Seq operations */
+  trait LinearSeqLike[+A, +C[X] <: LinearSeq[X]] extends SeqLike[A, C] {
+
+    /** Optimized version of `drop` that avoids copying
+     *  Note: `drop` is defined here, rather than in a trait like `LinearSeqMonoTransforms`,
+     *  because the `...MonoTransforms` traits make no assumption about the type of `Repr`
+     *  whereas we need to assume here that `Repr` is the same as the underlying
+     *  collection type.
+     */
+    override def drop(n: Int): C[A @uncheckedVariance] = { // sound bcs of VarianceNote
+      def loop(n: Int, s: Iterable[A]): C[A] =
+        if (n <= 0) s.asInstanceOf[C[A]]
+           // implicit contract to guarantee success of asInstanceOf:
+           //   (1) coll is of type C[A]
+           //   (2) The tail of a LinearSeq is of the same type as the type of the sequence itself
+           // it's surprisingly tricky/ugly to turn this into actual types, so we
+           // leave this contract implicit.
+        else loop(n - 1, s.tail)
+      loop(n, coll)
+    }
+  }
+
   /** Operations over iterables. No operation defined here is generic in the
    *  type of the underlying collection.
    */
-- 
cgit v1.2.3