Rank and select: Another lesson learned.

•We present new solutions for the primitives on binary vectors, ranks and select.•Special care for blocks with all 0 or all 1 bits poses a good space-time tradeoff.•Compressed select is not much slower than compressed rank in a similar space.