Examples of gnu.trove.iterator.TIntDoubleIterator

gnu.trove.iterator.TIntDoubleIterator

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

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

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

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

            }
        }


        double maxSum = -1d;
        TIntSet ties = new TIntHashSet();
        TIntDoubleIterator iter = classSums.iterator();
        while (iter.hasNext()) {
            iter.advance();
            double weight = iter.value();
            if (weight > maxSum) {
                maxSum = weight;
                ties.clear();
            }
            if (weight == maxSum)
                ties.add(iter.key());
            
        }
        
        // If there wasn't a tie after all
        int[] options = ties.toArray();

View Full Code Here

     * {@inheritDoc}
     */
    public SparseWeightedEdgeSet copy(IntSet vertices) {        
        SparseWeightedEdgeSet copy = new SparseWeightedEdgeSet(rootVertex);
        if (edges.size() < vertices.size()) {
            TIntDoubleIterator iter = edges.iterator();
            while (iter.hasNext()) {
                iter.advance();
                int v = iter.key();
                if (vertices.contains(v))
                    copy.edges.put(v, iter.value());
            }
            
        }
        else {
            IntIterator iter = vertices.iterator();
            while (iter.hasNext()) {
                int v = iter.nextInt();
                if (edges.containsKey(v)) 
                    copy.edges.put(v, edges.get(v));
            }
        }
        return copy;

View Full Code Here

    /**
     * Returns the sum of the weights of the edges contained in this set.
     */
    public double sum() {
        double sum = 0;
        TIntDoubleIterator iter = edges.iterator();
        while (iter.hasNext()) {
            iter.advance();
            sum += iter.value();
        }
        return sum;
    }

View Full Code Here

          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

TOP

Related Classes of gnu.trove.iterator.TIntDoubleIterator

edu.ucla.sspace.graph.ChineseWhispersClustering

edu.ucla.sspace.graph.SparseWeightedEdgeSet

upenn.junto.util.RyanFeatureVector

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.