本文整理汇总了Java中edu.stanford.nlp.util.PriorityQueue.changePriority方法的典型用法代码示例。如果您正苦于以下问题:Java PriorityQueue.changePriority方法的具体用法?Java PriorityQueue.changePriority怎么用?Java PriorityQueue.changePriority使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类edu.stanford.nlp.util.PriorityQueue
的用法示例。
在下文中一共展示了PriorityQueue.changePriority方法的2个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: toBiggestValuesFirstString
import edu.stanford.nlp.util.PriorityQueue; //导入方法依赖的package包/类
public static <E> String toBiggestValuesFirstString(Counter<E> c, int k) {
PriorityQueue<E> pq = toPriorityQueue(c);
PriorityQueue<E> largestK = new BinaryHeapPriorityQueue<E>();
//TODO: Is there any reason the original (commented out) line is better than the one replacing it?
// while (largestK.size() < k && ((Iterator<E>)pq).hasNext()) {
while (largestK.size() < k && !pq.isEmpty()) {
double firstScore = pq.getPriority(pq.getFirst());
E first = pq.removeFirst();
largestK.changePriority(first, firstScore);
}
return largestK.toString();
}
示例2: toBiggestValuesFirstString
import edu.stanford.nlp.util.PriorityQueue; //导入方法依赖的package包/类
public static <E> String toBiggestValuesFirstString(Counter<E> c, int k) {
PriorityQueue<E> pq = toPriorityQueue(c);
PriorityQueue<E> largestK = new BinaryHeapPriorityQueue<E>();
// TODO: Is there any reason the original (commented out) line is better
// than the one replacing it?
// while (largestK.size() < k && ((Iterator<E>)pq).hasNext()) {
while (largestK.size() < k && !pq.isEmpty()) {
double firstScore = pq.getPriority(pq.getFirst());
E first = pq.removeFirst();
largestK.changePriority(first, firstScore);
}
return largestK.toString();
}