Struct GraphNode 

pub struct GraphNode {
    pub entity: String,
    pub values: Record,
    pub relations: BTreeMap<String, Vec<GraphNode>>,
    pub operation: GraphOperation,
}

Fields

entity: String

values: Record

relations: BTreeMap<String, Vec<GraphNode>>

operation: GraphOperation

Implementations

impl GraphNode

pub fn new(entity: impl Into<String>) -> Self

pub fn operation(self, operation: GraphOperation) -> Self

pub fn reference(self) -> Self

pub fn remove(self) -> Self

pub fn value(self, field: impl Into<String>, value: impl Into<Value>) -> Self

pub fn relation(self, name: impl Into<String>, node: GraphNode) -> Self

pub fn relations( self, name: impl Into<String>, nodes: impl IntoIterator<Item = GraphNode>, ) -> Self

pub fn id(&self) -> Option<&Value>

Trait Implementations

impl Clone for GraphNode

fn clone(&self) -> GraphNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphNode

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

Formats the value using the given formatter.

impl PartialEq for GraphNode

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