Struct DefaultPushCursor 

pub struct DefaultPushCursor<K, V, T, R, C>
where
    K: ?Sized,
    V: ?Sized,
    R: ?Sized,
    C: Cursor<K, V, T, R>,
{ /* private fields */ }

Implementations

impl<K, V, T, R, C> DefaultPushCursor<K, V, T, R, C>

where K: ?Sized, V: ?Sized, R: ?Sized, C: Cursor<K, V, T, R>,

pub fn new(cursor: C) -> Self

Trait Implementations

impl<K, V, T, R, C> PushCursor<K, V, T, R> for DefaultPushCursor<K, V, T, R, C>

where K: ?Sized, V: ?Sized, R: ?Sized, C: Cursor<K, V, T, R>,

fn key(&self) -> Result<Option<&K>, Pending>

Returns the current key as Ok(Some(key)), or Ok(None) if the batch is exhausted, or Err(Pending) if this key exists but isn’t available yet.

fn val(&self) -> Result<Option<&V>, Pending>

Returns the current value as Ok(Some(key)), or Ok(None) if the key’s values are exhausted, or Err(Pending) if this value exists but isn’t available yet.

fn map_times(&mut self, logic: &mut dyn FnMut(&T, &R))

Applies logic to each pair of time and difference for the current key-value pair.

fn weight(&mut self) -> &R

where T: PartialEq<()>,

Returns the weight associated with the current key/value pair.

fn step_key(&mut self)

Advances to the next key.

fn step_val(&mut self)

Advances to the next value.

fn run(&mut self)

Gives the implementation an opportunity to process I/O results and launch further I/O. Implementations need this to called periodically.