47 lines
1.6 KiB
C++
47 lines
1.6 KiB
C++
|
#pragma once
|
||
|
|
|
||
|
|
#include "forward.h"
|
||
|
|
#include <shared_mutex_guarded.h>
|
||
|
|
using namespace libguarded;
|
||
|
|
#include "region/index.hpp"
|
||
|
|
#include "Generator.hpp"
|
||
|
|
|
||
|
|
namespace world {
|
||
|
|
/// Chunk map with restricted access
|
||
|
|
struct ChunkContainer: robin_hood::unordered_map<chunk_pos, std::shared_ptr<Chunk>> {
|
||
|
|
private:
|
||
|
|
int radius;
|
||
|
|
|
||
|
|
public:
|
||
|
|
ChunkContainer(int radius): radius(radius) {
|
||
|
|
assert(radius < (1 << 22) / CHUNK_LENGTH);
|
||
|
|
}
|
||
|
|
inline bool inRange(const chunk_pos& pos) const {
|
||
|
|
return glm::abs(pos.x) < radius && glm::abs(pos.y) < radius && glm::abs(pos.z) < radius;
|
||
|
|
}
|
||
|
|
std::optional<std::shared_ptr<Chunk>> findInRange(const chunk_pos &pos) const;
|
||
|
|
std::optional<std::shared_ptr<const Chunk>> findOrEmpty(const chunk_pos &pos) const;
|
||
|
|
};
|
||
|
|
|
||
|
|
/// Area (aka big group of chunks)
|
||
|
|
struct Area {
|
||
|
|
public:
|
||
|
|
using regions_t = robin_hood::unordered_map<region_pos, std::shared_ptr<Region>>;
|
||
|
|
|
||
|
|
/// radius: size in chunk (length = radius * 2 + 1)
|
||
|
|
Area(int radius, int seed = 42): chunks(radius), generator(seed) { }
|
||
|
|
|
||
|
|
inline const ChunkContainer &getChunks() const { return chunks; }
|
||
|
|
inline ChunkContainer &setChunks() { return chunks; }
|
||
|
|
std::shared_ptr<Region> getRegion(const std::string& folderPath, const area_<region_pos> &);
|
||
|
|
shared_guarded<regions_t>::handle getRegions() { return regions.lock(); }
|
||
|
|
inline Generator &getGenerator() { return generator; }
|
||
|
|
|
||
|
|
private:
|
||
|
|
//TODO: position rotation
|
||
|
|
ChunkContainer chunks;
|
||
|
|
shared_guarded<regions_t> regions;
|
||
|
|
|
||
|
|
Generator generator;
|
||
|
|
};
|
||
|
|
}
|