C# 클래스 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

파일 보기 프로젝트 열기: rogeralsing/akka.net 1 사용 예제들

공개 메소드들

메소드	설명
Count ( ) : int
Dequeue ( ) : Envelope
Enqueue ( Envelope item ) : void
IsConsistent ( ) : bool
ListPriorityQueue ( ) : System
Peek ( ) : Envelope
SetPriorityCalculator ( int>.Func priorityCalculator ) : void
ToString ( ) : string

메소드 상세

Count() 공개 메소드

public Count ( ) : int
리턴	int

Dequeue() 공개 메소드

public Dequeue ( ) : Envelope
리턴	Akka.Actor.Envelope

Enqueue() 공개 메소드

public Enqueue ( Envelope item ) : void
item	Akka.Actor.Envelope
리턴	void

IsConsistent() 공개 메소드

public IsConsistent ( ) : bool
리턴	bool

ListPriorityQueue() 공개 메소드

public ListPriorityQueue ( ) : System
리턴	System

Peek() 공개 메소드

public Peek ( ) : Envelope
리턴	Akka.Actor.Envelope

SetPriorityCalculator() 공개 메소드

public SetPriorityCalculator ( int>.Func priorityCalculator ) : void
priorityCalculator	int>.Func
리턴	void

ToString() 공개 메소드

public ToString ( ) : string
리턴	string