Cause

abstract def canEqual(that: Any): Boolean

abstract def productArity: Int

abstract def productElement(n: Int): Any

final def !=(arg0: Any): Boolean

final def ##(): Int

final def &&[E1 >: E](that: Cause[E1]): Cause[E1]

final def ++[E1 >: E](that: Cause[E1]): Cause[E1]

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def defects: List[Throwable]

final def died: Boolean

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def failed: Boolean

final def failureOrCause: Either[E, Cause[Nothing]]

Retrieve the first checked error on the Left if available, if there are no checked errors return the rest of the Cause that is known to contain only Die or Interrupt causes.

final def failures[E1 >: E]: List[E1]

def finalize(): Unit

final def fold[Z](z: Z)(f: PartialFunction[(Z, Cause[E]), Z]): Z

final def getClass(): Class[_]

def hashCode(): Int

final def interrupted: Boolean

final def isInstanceOf[T0]: Boolean

final def map[E1](f: (E) ⇒ E1): Cause[E1]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def prettyPrint: String

def productIterator: Iterator[Any]

def productPrefix: String

final def squash(implicit ev: <:<[E, Throwable]): Throwable

Squashes a Cause down to a single Throwable, chosen to be the "most important" Throwable.

final def squashWith(f: (E) ⇒ Throwable): Throwable

Squashes a Cause down to a single Throwable, chosen to be the "most important" Throwable.

final def stripFailures: Option[Cause[Nothing]]

Remove all Fail and Interrupt nodes from this Cause, return only Die cause/finalizer defects.

final def succeeded: Boolean

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

def toString(): String

final def traces: List[ZTrace]

final def untraced: Cause[E]

final def wait(): Unit

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

final def wait(arg0: Long): Unit