Share Hash Tables With Stable Key Hints Stored In Memory Mapped Files Between Arbitrary Processes

A branchless unstable quicksort / mergesort that is highly adaptive.

In-place Parallel Super Scalar Samplesort (IPS⁴o)

Remap, mask, renumber, unique, and in-place transposition of 3D labeled images. Point cloud too.

In-place Parallel Super Scalar Radix Sort (IPS²Ra)

In-place file processing in Python

✏️ Inplace - An inplace editor

A simple iterative variant of QuickSort that uses O(1) space for all inputs

In-place Parallel Super Scalar Samplesort (IPS⁴o) Benchmark Suite

In-place file processing

Synchronous formatter runner for Neovim using in-place formatters. No stdin support.

In-place GPU sort with bitonic sort

Extension traits for `String` and `&str`

Invoke a function for each element in a collection and update the collection in-place.

Parallel Super Scalar Samplesort (PS⁴o)

Invoke a function for each element in a collection and update the collection in-place, iterating from right to left.

Base64 encoding/decoding library

Invoke a function for each element in a collection and update the collection in-place, iterating from right to left.

Invoke a function for each element in a collection and update the collection in-place.

Leonardo heap is the implicit data structure that uses only O(1) auxiliary data to implement smoothsort, an in-place algorithm offering average performance of O(n⋅log(n)) and O(n) in the best-case.