Package gnu.trove.iterator

Examples of gnu.trove.iterator.TIntIntIterator.advance()

279
280
281
282
283
284
285
286
287
288
289
                rec.add(tgtId, vecid, score);
            }
            rec.remove(vecid, vecid);
        } else {
            while (iter.hasNext()) {
                iter.advance();
                int tgtId = iter.key();
                get(tgtId, fReuseList);
                float score = rec.scoring.score(key, vecid, vector, this.key, tgtId, fReuseList);
                rec.add(vecid, tgtId, score);
            }
View Full Code Here
295
296
297
298
299
300
301
302
303
304
305
        rec.create(vecid);
        TIntIntIterator iter = indexer.iterator();
        float[] input = new float[this.base.size()];
        if (this == rec.source) {
            while (iter.hasNext()) {
                iter.advance();
                int tgtId = iter.key();
                _get(tgtId, input, iReuseList);
                float score = rec.scoring.score(key, vecid, vector, vector.length, this.key, tgtId, iReuseList,
                        length(tgtId));
                rec.add(vecid, tgtId, score);
View Full Code Here
306
307
308
309
310
311
312
313
314
315
316
                rec.add(tgtId, vecid, score);
            }
            rec.remove(vecid, vecid);
        } else {
            while (iter.hasNext()) {
                iter.advance();
                int tgtId = iter.key();
                _get(tgtId, input, iReuseList);
                float score = rec.scoring.score(key, vecid, vector, vector.length, this.key, tgtId, iReuseList,
                        length(tgtId));
                rec.add(vecid, tgtId, score);
View Full Code Here
74
75
76
77
78
79
80
81
82
83
84
   */
  public static TreeMap<Integer, Integer> countFrequency(TIntIntHashMap freqmap) {
    TreeMap<Integer, Integer> map = new TreeMap<Integer,Integer>();
    TIntIntIterator it = freqmap.iterator();
    while(it.hasNext()){
      it.advance();
      int freq = it.value();
      if(map.containsKey(freq)){
        map.put(freq, map.get(freq)+1);
      }else
        map.put(freq, 1);
View Full Code Here
103
104
105
106
107
108
109
110
111
112
113
      ArrayList<Integer> ids = new ArrayList<Integer>();
      ids.add(id1);
      TIntIntIterator it = similarityMap[id1].iterator();
      for ( int i = similarityMap[id1].size(); i-- > 0; ) {
        it.advance();
        int id2 = it.key();       
        double sim = ((double)(it.value()* 2)) / (featureLen[id1] + featureLen[id2]);
        if(sim > thres ){
          dup[id2]= true;
          ids.add(id2);
View Full Code Here
169
170
171
172
173
174
175
176
177
178
179
    }

    TIntIntHashMap index = new TIntIntHashMap();
    TIntIntIterator it = feature.iterator();
    while (it.hasNext()) {
      it.advance();
      int value = it.key();
      int key = it.value();
      index.put(key, value);
    }
    int[] idx = index.keys();
View Full Code Here
123
124
125
126
127
128
129
130
131
132
133
    }

    float diff = 0;
    TIntIntIterator it = diffF.iterator();
    for (int i = diffF.size(); i-- > 0;) {
      it.advance();
      diff += it.value() * it.value();
    }
    it = null;
    float alpha;
    float delta;
View Full Code Here
143
144
145
146
147
148
149
150
151
152
153
      alpha = (delta - diffW) / diff;
      // System.out.println(alpha);
      alpha = Math.min(c, alpha);
      it = diffF.iterator();
      for (int i = diffF.size(); i-- > 0;) {
        it.advance();
        weights[it.key()] += it.value() * alpha;
      }

      return loss;
    } else {
View Full Code Here
312
313
314
315
316
317
318
319
320
321
322
      }
    }

    TIntIntIterator j = originalLight.iterator();
    while (j.hasNext()) {
      j.advance();
      org.getspout.spoutapi.material.Block block = MaterialData.getBlock(j.key());
      if (block != null) {
        modified.add(block);
      }
    }
View Full Code Here
119
120
121
122
123
124
125
126
127
128
129
    @Override
    public void recompile() {
        TIntIntIterator it = shaderPrograms.iterator();
        while (it.hasNext()) {
            it.advance();
            GL20.glDeleteProgram(it.value());
        }
        shaderPrograms.clear();
        uniformLocationMap.clear();
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.