API Reference inplace v#0.7.1

BitSet is close in functionality to MapSet with integer values as members. The main difference is that BitSet has lower and upper bounds for set values that have to be defined at the time of creation (see new/2).

Implementation of Exact Cover. Based on https://arxiv.org/pdf/cs/0011047 by Donald Knuth. Modified to use "dancing cells" instead of "dancing links" for Dancing cells, see YouTube: "Stanford Lecture: Dr. Don Knuth - Dancing Cells (2023)"

https://en.wikipedia.org/wiki/Josephus_problem

Sudoku puzzle. The instance of puzzle is a string of DxD length , where D is a dimension of Sudoku puzzle (would be 9 by default). The values 1 to 9 represent pre-filled cells (clues, givens etc...); any other values represent hidden cells.

Binary heap. NOTE

Singly linked list The data entries are stored as integers. They will be interpreted (as references) by the calling application. Note: indices are 1-based. Options

Sparse set implementation based on https://youtu.be/PUJ_XdmSDZw?si=41ySCBvOdoNCV-zR