Struct Graph 

pub struct Graph {
    pub nodes: Vec<NodeInstance>,
    pub edges: Vec<Edge>,
    pub metadata: BTreeMap<String, String>,
    pub metadata_values: BTreeMap<String, Value>,
}

Planner input graph (pre-pass).

use daedalus_planner::Graph;
let graph = Graph::default();
assert!(graph.nodes.is_empty());

Fields

nodes: Vec<NodeInstance>

edges: Vec<Edge>

metadata: BTreeMap<String, String>

Arbitrary metadata retained for goldens/debug.

metadata_values: BTreeMap<String, Value>

Graph-level metadata (typed values) that should be visible to nodes at runtime.

This is distinct from metadata (string-only planner debug/golden output). Planner passes may write to metadata; graph authors should write to metadata_values.

Implementations

impl Graph

pub fn gpu_buffers(&self) -> (Vec<GpuSegment>, Vec<EdgeBufferInfo>)

Identify contiguous GPU-to-GPU chains and assign them shared buffer ids, along with edge annotations that mark where GPU fast paths can be used.

use daedalus_planner::{Graph, NodeInstance, ComputeAffinity, Edge, PortRef, NodeRef};
use daedalus_registry::ids::NodeId;

let mut graph = Graph::default();
graph.nodes.push(NodeInstance {
    id: NodeId::new("a"),
    bundle: None,
    label: None,
    inputs: vec![],
    outputs: vec!["out".into()],
    compute: ComputeAffinity::GpuPreferred,
    const_inputs: vec![],
    sync_groups: vec![],
    metadata: Default::default(),
});
graph.nodes.push(NodeInstance {
    id: NodeId::new("b"),
    bundle: None,
    label: None,
    inputs: vec!["in".into()],
    outputs: vec![],
    compute: ComputeAffinity::GpuPreferred,
    const_inputs: vec![],
    sync_groups: vec![],
    metadata: Default::default(),
});
graph.edges.push(Edge {
    from: PortRef { node: NodeRef(0), port: "out".into() },
    to: PortRef { node: NodeRef(1), port: "in".into() },
    metadata: Default::default(),
});
let (segments, edges) = graph.gpu_buffers();
assert_eq!(edges.len(), 1);
assert_eq!(segments.len(), 1);

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Graph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Graph

fn default() -> Graph

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for Graph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for Graph

fn eq(&self, other: &Graph) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for Graph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Graph