LinkedList

An observable linked list with fast head and last operations. This is the read-only layer, see LinkedList.Modifiable for a mutable list.

The list will report insertions and deletions, as well as forward designated element events of type U.

Elem: the element type of the list
U: the updates fired by the element type

Linear Supertypes

Node[S], VirtualNode[S], Reactor[S], Mutable[S.ID, S.Tx], Disposable[S.Tx], Writable, Identifiable[S.ID], AnyRef, Any

Known Subclasses

Modifiable

Abstract Value Members

abstract def apply(index: Int)(implicit tx: S.Tx): Elem
abstract def changed: EventLike[S, Update[S, Elem, U], LinkedList[S, Elem, U]]
abstract def debugList()(implicit tx: S.Tx): List[Elem]
abstract def disposeData()(implicit tx: S.Tx): Unit

Attributes
protected
Definition Classes
Node
abstract def get(index: Int)(implicit tx: S.Tx): Option[Elem]
abstract def head(implicit tx: S.Tx): Elem
abstract def headOption(implicit tx: S.Tx): Option[Elem]
abstract def indexOf(elem: Elem)(implicit tx: S.Tx): Int

Note: this is an O(n) operation.
abstract def isEmpty(implicit tx: S.Tx): Boolean
abstract def iterator(implicit tx: S.Tx): Iterator[S.Tx, Elem]
abstract def last(implicit tx: S.Tx): Elem
abstract def lastOption(implicit tx: S.Tx): Option[Elem]
abstract def modifiableOption: Option[Modifiable[S, Elem, U]]
abstract def nonEmpty(implicit tx: S.Tx): Boolean
abstract def size(implicit tx: S.Tx): Int
abstract def targets: Targets[S]

Attributes
protected
Definition Classes
Node
abstract def writeData(out: DataOutput): Unit

Attributes
protected
Definition Classes
Node

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

Definition Classes
Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
final def dispose()(implicit tx: S.Tx): Unit

Definition Classes
Node → Disposable
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(that: Any): Boolean

Definition Classes
Reactor → AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
Reactor → AnyRef → Any
final def id: S.ID

Definition Classes
Node → Identifiable
final def invalidate()(implicit tx: S.Tx): Unit

Attributes
protected
Definition Classes
Node
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def isInvalid(implicit tx: S.Tx): Boolean

Attributes
protected
Definition Classes
Node
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
Node → AnyRef → Any
final def validated()(implicit tx: S.Tx): Unit

Attributes
protected
Definition Classes
Node
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws()
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws()
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws()
final def write(out: DataOutput): Unit

Definition Classes
Node → Writable

trait LinkedList[S <: Sys[S], Elem, U] extends Node[S]

Abstract Value Members

abstract def apply(index: Int)(implicit tx: S.Tx): Elem

abstract def changed: EventLike[S, Update[S, Elem, U], LinkedList[S, Elem, U]]

abstract def debugList()(implicit tx: S.Tx): List[Elem]

abstract def disposeData()(implicit tx: S.Tx): Unit

abstract def get(index: Int)(implicit tx: S.Tx): Option[Elem]

abstract def head(implicit tx: S.Tx): Elem

abstract def headOption(implicit tx: S.Tx): Option[Elem]

abstract def indexOf(elem: Elem)(implicit tx: S.Tx): Int

abstract def isEmpty(implicit tx: S.Tx): Boolean

abstract def iterator(implicit tx: S.Tx): Iterator[S.Tx, Elem]

abstract def last(implicit tx: S.Tx): Elem

abstract def lastOption(implicit tx: S.Tx): Option[Elem]

abstract def modifiableOption: Option[Modifiable[S, Elem, U]]

abstract def nonEmpty(implicit tx: S.Tx): Boolean

abstract def size(implicit tx: S.Tx): Int

abstract def targets: Targets[S]

abstract def writeData(out: DataOutput): Unit

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def dispose()(implicit tx: S.Tx): Unit

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def id: S.ID

final def invalidate()(implicit tx: S.Tx): Unit

final def isInstanceOf[T0]: Boolean

final def isInvalid(implicit tx: S.Tx): Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def validated()(implicit tx: S.Tx): Unit

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def write(out: DataOutput): Unit

Inherited from Node[S]

Inherited from VirtualNode[S]

Inherited from Reactor[S]

Inherited from Mutable[S.ID, S.Tx]

Inherited from Disposable[S.Tx]

Inherited from Writable

Inherited from Identifiable[S.ID]

Inherited from AnyRef

Inherited from Any

Ungrouped