Unions

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def append[B](others: Unions[R, B]): Unions[R, A]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def continueWith[B](continuation: Arrs[R, List[Any], B]): Arrs[R, A, B]

create a continuation which will apply the 'map' function if the first effect of this Unions object is interpreted

final def eq(arg0: AnyRef): Boolean

def extract[M[_]](implicit m: /=[M, R]): CollectedUnions[M, R, R]

collect all the M effects and create a continuation for other effects in the same stack

val first: Union[R, A]

final def getClass(): Class[_]

def into[S](f: UnionInto[R, S]): Unions[S, A]

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def project[M[_], U](implicit m: Aux[M, R, U]): CollectedUnions[M, R, U]

collect all the M effects and create a continuation for other effects in a stack containing no more M effects

val rest: List[Union[R, Any]]

def size: Int

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

def transform[M[_]](nat: ~>[M, M])(implicit m: /=[M, R]): Unions[R, A]

def transformInto[M[_], N[_], U, S](nat: ~>[M, N])(implicit m: Aux[M, R, U], n: Aux[N, S, U]): Unions[S, A]

def unions: List[Union[R, Any]]

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit