UnityMol  0.9.6-875
UnityMol viewer / In developement
BenTools.Data.BinaryPriorityQueue Class Reference
+ Inheritance diagram for BenTools.Data.BinaryPriorityQueue:
+ Collaboration diagram for BenTools.Data.BinaryPriorityQueue:

Public Member Functions

 BinaryPriorityQueue ()
 
 BinaryPriorityQueue (IComparer c)
 
 BinaryPriorityQueue (int C)
 
 BinaryPriorityQueue (IComparer c, int Capacity)
 
int Push (object O)
 
object Pop ()
 
void Update (int i)
 
object Peek ()
 
bool Contains (object value)
 
void Clear ()
 
void CopyTo (Array array, int index)
 
object Clone ()
 

Static Public Member Functions

static BinaryPriorityQueue Syncronized (BinaryPriorityQueue P)
 
static BinaryPriorityQueue ReadOnly (BinaryPriorityQueue P)
 

Protected Member Functions

 BinaryPriorityQueue (ArrayList Core, IComparer Comp, bool Copy)
 
void SwitchElements (int i, int j)
 
virtual int OnCompare (int i, int j)
 

Protected Attributes

ArrayList InnerList = new ArrayList()
 
IComparer Comparer
 

Properties

int Count [get]
 
bool IsSynchronized [get]
 
object SyncRoot [get]
 
bool IList. IsReadOnly [get]
 
object IList. this[int index] [get, set]
 
bool IList. IsFixedSize [get]
 

Private Member Functions

IEnumerator IEnumerable. GetEnumerator ()
 
int IList. Add (object o)
 
void IList. RemoveAt (int index)
 
void IList. Insert (int index, object value)
 
void IList. Remove (object value)
 
int IList. IndexOf (object value)
 

Detailed Description

Definition at line 13 of file PriorityQueue.cs.

Constructor & Destructor Documentation

BenTools.Data.BinaryPriorityQueue.BinaryPriorityQueue ( )

Definition at line 19 of file PriorityQueue.cs.

BenTools.Data.BinaryPriorityQueue.BinaryPriorityQueue ( IComparer  c)

Definition at line 21 of file PriorityQueue.cs.

BenTools.Data.BinaryPriorityQueue.BinaryPriorityQueue ( int  C)

Definition at line 25 of file PriorityQueue.cs.

BenTools.Data.BinaryPriorityQueue.BinaryPriorityQueue ( IComparer  c,
int  Capacity 
)

Definition at line 27 of file PriorityQueue.cs.

BenTools.Data.BinaryPriorityQueue.BinaryPriorityQueue ( ArrayList  Core,
IComparer  Comp,
bool  Copy 
)
protected

Definition at line 33 of file PriorityQueue.cs.

Member Function Documentation

int IList. BenTools.Data.BinaryPriorityQueue.Add ( object  o)
private

Definition at line 232 of file PriorityQueue.cs.

void BenTools.Data.BinaryPriorityQueue.Clear ( )

Definition at line 167 of file PriorityQueue.cs.

object BenTools.Data.BinaryPriorityQueue.Clone ( )

Definition at line 189 of file PriorityQueue.cs.

bool BenTools.Data.BinaryPriorityQueue.Contains ( object  value)

Definition at line 162 of file PriorityQueue.cs.

void BenTools.Data.BinaryPriorityQueue.CopyTo ( Array  array,
int  index 
)

Definition at line 184 of file PriorityQueue.cs.

IEnumerator IEnumerable. BenTools.Data.BinaryPriorityQueue.GetEnumerator ( )
private

Definition at line 179 of file PriorityQueue.cs.

int IList. BenTools.Data.BinaryPriorityQueue.IndexOf ( object  value)
private

Definition at line 252 of file PriorityQueue.cs.

void IList. BenTools.Data.BinaryPriorityQueue.Insert ( int  index,
object  value 
)
private

Definition at line 242 of file PriorityQueue.cs.

virtual int BenTools.Data.BinaryPriorityQueue.OnCompare ( int  i,
int  j 
)
protectedvirtual

Definition at line 50 of file PriorityQueue.cs.

object BenTools.Data.BinaryPriorityQueue.Peek ( )

Get the smallest object without removing it.

Returns
The smallest object

Implements BenTools.Data.IPriorityQueue.

Definition at line 155 of file PriorityQueue.cs.

object BenTools.Data.BinaryPriorityQueue.Pop ( )

Get the smallest object and remove it.

Returns
The smallest object

Implements BenTools.Data.IPriorityQueue.

Definition at line 85 of file PriorityQueue.cs.

int BenTools.Data.BinaryPriorityQueue.Push ( object  O)

Push an object onto the PQ

Parameters
OThe new object
Returns
The index in the list where the object is now. This will change when objects are taken from or put onto the PQ.

Implements BenTools.Data.IPriorityQueue.

Definition at line 61 of file PriorityQueue.cs.

static BinaryPriorityQueue BenTools.Data.BinaryPriorityQueue.ReadOnly ( BinaryPriorityQueue  P)
static
void IList. BenTools.Data.BinaryPriorityQueue.Remove ( object  value)
private

Definition at line 247 of file PriorityQueue.cs.

void IList. BenTools.Data.BinaryPriorityQueue.RemoveAt ( int  index)
private

Definition at line 237 of file PriorityQueue.cs.

void BenTools.Data.BinaryPriorityQueue.SwitchElements ( int  i,
int  j 
)
protected

Definition at line 43 of file PriorityQueue.cs.

static BinaryPriorityQueue BenTools.Data.BinaryPriorityQueue.Syncronized ( BinaryPriorityQueue  P)
static
void BenTools.Data.BinaryPriorityQueue.Update ( int  i)

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.

Parameters
iThe index of the changed object.

Implements BenTools.Data.IPriorityQueue.

Definition at line 116 of file PriorityQueue.cs.

Member Data Documentation

IComparer BenTools.Data.BinaryPriorityQueue.Comparer
protected
ArrayList BenTools.Data.BinaryPriorityQueue.InnerList = new ArrayList()
protected

Property Documentation

int BenTools.Data.BinaryPriorityQueue.Count
get

Definition at line 173 of file PriorityQueue.cs.

bool IList. BenTools.Data.BinaryPriorityQueue.IsFixedSize
getprivate

Definition at line 258 of file PriorityQueue.cs.

bool IList. BenTools.Data.BinaryPriorityQueue.IsReadOnly
getprivate

Definition at line 212 of file PriorityQueue.cs.

bool BenTools.Data.BinaryPriorityQueue.IsSynchronized
get

Definition at line 195 of file PriorityQueue.cs.

object BenTools.Data.BinaryPriorityQueue.SyncRoot
get

Definition at line 203 of file PriorityQueue.cs.

object IList. BenTools.Data.BinaryPriorityQueue.this[int index]
getsetprivate

Definition at line 220 of file PriorityQueue.cs.


The documentation for this class was generated from the following file: