Data

Represents data that lives beind a typedef. For example,

 type Label = String
 val x: Label = "xyz"

Should would be represented as

 Aliased(Data.String("xyz"), schema = Schema.Alias("Label", Data.String))

See notes on Concept.Enum for information on how this type is modelled

Since in ELM, record-based datastructures are generally kept in order, we want to preserve element ordering until the last possible second (i.e. within the DDL structure). This should perserve a certain amount of determinism. We have chosen to use LinkedHashMap because Scala's immutable ListMap is only suitable for a small amount of elements and has O(n) lookup time. Despite the fact that this datastructure is mutable

Equlvalent to ELM Optional or Scala Option

A instance of a non-discrimiated union-type such as a Scala 3

 type MyUnion = Int | String

Would be defined as

 Union(Schema.Int, Schema.String)

A value of it would defined as:

 Data.Union(Data.Int(123), Union(Schema.Int, Schema.String))

The names of the product elements

The name of the type