long function ( long [ ] arg0 , long [ ] arg1 , int arg2 , int arg3 ) { long loc0 = 0 ; for ( int loc1 = arg2 , loc2 = arg2 + arg3 ; loc1 < loc2 ; ++ loc1 ) { loc0 += Long . bitCount ( arg0 [ loc1 ] & arg1 [ loc1 ] ) ; } return loc0 ; }
returns the popcount or cardinality of the two sets after an intersection . neither array is modified . concode_field_sep byte[] BYTE_COUNTS concode_elem_sep int[] BIT_LISTS concode_field_sep long pop_xor concode_elem_sep int nextHighestPowerOfTwo concode_elem_sep long nextHighestPowerOfTwo concode_elem_sep int bitCount concode_elem_sep int zigZagDecode concode_elem_sep long zigZagDecode concode_elem_sep long pop_union concode_elem_sep int bitList concode_elem_sep long pop_array concode_elem_sep long pop_andnot concode_elem_sep int zigZagEncode concode_elem_sep long zigZagEncode