Struct WindowedIterRealData 

pub struct WindowedIterRealData<I: Iterator<Item = f64>> {
    state: WindowedIterState<I, f64>,
}

Windowed iterator-backed real (f64) vector data adaptor.

Like super::IterRealData, but only keeps a sliding window of elements in memory. Sequential forward access within the window is O(1). Access outside the window triggers full materialization.

Fields

state: WindowedIterState<I, f64>

Implementations

impl<I: Iterator<Item = f64>> WindowedIterRealData<I>

pub fn from_iter(iter: I, len: usize, window_size: usize) -> Self

Create from an iterator with explicit length and window size.

impl<I: ExactSizeIterator<Item = f64>> WindowedIterRealData<I>

pub fn from_exact_iter(iter: I, window_size: usize) -> Self

Create from an ExactSizeIterator with window size (length auto-detected).

Trait Implementations

impl<I: Iterator<Item = f64>> AltRealData for WindowedIterRealData<I>

fn elt(&self, i: usize) -> f64

Get the real element at index i.

fn as_slice(&self) -> Option<&[f64]>

Optional: return a pointer to contiguous data if available.

fn get_region(&self, start: usize, len: usize, buf: &mut [f64]) -> usize

Optional: bulk read into buffer (clamped to available data).

fn is_sorted(&self) -> Option<Sortedness>

Optional: sortedness hint.

fn no_na(&self) -> Option<bool>

Optional: does this vector contain any NA values?

fn sum(&self, _na_rm: bool) -> Option<f64>

Optional: optimized sum.

fn min(&self, _na_rm: bool) -> Option<f64>

Optional: optimized min.

fn max(&self, _na_rm: bool) -> Option<f64>

Optional: optimized max.

impl<I: Iterator<Item = f64>> AltrepLen for WindowedIterRealData<I>

fn len(&self) -> usize

Returns the length of this ALTREP vector.

fn is_empty(&self) -> bool

Returns true if the vector is empty.

Layout

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.