| Interface | Description |
|---|---|
| PriorityQueue<E> |
Questa interfaccia definisce il tipo di dato astratto PriorityQueue, un tipo
speciale di coda che permette di gestire elementi che possono avere due
diversi livelli di priorita': "low" e "high".
|
| Queue<E> |
Interface for a queue: a collection of elements that are inserted
and removed according to the first-in first-out principle.
|
| Class | Description |
|---|---|
| ArrayQueue<E> | |
| Node<E> |
Node of a singly linked list, which stores references to its
element and to the next node in the list.
|
| NodeQueue<E> |
Realization of a queue by means of a singly-linked list of nodes.
|
| PriorityLists<E> | |
| PriorityNodeQueue<E> |
Questa classe implementa il tipo di dato astratto PriorityQueue
usando due code distinte: una per gli elementi a bassa priorita'
e l'altra per gli elementi ad alta priorita'
|
| PriorityTester | |
| Tester | |
| Tester2 |
| Exception | Description |
|---|---|
| EmptyQueueException |
Runtime exception thrown when one tries to perform operation front
or dequeue on an empty queue.
|
| FullQueueException |
Runtime exception thrown when one tries to perform operation front
or dequeue on an empty queue.
|