Dedekind 0.0.0
A structuralist C++23 Module Library
Loading...
Searching...
No Matches
dedekind::linear_algebra::detail_transfer Namespace Reference

Classes

struct  QuadDiagRule
struct  EdgeSucc
 The path DAG's edge relation i → i+1, a NAMED predicate carrier (un-lambda'd, so it is a typed relation the DSL converse and relation traits attach to). More...
struct  WeightedUnitPath
struct  CyclicShift

Typedefs

using MP = MaxPlus<unsigned long long>
using TropMult = typename dedekind::algebra::semiring_ops<MP>::mult
using Idx2 = std::pair<std::size_t, std::size_t>
using TropAdd = typename dedekind::algebra::semiring_ops<MP>::add
using PMat = std::remove_cvref_t<decltype(Pmat)>
using PDagger = TransposeF<bool, 4>
using PMatMult
template<typename T>
using MaxPlus

Variables

constexpr Ket< MP, 2 > v_entry {{MP::of(3), MP::of(5)}}
constexpr Bra< MP, 2 > w_exit {{MP::of(5), MP::of(2)}}
constexpr MP lambda = inner_product<2>(w_exit, v_entry)
constexpr OuterProduct< Ket< MP, 2 >, Bra< MP, 2 >, TropMult > bead
constexpr Ket< unsigned, 2 > qa {{2u, 3u}}
constexpr Diagonal< dim_finite< 2 >, QuadDiagRule > qD {}
constexpr diagonal_product_rule< QuadDiagRule, Ket< unsigned, 2 > > qDa
constexpr Ket< bool, 2 > v_present {{true, true}}
constexpr Bra< bool, 2 > w_first {{true, false}}
constexpr auto path_rel
constexpr auto Bstar = star<4>(ext<4>(path_rel))
constexpr MP mp_bot = dedekind::category::unit<MP>(TropAdd{})
constexpr WeightedUnitPath wpath {}
constexpr auto Tstar = star<4>(ext<4>(wpath))
constexpr auto perm_rel
constexpr auto Pmat = ext<4>(perm_rel)
constexpr auto PdaggerMat

Detailed Description

transfer__Witnesses

Typedef Documentation

◆ PMatMult

using dedekind::linear_algebra::detail_transfer::PMatMult
Initial value:
typename dedekind::algebra::semiring_ops<PMat>::mult

Variable Documentation

◆ bead

OuterProduct<Ket<MP, 2>, Bra<MP, 2>, TropMult> dedekind::linear_algebra::detail_transfer::bead
inlineconstexpr
Initial value:
{v_entry,
w_exit}

◆ path_rel

auto dedekind::linear_algebra::detail_transfer::path_rel
inlineconstexpr
Initial value:
The path DAG's edge relation i → i+1, a NAMED predicate carrier (un-lambda'd, so it is a typed relati...
Definition transfer.cppm:644
Definition expressions.cppm:183
The universal set over the carrier T: the terminal object ⊤ of Sub(T), the reified type constraint.
Definition boundaries.cppm:296

◆ PdaggerMat

auto dedekind::linear_algebra::detail_transfer::PdaggerMat
inlineconstexpr
Initial value:
=
constexpr auto converse(const R &r)
converse(R) — the transpose of a relation (Tarski's ).
Definition dyadic.cppm:344
constexpr SquareMatrix< S, N > ext(const Rel &rel)
THE JOINT: materialise a binary endorelation on a semiring into its dense extensional adjacency Squar...
Definition transfer.cppm:476

◆ perm_rel

auto dedekind::linear_algebra::detail_transfer::perm_rel
inlineconstexpr

◆ qDa

diagonal_product_rule<QuadDiagRule, Ket<unsigned, 2> > dedekind::linear_algebra::detail_transfer::qDa
inlineconstexpr
Initial value:
{
qD.rule, qa}