benchmark of cumulative cost of bitmap intersection with subsequent iteration over the result . this is a pattern from query processing of historical nodes , when io.druid.segment.filter.andfilter is used . concode_field_sep double prob concode_elem_sep BitmapFactory factory concode_elem_sep ImmutableBitmap[] bitmaps concode_elem_sep int size concode_elem_sep int[] data concode_elem_sep ImmutableBitmap bitmap concode_elem_sep int dataSize concode_elem_sep int n concode_elem_sep String bitmapAlgo concode_field_sep int unionAndIter concode_elem_sep int constructAndIter concode_elem_sep BitmapFactory makeFactory concode_elem_sep void setup concode_elem_sep void setup concode_elem_sep void setup concode_elem_sep void setup concode_elem_sep void setup concode_elem_sep ImmutableBitmap makeBitmap concode_elem_sep int iter concode_elem_sep int iter concode_elem_sep void main
int function ( BitmapsForIntersection arg0 ) { ImmutableBitmap loc0 = factory . loc0 ( Arrays . asList ( arg0 . bitmaps ) ) ; return iter ( loc0 ) ; }