\/

Value Members

1. final def !=(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

2. final def !=(arg0: Any): Boolean

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

5. final def ==(arg0: Any): Boolean

   Definition Classes

   Any

6. implicit val DisjunctionAssociative: Associative[\/]

   Definition Classes

   DisjunctionInstances2

7. implicit def DisjunctionBand[A, B](implicit arg0: Band[A], arg1: Band[B]): Band[\/[A, B]]

   Definition Classes

   DisjunctionInstances1

8. implicit def DisjunctionEqual[A, B](implicit arg0: Equal[A], arg1: Equal[B]): Equal[\/[A, B]]

   Definition Classes

   DisjunctionInstances0

9. implicit def DisjunctionInstances1[L]: Traverse[[β$0$]\/[L, β$0$]] with Monad[[β$1$]\/[L, β$1$]] with BindRec[[β$2$]\/[L, β$2$]] with Cozip[[β$3$]\/[L, β$3$]] with Plus[[β$4$]\/[L, β$4$]] with Optional[[β$5$]\/[L, β$5$]] with MonadError[[β$6$]\/[L, β$6$], L]

   Definition Classes

   DisjunctionInstances1

10. implicit val DisjunctionInstances2: Bitraverse[\/]

    Definition Classes

    DisjunctionInstances2

11. implicit def DisjunctionMonoid[A, B](implicit arg0: Semigroup[A], arg1: Monoid[B]): Monoid[\/[A, B]]

    Definition Classes

    DisjunctionInstances

12. implicit def DisjunctionOrder[A, B](implicit arg0: Order[A], arg1: Order[B]): Order[\/[A, B]]

    Definition Classes

    DisjunctionInstances

13. implicit def DisjunctionSemigroup[A, B](implicit arg0: Semigroup[A], arg1: Semigroup[B]): Semigroup[\/[A, B]]

    Definition Classes

    DisjunctionInstances0

14. implicit def DisjunctionShow[A, B](implicit arg0: Show[A], arg1: Show[B]): Show[\/[A, B]]

    Definition Classes

    DisjunctionInstances0

15. final def asInstanceOf[T0]: T0

    Definition Classes

    Any

16. def attempt[A, B](f: ⇒ B)(err: (Throwable) ⇒ A): \/[A, B]

    Wrap a call to a deterministic partial function, making a total function.

    Wrap a call to a deterministic partial function, making a total function. May be used to interface with legacy methods that do not have an FP equivalent.

    The err callback must convert the non-referentially transparent Throwable (which is anything caught by the NonFatal construct) into a data type. The caller is trusted not to allow the stack trace to escape into the A data type.

    Note that exceptions are extremely inefficient. Callers should consider validating the input to their partial function and exiting early.

    If no useful information can be obtained from the Throwable, prefer scalaz.Maybe#attempt.

    For interfacing with non-deterministic blocks of code that may or may not throw Throwable, use scalaz.effect.IO.

    For interfacing with deterministic functions that violate the type system by returning null, use scalaz.Maybe#fromNullable.

17. def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

18. final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

19. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

20. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

21. def fromEither[A, B](e: Either[A, B]): \/[A, B]

    Construct a disjunction value from a standard scala.Either.

22. def fromTryCatchNonFatal[T](a: ⇒ T): \/[Throwable, T]

23. def fromTryCatchThrowable[T, E <: Throwable](a: ⇒ T)(implicit nn: NotNothing[E], ex: ClassTag[E]): \/[E, T]

24. final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

25. def hashCode(): Int

    Definition Classes

    AnyRef → Any

26. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

27. def left[A, B]: (A) ⇒ \/[A, B]

    Construct a left disjunction value.

28. final def loopLeft[A, B, X](d: \/[A, B], left: (A) ⇒ \/[X, \/[A, B]], right: (B) ⇒ X): X

    Spin in tail-position on the left value of the given disjunction.

    Spin in tail-position on the left value of the given disjunction.

    Annotations

    @tailrec()

29. final def loopRight[A, B, X](d: \/[A, B], left: (A) ⇒ X, right: (B) ⇒ \/[X, \/[A, B]]): X

    Spin in tail-position on the right value of the given disjunction.

    Spin in tail-position on the right value of the given disjunction.

    Annotations

    @tailrec()

30. final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

31. final def notify(): Unit

    Definition Classes

    AnyRef

32. final def notifyAll(): Unit

    Definition Classes

    AnyRef

33. def right[A, B]: (B) ⇒ \/[A, B]

    Construct a right disjunction value.

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

    Definition Classes

    AnyRef

35. def toString(): String

    Definition Classes

    AnyRef → Any

36. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

38. final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )