pub struct HashSort;Expand description
Hash-based random sort with O(n) complexity
Implementations§
Source§impl HashSort
impl HashSort
Sourcepub fn hash_sort<T: Clone>(
lines: &mut [T],
get_key: impl Fn(&T) -> &[u8] + Sync,
)
pub fn hash_sort<T: Clone>( lines: &mut [T], get_key: impl Fn(&T) -> &[u8] + Sync, )
Hash-based grouping with zero-copy shuffling O(n) complexity instead of O(n log n)
Auto Trait Implementations§
impl Freeze for HashSort
impl RefUnwindSafe for HashSort
impl Send for HashSort
impl Sync for HashSort
impl Unpin for HashSort
impl UnwindSafe for HashSort
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more