Merge pull request scala/scala#7004 from joshlemer/issue/11049-2.13

[11049] Fixes scala/bug#11049

Author: szeiger

library/src/scala/collection/IndexedSeqView.scala

@@ -26,11 +26,12 @@ object IndexedSeqView {
     private[this] var current = 0
     override def knownSize: Int = self.size - current
     def hasNext = current < self.size
-    def next(): A = {
-      val r = self.apply(current)
-      current += 1
-      r
-    }
+    def next(): A =
+      if (hasNext) {
+        val r = self.apply(current)
+        current += 1
+        r
+      } else Iterator.empty.next()
   }
 
   /** An `IndexedSeqOps` whose collection type and collection type constructor are unknown */

library/src/scala/collection/mutable/ArrayBuffer.scala

@@ -209,7 +209,7 @@ object ArrayBuffer extends StrictOptimizedSeqFactory[ArrayBuffer] {
 
 final class ArrayBufferView[A](val array: Array[AnyRef], val length: Int) extends AbstractIndexedSeqView[A] {
   @throws[ArrayIndexOutOfBoundsException]
-  def apply(n: Int) = array(n).asInstanceOf[A]
+  def apply(n: Int) = if (n < length) array(n).asInstanceOf[A] else throw new IndexOutOfBoundsException(n.toString)
   override protected[this] def className = "ArrayBufferView"
 }
 

library/src/scala/collection/mutable/PriorityQueue.scala

@@ -247,15 +247,7 @@ sealed class PriorityQueue[A](implicit val ord: Ordering[A])
     *
     *  @return  an iterator over all the elements.
     */
-  override def iterator: Iterator[A] = new AbstractIterator[A] {
-    private[this] var i = 1
-    def hasNext: Boolean = i < resarr.p_size0
-    def next(): A = {
-      val n = resarr.p_array(i)
-      i += 1
-      toA(n)
-    }
-  }
+  override def iterator: Iterator[A] = resarr.iterator.drop(1)
 
   /** Returns the reverse of this priority queue. The new priority queue has
     *  the same elements as the original, but the opposite ordering.