Package com.carrotsearch.hppc

Examples of com.carrotsearch.hppc.IntIntOpenHashMap

29
30
31
32
33
34
35
public class IntIntHppcOpenHashMap extends AbstractWritableIntIntMap {
  protected final IntIntOpenHashMap myMap;

  public IntIntHppcOpenHashMap() {
    myMap = new IntIntOpenHashMap();
  }
View Full Code Here
33
34
35
36
37
38
39
  public IntIntHppcOpenHashMap() {
    myMap = new IntIntOpenHashMap();
  }

  public IntIntHppcOpenHashMap(int initialCapacity) {
    myMap = new IntIntOpenHashMap(initialCapacity);
  }
View Full Code Here
37
38
39
40
41
42
43
  public IntIntHppcOpenHashMap(int initialCapacity) {
    myMap = new IntIntOpenHashMap(initialCapacity);
  }

  public IntIntHppcOpenHashMap(int initialCapacity, float loadFactor) {
    myMap = new IntIntOpenHashMap(initialCapacity, loadFactor);
  }
View Full Code Here
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
  }
 
  public void trimFeatures(Logger log, float threshold)
  {
    FloatArrayList tWeights = new FloatArrayList(f_weights.size());
    IntIntOpenHashMap map = new IntIntOpenHashMap();
    ObjectIntHashMap<String> m;
    int i, j, tFeatures = 1;
    boolean trim;
    String s;
   
    log.info("Trimming: ");
   
    // bias
    for (j=0; j<n_labels; j++)
      tWeights.add(f_weights.get(j));
   
    // rest
    for (i=1; i<n_features; i++)
    {
      trim = true;
     
      for (j=0; j<n_labels; j++)
      {
        if (Math.abs(f_weights.get(i*n_labels+j)) > threshold)
        {
          trim = false;
          break;
        }
      }
     
      if (!trim)
      {
        map.put(i, tFeatures++);
       
        for (j=0; j<n_labels; j++)
          tWeights.add(f_weights.get(i*n_labels+j));       
      }
    }
   
    log.info(String.format("%d -> %d\n", n_features, tFeatures));
    tWeights.trimToSize();
   
    // map
    for (String type : Lists.newArrayList(m_features.keySet()))
    {
      m = m_features.get(type);
     
      for (ObjectIntPair<String> p : m.toList())
      {
        i = map.get(p.i);
        s = (String)p.o;
       
        if (i > 0)  m.put(s, i);
        else    m.remove(s);
      }
View Full Code Here
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
      this.columns = columns;
      this.desiredFields = desiredFields;

      this.fieldNames = Lists.newArrayListWithCapacity(desiredFields.size());
      this.types = Lists.newArrayListWithCapacity(desiredFields.size());
      IntIntOpenHashMap oldToNewIds = new IntIntOpenHashMap();

      int i =0;
      for(DesiredField f : desiredFields){
        fieldNames.add(f.name);
        types.add(f.field.getType());
        oldToNewIds.put(f.origIndex, i);
        i++;
      }
      this.rewriter = new InputRewriter(oldToNewIds);
    }
View Full Code Here
29
30
31
32
33
34
35
public class IntIntHppcOpenHashMap extends AbstractWritableIntIntMap {
  protected final IntIntOpenHashMap myMap;

  public IntIntHppcOpenHashMap() {
    myMap = new IntIntOpenHashMap();
  }
View Full Code Here
33
34
35
36
37
38
39
  public IntIntHppcOpenHashMap() {
    myMap = new IntIntOpenHashMap();
  }

  public IntIntHppcOpenHashMap(int initicalCapacity) {
    myMap = new IntIntOpenHashMap(initicalCapacity);
  }
View Full Code Here
37
38
39
40
41
42
43
  public IntIntHppcOpenHashMap(int initicalCapacity) {
    myMap = new IntIntOpenHashMap(initicalCapacity);
  }

  public IntIntHppcOpenHashMap(int initialCapacity, float loadFactor) {
    myMap = new IntIntOpenHashMap(initialCapacity, loadFactor);
  }
View Full Code Here
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
      this.columns = columns;
      this.desiredFields = desiredFields;

      this.fieldNames = Lists.newArrayListWithCapacity(desiredFields.size());
      this.types = Lists.newArrayListWithCapacity(desiredFields.size());
      IntIntOpenHashMap oldToNewIds = new IntIntOpenHashMap();

      int i =0;
      for (DesiredField f : desiredFields) {
        fieldNames.add(f.name);
        types.add(f.field.getType());
        oldToNewIds.put(f.origIndex, i);
        i++;
      }
      this.rewriter = new InputRewriter(oldToNewIds);
    }
View Full Code Here
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
{
    public void accessAnonymousClassFieldInForEach()
    {
        // [[[start:foreach-counting]]]
        // Create a map.
        final IntIntOpenHashMap map = new IntIntOpenHashMap();
        map.put(1, 2);
        map.put(2, 5);
        map.put(3, 10);

        int count = map.forEach(new IntIntProcedure()
        {
           int count;
           public void apply(int key, int value)
           {
               if (value >= 5) count++;
View Full Code Here
TOP

Related Classes of com.carrotsearch.hppc.IntIntOpenHashMap

  • com.almworks.integers.wrappers.IntIntHppcOpenHashMap
  • com.carrotsearch.hppc.caliper.HppcMap
  • com.carrotsearch.hppc.examples.BigramCounting
  • com.carrotsearch.hppc.examples.ForEach
  • com.carrotsearch.hppc.misc.HppcOomPut
  • com.clearnlp.classification.model.StringModelAD
  • com.clearnlp.constituent.CTLib
  • org.apache.drill.exec.planner.physical.PrelUtil$ProjectPushInfo
  • org.carrot2.clustering.kmeans.BisectingKMeansClusteringAlgorithm
  • org.carrot2.text.preprocessing.PhraseExtractor
    • 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.