import gnu.trove.TObjectDoubleProcedure; //导入依赖的package包/类
/** Returns the key in map that has the greatest score */
public static Object argmax (TObjectDoubleHashMap map)
{
  // A local class! Yes, Virginia, this is legal Java.
  class Accumulator implements TObjectDoubleProcedure {
    double bestVal = Double.NEGATIVE_INFINITY;
    Object bestObj = null;
    public boolean execute (Object a, double b)
    {
      if (b > bestVal) {
        bestVal = b;
        bestObj = a;
      }
      return true;
    }
  }

  Accumulator procedure = new Accumulator ();
  map.forEachEntry (procedure);
  return procedure.bestObj;
}
 

import gnu.trove.TObjectDoubleProcedure; //导入依赖的package包/类
private double updateTotalProgress(Operation currentOperation) {
  // marking all operations before this one as completed
  for (Operation op : Operation.values()) {
    if (currentOperation.compareTo(op) > 0) {
      myOperationsProgress.put(op, 1.0);
    }
  }
  // counting progress
  final double[] totalProgress = new double[1];
  myOperationsProgress.forEachEntry(new TObjectDoubleProcedure<Operation>() {
    @Override
    public boolean execute(Operation operation, double progress) {
      totalProgress[0] += operation.myFractionInTotal * progress;
      return true;
    }
  });
  return totalProgress[0];
}
 

import gnu.trove.TObjectDoubleProcedure; //导入依赖的package包/类
public Counter<T> add(final double val) {
	final Counter<T> result = new Counter<T>();
	m_map.forEachEntry(new TObjectDoubleProcedure<T>() {
           private boolean first = true;
           public boolean execute(T key, double value) {
           	if ( first ) first = false;
           	double newValue = value + val;
            result.set(key, newValue);
               return true;
           }
       });
	return result;
}
 

import gnu.trove.TObjectDoubleProcedure; //导入依赖的package包/类
/**
 * For each entry in this counter, looks up the corresponding entry in {@code that} 
 * and stores their ratio in the result.
 * @param that
 */
public Counter<T> divideAllBy(final Counter<? super T> that) {
	final Counter<T> result = new Counter<T>();
	m_map.forEachEntry(new TObjectDoubleProcedure<T>() {
           private boolean first = true;
           public boolean execute(T key, double value) {
           	if ( first ) first = false;
           	double newValue = value / that.getT(key);
            result.set(key, newValue);
               return true;
           }
       });
	return result;
}
 

import gnu.trove.TObjectDoubleProcedure; //导入依赖的package包/类
/**
 * For each entry in this counter, looks up the corresponding entry in {@code that} 
 * and stores their product in the result.
 * @param that
 */
public Counter<T> scaleAllBy(final Counter<? super T> that) {
	final Counter<T> result = new Counter<T>();
	m_map.forEachEntry(new TObjectDoubleProcedure<T>() {
           private boolean first = true;
           public boolean execute(T key, double value) {
           	if ( first ) first = false;
           	double newValue = value * that.getT(key);
            result.set(key, newValue);
               return true;
           }
       });
	return result;
}
 

import gnu.trove.TObjectDoubleProcedure; //导入依赖的package包/类
/**
 * @param valueThreshold
 * @param sep Array with two Strings: an entry separator ("," by default, if this is {@code null}), and a key-value separator ("=" by default)
 * @return A string representation of all (key, value) pairs such that the value equals or exceeds the given threshold
 */
public String toString(final double valueThreshold, String[] sep) {
   	String entrySep = ",";	// default
	String kvSep = "=";	// default
	if (sep!=null && sep.length>0) {
		if (sep[0]!=null) 
			entrySep = sep[0];
		if (sep.length>1 && sep[1]!=null)
			kvSep = sep[1];
	}
	final String ENTRYSEP = entrySep;
	final String KVSEP = kvSep;
       final StringBuilder buf = new StringBuilder("{");
       m_map.forEachEntry(new TObjectDoubleProcedure<T>() {
           private boolean first = true;
           public boolean execute(T key, double value) {
           	if (value >= valueThreshold) {
                if ( first ) first = false;
                else buf.append(ENTRYSEP);

                buf.append(key);
                buf.append(KVSEP);
                buf.append(value);
           	}
               return true;
           }
       });
       buf.append("}");
       return buf.toString();
}
 

import gnu.trove.TObjectDoubleProcedure; //导入依赖的package包/类
/**
 * Computes the sum of products of key-value pairs in {@code that}
 * @param that
 * @return
 */
public static double sumOfProducts(Counter<Integer> that) {
	final double[] result = new double[1];	// use a single-element array to make this variable 'final'
	result[0] = 0;
	that.m_map.forEachEntry(new TObjectDoubleProcedure<Integer>() {
           private boolean first = true;
           public boolean execute(Integer key, double value) {
           	if ( first ) first = false;
           	result[0] += key * value;
               return true;
           }
       });
	return result[0];
}