Struct raphtory::db::task::edge::eval_edge::EvalEdgeView

source · 
pub struct EvalEdgeView<'graph, 'a, G, GH, CS: Clone, S> { /* private fields */ }

Trait Implementations§

source§

impl<'graph, 'a: 'graph, G: GraphViewOps<'graph>, GH: GraphViewOps<'graph>, S, CS: ComputeState + 'a> Clone for EvalEdgeView<'graph, 'a, G, GH, CS, S>

source§

fn clone(&self) -> Self

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl<'graph, 'a: 'graph, G: GraphViewOps<'graph>, GH: GraphViewOps<'graph>, S, CS: ComputeState + 'a> OneHopFilter<'graph> for EvalEdgeView<'graph, 'a, G, GH, CS, S>

source§

type BaseGraph = &'graph G

source§

type FilteredGraph = GH

source§

type Filtered<GHH: GraphViewOps<'graph>> = EvalEdgeView<'graph, 'a, G, GHH, CS, S>

source§

fn current_filter(&self) -> &Self::FilteredGraph

source§

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

source§

fn one_hop_filtered<GHH: GraphViewOps<'graph>>( &self, filtered_graph: GHH, ) -> Self::Filtered<GHH>

source§

impl<'graph, 'a: 'graph, G: GraphViewOps<'graph>, GH: GraphViewOps<'graph>, S, CS: ComputeState + 'a> ResetFilter<'graph> for EvalEdgeView<'graph, 'a, G, GH, CS, S>

source§

fn reset_filter(&self) -> Self::Filtered<Self::BaseGraph>

Auto Trait Implementations§

§

impl<'graph, 'a, G, GH, CS, S> Freeze for EvalEdgeView<'graph, 'a, G, GH, CS, S>
where GH: Freeze,

§

impl<'graph, 'a, G, GH, CS, S> !RefUnwindSafe for EvalEdgeView<'graph, 'a, G, GH, CS, S>

§

impl<'graph, 'a, G, GH, CS, S> !Send for EvalEdgeView<'graph, 'a, G, GH, CS, S>

§

impl<'graph, 'a, G, GH, CS, S> !Sync for EvalEdgeView<'graph, 'a, G, GH, CS, S>

§

impl<'graph, 'a, G, GH, CS, S> Unpin for EvalEdgeView<'graph, 'a, G, GH, CS, S>
where GH: Unpin,

§

impl<'graph, 'a, G, GH, CS, S> !UnwindSafe for EvalEdgeView<'graph, 'a, G, GH, CS, S>

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> CloneToUninit for T
where T: Clone,

source§

unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
source§

impl<'graph, E> EdgeViewOps<'graph> for E
where E: BaseEdgeViewOps<'graph>,

source§

fn history(&self) -> <E as EdgeViewOps<'graph>>::ValueType<Vec<i64>>

list the activation timestamps for the edge

source§

fn properties( &self, ) -> <E as EdgeViewOps<'graph>>::ValueType<Properties<<E as EdgeViewOps<'graph>>::PropType>>

Return a view of the properties of the edge

source§

fn src(&self) -> <E as EdgeViewOps<'graph>>::Nodes

Returns the source node of the edge.

source§

fn dst(&self) -> <E as EdgeViewOps<'graph>>::Nodes

Returns the destination node of the edge.

source§

fn active(&self, t: i64) -> <E as EdgeViewOps<'graph>>::ValueType<bool>

Check if edge is active at a given time point

source§

fn explode(&self) -> <E as EdgeViewOps<'graph>>::Exploded

Explodes an edge and returns all instances it had been updated as seperate edges

source§

fn earliest_time(&self) -> <E as EdgeViewOps<'graph>>::ValueType<Option<i64>>

Gets the first time an edge was seen

source§

fn latest_time(&self) -> <E as EdgeViewOps<'graph>>::ValueType<Option<i64>>

Gets the latest time an edge was updated

source§

fn time(&self) -> <E as EdgeViewOps<'graph>>::ValueType<Result<i64, GraphError>>

Gets the time stamp of the edge if it is exploded

source§

fn layer_name( &self, ) -> <E as EdgeViewOps<'graph>>::ValueType<Result<ArcStr, GraphError>>

Gets the layer name for the edge if it is restricted to a single layer

source§

fn time_and_index( &self, ) -> <E as EdgeViewOps<'graph>>::ValueType<Option<TimeIndexEntry>>

Gets the TimeIndexEntry if the edge is exploded

source§

fn layer_names( &self, ) -> <E as EdgeViewOps<'graph>>::ValueType<Box<dyn Iterator<Item = ArcStr> + Send>>

Gets the name of the layer this edge belongs to

source§

type ValueType<T: 'graph> = <E as BaseEdgeViewOps<'graph>>::ValueType<T>

source§

type PropType = <E as BaseEdgeViewOps<'graph>>::PropType

source§

type Graph = <E as BaseEdgeViewOps<'graph>>::Graph

source§

type BaseGraph = <E as BaseEdgeViewOps<'graph>>::BaseGraph

source§

type Nodes = <E as BaseEdgeViewOps<'graph>>::Nodes

source§

