Package org.apache.mahout.math.map

Examples of org.apache.mahout.math.map.OpenIntDoubleHashMap

41
42
43
44
45
46
47
    this(cardinality, Math.min(cardinality, INITIAL_CAPACITY)); // arbitrary estimate of 'sparseness'
  }

  public RandomAccessSparseVector(int cardinality, int initialCapacity) {
    super(cardinality);
    values = new OpenIntDoubleHashMap(initialCapacity);
  }
View Full Code Here
69
70
71
72
73
74
75
   *                                  maxLoadFactor)</tt>.
   * @throws IllegalArgumentException if <tt>rows<0 || columns<0 || (double)columns*rows > Integer.MAX_VALUE</tt>.
   */
  public SparseDoubleMatrix2D(int rows, int columns, int initialCapacity, double minLoadFactor, double maxLoadFactor) {
    setUp(rows, columns);
    this.elements = new OpenIntDoubleHashMap(initialCapacity, minLoadFactor, maxLoadFactor);
  }
View Full Code Here
59
60
61
62
63
64
65
   *                                  maxLoadFactor)</tt>.
   * @throws IllegalArgumentException if <tt>size<0</tt>.
   */
  public SparseDoubleMatrix1D(int size, int initialCapacity, double minLoadFactor, double maxLoadFactor) {
    setUp(size);
    this.elements = new OpenIntDoubleHashMap(initialCapacity, minLoadFactor, maxLoadFactor);
  }
View Full Code Here
41
42
43
44
45
46
47
    this(cardinality, Math.min(cardinality, INITIAL_CAPACITY)); // arbitrary estimate of 'sparseness'
  }

  public RandomAccessSparseVector(int cardinality, int initialCapacity) {
    super(cardinality);
    values = new OpenIntDoubleHashMap(initialCapacity);
  }
View Full Code Here
41
42
43
44
45
46
47
    this(cardinality, Math.min(cardinality, INITIAL_CAPACITY)); // arbitrary estimate of 'sparseness'
  }

  public RandomAccessSparseVector(int cardinality, int initialCapacity) {
    super(cardinality);
    values = new OpenIntDoubleHashMap(initialCapacity);
  }
View Full Code Here
40
41
42
43
44
45
46
    this(cardinality, Math.min(cardinality, INITIAL_CAPACITY)); // arbitrary estimate of 'sparseness'
  }

  public RandomAccessSparseVector(int cardinality, int initialCapacity) {
    super(cardinality);
    values = new OpenIntDoubleHashMap(initialCapacity);
  }
View Full Code Here
42
43
44
45
46
47
48
    this(cardinality, Math.min(cardinality, INITIAL_CAPACITY)); // arbitrary estimate of 'sparseness'
  }

  public RandomAccessSparseVector(int cardinality, int initialCapacity) {
    super(cardinality);
    values = new OpenIntDoubleHashMap(initialCapacity);
  }
View Full Code Here
TOP

Related Classes of org.apache.mahout.math.map.OpenIntDoubleHashMap

  • org.apache.mahout.math.matrix.impl.SparseDoubleMatrix1D
  • org.apache.mahout.math.matrix.impl.SparseDoubleMatrix2D
  • org.apache.mahout.math.matrix.impl.SparseDoubleMatrix3D
  • org.apache.mahout.math.RandomAccessSparseVector
  • org.apache.mahout.math.RandomAccessSparseVectorWritable
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.