BitSlotMaps a non growable bunch of bits and are identical to BitVectors#1.3.6.1.4.1.33097.1.1.2, however, since they are often used from higher level languages they simply have b bits. In addition, they are fixed in size at the time of creation. Additionally they can be converted to unsigned integers and compared to zero to identify when all b bits are equal to zero in O(1) time.
BinaryFractialRangeSearch#1.3.6.1.4.1.33097.0.1
I diferentiated from BitVectors#1.3.6.1.4.1.33097.1.1.2 here simply to ensure that they are not growable values after creation. This is mostly because of the Vector class in the Java language, which is growable and seems to break the Mathmatical Vector#1.3.6.1.4.1.33097.5.1 convention of having a end point (or not growing after definition / creation time). In addition, I wanted to narrow the scope of taxomony, since it looks like there are likely multiple interpretations of the BitVector term as of 2025.
This definition has no correlation with this project, and I’m sorry for the name overlap as they did use the term ‘Slot Map’ first; https://github.com/orlp/slotmap?tab=readme-ov-file https://docs.rs/slotmap/latest/slotmap/
However, it is cool that they are doing some similar stuff as far as I can tell at first glance.
It came down to SlotMap or ArrayMap and both were taken ;( https://developer.android.com/reference/android/util/ArrayMap
Then I decided to add the word Bit first -> viola BitSlotMaps to keep the taxonomy extra clean.
https://docs.oracle.com/en/java/javase/24/docs/api/java.base/java/util/Vector.html