30 lines
1.0 KiB
Groff
30 lines
1.0 KiB
Groff
|
.TH "serif::utils::dependencies::CompatibleComputations" 3 "Version v0.0.1a" "SERiF" \" -*- nroff -*-
|
||
|
|
.ad l
|
||
|
|
.nh
|
||
|
|
.SH NAME
|
||
|
|
serif::utils::dependencies::CompatibleComputations \- A computational graph needs unique producers, valid input ownership, and no cycles\&.
|
||
|
|
|
||
|
|
.SH SYNOPSIS
|
||
|
|
.br
|
||
|
|
.PP
|
||
|
|
.PP
|
||
|
|
\fR#include <computation_graph\&.hpp>\fP
|
||
|
|
.SH "Concept definition"
|
||
|
|
.PP
|
||
|
|
|
||
|
|
.nf
|
||
|
|
template<typename\&.\&.\&. Computations>
|
||
|
|
concept serif::utils::dependencies::CompatibleComputations =
|
||
|
|
(IsComputation<Computations> && \&.\&.\&.) &&
|
||
|
|
misc::traits::all_unique_types_v<typename std::remove_cvref_t<Computations>::Key\&.\&.\&.> &&
|
||
|
|
(detail::valid_input_ownership_v<Computations, KeyList<typename std::remove_cvref_t<Computations>::Key\&.\&.\&.>> && \&.\&.\&.) &&
|
||
|
|
detail::Graph<std::remove_cvref_t<Computations>\&.\&.\&.>::acyclic()
|
||
|
|
.PP
|
||
|
|
.fi
|
||
|
|
.SH "Detailed Description"
|
||
|
|
.PP
|
||
|
|
A computational graph needs unique producers, valid input ownership, and no cycles\&.
|
||
|
|
.SH "Author"
|
||
|
|
.PP
|
||
|
|
Generated automatically by Doxygen for SERiF from the source code\&.
|