blob: 7b7c8cde2c68f658dc3787913c804d54d729416b (
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
|
/* __ *\
** ________ ___ / / ___ Scala API **
** / __/ __// _ | / / / _ | (c) 2006-2009, LAMP/EPFL **
** __\ \/ /__/ __ |/ /__/ __ | **
** /____/\___/_/ |_/____/_/ | | **
** |/ **
\* */
// $Id$
package scala.collection.jcl;
/** Creates a buffer backed by a Java linked list. Includes additional
* peek/poll/removeFirst/removeLast APIs that are useful in implementing
* queues and stacks.
*
* @author Sean McDirmid
*/
class LinkedList[A](override val underlying : java.util.LinkedList[A]) extends BufferWrapper[A] {
def this() = this(new java.util.LinkedList[A]);
override def elements = super[BufferWrapper].elements;
override def add(idx : Int, a : A) =
if (idx == 0) underlying.addFirst(a);
else super.add(idx, a);
//def peek = underlying.peek.asInstanceOf[A];
//def poll = underlying.poll.asInstanceOf[A];
//def removeFirst = underlying.removeFirst.asInstanceOf[A];
//def removeLast = underlying.removeLast.asInstanceOf[A];
override def clone: LinkedList[A] =
new LinkedList[A](underlying.clone().asInstanceOf[java.util.LinkedList[A]])
}
|