Improved support for large andNot queries

[richardstartin]

It should be possible to optimise the following aggregation significantly by not requiring materialisation of the contiguous bitmap and by reusing intermediate containers during the aggregation (like FastAggregation.workShyAnd does):

// one API option:
RoaringBitmap foo(long min, long max, RoaringBitmap[] bitmaps) {
    RoaringBitmap result = new RoaringBitmap();
    result.add(min, max);
    for (RoaringBitmap bitmap : bitmaps) {
       result.andNot(bitmap);
    }
   return result;
}

// another API option:
RoaringBitmap bar(long min, long max, RoaringBitmap[] bitmaps) {
    RoaringBitmap union = new RoaringBitmap();
    for (RoaringBitmap bitmap : bitmaps) {
       union.or(bitmap);
    }
    RoaringBitmap result = new RoaringBitmap();
    result.add(min, max);
    result.andNot(union);
    return result;
}

There would be a method added to FastAggregation:

RoaringBitmap rangeAndNot(long min, long max, RoaringBitmap... bitmaps);