|
SERiF v0.0.1a
Stellar Evolution and Rotation in Four Dimensions
|
This file defines compile time tags for the relations that can be declared about a mesh in the domain module. These are ultimately used to define a constrained mesh schema. More...
#include <string_view>#include "serif/discretization/domain/concepts.hpp"#include "serif/utils/misc/concepts/numeric.hpp"#include "serif/utils/misc/std_helper/variadic_cleaning.hpp"Classes | |
| struct | serif::discretization::domain::relation::DomainRelation |
| Base class for all relations in the domain module. This class is used to define compile-time tags for relations that can be declared about a mesh. More... | |
| struct | serif::discretization::domain::relation::Inscribed< A, B > |
| Compile time type representing the inscribed relation between two domains or sets. This relation states that every face of the inner domain (A) that is not interior to A borders the outer domain (B). More... | |
| struct | serif::discretization::domain::relation::FullyConnected< A > |
| Compile time type representing the fully connected relation for a domain or set. This relation states that the domain is a single connected blob of elements, not two separate pieces. More... | |
| struct | serif::discretization::domain::relation::DomainBoundary< BoundaryT, DomainTs > |
| Compile time type representing the domain boundary relation between a boundary and one or two domains. This relation states that the boundary is exactly the surface between the specified domains. We enforce here that the size of the DomainTs pack is either one or two, as a boundary can only be associated with one or two domains. If it is one domain then the boundary is the surface of that domain, if it is two domains then the boundary is the interface between those two domains. More... | |
Namespaces | |
| namespace | serif |
| namespace | serif::discretization |
| namespace | serif::discretization::domain |
| namespace | serif::discretization::domain::relation |
Functions | |
| template<typename... Ts> | |
| consteval std::size_t | serif::discretization::domain::relation::CountVariadicArguments () noexcept |
This file defines compile time tags for the relations that can be declared about a mesh in the domain module. These are ultimately used to define a constrained mesh schema.
Each relation must hold for a mesh to be considered valid for a given schema. This is intended to resolve some particular class of bug I imagine where a lively young astronomer confidently rolls up to SERiF with a new mesh in hand and a dream in their heart and then spend the next year trying to sort out esoteric errors. The idea here is that once a mesh gets through this system it should be provably at least good enough to be able to run some math against. That is not to say this validates the quality of a mesh, this system is not meant for that; rather, it is to say it lets be confident that the invariants we expect of a mesh are actually true.