final class NullArgument[A, B] extends AnyRef
Value Members
- final def !=(arg0: Any): Boolean
- final def ##: Int
- def ***[C, D](x: NullArgument[C, D]): NullArgument[(A, C), (B, D)]
- def +++[C, D](x: NullArgument[C, D]): NullArgument[\/[A, C], \/[B, D]]
- final def ==(arg0: Any): Boolean
- def andThen[C](g: NullArgument[B, C]): NullArgument[A, C]
- def ap[C](f: NullArgument[A, (B) => C]): NullArgument[A, C]
- def apply(a: Option[A]): B
- final def asInstanceOf[T0]: T0
- def clone(): AnyRef
- def cokleisli: Cokleisli[Option, A, B]
- def compose[C](f: NullArgument[C, A]): NullArgument[C, B]
- def contramap[C](f: (C) => A): NullArgument[C, B]
- def dimap[C, D](f: (C) => A, g: (B) => D): NullArgument[C, D]
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- def finalize(): Unit
- def flatMap[C](f: (B) => NullArgument[A, C]): NullArgument[A, C]
- final def getClass(): Class[_ <: AnyRef]
- def hashCode(): Int
- final def isInstanceOf[T0]: Boolean
- def left[C]: NullArgument[\/[A, C], \/[B, C]]
- def lower: (A) => B
- def map[C](f: (B) => C): NullArgument[A, C]
- final def ne(arg0: AnyRef): Boolean
- 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]: NullArgument[\/[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: NullArgument[A, C]): NullArgument[A, (B, C)]
- def |+|(x: NullArgument[A, B])(implicit S: Semigroup[B]): NullArgument[A, B]