Метод | Описание | |
---|---|---|
CreateMatrix ( int x, int y ) : IMatrix |
||
GetEntriesByColumn ( int column_id ) : IList |
Takes O(N) worst-case time, where N is the number of rows, if the internal hash table can be queried in constant time. | |
GetEntriesByRow ( int row_id ) : IList |
||
NumEntriesByColumn ( int column_id ) : int | ||
NumEntriesByRow ( int row_id ) : int | ||
Overlap ( IBooleanMatrix s ) : int |
Get the overlap of two matrices, i.e. the number of true entries where they agree
|
|
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 |
Indexer to access the elements of the matrix
|
public CreateMatrix ( int x, int y ) : IMatrix |
||
x | int | |
y | int | |
Результат | IMatrix |
public GetEntriesByColumn ( int column_id ) : IList |
||
column_id | int | |
Результат | IList |
public GetEntriesByRow ( int row_id ) : IList |
||
row_id | int | |
Результат | IList |
public NumEntriesByColumn ( int column_id ) : int | ||
column_id | int | |
Результат | int |
public NumEntriesByRow ( int row_id ) : int | ||
row_id | int | |
Результат | int |
public Overlap ( IBooleanMatrix s ) : int | ||
s | IBooleanMatrix | the |
Результат | int |
public RemoveColumn ( int y ) : void | ||
y | int | the column ID |
Результат | void |
public this ( int x, int y ) : bool | ||
x | int | the row ID |
y | int | the column ID |
Результат | bool |