Struct Cursor 

pub struct Cursor<'a, K, V> { /* private fields */ }

A bidirectional immutable cursor over the tree nodes, sorted by key. This is a simpler variant of CursorMut that is basically providing read only access.

Examples

In the following example, we obtain a cursor to the first element in the tree. The cursor allows us to iterate bidirectionally over key/value pairs in the tree.

use kernel::{alloc::flags, rbtree::RBTree};

// Create a new tree.
let mut tree = RBTree::new();

// Insert three elements.
tree.try_create_and_insert(10, 100, flags::GFP_KERNEL)?;
tree.try_create_and_insert(20, 200, flags::GFP_KERNEL)?;
tree.try_create_and_insert(30, 300, flags::GFP_KERNEL)?;

// Get a cursor to the first element.
let cursor = tree.cursor_front().unwrap();
let current = cursor.current();
assert_eq!(current, (&10, &100));

Implementations

impl<'a, K, V> Cursor<'a, K, V>

pub fn current(&self) -> (&K, &V)

The current node

pub fn peek_prev(&self) -> Option<(&K, &V)>

Access the previous node without moving the cursor.

pub fn peek_next(&self) -> Option<(&K, &V)>

Access the next node without moving the cursor.

Trait Implementations

impl<'a, K: Sync, V: Sync> Send for Cursor<'a, K, V>

impl<'a, K: Sync, V: Sync> Sync for Cursor<'a, K, V>