final case class RecordSchema[P[_], F[_], I](props: FreeApplicative[[γ$9$]PropSchema[I, F, γ$9$], I]) extends SchemaF[P, F, I] with Product with Serializable
Wrapper for the free applicative structure which is used to construct and disassemble values of product types.
- P
The GADT type constructor for a sum type which defines the set of primitive types used in the schema.
- F
The functor through which the structure of the schema will be interpreted. This will almost always be a fixpoint type such as morphling.HFix.HCofree, which is used to introduce the ability to create recursive (tree-structured) schema.
- I
The type of the Scala value to be produced (or consumed) by an interpreter of the schema. Also known as the "index" type of the schema.
- props
the free applicative value composed of zero or more PropSchema instances
- Alphabetic
- By Inheritance
- RecordSchema
- Serializable
- Serializable
- Product
- Equals
- SchemaF
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
-
new
RecordSchema(props: FreeApplicative[[γ$9$]PropSchema[I, F, γ$9$], I])
- props
the free applicative value composed of zero or more PropSchema instances
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native() @IntrinsicCandidate()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
-
def
hfmap[G[_]](nt: ~>[F, G]): RecordSchema[P, G, I]
HFunctor operation which allows transformation of the functor through which the structure of the schema will be interpreted.
HFunctor operation which allows transformation of the functor through which the structure of the schema will be interpreted.
Defining this operation directly on the SchemaF type rather than in morphling.SchemaF.schemaFHFunctor simplifies type inference.
- Definition Classes
- RecordSchema → SchemaF
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
-
def
pmap[Q[_]](nt: ~>[P, Q]): RecordSchema[Q, F, I]
HFunctor operation which allows transformation of the primitive algebra of the schema.
HFunctor operation which allows transformation of the primitive algebra of the schema.
Defining this operation directly on the SchemaF type rather than in morphling.SchemaF.schemaFHFunctor simplifies type inference.
- Definition Classes
- RecordSchema → SchemaF
- val props: FreeApplicative[[γ$8$]PropSchema[I, F, γ$8$], I]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
Deprecated Value Members
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] ) @Deprecated
- Deprecated