HashMap < Integer , IntSet > function ( ) { HashMap < Integer , IntSet > loc0 = new HashMap < Integer , IntSet > ( ) ; for ( int loc1 = 0 ; loc1 < row_list . size ( ) ; loc1 ++ ) { IntSet loc2 = get ( loc1 ) ; if ( loc2 . size ( ) > 0 ) loc0 . put ( loc1 , loc2 ) ; } return loc0 ; }
the non-empty rows of the matrix the ones that contain at least one true entry , with their ids . concode_field_sep ArrayList<IntSet> row_list concode_field_sep int numberOfEntries concode_elem_sep void set concode_elem_sep void grow concode_elem_sep IntList getEntriesByColumn 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 IntSet 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