C# 클래스 Voronoi.Algorithms.FortuneHelpers.BinaryPriorityQueue

상속: IPriorityQueue, ICollection, ICloneable, IList
파일 보기 프로젝트 열기: TobieD/City-Generator 1 사용 예제들

보호된 프로퍼티들

프로퍼티 타입 설명
Comparer IComparer
InnerList System.Collections.ArrayList

Private Properties

프로퍼티 타입 설명
IEnumerable IEnumerator
IList int

공개 메소드들

메소드 설명
BinaryPriorityQueue ( ) : System
BinaryPriorityQueue ( IComparer c ) : System
BinaryPriorityQueue ( IComparer c, int Capacity ) : System
BinaryPriorityQueue ( int C ) : System
Clear ( ) : void
Clone ( ) : object
Contains ( object value ) : bool
CopyTo ( Array array, int index ) : void
Peek ( ) : object

Get the smallest object without removing it.

Pop ( ) : object

Get the smallest object and remove it.

Push ( object O ) : int

Push an object onto the PQ

ReadOnly ( BinaryPriorityQueue P ) : BinaryPriorityQueue
Syncronized ( BinaryPriorityQueue P ) : BinaryPriorityQueue
Update ( int i ) : void

Notify the PQ that the object at position i has changed and the PQ needs to restore order. Since you dont have access to any indexes (except by using the explicit IList.this) you should not call this function without knowing exactly what you do.

보호된 메소드들

메소드 설명
BinaryPriorityQueue ( ArrayList Core, IComparer Comp, bool Copy ) : System
IList ( int index ) : void
IList ( int index, object value ) : void
IList ( object value ) : void
OnCompare ( int i, int j ) : int
SwitchElements ( int i, int j ) : void
this ( int index ) : objectIList.System

비공개 메소드들

메소드 설명
IEnumerable ( ) : IEnumerator
IList ( object o ) : int

메소드 상세

BinaryPriorityQueue() 공개 메소드

public BinaryPriorityQueue ( ) : System
리턴 System

BinaryPriorityQueue() 보호된 메소드

protected BinaryPriorityQueue ( ArrayList Core, IComparer Comp, bool Copy ) : System
Core System.Collections.ArrayList
Comp IComparer
Copy bool
리턴 System

BinaryPriorityQueue() 공개 메소드

public BinaryPriorityQueue ( IComparer c ) : System
c IComparer
리턴 System

BinaryPriorityQueue() 공개 메소드

public BinaryPriorityQueue ( IComparer c, int Capacity ) : System
c IComparer
Capacity int
리턴 System

BinaryPriorityQueue() 공개 메소드

public BinaryPriorityQueue ( int C ) : System
C int
리턴 System

Clear() 공개 메소드

public Clear ( ) : void
리턴 void

Clone() 공개 메소드

public Clone ( ) : object
리턴 object

Contains() 공개 메소드

public Contains ( object value ) : bool
value object
리턴 bool

CopyTo() 공개 메소드

public CopyTo ( Array array, int index ) : void
array System.Array
index int
리턴 void

IList() 보호된 메소드

protected IList ( int index ) : void
index int
리턴 void

IList() 보호된 메소드

protected IList ( int index, object value ) : void
index int
value object
리턴 void

IList() 보호된 메소드

protected IList ( object value ) : void
value object
리턴 void

OnCompare() 보호된 메소드

protected OnCompare ( int i, int j ) : int
i int
j int
리턴 int

Peek() 공개 메소드

Get the smallest object without removing it.
public Peek ( ) : object
리턴 object

Pop() 공개 메소드

Get the smallest object and remove it.
public Pop ( ) : object
리턴 object

Push() 공개 메소드

Push an object onto the PQ
public Push ( object O ) : int
O object The new object
리턴 int

ReadOnly() 공개 정적인 메소드

public static ReadOnly ( BinaryPriorityQueue P ) : BinaryPriorityQueue
P BinaryPriorityQueue
리턴 BinaryPriorityQueue

SwitchElements() 보호된 메소드

protected SwitchElements ( int i, int j ) : void
i int
j int
리턴 void

Syncronized() 공개 정적인 메소드

public static Syncronized ( BinaryPriorityQueue P ) : BinaryPriorityQueue
P BinaryPriorityQueue
리턴 BinaryPriorityQueue

Update() 공개 메소드

Notify the PQ that the object at position i has changed and the PQ needs to restore order. Since you dont have access to any indexes (except by using the explicit IList.this) you should not call this function without knowing exactly what you do.
public Update ( int i ) : void
i int The index of the changed object.
리턴 void

this() 보호된 메소드

protected this ( int index ) : objectIList.System
index int
리턴 objectIList.System

프로퍼티 상세

Comparer 보호되어 있는 프로퍼티

protected IComparer Comparer
리턴 IComparer

InnerList 보호되어 있는 프로퍼티

protected ArrayList,System.Collections InnerList
리턴 System.Collections.ArrayList