blob: 605d511f0589df15bc260e9a14bb2755825b8875 (
plain) (
blame)
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
|
/* __ *\
** ________ ___ / / ___ Scala API **
** / __/ __// _ | / / / _ | (c) 2003-2009, LAMP/EPFL **
** __\ \/ /__/ __ |/ /__/ __ | **
** /____/\___/_/ |_/____/_/ | | **
** |/ **
\* */
// $Id$
package scala.collection.mutable
import generic._
// import immutable.{List, Nil, ::}
//import Predef.NoSuchElementException
/** This class is used internally to represent mutable lists. It is the
* basis for the implementation of the classes
* <code>Stack</code>, and <code>Queue</code>.
* !!! todo: convert to LinkedListBuffer?
* @author Matthias Zenger
* @author Martin Odersky
* @version 2.8
*/
class MutableList[A] extends LinearSequence[A] with LinearSequenceTemplate[A, MutableList[A]] with Builder[A, MutableList[A]] {
override protected[this] def newBuilder = new MutableList[A]
protected var first0: LinkedList[A] = null
protected var last0: LinkedList[A] = null
protected var len: Int = 0
/** Is the list empty?
*/
override def isEmpty = len == 0
/** Returns the first element in this list
*/
override def head: A = first0.head
/** Returns the rest of this list
*/
override def tail: MutableList[A] = {
val tl = new MutableList[A]
if (first0 ne last0) {
tl.first0 = first0.tail
tl.last0 = last0
}
tl.len = len - 1
tl
}
/** Returns the length of this list.
*/
override def length: Int = len
/** Returns the <code>n</code>th element of this list.
* @throws IndexOutofBoundsException if index does not exist.
*/
override def apply(n: Int): A = first0.apply(n)
/** Updates the <code>n</code>th element of this list to a new value.
* @throws IndexOutofBoundsException if index does not exist.
*/
def update(n: Int, x: A): Unit = first0.update(n, x)
/** Returns the <code>n</code>th element of this list or <code>None</code>
* if index does not exist.
*/
def get(n: Int): Option[A] = first0.get(n)
protected def prependElem(elem: A): Unit = {
first0 = new LinkedList[A](elem, first0)
if (len == 0)
last0 = first0
len = len + 1
}
protected def appendElem(elem: A): Unit =
if (len == 0)
prependElem(elem)
else {
last0.next = new LinkedList[A](elem, null)
last0 = last0.next
len = len + 1
}
/** @deprecated use clear instead */
@deprecated def reset() { clear() }
/** Returns an iterator over all elements of this list.
*/
override def elements: Iterator[A] =
if (first0 eq null) Iterator.empty else first0.elements
override def last = last0.elem
/** Returns an instance of <code>scala.List</code> containing the same
* sequence of elements.
*/
override def toList: List[A] = if (first0 eq null) Nil else first0.toList
/** Returns the current list of elements as a linked List
* sequence of elements.
*/
private[mutable] def toLinkedList: LinkedList[A] = first0
/** Appends a single element to this buffer. This takes constant time.
*
* @param elem the element to append.
*/
def +=(elem: A): this.type = { appendElem(elem); this }
def clear() {
first0 = null
last0 = null
len = 0
}
def result = this
}
|