[−][src]Struct kodama::LinkageState

pub struct LinkageState<T> { /* fields omitted */ }

Mutable scratch space used by the linkage algorithms.

LinkageState is an opaque representation of mutable scratch space used by the linkage algorithms. It is provided only for callers who wish to amortize allocation using the with variants of the clustering functions. This may be useful when your requirements call for rapidly running hierarchical clustering on small dissimilarity matrices.

The memory used by LinkageState is proportional to the number of observations being clustered.

The T type parameter refers to the type of dissimilarity used in the pairwise matrix. In practice, T is a floating point type.

Implementations

impl<T: Float> LinkageState<T>[src]

pub fn new() -> LinkageState<T>[src]

Create a new mutable scratch space for use in the with variants of the clustering functions.

The clustering functions will automatically resize the scratch space as needed based on the number of observations being clustered.

Trait Implementations

impl<T: Debug> Debug for LinkageState<T>[src]

impl<T: Default> Default for LinkageState<T>[src]

Auto Trait Implementations

impl<T> RefUnwindSafe for LinkageState<T> where
    T: RefUnwindSafe, 

impl<T> Send for LinkageState<T> where
    T: Send, 

impl<T> Sync for LinkageState<T> where
    T: Sync, 

impl<T> Unpin for LinkageState<T> where
    T: Unpin, 

impl<T> UnwindSafe for LinkageState<T> where
    T: UnwindSafe, 

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, 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.