in-place
There are 29 repositories under in-place topic.
simonhf/sharedhashfile
Share Hash Tables With Stable Key Hints Stored In Memory Mapped Files Between Arbitrary Processes
scandum/crumsort
A branchless unstable quicksort / mergesort that is highly adaptive.
SaschaWitt/ips4o
In-place Parallel Super Scalar Samplesort (IPS⁴o)
seung-lab/fastremap
Remap, mask, renumber, unique, and in-place transposition of 3D labeled images. Point cloud too.
jwodder/inplace
In-place file processing in Python
ips4o/ips2ra
In-place Parallel Super Scalar Radix Sort (IPS²Ra)
wbotelhos/inplace
:pencil2: Inplace - An inplace editor
CarlosLunaMota/MedianSort
A simple iterative variant of QuickSort that uses O(1) space for all inputs
ips4o/ips4o-benchmark-suite
In-place Parallel Super Scalar Samplesort (IPS⁴o) Benchmark Suite
jwodder/in-place-rs
In-place file processing
mgnsk/sync-format.nvim
Synchronous formatter runner for Neovim using in-place formatters. No stdin support.
hanzhi713/bitonic-sort
In-place GPU sort with bitonic sort
ips4o/ps4o
Parallel Super Scalar Samplesort (PS⁴o)
RmbRT/base64
Base64 encoding/decoding library
stdlib-js/utils-async-inmap
Invoke a function for each element in a collection and update the collection in-place.
stdlib-js/utils-async-inmap-right
Invoke a function for each element in a collection and update the collection in-place, iterating from right to left.
stdlib-js/utils-inmap
Invoke a function for each element in a collection and update the collection in-place.
stdlib-js/utils-inmap-right
Invoke a function for each element in a collection and update the collection in-place, iterating from right to left.
0joshuaolson1/factoradic
Invertible transformations on permutation representations, including an RNG-free in-place Fisher-Yates-Knuth shuffle https://www.npmjs.com/package/factoradic
cermi29/ParallelStableSort
A parallel stable sort using arbitrary extra memory
Dantali0n/oCLFFT
OpenCL Fast Fourier Transform using cooley-tukey in-place bit-reversal algorithm with lookup tables.
kroppel/algorithm_engineering
Header-Only-Library providing functions that perform parallel in-place Partitioning, Quickselect and Quicksort
a-x-/react-edit-in-place
3 Modes edit-in-place component: static, active, pending. Can cancel changes.
b1gb4dw0lf/heap-sort
Heap sort is a time and space efficient comparison-based algorithm
Flanlaina/BlockTimSort
A stable, adaptive block merge sort.
iagustsson/leonardoheap
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.
ozguramac/penr-oz-trick-one
Trick Question about transforming a matrix in-place
xiaoxiae/inline-bfs-dfs-presentation
A source code to a presentation regarding in-line BFS and DFS in linear time.