Do not set speed_restriction for npr - advtrains.git

path: root/assets/manual_img/Bildschirmfoto_2016-09-17_09-58-20.png

diff options

author	orwell96 <orwell@bleipb.de>	2018-12-04 00:17:54 +0100
committer	orwell96 <orwell@bleipb.de>	2018-12-04 00:17:54 +0100
commit	e1a8a2e974205c7a0ad2da2c3284a2a782865528 (patch)
tree	e66e1418cc55912ac339fd285e49c0e9da2e10d1 /assets/manual_img/Bildschirmfoto_2016-09-17_09-58-20.png
parent	dd0c52d9aad151d1cfd206b12d6aab66a94b052f (diff)
download	advtrains-e1a8a2e974205c7a0ad2da2c3284a2a782865528.tar.gz advtrains-e1a8a2e974205c7a0ad2da2c3284a2a782865528.tar.bz2 advtrains-e1a8a2e974205c7a0ad2da2c3284a2a782865528.zip

Do not set speed_restriction for npr

Diffstat (limited to 'assets/manual_img/Bildschirmfoto_2016-09-17_09-58-20.png')

0 files changed, 0 insertions, 0 deletions

l pps">"face_position_cache.h" #include "threading/mutex_auto_lock.h" std::unordered_map<u16, std::vector<v3s16>> FacePositionCache::cache; std::mutex FacePositionCache::cache_mutex; // Calculate the borders of a "d-radius" cube const std::vector<v3s16> &FacePositionCache::getFacePositions(u16 d) { MutexAutoLock lock(cache_mutex); std::unordered_map<u16, std::vector<v3s16>>::const_iterator it = cache.find(d); if (it != cache.end()) return it->second; return generateFacePosition(d); } const std::vector<v3s16> &FacePositionCache::generateFacePosition(u16 d) { cache[d] = std::vector<v3s16>(); std::vector<v3s16> &c = cache[d]; if (d == 0) { c.emplace_back(0,0,0); return c; } if (d == 1) { // This is an optimized sequence of coordinates. c.emplace_back(0, 1, 0); // Top c.emplace_back(0, 0, 1); // Back c.emplace_back(-1, 0, 0); // Left c.emplace_back(1, 0, 0); // Right c.emplace_back(0, 0,-1); // Front c.emplace_back(0,-1, 0); // Bottom // 6 c.emplace_back(-1, 0, 1); // Back left c.emplace_back(1, 0, 1); // Back right c.emplace_back(-1, 0,-1); // Front left c.emplace_back(1, 0,-1); // Front right c.emplace_back(-1,-1, 0); // Bottom left c.emplace_back(1,-1, 0); // Bottom right c.emplace_back(0,-1, 1); // Bottom back c.emplace_back(0,-1,-1); // Bottom front c.emplace_back(-1, 1, 0); // Top left c.emplace_back(1, 1, 0); // Top right c.emplace_back(0, 1, 1); // Top back c.emplace_back(0, 1,-1); // Top front // 18 c.emplace_back(-1, 1, 1); // Top back-left c.emplace_back(1, 1, 1); // Top back-right c.emplace_back(-1, 1,-1); // Top front-left c.emplace_back(1, 1,-1); // Top front-right c.emplace_back(-1,-1, 1); // Bottom back-left c.emplace_back(1,-1, 1); // Bottom back-right c.emplace_back(-1,-1,-1); // Bottom front-left c.emplace_back(1,-1,-1); // Bottom front-right // 26 return c; } // Take blocks in all sides, starting from y=0 and going +-y for (s16 y = 0; y <= d - 1; y++) { // Left and right side, including borders for (s16 z =- d; z <= d; z++) { c.emplace_back(d, y, z); c.emplace_back(-d, y, z); if (y != 0) { c.emplace_back(d, -y, z); c.emplace_back(-d, -y, z); } } // Back and front side, excluding borders for (s16 x = -d + 1; x <= d - 1; x++) { c.emplace_back(x, y, d); c.emplace_back(x, y, -d); if (y != 0) { c.emplace_back(x, -y, d); c.emplace_back(x, -y, -d); } } } // Take the bottom and top face with borders // -d < x < d, y = +-d, -d < z < d for (s16 x = -d; x <= d; x++) for (s16 z = -d; z <= d; z++) { c.emplace_back(x, -d, z); c.emplace_back(x, d, z); } return c; }


context:
space:
mode: