Trace

abstract def result: Result[A]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def &&(that: Trace[Boolean])(implicit ev: <:<[A, Boolean]): Trace[Boolean]

final def <==>(that: Trace[Boolean])(implicit ev: <:<[A, Boolean]): Trace[Boolean]

final def ==(arg0: Any): Boolean

final def ==>(that: Trace[Boolean])(implicit ev: <:<[A, Boolean]): Trace[Boolean]

final def >>>[B](that: Trace[B]): Trace[B]

final def annotate(annotation: Annotation*): Trace[A]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def implies(that: Trace[Boolean])(implicit ev: <:<[A, Boolean]): Trace[Boolean]

def isFailure: Boolean

final def isInstanceOf[T0]: Boolean

def isSuccess: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

final def unary_!(implicit ev: <:<[A, Boolean]): Trace[Boolean]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

final def withCode(code: Option[String]): Trace[A]

Apply the code to every node in the tree.

def withLocation(location: Option[String]): Trace[A]

Apply the location to every node in the tree.

def withParentSpan(span: Option[Span]): Trace[A]

Apply the parent span to every node in the tree.

final def withSpan(span: Option[Span] = None): Trace[A]

Apply the metadata to the rightmost node in the trace.

final def ||(that: Trace[Boolean])(implicit ev: <:<[A, Boolean]): Trace[Boolean]