Struct Getrs 

pub struct Getrs<TA, TB = TA> { /* private fields */ }

Typed LU solve operation.

Implementations

impl<TA, TB> Getrs<TA, TB>

where TA: DataTypeLike, TB: DataTypeLike,

pub const fn new( operation: Operation, n: usize, right_hand_sides: usize, ) -> Self

Creates a typed GETRS operation.

pub const fn operation(&self) -> Operation

Returns the operation applied to the factorized matrix.

pub const fn n(&self) -> usize

Returns the square factor dimension.

pub const fn right_hand_sides(&self) -> usize

Returns the number of right-hand sides.

pub fn run( &self, ctx: &Context, params: &Params, args: GetrsArgs<'_, TA, TB>, ) -> Result<()>

Solves the linear system in place.

Errors

Returns an error if inputs are invalid or if cuSOLVER reports a failure.

Trait Implementations

impl<TA: Clone, TB: Clone> Clone for Getrs<TA, TB>

fn clone(&self) -> Getrs<TA, TB>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<TA: Copy, TB: Copy> Copy for Getrs<TA, TB>

impl<TA: Debug, TB: Debug> Debug for Getrs<TA, TB>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<TA: Eq, TB: Eq> Eq for Getrs<TA, TB>

impl<TA: PartialEq, TB: PartialEq> PartialEq for Getrs<TA, TB>

fn eq(&self, other: &Getrs<TA, TB>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<TA: PartialEq, TB: PartialEq> StructuralPartialEq for Getrs<TA, TB>