Struct CursorMut 

pub struct CursorMut<'this, 'id, T: 'this> { /* private fields */ }

A wrapper over a GraphPtr which provides simplified access to AnchorMut API.

Implementations

impl<'this, 'id, N: 'this, NodeType> CursorMut<'this, 'id, NodeType>

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

pub fn at(&self) -> GraphPtr<'id, NodeType>

Returns a pointer to the current node the cursor points to.

pub fn is_at(&self, dst: GraphPtr<'id, NodeType>) -> bool

Returns true if the cursor points to dst.

pub fn jump(&mut self, dst: GraphPtr<'id, NodeType>)

Moves the cursor to dst.

impl<'this, 'id, N: 'this, E: 'this> CursorMut<'this, 'id, NamedNode<N, E>>

pub fn get_edge( &self, dst: GraphPtr<'id, NamedNode<N, E>>, ) -> Option<Edge<&N, &E>>

Returns Some if dst is attached to the current node and None otherwise.

impl<'this, 'id, N: 'this, E: 'this> CursorMut<'this, 'id, VecNode<N, E>>

pub fn get_edge(&self, dst: usize) -> Option<Edge<&N, &E>>

Returns Some if dst is attached to the current node and None otherwise.

impl<'this, 'id, N: 'this, E: 'this> CursorMut<'this, 'id, OptionNode<N, E>>

pub fn get_edge(&self, _dst: ()) -> Option<Edge<&N, &E>>

Returns Some if a node is attached to the current node and None otherwise.

impl<'this, 'id, K, N: 'this, E: 'this> CursorMut<'this, 'id, TreeNode<K, N, E>>

where K: Ord + 'this,

pub fn get_edge(&self, dst: &K) -> Option<Edge<&N, &E>>

Returns Some if a node is attached to the current node and None otherwise.

impl<'this, 'id, K, N: 'this, E: 'this> CursorMut<'this, 'id, TreeNode<K, N, E>>

where K: Ord + 'this,

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

Returns an iterator over edges and node pointers attached to the current node.

impl<'this, 'id, N: 'this, E: 'this> CursorMut<'this, 'id, NamedNode<N, E>>

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

Returns an iterator over edges and node pointers attached to the current node.

impl<'this, 'id, N: 'this, E: 'this> CursorMut<'this, 'id, VecNode<N, E>>

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

Returns an iterator over edges and node pointers attached to the current node.

impl<'this, 'id, N: 'this, E: 'this> CursorMut<'this, 'id, OptionNode<N, E>>

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

Returns an iterator over edges and node pointers attached to the current node.

impl<'this, 'id, N: 'this, E: 'this> CursorMut<'this, 'id, NamedNode<N, E>>

pub fn get_edge_mut( &mut self, dst: GraphPtr<'id, NamedNode<N, E>>, ) -> Option<Edge<&mut N, &mut E>>

Returns Some if dst is attached to the current node and None otherwise.

impl<'this, 'id, N: 'this, E: 'this> CursorMut<'this, 'id, VecNode<N, E>>

pub fn get_edge_mut(&mut self, dst: usize) -> Option<Edge<&mut N, &mut E>>

Returns Some if dst is attached to the current node and None otherwise.

impl<'this, 'id, N: 'this, E: 'this> CursorMut<'this, 'id, OptionNode<N, E>>

pub fn get_edge_mut(&mut self, _key: ()) -> Option<Edge<&mut N, &mut E>>

Returns Some if a node is attached to the current node and None otherwise.

impl<'this, 'id, N: 'this, E: 'this> CursorMut<'this, 'id, NamedNode<N, E>>

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

Returns a mutable iterator over edges and node pointers attached to the current node.

pub fn bridge( &mut self, dst: GraphPtr<'id, NamedNode<N, E>>, ) -> Option<(&mut NamedNode<'id, N, E>, &mut NamedNode<'id, N, E>)>

Provides direct mutable access to current and dst nodes or or None if current is the same as dst. Returns mutable views into the current and dst nodes or None if current is the same as dst.

impl<'this, 'id, N: 'this, E: 'this> CursorMut<'this, 'id, VecNode<N, E>>

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

Returns a mutable iterator over edges and node pointers attached to the current node.

pub fn bridge( &mut self, dst: GraphPtr<'id, VecNode<N, E>>, ) -> Option<(&mut VecNode<'id, N, E>, &mut VecNode<'id, N, E>)>

Provides direct mutable access to current and dst nodes or or None if current is the same as dst. Returns mutable views into the current and dst nodes or None if current is the same as dst.

impl<'this, 'id, N: 'this, E: 'this> CursorMut<'this, 'id, OptionNode<N, E>>

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

Returns a mutable iterator over edges and node pointers attached to the current node.

pub fn bridge( &mut self, dst: GraphPtr<'id, OptionNode<N, E>>, ) -> Option<(&mut OptionNode<'id, N, E>, &mut OptionNode<'id, N, E>)>

Provides direct mutable access to current and dst nodes or or None if current is the same as dst. Returns mutable views into the current and dst nodes or None if current is the same as dst.

impl<'this, 'id, K, N: 'this, E: 'this> CursorMut<'this, 'id, TreeNode<K, N, E>>

where K: Ord + 'this,

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

Returns a mutable iterator over edges and node pointers attached to the current node.

pub fn bridge( &mut self, dst: GraphPtr<'id, TreeNode<K, N, E>>, ) -> Option<(&mut TreeNode<'id, K, N, E>, &mut TreeNode<'id, K, N, E>)>

Provides direct mutable access to current and dst nodes or or None if current is the same as dst. Returns mutable views into the current and dst nodes or None if current is the same as dst.

Trait Implementations

impl<'this, 'id, N: 'this, E: 'this> Deref for CursorMut<'this, 'id, NamedNode<N, E>>

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

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<'this, 'id, N: 'this, E: 'this> Deref for CursorMut<'this, 'id, OptionNode<N, E>>

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

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<'this, 'id, K, N: 'this, E: 'this> Deref for CursorMut<'this, 'id, TreeNode<K, N, E>>

where K: Ord + 'this,

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

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<'this, 'id, N: 'this, E: 'this> Deref for CursorMut<'this, 'id, VecNode<N, E>>

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

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<'this, 'id, N: 'this, E: 'this> DerefMut for CursorMut<'this, 'id, NamedNode<N, E>>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<'this, 'id, N: 'this, E: 'this> DerefMut for CursorMut<'this, 'id, OptionNode<N, E>>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<'this, 'id, K, N: 'this, E: 'this> DerefMut for CursorMut<'this, 'id, TreeNode<K, N, E>>

where K: Ord + 'this,

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<'this, 'id, N: 'this, E: 'this> DerefMut for CursorMut<'this, 'id, VecNode<N, E>>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.