public class SparseBlockSignature
extends java.lang.Object
Constructor and Description |
---|
SparseBlockSignature(int rowSize,
int colSize,
boolean vertical,
int[] data) |
SparseBlockSignature(SparseBlockMatrix S,
boolean vertical) |
Modifier and Type | Method and Description |
---|---|
int |
colSize() |
int[] |
computePrevColIdxs(SparseBlockSignature prev)
Compute the previous column indices of the matrix identified by
sigP with respect the matrix indentifies by this signature. |
int[] |
computePrevColIdxsAlt(SparseBlockSignature sigP)
Compute the previous column indices of the matrix identified by
sigP with respect the matrix indentifies by this signature. |
boolean |
equals(SparseBlockMatrix S) |
boolean |
equals(SparseBlockSignature sig) |
int[] |
getColOrdering(int[] blockOrdering) |
int[] |
getData() |
int[] |
getOrderedEntries() |
int[] |
getRowOrdering(int[] blockOrdering) |
boolean |
isVertical() |
void |
lexicalSplitMerge(int[] newOrder,
int[] oldOrder,
int ibegin,
int iend) |
int |
rowSize() |
java.lang.String |
toString() |
public SparseBlockSignature(int rowSize, int colSize, boolean vertical, int[] data)
public SparseBlockSignature(SparseBlockMatrix S, boolean vertical)
public boolean equals(SparseBlockMatrix S)
public int rowSize()
public int colSize()
public int[] getData()
public boolean isVertical()
public boolean equals(SparseBlockSignature sig)
public java.lang.String toString()
toString
in class java.lang.Object
public int[] getOrderedEntries()
public void lexicalSplitMerge(int[] newOrder, int[] oldOrder, int ibegin, int iend)
public int[] getRowOrdering(int[] blockOrdering)
public int[] getColOrdering(int[] blockOrdering)
public int[] computePrevColIdxsAlt(SparseBlockSignature sigP)
sigP
with respect the matrix indentifies by this signature. The
functionality is the same as computePrevColIdxs(maspack.matrix.SparseBlockSignature)
. Despite
attempts to make this method more efficient than the latter, it is not
clear which is actually faster, with some timings showing it slower by a
factor of around 1.5 or more for matrices dominated by contact
constraints.public int[] computePrevColIdxs(SparseBlockSignature prev)
sigP
with respect the matrix indentifies by this signature.