NeoGraph 0.16.0
A C++20 Graph Agent Engine Library — LangGraph for C++
Loading...
Searching...
No Matches
neograph::graph::JoinSpec Struct Reference

An AND join whose wait_for slots may each list alternatives (#363). More...

#include <scheduler.h>

Detailed Description

An AND join whose wait_for slots may each list alternatives (#363).

A slot is filled when any of its alternatives signals the join; the join fires when every slot is filled, and then all accumulated signals clear (the same clearing rule as a barrier). Signals from non-members are recorded in BarrierState and never count. Slots are disjoint and kept in canonical order: alternatives sorted by UTF-8 bytes, slots by their smallest source. A spec whose slots are all singletons is a legacy barrier and lives in BarrierSpecs instead, so its bytes never change.

Definition at line 95 of file scheduler.h.


The documentation for this struct was generated from the following file: