pub struct IterIntCoerceData<I, T>{
state: IterState<I, T>,
}Expand description
Iterator-backed integer vector data adaptor with coercion from any integer-like type.
Wraps an iterator producing values that coerce to i32 (e.g., u16, i8, etc.)
and implements the data-level traits (AltrepLen + AltIntegerData).
To expose it to R, wrap it in a #[derive(AltrepInteger)] +
#[altrep(manual)] struct (see the module docs).
§Example
ⓘ
use miniextendr_api::altrep_data::IterIntCoerceData;
// Create from an iterator of u16 values
let iter = (0..10u16).map(|x| x * 100);
let data = IterIntCoerceData::from_iter(iter, 10);
// Values are coerced from u16 to i32 when accessedFields§
§state: IterState<I, T>Implementations§
Source§impl<I, T> IterIntCoerceData<I, T>
impl<I, T> IterIntCoerceData<I, T>
Source§impl<I, T> IterIntCoerceData<I, T>
impl<I, T> IterIntCoerceData<I, T>
Sourcepub fn from_exact_iter(iter: I) -> Self
pub fn from_exact_iter(iter: I) -> Self
Create from an ExactSizeIterator (length auto-detected).
Trait Implementations§
Source§impl<I, T> AltIntegerData for IterIntCoerceData<I, T>
impl<I, T> AltIntegerData for IterIntCoerceData<I, T>
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, T> !Freeze for IterIntCoerceData<I, T>
impl<I, T> !RefUnwindSafe for IterIntCoerceData<I, T>
impl<I, T> !Sync for IterIntCoerceData<I, T>
impl<I, T> Send for IterIntCoerceData<I, T>
impl<I, T> Unpin for IterIntCoerceData<I, T>
impl<I, T> UnsafeUnpin for IterIntCoerceData<I, T>where
I: UnsafeUnpin,
impl<I, T> UnwindSafe for IterIntCoerceData<I, T>where
I: UnwindSafe,
T: 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.