1
0
Fork 0
Univerxel/src/world/Universe.hpp

125 lines
3.9 KiB
C++
Raw Normal View History

2020-07-25 16:45:03 +00:00
#pragma once
#include <memory>
#include <thread>
2020-07-26 20:53:14 +00:00
#include <string>
2020-07-25 16:45:03 +00:00
#include "../data/safe_queue.hpp"
#include "../data/safe_priority_queue.hpp"
#include "../data/circular_buffer.hpp"
#include "Chunk.hpp"
#include "../data/geometry/Ray.hpp"
#define REPORT_BUFFER_SIZE 128
namespace contouring {
class Abstract;
};
using namespace data;
/// Universe data
namespace world {
/// Whole universe container
class Universe {
public:
/// Distance management
struct options {
/// Radius in chunks to load if missing
int loadDistance = 5;
/// Radius in chunks to keep in memory
int keepDistance = 6;
2020-07-26 20:53:14 +00:00
/// Storage path
std::string folderPath = "world";
2020-07-25 16:45:03 +00:00
};
/// Reports to UI
struct report {
/// Chunks in memory
circular_buffer<float> chunk_count = circular_buffer<float>(REPORT_BUFFER_SIZE, 0); // MAYBE: store int
/// Loaded chunks
circular_buffer<float> chunk_load = circular_buffer<float>(REPORT_BUFFER_SIZE, 0);
/// Saved chunks
circular_buffer<float> chunk_unload = circular_buffer<float>(REPORT_BUFFER_SIZE, 0);
};
Universe(const options&);
~Universe();
/// Update physics and contouring
void update(const camera_pos& pos, report& rep);
/// Apply new options
void setOptions(const options &);
/// Get nearest voxel colliding ray
/// @note ray in world scale
std::optional<std::pair<voxel_pos, Voxel>> raycast(const geometry::Ray &ray) const;
/// Set voxel at pos
std::optional<Item> set(const voxel_pos &pos, const Voxel &val);
/// Set cube of voxel with pos as center
ItemList setCube(const voxel_pos &pos, const Voxel &val, int radius);
/// Change contouring worker
void setContouring(std::shared_ptr<contouring::Abstract>);
/// Get current contouring worker
std::shared_ptr<contouring::Abstract> getContouring() const {
return contouring;
}
private:
chunk_pos last_pos = chunk_pos(INT_MAX);
/// Data
robin_hood::unordered_map<chunk_pos, std::shared_ptr<Chunk>> chunks;
std::optional<std::shared_ptr<Chunk>> at(const chunk_pos& pos) const {
const auto it = chunks.find(pos);
if(it == chunks.end())
return {};
return {it->second};
}
/// Generating worker pool
class LoadPool {
public:
2020-07-26 20:53:14 +00:00
LoadPool(size_t size, const std::string& folderPath);
2020-07-25 16:45:03 +00:00
~LoadPool();
Generator generator;
inline void push(const chunk_pos &pos, int weight);
inline bool pop(robin_hood::pair<chunk_pos, std::shared_ptr<Chunk>> &out);
inline size_t size();
private:
2020-07-26 20:53:14 +00:00
std::string folderPath;
2020-07-25 16:45:03 +00:00
std::vector<std::thread> workers;
bool running = true;
safe_priority_queue<chunk_pos, int> loadQueue;
safe_queue<robin_hood::pair<chunk_pos, std::shared_ptr<Chunk>>> loadedQueue;
};
LoadPool loadPool;
2020-07-26 20:53:14 +00:00
/// Write to file worker pool
class SavePool {
public:
SavePool(size_t size, const std::string& folderPath);
~SavePool();
inline void push(const robin_hood::pair<chunk_pos, std::shared_ptr<Chunk>> &chunk);
inline size_t size();
private:
std::string folderPath;
std::vector<std::thread> workers;
bool running = true;
safe_queue<robin_hood::pair<chunk_pos, std::shared_ptr<Chunk>>> queue; //NOTE: consider const Chunk
};
SavePool savePool;
2020-07-25 16:45:03 +00:00
int loadDistance;
int keepDistance;
2020-07-26 20:53:14 +00:00
std::string folderPath;
2020-07-25 16:45:03 +00:00
/// Contouring worker
std::shared_ptr<contouring::Abstract> contouring;
};
}