Lst

sealed abstract class Lst[+A]

Linked list with O(1) cons, snoc and concatenation and amortized O(1) uncons.

Companion:
object
class Object
trait Matchable
class Any

Value members

Concrete methods

final def ++[B >: A](that: Lst[B]): Lst[B]
final def +:[B >: A](b: B): Lst[B]
final def :+[B >: A](b: B): Lst[B]
@inline
final def :+?[B >: A](b: Option[B]): Lst[B]
final def ::[B >: A](h: B): Lst[B]
final def :::[B >: A](that: Lst[B]): Lst[B]
@inline
final def ?+:[B >: A](b: Option[B]): Lst[B]
final def filter(p: A => Boolean): Lst[A]
final def filterNot(p: A => Boolean): Lst[A]
final def flatMap[B](f: A => Lst[B]): Lst[B]
final def foldLeft[B](b: B)(f: (B, A) => B): B
final def foldRight[B](b: B)(f: (A, B) => B): B
final def isEmpty: Boolean
final def map[B](f: A => B): Lst[B]
final def mapRev_:::[B, A1 >: A](bsf: (Iterable[B], B => A1)): Lst[A1]
final def rev_:::[B >: A](bs: Iterable[B]): Lst[B]
final def size: Int
final def toList: List[A]
final def toRevList: List[A]
override def toString: String
Definition Classes
Any
@tailrec
final def uncons: Option[(A, Lst[A])]