Struct GraphPtr

pub struct GraphPtr<'id, T> { /* private fields */ }

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 duplicate of the value.

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

Performs copy-assignment from source.

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

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<'this, 'id, N: 'this, E: 'this, Root> Index<GraphPtr<'id, NamedNode<N, E>>> for Anchor<'this, 'id, GenericGraph<Root, NamedNode<N, E>>>

where Root: RootCollection<'static, NamedNode<N, E>> + 'this,

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> Index<GraphPtr<'id, NamedNode<N, E>>> for AnchorMut<'this, 'id, GenericGraph<Root, NamedNode<N, E>>>

where Root: RootCollection<'static, NamedNode<N, E>> + 'this,

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> Index<GraphPtr<'id, OptionNode<N, E>>> for Anchor<'this, 'id, GenericGraph<Root, OptionNode<N, E>>>

where Root: RootCollection<'static, OptionNode<N, E>> + 'this,

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> Index<GraphPtr<'id, OptionNode<N, E>>> for AnchorMut<'this, 'id, GenericGraph<Root, OptionNode<N, E>>>

where Root: RootCollection<'static, OptionNode<N, E>> + 'this,

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, N: 'this, E: 'this, Root> 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>> + 'this, K: Ord + 'this,

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, N: 'this, E: 'this, Root> 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>> + 'this, K: Ord + 'this,

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> Index<GraphPtr<'id, VecNode<N, E>>> for Anchor<'this, 'id, GenericGraph<Root, VecNode<N, E>>>

where Root: RootCollection<'static, VecNode<N, E>> + 'this,

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> Index<GraphPtr<'id, VecNode<N, E>>> for AnchorMut<'this, 'id, GenericGraph<Root, VecNode<N, E>>>

where Root: RootCollection<'static, VecNode<N, E>> + 'this,

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> IndexMut<GraphPtr<'id, NamedNode<N, E>>> for AnchorMut<'this, 'id, GenericGraph<Root, NamedNode<N, E>>>

where Root: RootCollection<'static, NamedNode<N, E>> + 'this,

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> IndexMut<GraphPtr<'id, OptionNode<N, E>>> for AnchorMut<'this, 'id, GenericGraph<Root, OptionNode<N, E>>>

where Root: RootCollection<'static, OptionNode<N, E>> + 'this,

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, N: 'this, E: 'this, Root> 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>> + 'this, K: Ord + 'this,

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> IndexMut<GraphPtr<'id, VecNode<N, E>>> for AnchorMut<'this, 'id, GenericGraph<Root, VecNode<N, E>>>

where Root: RootCollection<'static, VecNode<N, E>> + 'this,

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 for GraphPtr<'id, T>

fn eq(&self, other: &Self) -> 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<'id, T> Copy for GraphPtr<'id, T>

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