SchemaVisitor

trait SchemaVisitor[F[_]] extends PolyFunction[Schema, F]
Companion:
object
class Object
trait Matchable
class Any

Value members

Abstract methods

def biject[A, B](schema: Schema[A], to: A => B, from: B => A): F[B]
def collection[C[_], A](shapeId: ShapeId, hints: Hints, tag: CollectionTag[C], member: Schema[A]): F[C[A]]
def enumeration[E](shapeId: ShapeId, hints: Hints, values: List[EnumValue[E]], total: E => EnumValue[E]): F[E]
def lazily[A](suspend: Lazy[Schema[A]]): F[A]
def map[K, V](shapeId: ShapeId, hints: Hints, key: Schema[K], value: Schema[V]): F[Map[K, V]]
def primitive[P](shapeId: ShapeId, hints: Hints, tag: Primitive[P]): F[P]
def struct[S](shapeId: ShapeId, hints: Hints, fields: Vector[Field[Schema, S, _]], make: IndexedSeq[Any] => S): F[S]
def surject[A, B](schema: Schema[A], to: Refinement[A, B], from: B => A): F[B]
def union[U](shapeId: ShapeId, hints: Hints, alternatives: Vector[Alt[Schema, U, _]], dispatch: Dispatcher[Schema, U]): F[U]

Concrete methods

def apply[A](schema: Schema[A]): F[A]

Inherited methods

final def andThen[H[_]](other: PolyFunction[F, H]): PolyFunction[Schema, H]
Inherited from:
PolyFunction
final def mapK[H[_]](fk: PolyFunction[F, H]): PolyFunction[Schema, H]
Inherited from:
PolyFunction
final def unsafeCache(allPossibleInputs: Vector[Existential[Schema]]): PolyFunction[Schema, F]

Pre-computes the polyfunction by applying it on a vector of possible inputs.

Pre-computes the polyfunction by applying it on a vector of possible inputs.

Unsafe because calling the resulting polyfunction with an input that wasn't cached will result in an exception.

Inherited from:
PolyFunction

Creates a memoised version of this function.

Creates a memoised version of this function.

Unsafe because it creates mutable state, which is a non-referentially-transparent action (aka a side-effect).

Inherited from:
PolyFunction