Struct skipfree::SkipListIterator

pub struct SkipListIterator<K, V> { /* private fields */ }

A SkipList iterator. Will outlast the skip list it comes from if so chosen.

Implementations

impl<K: Eq + Ord + Default, V: Default> SkipListIterator<K, V>

pub fn is_valid(&self) -> bool

Returns true if the skip list is positioned at a key-value pair.

pub fn key(&self) -> &K

The key the skiplist is positioned to.

Panics

Will panic if the skiplist is not valid.

pub fn value(&self) -> &V

The value the skiplist is positioned to.

Panics

Will panic if the skiplist is not valid.

pub fn next(&mut self)

Advance forward in the skip list, to the next greater key.

pub fn prev(&mut self)

Advance forward in the skip list, to the next smaller key.

pub fn seek(&mut self, key: &K)

Seek to the first key >= the provided key.

pub fn seek_to_first(&mut self)

Seek to the empty start of the skiplist.

After this call the skiplist will not be valid. Call next to get the next node.

pub fn seek_to_last(&mut self)

Seek to the empty end of the skiplist.

After this call the skiplist will not be valid. Call prev to get the prev node.

Trait Implementations

impl<K: Clone, V: Clone> Clone for SkipListIterator<K, V>

fn clone(&self) -> SkipListIterator<K, V>

Returns a copy of the value.

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

Performs copy-assignment from source.