Méthode | Description | |
---|---|---|
CreateMatrix ( int x, int y ) : IMatrix |
||
GetEntriesByColumn ( int column_id ) : IList |
Takes O(N log(M)) worst-case time, where N is the number of rows and M is the number of columns. | |
GetEntriesByRow ( int row_id ) : IList |
||
NumEntriesByColumn ( int column_id ) : int | ||
NumEntriesByRow ( int row_id ) : int | ||
Overlap ( IBooleanMatrix s ) : int | ||
RemoveColumn ( int y ) : void |
Removes a column, and fills the gap by decrementing all occurrences of higher column IDs by one
|
|
Transpose ( ) : IMatrix |
Get the transpose of the matrix, i.e. a matrix where rows and columns are interchanged
|
|
this ( int x ) : ICollection |
||
this ( int x, int y ) : bool |
public CreateMatrix ( int x, int y ) : IMatrix |
||
x | int | |
y | int | |
Résultat | IMatrix |
public GetEntriesByColumn ( int column_id ) : IList |
||
column_id | int | |
Résultat | IList |
public GetEntriesByRow ( int row_id ) : IList |
||
row_id | int | |
Résultat | IList |
public NumEntriesByColumn ( int column_id ) : int | ||
column_id | int | |
Résultat | int |
public NumEntriesByRow ( int row_id ) : int | ||
row_id | int | |
Résultat | int |
public RemoveColumn ( int y ) : void | ||
y | int | the column ID |
Résultat | void |