question: takes o n log m worst-case time , where n is the number of rows and m is the number of columns . concode_field_sep List<IntList> row_list concode_field_sep int numberOfEntries concode_elem_sep List<Pair<Integer,int[]>> getNonEmptyRows concode_elem_sep void set concode_elem_sep void grow concode_elem_sep int numEntriesByRow concode_elem_sep IntCollection nonEmptyColumnIDs concode_elem_sep int overlap concode_elem_sep int numberOfColumns concode_elem_sep Boolean get concode_elem_sep IntCollection get concode_elem_sep int numEntriesByColumn concode_elem_sep IntCollection nonEmptyRowIDs concode_elem_sep boolean isSymmetric concode_elem_sep int numberOfRows concode_elem_sep IMatrix<Boolean> transpose concode_elem_sep IMatrix<Boolean> createMatrix concode_elem_sep IntList getEntriesByRow
target: IntList function ( int arg0 ) { IntList loc0 = new IntArrayList ( ) ; for ( int loc1 = 0 ; loc1 < numberOfRows ( ) ; loc1 ++ ) if ( Collections . binarySearch ( row_list . get ( loc1 ) , arg0 ) >= 0 ) loc0 . add ( loc1 ) ; return loc0 ; }