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

Class gnu.trove.iterator.TIntIntIterator

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

gnu.trove.iterator.TIntIntIterator.key()
Provides access to the key of the mapping at the iterator's position. Note that you must advance() the iterator at least once before invoking this method. @return the key of the entry at the iterator's current position.

            }
            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

        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);
                rec.add(tgtId, vecid, score);

View Full Code Here

            }
            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

      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


    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();
    Arrays.sort(idx);

View Full Code Here

      // 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 {
      return 0;

View Full Code Here

    }


    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

0 1

TOP

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.