NeedDiscriminators

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def ->[B](y: B): (NeedDiscriminators[A], B)

final def ==(arg0: Any): Boolean

val a: NeedDiscriminators[A]

def as[B](implicit as: Transformer[A, B]): NeedDiscriminators[B]

Transforms using implicitly available evidence that such a transformation is possible.

final def asInstanceOf[T0]: T0

def auto(implicit auto: CoproductBuilderAutoDiscriminators[R, C, A]): Codec[R] with KnownDiscriminatorType[A]

Determines discriminators values automatically by looking for a Discriminator[R, X, A] for each component type X in the coproduct C.

def clone(): AnyRef

def ensuring(cond: (NeedDiscriminators[A]) ⇒ Boolean, msg: ⇒ Any): NeedDiscriminators[A]

def ensuring(cond: (NeedDiscriminators[A]) ⇒ Boolean): NeedDiscriminators[A]

def ensuring(cond: Boolean, msg: ⇒ Any): NeedDiscriminators[A]

def ensuring(cond: Boolean): NeedDiscriminators[A]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exmap[B](f: (A) ⇒ Attempt[B], g: (B) ⇒ Attempt[A]): NeedDiscriminators[B]

Transforms using two functions, A => Attempt[B] and B => Attempt[A].

def exmapc[B](f: (A) ⇒ Attempt[B])(g: (B) ⇒ Attempt[A]): NeedDiscriminators[B]

Curried version of exmap.

def finalize(): Unit

def formatted(fmtstr: String): String

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def narrow[B](f: (A) ⇒ Attempt[B], g: (B) ⇒ A): NeedDiscriminators[B]

Transforms using two functions, A => Attempt[B] and B => A.

def narrowc[B](f: (A) ⇒ Attempt[B])(g: (B) ⇒ A): NeedDiscriminators[B]

Curried version of narrow.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val self: NeedDiscriminators[A]

Supports TransformSyntax.

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

def toString(): String

def using[Rec <: HList](bindings: Rec)(implicit keyDiscriminators: CoproductBuilderKeyDiscriminators[C, Rec, A]): Codec[R] with KnownDiscriminatorType[A]

Specifies the discriminator values for each of the union type members by providing the discriminators as a record with the same keys as the union.

def using[N <: Nat](discriminators: Sized[Seq[A], N])(implicit ev: Aux[C, N]): Codec[R] with KnownDiscriminatorType[A]

Specifies the discriminator values for each of the coproduct type members.

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def widen[B](f: (A) ⇒ B, g: (B) ⇒ Attempt[A]): NeedDiscriminators[B]

Transforms using two functions, A => B and B => Attempt[A].

def widenOpt[B](f: (A) ⇒ B, g: (B) ⇒ Option[A]): NeedDiscriminators[B]

Transforms using two functions, A => B and B => Option[A].

def widenOptc[B](f: (A) ⇒ B)(g: (B) ⇒ Option[A]): NeedDiscriminators[B]

Curried version of widenOpt.

def widenc[B](f: (A) ⇒ B)(g: (B) ⇒ Attempt[A]): NeedDiscriminators[B]

Curried version of widen.

def xmap[B](f: (A) ⇒ B, g: (B) ⇒ A): NeedDiscriminators[B]

Transforms using the isomorphism described by two functions, A => B and B => A.

def xmapc[B](f: (A) ⇒ B)(g: (B) ⇒ A): NeedDiscriminators[B]

Curried version of xmap.

def ~[B](b: B): (NeedDiscriminators[A], B)

def →[B](y: B): (NeedDiscriminators[A], B)

def pxmap[B](f: (A) ⇒ B, g: (B) ⇒ Option[A]): NeedDiscriminators[B]

Transforms using two functions, A => B and B => Option[A].