Struct Anchor 

pub struct Anchor<'this, 'id, T>
where
    T: GraphImpl + 'this,
{ /* private fields */ }

Implementations

impl<'this, 'id, N: 'this, E: 'this, Root> Anchor<'this, 'id, GenericGraph<Root, NamedNode<N, E>>>

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

pub fn edges( &self, src: GraphPtr<'id, NamedNode<N, E>>, ) -> impl Iterator<Item = GraphItem<Edge<&N, &E>, GraphPtr<'id, NamedNode<N, E>>>>

Returns an iterator over edges attached to src node.

impl<'this, 'id, N: 'this, E: 'this, Root> Anchor<'this, 'id, GenericGraph<Root, OptionNode<N, E>>>

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

pub fn edges( &self, src: GraphPtr<'id, OptionNode<N, E>>, ) -> impl Iterator<Item = GraphItem<Edge<&N, &E>, GraphPtr<'id, OptionNode<N, E>>>>

Returns an iterator over edges attached to src node.

impl<'this, 'id, N: 'this, E: 'this, Root> Anchor<'this, 'id, GenericGraph<Root, VecNode<N, E>>>

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

pub fn edges( &self, src: GraphPtr<'id, VecNode<N, E>>, ) -> impl Iterator<Item = GraphItem<Edge<&N, &E>, GraphPtr<'id, VecNode<N, E>>>>

Returns an iterator over edges attached to src node.

impl<'this, 'id, K, N: 'this, E: 'this, Root> Anchor<'this, 'id, GenericGraph<Root, TreeNode<K, N, E>>>

where Root: RootCollection<'static, TreeNode<K, N, E>> + 'this, K: Ord + 'this,

pub fn edges( &self, src: GraphPtr<'id, TreeNode<K, N, E>>, ) -> impl Iterator<Item = GraphItem<Edge<&N, &E>, GraphPtr<'id, TreeNode<K, N, E>>>>

Returns an iterator over edges attached to src node.

impl<'this, 'id, N: 'this, NodeType, Root> Anchor<'this, 'id, GenericGraph<Root, NodeType>>

where NodeType: GraphNode<Node = N> + 'this, Root: RootCollection<'static, NodeType> + 'this,

pub unsafe fn from_raw(&self, raw: *const NodeType) -> GraphPtr<'id, NodeType>

Creates a checked pointer from a raw pointer.

Safety

Caller must guarantee raw points to a node which was not cleaned up and belongs to the parent graph.

pub fn cursor(&self, dst: GraphPtr<'id, NodeType>) -> Cursor<'_, 'id, NodeType>

Creates an immutable cursor pointing to dst

impl<'this, 'id, N: 'this, NodeType> Anchor<'this, 'id, VecGraph<NodeType>>

where NodeType: GraphNode<Node = N> + 'this,

pub fn root(&self) -> &RootVec<'id, NodeType>

Provides direct access to the collection of the root.

impl<'this, 'id, N: 'this, NodeType> Anchor<'this, 'id, NamedGraph<NodeType>>

where NodeType: GraphNode<Node = N> + 'this,

pub fn root(&self) -> &RootNamedSet<'id, NodeType>

Provides direct access to the collection of the root.

impl<'this, 'id, N: 'this, NodeType> Anchor<'this, 'id, OptionGraph<NodeType>>

where NodeType: GraphNode<Node = N> + 'this,

pub fn root(&self) -> &RootOption<'id, NodeType>

Provides direct access to the collection of the root.

Trait Implementations

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, 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, 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, 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.