The laws an arrow is known to have, one answer in K₃ per law: True where certified, Unknown where not, never False (a profile certifies, it does not refute). The pointwise lift Ω^E of the truth chain to the laws (lattice__Omega_First_Pointwise_Lift), restricted to its sub-chain Σ = {Unknown < True}: combined law by law with Inf / Sup. Read by the laws of functions below and by the laws of relations (relational:dyadic).
More...
|
|
constexpr Ternary | operator[] (E w) const |
| constexpr Profile | with (E w) const |
| | This profile with law w certified: a new profile, this one unchanged.
|
|
constexpr bool | operator== (const Profile &) const =default |
|
template<typename F>
requires std::invocable<const F&, E> |
| static constexpr Profile | tabulate (const F &f) |
| | The profile whose answer at each law is f(law): the one loop every engine runs, law by law.
|
template<typename E, std::size_t N>
struct dedekind::category::Profile< E, N >
The laws an arrow is known to have, one answer in K₃ per law: True where certified, Unknown where not, never False (a profile certifies, it does not refute). The pointwise lift Ω^E of the truth chain to the laws (lattice__Omega_First_Pointwise_Lift), restricted to its sub-chain Σ = {Unknown < True}: combined law by law with Inf / Sup. Read by the laws of functions below and by the laws of relations (relational:dyadic).
- Template Parameters
-
| E | the laws, an enumeration 0 … N − 1. |
| N | how many. |
◆ tabulate()
template<typename E, std::size_t N>
template<typename F>
requires std::invocable<const F&, E>
The profile whose answer at each law is f(law): the one loop every engine runs, law by law.
- Parameters
-
◆ with()
template<typename E, std::size_t N>
This profile with law w certified: a new profile, this one unchanged.
- Parameters
-
The documentation for this struct was generated from the following file: