IMatrix < Boolean > function ( ) { SparseBooleanMatrixBinarySearch loc0 = new SparseBooleanMatrixBinarySearch ( ) ; for ( int loc1 = 0 ; loc1 < row_list . size ( ) ; loc1 ++ ) for ( int loc2 : get ( loc1 ) ) loc0 . set ( loc2 , loc1 , true ) ; return loc0 ; }
get the transpose of the matrix , i.e. a matrix where rows and columns are interchanged . 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 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 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> createMatrix concode_elem_sep IntList getEntriesByRow