Examples of edu.ucla.sspace.matrix.SparseHashMatrix

edu.ucla.sspace.matrix.SparseHashMatrix
A {@code SparseMatrix} backed by vectors that provide amortized O(1) accessto their elements. Each row is implemented using a hashing-based vector. This class provides an alternate implementation to {@link YaleSparseMatrix}; this class potentially uses more memory than {@code YaleSparseMatrix}, but provides O(1) access instead of O(log(n)). The size of this matrix is fixed, and attempts to access rows or columns beyond the size will throw an {@link IndexOutOfBoundsException}. @author David Jurgens

            final List<Edge> edgeList, final SparseMatrix sm) {


        final int numEdges = edgeList.size();
        final Matrix edgeSimMatrix = 
            new SparseSymmetricMatrix(
                new SparseHashMatrix(numEdges, numEdges));


        Object key = workQueue.registerTaskGroup(numEdges);
        for (int i = 0; i < numEdges; ++i) {
            final int row = i;
            workQueue.add(key, new Runnable() {

View Full Code Here

TOP

Related Classes of edu.ucla.sspace.matrix.SparseHashMatrix

edu.ucla.sspace.clustering.LinkClustering

edu.ucla.sspace.vector.SparseHashDoubleVector

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.