forked from Ares-Developers/YRpp
-
Notifications
You must be signed in to change notification settings - Fork 31
/
Copy pathPriorityQueueClass.h
151 lines (121 loc) · 2.2 KB
/
PriorityQueueClass.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
#pragma once
#include <Memory.h>
template<typename T, typename Pr = std::less<T>>
class PriorityQueueClass
{
public:
PriorityQueueClass(int capacity)
{
Capacity = capacity;
Nodes = (T**)YRMemory::Allocate(sizeof(T*) * (Capacity + 1));
Count = 0;
LMost = (T*)nullptr;
RMost = (T*)0xFFFFFFFF;
ClearAll();
}
~PriorityQueueClass()
{
YRMemory::Deallocate(Nodes);
Nodes = (T**)nullptr;
}
void Clear()
{
memset(Nodes, 0, sizeof(T*) * (Count + 1));
}
T* Top()
{
return Count == 0 ? nullptr : Nodes[1];
}
bool Pop()
{
if (Count == 0)
return false;
Nodes[1] = Nodes[Count--];
int now = 1;
while (now * 2 <= Count)
{
int next = now * 2;
if (next < Count && Comp(Nodes[next + 1], Nodes[next]))
++next;
if (Comp(Nodes[now], Nodes[next]))
break;
// Westwood did Nodes[now] = Nodes[next] here
std::swap(Nodes[now], Nodes[next]);
now = next;
}
return true;
}
bool Push(T* pValue)
{
if (Count >= Capacity)
return false;
Nodes[++Count] = pValue;
int now = Count;
while (now != 1)
{
int next = now / 2;
if (!Comp(Nodes[now], Nodes[next]))
break;
// Westwood did Nodes[now] = Nodes[next] here
std::swap(Nodes[now], Nodes[next]);
now = next;
}
return true;
}
bool WWPop()
{
if (Pop())
{
for (int i = 1; i <= Count; ++i)
WWPointerUpdate(Nodes[i]);
return true;
}
return false;
}
bool WWPush(T* pValue)
{
if (Push(pValue))
{
WWPointerUpdate(pValue);
return true;
}
return false;
}
private:
void ClearAll()
{
memset(Nodes, 0, sizeof(T*) * (Capacity + 1));
}
bool Comp(T* p1, T* p2)
{
return Pr()(*p1, *p2);
}
void WWPointerUpdate(T* pValue)
{
if (pValue > RMost)
RMost = pValue;
if (pValue < LMost)
LMost = pValue;
}
public:
int Capacity;
int Count;
T** Nodes;
T* LMost;
T* RMost;
};
struct PriorityQueueClassNode
{
static int __fastcall SurfaceDataCount() JMP_STD(0x42B1F0);
static int __fastcall ToSurfaceIndex(const CellStruct& mapCoord) JMP_STD(0x42B1C0);
int ToSurfaceIndex()
{
return ToSurfaceIndex(MapCoord);
}
CellStruct MapCoord;
float Score;
bool operator<(const PriorityQueueClassNode& another) const
{
return Score < another.Score;
}
};