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
Currently implemented:
- arrays
- stacks
- queues
- heaps
- priority queues
- linked lists
- bitsets
Check out the implementation of X algorithm by Donald Knuth, accompanied by the implementation of Sudoku as an example of usage. X algorithm is built on the idea of Dancing Links, which is a technique to modify linked lists in place.