DList

final def !=(arg0: Any): Boolean

final def ##(): Int

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

Append one list to another in constant time.

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

Prepend a single element in constant time.

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

Append a single element in constant time.

final def ==(arg0: Any): Boolean

def apply(xs: ⇒ List[A]): Trampoline[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]

Map over a difference list, then flatten.

def foldr[B](z: ⇒ B)(f: (A, ⇒ B) ⇒ B): B

Fold over a difference list.

final def getClass(): Class[_]

def hashCode(): Int

def headOption: Option[A]

Get the first element of the list, if any.

final def isInstanceOf[T0]: Boolean

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

Map over a difference list.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def tailOption: Option[DList[A]]

Get the tail of the list, if any.

def toList: List[A]

Convert to a normal list.

def toString(): String

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

List elimination of head and tail.

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def head: A

Get the first element of the list.

def tail: DList[A]

Get the tail of the list.