1 #ifndef BLANK_CHUNK_HPP_
2 #define BLANK_CHUNK_HPP_
5 #include "geometry.hpp"
10 #include <glm/glm.hpp>
15 /// cube of size 16 (256 tiles, 4096 blocks)
19 using Pos = glm::tvec3<int>;
22 explicit Chunk(const BlockTypeRegistry &);
25 Chunk &operator =(Chunk &&);
27 static constexpr int Width() { return 16; }
28 static constexpr int Height() { return 16; }
29 static constexpr int Depth() { return 16; }
30 static Pos Extent() { return { Width(), Height(), Depth() }; }
31 static constexpr int Size() { return Width() * Height() * Depth(); }
33 static AABB Bounds() { return AABB{ { 0, 0, 0 }, Extent() }; }
35 static constexpr bool InBounds(const Block::Pos &pos) {
37 pos.x >= 0 && pos.x < Width() &&
38 pos.y >= 0 && pos.y < Height() &&
39 pos.z >= 0 && pos.z < Depth();
41 static constexpr bool InBounds(const Pos &pos) {
43 pos.x >= 0 && pos.x < Width() &&
44 pos.y >= 0 && pos.y < Height() &&
45 pos.z >= 0 && pos.z < Depth();
47 static constexpr int ToIndex(const Pos &pos) {
48 return pos.x + pos.y * Width() + pos.z * Width() * Height();
50 static constexpr bool InBounds(int idx) {
51 return idx >= 0 && idx < Size();
53 static Block::Pos ToCoords(int idx) {
55 0.5f + (idx % Width()),
56 0.5f + ((idx / Width()) % Height()),
57 0.5f + (idx / (Width() * Height()))
60 static Pos ToPos(int idx) {
63 ((idx / Width()) % Height()),
64 (idx / (Width() * Height()))
67 glm::mat4 ToTransform(int idx) const;
69 static constexpr bool IsBorder(int idx) {
71 idx < Width() * Height() || // low Z plane
72 idx % Width() == 0 || // low X plane
73 (idx / (Width() * Height())) == Depth() - 1 || // high Z plane
74 idx % Width() == Width() - 1 || // high X plane
75 (idx / Width()) % Height() == 0 || // low Y plane
76 (idx / Width()) % Height() == Height() - 1; // high Y plane
79 bool IsSurface(int index) const { return IsSurface(ToPos(index)); }
80 bool IsSurface(const Block::Pos &pos) const { return IsSurface(Pos(pos)); }
81 bool IsSurface(const Pos &pos) const;
83 void SetNeighbor(Chunk &);
84 bool HasNeighbor(Block::Face f) const { return neighbor[f]; }
85 Chunk &GetNeighbor(Block::Face f) { return *neighbor[f]; }
86 const Chunk &GetNeighbor(Block::Face f) const { return *neighbor[f]; }
87 void ClearNeighbors();
91 // check if block at given index is completely enclosed (and therefore invisible)
92 bool Obstructed(int idx) const;
95 void Invalidate() { dirty = true; }
97 void SetBlock(int index, const Block &);
98 void SetBlock(const Block::Pos &pos, const Block &block) { SetBlock(ToIndex(pos), block); }
99 void SetBlock(const Pos &pos, const Block &block) { SetBlock(ToIndex(pos), block); }
101 const Block &BlockAt(int index) const { return blocks[index]; }
102 const Block &BlockAt(const Block::Pos &pos) const { return BlockAt(ToIndex(pos)); }
103 const Block &BlockAt(const Pos &pos) const { return BlockAt(ToIndex(pos)); }
105 const Block *FindNext(const Pos &pos, Block::Face face) const;
106 const Block *FindNext(const Block::Pos &pos, Block::Face face) const { return FindNext(Pos(pos), face); }
107 const Block *FindNext(int index, Block::Face face) const { return FindNext(ToPos(index), face); }
109 const BlockType &Type(const Block &b) const { return *types->Get(b.type); }
111 void SetLight(int index, int level);
112 void SetLight(const Pos &pos, int level) { SetLight(ToIndex(pos), level); }
113 void SetLight(const Block::Pos &pos, int level) { SetLight(ToIndex(pos), level); }
115 int GetLight(int index) const;
116 int GetLight(const Pos &pos) const { return GetLight(ToIndex(pos)); }
117 int GetLight(const Block::Pos &pos) const { return GetLight(ToIndex(pos)); }
119 float GetVertexLight(int index, const BlockModel::Position &, const BlockModel::Normal &) const;
126 return blank::Intersection(ray, Bounds(), M, &dist);
134 glm::vec3 &normal) const;
136 void Position(const Pos &);
137 const Pos &Position() const { return position; }
138 glm::mat4 Transform(const Pos &offset) const;
147 const BlockTypeRegistry *types;
148 Chunk *neighbor[Block::FACE_COUNT];
149 std::vector<Block> blocks;
150 std::vector<unsigned char> light;
161 // resolve chunk/position from oob coordinates
162 BlockLookup(Chunk *c, const Chunk::Pos &p);
164 // resolve chunk/position from ib coordinates and direction
165 BlockLookup(Chunk *c, const Chunk::Pos &p, Block::Face dir);
167 // check if lookup was successful
168 operator bool() const { return chunk; }
170 // only valid if lookup was successful
171 Chunk &GetChunk() const { return *chunk; }
172 const Chunk::Pos &GetBlockPos() const { return pos; }
173 const Block &GetBlock() const { return GetChunk().BlockAt(GetBlockPos()); }
174 const BlockType &GetType() const { return GetChunk().Type(GetBlock()); }
175 int GetLight() const { return GetChunk().GetLight(GetBlockPos()); }
194 ChunkLoader(const Config &, const BlockTypeRegistry &, const Generator &);
196 void Generate(const Chunk::Pos &from, const Chunk::Pos &to);
197 void GenerateSurrounding(const Chunk::Pos &);
199 std::list<Chunk> &Loaded() { return loaded; }
201 Chunk *Loaded(const Chunk::Pos &);
202 bool Queued(const Chunk::Pos &);
203 bool Known(const Chunk::Pos &);
204 Chunk &ForceLoad(const Chunk::Pos &);
206 void Rebase(const Chunk::Pos &);
210 Chunk &Generate(const Chunk::Pos &pos);
211 void Insert(Chunk &);
212 void Remove(Chunk &);
217 const BlockTypeRegistry ®
218 const Generator &gen;
220 std::list<Chunk> loaded;
221 std::list<Chunk::Pos> to_generate;
222 std::list<Chunk> to_free;