Examples of gnu.trove.iterator.TIntIntIterator

gnu.trove.iterator.TIntIntIterator

ssing keys/values through an iterator: for ( TIntIntIterator it = map.iterator(); it.hasNext(); ) { it.advance(); if ( satisfiesCondition( it.key() ) { doSomethingWithValue( it.value() ); } }

 // modifying values in-place through iteration: for ( TIntIntIterator it = map.iterator(); it.hasNext(); ) { it.advance(); if ( satisfiesCondition( it.key() ) { it.setValue( newValueForKey( it.key() ) ); } }

 // deleting entries during iteration: for ( TIntIntIterator it = map.iterator(); it.hasNext(); ) { it.advance(); if ( satisfiesCondition( it.key() ) { it.remove(); } }

 // faster iteration by avoiding hasNext(): TIntIntIterator iterator = map.iterator(); for ( int i = map.size(); i-- > 0; ) { iterator.advance(); doSomethingWithKeyAndValue( iterator.key(), iterator.value() ); }

            output.writeString(vectorSet.key());
            kryo.writeObject(output, vectorSet.accumuFactor);
            kryo.writeObject(output, vectorSet.sparseFactor);


            TIntIntMap indexer = vectorSet.indexer;
            TIntIntIterator iter = indexer.iterator();
            kryo.writeObject(output, indexer.size());
            while (iter.hasNext()) {
                iter.advance();
                int vecid = iter.key();
                int start = iter.value();
                int length = vectorSet.length(vecid);
                kryo.writeObject(output, vecid);
                kryo.writeObject(output, start);
                kryo.writeObject(output, length);
            }

View Full Code Here

            output.writeString(vectorSet.key());
            kryo.writeObject(output, vectorSet.accumuFactor);
            kryo.writeObject(output, vectorSet.sparseFactor);


            TIntIntMap indexer = vectorSet.indexer;
            TIntIntIterator iter = indexer.iterator();
            kryo.writeObject(output, indexer.size());
            while (iter.hasNext()) {
                iter.advance();
                int vecid = iter.key();
                int start = iter.value();
                int length = vectorSet.length(vecid);
                kryo.writeObject(output, vecid);
                kryo.writeObject(output, start);
                kryo.writeObject(output, length);
            }

View Full Code Here

        TIntIntMap oldindexer = indexer;
        data = new TFloatArrayList(olddata.size());
        indexer = new TIntIntHashMap(oldindexer.size());


        int pos = 0;
        TIntIntIterator iter = oldindexer.iterator();
        while (iter.hasNext()) {
            iter.advance();
            int vecid = iter.key();
            int start = iter.value();
            int length = lengths.get(vecid);


            int cursor = 0;
            indexer.put(vecid, pos);
            while (cursor < length) {

View Full Code Here

    }


    @Override
    public void rescore(String key, int vecid, float[] vector, Recommendation rec) {
        rec.create(vecid);
        TIntIntIterator iter = indexer.iterator();
        int[] input = new int[this.base.size() * 2];
        if (this == rec.source) {
            while (iter.hasNext()) {
                iter.advance();
                int tgtId = iter.key();
                get(tgtId, input, fReuseList);
                float score = rec.scoring.score(key, vecid, vector, this.key, tgtId, fReuseList);
                rec.add(vecid, tgtId, score);
                rec.add(tgtId, vecid, score);
            }
            rec.remove(vecid, vecid);
        } else {
            while (iter.hasNext()) {
                iter.advance();
                int tgtId = iter.key();
                get(tgtId, input, fReuseList);
                float score = rec.scoring.score(key, vecid, vector, this.key, tgtId, fReuseList);
                rec.add(vecid, tgtId, score);
            }
        }

View Full Code Here

    }


    @Override
    public void rescore(String key, int vecid, int[] vector, Recommendation rec) {
        rec.create(vecid);
        TIntIntIterator iter = indexer.iterator();
        if (this == rec.source) {
            while (iter.hasNext()) {
                iter.advance();
                int tgtId = iter.key();
                _get(tgtId, 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);
            }
            rec.remove(vecid, vecid);
        } else {
            while (iter.hasNext()) {
                iter.advance();
                int tgtId = iter.key();
                _get(tgtId, 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

  @Override
  public void testInt_TPrimitiveHashMap() {
    int total = 0;


    for( int i = 0; i < ITERATIONS_INT; i++ ) {
      TIntIntIterator iterator = int_t_primitive_map.iterator();
      while( iterator.hasNext() ) {
        iterator.advance();
        total += iterator.key();
      }
    }


    int_slot.set( total );
  }

View Full Code Here

        TIntIntMap oldindexer = indexer;
        data = new TFloatArrayList(olddata.size());
        indexer = new TIntIntHashMap(oldindexer.size());


        int pos = 0;
        TIntIntIterator iter = oldindexer.iterator();
        while (iter.hasNext()) {
            iter.advance();
            int vecid = iter.key();
            int start = iter.value();
            int length = lengths.get(vecid);


            int cursor = 0;
            indexer.put(vecid, pos);
            while (cursor < length) {

View Full Code Here

    }


    @Override
    public void rescore(String key, int vecid, float[] vector, Recommendation rec) {
        rec.create(vecid);
        TIntIntIterator iter = indexer.iterator();
        if (this == rec.source) {
            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);
                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

    }


    @Override
    public void rescore(String key, int vecid, int[] vector, Recommendation rec) {
        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);
                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

   * @param freqmap
   * @return
   */
  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

0 1 2 3

TOP

Related Classes of gnu.trove.iterator.TIntIntIterator

com.guokr.simbase.store.DenseVectorSet

com.guokr.simbase.store.SerializerHelper$DenseVectorSetSerializer

com.guokr.simbase.store.SerializerHelper$SparseVectorSetSerializer

com.guokr.simbase.store.SparseVectorSet

gnu.trove.benchmark.IterationBenchmark

org.fnlp.ml.classifier.struct.update.HigherOrderViterbiPAUpdate

org.fnlp.nlp.duplicate.Similarity

org.fnlp.train.tag.ModelOptimization

org.fnlp.util.MyArrays

org.getspout.spout.inventory.AbstractBlockManager

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.