Trait AlgorithmContainer

pub trait AlgorithmContainer {
    type HeuristicKind<'a>: Heuristic<RngProvider = Self::RngKind<'a>>;
    type HeuristicContainer<'a, const N: usize>: AsRef<[usize]> + AsMut<[usize]>;
    type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize>: AsRef<[V]> + AsMut<[V]>;
    type RngKind<'a>: RngCore;
}

This trait represents the kind of containers that is required for a particular algorithm to function

Required Associated Types

type HeuristicKind<'a>: Heuristic<RngProvider = Self::RngKind<'a>>

type HeuristicContainer<'a, const N: usize>: AsRef<[usize]> + AsMut<[usize]>

Any kind of contiguous container

Examples

• [T; N]
• [T; 0]
• heapless::Vec<T, N>

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize>: AsRef<[V]> + AsMut<[V]>

Any kind of contiguous container (should not be ZST). R must also live as long as 'a

Examples

• [T; N]
• heaples::Vec<T, N>

type RngKind<'a>: RngCore

Any kind of RNG

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementors

impl AlgorithmContainer for QuickFind<Borrowed>

type HeuristicKind<'a> = NoHeuristic

type HeuristicContainer<'a, const N: usize> = [usize; 0]

type RepresentativeContainer<'a, R: VertexType + 'a, const N: usize> = &'a mut [R]

type RngKind<'a> = PhantomRng

impl AlgorithmContainer for QuickFind<Owned>

type HeuristicKind<'a> = NoHeuristic

type HeuristicContainer<'a, const N: usize> = [usize; 0]

type RepresentativeContainer<'a, R: VertexType + 'a, const N: usize> = [R; N]

type RngKind<'a> = PhantomRng

impl AlgorithmContainer for QuickUnion<ByRank<Owned>>

type HeuristicKind<'a> = ByRank

type HeuristicContainer<'a, const N: usize> = [usize; N]

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = [V; N]

type RngKind<'a> = PhantomRng

impl AlgorithmContainer for QuickUnion<BySize<Owned>>

type HeuristicKind<'a> = BySize

type HeuristicContainer<'a, const N: usize> = [usize; N]

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = [V; N]

type RngKind<'a> = PhantomRng

impl<R, const P: bool> AlgorithmContainer for QuickUnion<ByRandom<R>, P>

where R: RngCore,

type HeuristicKind<'a> = ByRandom<R>

type HeuristicContainer<'a, const N: usize> = [usize; 0]

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = [V; N]

type RngKind<'a> = R

impl<R, const P: bool> AlgorithmContainer for QuickUnion<ByRandom<R, Borrowed<Fat>>, P>

where R: RngCore,

type HeuristicKind<'a> = ByRandom<R, Borrowed>

type HeuristicContainer<'a, const N: usize> = &'a mut [usize]

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = &'a mut [V]

type RngKind<'a> = R

impl<R, const P: bool> AlgorithmContainer for QuickUnion<ByRandom<R, Borrowed<Thin>>, P>

where R: RngCore,

type HeuristicKind<'a> = ByRandom<R, Borrowed<Thin>>

type HeuristicContainer<'a, const N: usize> = &'a mut [usize]

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = &'a mut [V]

type RngKind<'a> = R

impl<const P: bool> AlgorithmContainer for QuickUnion<ByRank<Borrowed<Fat>>, P>

type HeuristicKind<'a> = ByRank<Borrowed>

type HeuristicContainer<'a, const N: usize> = &'a mut [usize]

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = &'a mut [V]

type RngKind<'a> = PhantomRng

impl<const P: bool> AlgorithmContainer for QuickUnion<ByRank<Borrowed<Thin>>, P>

type HeuristicKind<'a> = ByRank<Borrowed<Thin>>

type HeuristicContainer<'a, const N: usize> = &'a mut [usize; N]

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = &'a mut [V; N]

type RngKind<'a> = PhantomRng

impl<const P: bool> AlgorithmContainer for QuickUnion<BySize<Borrowed<Fat>>, P>

type HeuristicKind<'a> = BySize<Borrowed>

type HeuristicContainer<'a, const N: usize> = &'a mut [usize]

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = &'a mut [V]

type RngKind<'a> = PhantomRng

impl<const P: bool> AlgorithmContainer for QuickUnion<BySize<Borrowed<Thin>>, P>

type HeuristicKind<'a> = BySize<Borrowed<Thin>>

type HeuristicContainer<'a, const N: usize> = &'a mut [usize; N]

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = &'a mut [V; N]

type RngKind<'a> = PhantomRng

impl<const P: bool> AlgorithmContainer for QuickUnion<Unweighted<Borrowed<Fat>>, P>

type HeuristicKind<'a> = Unweighted<Borrowed>

type HeuristicContainer<'a, const N: usize> = [usize; 0]

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = &'a mut [V]

type RngKind<'a> = PhantomRng

impl<const P: bool> AlgorithmContainer for QuickUnion<Unweighted<Borrowed<Thin>>, P>

type HeuristicKind<'a> = Unweighted<Borrowed<Thin>>

type HeuristicContainer<'a, const N: usize> = [usize; 0]

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = &'a mut [V; N]

type RngKind<'a> = PhantomRng

impl<const P: bool> AlgorithmContainer for QuickUnion<Unweighted<Owned>, P>

type HeuristicKind<'a> = Unweighted

type HeuristicContainer<'a, const N: usize> = [usize; 0]

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = [V; N]

type RngKind<'a> = PhantomRng