bend-schema-lib
Search uses release 0.4.1.0 · 126 definitions
Definitions (126)
- def tuple_of
- def at_raw
- def each_pos
- def count_unknown---- the claim the strict law makes ----
- type Both
- def Meaning
- def enc
- def lcons
- def both
- def opt_some
- def map_inl
- def map_inr
- def pick_m
- def true_unit
- def nullish
- def dec
- def opt_atAn absent value reaches the top of what enc writes for s: s is an SOptional, or it hands the value it was given straight to a schema that is (a rule, a strict object, a bound, or the tail of a variant or tagged chain -- and an SOpt, whose Some case passes the value through).
- def nullable
- def no_key---- the object a schema's encoding lands in ----
- def fresh_fn is not a key of the record chain s (a chain ends in SEnd).
- def fresh_vn is not a key of the variant chain s (a chain ends in SVEnd).
- def is_keyedA record chain (ending in SEnd) or a variant chain (ending in SVEnd): what SStrict may wrap, so every key its encoding writes is a declared name.
- def fresh_tn names no case of the tagged chain s, whose key is k, and the chain ends in STagEnd{k}: one key for the whole chain.
- def wf
- def names_okEvery enum value in x is one of its names (encode_conforms' premise).
- def bounds_okEvery bound a constructor states holds of the value that will be written, at every place one sits in the schema (encode_conforms' second premise, beside names_ok).