NonEmptyList

abstract val head: A

abstract val tail: List[A]

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def :::>[AA >: A](bs: List[AA]): NonEmptyList[AA]

def <::[AA >: A](b: AA): NonEmptyList[AA]

def <:::[AA >: A](bs: List[AA]): NonEmptyList[AA]

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def append[AA >: A](f2: NonEmptyList[AA]): NonEmptyList[AA]

Append one nonempty list to another.

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(any: Any): Boolean

def finalize(): Unit

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

def foreach(f: (A) ⇒ Unit): Unit

final def getClass(): Class[_]

def hashCode(): Int

def init: List[A]

final def isInstanceOf[T0]: Boolean

def last: A

def list: List[A]

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

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def reverse: NonEmptyList[A]

def size: Int

def sortBy[B](f: (A) ⇒ B)(implicit o: Order[B]): NonEmptyList[A]

def sortWith(lt: (A, A) ⇒ Boolean): NonEmptyList[A]

def sorted[B >: A](implicit o: Order[B]): NonEmptyList[A]

def stream: Stream[A]

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

def tails: NonEmptyList[NonEmptyList[A]]

def toString(): String

def toZipper: Zipper[A]

def traverse1[F[_], B](f: (A) ⇒ F[B])(implicit F: Apply[F]): F[NonEmptyList[B]]

def unzip[X, Y](implicit ev: <:<[A, (X, Y)]): (NonEmptyList[X], NonEmptyList[Y])

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def zip[B](b: ⇒ NonEmptyList[B]): NonEmptyList[(A, B)]

def zipperEnd: Zipper[A]