final
class
NullResult[A, B] extends AnyRef
Value Members
-
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
***[C, D](x: =>?[C, D]): =>?[(A, C), (B, D)]
-
def
+++[C, D](x: =>?[C, D]): =>?[\/[A, C], \/[B, D]]
-
-
final
def
==(arg0: Any): Boolean
-
def
=>>[C](f: ?=>[B, C]): =>?[A, C]
-
def
andThen[C](g: =>?[B, C]): =>?[A, C]
-
def
ap[C](f: =>?[A, (B) ⇒ C]): =>?[A, C]
-
def
apply(a: A): Option[B]
-
final
def
asInstanceOf[T0]: T0
-
def
cancel: =>?[A, A]
-
def
carry: =>?[A, (A, B)]
-
def
clone(): AnyRef
-
def
compose[C](f: =>?[C, A]): =>?[C, B]
-
def
contramap[C](f: (C) ⇒ A): =>?[C, B]
-
def
dimap[C, D](f: (C) ⇒ A, g: (B) ⇒ D): NullResult[C, D]
-
-
-
def
finalize(): Unit
-
def
first[C]: =>?[(A, C), (B, C)]
-
def
flatMap[C](f: (B) ⇒ =>?[A, C]): =>?[A, C]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
isDefinedAt(a: A): Boolean
-
def
isEmptyAt(a: A): Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
-
def
left[C]: =>?[\/[A, C], \/[B, C]]
-
def
map[C](f: (B) ⇒ C): =>?[A, C]
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
on[F[_]](a: F[A])(implicit F: Functor[F]): OptionT[F, B]
-
def
or(a: A, b: ⇒ B): B
-
def
right[C]: =>?[\/[C, A], \/[C, B]]
-
def
second[C]: =>?[(C, A), (C, B)]
-
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
traverse[F[_]](a: F[A])(implicit T: Traverse[F]): Option[F[B]]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
zip[C](x: =>?[A, C]): =>?[A, (B, C)]
-
def
|(x: ⇒ =>?[A, B]): =>?[A, B]
-
def
|+|(x: =>?[A, B])(implicit S: Semigroup[B]): =>?[A, B]