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
|
#ifndef WISHLIST_H
#define WISHLIST_H
#include <vector>
#include <queue>
#include <map>
#include <algorithm>
#include "headers/Defines.h"
class AIClasses;
struct UnitType;
struct Wish {
enum NPriority { LOW = 0, NORMAL, HIGH };
unitCategory goalCats;
NPriority p;
UnitType* ut;
Wish():p(NORMAL),ut(NULL) {}
Wish(UnitType* ut, NPriority p, unitCategory gcats):goalCats(gcats) {
this->ut = ut;
this->p = p;
}
bool operator< (const Wish &w) const {
return p > w.p;
}
bool operator== (const Wish &w) const {
return p == w.p;
}
};
class CWishList {
public:
CWishList(AIClasses *ai);
~CWishList();
/* Insert a unit in the wishlist, sorted by priority p */
void push(unitCategory include, unitCategory exclude = 0, Wish::NPriority p = Wish::NORMAL);
/* Remove the top unit from the wishlist */
void pop(int factory);
/* Is empty ? */
bool empty(int factory);
/* View the top unit from the wishlist */
Wish top(int factory);
private:
AIClasses* ai;
int maxWishlistSize;
std::map<int, std::vector<Wish> > wishlist; /* <factory_def_id, wish> */
void unique(std::vector<Wish>& vector);
};
#endif
|
