Package sootup.analysis.intraprocedural

Class UniverseSortedPriorityQueue<E>

java.lang.Object

java.util.AbstractCollection<E>

java.util.AbstractQueue<E>

sootup.analysis.intraprocedural.UniverseSortedPriorityQueue<E>

Type Parameters:

E - the type of elements held in the universe

All Implemented Interfaces:

Iterable<E>, Collection<E>, Queue<E>

public abstract class UniverseSortedPriorityQueue<E>
extends AbstractQueue<E>

TLDR: this class implements sorting a priorityquueue based on the order of items in a List (i.e. the Universe") it seems equivalent to using a PriorityQueue with a custom Comparator sorting the items ordered using the same Universe. as a rough guess this class is faster as the sorting-call seems to be called just once vs multiple times TODO: check that.

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

Field Summary

Fields

Modifier and Type	Field	Description
protected final Map<E,Integer>	ordinalMap
protected final List<? extends E>	universe

Method Summary

Modifier and Type	Method	Description
final boolean	add(E e)
final boolean	contains(Object o)
boolean	isEmpty()
static <E> UniverseSortedPriorityQueue<E>	noneOf(List<? extends E> universe)	Creates a new empty priority queue
static <E> UniverseSortedPriorityQueue<E>	of(List<? extends E> universe)	Creates a new full priority queue
final boolean	offer(E e)
final E	peek()
final E	poll()
final boolean	remove(Object o)

Methods inherited from class java.util.AbstractQueue

addAll, clear, element, remove

Methods inherited from class java.util.AbstractCollection

containsAll, iterator, removeAll, retainAll, size, toArray, toArray, toString

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.Collection

containsAll, equals, hashCode, iterator, parallelStream, removeAll, removeIf, retainAll, size, spliterator, stream, toArray, toArray, toArray

Methods inherited from interface java.lang.Iterable

forEach

Field Details

universe

protected final List<? extends E> universe

ordinalMap

protected final Map<E,Integer> ordinalMap

Method Details

peek

public final E peek()

poll

public final E poll()

add

public final boolean add(E e)

Specified by:

add in interface Collection<E>

Specified by:

add in interface Queue<E>

Overrides:

add in class AbstractQueue<E>

Throws:

NoSuchElementException - if e not part of the universe

NullPointerException - if e is null

offer

public final boolean offer(E e)

Throws:

NoSuchElementException - if e not part of the universe

NullPointerException - if e is null

remove

public final boolean remove(Object o)

Specified by:

remove in interface Collection<E>

Overrides:

remove in class AbstractCollection<E>

contains

public final boolean contains(Object o)

Specified by:

contains in interface Collection<E>

Overrides:

contains in class AbstractCollection<E>

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Collection<E>

Overrides:

isEmpty in class AbstractCollection<E>

of

public static <E> UniverseSortedPriorityQueue<E> of(List<? extends E> universe)

Creates a new full priority queue

Type Parameters:

E -

Parameters:

universe -

Returns:

noneOf

public static <E> UniverseSortedPriorityQueue<E> noneOf(List<? extends E> universe)

Creates a new empty priority queue

Type Parameters:

E -

Parameters:

universe -

Returns: