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
|
/* This file is part of the Spring engine (GPL v2 or later), see LICENSE.html */
#ifndef QTPFS_PATH_HDR
#define QTPFS_PATH_HDR
#include <algorithm>
#include <vector>
#include "System/float3.h"
class CSolidObject;
namespace QTPFS {
struct IPath {
IPath() {
pathID = 0;
nextPointIndex = 0;
numPathUpdates = 0;
hash = -1u;
radius = 0.0f;
synced = true;
owner = NULL;
}
IPath(const IPath& p) { *this = p; }
IPath& operator = (const IPath& p) {
pathID = p.GetID();
nextPointIndex = p.GetNextPointIndex();
numPathUpdates = p.GetNumPathUpdates();
hash = p.GetHash();
radius = p.GetRadius();
synced = p.GetSynced();
points = p.GetPoints();
boundingBoxMins = p.GetBoundingBoxMins();
boundingBoxMaxs = p.GetBoundingBoxMaxs();
owner = p.GetOwner();
return *this;
}
~IPath() { points.clear(); }
void SetID(unsigned int pathID) { this->pathID = pathID; }
unsigned int GetID() const { return pathID; }
void SetNextPointIndex(unsigned int nextPointIndex) { this->nextPointIndex = nextPointIndex; }
void SetNumPathUpdates(unsigned int numPathUpdates) { this->numPathUpdates = numPathUpdates; }
unsigned int GetNextPointIndex() const { return nextPointIndex; }
unsigned int GetNumPathUpdates() const { return numPathUpdates; }
void SetHash(std::uint64_t hash) { this->hash = hash; }
void SetRadius(float radius) { this->radius = radius; }
void SetSynced(bool synced) { this->synced = synced; }
float GetRadius() const { return radius; }
std::uint64_t GetHash() const { return hash; }
bool GetSynced() const { return synced; }
void SetBoundingBox() {
boundingBoxMins.x = 1e6f; boundingBoxMaxs.x = -1e6f;
boundingBoxMins.z = 1e6f; boundingBoxMaxs.z = -1e6f;
for (unsigned int n = 0; n < points.size(); n++) {
boundingBoxMins.x = std::min(boundingBoxMins.x, points[n].x);
boundingBoxMins.z = std::min(boundingBoxMins.z, points[n].z);
boundingBoxMaxs.x = std::max(boundingBoxMaxs.x, points[n].x);
boundingBoxMaxs.z = std::max(boundingBoxMaxs.z, points[n].z);
}
}
const float3& GetBoundingBoxMins() const { return boundingBoxMins; }
const float3& GetBoundingBoxMaxs() const { return boundingBoxMaxs; }
void SetPoint(unsigned int i, const float3& p) { points[std::min(i, NumPoints() - 1)] = p; }
const float3& GetPoint(unsigned int i) const { return points[std::min(i, NumPoints() - 1)]; }
void SetSourcePoint(const float3& p) { assert(points.size() >= 2); points[ 0] = p; }
void SetTargetPoint(const float3& p) { assert(points.size() >= 2); points[points.size() - 1] = p; }
const float3& GetSourcePoint() const { return points[ 0]; }
const float3& GetTargetPoint() const { return points[points.size() - 1]; }
void SetOwner(const CSolidObject* o) { owner = o; }
const CSolidObject* GetOwner() const { return owner; }
unsigned int NumPoints() const { return (points.size()); }
void AllocPoints(unsigned int n) {
points.clear();
points.resize(n);
}
void CopyPoints(const IPath& p) {
AllocPoints(p.NumPoints());
for (unsigned int n = 0; n < p.NumPoints(); n++) {
points[n] = p.GetPoint(n);
}
}
const std::vector<float3>& GetPoints() const { return points; }
protected:
unsigned int pathID;
unsigned int nextPointIndex; // index of the next waypoint to be visited
unsigned int numPathUpdates; // number of times this path was invalidated
std::uint64_t hash;
float radius;
bool synced;
std::vector<float3> points;
// corners of the bounding-box containing all our points
float3 boundingBoxMins;
float3 boundingBoxMaxs;
// object that requested this path (NULL if none)
const CSolidObject* owner;
};
}
#endif
|