type Exploded = <E as BaseEdgeViewOps<'graph>>::Exploded

source§

fn history_date_time( &self, ) -> <E as EdgeViewOps<'graph>>::ValueType<Option<Vec<DateTime<Utc>>>>

List the activation timestamps for the edge as NaiveDateTime objects if parseable
source§

fn deletions(&self) -> <E as EdgeViewOps<'graph>>::ValueType<Vec<i64>>

List the deletion timestamps for the edge
source§

fn deletions_date_time( &self, ) -> <E as EdgeViewOps<'graph>>::ValueType<Option<Vec<DateTime<Utc>>>>

List the deletion timestamps for the edge as NaiveDateTime objects if parseable
source§

fn is_valid(&self) -> <E as EdgeViewOps<'graph>>::ValueType<bool>

Check that the latest status of the edge is valid (i.e., not deleted)
source§

fn is_deleted(&self) -> <E as EdgeViewOps<'graph>>::ValueType<bool>

Check that the latest status of the edge is deleted (i.e., not valid)
source§

fn is_self_loop(&self) -> <E as EdgeViewOps<'graph>>::ValueType<bool>

If the edge is a loop then returns true, else false
source§

fn nbr(&self) -> <E as EdgeViewOps<'graph>>::Nodes

Returns the node at the other end of the edge (same as dst() for out-edges and src() for in-edges)
source§

fn id(&self) -> <E as EdgeViewOps<'graph>>::ValueType<(GID, GID)>

Returns the id of the edge.
source§

fn explode_layers(&self) -> <E as EdgeViewOps<'graph>>::Exploded

source§

fn earliest_date_time( &self, ) -> <E as EdgeViewOps<'graph>>::ValueType<Option<DateTime<Utc>>>

source§

fn latest_date_time( &self, ) -> <E as EdgeViewOps<'graph>>::ValueType<Option<DateTime<Utc>>>

source§

fn date_time( &self, ) -> <E as EdgeViewOps<'graph>>::ValueType<Option<DateTime<Utc>>>

source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> IntoEither for T

source§

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 more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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 more
source§

impl<'graph, V> LayerOps<'graph> for V
where V: OneHopFilter<'graph> + 'graph,

source§

type LayeredViewType = <V as OneHopFilter<'graph>>::Filtered<LayeredGraph<<V as OneHopFilter<'graph>>::FilteredGraph>>

source§

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>
where L: Into<Layer>,

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>
where L: Into<Layer>,

Return a graph containing the excluded layers in names. Errors if one or more of the layers do not exists.
source§

fn exclude_valid_layers<L>( &self, layers: L, ) -> <V as LayerOps<'graph>>::LayeredViewType
where L: Into<Layer>,

source§

fn has_layer(&self, name: &str) -> bool

Check if name is a valid layer name
source§

fn valid_layers<L>(&self, names: L) -> <V as LayerOps<'graph>>::LayeredViewType
where L: Into<Layer>,

Return a graph containing the layers in names. Any layers that do not exist are ignored.
source§

impl<T> Pointable for T

source§

const ALIGN: usize = _

The alignment of pointer.
source§

type Init = T

The type for initializers.
source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<'graph, V> TimeOps<'graph> for V
where V: OneHopFilter<'graph> + 'graph,

source§

type WindowedViewType = <V as InternalTimeOps<'graph>>::InternalWindowedViewType

source§

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>

Return the timestamp of the of the view or None if the view end is unbounded.
source§

fn start_date_time(&self) -> Option<DateTime<Utc>>

source§

fn end_date_time(&self) -> Option<DateTime<Utc>>

source§

fn shrink_start<T: IntoTime>(&self, start: T) -> Self::WindowedViewType

set the start of the window to the larger of start and self.start()
source§

fn shrink_end<T: IntoTime>(&self, end: T) -> Self::WindowedViewType

set the end of the window to the smaller of end and self.end()
source§

fn shrink_window<T: IntoTime>(&self, start: T, end: T) -> Self::WindowedViewType

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>

Return the size of the window covered by this view or None if the window is unbounded
source§

fn window<T1: IntoTime, T2: IntoTime>( &self, start: T1, end: T2, ) -> Self::WindowedViewType

Create a view including all events between start (inclusive) and end (exclusive)
source§

fn at<T: IntoTime>(&self, time: T) -> Self::WindowedViewType

Create a view that only includes events at time
source§

fn after<T: IntoTime>(&self, start: T) -> Self::WindowedViewType

Create a view that only includes events after start (exclusive)
source§

fn before<T: IntoTime>(&self, end: T) -> Self::WindowedViewType

Create a view that only includes events before end (exclusive)
source§

fn expanding<I>( &self, step: I, ) -> Result<WindowSet<'graph, Self>, ParseTimeError>
where Self: Sized + Clone + 'static, I: TryInto<Interval, Error = 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
source§

fn rolling<I>( &self, window: I, step: Option<I>, ) -> Result<WindowSet<'graph, Self>, ParseTimeError>
where Self: Sized + Clone + 'static, I: TryInto<Interval, Error = 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. Read more
source§

impl<T> ToOwned for T
where T: Clone,

source§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

source§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

source§

fn vzip(self) -> V