pub struct EvalPathFromNode<'graph, 'a: 'graph, G: GraphViewOps<'graph>, GH: GraphViewOps<'graph>, CS: ComputeState, S> {
pub graph: GH,
/* private fields */
}Fields§
§graph: GHImplementations§
Source§impl<'graph, 'a: 'graph, G: GraphViewOps<'graph>, S, CS: ComputeState + 'a, GH: GraphViewOps<'graph>> EvalPathFromNode<'graph, 'a, G, GH, CS, S>
impl<'graph, 'a: 'graph, G: GraphViewOps<'graph>, S, CS: ComputeState + 'a, GH: GraphViewOps<'graph>> EvalPathFromNode<'graph, 'a, G, GH, CS, S>
pub fn iter( &self, ) -> impl Iterator<Item = EvalNodeView<'graph, 'a, G, S, GH, CS>> + 'graph
pub fn type_filter(&self, node_types: &[impl AsRef<str>]) -> Self
Trait Implementations§
Source§impl<'graph, 'a: 'graph, G: GraphViewOps<'graph>, S, CS: ComputeState + 'a, GH: GraphViewOps<'graph>> Clone for EvalPathFromNode<'graph, 'a, G, GH, CS, S>
impl<'graph, 'a: 'graph, G: GraphViewOps<'graph>, S, CS: ComputeState + 'a, GH: GraphViewOps<'graph>> Clone for EvalPathFromNode<'graph, 'a, G, GH, CS, S>
Source§impl<'graph, 'a: 'graph, G: GraphViewOps<'graph>, S, CS: ComputeState + 'a, GH: GraphViewOps<'graph>> IntoIterator for EvalPathFromNode<'graph, 'a, G, GH, CS, S>
impl<'graph, 'a: 'graph, G: GraphViewOps<'graph>, S, CS: ComputeState + 'a, GH: GraphViewOps<'graph>> IntoIterator for EvalPathFromNode<'graph, 'a, G, GH, CS, S>
Source§type Item = EvalNodeView<'graph, 'a, G, S, GH, CS>
type Item = EvalNodeView<'graph, 'a, G, S, GH, CS>
The type of the elements being iterated over.
Source§type IntoIter = Box<dyn Iterator<Item = <EvalPathFromNode<'graph, 'a, G, GH, CS, S> as IntoIterator>::Item> + 'graph>
type IntoIter = Box<dyn Iterator<Item = <EvalPathFromNode<'graph, 'a, G, GH, CS, S> as IntoIterator>::Item> + 'graph>
Which kind of iterator are we turning this into?
Source§impl<'graph, 'a: 'graph, G: GraphViewOps<'graph>, S, CS: ComputeState + 'a, GH: GraphViewOps<'graph>> OneHopFilter<'graph> for EvalPathFromNode<'graph, 'a, G, GH, CS, S>
impl<'graph, 'a: 'graph, G: GraphViewOps<'graph>, S, CS: ComputeState + 'a, GH: GraphViewOps<'graph>> OneHopFilter<'graph> for EvalPathFromNode<'graph, 'a, G, GH, CS, S>
type BaseGraph = &'graph G
type FilteredGraph = GH
type Filtered<GHH: GraphViewOps<'graph>> = EvalPathFromNode<'graph, 'a, G, GHH, CS, S>
fn current_filter(&self) -> &Self::FilteredGraph
fn base_graph(&self) -> &Self::BaseGraph
fn one_hop_filtered<GHH: GraphViewOps<'graph>>( &self, filtered_graph: GHH, ) -> Self::Filtered<GHH>
Auto Trait Implementations§
impl<'graph, 'a, G, GH, CS, S> Freeze for EvalPathFromNode<'graph, 'a, G, GH, CS, S>where
GH: Freeze,
impl<'graph, 'a, G, GH, CS, S> !RefUnwindSafe for EvalPathFromNode<'graph, 'a, G, GH, CS, S>
impl<'graph, 'a, G, GH, CS, S> !Send for EvalPathFromNode<'graph, 'a, G, GH, CS, S>
impl<'graph, 'a, G, GH, CS, S> !Sync for EvalPathFromNode<'graph, 'a, G, GH, CS, S>
impl<'graph, 'a, G, GH, CS, S> Unpin for EvalPathFromNode<'graph, 'a, G, GH, CS, S>where
GH: Unpin,
impl<'graph, 'a, G, GH, CS, S> !UnwindSafe for EvalPathFromNode<'graph, 'a, G, GH, CS, S>
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoDynHop for T
impl<T> IntoDynHop for T
fn into_dyn_hop(self) -> <T as OneHopFilter<'static>>::Filtered<DynamicGraph>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<'graph, V> LayerOps<'graph> for Vwhere
V: OneHopFilter<'graph> + 'graph,
impl<'graph, V> LayerOps<'graph> for Vwhere
V: OneHopFilter<'graph> + 'graph,
type LayeredViewType = <V as OneHopFilter<'graph>>::Filtered<LayeredGraph<<V as OneHopFilter<'graph>>::FilteredGraph>>
Source§fn default_layer(&self) -> <V as LayerOps<'graph>>::LayeredViewType
fn default_layer(&self) -> <V as LayerOps<'graph>>::LayeredViewType
Return a graph containing only the default edge layer
Source§fn layers<L>(
&self,
layers: L,
) -> Result<<V as LayerOps<'graph>>::LayeredViewType, GraphError>
fn layers<L>( &self, layers: L, ) -> Result<<V as LayerOps<'graph>>::LayeredViewType, GraphError>
Return a graph containing the layers in
names. Errors if one or more of the layers do not exists.Source§fn exclude_layers<L>(
&self,
layers: L,
) -> Result<<V as LayerOps<'graph>>::LayeredViewType, GraphError>
fn exclude_layers<L>( &self, layers: L, ) -> Result<<V as LayerOps<'graph>>::LayeredViewType, GraphError>
Return a graph containing the excluded layers in
names. Errors if one or more of the layers do not exists.fn exclude_valid_layers<L>( &self, layers: L, ) -> <V as LayerOps<'graph>>::LayeredViewType
Source§fn valid_layers<L>(&self, names: L) -> <V as LayerOps<'graph>>::LayeredViewType
fn valid_layers<L>(&self, names: L) -> <V as LayerOps<'graph>>::LayeredViewType
Return a graph containing the layers in
names. Any layers that do not exist are ignored.Source§impl<'graph, V> NodeViewOps<'graph> for Vwhere
V: BaseNodeViewOps<'graph> + 'graph,
impl<'graph, V> NodeViewOps<'graph> for Vwhere
V: BaseNodeViewOps<'graph> + 'graph,
type BaseGraph = <V as BaseNodeViewOps<'graph>>::BaseGraph
type Graph = <V as BaseNodeViewOps<'graph>>::Graph
type ValueType<T: NodeOp + 'graph> = <V as BaseNodeViewOps<'graph>>::ValueType<T> where <T as NodeOp>::Output: 'graph
type PathType = <V as BaseNodeViewOps<'graph>>::PathType
type Edges = <V as BaseNodeViewOps<'graph>>::Edges
Source§fn id(&self) -> <V as NodeViewOps<'graph>>::ValueType<Id>
fn id(&self) -> <V as NodeViewOps<'graph>>::ValueType<Id>
Get the numeric id of the node
Source§fn name(&self) -> <V as NodeViewOps<'graph>>::ValueType<Name>
fn name(&self) -> <V as NodeViewOps<'graph>>::ValueType<Name>
Get the name of this node if a user has set one otherwise it returns the ID. Read more
Source§fn node_type(&self) -> <V as NodeViewOps<'graph>>::ValueType<Type>
fn node_type(&self) -> <V as NodeViewOps<'graph>>::ValueType<Type>
Returns the type of node
fn node_type_id(&self) -> <V as NodeViewOps<'graph>>::ValueType<TypeId>
Source§fn earliest_time(
&self,
) -> <V as NodeViewOps<'graph>>::ValueType<EarliestTime<<V as NodeViewOps<'graph>>::Graph>>
fn earliest_time( &self, ) -> <V as NodeViewOps<'graph>>::ValueType<EarliestTime<<V as NodeViewOps<'graph>>::Graph>>
Get the timestamp for the earliest activity of the node
fn earliest_date_time( &self, ) -> <V as NodeViewOps<'graph>>::ValueType<Map<EarliestTime<<V as NodeViewOps<'graph>>::Graph>, Option<DateTime<Utc>>>>
Source§fn latest_time(
&self,
) -> <V as NodeViewOps<'graph>>::ValueType<LatestTime<<V as NodeViewOps<'graph>>::Graph>>
fn latest_time( &self, ) -> <V as NodeViewOps<'graph>>::ValueType<LatestTime<<V as NodeViewOps<'graph>>::Graph>>
Get the timestamp for the latest activity of the node
fn latest_date_time( &self, ) -> <V as NodeViewOps<'graph>>::ValueType<Map<LatestTime<<V as NodeViewOps<'graph>>::Graph>, Option<DateTime<Utc>>>>
Source§fn history(
&self,
) -> <V as NodeViewOps<'graph>>::ValueType<History<<V as NodeViewOps<'graph>>::Graph>>
fn history( &self, ) -> <V as NodeViewOps<'graph>>::ValueType<History<<V as NodeViewOps<'graph>>::Graph>>
Gets the history of the node (time that the node was added and times when changes were made to the node)
Source§fn history_date_time(
&self,
) -> <V as NodeViewOps<'graph>>::ValueType<Map<History<<V as NodeViewOps<'graph>>::Graph>, Option<Vec<DateTime<Utc>>>>>
fn history_date_time( &self, ) -> <V as NodeViewOps<'graph>>::ValueType<Map<History<<V as NodeViewOps<'graph>>::Graph>, Option<Vec<DateTime<Utc>>>>>
Gets the history of the node (time that the node was added and times when changes were made to the node) as
DateTime<Utc> objects if parseablefn is_active( &self, ) -> <V as NodeViewOps<'graph>>::ValueType<Map<History<<V as NodeViewOps<'graph>>::Graph>, bool>>
Source§fn properties(
&self,
) -> <V as NodeViewOps<'graph>>::ValueType<GetProperties<<V as NodeViewOps<'graph>>::Graph>>
fn properties( &self, ) -> <V as NodeViewOps<'graph>>::ValueType<GetProperties<<V as NodeViewOps<'graph>>::Graph>>
Get a view of the temporal properties of this node. Read more
Source§fn degree(
&self,
) -> <V as NodeViewOps<'graph>>::ValueType<Degree<<V as NodeViewOps<'graph>>::Graph>>
fn degree( &self, ) -> <V as NodeViewOps<'graph>>::ValueType<Degree<<V as NodeViewOps<'graph>>::Graph>>
Get the degree of this node (i.e., the number of edges that are incident to it). Read more
Source§fn in_degree(
&self,
) -> <V as NodeViewOps<'graph>>::ValueType<Degree<<V as NodeViewOps<'graph>>::Graph>>
fn in_degree( &self, ) -> <V as NodeViewOps<'graph>>::ValueType<Degree<<V as NodeViewOps<'graph>>::Graph>>
Get the in-degree of this node (i.e., the number of edges that point into it). Read more
Source§fn out_degree(
&self,
) -> <V as NodeViewOps<'graph>>::ValueType<Degree<<V as NodeViewOps<'graph>>::Graph>>
fn out_degree( &self, ) -> <V as NodeViewOps<'graph>>::ValueType<Degree<<V as NodeViewOps<'graph>>::Graph>>
Get the out-degree of this node (i.e., the number of edges that point out of it). Read more
Source§fn edges(&self) -> <V as NodeViewOps<'graph>>::Edges
fn edges(&self) -> <V as NodeViewOps<'graph>>::Edges
Get the edges that are incident to this node. Read more
Source§fn in_edges(&self) -> <V as NodeViewOps<'graph>>::Edges
fn in_edges(&self) -> <V as NodeViewOps<'graph>>::Edges
Get the edges that point into this node. Read more
Source§fn out_edges(&self) -> <V as NodeViewOps<'graph>>::Edges
fn out_edges(&self) -> <V as NodeViewOps<'graph>>::Edges
Get the edges that point out of this node. Read more
Source§fn neighbours(&self) -> <V as NodeViewOps<'graph>>::PathType
fn neighbours(&self) -> <V as NodeViewOps<'graph>>::PathType
Get the neighbours of this node. Read more
Source§fn in_neighbours(&self) -> <V as NodeViewOps<'graph>>::PathType
fn in_neighbours(&self) -> <V as NodeViewOps<'graph>>::PathType
Get the neighbours of this node that point into this node. Read more
Source§fn out_neighbours(&self) -> <V as NodeViewOps<'graph>>::PathType
fn out_neighbours(&self) -> <V as NodeViewOps<'graph>>::PathType
Get the neighbours of this node that point out of this node. Read more
Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<'graph, V> ResetFilter<'graph> for Vwhere
V: BaseNodeViewOps<'graph> + OneHopFilter<'graph>,
impl<'graph, V> ResetFilter<'graph> for Vwhere
V: BaseNodeViewOps<'graph> + OneHopFilter<'graph>,
fn reset_filter(&self) -> Self::Filtered<Self::BaseGraph>
Source§impl<'graph, V> TimeOps<'graph> for Vwhere
V: OneHopFilter<'graph> + 'graph + InternalTimeOps<'graph>,
impl<'graph, V> TimeOps<'graph> for Vwhere
V: OneHopFilter<'graph> + 'graph + InternalTimeOps<'graph>,
type WindowedViewType = <V as InternalTimeOps<'graph>>::InternalWindowedView
Source§fn start(&self) -> Option<i64>
fn start(&self) -> Option<i64>
Return the timestamp of the start of the view or None if the view start is unbounded.
Source§fn end(&self) -> Option<i64>
fn end(&self) -> Option<i64>
Return the timestamp of the view or None if the view end is unbounded.
fn start_date_time(&self) -> Option<DateTime<Utc>>
fn end_date_time(&self) -> Option<DateTime<Utc>>
Source§fn shrink_start<T>(&self, start: T) -> <V as TimeOps<'graph>>::WindowedViewTypewhere
T: IntoTime,
fn shrink_start<T>(&self, start: T) -> <V as TimeOps<'graph>>::WindowedViewTypewhere
T: IntoTime,
set the start of the window to the larger of
start and self.start()Source§fn shrink_end<T>(&self, end: T) -> <V as TimeOps<'graph>>::WindowedViewTypewhere
T: IntoTime,
fn shrink_end<T>(&self, end: T) -> <V as TimeOps<'graph>>::WindowedViewTypewhere
T: IntoTime,
set the end of the window to the smaller of
end and self.end()Source§fn shrink_window<T>(
&self,
start: T,
end: T,
) -> <V as TimeOps<'graph>>::WindowedViewTypewhere
T: IntoTime,
fn shrink_window<T>(
&self,
start: T,
end: T,
) -> <V as TimeOps<'graph>>::WindowedViewTypewhere
T: IntoTime,
shrink both the start and end of the window (same as calling
shrink_start followed by shrink_end but more efficient)Source§fn window_size(&self) -> Option<u64>
fn window_size(&self) -> Option<u64>
Return the size of the window covered by this view or None if the window is unbounded
Source§fn window<T1, T2>(
&self,
start: T1,
end: T2,
) -> <V as TimeOps<'graph>>::WindowedViewType
fn window<T1, T2>( &self, start: T1, end: T2, ) -> <V as TimeOps<'graph>>::WindowedViewType
Create a view including all events between
start (inclusive) and end (exclusive)Source§fn at<T>(&self, time: T) -> <V as TimeOps<'graph>>::WindowedViewTypewhere
T: IntoTime,
fn at<T>(&self, time: T) -> <V as TimeOps<'graph>>::WindowedViewTypewhere
T: IntoTime,
Create a view that only includes events at
timeSource§fn latest(&self) -> <V as TimeOps<'graph>>::WindowedViewType
fn latest(&self) -> <V as TimeOps<'graph>>::WindowedViewType
Create a view that only includes events at the latest time
Source§fn snapshot_at<T>(&self, time: T) -> <V as TimeOps<'graph>>::WindowedViewTypewhere
T: IntoTime,
fn snapshot_at<T>(&self, time: T) -> <V as TimeOps<'graph>>::WindowedViewTypewhere
T: IntoTime,
Create a view including all events that have not been explicitly deleted at
time Read moreSource§fn snapshot_latest(&self) -> <V as TimeOps<'graph>>::WindowedViewType
fn snapshot_latest(&self) -> <V as TimeOps<'graph>>::WindowedViewType
Create a view including all events that have not been explicitly deleted at the latest time Read more
Source§fn after<T>(&self, start: T) -> <V as TimeOps<'graph>>::WindowedViewTypewhere
T: IntoTime,
fn after<T>(&self, start: T) -> <V as TimeOps<'graph>>::WindowedViewTypewhere
T: IntoTime,
Create a view that only includes events after
start (exclusive)Source§fn before<T>(&self, end: T) -> <V as TimeOps<'graph>>::WindowedViewTypewhere
T: IntoTime,
fn before<T>(&self, end: T) -> <V as TimeOps<'graph>>::WindowedViewTypewhere
T: IntoTime,
Create a view that only includes events before
end (exclusive)Source§fn expanding<I>(&self, step: I) -> Result<WindowSet<'graph, V>, ParseTimeError>
fn expanding<I>(&self, step: I) -> Result<WindowSet<'graph, V>, ParseTimeError>
Creates a
WindowSet with the given step size
using an expanding window. The last window may fall partially outside the range of the data/view. Read more