Packages

final class DList[A] extends AnyRef

Difference lists: a data structure for O(1) append on lists. Based on Data.DList, a Haskell library by Don Stewart.

A difference list is a function that given a list, returns the original contents of the difference list prepended at the given list.

This structure supports O(1) append and snoc operations on lists, making it very useful for append-heavy uses, such as logging and pretty printing.

Source
DList.scala
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DList
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def ++(as: ⇒ DList[A]): DList[A]

    Append one list to another in constant time.

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

    Prepend a single element in constant time.

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

    Append a single element in constant time.

  6. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  7. def apply(xs: ⇒ List[A]): Free.Trampoline[List[A]]
  8. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  9. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  11. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  12. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  13. def flatMap[B](f: (A) ⇒ DList[B]): DList[B]

    Map over a difference list, then flatten.

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

    Fold over a difference list.

  15. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  16. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  17. def headOption: Option[A]

    Get the first element of the list, if any.

  18. def isEmpty: Boolean

    Tests whether list is empty.

  19. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  20. def map[B](f: (A) ⇒ B): DList[B]

    Map over a difference list.

  21. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  22. final def notify(): Unit
    Definition Classes
    AnyRef
  23. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  24. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  25. def tailOption: Option[DList[A]]

    Get the tail of the list, if any.

  26. def toList: List[A]

    Convert to a normal list.

  27. def toString(): String
    Definition Classes
    AnyRef → Any
  28. def uncons[B](z: ⇒ B, f: (A, DList[A]) ⇒ B): B

    List elimination of head and tail.

  29. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  31. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  32. def zip[B](bs: ⇒ DList[B]): DList[(A, B)]

Deprecated Value Members

  1. def head: A

    Get the first element of the list.

    Get the first element of the list.

    Annotations
    @deprecated
    Deprecated

    (Since version 7.1.0) unsafe; use headOption

  2. def tail: DList[A]

    Get the tail of the list.

    Get the tail of the list.

    Annotations
    @deprecated
    Deprecated

    (Since version 7.1.0) unsafe; use tailOption

Inherited from AnyRef

Inherited from Any

Ungrouped