Class PriorityQueue<T>

A priority queue over a set of IComparable<T> objects.

Inheritance

object

PriorityQueue<T>

Implements

IEnumerable<T>

IEnumerable

Inherited Members

object.Equals(object)

object.Equals(object, object)

object.GetHashCode()

object.GetType()

object.MemberwiseClone()

object.ReferenceEquals(object, object)

object.ToString()

Namespace: NetTopologySuite.Utilities

Assembly: NetTopologySuite.dll

Syntax

public class PriorityQueue<T> : IEnumerable<T>, IEnumerable where T : IComparable<T>

Type Parameters

Name	Description
T	Objects to add

Constructors

PriorityQueue()

Creates an instance of this class

Declaration

public PriorityQueue()

PriorityQueue(int, IComparer<T>)

Creates an instance of this class

Declaration

public PriorityQueue(int capacity, IComparer<T> comparer)

Parameters

Type	Name	Description
int	capacity	The capacity of the queue
IComparer<T>	comparer	The comparer to use for computing priority values

Properties

Size

Returns size.

Declaration

public int Size { get; }

Property Value

Type	Description
int

Methods

Add(T)

Insert into the priority queue. Duplicates are allowed.

Declaration

public void Add(T x)

Parameters

Type	Name	Description
T	x	The item to insert.

Clear()

Make the priority queue logically empty.

Declaration

public void Clear()

GetEnumerator()

Declaration

public IEnumerator<T> GetEnumerator()

Returns

Type	Description
IEnumerator<T>

IsEmpty()

Test if the priority queue is logically empty.

Declaration

public bool IsEmpty()

Returns

Type	Description
bool	true if empty, false otherwise.

Peek()

Gets the smallest item without removing it from the queue

Declaration

public T Peek()

Returns

Type	Description
T

Poll()

Remove the smallest item from the priority queue.

Declaration

public T Poll()

Returns

Type	Description
T

Remarks

The smallest item, or default(T) if empty.

Implements

IEnumerable<T>

IEnumerable