Struct HilbertSort 

pub struct HilbertSort;

An implementation of hilbert sorting.

The implementation is ported from the original flatbush JavaScript library. The hilbert calculations are originally derived from a C++ implementation.

Trait Implementations

impl Clone for HilbertSort

fn clone(&self) -> HilbertSort

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for HilbertSort

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

Formats the value using the given formatter.

impl PartialEq for HilbertSort

fn eq(&self, other: &HilbertSort) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<N: IndexableNum> Sort<N> for HilbertSort

fn sort( params: &mut SortParams<N>, boxes: &mut [N], indices: &mut MutableIndices<'_>, )

Sort the mutable slice of boxes and indices.

impl Copy for HilbertSort

impl StructuralPartialEq for HilbertSort