Class PriorityQueue

java.lang.Object
weka.clusterers.forOPTICSAndDBScan.Utils.PriorityQueue
All Implemented Interfaces:
RevisionHandler

public class PriorityQueue extends Object implements RevisionHandler

PriorityQueue.java
Authors: Rainer Holzmann, Zhanna Melnikova-Albrecht, Matthias Schubert
Date: Aug 27, 2004
Time: 5:36:35 PM
$ Revision 1.4 $

Version:
$Revision: 1.3 $
Author:
Matthias Schubert (schubert@dbs.ifi.lmu.de), Zhanna Melnikova-Albrecht (melnikov@cip.ifi.lmu.de), Rainer Holzmann (holzmann@cip.ifi.lmu.de)
  • Constructor Details

    • PriorityQueue

      public PriorityQueue()
      Creates a new PriorityQueue backed on a binary heap. The queue is dynamically growing and shrinking and it is descending, that is: the highest priority is always in the root.
  • Method Details

    • add

      public void add(double priority, Object o)
      Adds a new Object to the queue
      Parameters:
      priority - The priority associated with the object
      o -
    • getPriority

      public double getPriority(int index)
      Returns the priority for the object at the specified index
      Parameters:
      index - the index of the object
      Returns:
      priority
    • size

      public int size()
      Returns the queue's size
      Returns:
      size
    • hasNext

      public boolean hasNext()
      Tests, if the queue has some more elements left
      Returns:
      true, if there are any elements left, else false
    • next

      public PriorityQueueElement next()
      Returns the element with the highest priority
      Returns:
      next element
    • getRevision

      public String getRevision()
      Returns the revision string.
      Specified by:
      getRevision in interface RevisionHandler
      Returns:
      the revision