Class FixedCapacityMinBinaryHeap<T>

Namespace

AlgorithmsSW.PriorityQueue

Assembly

AlgorithmsSW.dll

A container that allows efficient insertions and retrieval of the minimum element.

[AlgorithmReference(2, 6)]
public sealed class FixedCapacityMinBinaryHeap<T> : IPriorityQueue<T>, IEnumerable<T>, IEnumerable

Type Parameters

T

Inheritance

object

FixedCapacityMinBinaryHeap<T>

Implements

IPriorityQueue<T>

IEnumerable<T>

IEnumerable

Inherited Members

object.Equals(object)

object.Equals(object, object)

object.GetHashCode()

object.GetType()

object.ReferenceEquals(object, object)

Extension Methods

Applications.ApplyInterpolationRule<T, TBuffer>(TBuffer, Func<T, T, T>)

Applications.ApplyInterpolationRule<T, TBuffer>(TBuffer, Func<T, T, T>, int)

Applications.Interpolate<T, TBuffer>(TBuffer, Func<T, T, T>, int)

Applications.Substitute<T, TBuffer>(TBuffer, (T input, T[] output)[])

Comparable.ToComparable<T>(T, IComparer<T>)

Formatter.AsText<T>(T?)

Formatter.Describe<TLabel, TDescription>(TLabel, TDescription, string)

Formatter.Log<T>(T)

Formatter.Pretty<T>(T, params int[])

PriorityQueueExtensions.IsEmpty<T>(IPriorityQueue<T>)

PriorityQueueExtensions.IsSingleton<T>(IPriorityQueue<T>)

PriorityQueueExtensions.ToSortedArray<T>(IPriorityQueue<T>)

PriorityQueueExtensions.ToSortedList<T>(IPriorityQueue<T>)

Algorithms.Buffer2<T>(IEnumerable<T>)

Algorithms.IndexWhere<T>(IEnumerable<T>, Func<T, bool>)

Algorithms.JosephusSequence<T>(IEnumerable<T>, int)

CollectionExtensions.CopyTo<T>(IEnumerable<T>, IRandomAccessList<T>, int)

CollectionExtensions.CopyTo<T>(IEnumerable<T>, T[], int)

CollectionExtensions.GenerateAllPairs<T>(IEnumerable<T>)

CollectionExtensions.GenerateDistinctPairs<T>(IEnumerable<T>)

CollectionExtensions.Group<T>(IEnumerable<T>, int)

CollectionExtensions.ToResizableArray<T>(IEnumerable<T>)

CollectionExtensions.ToResizableArray<T>(IEnumerable<T>, int)

CollectionExtensions.ToSet<T>(IEnumerable<T>, IComparer<T>)

ListExtensions.AsList<T>(IEnumerable<T>)

ListExtensions.CircularSlidingWindow2<T>(IEnumerable<T?>)

ListExtensions.CircularSlidingWindow<T>(IEnumerable<T>, int)

ListExtensions.SlidingWindow2<T>(IEnumerable<T?>)

ListExtensions.SlidingWindow<T>(IEnumerable<T>, int)

ListExtensions.ToRandomAccessList<T>(IEnumerable<T>)

StringSort.CountOccurrences<T>(IEnumerable<T>, IComparer<T>)

Formatter.AsText<T>(IEnumerable<T>?, string)

Constructors

FixedCapacityMinBinaryHeap(int, IComparer<T>)

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

Parameters

capacity int

comparer IComparer<T>

Properties

Capacity

public int Capacity { get; }

Property Value

int

Count

public int Count { get; }

Property Value

int

IsEmpty

public bool IsEmpty { get; }

Property Value

bool

IsFull

public bool IsFull { get; }

Property Value

bool

IsSingleton

public bool IsSingleton { get; }

Property Value

bool

PeekMin

public T PeekMin { get; }

Property Value

T

Methods

AssertSatisfyHeapProperty()

[Conditional("WITH_INSTRUMENTATION")]
public void AssertSatisfyHeapProperty()

GetEnumerator()

Returns an enumerator that iterates through the collection.

public IEnumerator<T> GetEnumerator()

Returns

IEnumerator<T>

An enumerator that can be used to iterate through the collection.

PopMax()

public T PopMax()

Returns

T

PopMin()

Retrieves and removes the minimum element in the heap.

public T PopMin()

Returns

T

Exceptions

InvalidOperationException

the heap is empty.

Push(T)

Pushes a new element onto the heap.

public void Push(T item)

Parameters

item T

Exceptions

InvalidOperationException

the heap is full.

ArgumentNullException

item is null.

ToPrettyString()

public string ToPrettyString()

Returns

string

ToString()

Returns a string that represents the current object.

public override string ToString()

Returns

string

A string that represents the current object.