Struct EdgeView 

pub struct EdgeView<G> {
    pub graph: G,
    pub edge: EdgeRef,
}

A view of an edge in the graph.

Fields

graph: G

A view of an edge in the graph.

edge: EdgeRef

A reference to the edge.

Implementations

impl<'graph, G: GraphViewOps<'graph>> EdgeView<G>

pub fn new(graph: G, edge: EdgeRef) -> Self

impl<G: Clone> EdgeView<&G>

pub fn cloned(&self) -> EdgeView<G>

impl<G> EdgeView<G>

pub fn as_ref(&self) -> EdgeView<&G>

impl<G: IntoDynamic> EdgeView<G>

pub fn into_dynamic(self) -> EdgeView<DynamicGraph>

impl<G: GraphView> EdgeView<G>

pub fn deletions_hist(&self) -> BoxedLIter<'_, (EventTime, usize)>

impl<G: StaticGraphViewOps + InternalAdditionOps<Error = GraphError> + InternalPropertyAdditionOps<Error = GraphError> + InternalDeletionOps<Error = GraphError>> EdgeView<G>

pub fn delete<T: TryIntoInputTime>( &self, t: T, layer: Option<&str>, ) -> Result<(), GraphError>

impl<G: StaticGraphViewOps + PropertyAdditionOps + AdditionOps> EdgeView<G>

pub fn add_metadata<C: CollectProperties>( &self, properties: C, layer: Option<&str>, ) -> Result<(), GraphError>

Add metadata for the edge

Arguments

• properties - Property key-value pairs to add
• layer - The layer to which properties should be added. If the edge view is restricted to a single layer, ‘None’ will add the properties to that layer and ‘Some(“name”)’ fails unless the layer matches the edge view. If the edge view is not restricted to a single layer, ‘None’ sets the properties on the default layer and ‘Some(“name”)’ sets the properties on layer ‘“name”’ and fails if that layer doesn’t exist.

Returns: Ok(()) if metadata added successfully. Err(GraphError) if the operation fails.

pub fn update_metadata<C: CollectProperties>( &self, props: C, layer: Option<&str>, ) -> Result<(), GraphError>

pub fn add_updates<C: CollectProperties, T: TryIntoInputTime>( &self, time: T, props: C, layer: Option<&str>, ) -> Result<(), GraphError>

Trait Implementations

impl<G: Clone> Clone for EdgeView<G>

fn clone(&self) -> EdgeView<G>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'graph, G: GraphViewOps<'graph>> Debug for EdgeView<G>

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

Formats the value using the given formatter.

impl<G> From<EdgeView<G>> for EdgeRef

fn from(value: EdgeView<G>) -> Self

Converts to this type from the input type.

impl<'graph, G1: GraphViewOps<'graph>> Hash for EdgeView<G1>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<G: BoxableGraphView + Clone> InternalDeletionOps for EdgeView<G>

fn iter(&self) -> BoxedLIter<'_, EventTime>

Iterate over deletion time entries in chronological order.

fn iter_rev(&self) -> BoxedLIter<'_, EventTime>

Iterate over deletion time entries in reverse chronological order.

fn earliest_time(&self) -> Option<EventTime>

Get the earliest deletion’s time entry for this item.

fn latest_time(&self) -> Option<EventTime>

Get the latest deletion’s time entry for this item.

fn first(&self) -> Option<EventTime>

Get the first deletion’s time entry produced by forward iteration.

fn last(&self) -> Option<EventTime>

Get the first deletion’s time entry produced by reverse iteration.

fn len(&self) -> usize

Get the number of deletion time entries held by this item.

impl<'graph, Current> InternalFilter<'graph> for EdgeView<Current>

where Current: GraphViewOps<'graph>,

type Graph = Current

type Filtered<Next: GraphViewOps<'graph>> = EdgeView<Next>

fn base_graph(&self) -> &Self::Graph

fn apply_filter<Next: GraphViewOps<'graph> + 'graph>( &self, filtered_graph: Next, ) -> Self::Filtered<Next>

