Examples of mikera.vectorz.impl.SparseHashedVector

mikera.vectorz.impl.SparseHashedVector
Hashed sparse vector, intended for large vectors with very few randomly positioned non-zero elements. Maintains hash elements for non-zero values only. This is useful (and better than SparseIndexedVector) if elements are likely to be set back to zero on a frequent basis Mutable in all elements, but performance will be reduced if density is high. In general, if density is more than about 1% then a dense Vector is likely to be better. @author Mike

public class SparseArrays {
  public static final int SIZE=1000000;
  private static Random r=new Random();


  public static SparseHashedVector createRow() {
    SparseHashedVector v=SparseHashedVector.createLength(SIZE);
    
    for (int i=0; i<1000; i++) {
      v.set(r.nextInt(SIZE), r.nextDouble());
    }


    return v;
  }

View Full Code Here


public class TestSparseVectors {


  @Test 
  public void testHashed() {
    SparseHashedVector v=SparseHashedVector.createLength(10);
    assertEquals(0,v.nonZeroCount());


    v.set(1,1);
    assertEquals(1.0,v.elementSum(),0.0);
    assertEquals(1,v.nonZeroCount());
    
  }

View Full Code Here

TOP

Related Classes of mikera.vectorz.impl.SparseHashedVector

example.SparseArrays

mikera.indexz.Index

mikera.vectorz.TestSparseVectors

mikera.vectorz.util.VectorzException

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.