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. def ++(as: ⇒ DList[A]): DList[A]

    Append one list to another in constant time.

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

    Prepend a single element in constant time.

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

    Append a single element in constant time.

  4. def apply(xs: ⇒ List[A]): Free.Trampoline[List[A]]
  5. def flatMap[B](f: (A) ⇒ DList[B]): DList[B]

    Map over a difference list, then flatten.

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

    Fold over a difference list.

  7. def headOption: Option[A]

    Get the first element of the list, if any.

  8. def isEmpty: Boolean

    Tests whether list is empty.

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

    Map over a difference list.

  10. def tailOption: Option[DList[A]]

    Get the tail of the list, if any.

  11. def toList: List[A]

    Convert to a normal list.

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

    List elimination of head and tail.

  13. 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