15#ifndef A11_FLOW_SINGLE_ITEM_H_
16#define A11_FLOW_SINGLE_ITEM_H_
22#include <nlohmann/json.hpp>
37 std::string
reason =
"unknown-producer";
42 std::vector<SingleItemFact>
refs;
49 size_t max_work = 200000);
One cooperative deadline and work counter for a compilation request.
Definition limits.h:36
CompilationBudget budget
Definition lsp.cc:289
Definition catalogue.cc:29
bool CheckSingleItemStructure(const graph::FlowGraph &flow)
Validate graph structure independently of transport candidate discovery.
Definition single_item.cc:464
SingleItemAnalysis AnalyseSingleItems(const graph::FlowGraph &flow, CompilationBudget *budget, size_t max_work)
Infer and verify prefix emission bounds, with a bounded optional work quota.
Definition single_item.cc:602
nlohmann::json SingleItemsToJson(const graph::FlowGraph &flow, const SingleItemAnalysis &analysis, bool enabled)
Explain transport decisions without changing the public source plan.
Definition single_item.cc:608
Definition single_item.h:41
std::vector< SingleItemFact > refs
Definition single_item.h:42
bool complete
Definition single_item.h:43
Evidence for transport selection, independent of declared cardinality.
Definition single_item.h:29
bool direct_transfer
Definition single_item.h:35
std::optional< int > upper
Definition single_item.h:30
bool eligible
Definition single_item.h:33
bool pump_free
Definition single_item.h:34
bool literal
Definition single_item.h:32
bool exactly_one_on_success
Definition single_item.h:31
std::vector< graph::StepId > writers
Definition single_item.h:36
std::string reason
Definition single_item.h:37
std::string pump_reason
Definition single_item.h:38
The executable graph of one flow.
Definition graph.h:394