Share Hash Tables With Stable Key Hints Stored In Memory Mapped Files Between Arbitrary Processes
-
Updated
Dec 23, 2020 - C
Share Hash Tables With Stable Key Hints Stored In Memory Mapped Files Between Arbitrary Processes
Remap, mask, renumber, unique, and in-place transposition of 3D labeled images. Point cloud too.
✏️ Inplace - An inplace editor
A simple iterative variant of QuickSort that uses O(1) space for all inputs
Synchronous formatter runner for Neovim using in-place formatters. No stdin support.
In-place file processing
Invertible transformations on permutation representations, including an RNG-free in-place Fisher-Yates-Knuth shuffle https://www.npmjs.com/package/factoradic
Invoke a function for each element in a collection and update the collection in-place.
Invoke a function for each element in a collection and update the collection in-place.
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.
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.
Add a description, image, and links to the in-place topic page so that developers can more easily learn about it.
To associate your repository with the in-place topic, visit your repo's landing page and select "manage topics."