pub struct WindowedIterIntData<I: Iterator<Item = i32>> {
state: WindowedIterState<I, i32>,
}Expand description
Windowed iterator-backed integer vector data adaptor.
Like super::IterIntData, 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, i32>Implementations§
Source§impl<I: Iterator<Item = i32>> WindowedIterIntData<I>
impl<I: Iterator<Item = i32>> WindowedIterIntData<I>
Source§impl<I: ExactSizeIterator<Item = i32>> WindowedIterIntData<I>
impl<I: ExactSizeIterator<Item = i32>> WindowedIterIntData<I>
Sourcepub fn from_exact_iter(iter: I, window_size: usize) -> Self
pub fn from_exact_iter(iter: I, window_size: usize) -> Self
Create from an ExactSizeIterator with window size (length auto-detected).
Trait Implementations§
Source§impl<I: Iterator<Item = i32>> AltIntegerData for WindowedIterIntData<I>
impl<I: Iterator<Item = i32>> AltIntegerData for WindowedIterIntData<I>
Source§fn as_slice(&self) -> Option<&[i32]>
fn as_slice(&self) -> Option<&[i32]>
Optional: return a pointer to contiguous data if available.
Default returns None (no contiguous backing).
Source§fn get_region(&self, start: usize, len: usize, buf: &mut [i32]) -> usize
fn get_region(&self, start: usize, len: usize, buf: &mut [i32]) -> usize
Optional: bulk read into buffer. Returns number of elements read. Read more
Source§fn is_sorted(&self) -> Option<Sortedness>
fn is_sorted(&self) -> Option<Sortedness>
Optional: sortedness hint. Default is unknown.
Source§fn sum(&self, _na_rm: bool) -> Option<i64>
fn sum(&self, _na_rm: bool) -> Option<i64>
Optional: optimized sum. Default returns None (use R’s default).
Auto Trait Implementations§
impl<I> !Freeze for WindowedIterIntData<I>
impl<I> !RefUnwindSafe for WindowedIterIntData<I>
impl<I> !Sync for WindowedIterIntData<I>
impl<I> Send for WindowedIterIntData<I>where
I: Send,
impl<I> Unpin for WindowedIterIntData<I>where
I: Unpin,
impl<I> UnsafeUnpin for WindowedIterIntData<I>where
I: UnsafeUnpin,
impl<I> UnwindSafe for WindowedIterIntData<I>where
I: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> SizeHint for Twhere
T: ?Sized,
impl<T> SizeHint for Twhere
T: ?Sized,
Source§default fn lower_bound(&self) -> usize
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 moreSource§impl<T> SizedTypeProperties for T
impl<T> SizedTypeProperties for T
Source§#[doc(hidden)]const SIZE: usize = _
#[doc(hidden)]const SIZE: usize = _
🔬This is a nightly-only experimental API. (
sized_type_properties)Source§#[doc(hidden)]const ALIGN: usize = _
#[doc(hidden)]const ALIGN: usize = _
🔬This is a nightly-only experimental API. (
sized_type_properties)Source§#[doc(hidden)]const ALIGNMENT: Alignment = _
#[doc(hidden)]const ALIGNMENT: Alignment = _
🔬This is a nightly-only experimental API. (
ptr_alignment_type)Source§#[doc(hidden)]const IS_ZST: bool = _
#[doc(hidden)]const IS_ZST: bool = _
🔬This is a nightly-only experimental API. (
sized_type_properties)Source§#[doc(hidden)]const LAYOUT: Layout = _
#[doc(hidden)]const LAYOUT: Layout = _
🔬This is a nightly-only experimental API. (
sized_type_properties)Source§#[doc(hidden)]const MAX_SLICE_LEN: usize = _
#[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 moreLayout§
Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.