Struct MultiSort 

pub struct MultiSort<S> { /* private fields */ }

The core part of crate::ChunkedJoiner implementing the multiple sorting algorithm for short binary sketches.

Complexities

The time and memory complexities are linear in the input and output size.

References

• Uno. Multi-sorting algorithm for finding pairs of similar short substrings from large-scale string data. Knowl Inf Syst 25, 229–251 (2010).

Implementations

impl<S> MultiSort<S>

where S: Sketch,

pub const fn new() -> Self

Creates an instance.

pub fn num_blocks(self, num_blocks: usize) -> Self

Sets the number of blocks.

pub const fn threshold_in_sort(self, threshold_in_sort: usize) -> Self

Sets the size threshold for partial sorting. If the partial size is smaller than the threshold, a quicksort is used; otherwise, a radix sort is used.

pub fn similar_pairs( self, sketches: &[S], radius: usize, results: &mut HashSet<(usize, usize)>, )

Finds all similar pairs whose Hamming distance is within radius, inserting the results in a given hash table.

Trait Implementations

impl<S: Clone> Clone for MultiSort<S>

fn clone(&self) -> MultiSort<S>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<S: Debug> Debug for MultiSort<S>

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

Formats the value using the given formatter.

impl<S> Default for MultiSort<S>

where S: Sketch,

fn default() -> Self

Returns the “default value” for a type.