pub struct FnAdjointOperator<F, G> {
nrows: usize,
ncols: usize,
f: F,
g: G,
}Expand description
An operator and its transpose from two closures. Build with
from_fns.
Fields§
§nrows: usize§ncols: usize§f: F§g: GTrait Implementations§
Source§impl<T, F, G> AdjointOperator<T> for FnAdjointOperator<F, G>
impl<T, F, G> AdjointOperator<T> for FnAdjointOperator<F, G>
Source§fn apply_t_block(
&mut self,
x: MatRef<'_, T>,
y: MatMut<'_, T>,
) -> Result<(), OperatorError>
fn apply_t_block( &mut self, x: MatRef<'_, T>, y: MatMut<'_, T>, ) -> Result<(), OperatorError>
Block version; default loops over
AdjointOperator::apply_t. Read moreSource§impl<T, F, G> LinearOperator<T> for FnAdjointOperator<F, G>
impl<T, F, G> LinearOperator<T> for FnAdjointOperator<F, G>
Source§fn apply_block(
&mut self,
x: MatRef<'_, T>,
y: MatMut<'_, T>,
) -> Result<(), OperatorError>
fn apply_block( &mut self, x: MatRef<'_, T>, y: MatMut<'_, T>, ) -> Result<(), OperatorError>
Y ← A X for a block of columns; the default loops over
LinearOperator::apply. Dense and sparse implementations
override it (one pass over A for l columns — the cost that
matters in crate::rsvd()). Read moreAuto Trait Implementations§
impl<F, G> Freeze for FnAdjointOperator<F, G>
impl<F, G> RefUnwindSafe for FnAdjointOperator<F, G>where
F: RefUnwindSafe,
G: RefUnwindSafe,
impl<F, G> Send for FnAdjointOperator<F, G>
impl<F, G> Sync for FnAdjointOperator<F, G>
impl<F, G> Unpin for FnAdjointOperator<F, G>
impl<F, G> UnsafeUnpin for FnAdjointOperator<F, G>where
F: UnsafeUnpin,
G: UnsafeUnpin,
impl<F, G> UnwindSafe for FnAdjointOperator<F, G>where
F: UnwindSafe,
G: 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