IdentifiablePriorityQueue

All Superinterfaces:

PriorityQueue<E>

All Known Implementing Classes:

IdentifiableBinaryHeap
```
public interface IdentifiablePriorityQueue<E extends Identifiable & java.lang.Comparable>
extends PriorityQueue<E>
```
This interface defines the methods supported by a priority queue.

Since:

11gR1

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method	Description
`E`	`getElement(long id)`	Returns the element with the input ID, if the element exists; otherwise, returns null.
`E`	`replaceElement(long id, E newElement)`	Replace the old element of the specified id with a new element.

Methods inherited from interface oracle.spatial.network.lod.PriorityQueue
clear, deleteMin, findMin, insert, isEmpty, size

- Method Detail
  - getElement
```
E getElement(long id)
```
    Returns the element with the input ID, if the element exists; otherwise, returns null.
    
    Parameters:
    
    id - ID of the element
    
    Returns:
  - replaceElement
```
E replaceElement(long id,
                 E newElement)
```
    Replace the old element of the specified id with a new element. The ID of the new element does not need to be the same as the old element. If the old element does not exist in the queue, then simply insert the new element into the queue.
    
    Parameters:
    
    id - ID of the old element
    
    newElement - new element
    
    Returns: