Struct raphtory::db::graph::node::NodeView

pub struct NodeView<G, GH = G> {
    pub base_graph: G,
    pub graph: GH,
    pub node: VID,
}

View of a Node in a Graph

Fields

base_graph: G

graph: GH

node: VID

Implementations

impl<'a, G: Clone, GH: Clone> NodeView<&'a G, &'a GH>

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

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

pub fn new_internal(graph: G, node: VID) -> NodeView<G>

Creates a new NodeView wrapping an internal node reference and a graph

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

pub fn new_one_hop_filtered(base_graph: G, graph: GH, node: VID) -> Self

impl<G: StaticGraphViewOps + InternalPropertyAdditionOps + InternalAdditionOps> NodeView<G, G>

pub fn add_constant_properties<C: CollectProperties>( &self, props: C, ) -> Result<(), GraphError>

pub fn set_node_type(&self, new_type: &str) -> Result<(), GraphError>

pub fn update_constant_properties<C: CollectProperties>( &self, props: C, ) -> Result<(), GraphError>

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

Trait Implementations

impl<G, GH> AsNodeRef for NodeView<G, GH>

fn as_node_ref(&self) -> NodeRef<'_>

fn into_gid(self) -> Either<GID, VID>

where Self: Sized,

fn as_gid_ref(&self) -> Either<GidRef<'_>, VID>

impl<G: Clone, GH: Clone> Clone for NodeView<G, GH>

fn clone(&self) -> NodeView<G, GH>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<G, GH: CoreGraphOps> ConstPropertiesOps for NodeView<G, GH>

fn get_const_prop_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_const_prop_name(&self, id: usize) -> ArcStr

fn const_prop_ids(&self) -> Box<dyn Iterator<Item = usize> + '_>

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

fn const_prop_keys(&self) -> Box<dyn Iterator<Item = ArcStr> + '_>

fn const_prop_values(&self) -> Vec<Prop>

impl<'graph, G, GH: GraphViewOps<'graph> + Debug> Debug for NodeView<G, GH>

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

Formats the value using the given formatter.

impl<'graph, G, GH: GraphViewOps<'graph>> Display for NodeView<G, GH>

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

Formats the value using the given formatter.

impl<G, GH: CoreGraphOps> Hash for NodeView<G, GH>

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<'graph, G: GraphViewOps<'graph>, GH: GraphViewOps<'graph>> OneHopFilter<'graph> for NodeView<G, GH>

type BaseGraph = G

type FilteredGraph = GH

type Filtered<GHH: GraphViewOps<'graph>> = NodeView<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>

impl<'graph, G: GraphViewOps<'graph>, GH: GraphViewOps<'graph>> Ord for NodeView<G, GH>

fn cmp(&self, other: &Self) -> 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 + PartialOrd,

Restrict a value to a certain interval.

impl<G1: CoreGraphOps, G1H, G2: CoreGraphOps, G2H> PartialEq<NodeView<G2, G2H>> for NodeView<G1, G1H>

fn eq(&self, other: &NodeView<G2, G2H>) -> 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, G1: GraphViewOps<'graph>, G1H: GraphViewOps<'graph>, G2: GraphViewOps<'graph>, G2H: GraphViewOps<'graph>> PartialOrd<NodeView<G2, G2H>> for NodeView<G1, G1H>

fn partial_cmp(&self, other: &NodeView<G2, G2H>) -> 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, GH: CoreGraphOps + TimeSemantics> TemporalPropertiesOps for NodeView<G, GH>

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> + '_>

fn temporal_prop_keys(&self) -> Box<dyn Iterator<Item = ArcStr> + '_>

impl<G, GH: TimeSemantics> TemporalPropertyViewOps for NodeView<G, GH>

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

fn temporal_history(&self, id: usize) -> Vec<i64>

fn temporal_history_date_time(&self, id: usize) -> Option<Vec<DateTime<Utc>>>

fn temporal_values(&self, id: usize) -> Vec<Prop>

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

impl<G: Copy, GH: Copy> Copy for NodeView<G, GH>

impl<'graph, G: GraphViewOps<'graph>, GH: GraphViewOps<'graph>> Eq for NodeView<G, GH>

impl<G, GH> Static for NodeView<G, GH>