#include <core_algorithms.h>
◆ direct_state_set
template<typename Context , typename Root >
◆ direct_states
template<typename Context , typename Root >
◆ direct_transitions
template<typename Context , typename Root >
Direct machine surface authored by Context.
◆ initial
template<typename Context , typename Root >
◆ initial_children
template<typename Context , typename Root >
◆ leaf_states
template<typename Context , typename Root >
◆ local_leaf_states
template<typename Context , typename Root >
Leaf states reachable when entering this machine. A composite direct child contributes its own leaves.
◆ nested_states
template<typename Context , typename Root >
Recursively imported structure from nested composite states.
◆ parents
template<typename Context , typename Root >
Parent and initial-child maps inferred from nesting.
◆ states
template<typename Context , typename Root >
Complete state universe. Root is prepended explicitly; duplicates are removed while preserving first-seen order so state IDs remain stable.
◆ transitions
template<typename Context , typename Root >
The effective transition list is the direct list plus every nested transition list. This lets dispatch walk up from a nested leaf and still find transitions authored on ancestor composites.
The documentation for this struct was generated from the following file: