MCScheduling 1.0
Set of Algorithms for Solving Mixed-Criticality Scheduling
|
A priority queue implementation based on a binary heap structure, which guarantees that all the operations define has logarithmic time complexity. More...
Public Member Functions | |
PriorityQueue () | |
Creates a new priority queue with the default comparer. | |
PriorityQueue (IComparer< T > comparer) | |
Creates a new priority queue with the specified comparer. | |
void | Add (T item) |
Inserts the specified element into the queue. | |
void | RemoveMinimum () |
Removes the element with the minimum key value. | |
T | GetMinimum () |
Returns an element with the minimum key value. | |
void | Clear () |
Empties the queue. | |
System.Collections.ObjectModel.ReadOnlyCollection < T > | Items () |
Returns read-only list of the elements in the queue. | |
Properties | |
int | Count [get] |
Returns the number of items in the queue. |
A priority queue implementation based on a binary heap structure, which guarantees that all the operations define has logarithmic time complexity.
void MCScheduling.ClairvoyantEDF.PriorityQueue< T >.Add | ( | T | item | ) |
Inserts the specified element into the queue.
This increases the size of the queue by .
item | The element to be inserted into the queue. |
T MCScheduling.ClairvoyantEDF.PriorityQueue< T >.GetMinimum | ( | ) |
Returns an element with the minimum key value.
InvalidOperationException | When the queue is empty. |
System.Collections.ObjectModel.ReadOnlyCollection<T> MCScheduling.ClairvoyantEDF.PriorityQueue< T >.Items | ( | ) |
Returns read-only list of the elements in the queue.
MCScheduling.ClairvoyantEDF.PriorityQueue< T >.PriorityQueue | ( | IComparer< T > | comparer | ) |
Creates a new priority queue with the specified comparer.
comparer | The comparer used to determine the ordering of the elements within the queue. |
int MCScheduling.ClairvoyantEDF.PriorityQueue< T >.Count [get] |
Returns the number of items in the queue.