Skip to main content

WindowedIterState

Struct WindowedIterState 

Source
pub struct WindowedIterState<I, T> {
    len: usize,
    iter: RefCell<Option<I>>,
    consumed: RefCell<usize>,
    window: RefCell<Vec<T>>,
    window_start: RefCell<usize>,
    window_size: usize,
    materialized: OnceLock<Vec<T>>,
}
Expand description

Core state for windowed iterator-backed ALTREP vectors.

Like super::IterState, but only keeps a sliding window of elements in memory. Access within the window is O(1), and reading past it slides the window forward. The iterator cannot be rewound, so reading an element that has left the window is an error. Use super::IterState when R may read elements again or out of order.

This is useful for large iterators where only a small region is accessed at a time (e.g., streaming data processed in order).

§Type Parameters

  • I: The iterator type
  • T: The element type produced by the iterator

Fields§

§len: usize§iter: RefCell<Option<I>>§consumed: RefCell<usize>§window: RefCell<Vec<T>>§window_start: RefCell<usize>§window_size: usize§materialized: OnceLock<Vec<T>>

Implementations§

Source§

impl<I, T> WindowedIterState<I, T>
where I: Iterator<Item = T>, T: Copy,

Source

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

Create a new windowed iterator state.

Source

pub fn get_element(&self, i: usize) -> Option<T>

Get element at index i.

Source

fn advance_to(&self, i: usize)

Advance the iterator to fill a window containing index i.

Source

pub fn materialize_all(&self) -> &[T]

Materialize all elements.

§Panics

If elements have already left the window, or if the iterator ends before the declared length.

Source

pub fn as_materialized(&self) -> Option<&[T]>

Get materialized slice if available.

Source

pub fn len(&self) -> usize

Get the length.

Source

pub fn is_empty(&self) -> bool

Check if empty.

Source§

impl<I, T> WindowedIterState<I, T>
where I: ExactSizeIterator<Item = T>, T: Copy,

Source

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

Create from an ExactSizeIterator.

Auto Trait Implementations§

§

impl<I, T> !Freeze for WindowedIterState<I, T>

§

impl<I, T> !RefUnwindSafe for WindowedIterState<I, T>

§

impl<I, T> !Sync for WindowedIterState<I, T>

§

impl<I, T> Send for WindowedIterState<I, T>
where RefCell<Option<I>>: Send, RefCell<Vec<T>>: Send, OnceLock<Vec<T>>: Send,

§

impl<I, T> Unpin for WindowedIterState<I, T>

§

impl<I, T> UnsafeUnpin for WindowedIterState<I, T>

§

impl<I, T> UnwindSafe for WindowedIterState<I, T>

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

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

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

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

Source§

impl<T> SizeHint for T
where T: ?Sized,

Source§

default fn lower_bound(&self) -> usize

🔬This is a nightly-only experimental API. (core_io_internals)
Returns a lower bound on the number of elements this container-like item contains. For example, an array [u8; 12] could return any value between 0 and 12 inclusively as a correct implementation. Read more
Source§

default fn upper_bound(&self) -> Option<usize>

🔬This is a nightly-only experimental API. (core_io_internals)
Returns an upper bound on the number of elements this container-like item contains if it can be determined, otherwise None. Read more
Source§

final fn size_hint(&self) -> (usize, Option<usize>)

🔬This is a nightly-only experimental API. (core_io_internals)
Returns an estimate for the number of elements this container like type contains. Read more
Source§

impl<T> SizedTypeProperties for T

Source§

#[doc(hidden)]
const SIZE: usize = _

🔬This is a nightly-only experimental API. (sized_type_properties)
Source§

#[doc(hidden)]
const ALIGN: usize = _

🔬This is a nightly-only experimental API. (sized_type_properties)
Source§

#[doc(hidden)]
const ALIGNMENT: Alignment = _

🔬This is a nightly-only experimental API. (ptr_alignment_type)
Source§

#[doc(hidden)]
const IS_ZST: bool = _

🔬This is a nightly-only experimental API. (sized_type_properties)
true if this type requires no storage. false if its size is greater than zero. Read more
Source§

#[doc(hidden)]
const LAYOUT: Layout = _

🔬This is a nightly-only experimental API. (sized_type_properties)
Source§

#[doc(hidden)]
const MAX_SLICE_LEN: usize = _

🔬This is a nightly-only experimental API. (sized_type_properties)
The largest safe length for a [Self]. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = !

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.

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.