mirror of
https://github.com/1dot13/source.git
synced 2026-07-22 13:40:22 +02:00
Added BinaryHeap.cpp for AStar pathfinding, somehow it got missed.
git-svn-id: https://ja2svn.mooo.com/source/ja2/trunk/GameSource/ja2_v1.13/Build@1346 3b4a5df2-a311-0410-b5c6-a8a6f20db521
This commit is contained in:
AalaarDB
@@ -0,0 +1,358 @@
|
||||
|
||||
|
||||
#ifndef BINARY_HEAP_HPP
|
||||
#define BINARY_HEAP_HPP
|
||||
|
||||
template <typename KEY = int, class T = int>
|
||||
class HEAP
|
||||
{
|
||||
public:
|
||||
KEY key;
|
||||
T data;
|
||||
|
||||
HEAP<KEY, T>(void){return;};
|
||||
HEAP<KEY, T>(T data, int key) {HEAP::data = data; HEAP::key = key; return;};
|
||||
|
||||
bool operator==(HEAP<KEY, T> &compare) {
|
||||
if (this->key == compare.key && this->data == compare.data) return true;
|
||||
else return false;
|
||||
}
|
||||
};
|
||||
|
||||
template <typename KEY = int, class T = int>
|
||||
class CBinaryHeap
|
||||
{
|
||||
/*
|
||||
CBinaryHeap ();
|
||||
CBinaryHeap (int size);
|
||||
~CBinaryHeap ();
|
||||
|
||||
HEAP<KEY, T> popTopHeap ();
|
||||
HEAP<KEY, T> popTopHeap (int& returnSize);
|
||||
HEAP<KEY, T> peekTopHeap () const;
|
||||
HEAP<KEY, T> peekElement (int index) const;
|
||||
int size () const;
|
||||
int getMaxSize () const;
|
||||
int insertElement (const T data, const KEY key);
|
||||
HEAP<KEY, T> removeElement (const T data, const KEY key);
|
||||
HEAP<KEY, T> removeElement (const T data);
|
||||
bool editElement (const T oldData, const T newData,
|
||||
const KEY oldKey, const KEY newKey);
|
||||
bool editElement (const T data, const KEY key);
|
||||
int findData (const T data) const;
|
||||
int findData (const T data, const KEY key) const;
|
||||
void clear (){heapCount = 1; return;};
|
||||
|
||||
private:
|
||||
int moveUp (int index, KEY newKey);
|
||||
int moveDown (int index, KEY newKey);
|
||||
|
||||
int heapCount;
|
||||
int maxSize;
|
||||
HEAP<KEY, T>* BinaryHeap;
|
||||
*/
|
||||
|
||||
|
||||
public:
|
||||
void clear ()
|
||||
{
|
||||
heapCount = 1;
|
||||
return;
|
||||
}
|
||||
|
||||
CBinaryHeap(int size)
|
||||
{
|
||||
if (size <= 0) {
|
||||
size = WORLD_MAX;
|
||||
}
|
||||
//size must be maxSize + 1, because 1 element is unused.
|
||||
BinaryHeap = new HEAP<KEY, T>[size+1];
|
||||
maxSize = size;
|
||||
heapCount = 1;
|
||||
return;
|
||||
}
|
||||
|
||||
CBinaryHeap()
|
||||
{
|
||||
//size must be maxSize + 1, because 1 element is unused.
|
||||
BinaryHeap = new HEAP<KEY, T>[WORLD_MAX+1];
|
||||
maxSize = WORLD_MAX;
|
||||
heapCount = 1;
|
||||
return;
|
||||
}
|
||||
|
||||
~CBinaryHeap()
|
||||
{
|
||||
delete BinaryHeap;
|
||||
}
|
||||
|
||||
HEAP<KEY, T> removeElement(const T data)
|
||||
{
|
||||
HEAP<KEY, T> returnHeap;
|
||||
int index = findData(data);
|
||||
if (index) {
|
||||
returnHeap = BinaryHeap[index];
|
||||
--heapCount;
|
||||
BinaryHeap[moveDown(index, BinaryHeap[heapCount].key)] = BinaryHeap[heapCount];
|
||||
}
|
||||
return (returnHeap);
|
||||
}
|
||||
|
||||
HEAP<KEY, T> removeElement(const T data, const KEY key)
|
||||
{
|
||||
HEAP<KEY, T> returnHeap;
|
||||
int index = findData(data, key);
|
||||
if (index) {
|
||||
returnHeap = BinaryHeap[index];
|
||||
--heapCount;
|
||||
BinaryHeap[moveDown(index, BinaryHeap[heapCount].key)] = BinaryHeap[heapCount];
|
||||
}
|
||||
return (returnHeap);
|
||||
}
|
||||
|
||||
int moveUp(register int index, KEY newKey)
|
||||
{
|
||||
while (index > 1) {
|
||||
int current2 = index>>1;//divided by 2
|
||||
if (BinaryHeap[current2].key > newKey) {
|
||||
//move parent down
|
||||
BinaryHeap[index] = BinaryHeap[current2];
|
||||
index = current2;
|
||||
}
|
||||
else {
|
||||
break;
|
||||
}
|
||||
}
|
||||
return (index);
|
||||
}
|
||||
|
||||
int moveDown(int index, KEY currentKey)
|
||||
{
|
||||
register int current2 = index+index;
|
||||
while (current2 < heapCount) {
|
||||
if (current2+1 < heapCount) {
|
||||
//choose child to possibly move
|
||||
current2 += (BinaryHeap[current2].key > BinaryHeap[current2+1].key);
|
||||
if (currentKey > BinaryHeap[current2].key) {
|
||||
//move child up
|
||||
BinaryHeap[index] = BinaryHeap[current2];
|
||||
index = current2;
|
||||
current2 += current2;//times 2
|
||||
}
|
||||
else {
|
||||
return index;
|
||||
}
|
||||
}
|
||||
else {
|
||||
if (currentKey > BinaryHeap[current2].key) {
|
||||
BinaryHeap[index] = BinaryHeap[current2];
|
||||
index = current2;
|
||||
}
|
||||
return index;
|
||||
}
|
||||
}
|
||||
return index;
|
||||
}
|
||||
|
||||
bool editElement(const T oldData, const T newData, const KEY oldKey, const KEY newKey)
|
||||
{
|
||||
int index = findData(oldData, oldKey);
|
||||
if (index) {
|
||||
if (oldKey < newKey) {
|
||||
index = moveDown(index, newKey);
|
||||
BinaryHeap[index].key = newKey;
|
||||
}
|
||||
else if (oldKey > newKey) {
|
||||
index = moveUp(index, newKey);
|
||||
BinaryHeap[index].key = newKey;
|
||||
}
|
||||
BinaryHeap[index].data = newData;
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
bool editElement(const T data, const KEY key)
|
||||
{
|
||||
int index = findData(data);
|
||||
if (index) {
|
||||
int oldKey = BinaryHeap[index].key;
|
||||
if (oldKey < key) {
|
||||
index = moveDown(index, key);
|
||||
BinaryHeap[index].data = data;
|
||||
BinaryHeap[index].key = key;
|
||||
}
|
||||
else if (oldKey > key) {
|
||||
index = moveUp(index, key);
|
||||
BinaryHeap[index].data = data;
|
||||
BinaryHeap[index].key = key;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
int insertElement(const T data, const KEY key)
|
||||
{
|
||||
if (heapCount > maxSize) {
|
||||
return 0;
|
||||
}
|
||||
int index = heapCount;
|
||||
while (index > 1) {
|
||||
int current2 = index>>1;//divided by 2
|
||||
if (BinaryHeap[current2].key > key) {
|
||||
//move parent down
|
||||
BinaryHeap[index] = BinaryHeap[current2];
|
||||
index = current2;
|
||||
}
|
||||
else {
|
||||
break;
|
||||
}
|
||||
}
|
||||
BinaryHeap[index].data = data;
|
||||
BinaryHeap[index].key = key;
|
||||
return (heapCount++);
|
||||
|
||||
/*
|
||||
if (heapCount > maxSize) {
|
||||
return 0;
|
||||
}
|
||||
__asm {
|
||||
mov ecx, [this]
|
||||
mov eax, [ecx]CBinaryHeap.heapCount
|
||||
mov ecx, [ecx]CBinaryHeap.BinaryHeap
|
||||
mov edx, key
|
||||
cmp eax, 1
|
||||
jle short insert
|
||||
|
||||
moveParentDown:
|
||||
mov esi, eax
|
||||
sar esi, 1
|
||||
cmp [ecx+esi*8], edx
|
||||
jle short insert//if parent key is higher, insert at current index
|
||||
cmp esi, 1
|
||||
mov ebx, [ecx+esi*8]
|
||||
mov [ecx+eax*8], ebx
|
||||
mov ebx, [ecx+esi*8+4]
|
||||
mov [ecx+eax*8+4], ebx
|
||||
mov eax, esi
|
||||
jg short moveParentDown
|
||||
|
||||
insert:
|
||||
mov esi, data
|
||||
mov [ecx+eax*8+4], esi
|
||||
mov [ecx+eax*8], edx
|
||||
mov ecx, [this]
|
||||
mov eax, [ecx]CBinaryHeap.heapCount//++heapCount
|
||||
mov edx, eax
|
||||
inc edx
|
||||
mov [ecx]CBinaryHeap.heapCount, edx//BinaryHeap.heapCount = heapCount
|
||||
}*/
|
||||
}
|
||||
|
||||
HEAP<KEY, T> popTopHeap(int& returnSize)
|
||||
{
|
||||
returnSize = heapCount-1;
|
||||
if (heapCount != 1) {
|
||||
return (popTopHeap());
|
||||
}
|
||||
return (BinaryHeap[0]);
|
||||
}
|
||||
|
||||
HEAP<KEY, T> popTopHeap()
|
||||
{
|
||||
HEAP<KEY, T> returnHeap;
|
||||
if (heapCount != 1) {
|
||||
returnHeap = BinaryHeap[1];
|
||||
--heapCount;
|
||||
KEY currentKey = BinaryHeap[heapCount].key;
|
||||
int current2 = 2;
|
||||
int index = 1;
|
||||
while (current2 < heapCount) {
|
||||
if (current2+1 < heapCount) {
|
||||
current2 += (BinaryHeap[current2].key > BinaryHeap[current2+1].key);
|
||||
//choose child to possibly move
|
||||
if (currentKey > BinaryHeap[current2].key) {
|
||||
//move child up
|
||||
BinaryHeap[index] = BinaryHeap[current2];
|
||||
index = current2;
|
||||
current2 += current2;//times 2
|
||||
}
|
||||
else {
|
||||
break;
|
||||
}
|
||||
}
|
||||
else {
|
||||
if (currentKey > BinaryHeap[current2].key) {
|
||||
BinaryHeap[index] = BinaryHeap[current2];
|
||||
index = current2;
|
||||
}
|
||||
break;
|
||||
}
|
||||
}
|
||||
BinaryHeap[index] = BinaryHeap[heapCount];
|
||||
}
|
||||
return (returnHeap);
|
||||
}
|
||||
|
||||
HEAP<KEY, T> peekTopHeap() const
|
||||
{
|
||||
return (BinaryHeap[(heapCount != 1)]);
|
||||
}
|
||||
|
||||
HEAP<KEY, T> peekElement(int index) const
|
||||
{
|
||||
if (index < heapCount) {
|
||||
return (BinaryHeap[index]);
|
||||
}
|
||||
else {
|
||||
return (BinaryHeap[0]);
|
||||
}
|
||||
}
|
||||
|
||||
int size() const
|
||||
{
|
||||
return (heapCount-1);
|
||||
}
|
||||
|
||||
int getMaxSize() const
|
||||
{
|
||||
return (maxSize);
|
||||
}
|
||||
|
||||
int findData(const T data) const
|
||||
{
|
||||
register int current;
|
||||
for (current = heapCount-1; current > 0; --current) {
|
||||
if (BinaryHeap[current].data == data) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
return current;
|
||||
}
|
||||
|
||||
int findData(const T data, const KEY key) const
|
||||
{
|
||||
register int current;
|
||||
if ((BinaryHeap[1].key + BinaryHeap[heapCount-1].key)>>1 > key) {
|
||||
for (current = 1; current <= heapCount-1; ++current) {
|
||||
if (BinaryHeap[current].data == data && BinaryHeap[current].key == key) {
|
||||
return current;
|
||||
}
|
||||
}
|
||||
}
|
||||
for (current = heapCount-1; current > 0; --current) {
|
||||
if (BinaryHeap[current].data == data && BinaryHeap[current].key == key) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
return current;
|
||||
}
|
||||
|
||||
private:
|
||||
int heapCount;
|
||||
int maxSize;
|
||||
HEAP<KEY, T>* BinaryHeap;
|
||||
};
|
||||
|
||||
#endif
|
||||
Reference in New Issue
Block a user