impl<G: BoxableGraphView + Clone> InternalHistoryOps for EdgeView<G>

fn iter(&self) -> BoxedLIter<'_, EventTime>

Iterate over temporal entries in chronological order.

fn iter_rev(&self) -> BoxedLIter<'_, EventTime>

Iterate over temporal entries in reverse chronological order.

fn earliest_time(&self) -> Option<EventTime>

Get the earliest time entry for this item.

fn latest_time(&self) -> Option<EventTime>

Get the latest time entry for this item.

fn len(&self) -> usize

Get the number of time entries held by this item.

fn first(&self) -> Option<EventTime>

Get the first time entry produced by forward iteration.

fn last(&self) -> Option<EventTime>

Get the first time entry produced by reverse iteration.

impl<'graph, G: GraphViewOps<'graph>> InternalMetadataOps for EdgeView<G>

fn get_metadata_id(&self, name: &str) -> Option<usize>

Find id for property name (note this only checks the meta-data, not if the property actually exists for the entity)

fn get_metadata_name(&self, id: usize) -> ArcStr

fn metadata_ids(&self) -> BoxedLIter<'_, usize>

fn metadata_keys(&self) -> BoxedLIter<'_, ArcStr>

fn get_metadata(&self, id: usize) -> Option<Prop>

fn metadata_values(&self) -> BoxedLIter<'_, Option<Prop>>

impl<'graph, G: GraphViewOps<'graph>> InternalTemporalPropertiesOps for EdgeView<G>

fn get_temporal_prop_id(&self, name: &str) -> Option<usize>

fn get_temporal_prop_name(&self, id: usize) -> ArcStr

fn temporal_prop_ids(&self) -> BoxedLIter<'_, usize>

fn temporal_prop_keys(&self) -> BoxedLIter<'_, ArcStr>

impl<G: GraphView> InternalTemporalPropertyViewOps for EdgeView<G>

fn dtype(&self, id: usize) -> PropType

fn temporal_value(&self, id: usize) -> Option<Prop>

fn temporal_iter(&self, id: usize) -> BoxedLIter<'_, (EventTime, Prop)>

fn temporal_iter_rev(&self, id: usize) -> BoxedLIter<'_, (EventTime, Prop)>

fn temporal_value_at(&self, id: usize, t: EventTime) -> Option<Prop>

fn temporal_history_iter(&self, id: usize) -> BoxedLIter<'_, EventTime>

fn temporal_history_iter_rev(&self, id: usize) -> BoxedLIter<'_, EventTime>

fn temporal_values_iter(&self, id: usize) -> BoxedLIter<'_, Prop>

fn temporal_values_iter_rev(&self, id: usize) -> BoxedLIter<'_, Prop>

impl<G: BoxableGraphView + Clone + 'static> IntoArcDynHistoryOps for EdgeView<G>

fn into_arc_dyn(self) -> Arc<dyn InternalHistoryOps>

Convert this InternalHistoryOps into an Arc to enable dynamic dispatch and sharing (through Send + Sync). Particularly useful for Python.

impl<'graph_1, G1: GraphViewOps<'graph_1>> Ord for EdgeView<G1>

fn cmp(&self, other: &EdgeView<G1>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<'graph_1, 'graph_2, G1: GraphViewOps<'graph_1>, G2: GraphViewOps<'graph_2>> PartialEq<EdgeView<G2>> for EdgeView<G1>

fn eq(&self, other: &EdgeView<G2>) -> 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<'graph_1, 'graph_2, G1: GraphViewOps<'graph_1>, G2: GraphViewOps<'graph_2>> PartialOrd<EdgeView<G2>> for EdgeView<G1>

fn partial_cmp(&self, other: &EdgeView<G2>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<G: Copy> Copy for EdgeView<G>

impl<'graph, G: GraphViewOps<'graph>> Eq for EdgeView<G>

impl<G> Static for EdgeView<G>