final
class
NullArgument[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
andThen[C](g: ?=>[B, C]): ?=>[A, C]
-
def
ap[C](f: ?=>[A, (B) ⇒ C]): ?=>[A, C]
-
def
apply(a: Option[A]): B
-
final
def
asInstanceOf[T0]: T0
-
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): NullArgument[C, D]
-
-
-
def
finalize(): Unit
-
def
flatMap[C](f: (B) ⇒ ?=>[A, C]): ?=>[A, C]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
left[C]: ?=>[\/[A, C], \/[B, C]]
-
def
lower: (A) ⇒ B
-
def
map[C](f: (B) ⇒ C): ?=>[A, C]
-
-
def
never: B
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
on[F[_]](o: OptionT[F, A])(implicit F: Functor[F]): F[B]
-
def
pair: ((A) ⇒ B, B)
-
def
right[C]: ?=>[\/[C, A], \/[C, B]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
zero(implicit M: Monoid[A]): B
-
def
zip[C](x: ?=>[A, C]): ?=>[A, (B, C)]
-
def
|+|(x: ?=>[A, B])(implicit S: Semigroup[B]): ?=>[A, B]