Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::CA::ContextualRuleLike Concept Reference

Context-aware local transition function (Phase 8). More...

#include <tpl_ca_concepts.H>

Concept definition

template<typename R, typename L>
and requires(const R &r, const typename L::state_type &s,
const Cell_Context<L::rank> &ctx) {
{ r(s, v, ctx) } -> std::convertible_to<typename L::state_type>;
}
Context-aware local transition function (Phase 8).
Storage + topology that carries the cell values.
size_t blossom_maximum_cardinality_matching(const GT &g, DynDlist< typename GT::Arc * > &matching, SA sa=SA())
Alias of compute_maximum_cardinality_general_matching().
Definition Blossom.H:466
@ R
Recovered (and immune).
and
Check uniqueness with explicit hash + equality functors.
gsl_rng * r

Detailed Description

Context-aware local transition function (Phase 8).

A ContextualRuleLike rule consumes an extra Cell_Context<Rank> argument exposing the current step and the cell coordinate. Rules that need to derive a deterministic per-cell pseudo-random number generator (Forest_Fire_Rule, SIR_Rule, Ising_*, Schelling_Rule, ...) implement this signature so the engine can guarantee bit-for-bit reproducibility independently of thread scheduling.

Template Parameters
Rcandidate rule type.
Llattice type.

Definition at line 185 of file tpl_ca_concepts.H.