Struct Cache 

pub struct Cache<I: Iterator> { /* private fields */ }

Cache that works with iterator-like structures. Note that all operations are const since there are no user-facing mutations.

Implementations

impl<I: Iterator> Cache<I>

pub fn new<II: IntoIterator<IntoIter = I>>(into_iter: II) -> Self

Initialize a new empty cache.

pub fn is_empty(&self) -> bool

Whether this cache holds any cached elements.

pub fn get(&mut self, index: usize) -> Option<&I::Item>

If not already cached, repeatedly call next until we either reach index or next returns None. Immutably borrow this entire Cache for the duration of your returned reference.

Trait Implementations

impl<I: Clone + Iterator> Clone for Cache<I>

where I::Item: Clone,

fn clone(&self) -> Cache<I>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<I: Debug + Iterator> Debug for Cache<I>

where I::Item: Debug,

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

Formats the value using the given formatter.

impl<I: Default + Iterator> Default for Cache<I>

where I::Item: Default,

fn default() -> Cache<I>

Returns the “default value” for a type.

impl<I: Hash + Iterator> Hash for Cache<I>

where I::Item: Hash,

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<I: Ord + Iterator> Ord for Cache<I>

where I::Item: Ord,

fn cmp(&self, other: &Cache<I>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<I: PartialEq + Iterator> PartialEq for Cache<I>

where I::Item: PartialEq,

fn eq(&self, other: &Cache<I>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<I: PartialOrd + Iterator> PartialOrd for Cache<I>

where I::Item: PartialOrd,

fn partial_cmp(&self, other: &Cache<I>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<I: Eq + Iterator> Eq for Cache<I>

where I::Item: Eq,

impl<I: Iterator> StructuralPartialEq for Cache<I>