Struct sprs::linalg::ordering::order::Reversed

source · 
pub struct Reversed<I: SpIndex> { /* private fields */ }
Expand description

Indicates the Cuthill-McKee ordering should be built in reverse order.

Implementations§

source§

impl<I: SpIndex> Reversed<I>

source

pub fn new() -> Self

Creates a new instance of this conceptual enum variant.

Trait Implementations§

source§

impl<I: Default + SpIndex> Default for Reversed<I>

source§

fn default() -> Reversed<I>

Returns the “default value” for a type. Read more
source§

impl<I: SpIndex> DirectedOrdering<I> for Reversed<I>

source§

fn prepare(&mut self, nb_vertices: usize)

Prepares this directed ordering for working with the specified number of vertices.
source§

fn add_transposition(&mut self, vertex_index: usize)

Adds a new vertex_index as computed in the algorithms main loop.
source§

fn add_component_delimeter(&mut self, index: usize)

Adds an index indicating the start of a new connected component.
source§

fn into_ordering(self) -> Ordering<I>

Transforms this directed ordering into an ordering to return from the algorithm.

Auto Trait Implementations§

§

impl<I> RefUnwindSafe for Reversed<I>where I: RefUnwindSafe,

§

impl<I> Send for Reversed<I>

§

impl<I> Sync for Reversed<I>

§

impl<I> Unpin for Reversed<I>where I: Unpin,

§

impl<I> UnwindSafe for Reversed<I>where I: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

§

impl<T> Pointable for T

§

const ALIGN: usize = mem::align_of::<T>()

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,

source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
source§

unsafe fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

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

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.