MCScheduling 1.0
Set of Algorithms for Solving Mixed-Criticality Scheduling
Public Member Functions | Properties
MCScheduling.ClairvoyantEDF.PriorityQueue< T > Class Template Reference

A priority queue implementation based on a binary heap structure, which guarantees that all the operations define has logarithmic time complexity. More...

List of all members.

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.
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.

Detailed Description

template<T>
class MCScheduling::ClairvoyantEDF::PriorityQueue< T >

A priority queue implementation based on a binary heap structure, which guarantees that all the operations define has logarithmic time complexity.

Author:
Tomas Tunys

Member Function Documentation

template<T >
void MCScheduling.ClairvoyantEDF.PriorityQueue< T >.Add ( item)

Inserts the specified element into the queue.

This increases the size of the queue by .

Parameters:
itemThe element to be inserted into the queue.
template<T >
T MCScheduling.ClairvoyantEDF.PriorityQueue< T >.GetMinimum ( )

Returns an element with the minimum key value.

Returns:
An element with the minimum key value.
Exceptions:
InvalidOperationExceptionWhen the queue is empty.
template<T >
System.Collections.ObjectModel.ReadOnlyCollection<T> MCScheduling.ClairvoyantEDF.PriorityQueue< T >.Items ( )

Returns read-only list of the elements in the queue.

Returns:
A read-only list of elements in the queue.
template<T >
MCScheduling.ClairvoyantEDF.PriorityQueue< T >.PriorityQueue ( IComparer< T >  comparer)

Creates a new priority queue with the specified comparer.

Parameters:
comparerThe comparer used to determine the ordering of the elements within the queue.

Property Documentation

template<T >
int MCScheduling.ClairvoyantEDF.PriorityQueue< T >.Count [get]

Returns the number of items in the queue.

Returns:
The number of items in the queue.
 All Classes Namespaces Functions Variables Properties