pub struct IterComplexData<I>{
state: IterState<I, Rcomplex>,
}Expand description
Iterator-backed complex number vector data adaptor.
Wraps an iterator producing Rcomplex values and implements the data-level
traits (AltrepLen + AltComplexData) for backing an ALTREP complex
vector. To expose it to R, wrap it in a #[derive(AltrepComplex)] +
#[altrep(manual)] struct (see the module docs).
§Example
ⓘ
use miniextendr_api::altrep_data::IterComplexData;
use miniextendr_api::Rcomplex;
let iter = (0..5).map(|x| Rcomplex { r: x as f64, i: (x * 2) as f64 });
let data = IterComplexData::from_iter(iter, 5);Fields§
§state: IterState<I, Rcomplex>Implementations§
Source§impl<I> IterComplexData<I>
impl<I> IterComplexData<I>
Source§impl<I> IterComplexData<I>where
I: ExactSizeIterator<Item = Rcomplex>,
impl<I> IterComplexData<I>where
I: ExactSizeIterator<Item = Rcomplex>,
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> AltComplexData for IterComplexData<I>
impl<I> AltComplexData for IterComplexData<I>
Auto Trait Implementations§
impl<I> !Freeze for IterComplexData<I>
impl<I> !RefUnwindSafe for IterComplexData<I>
impl<I> !Sync for IterComplexData<I>
impl<I> Send for IterComplexData<I>where
I: Send,
impl<I> Unpin for IterComplexData<I>where
I: Unpin,
impl<I> UnsafeUnpin for IterComplexData<I>where
I: UnsafeUnpin,
impl<I> UnwindSafe for IterComplexData<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.