Struct dynamic_graph::graph_ptr::GraphPtr

#[repr(transparent)]pub struct GraphPtr<'id, T> { /* fields omitted */ }

A checked pointer type used to access and traverse graph nodes in the crate. This pointer cannot be dereferenced and requires the parent anchor object to access the data stored in the collection.

Implementations

impl<'id, T> GraphPtr<'id, T>

pub fn as_ptr(self) -> *const T

Returns a raw pointer to the graph node. This pointer should not be dereferenced directly and is meant to be a way to cache GraphPtrs between cleanups.

Trait Implementations

impl<'id, T> Clone for GraphPtr<'id, T>

fn clone(&self) -> GraphPtr<'id, T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'id, T> Copy for GraphPtr<'id, T>

impl<'id, T> Eq for GraphPtr<'id, T>

impl<'id, T> Hash for GraphPtr<'id, T>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

pub fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl<'this, 'id, N: 'this, E: 'this, Root: 'this> Index<GraphPtr<'id, NamedNode<N, E>>> for Anchor<'this, 'id, GenericGraph<Root, NamedNode<N, E>>> where
    Root: RootCollection<'static, NamedNode<N, E>>, 

type Output = NamedNode<'id, N, E>

The returned type after indexing.

fn index(&self, dst: GraphPtr<'id, NamedNode<N, E>>) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<'this, 'id, N: 'this, E: 'this, Root: 'this> Index<GraphPtr<'id, NamedNode<N, E>>> for AnchorMut<'this, 'id, GenericGraph<Root, NamedNode<N, E>>> where
    Root: RootCollection<'static, NamedNode<N, E>>, 

type Output = NamedNode<'id, N, E>

The returned type after indexing.

fn index(&self, dst: GraphPtr<'id, NamedNode<N, E>>) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<'this, 'id, N: 'this, E: 'this, Root: 'this> Index<GraphPtr<'id, OptionNode<N, E>>> for Anchor<'this, 'id, GenericGraph<Root, OptionNode<N, E>>> where
    Root: RootCollection<'static, OptionNode<N, E>>, 

type Output = OptionNode<'id, N, E>

The returned type after indexing.

fn index(&self, dst: GraphPtr<'id, OptionNode<N, E>>) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<'this, 'id, N: 'this, E: 'this, Root: 'this> Index<GraphPtr<'id, OptionNode<N, E>>> for AnchorMut<'this, 'id, GenericGraph<Root, OptionNode<N, E>>> where
    Root: RootCollection<'static, OptionNode<N, E>>, 

type Output = OptionNode<'id, N, E>

The returned type after indexing.

fn index(&self, dst: GraphPtr<'id, OptionNode<N, E>>) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<'this, 'id, K: 'this, N: 'this, E: 'this, Root: 'this> Index<GraphPtr<'id, TreeNode<K, N, E>>> for Anchor<'this, 'id, GenericGraph<Root, TreeNode<K, N, E>>> where
    Root: RootCollection<'static, TreeNode<K, N, E>>,
    K: Ord, 

type Output = TreeNode<'id, K, N, E>

The returned type after indexing.

fn index(&self, dst: GraphPtr<'id, TreeNode<K, N, E>>) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<'this, 'id, K: 'this, N: 'this, E: 'this, Root: 'this> Index<GraphPtr<'id, TreeNode<K, N, E>>> for AnchorMut<'this, 'id, GenericGraph<Root, TreeNode<K, N, E>>> where
    Root: RootCollection<'static, TreeNode<K, N, E>>,
    K: Ord, 

type Output = TreeNode<'id, K, N, E>

The returned type after indexing.

fn index(&self, dst: GraphPtr<'id, TreeNode<K, N, E>>) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<'this, 'id, N: 'this, E: 'this, Root: 'this> Index<GraphPtr<'id, VecNode<N, E>>> for Anchor<'this, 'id, GenericGraph<Root, VecNode<N, E>>> where
    Root: RootCollection<'static, VecNode<N, E>>, 

type Output = VecNode<'id, N, E>

The returned type after indexing.

fn index(&self, dst: GraphPtr<'id, VecNode<N, E>>) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<'this, 'id, N: 'this, E: 'this, Root: 'this> Index<GraphPtr<'id, VecNode<N, E>>> for AnchorMut<'this, 'id, GenericGraph<Root, VecNode<N, E>>> where
    Root: RootCollection<'static, VecNode<N, E>>, 

type Output = VecNode<'id, N, E>

The returned type after indexing.

fn index(&self, dst: GraphPtr<'id, VecNode<N, E>>) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<'this, 'id, N: 'this, E: 'this, Root: 'this> IndexMut<GraphPtr<'id, NamedNode<N, E>>> for AnchorMut<'this, 'id, GenericGraph<Root, NamedNode<N, E>>> where
    Root: RootCollection<'static, NamedNode<N, E>>, 

fn index_mut(
    &mut self,
    dst: GraphPtr<'id, NamedNode<N, E>>
) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<'this, 'id, N: 'this, E: 'this, Root: 'this> IndexMut<GraphPtr<'id, OptionNode<N, E>>> for AnchorMut<'this, 'id, GenericGraph<Root, OptionNode<N, E>>> where
    Root: RootCollection<'static, OptionNode<N, E>>, 

fn index_mut(
    &mut self,
    dst: GraphPtr<'id, OptionNode<N, E>>
) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<'this, 'id, K: 'this, N: 'this, E: 'this, Root: 'this> IndexMut<GraphPtr<'id, TreeNode<K, N, E>>> for AnchorMut<'this, 'id, GenericGraph<Root, TreeNode<K, N, E>>> where
    Root: RootCollection<'static, TreeNode<K, N, E>>,
    K: Ord, 

fn index_mut(
    &mut self,
    dst: GraphPtr<'id, TreeNode<K, N, E>>
) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<'this, 'id, N: 'this, E: 'this, Root: 'this> IndexMut<GraphPtr<'id, VecNode<N, E>>> for AnchorMut<'this, 'id, GenericGraph<Root, VecNode<N, E>>> where
    Root: RootCollection<'static, VecNode<N, E>>, 

fn index_mut(&mut self, dst: GraphPtr<'id, VecNode<N, E>>) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<'id, T> PartialEq<GraphPtr<'id, T>> for GraphPtr<'id, T>

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==.

#[must_use]pub fn ne(&self, other: &Rhs) -> bool

This method tests for !=.