Definition at line 13 of file PriorityQueue.cs.
BenTools.Data.BinaryPriorityQueue.BinaryPriorityQueue |
( |
| ) |
|
BenTools.Data.BinaryPriorityQueue.BinaryPriorityQueue |
( |
IComparer |
c | ) |
|
BenTools.Data.BinaryPriorityQueue.BinaryPriorityQueue |
( |
int |
C | ) |
|
BenTools.Data.BinaryPriorityQueue.BinaryPriorityQueue |
( |
IComparer |
c, |
|
|
int |
Capacity |
|
) |
| |
BenTools.Data.BinaryPriorityQueue.BinaryPriorityQueue |
( |
ArrayList |
Core, |
|
|
IComparer |
Comp, |
|
|
bool |
Copy |
|
) |
| |
|
protected |
int IList. BenTools.Data.BinaryPriorityQueue.Add |
( |
object |
o | ) |
|
|
private |
void BenTools.Data.BinaryPriorityQueue.Clear |
( |
| ) |
|
object BenTools.Data.BinaryPriorityQueue.Clone |
( |
| ) |
|
bool BenTools.Data.BinaryPriorityQueue.Contains |
( |
object |
value | ) |
|
void BenTools.Data.BinaryPriorityQueue.CopyTo |
( |
Array |
array, |
|
|
int |
index |
|
) |
| |
IEnumerator IEnumerable. BenTools.Data.BinaryPriorityQueue.GetEnumerator |
( |
| ) |
|
|
private |
int IList. BenTools.Data.BinaryPriorityQueue.IndexOf |
( |
object |
value | ) |
|
|
private |
void IList. BenTools.Data.BinaryPriorityQueue.Insert |
( |
int |
index, |
|
|
object |
value |
|
) |
| |
|
private |
virtual int BenTools.Data.BinaryPriorityQueue.OnCompare |
( |
int |
i, |
|
|
int |
j |
|
) |
| |
|
protectedvirtual |
object BenTools.Data.BinaryPriorityQueue.Peek |
( |
| ) |
|
object BenTools.Data.BinaryPriorityQueue.Pop |
( |
| ) |
|
int BenTools.Data.BinaryPriorityQueue.Push |
( |
object |
O | ) |
|
Push an object onto the PQ
- Parameters
-
- 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.
void IList. BenTools.Data.BinaryPriorityQueue.Remove |
( |
object |
value | ) |
|
|
private |
void IList. BenTools.Data.BinaryPriorityQueue.RemoveAt |
( |
int |
index | ) |
|
|
private |
void BenTools.Data.BinaryPriorityQueue.SwitchElements |
( |
int |
i, |
|
|
int |
j |
|
) |
| |
|
protected |
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
-
i | The index of the changed object. |
Implements BenTools.Data.IPriorityQueue.
Definition at line 116 of file PriorityQueue.cs.
IComparer BenTools.Data.BinaryPriorityQueue.Comparer |
|
protected |
ArrayList BenTools.Data.BinaryPriorityQueue.InnerList = new ArrayList() |
|
protected |
int BenTools.Data.BinaryPriorityQueue.Count |
|
get |
bool IList. BenTools.Data.BinaryPriorityQueue.IsFixedSize |
|
getprivate |
bool IList. BenTools.Data.BinaryPriorityQueue.IsReadOnly |
|
getprivate |
bool BenTools.Data.BinaryPriorityQueue.IsSynchronized |
|
get |
object BenTools.Data.BinaryPriorityQueue.SyncRoot |
|
get |
object IList. BenTools.Data.BinaryPriorityQueue.this[int index] |
|
getsetprivate |
The documentation for this class was generated from the following file: