Package gnu.trove.map.hash

Examples of gnu.trove.map.hash.TIntDoubleHashMap$TIntDoubleValueHashIterator

29
30
31
32
33
34
35
*/
public class TByteTripleDoubleHashMap {
  private TIntDoubleHashMap map;

  public TByteTripleDoubleHashMap() {
    map = new TIntDoubleHashMap(100);
  }
View Full Code Here
33
34
35
36
37
38
39
  public TByteTripleDoubleHashMap() {
    map = new TIntDoubleHashMap(100);
  }

  public TByteTripleDoubleHashMap(int capacity) {
    map = new TIntDoubleHashMap(capacity);
  }
View Full Code Here
43
44
45
46
47
48
49
   *
   * @param size Expected size
   */
  public MapIntegerDBIDDoubleStore(int size) {
    super();
    map = new TIntDoubleHashMap(size, 0.5f, Integer.MIN_VALUE, Double.NaN);
  }
View Full Code Here
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
    return result;
    }
   
    public static RyanFeatureVector getAddedVector(RyanFeatureVector fv1, RyanFeatureVector fv2, double rate) {
     
      TIntDoubleHashMap hm = new TIntDoubleHashMap();
      for (RyanFeatureVector curr = fv1; curr.next != null; curr = curr.next) {
        if (curr.index >= 0) {
          hm.put(curr.index, (hm.containsKey(curr.index) ? hm.get(curr.index) : 0) + curr.value);
        }
      }

      for (RyanFeatureVector curr = fv2; curr.next != null; curr = curr.next) {
        if (curr.index >= 0) {
          hm.put(curr.index, (hm.containsKey(curr.index) ? hm.get(curr.index) : 0) + rate * curr.value);
        }
      }

      RyanFeatureVector result = new RyanFeatureVector(-1, -1, null);
      TIntDoubleIterator hmIter = hm.iterator();
      while (hmIter.hasNext()) {
        hmIter.advance();
        result = new RyanFeatureVector(hmIter.key(), hmIter.value(), result);
      }
    return result;
View Full Code Here
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
    return result;
    }
 
    public static double dotProduct(RyanFeatureVector fv1, RyanFeatureVector fv2) {
  double result = 0.0;
  TIntDoubleHashMap hm1 = new TIntDoubleHashMap();
  TIntDoubleHashMap hm2 = new TIntDoubleHashMap();

  for(RyanFeatureVector curr = fv1; curr.next != null; curr = curr.next) {
      if(curr.index < 0)
    continue;
      hm1.put(curr.index,hm1.get(curr.index)+curr.value);
  }
  for(RyanFeatureVector curr = fv2; curr.next != null; curr = curr.next) {
      if(curr.index < 0)
    continue;
      hm2.put(curr.index,hm2.get(curr.index)+curr.value);
  }

  int[] keys = hm1.keys();

  for(int i = 0; i < keys.length; i++) {
      double v1 = hm1.get(keys[i]);
      double v2 = hm2.get(keys[i]);
      result += v1*v2;
  }
   
  return result;
   
View Full Code Here
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
  }
  return sum;
    }
 
    public static double twoNorm(RyanFeatureVector fv1) {
  TIntDoubleHashMap hm = new TIntDoubleHashMap();
  double sum = 0.0;
  for(RyanFeatureVector curr = fv1; curr.next != null; curr = curr.next) {
      if(curr.index < 0)
    continue;
      hm.put(curr.index,hm.get(curr.index)+curr.value);
  }
  int[] keys = hm.keys();

  for(int i = 0; i < keys.length; i++)
      sum += Math.pow(hm.get(keys[i]),2.0);
   
  return Math.sqrt(sum);
    }
View Full Code Here
TOP

Related Classes of gnu.trove.map.hash.TIntDoubleHashMap$TIntDoubleValueHashIterator

  • com.dsi.parallax.ml.vector.TrovePrimativeMapLinearVector
  • de.lmu.ifi.dbs.elki.database.datastore.memory.MapIntegerDBIDDoubleStore
  • edu.ucla.sspace.graph.ChineseWhispersClustering
  • edu.ucla.sspace.graph.SparseWeightedEdgeSet
  • edu.ucla.sspace.vector.SparseHashDoubleVector
  • gnu.trove.map.TIntDoubleMap
  • org.getspout.spoutapi.util.map.TByteShortByteKeyedDoubleHashMap
  • org.getspout.spoutapi.util.map.TByteTripleDoubleHashMap
  • solver.search.strategy.selectors.variables.ActivityBased$MapVal
  • upenn.junto.util.RyanFeatureVector
    • 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.