Code example for PriorityQueue

Methods: clear

0
	public List<O> add(double value, O obj) {
		return this.add(new Double(value), obj);
	} 
	 
	public void clear() { 
		this.topK.clear();
		this.borderval = Double.POSITIVE_INFINITY;
	} 
	 
	/** 
	 * Pair object to store the object within 
	 *  
	 * @author namatag 
	 * 
	 */ 
	private class Pair implements Comparable<Pair> {
		public Double d = null;
		public Object o = null;
 
		public Pair(double d, Object o) {
Contextual code suggestions in your IDE  Get Codota for Java