pub struct RowID<A: Scalar> { /* private fields */ }
Expand description
Store a Row Interpolative Decomposition
Trait Implementations§
Source§impl RowIDTraits for RowID<c32>
impl RowIDTraits for RowID<c32>
type A = Complex<f32>
Source§fn get_x(&self) -> ArrayView2<'_, Self::A>
fn get_x(&self) -> ArrayView2<'_, Self::A>
Return the X matrix
Source§fn get_r(&self) -> ArrayView2<'_, Self::A>
fn get_r(&self) -> ArrayView2<'_, Self::A>
Return the R matrix
Source§fn get_row_ind(&self) -> ArrayView1<'_, usize>
fn get_row_ind(&self) -> ArrayView1<'_, usize>
Return the index vector
fn get_x_mut(&mut self) -> ArrayViewMut2<'_, Self::A>
fn get_r_mut(&mut self) -> ArrayViewMut2<'_, Self::A>
fn get_row_ind_mut(&mut self) -> ArrayViewMut1<'_, usize>
Source§fn new(x: Array2<Self::A>, r: Array2<Self::A>, row_ind: Array1<usize>) -> Self
fn new(x: Array2<Self::A>, r: Array2<Self::A>, row_ind: Array1<usize>) -> Self
Return a row interpolative decomposition from given component matrices $X$ and
$R$ and index array row_ind.
Source§fn two_sided_id(&self) -> Result<TwoSidedID<Self::A>>
fn two_sided_id(&self) -> Result<TwoSidedID<Self::A>>
Convert the row interpolative decomposition into a two sided interpolative decomposition
Source§impl RowIDTraits for RowID<c64>
impl RowIDTraits for RowID<c64>
type A = Complex<f64>
Source§fn get_x(&self) -> ArrayView2<'_, Self::A>
fn get_x(&self) -> ArrayView2<'_, Self::A>
Return the X matrix
Source§fn get_r(&self) -> ArrayView2<'_, Self::A>
fn get_r(&self) -> ArrayView2<'_, Self::A>
Return the R matrix
Source§fn get_row_ind(&self) -> ArrayView1<'_, usize>
fn get_row_ind(&self) -> ArrayView1<'_, usize>
Return the index vector
fn get_x_mut(&mut self) -> ArrayViewMut2<'_, Self::A>
fn get_r_mut(&mut self) -> ArrayViewMut2<'_, Self::A>
fn get_row_ind_mut(&mut self) -> ArrayViewMut1<'_, usize>
Source§fn new(x: Array2<Self::A>, r: Array2<Self::A>, row_ind: Array1<usize>) -> Self
fn new(x: Array2<Self::A>, r: Array2<Self::A>, row_ind: Array1<usize>) -> Self
Return a row interpolative decomposition from given component matrices $X$ and
$R$ and index array row_ind.
Source§fn two_sided_id(&self) -> Result<TwoSidedID<Self::A>>
fn two_sided_id(&self) -> Result<TwoSidedID<Self::A>>
Convert the row interpolative decomposition into a two sided interpolative decomposition
Source§impl RowIDTraits for RowID<f32>
impl RowIDTraits for RowID<f32>
type A = f32
Source§fn get_x(&self) -> ArrayView2<'_, Self::A>
fn get_x(&self) -> ArrayView2<'_, Self::A>
Return the X matrix
Source§fn get_r(&self) -> ArrayView2<'_, Self::A>
fn get_r(&self) -> ArrayView2<'_, Self::A>
Return the R matrix
Source§fn get_row_ind(&self) -> ArrayView1<'_, usize>
fn get_row_ind(&self) -> ArrayView1<'_, usize>
Return the index vector
fn get_x_mut(&mut self) -> ArrayViewMut2<'_, Self::A>
fn get_r_mut(&mut self) -> ArrayViewMut2<'_, Self::A>
fn get_row_ind_mut(&mut self) -> ArrayViewMut1<'_, usize>
Source§fn new(x: Array2<Self::A>, r: Array2<Self::A>, row_ind: Array1<usize>) -> Self
fn new(x: Array2<Self::A>, r: Array2<Self::A>, row_ind: Array1<usize>) -> Self
Return a row interpolative decomposition from given component matrices $X$ and
$R$ and index array row_ind.
Source§fn two_sided_id(&self) -> Result<TwoSidedID<Self::A>>
fn two_sided_id(&self) -> Result<TwoSidedID<Self::A>>
Convert the row interpolative decomposition into a two sided interpolative decomposition
Source§impl RowIDTraits for RowID<f64>
impl RowIDTraits for RowID<f64>
type A = f64
Source§fn get_x(&self) -> ArrayView2<'_, Self::A>
fn get_x(&self) -> ArrayView2<'_, Self::A>
Return the X matrix
Source§fn get_r(&self) -> ArrayView2<'_, Self::A>
fn get_r(&self) -> ArrayView2<'_, Self::A>
Return the R matrix
Source§fn get_row_ind(&self) -> ArrayView1<'_, usize>
fn get_row_ind(&self) -> ArrayView1<'_, usize>
Return the index vector
fn get_x_mut(&mut self) -> ArrayViewMut2<'_, Self::A>
fn get_r_mut(&mut self) -> ArrayViewMut2<'_, Self::A>
fn get_row_ind_mut(&mut self) -> ArrayViewMut1<'_, usize>
Source§fn new(x: Array2<Self::A>, r: Array2<Self::A>, row_ind: Array1<usize>) -> Self
fn new(x: Array2<Self::A>, r: Array2<Self::A>, row_ind: Array1<usize>) -> Self
Return a row interpolative decomposition from given component matrices $X$ and
$R$ and index array row_ind.
Source§fn two_sided_id(&self) -> Result<TwoSidedID<Self::A>>
fn two_sided_id(&self) -> Result<TwoSidedID<Self::A>>
Convert the row interpolative decomposition into a two sided interpolative decomposition
Auto Trait Implementations§
impl<A> Freeze for RowID<A>
impl<A> RefUnwindSafe for RowID<A>where
A: RefUnwindSafe,
impl<A> Send for RowID<A>where
A: Send,
impl<A> Sync for RowID<A>where
A: Sync,
impl<A> Unpin for RowID<A>
impl<A> UnwindSafe for RowID<A>where
A: RefUnwindSafe,
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> 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 more