Enum SparseOrdering 

pub enum SparseOrdering {
    Natural,
    MinDegreeSymmetric,
    MinDegreeNoDenseRows,
    MinDegreeAtA,
}

Fill-reducing ordering used by the sparse factorizations (SparseMat::cholsol, SparseMat::lusol, SparseMat::lu, SparseMat::qr); the integer order argument of the C functions.

Variants

Natural

Natural ordering (no permutation), order = 0.

MinDegreeSymmetric

Approximate minimum degree ordering of A + A', order = 1; the usual choice for Cholesky and LU of (nearly) symmetric matrices.

MinDegreeNoDenseRows

Minimum degree ordering of A' A after removing the dense rows of A, order = 2; good for LU of unsymmetric matrices.

MinDegreeAtA

Minimum degree ordering of A' A, order = 3; the usual choice for QR.

Trait Implementations

impl Clone for SparseOrdering

fn clone(&self) -> SparseOrdering

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for SparseOrdering

impl Debug for SparseOrdering

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

Formats the value using the given formatter.

impl Default for SparseOrdering

fn default() -> SparseOrdering

Returns the “default value” for a type.

impl Eq for SparseOrdering

impl Hash for SparseOrdering

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for SparseOrdering

fn eq(&self, other: &SparseOrdering) -> 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 StructuralPartialEq for SparseOrdering