Scalax
|
|
class
ConcurrentLinkedList[A]
extends
scala.Seq[A]Method Summary | |
def
|
+=
(elem : A) : Unit
Appends an element. Appended elements are guaranteed to appear in the
list eventually, in the order that they were added, but an iteration
immediately following an append is not guaranteed to return the new
element yet.
|
def
|
-=
(elem : A) : Unit
Deletes the first matching node. This is safe w.r.t. concurrent appends
and iterations, but is synchronized to protect it from itself.
|
def
|
apply (n : Int) : A |
def
|
clear : Unit |
def
|
elements : scala.Iterator[A] |
def
|
length
: Int
This operation is not generally useful, because there is never any
guarantee that the result is current.
|
Methods inherited from scala.Collection | |
scala.Collection.toString, scala.Collection.stringPrefix |
Methods inherited from scala.PartialFunction | |
scala.PartialFunction.orElse, scala.PartialFunction.andThen |
Methods inherited from scala.Function1 | |
scala.Function1.compose |
Methods inherited from AnyRef | |
getClass, hashCode, equals, clone, notify, notifyAll, wait, wait, wait, finalize, ==, !=, eq, ne, synchronized |
Methods inherited from Any | |
==, !=, isInstanceOf, asInstanceOf |
Method Details |
def
elements : scala.Iterator[A]
def
length : Int
def
clear : Unit
Scalax
|
|