SortedQueueTKey, TValue Class

Creates a SortedQueueTKey, TValue. This class allows adding items in random order, but dequeuing based upon the sorting of

Inheritance Hierarchy

SystemObject
GSF.CollectionsSortedQueueTKey, TValue

Namespace: GSF.Collections
Assembly: GSF.Core (in GSF.Core.dll) Version: 2.4.181-beta

Syntax

public class SortedQueue<TKey, TValue>

Public Class SortedQueue(Of TKey, TValue)

generic<typename TKey, typename TValue>
public ref class SortedQueue

type SortedQueue<'TKey, 'TValue> = class end

JavaScript does not support generic types or methods.

The SortedQueueTKey, TValue type exposes the following members.

Constructors

	Name	Description
	SortedQueueTKey, TValue	Creates a SortedQueueTKey, TValue

Properties

	Name	Description
	Count	Gets the number of items in the queue;
	Head	Gets the first item in the queue. Throws an exception if it does not exist.
	Item	An indexer

Methods

	Name	Description
	Dequeue	Removes the first item in the list.
	Enqueue	Queues an item in the list.
	Equals	Determines whether the specified object is equal to the current object. (Inherited from Object)
	Finalize	Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object)
	GetHashCode	Serves as the default hash function. (Inherited from Object)
	GetType	Gets the Type of the current instance. (Inherited from Object)
	MemberwiseClone	Creates a shallow copy of the current Object. (Inherited from Object)
	ToString	Returns a string that represents the current object. (Inherited from Object)
	TryGetValue	Attempts to get the provided item.

Extension Methods

	Name	Description
	GetEnumValueOrDefault	Gets the enumeration constant for value, if defined in the enumeration, or a default value. (Defined by EnumExtensions)
	GetEnumValueOrDefaultT	Gets the enumeration constant for this value, if defined in the enumeration, or a default value. (Defined by EnumExtensions)

Remarks

Under the surface, it's using a SortedListTKey, TValue and may not be extremely fast for large item lists.