本文整理汇总了Java中gnu.trove.procedure.TIntDoubleProcedure类的典型用法代码示例。如果您正苦于以下问题:Java TIntDoubleProcedure类的具体用法?Java TIntDoubleProcedure怎么用?Java TIntDoubleProcedure使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
TIntDoubleProcedure类属于gnu.trove.procedure包,在下文中一共展示了TIntDoubleProcedure类的1个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于我们的系统推荐出更棒的Java代码示例。
示例1: createCompareList
点赞 2
import gnu.trove.procedure.TIntDoubleProcedure; //导入依赖的package包/类
/**
* Creates a sorted map of the best fitting values
*
* @param eventTables
* the list of tables to be compared
* @param dt
* the distance type to use
*
* @return the sorted map
*/
public LinkedHashMap<EventTable, Double> createCompareList(
final List<EventTable> eventTables, final DistanceType dt) {
// calculate the distances
final TIntDoubleHashMap distances = new TIntDoubleHashMap();
for (int i = 0; i < eventTables.size(); i++) {
final double val = this.distance(eventTables.get(i), dt);
distances.put(i, val);
}
// find the top ten
final TreeMap<Integer, Double> sorted = new TreeMap<Integer, Double>(
new Comparator<Integer>() {
@Override
public int compare(final Integer o1, final Integer o2) {
return distances.get(o1) < distances.get(o2) ? -1 : 1;
}
});
distances.forEachEntry(new TIntDoubleProcedure() {
@Override
public boolean execute(final int a, final double b) {
sorted.put(a, b);
return true;
}
});
final LinkedHashMap<EventTable, Double> result = new LinkedHashMap<EventTable, Double>();
for (final int pos : sorted.keySet()) {
result.put(eventTables.get(pos), distances.get(pos));
}
return result;
}
开发者ID:pmeisen,
项目名称:dis-timeintervaldataanalyzer,
代码行数:46,
代码来源:EventTable.java