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
|
/* This file is part of the Spring engine (GPL v2 or later), see LICENSE.html */
#ifndef PATHCACHE_H
#define PATHCACHE_H
#include <deque>
#include "IPath.h"
#include "System/type2.h"
#include "System/UnorderedMap.hpp"
class CPathCache
{
public:
CPathCache(int blocksX, int blocksZ);
~CPathCache();
struct CacheItem {
IPath::SearchResult result;
IPath::Path path;
int2 strtBlock;
int2 goalBlock;
float goalRadius;
int pathType;
};
void Update();
bool AddPath(
const IPath::Path* path,
const IPath::SearchResult result,
const int2 strtBlock,
const int2 goalBlock,
float goalRadius,
int pathType
);
const CacheItem& GetCachedPath(
const int2 strtBlock,
const int2 goalBlock,
float goalRadius,
int pathType
);
private:
void RemoveFrontQueItem();
std::uint64_t GetHash(
const int2 strtBlk,
const int2 goalBlk,
std::uint32_t goalRadius,
std::int32_t pathType
) const;
bool HashCollision(
const CacheItem& ci,
const int2 strtBlk,
const int2 goalBlk,
float goalRadius,
int pathType
) const;
float GetCacheHitPercentage() const {
if ((numCacheHits + numCacheMisses) == 0)
return 0.0f;
return ((numCacheHits / float(numCacheHits + numCacheMisses)) * 100.0f);
}
private:
struct CacheQueItem {
std::int32_t timeout;
std::uint64_t hash;
};
// returned on any cache-miss
CacheItem dummyCacheItem;
std::deque<CacheQueItem> cacheQue;
spring::unordered_map<std::uint64_t, CacheItem> cachedPaths; // ints are sync-safe keys
std::uint32_t numBlocksX;
std::uint32_t numBlocksZ;
std::uint64_t numBlocks;
std::uint64_t maxCacheSize;
std::uint32_t numCacheHits;
std::uint32_t numCacheMisses;
std::uint32_t numHashCollisions;
};
#endif
|
