Package soot.util

Class PriorityQueue<E>

  • Type Parameters:
    E - the type of elements held in the universe
    All Implemented Interfaces:
    Iterable<E>, Collection<E>, Queue<E>

    public abstract class PriorityQueue<E>
    extends AbstractQueue<E>
    A fixed size priority queue based on bitsets. The elements of the priority queue are ordered according to a given universe. This priority queue does not permit null elements. Inserting of elements that are not part of the universe is also permitted (doing so will result in a NoSuchElementException).
    Author:
    Steven Lambeth