pub struct GraphSelection { /* private fields */ }Expand description
Typed inputs used to construct the one graph-loading read batch.
Implementations§
Source§impl GraphSelection
impl GraphSelection
Sourcepub fn new(
node_traversal: Traversal<OnNodes, ReadOnly>,
edge_traversal: Traversal<OnEdges, ReadOnly>,
direction: GraphDirection,
) -> Self
pub fn new( node_traversal: Traversal<OnNodes, ReadOnly>, edge_traversal: Traversal<OnEdges, ReadOnly>, direction: GraphDirection, ) -> Self
Construct a filtered selection from node- and edge-producing read traversals.
Sourcepub fn allow_full_scan(self) -> Self
pub fn allow_full_scan(self) -> Self
Explicitly permit unfiltered node and edge traversals.
Sourcepub fn with_node_properties(
self,
properties: impl IntoIterator<Item = impl Into<String>>,
) -> Result<Self, GraphSelectionError>
pub fn with_node_properties( self, properties: impl IntoIterator<Item = impl Into<String>>, ) -> Result<Self, GraphSelectionError>
Select node properties retained by the graph.
Sourcepub fn with_edge_properties(
self,
properties: impl IntoIterator<Item = impl Into<String>>,
) -> Result<Self, GraphSelectionError>
pub fn with_edge_properties( self, properties: impl IntoIterator<Item = impl Into<String>>, ) -> Result<Self, GraphSelectionError>
Select edge properties retained by the graph.
Sourcepub fn with_external_identity(
self,
property: impl Into<String>,
) -> Result<Self, GraphSelectionError>
pub fn with_external_identity( self, property: impl Into<String>, ) -> Result<Self, GraphSelectionError>
Use a selected node property as the public graph node identity.
Sourcepub fn with_graphify_edge_key(
self,
property: impl Into<String>,
) -> Result<Self, GraphSelectionError>
pub fn with_graphify_edge_key( self, property: impl Into<String>, ) -> Result<Self, GraphSelectionError>
Preserve a Graphify multigraph key separately from the Helix edge ID.
Sourcepub fn with_weight(
self,
property: impl Into<String>,
) -> Result<Self, GraphSelectionError>
pub fn with_weight( self, property: impl Into<String>, ) -> Result<Self, GraphSelectionError>
Select the non-negative finite numeric edge weight used by weighted algorithms.
Sourcepub fn with_node_limit(self, limit: NonZeroUsize) -> Self
pub fn with_node_limit(self, limit: NonZeroUsize) -> Self
Reject selections returning more than limit nodes.
Sourcepub fn with_edge_limit(self, limit: NonZeroUsize) -> Self
pub fn with_edge_limit(self, limit: NonZeroUsize) -> Self
Reject selections returning more than limit edges.
Sourcepub const fn direction(&self) -> GraphDirection
pub const fn direction(&self) -> GraphDirection
Direction semantics of the constructed graph.
Sourcepub const fn scan_policy(&self) -> GraphScanPolicy
pub const fn scan_policy(&self) -> GraphScanPolicy
Full-scan policy chosen by the caller.
Sourcepub fn to_query_request(&self) -> QueryRequest
pub fn to_query_request(&self) -> QueryRequest
Build the ordinary read request used by Client::graph.
Trait Implementations§
Source§impl Clone for GraphSelection
impl Clone for GraphSelection
Source§fn clone(&self) -> GraphSelection
fn clone(&self) -> GraphSelection
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for GraphSelection
impl Debug for GraphSelection
Source§impl PartialEq for GraphSelection
impl PartialEq for GraphSelection
impl StructuralPartialEq for GraphSelection
Auto Trait Implementations§
impl Freeze for GraphSelection
impl RefUnwindSafe for GraphSelection
impl Send for GraphSelection
impl Sync for GraphSelection
impl Unpin for GraphSelection
impl UnsafeUnpin for GraphSelection
impl UnwindSafe for GraphSelection
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more