DList

Instance Constructors

new DList(run: (List[A]) ⇒ Eval[List[A]])

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
def ++(as: DList[A]): DList[A]

Append a list to this DList O(1)
def +:(a: A): DList[A]

Prepend a single element to this DList O(1)
def :+(a: A): DList[A]

append a single element to this DList O(1)
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def apply(tail: List[A]): Eval[List[A]]

Prepend the contents of this dlist to the given tail.
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def flatMap[B](f: (A) ⇒ DList[B]): DList[B]
def foldRight[B](b: Eval[B])(f: (A, Eval[B]) ⇒ Eval[B]): Eval[B]
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
def headOption: Option[A]

Get the first element of the list, if any.
Get the first element of the list, if any. O(n) where n is the number of append operations in this DList
def isEmpty: Boolean

Tests whether list is empty.
Tests whether list is empty. O(n) where n is the number of append operations in this DList which is a bit weirdly expensive
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def map[B](f: (A) ⇒ B): DList[B]
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val run: (List[A]) ⇒ Eval[List[A]]
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def tailOption: Option[DList[A]]

Get the tail of the list, if any.
Get the tail of the list, if any. O(n) where n is the number of append operations in this DList
def toList: List[A]

O(n)
def toString(): String

Definition Classes
AnyRef → Any
def uncons[B](z: Eval[B], f: (A, DList[A]) ⇒ Eval[B]): Eval[B]

Destructure the DList into a head and a tail, and pass both to a function O(n) where n is the number of append operations in this DList
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( ... )

Related Docs: object DList | package dogs

final class DList[A] extends AnyRef

Instance Constructors

new DList(run: (List[A]) ⇒ Eval[List[A]])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

def ++(as: DList[A]): DList[A]

def +:(a: A): DList[A]

def :+(a: A): DList[A]

final def ==(arg0: Any): Boolean

def apply(tail: List[A]): Eval[List[A]]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def flatMap[B](f: (A) ⇒ DList[B]): DList[B]

def foldRight[B](b: Eval[B])(f: (A, Eval[B]) ⇒ Eval[B]): Eval[B]

final def getClass(): Class[_]

def hashCode(): Int

def headOption: Option[A]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def map[B](f: (A) ⇒ B): DList[B]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val run: (List[A]) ⇒ Eval[List[A]]

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

def tailOption: Option[DList[A]]

def toList: List[A]

def toString(): String

def uncons[B](z: Eval[B], f: (A, DList[A]) ⇒ Eval[B]): Eval[B]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped