C# Class Akka.Util.ListPriorityQueue

Priority queue implemented using a simple list with binary search for inserts. This specific implementation is cheap in terms of memory but weak in terms of performance. See http://visualstudiomagazine.com/articles/2012/11/01/priority-queues-with-c.aspx for original implementation This specific version is adapted for Envelopes only and calculates a priority of envelope.Message

Datei anzeigen Open project: rogeralsing/akka.net Class Usage Examples

Public Methods

Method	Description
Count ( ) : int
Dequeue ( ) : Envelope
Enqueue ( Envelope item ) : void
IsConsistent ( ) : bool
ListPriorityQueue ( ) : System
Peek ( ) : Envelope
SetPriorityCalculator ( int>.Func priorityCalculator ) : void
ToString ( ) : string

Method Details

Count() public method

public Count ( ) : int
return	int

Dequeue() public method

public Dequeue ( ) : Envelope
return	Akka.Actor.Envelope

Enqueue() public method

public Enqueue ( Envelope item ) : void
item	Akka.Actor.Envelope
return	void

IsConsistent() public method

public IsConsistent ( ) : bool
return	bool

ListPriorityQueue() public method

public ListPriorityQueue ( ) : System
return	System

Peek() public method

public Peek ( ) : Envelope
return	Akka.Actor.Envelope

SetPriorityCalculator() public method

public SetPriorityCalculator ( int>.Func priorityCalculator ) : void
priorityCalculator	int>.Func
return	void

ToString() public method

public ToString ( ) : string
return	string