pub struct IsActiveGraph<G> { /* private fields */ }Implementations§
Source§impl<'graph, G: GraphViewOps<'graph>> IsActiveGraph<G>
impl<'graph, G: GraphViewOps<'graph>> IsActiveGraph<G>
Trait Implementations§
Source§impl<'graph, G: GraphViewOps<'graph>> Base for IsActiveGraph<G>
impl<'graph, G: GraphViewOps<'graph>> Base for IsActiveGraph<G>
Source§impl<G: Clone> Clone for IsActiveGraph<G>
impl<G: Clone> Clone for IsActiveGraph<G>
Source§fn clone(&self) -> IsActiveGraph<G>
fn clone(&self) -> IsActiveGraph<G>
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl<G: Debug> Debug for IsActiveGraph<G>
impl<G: Debug> Debug for IsActiveGraph<G>
Source§impl<'graph, G: GraphViewOps<'graph>> InternalEdgeLayerFilterOps for IsActiveGraph<G>
impl<'graph, G: GraphViewOps<'graph>> InternalEdgeLayerFilterOps for IsActiveGraph<G>
Source§fn internal_edge_layer_filtered(&self) -> bool
fn internal_edge_layer_filtered(&self) -> bool
Set to true when filtering, used for optimisations
Source§fn internal_layer_filter_edge_list_trusted(&self) -> bool
fn internal_layer_filter_edge_list_trusted(&self) -> bool
If true, all edges removed by this filter have also been removed from the edge list
Source§fn internal_filter_edge_layer(
&self,
edge: EdgeStorageRef<'_>,
layer: usize,
) -> bool
fn internal_filter_edge_layer( &self, edge: EdgeStorageRef<'_>, layer: usize, ) -> bool
Filter a layer for an edge
fn node_filter_includes_edge_layer_filter(&self) -> bool
fn edge_filter_includes_edge_layer_filter(&self) -> bool
fn exploded_edge_filter_includes_edge_layer_filter(&self) -> bool
impl<G: Copy> Copy for IsActiveGraph<G>
impl<G> Immutable for IsActiveGraph<G>
impl<'graph, G: GraphViewOps<'graph>> InheritCoreGraphOps for IsActiveGraph<G>
impl<'graph, G: GraphViewOps<'graph>> InheritEdgeFilterOps for IsActiveGraph<G>
impl<'graph, G: GraphViewOps<'graph>> InheritEdgeHistoryFilter for IsActiveGraph<G>
impl<'graph, G: GraphViewOps<'graph>> InheritExplodedEdgeFilterOps for IsActiveGraph<G>
impl<'graph, G: GraphViewOps<'graph>> InheritLayerOps for IsActiveGraph<G>
impl<'graph, G: GraphViewOps<'graph>> InheritListOps for IsActiveGraph<G>
impl<'graph, G: GraphViewOps<'graph>> InheritMaterialize for IsActiveGraph<G>
impl<'graph, G: GraphViewOps<'graph>> InheritNodeFilterOps for IsActiveGraph<G>
impl<'graph, G: GraphViewOps<'graph>> InheritNodeHistoryFilter for IsActiveGraph<G>
impl<'graph, G: GraphViewOps<'graph>> InheritPropertiesOps for IsActiveGraph<G>
impl<'graph, G: GraphViewOps<'graph>> InheritStorageOps for IsActiveGraph<G>
impl<'graph, G: GraphViewOps<'graph>> InheritTimeSemantics for IsActiveGraph<G>
impl<G> Static for IsActiveGraph<G>
Auto Trait Implementations§
impl<G> Freeze for IsActiveGraph<G>where
G: Freeze,
impl<G> RefUnwindSafe for IsActiveGraph<G>where
G: RefUnwindSafe,
impl<G> Send for IsActiveGraph<G>where
G: Send,
impl<G> Sync for IsActiveGraph<G>where
G: Sync,
impl<G> Unpin for IsActiveGraph<G>where
G: Unpin,
impl<G> UnsafeUnpin for IsActiveGraph<G>where
G: UnsafeUnpin,
impl<G> UnwindSafe for IsActiveGraph<G>where
G: UnwindSafe,
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<G> CoreGraphOps for G
impl<G> CoreGraphOps for G
fn core_graph(&self) -> &GraphStorage
fn id_type(&self) -> Option<GidType>
fn num_shards(&self) -> usize
Source§fn read_event_id(&self) -> usize
fn read_event_id(&self) -> usize
get the current sequence id without incrementing the counter
Source§fn unfiltered_num_nodes(&self) -> usize
fn unfiltered_num_nodes(&self) -> usize
get the number of nodes in the main graph
Source§fn unfiltered_num_edges(&self) -> usize
fn unfiltered_num_edges(&self) -> usize
get the number of edges in the main graph
Source§fn unfiltered_num_layers(&self) -> usize
fn unfiltered_num_layers(&self) -> usize
get the number of layers in the main graph
Source§fn single_layer(&self, layer_ids: &LayerIds) -> Option<usize>
fn single_layer(&self, layer_ids: &LayerIds) -> Option<usize>
Return the id of the single layer if
layer_ids reduces to a graph with a single layer, else Nonefn core_edges(&self) -> EdgesStorage
fn core_edge(&self, eid: EID) -> EdgeStorageEntry<'_>
fn core_nodes(&self) -> NodesStorage
fn core_node(&self, vid: VID) -> NodeStorageEntry<'_>
fn node_meta(&self) -> &Meta
fn edge_meta(&self) -> &Meta
fn graph_meta(&self) -> &GraphMeta
fn get_layer_name(&self, layer_id: usize) -> ArcStr
fn get_layer_id(&self, name: &str) -> Option<usize>
fn get_default_layer_id(&self) -> Option<usize>
Source§fn get_layer_names_from_ids(
&self,
layer_ids: &LayerIds,
) -> Box<dyn Iterator<Item = ArcStr> + Send + Sync>
fn get_layer_names_from_ids( &self, layer_ids: &LayerIds, ) -> Box<dyn Iterator<Item = ArcStr> + Send + Sync>
Get the layer name for a given id
Source§fn get_all_node_types(&self) -> Vec<ArcStr>
fn get_all_node_types(&self) -> Vec<ArcStr>
Get all node types
Source§fn node_type_id(&self, v: VID) -> usize
fn node_type_id(&self, v: VID) -> usize
Returns the type id of a node
Source§fn internalise_node(&self, v: NodeRef<'_>) -> Option<VID>
fn internalise_node(&self, v: NodeRef<'_>) -> Option<VID>
Gets the internal reference for an external node reference and keeps internal references unchanged.
Source§fn internalise_node_unchecked(&self, v: NodeRef<'_>) -> VID
fn internalise_node_unchecked(&self, v: NodeRef<'_>) -> VID
Gets the internal reference for an external node reference and keeps internal references unchanged. Assumes node exists!
Source§fn node_metadata(&self, v: VID, id: usize) -> Option<Prop>
fn node_metadata(&self, v: VID, id: usize) -> Option<Prop>
Gets a static property of a given node given the name and node reference. Read more
Source§impl<G> DelegateTimeSemantics for G
impl<G> DelegateTimeSemantics for G
Source§impl<'graph, T> Filter<'graph> for Twhere
T: InternalFilter<'graph>,
impl<'graph, T> Filter<'graph> for Twhere
T: InternalFilter<'graph>,
fn filter<F: CreateFilter>( &self, filter: F, ) -> Result<Self::Filtered<F::EntityFiltered<'graph, F::FilteredGraph<'graph, Self::Graph>>>, GraphError>
Source§impl<G> FilterOps for Gwhere
G: GraphView,
impl<G> FilterOps for Gwhere
G: GraphView,
fn filter_node(&self, node: NodeStorageRef<'_>) -> bool
fn filter_state(&self) -> FilterState
fn node_and_edge_filters_independent(&self) -> bool
fn filtered(&self) -> bool
fn node_list_trusted(&self) -> bool
fn filter_edge(&self, edge: EdgeStorageRef<'_>) -> bool
fn filter_edge_layer(&self, edge: EdgeStorageRef<'_>, layer: usize) -> bool
fn filter_exploded_edge(&self, eid: ELID, t: EventTime) -> bool
fn edge_list_trusted(&self) -> bool
fn exploded_filter_independent(&self) -> bool
fn filter_edge_from_nodes(&self, edge: EdgeStorageRef<'_>) -> bool
Source§impl<G> GraphTimeSemanticsOps for Gwhere
G: DelegateTimeSemantics + ?Sized,
impl<G> GraphTimeSemanticsOps for Gwhere
G: DelegateTimeSemantics + ?Sized,
fn node_time_semantics(&self) -> TimeSemantics
fn edge_time_semantics(&self) -> TimeSemantics
Source§fn view_start(&self) -> Option<EventTime>
fn view_start(&self) -> Option<EventTime>
Returns the start of the current view or
None if unboundedSource§fn view_end(&self) -> Option<EventTime>
fn view_end(&self) -> Option<EventTime>
Returns the end of the current view or
None if unboundedSource§fn earliest_time_global(&self) -> Option<i64>
fn earliest_time_global(&self) -> Option<i64>
Returns the timestamp for the earliest activity
Source§fn latest_time_global(&self) -> Option<i64>
fn latest_time_global(&self) -> Option<i64>
Returns the timestamp for the latest activity
Source§fn earliest_time_window(&self, start: EventTime, end: EventTime) -> Option<i64>
fn earliest_time_window(&self, start: EventTime, end: EventTime) -> Option<i64>
Returns the timestamp for the earliest activity in the window
Source§fn latest_time_window(&self, start: EventTime, end: EventTime) -> Option<i64>
fn latest_time_window(&self, start: EventTime, end: EventTime) -> Option<i64>
Returns the timestamp for the latest activity in the window
Source§fn has_temporal_prop(&self, prop_id: usize) -> bool
fn has_temporal_prop(&self, prop_id: usize) -> bool
Check if graph has temporal property with the given id Read more
Source§fn temporal_prop_iter(
&self,
prop_id: usize,
) -> Box<dyn DoubleEndedIterator<Item = (EventTime, Prop)> + Send + Sync + '_>
fn temporal_prop_iter( &self, prop_id: usize, ) -> Box<dyn DoubleEndedIterator<Item = (EventTime, Prop)> + Send + Sync + '_>
Returns an Iterator of all temporal values of the graph property with the given id Read more
Source§fn has_temporal_prop_window(&self, prop_id: usize, w: Range<EventTime>) -> bool
fn has_temporal_prop_window(&self, prop_id: usize, w: Range<EventTime>) -> bool
Check if graph has temporal property with the given id in the window Read more
Source§fn temporal_prop_iter_window(
&self,
prop_id: usize,
start: EventTime,
end: EventTime,
) -> Box<dyn DoubleEndedIterator<Item = (EventTime, Prop)> + Send + Sync + '_>
fn temporal_prop_iter_window( &self, prop_id: usize, start: EventTime, end: EventTime, ) -> Box<dyn DoubleEndedIterator<Item = (EventTime, Prop)> + Send + Sync + '_>
Returns all temporal values of the graph property with the given name
that fall within the specified time window. Read more
Source§fn temporal_prop_last_at(
&self,
prop_id: usize,
t: EventTime,
) -> Option<(EventTime, Prop)>
fn temporal_prop_last_at( &self, prop_id: usize, t: EventTime, ) -> Option<(EventTime, Prop)>
Returns the value and update time for the temporal graph property at or before a given timestamp
fn temporal_prop_last_at_window( &self, prop_id: usize, t: EventTime, w: Range<EventTime>, ) -> Option<(EventTime, Prop)>
Source§impl<'graph, G> GraphViewOps<'graph> for Gwhere
G: GraphView + 'graph,
impl<'graph, G> GraphViewOps<'graph> for Gwhere
G: GraphView + 'graph,
Source§fn unique_layers(&self) -> Box<dyn Iterator<Item = ArcStr> + Send + Sync>
fn unique_layers(&self) -> Box<dyn Iterator<Item = ArcStr> + Send + Sync>
Return all the layer ids in the graph
Source§fn earliest_time(&self) -> Option<EventTime>
fn earliest_time(&self) -> Option<EventTime>
Get the EventTime of the earliest activity in the graph.
Source§fn latest_time(&self) -> Option<EventTime>
fn latest_time(&self) -> Option<EventTime>
Get the EventTime of the latest activity in the graph.
Source§fn edges_unlocked(&self) -> Edges<'graph, G>
fn edges_unlocked(&self) -> Edges<'graph, G>
Return an unlocked iterator over all edges in the graph.
Source§fn materialize(&self) -> Result<MaterializedGraph, GraphError>
fn materialize(&self) -> Result<MaterializedGraph, GraphError>
Get a graph clone Read more
fn subgraph<I, V>(&self, nodes: I) -> NodeSubgraph<G>where
I: IntoIterator<Item = V>,
V: AsNodeRef,
fn cache_view(&self) -> CachedView<G>
fn valid(&self) -> ValidGraph<G>
fn subgraph_node_types<I, V>( &self, node_types: I, ) -> NodeFilteredGraph<G, Mask<TypeId>>
fn exclude_nodes<I, V>(&self, nodes: I) -> NodeSubgraph<G>where
I: IntoIterator<Item = V>,
V: AsNodeRef,
Source§fn count_nodes(&self) -> usize
fn count_nodes(&self) -> usize
Return the number of nodes in the graph.
Source§fn count_edges(&self) -> usize
fn count_edges(&self) -> usize
Return the number of edges in the graph.
fn count_temporal_edges(&self) -> usize
Source§fn has_edge<T>(&self, src: T, dst: T) -> boolwhere
T: AsNodeRef,
fn has_edge<T>(&self, src: T, dst: T) -> boolwhere
T: AsNodeRef,
Check if the graph contains an edge given a pair of nodes
(src, dst).Source§fn edge<T>(&self, src: T, dst: T) -> Option<EdgeView<G>>where
T: AsNodeRef,
fn edge<T>(&self, src: T, dst: T) -> Option<EdgeView<G>>where
T: AsNodeRef,
Get an edge
(src, dst).Source§fn properties(&self) -> Properties<G>
fn properties(&self) -> Properties<G>
Get all property values of this graph. Read more
Source§impl<G> InnerFilterOps for Gwhere
G: GraphView,
impl<G> InnerFilterOps for Gwhere
G: GraphView,
fn filter_node_inner(&self, node: NodeStorageRef<'_>) -> bool
fn filtered_inner(&self) -> bool
fn filter_edge_inner(&self, edge: EdgeStorageRef<'_>) -> bool
Source§fn filter_edge_layer_inner(
&self,
edge: EdgeStorageRef<'_>,
layer: usize,
) -> bool
fn filter_edge_layer_inner( &self, edge: EdgeStorageRef<'_>, layer: usize, ) -> bool
handles edge and edge layer filter (not exploded edge filter or windows)
fn filter_exploded_edge_inner(&self, eid: ELID, t: EventTime) -> bool
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<G> InternalEdgeFilterOps for G
impl<G> InternalEdgeFilterOps for G
Source§fn internal_edge_filtered(&self) -> bool
fn internal_edge_filtered(&self) -> bool
If true, the edges from the underlying storage are filtered
Source§fn internal_edge_list_trusted(&self) -> bool
fn internal_edge_list_trusted(&self) -> bool
If true, all edges returned by
self.edge_list() exist, otherwise it needs further filteringfn internal_filter_edge( &self, edge: EdgeStorageRef<'_>, layer_ids: &LayerIds, ) -> bool
fn node_filter_includes_edge_filter(&self) -> bool
Source§fn exploded_edge_filter_includes_edge_filter(&self) -> bool
fn exploded_edge_filter_includes_edge_filter(&self) -> bool
Set this to true if the exploded filter already implements the edge filter to avoid unnecessary checks
Source§fn edge_layer_filter_includes_edge_filter(&self) -> bool
fn edge_layer_filter_includes_edge_filter(&self) -> bool
Set this to true if the edge layer filter already implements the edge filter to avoid unnecessary checks
Source§impl<G> InternalExplodedEdgeFilterOps for G
impl<G> InternalExplodedEdgeFilterOps for G
Source§fn internal_exploded_edge_filtered(&self) -> bool
fn internal_exploded_edge_filtered(&self) -> bool
Set to true when filtering, used for optimisations
Source§fn internal_exploded_filter_edge_list_trusted(&self) -> bool
fn internal_exploded_filter_edge_list_trusted(&self) -> bool
If true, all edges removed by this filter have also been removed from the edge list
fn internal_filter_exploded_edge( &self, eid: ELID, t: EventTime, layer_ids: &LayerIds, ) -> bool
fn node_filter_includes_exploded_edge_filter(&self) -> bool
fn edge_filter_includes_exploded_edge_filter(&self) -> bool
fn edge_layer_filter_includes_exploded_edge_filter(&self) -> bool
Source§impl<'graph, G> InternalFilter<'graph> for Gwhere
G: GraphView + 'graph,
impl<'graph, G> InternalFilter<'graph> for Gwhere
G: GraphView + 'graph,
type Graph = G
type Filtered<Next: GraphViewOps<'graph> + 'graph> = Next
fn base_graph(&self) -> &<G as InternalFilter<'graph>>::Graph
fn apply_filter<Next>(
&self,
filtered_graph: Next,
) -> <G as InternalFilter<'graph>>::Filtered<Next>where
Next: GraphViewOps<'graph> + 'graph,
Source§impl<G> InternalLayerOps for G
impl<G> InternalLayerOps for G
Source§fn layer_ids_from_names(&self, key: Layer) -> Result<LayerIds, InvalidLayer>
fn layer_ids_from_names(&self, key: Layer) -> Result<LayerIds, InvalidLayer>
Get the layer id for the given layer name
Source§fn valid_layer_ids_from_names(&self, key: Layer) -> LayerIds
fn valid_layer_ids_from_names(&self, key: Layer) -> LayerIds
Get the valid layer ids for given layer names
Source§impl<G> InternalMaterialize for G
impl<G> InternalMaterialize for G
fn new_base_graph(&self, graph: GraphStorage) -> MaterializedGraph
fn graph_type(&self) -> GraphType
Source§impl<P> InternalMetadataOps for P
impl<P> InternalMetadataOps for P
Source§fn get_metadata_id(&self, name: &str) -> Option<usize>
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) -> Box<dyn Iterator<Item = usize> + Send + Sync + '_>
fn metadata_keys(&self) -> Box<dyn Iterator<Item = ArcStr> + Send + Sync + '_>
fn metadata_values( &self, ) -> Box<dyn Iterator<Item = Option<Prop>> + Send + Sync + '_>
fn get_metadata(&self, id: usize) -> Option<Prop>
Source§impl<G> InternalNodeFilterOps for G
impl<G> InternalNodeFilterOps for G
Source§fn internal_nodes_filtered(&self) -> bool
fn internal_nodes_filtered(&self) -> bool
Check if GraphView filters nodes (i.e., there exists nodes in the underlying graph for which
filter_node returns falseSource§fn internal_node_list_trusted(&self) -> bool
fn internal_node_list_trusted(&self) -> bool
Check if node list can be trusted. (if false, nodes in
self.node_list need further filtering,
if true, the result of self.node_list can be trusted, in particular, its len is the number
of nodes in the graph).Source§fn edge_filter_includes_node_filter(&self) -> bool
fn edge_filter_includes_node_filter(&self) -> bool
If true, do not need to check src and dst of the edge separately, even if nodes are filtered
(i.e., edge filter already makes sure there are no edges between non-existent nodes)
This should be
false when implementing NodeFilterOps without overriding the edge filter.Source§fn edge_layer_filter_includes_node_filter(&self) -> bool
fn edge_layer_filter_includes_node_filter(&self) -> bool
If true, do not need to check src and dst of the edge separately, even if nodes are filtered
(i.e., edge filter already makes sure there are no edges between non-existent nodes)
This should be
false when implementing NodeFilterOps without overriding the edge layer filter.Source§fn exploded_edge_filter_includes_node_filter(&self) -> bool
fn exploded_edge_filter_includes_node_filter(&self) -> bool
If true, do not need to check src and dst of the edge separately, even if nodes are filtered
(i.e., edge filter already makes sure there are no edges between non-existent nodes)
This should be
false when implementing NodeFilterOps without overriding the exploded edge filter.Source§fn internal_filter_node(
&self,
node: NodeStorageRef<'_>,
layer_ids: &LayerIds,
) -> bool
fn internal_filter_node( &self, node: NodeStorageRef<'_>, layer_ids: &LayerIds, ) -> bool
If
true, node is included in the graphSource§impl<G> InternalStorageOps for G
impl<G> InternalStorageOps for G
fn get_storage(&self) -> Option<&Storage>
Source§impl<P> InternalTemporalPropertiesOps for Pwhere
P: InheritTemporalPropertiesOps + Send + Sync,
<P as Base>::Base: InternalTemporalPropertiesOps,
impl<P> InternalTemporalPropertiesOps for Pwhere
P: InheritTemporalPropertiesOps + Send + Sync,
<P as Base>::Base: InternalTemporalPropertiesOps,
fn get_temporal_prop_id(&self, name: &str) -> Option<usize>
fn get_temporal_prop_name(&self, id: usize) -> ArcStr
fn temporal_prop_ids( &self, ) -> Box<dyn Iterator<Item = usize> + Send + Sync + '_>
fn temporal_prop_keys( &self, ) -> Box<dyn Iterator<Item = ArcStr> + Send + Sync + '_>
Source§impl<P> InternalTemporalPropertyViewOps for Pwhere
P: InheritTemporalPropertyViewOps + Send + Sync,
<P as Base>::Base: InternalTemporalPropertyViewOps,
impl<P> InternalTemporalPropertyViewOps for Pwhere
P: InheritTemporalPropertyViewOps + Send + Sync,
<P as Base>::Base: InternalTemporalPropertyViewOps,
fn dtype(&self, id: usize) -> PropType
fn temporal_value(&self, id: usize) -> Option<Prop>
fn temporal_iter( &self, id: usize, ) -> Box<dyn Iterator<Item = (EventTime, Prop)> + Send + Sync + '_>
fn temporal_iter_rev( &self, id: usize, ) -> Box<dyn Iterator<Item = (EventTime, Prop)> + Send + Sync + '_>
fn temporal_history_iter( &self, id: usize, ) -> Box<dyn Iterator<Item = EventTime> + Send + Sync + '_>
fn temporal_history_iter_rev( &self, id: usize, ) -> Box<dyn Iterator<Item = EventTime> + Send + Sync + '_>
fn temporal_values_iter( &self, id: usize, ) -> Box<dyn Iterator<Item = Prop> + Send + Sync + '_>
fn temporal_values_iter_rev( &self, id: usize, ) -> Box<dyn Iterator<Item = Prop> + Send + Sync + '_>
fn temporal_value_at(&self, id: usize, t: EventTime) -> Option<Prop>
Source§impl<G> IntoDynamic for Gwhere
G: StaticGraphViewOps + Static,
impl<G> IntoDynamic for Gwhere
G: StaticGraphViewOps + Static,
fn into_dynamic(self) -> DynamicGraph
Source§impl<G> IntoDynamicOrMutable for Gwhere
G: IntoDynamic + Immutable,
impl<G> IntoDynamicOrMutable for Gwhere
G: IntoDynamic + Immutable,
fn into_dynamic_or_mutable(self) -> DynOrMutableGraph
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: InternalFilter<'graph> + 'graph,
impl<'graph, V> LayerOps<'graph> for Vwhere
V: InternalFilter<'graph> + 'graph,
type LayeredViewType = <V as InternalFilter<'graph>>::Filtered<LayeredGraph<<V as InternalFilter<'graph>>::Graph>>
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 has_layer<L>(&self, name: L) -> boolwhere
L: SingleLayer,
fn has_layer<L>(&self, name: L) -> boolwhere
L: SingleLayer,
Check if
name is a valid layer nameSource§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§fn num_layers(&self) -> usize
fn num_layers(&self) -> usize
Returns the number of layers
Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<'graph, V> TimeOps<'graph> for Vwhere
V: InternalFilter<'graph> + 'graph + InternalTimeOps<'graph>,
impl<'graph, V> TimeOps<'graph> for Vwhere
V: InternalFilter<'graph> + 'graph + InternalTimeOps<'graph>,
type WindowedViewType = <V as InternalTimeOps<'graph>>::InternalWindowedView
Source§fn start(&self) -> Option<EventTime>
fn start(&self) -> Option<EventTime>
Return the time entry of the start of the view or None if the view start is unbounded.
Source§fn end(&self) -> Option<EventTime>
fn end(&self) -> Option<EventTime>
Return the time entry of the view or None if the view end is unbounded.
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 moreSource§fn expanding_aligned<I>(
&self,
step: I,
alignment_unit: AlignmentUnit,
) -> Result<WindowSet<'graph, V>, ParseTimeError>
fn expanding_aligned<I>( &self, step: I, alignment_unit: AlignmentUnit, ) -> Result<WindowSet<'graph, V>, ParseTimeError>
Creates a
WindowSet with the given step size using an expanding window, where the windows are aligned
with the alignment_unit passed. The last window may fall partially outside the range of the data/view. Read moreSource§fn rolling<I>(
&self,
window: I,
step: Option<I>,
) -> Result<WindowSet<'graph, V>, ParseTimeError>
fn rolling<I>( &self, window: I, step: Option<I>, ) -> Result<WindowSet<'graph, V>, ParseTimeError>
Creates a
WindowSet with the given window size and optional step
using a rolling window. The last window may fall partially outside the range of the data/view.
Note that passing a step larger than window can lead to some entries appearing before
the start of the first window and/or after the end of the last window (i.e. not included in any window) Read moreSource§fn rolling_aligned<I>(
&self,
window: I,
step: Option<I>,
alignment_unit: AlignmentUnit,
) -> Result<WindowSet<'graph, V>, ParseTimeError>
fn rolling_aligned<I>( &self, window: I, step: Option<I>, alignment_unit: AlignmentUnit, ) -> Result<WindowSet<'graph, V>, ParseTimeError>
Creates a
WindowSet with the given window size and optional step using a rolling window, where the windows
are aligned with the alignment_unit passed. The last window may fall partially outside the range of the data/view.
Note that, depending on the alignment_unit, passing a step larger than window can lead to some entries
appearing before the start of the first window and/or after the end of the last window (i.e. not included in any window) Read more