pub enum ImputationOrder {
Ascending,
Descending,
Roman,
Arabic,
}Expand description
Order in which features are imputed each round, mirroring scikit-learn’s
imputation_order (sklearn/impute/_iterative.py:126-134,
_get_ordered_idx:504-542). The 'random' variant (which requires a seeded
RNG, random_state) is not yet modeled — blocker #1407.
Variants§
Ascending
From features with fewest missing values to most (sklearn default,
argsort(frac_of_missing, kind="mergesort"), ties keep column order).
Descending
From features with most missing values to fewest (reversed ascending).
Roman
Left to right (column-index order, sklearn 'roman').
Arabic
Right to left (reversed column-index order, sklearn 'arabic').
Trait Implementations§
Source§impl Clone for ImputationOrder
impl Clone for ImputationOrder
Source§fn clone(&self) -> ImputationOrder
fn clone(&self) -> ImputationOrder
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreimpl Copy for ImputationOrder
Source§impl Debug for ImputationOrder
impl Debug for ImputationOrder
impl Eq for ImputationOrder
Source§impl PartialEq for ImputationOrder
impl PartialEq for ImputationOrder
Source§fn eq(&self, other: &ImputationOrder) -> bool
fn eq(&self, other: &ImputationOrder) -> bool
Tests for
self and other values to be equal, and is used by ==.impl StructuralPartialEq for ImputationOrder
Auto Trait Implementations§
impl Freeze for ImputationOrder
impl RefUnwindSafe for ImputationOrder
impl Send for ImputationOrder
impl Sync for ImputationOrder
impl Unpin for ImputationOrder
impl UnsafeUnpin for ImputationOrder
impl UnwindSafe for ImputationOrder
Blanket Implementations§
impl<T> Boilerplate for T
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T, U> Imply<T> for U
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Scalar for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§unsafe fn to_subset_unchecked(&self) -> SS
unsafe fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.