Note for now much of the docs is LLM written. This was done to save time and focus on code development. The docs have been LOOSLEY reviewed. However, the code itself has been either fully written by hand or fully reviewed. Therefore, the docs should at the moment be seen as a loose resource rather than authoratiative (and this is on top of the general ability for docs to drift)
87 lines
2.5 KiB
Groff
87 lines
2.5 KiB
Groff
.TH "src/include/serif/utils/dependencies/detail/schema.hpp" 3 "Version v0.0.1a" "SERiF" \" -*- nroff -*-
|
|
.ad l
|
|
.nh
|
|
.SH NAME
|
|
src/include/serif/utils/dependencies/detail/schema.hpp
|
|
.SH SYNOPSIS
|
|
.br
|
|
.PP
|
|
\fR#include <cstddef>\fP
|
|
.br
|
|
\fR#include <type_traits>\fP
|
|
.br
|
|
\fR#include 'serif/utils/dependencies/dependency_context\&.hpp'\fP
|
|
.br
|
|
\fR#include 'serif/utils/dependencies/computation_graph\&.hpp'\fP
|
|
.br
|
|
\fR#include 'serif/utils/dependencies/detail/result\&.hpp'\fP
|
|
.br
|
|
|
|
.SS "Classes"
|
|
|
|
.in +1c
|
|
.ti -1c
|
|
.RI "struct \fBserif::utils::dependencies::detail::AppendBinding< Bindings< BindingsTs\&.\&.\&. >, BindingT >\fP"
|
|
.br
|
|
.ti -1c
|
|
.RI "struct \fBserif::utils::dependencies::detail::ResolveComputation< ComputationT, BindingsT, Available >\fP"
|
|
.br
|
|
.RI "Missing inputs stop resolution before instantiating the callable or its result type\&. "
|
|
.ti -1c
|
|
.RI "struct \fBserif::utils::dependencies::detail::ResolveComputation< ComputationT, BindingsT, true >\fP"
|
|
.br
|
|
.ti -1c
|
|
.RI "struct \fBserif::utils::dependencies::detail::ResolveStep< GraphT, BindingsT, Position, ComputationT, Valid >\fP"
|
|
.br
|
|
.RI "An invalid callable must not instantiate the remaining graph or access a missing Value type\&. "
|
|
.ti -1c
|
|
.RI "struct \fBserif::utils::dependencies::detail::ResolveStep< GraphT, BindingsT, Position, ComputationT, true >\fP"
|
|
.br
|
|
.ti -1c
|
|
.RI "struct \fBserif::utils::dependencies::detail::ResolveGraph< GraphT, BindingsT, Position, false >\fP"
|
|
.br
|
|
.ti -1c
|
|
.RI "struct \fBserif::utils::dependencies::detail::ResolveGraph< GraphT, BindingsT, Position, true >\fP"
|
|
.br
|
|
.ti -1c
|
|
.RI "struct \fBserif::utils::dependencies::detail::ComputationGraphSchema< GraphT, ContextT, Independent >\fP"
|
|
.br
|
|
.ti -1c
|
|
.RI "struct \fBserif::utils::dependencies::detail::ComputationGraphSchema< GraphT, ContextT, true >\fP"
|
|
.br
|
|
.in -1c
|
|
.SS "Namespaces"
|
|
|
|
.in +1c
|
|
.ti -1c
|
|
.RI "namespace \fBserif\fP"
|
|
.br
|
|
.ti -1c
|
|
.RI "namespace \fBserif::utils\fP"
|
|
.br
|
|
.ti -1c
|
|
.RI "namespace \fBserif::utils::dependencies\fP"
|
|
.br
|
|
.ti -1c
|
|
.RI "namespace \fBserif::utils::dependencies::detail\fP"
|
|
.br
|
|
.in -1c
|
|
.SS "Concepts"
|
|
|
|
.in +1c
|
|
.ti -1c
|
|
.RI "concept \fBserif::utils::dependencies::ComputationGraphFor\fP"
|
|
.br
|
|
.in -1c
|
|
.SS "Functions"
|
|
|
|
.in +1c
|
|
.ti -1c
|
|
.RI "template<typename BindingsT, typename\&.\&.\&. Keys> consteval bool \fBserif::utils::dependencies::detail::independent_results\fP (\fBKeyList\fP< Keys\&.\&.\&. >)"
|
|
.br
|
|
.RI "A key has exactly one producer: either the context or a computation\&. "
|
|
.in -1c
|
|
.SH "Author"
|
|
.PP
|
|
Generated automatically by Doxygen for SERiF from the source code\&.
|