CellFlatMap stores a constant number of elements and is immutable after creation stage.
Being immutable, the CellFlatMap can be implemented as array.
The actual array can be on- or off-heap and is implemented in concrete class derived from CellFlatMap.
The CellFlatMap uses no synchronization primitives, it is assumed to be created by a
single thread and then it can be read-only by multiple threads.
The "flat" in the name, means that the memory layout of the Map is sequential array and thus
requires less memory than ConcurrentSkipListMap.
Binary search for a given key in between given boundaries of the array.
Positive returned numbers mean the index.
Negative returned numbers means the key not found.
The absolute value of the output is the
possible insert index for the searched key
In twos-complement, (-1 * insertion point)-1 is the bitwise not of the insert point.
needle - The key to look for in all of the entries
Get the index of the given anchor key for creating subsequent set.
It doesn't matter whether the given key exists in the set or not.
taking into consideration whether
the key should be inclusive or exclusive.