RecursiveSchemaDeriver

org.hungerford.generic.schema.RecursiveSchemaDeriver$
See theRecursiveSchemaDeriver companion trait

Attributes

Companion:
trait
Graph
Supertypes
class Object
trait Matchable
class Any
Self type

Members list

Concise view

Type members

Types

type Aux[T, Tail <: Tuple, S] = RecursiveSchemaDeriver[T, Tail] { type Shape = S; }

Value members

Concrete methods

def apply[Ts <: NonEmptyTuple](implicit sd: RecursiveSchemaDeriver[Head[Ts], Tail[Ts]]): Aux[Head[Ts], Tail[Ts], Shape]

Givens

Givens

given coproductSchemaDeriver[T, Tail <: Tuple, S](using cprd: Aux[T, Tail, S]): Aux[T, Tail, S]
given productSchemaDeriver[T, Tail <: Tuple, S](using prd: Aux[T, Tail, S]): Aux[T, Tail, S]
given singletonSchemaDeriver[T <: Singleton, Tail <: Tuple, S](using sd: Aux[T, S]): Aux[T, Tail, S]