Struct LayoutResult 

pub struct LayoutResult {
    pub nodes: Vec<LayoutNodePosition>,
    pub edge_routes: Vec<LayoutEdgeRoute>,
    pub bounds: Option<CanvasRect>,
}

Result of a headless layout run.

Fields

nodes: Vec<LayoutNodePosition>

Engine-produced results contain at most one entry per node. If a caller manually constructs a result with duplicates, lookup returns the first entry and transaction conversion fails.

edge_routes: Vec<LayoutEdgeRoute>

bounds: Option<CanvasRect>

Implementations

impl LayoutResult

pub fn node_position(&self, node: NodeId) -> Option<LayoutNodePosition>

Finds one node position in this result.

pub fn to_transaction( &self, graph: &Graph, ) -> Result<GraphTransaction, LayoutError>

Converts node position changes into a Jellyflow transaction.

Trait Implementations

impl Clone for LayoutResult

fn clone(&self) -> LayoutResult

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LayoutResult

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for LayoutResult

fn deserialize<__D>( __deserializer: __D, ) -> Result<LayoutResult, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for LayoutResult

fn eq(&self, other: &LayoutResult) -> 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 LayoutResult

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for LayoutResult