[WIP] Improve the performance of roaring bitmap under sparse cases

[stdpain]

for #319

[johnmay]

Looks good, I do this on a local implementation but with 4 values ands the type indicating the cardinality. I only need contains/insert so much simpler. Was poking around to see if anyone had the same idea.

I guess the restriction to 3 values to keep the format the same/reused the array container intersections/union etc? More work but I imagine someone would come along and squeeze out that extra value out eventually. API also gets uglier, e.g.:

bool array_bitset_container_intersect(const array_container_t *src_1,
                                                                 const bitset_container_t *src_2);

bool array_bitset_container_intersect(const uint16_t *src_1,
                                                                 const uint16_t *src_2,
                                                                 const uint16_t size_1,
                                                                 const uint16_t size_2);

[lemire]

This PR needs to be updated to be considered as some of our internal code changed. The updates appear small. Adding a new container type is a significant burden and it needs to be justify thoroughly. It adds significant complexity and it may lead to bugs. It should be thoroughly tested.

cc @Oppen