#[repr(C)]pub struct PyArrayNeighborhoodIterObject {Show 21 fields
pub ob_base: PyObject,
pub nd_m1: c_int,
pub index: npy_intp,
pub size: npy_intp,
pub coordinates: [npy_intp; 32],
pub dims_m1: [npy_intp; 32],
pub strides: [npy_intp; 32],
pub backstrides: [npy_intp; 32],
pub factors: [npy_intp; 32],
pub ao: *mut PyArrayObject,
pub dataptr: *mut c_char,
pub contiguous: npy_bool,
pub bounds: [[npy_intp; 2]; 32],
pub limits: [[npy_intp; 2]; 32],
pub limits_sizes: [npy_intp; 32],
pub translate: npy_iter_get_dataptr_t,
pub nd: npy_intp,
pub dimensions: [npy_intp; 32],
pub _internal_iter: *mut PyArrayIterObject,
pub constant: *mut c_char,
pub mode: c_int,
}
Fields§
§ob_base: PyObject
§nd_m1: c_int
§index: npy_intp
§size: npy_intp
§coordinates: [npy_intp; 32]
§dims_m1: [npy_intp; 32]
§strides: [npy_intp; 32]
§backstrides: [npy_intp; 32]
§factors: [npy_intp; 32]
§ao: *mut PyArrayObject
§dataptr: *mut c_char
§contiguous: npy_bool
§bounds: [[npy_intp; 2]; 32]
§limits: [[npy_intp; 2]; 32]
§limits_sizes: [npy_intp; 32]
§translate: npy_iter_get_dataptr_t
§nd: npy_intp
§dimensions: [npy_intp; 32]
§_internal_iter: *mut PyArrayIterObject
§constant: *mut c_char
§mode: c_int
Auto Trait Implementations§
impl Freeze for PyArrayNeighborhoodIterObject
impl RefUnwindSafe for PyArrayNeighborhoodIterObject
impl !Send for PyArrayNeighborhoodIterObject
impl !Sync for PyArrayNeighborhoodIterObject
impl Unpin for PyArrayNeighborhoodIterObject
impl UnwindSafe for PyArrayNeighborhoodIterObject
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
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.