/
IndexedSeqView.scala
180 lines (150 loc) · 7.34 KB
/
IndexedSeqView.scala
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
/*
* Scala (https://www.scala-lang.org)
*
* Copyright EPFL and Lightbend, Inc.
*
* Licensed under Apache License 2.0
* (http://www.apache.org/licenses/LICENSE-2.0).
*
* See the NOTICE file distributed with this work for
* additional information regarding copyright ownership.
*/
package scala
package collection
import scala.annotation.nowarn
/** View defined in terms of indexing a range */
trait IndexedSeqView[+A] extends IndexedSeqOps[A, View, View[A]] with SeqView[A] { self =>
override def view: IndexedSeqView[A] = this
@deprecated("Use .view.slice(from, until) instead of .view(from, until)", "2.13.0")
override def view(from: Int, until: Int): IndexedSeqView[A] = view.slice(from, until)
override def iterator: Iterator[A] = new IndexedSeqView.IndexedSeqViewIterator(this)
override def reverseIterator: Iterator[A] = new IndexedSeqView.IndexedSeqViewReverseIterator(this)
override def appended[B >: A](elem: B): IndexedSeqView[B] = new IndexedSeqView.Appended(this, elem)
override def prepended[B >: A](elem: B): IndexedSeqView[B] = new IndexedSeqView.Prepended(elem, this)
override def take(n: Int): IndexedSeqView[A] = new IndexedSeqView.Take(this, n)
override def takeRight(n: Int): IndexedSeqView[A] = new IndexedSeqView.TakeRight(this, n)
override def drop(n: Int): IndexedSeqView[A] = new IndexedSeqView.Drop(this, n)
override def dropRight(n: Int): IndexedSeqView[A] = new IndexedSeqView.DropRight(this, n)
override def map[B](f: A => B): IndexedSeqView[B] = new IndexedSeqView.Map(this, f)
override def reverse: IndexedSeqView[A] = new IndexedSeqView.Reverse(this)
override def slice(from: Int, until: Int): IndexedSeqView[A] = new IndexedSeqView.Slice(this, from, until)
override def tapEach[U](f: A => U): IndexedSeqView[A] = new IndexedSeqView.Map(this, { (a: A) => f(a); a})
def concat[B >: A](suffix: IndexedSeqView.SomeIndexedSeqOps[B]): IndexedSeqView[B] = new IndexedSeqView.Concat(this, suffix)
def appendedAll[B >: A](suffix: IndexedSeqView.SomeIndexedSeqOps[B]): IndexedSeqView[B] = new IndexedSeqView.Concat(this, suffix)
def prependedAll[B >: A](prefix: IndexedSeqView.SomeIndexedSeqOps[B]): IndexedSeqView[B] = new IndexedSeqView.Concat(prefix, this)
@nowarn("""cat=deprecation&origin=scala\.collection\.Iterable\.stringPrefix""")
override protected[this] def stringPrefix: String = "IndexedSeqView"
}
object IndexedSeqView {
@SerialVersionUID(3L)
private[collection] class IndexedSeqViewIterator[A](self: IndexedSeqView[A]) extends AbstractIterator[A] with Serializable {
private[this] var current = 0
private[this] var remainder = self.length
override def knownSize: Int = remainder
@inline private[this] def _hasNext: Boolean = remainder > 0
def hasNext: Boolean = _hasNext
def next(): A =
if (_hasNext) {
val r = self(current)
current += 1
remainder -= 1
r
} else Iterator.empty.next()
override def drop(n: Int): Iterator[A] = {
if (n > 0) {
current += n
remainder = Math.max(0, remainder - n)
}
this
}
override protected def sliceIterator(from: Int, until: Int): Iterator[A] = {
def formatRange(value : Int) : Int = if (value < 0) 0 else if (value > remainder) remainder else value
val formatFrom = formatRange(from)
val formatUntil = formatRange(until)
remainder = Math.max(0, formatUntil - formatFrom)
current = current + formatFrom
this
}
}
@SerialVersionUID(3L)
private[collection] class IndexedSeqViewReverseIterator[A](self: IndexedSeqView[A]) extends AbstractIterator[A] with Serializable {
private[this] var remainder = self.length
private[this] var pos = remainder - 1
@inline private[this] def _hasNext: Boolean = remainder > 0
def hasNext: Boolean = _hasNext
def next(): A =
if (_hasNext) {
val r = self(pos)
pos -= 1
remainder -= 1
r
} else Iterator.empty.next()
// from < 0 means don't move pos, until < 0 means don't limit remainder
//
override protected def sliceIterator(from: Int, until: Int): Iterator[A] = {
if (_hasNext) {
if (remainder <= from) remainder = 0 // exhausted by big skip
else if (from <= 0) { // no skip, pos is same
if (until >= 0 && until < remainder) remainder = until // ...limited by until
}
else {
pos -= from // skip ahead
if (until >= 0 && until < remainder) { // ...limited by until
if (until <= from) remainder = 0 // ...exhausted if limit is smaller than skip
else remainder = until - from // ...limited by until, less the skip
}
else remainder -= from // ...otherwise just less the skip
}
}
this
}
}
/** An `IndexedSeqOps` whose collection type and collection type constructor are unknown */
type SomeIndexedSeqOps[A] = IndexedSeqOps[A, AnyConstr, _]
@SerialVersionUID(3L)
class Id[+A](underlying: SomeIndexedSeqOps[A])
extends SeqView.Id(underlying) with IndexedSeqView[A]
@SerialVersionUID(3L)
class Appended[+A](underlying: SomeIndexedSeqOps[A], elem: A)
extends SeqView.Appended(underlying, elem) with IndexedSeqView[A]
@SerialVersionUID(3L)
class Prepended[+A](elem: A, underlying: SomeIndexedSeqOps[A])
extends SeqView.Prepended(elem, underlying) with IndexedSeqView[A]
@SerialVersionUID(3L)
class Concat[A](prefix: SomeIndexedSeqOps[A], suffix: SomeIndexedSeqOps[A])
extends SeqView.Concat[A](prefix, suffix) with IndexedSeqView[A]
@SerialVersionUID(3L)
class Take[A](underlying: SomeIndexedSeqOps[A], n: Int)
extends SeqView.Take(underlying, n) with IndexedSeqView[A]
@SerialVersionUID(3L)
class TakeRight[A](underlying: SomeIndexedSeqOps[A], n: Int)
extends SeqView.TakeRight(underlying, n) with IndexedSeqView[A]
@SerialVersionUID(3L)
class Drop[A](underlying: SomeIndexedSeqOps[A], n: Int)
extends SeqView.Drop[A](underlying, n) with IndexedSeqView[A]
@SerialVersionUID(3L)
class DropRight[A](underlying: SomeIndexedSeqOps[A], n: Int)
extends SeqView.DropRight[A](underlying, n) with IndexedSeqView[A]
@SerialVersionUID(3L)
class Map[A, B](underlying: SomeIndexedSeqOps[A], f: A => B)
extends SeqView.Map(underlying, f) with IndexedSeqView[B]
@SerialVersionUID(3L)
class Reverse[A](underlying: SomeIndexedSeqOps[A]) extends SeqView.Reverse[A](underlying) with IndexedSeqView[A] {
override def reverse: IndexedSeqView[A] = underlying match {
case x: IndexedSeqView[A] => x
case _ => super.reverse
}
}
@SerialVersionUID(3L)
class Slice[A](underlying: SomeIndexedSeqOps[A], from: Int, until: Int) extends AbstractIndexedSeqView[A] {
protected val lo = from max 0
protected val hi = (until max 0) min underlying.length
protected val len = (hi - lo) max 0
@throws[IndexOutOfBoundsException]
def apply(i: Int): A = underlying(lo + i)
def length: Int = len
}
}
/** Explicit instantiation of the `IndexedSeqView` trait to reduce class file size in subclasses. */
@SerialVersionUID(3L)
abstract class AbstractIndexedSeqView[+A] extends AbstractSeqView[A] with IndexedSeqView[A]