Struct Traversal 

pub struct Traversal {
    pub start: Start,
    pub steps: Vec<Step>,
    pub limit: Option<u32>,
}

Fields

start: Start

steps: Vec<Step>

limit: Option<u32>

Implementations

impl Traversal

pub fn from_node(id: impl Into<NodeId>) -> Traversal

pub fn out(self, edge: impl Into<Label>) -> Traversal

pub fn in_(self, edge: impl Into<Label>) -> Traversal

pub fn both(self, edge: impl Into<Label>) -> Traversal

pub fn to(self, node: impl Into<Label>) -> Traversal

pub fn limit(self, limit: u32) -> Traversal

Trait Implementations

impl Clone for Traversal

fn clone(&self) -> Traversal

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Traversal

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Traversal

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for Traversal

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

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 Traversal