Struct sprs::linalg::ordering::start::PseudoPeripheral[][src]

pub struct PseudoPeripheral();

This strategy employs an pseudoperipheral vertex finder as described by George and Liu. It is the most expensive strategy to compute, but typically results in the narrowest bandwidth.

Implementations

impl PseudoPeripheral[src]

pub fn new() -> Self[src]

Trait Implementations

impl Default for PseudoPeripheral[src]

impl<N, I, Iptr> Strategy<N, I, Iptr> for PseudoPeripheral where
    N: PartialEq,
    I: SpIndex,
    Iptr: SpIndex
[src]

Auto Trait Implementations

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<T> Pointable for T

type Init = T

The type for initializers.

impl<SS, SP> SupersetOf<SS> for SP where
    SS: SubsetOf<SP>, 
[src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.