Packages
inplace
0.4.1
0.7.12
0.7.11
0.7.10
0.7.9
0.7.8
0.7.7
0.7.6
0.7.5
0.7.4
0.7.3
0.7.2
0.7.1
0.7.0
0.6.8
0.6.7
0.6.6
0.6.5
0.6.4
0.6.3
0.6.2
0.6.1
0.6.0
0.5.4
0.5.3
0.5.2
0.5.1
0.5.0
0.4.4
0.4.3
0.4.2
0.4.1
0.4.0
0.3.3
0.3.2
0.3.1
0.3.0
0.2.3
0.2.2
0.2.1
0.2.0
0.1.9
0.1.8
0.1.7
0.1.6
0.1.5
0.1.4
0.1.3
0.1.2
0.1.1
0.1.0
Mutable data structures
Current section
Files
Jump to
Current section
Files
README.md
# Inplace
Collection of mutable data structures.
Status: proof of concept, please use at your own risk.
An experimental library that has implementations of several ADTs based on [atomics module](https://www.erlang.org/doc/apps/erts/atomics.html)
Currently implemented:
- arrays
- stacks
- queues
- heaps
- priority queues
- linked lists
Check out the implementation of [X algorithm by Donald Knuth](https://en.wikipedia.org/wiki/Knuth%27s_Algorithm_X), accompanied by the [implementation of Sudoku]() as an example of usage.
[X algorithm](https://en.wikipedia.org/wiki/Knuth%27s_Algorithm_X) is built on the idea of [Dancing Links](https://en.wikipedia.org/wiki/Dancing_links), which is a technique to modify linked lists in place.