Struct `Iter`

struct Iter<'a, T: 'a + Counter> { ... }

An iterator that will yield at log-size steps through the histogram's value range.

Implementations

`impl<'a, T: 'a + Counter> Iter<'a, T>`

fn new(hist: &'a Histogram<T>, value_units_in_first_bucket: u64, log_base: f64) -> HistogramIterator<'a, T, Iter<'a, T>>: Construct a new logarithmic iterator. See Histogram::iter_log for details.

`impl<'a, T> Freeze for Iter<'a, T>`

`impl<'a, T> RefUnwindSafe for Iter<'a, T>`

`impl<'a, T> Send for Iter<'a, T>`

`impl<'a, T> Sync for Iter<'a, T>`

`impl<'a, T> Unpin for Iter<'a, T>`

`impl<'a, T> UnsafeUnpin for Iter<'a, T>`

`impl<'a, T> UnwindSafe for Iter<'a, T>`

`impl<'a, T: 'a + Counter> PickyIterator for Iter<'a, T>`

fn pick(self: &mut Self, index: usize, _: u64, _: T) -> Option<PickMetadata>
fn more(self: &mut Self, index_to_pick: usize) -> bool

`impl<T> Any for Iter<'a, T>`

fn type_id(self: &Self) -> TypeId

`impl<T> Borrow for Iter<'a, T>`

fn borrow(self: &Self) -> &T

`impl<T> BorrowMut for Iter<'a, T>`

fn borrow_mut(self: &mut Self) -> &mut T

`impl<T> From for Iter<'a, T>`

fn from(t: T) -> T: Returns the argument unchanged.

`impl<T, U> Into for Iter<'a, T>`

fn into(self: Self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of [From]<T> for U chooses to do.

`impl<T, U> TryFrom for Iter<'a, T>`

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

`impl<T, U> TryInto for Iter<'a, T>`

fn try_into(self: Self) -> Result<U, <U as TryFrom<T>>::Error>