Decoder

abstract def apply(c: HCursor): Xor[DecodingFailure, A]

Decode the given hcursor.

final def !=(arg0: Any): Boolean

final def ##(): Int

def &&&[B](x: Decoder[B]): Decoder[(A, B)]

Combine two decoders.

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def decodeJson(j: Json): Xor[DecodingFailure, A]

Decode the given Json value.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def flatMap[B](f: (A) ⇒ Decoder[B]): Decoder[B]

Monadically bind a function over this Decoder.

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def kleisli: Kleisli[[x]Xor[DecodingFailure, x], HCursor, A]

Convert to a Kleisli arrow.

def map[B](f: (A) ⇒ B): Decoder[B]

Map a function over this Decoder.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def product[B](x: Decoder[B]): (HCursor, HCursor) ⇒ Xor[DecodingFailure, (A, B)]

Run two decoders.

def split[B](d: Decoder[B]): (Xor[HCursor, HCursor]) ⇒ Xor[DecodingFailure, Xor[A, B]]

Run one or another decoder.

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

def toString(): String

def tryDecode(c: ACursor): Xor[DecodingFailure, A]

Decode the given acursor.

def validate(pred: (HCursor) ⇒ Boolean, message: ⇒ String): Decoder[A]

Build a new instance that fails if the condition does not hold.

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withErrorMessage(message: String): Decoder[A]

Build a new instance with the specified error message.

def |||[AA >: A](d: ⇒ Decoder[AA]): Decoder[AA]

Choose the first succeeding decoder.