[x] Fine tune R.BITPOS (210 μs), since it's significantly slower than BITPOS (45 μs) because there is no direct way to know the N-th non existent element on a CRoaring, and we are currently inverting the bitmap and finding the N-th existent element (in our case N=1)
Add more performance tests.
TODO:
R.BITPOS
(210 μs), since it's significantly slower thanBITPOS
(45 μs) because there is no direct way to know the N-th non existent element on a CRoaring, and we are currently inverting the bitmap and finding the N-th existent element (in our case N=1)