Struct merkletree::store::LevelCacheStoreProducer

pub struct LevelCacheStoreProducer<'data, E: 'data + Element> { /* fields omitted */ }

Methods

impl<'data, E: 'data + Element> LevelCacheStoreProducer<'data, E>

pub fn new(current: usize, end: usize, store: &'data LevelCacheStore<E>) -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

Trait Implementations

impl<'data, E: Clone + 'data + Element> Clone for LevelCacheStoreProducer<'data, E>

fn clone(&self) -> LevelCacheStoreProducer<'data, E>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'data, E: Debug + 'data + Element> Debug for LevelCacheStoreProducer<'data, E>

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<'data, E: 'data + Element> Producer for LevelCacheStoreProducer<'data, E>

type Item = E

The type of item that will be produced by this producer once it is converted into an iterator.

type IntoIter = LevelCacheIter<'data, E>

The type of iterator we will become.

fn into_iter(self) -> Self::IntoIter

Convert self into an iterator; at this point, no more parallel splits are possible.

fn split_at(self, index: usize) -> (Self, Self)

Split into two producers; one produces items 0..index, the other index..N. Index must be less than or equal to N.

fn min_len(&self) -> usize

The minimum number of items that we will process sequentially. Defaults to 1, which means that we will split all the way down to a single item. This can be raised higher using the [with_min_len] method, which will force us to create sequential tasks at a larger granularity. Note that Rayon automatically normally attempts to adjust the size of parallel splits to reduce overhead, so this should not be needed.

fn max_len(&self) -> usize

The maximum number of items that we will process sequentially. Defaults to MAX, which means that we can choose not to split at all. This can be lowered using the [with_max_len] method, which will force us to create more parallel tasks. Note that Rayon automatically normally attempts to adjust the size of parallel splits to reduce overhead, so this should not be needed.

fn fold_with<F>(self, folder: F) -> F where
    F: Folder<Self::Item>, 

Iterate the producer, feeding each element to folder, and stop when the folder is full (or all elements have been consumed).