Struct raphtory :: db :: graph :: path :: PathFromGraph Copy item path

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

pub fn new<OP: Fn(VID) -> BoxedLIter<'graph, VID> + Send + Sync + 'graph>( graph: G, nodes: Arc<dyn Fn() -> BoxedLIter<'graph, VID> + Send + Sync + 'graph>, op: OP, ) -> Self

impl<'graph, G: GraphViewOps<'graph>, GH: GraphViewOps<'graph>> PathFromGraph<'graph, G, GH>

pub fn iter( &self, ) -> impl Iterator<Item = PathFromNode<'graph, G, GH>> + Send + 'graph

pub fn iter_refs( &self, ) -> impl Iterator<Item = BoxedLIter<'graph, VID>> + Send + 'graph

pub fn type_filter( &self, node_types: &[impl AsRef<str>], ) -> PathFromGraph<'graph, G, GH>

pub fn collect(&self) -> Vec<Vec<NodeView<G, GH>>>

Trait Implementations§

impl<'graph, G: Clone, GH: Clone> Clone for PathFromGraph<'graph, G, GH>

fn clone(&self) -> PathFromGraph<'graph, G, GH>

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

impl<'graph, G: GraphViewOps<'graph>, GH: GraphViewOps<'graph>> IntoIterator for PathFromGraph<'graph, G, GH>

type Item = PathFromNode<'graph, G, GH>

The type of the elements being iterated over.

type IntoIter = Box<dyn Iterator<Item = <PathFromGraph<'graph, G, GH> as IntoIterator>::Item> + Send + 'graph>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more

impl<'graph, G: GraphViewOps<'graph>, GH: GraphViewOps<'graph>> OneHopFilter<'graph> for PathFromGraph<'graph, G, GH>

type BaseGraph = G

type FilteredGraph = GH

type Filtered<GHH: GraphViewOps<'graph>> = PathFromGraph<'graph, G, GHH>

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, G, GH> Freeze for PathFromGraph<'graph, G, GH>
where G: Freeze, GH: Freeze,

impl<'graph, G, GH> !RefUnwindSafe for PathFromGraph<'graph, G, GH>

impl<'graph, G, GH> Send for PathFromGraph<'graph, G, GH>
where G: Send, GH: Send,

impl<'graph, G, GH> Sync for PathFromGraph<'graph, G, GH>
where G: Sync, GH: Sync,

impl<'graph, G, GH> Unpin for PathFromGraph<'graph, G, GH>
where G: Unpin, GH: Unpin,

impl<'graph, G, GH> !UnwindSafe for PathFromGraph<'graph, G, GH>

Blanket Implementations§

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

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

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

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

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

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

Mutably borrows from an owned value. Read more

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

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

impl<T> From<T> for T

fn from(t: T) -> T

Returns the argument unchanged.

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

fn into(self) -> U

Calls U::from(self).

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

impl<T> IntoEither for T

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

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

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

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

fn default_layer(&self) -> <V as LayerOps<'graph>>::LayeredViewType

Return a graph containing only the default edge layer

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.

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.

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

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

Check if name is a valid layer name

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.

impl<'graph, V> NodeViewOps<'graph> for V
where V: BaseNodeViewOps<'graph> + 'graph,

type BaseGraph = <V as BaseNodeViewOps<'graph>>::BaseGraph

type Graph = <V as BaseNodeViewOps<'graph>>::Graph

type ValueType<T: 'graph> = <V as BaseNodeViewOps<'graph>>::ValueType<T>

type PathType = <V as BaseNodeViewOps<'graph>>::PathType

type PropType = <V as BaseNodeViewOps<'graph>>::PropType

type Edges = <V as BaseNodeViewOps<'graph>>::Edges

fn id(&self) -> <V as NodeViewOps<'graph>>::ValueType<GID>

Get the numeric id of the node

fn name(&self) -> <V as NodeViewOps<'graph>>::ValueType<String>

Get the name of this node if a user has set one otherwise it returns the ID. Read more

fn node_type(&self) -> <V as NodeViewOps<'graph>>::ValueType<Option<ArcStr>>

Returns the type of node

fn node_type_id(&self) -> <V as NodeViewOps<'graph>>::ValueType<usize>

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

Get the timestamp for the earliest activity of the node

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

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

Get the timestamp for the latest activity of the node

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

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

Gets the history of the node (time that the node was added and times when changes were made to the node)

fn history_date_time( &self, ) -> <V as NodeViewOps<'graph>>::ValueType<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 parseable

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

Get a view of the temporal properties of this node. Read more

fn degree(&self) -> <V as NodeViewOps<'graph>>::ValueType<usize>

Get the degree of this node (i.e., the number of edges that are incident to it). Read more

fn in_degree(&self) -> <V as NodeViewOps<'graph>>::ValueType<usize>

Get the in-degree of this node (i.e., the number of edges that point into it). Read more

fn out_degree(&self) -> <V as NodeViewOps<'graph>>::ValueType<usize>

Get the out-degree of this node (i.e., the number of edges that point out of it). Read more

fn edges(&self) -> <V as NodeViewOps<'graph>>::Edges

Get the edges that are incident to this node. Read more

fn in_edges(&self) -> <V as NodeViewOps<'graph>>::Edges

Get the edges that point into this node. Read more

fn out_edges(&self) -> <V as NodeViewOps<'graph>>::Edges

Get the edges that point out of this node. Read more

fn neighbours(&self) -> <V as NodeViewOps<'graph>>::PathType

Get the neighbours of this node. Read more

fn in_neighbours(&self) -> <V as NodeViewOps<'graph>>::PathType

Get the neighbours of this node that point into this node. Read more

fn out_neighbours(&self) -> <V as NodeViewOps<'graph>>::PathType

Get the neighbours of this node that point out of this node. Read more

impl<T> Pointable for T

const ALIGN: usize = _

The alignment of pointer.

type Init = T

The type for initializers.

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

Initializes a with the given initializer. Read more

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

Dereferences the given pointer. Read more

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

Mutably dereferences the given pointer. Read more

unsafe fn drop(ptr: usize)

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

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

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

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

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

fn start(&self) -> Option<i64>

Return the timestamp of the start of the view or None if the view start is unbounded.

fn end(&self) -> Option<i64>

Return the timestamp of the 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>>

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

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

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

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

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)

fn window_size(&self) -> Option<u64>

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

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)

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

Create a view that only includes events at time

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

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

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

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

fn expanding( &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

fn rolling( &self, window: I, step: Option, ) -> 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

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

type Owned = T

The resulting type after obtaining ownership.

fn to_owned(&self) -> T

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

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

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

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

type Error = Infallible

The type returned in the event of a conversion error.

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

Performs the conversion.

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

type Error = >::Error

The type returned in the event of a conversion error.

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

Performs the conversion.

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