mirror of
https://github.com/zhenyan121/Cubed.git
synced 2026-08-08 17:57:02 +08:00
7ecdab08fc
* refactor(chunk): add ChunkInfo and switch to shared_mutex for chunk access Introduced ChunkInfo struct to expose chunk metadata (position, seed, biome). Replaced std::mutex with std::shared_mutex for chunk map to allow concurrent read access. Added World::get_chunk_info() method. Temporarily disabled cave/river cleanup and debug biome reporting. * refactor(cave,river,chunk): use ChunkPos as key for paths and track cave existence * refactor(gameplay): use deterministic origin-based cave and river generation Compute cave and river paths on-the-fly per chunk from a deterministic origin instead of storing them globally. Remove concurrent hash map storage, shared mutexes, and related cleanup methods. This simplifies concurrency and reduces memory overhead. * refactor(world): remove unused chunk generation progress tracking
69 lines
2.6 KiB
C++
69 lines
2.6 KiB
C++
#include "Cubed/gameplay/cave_path.hpp"
|
|
|
|
#include "Cubed/tools/cubed_hash.hpp"
|
|
#include "Cubed/tools/math_tools.hpp"
|
|
|
|
#include <algorithm>
|
|
namespace Cubed {
|
|
CavePath::CavePath(unsigned int chunk_seed, unsigned world_seed,
|
|
const glm::vec3& start_pos) {
|
|
m_seed = HASH::combine_32(chunk_seed, world_seed);
|
|
m_random.init(m_seed);
|
|
m_yaw = m_random.random_float(0.0f, 360.0f);
|
|
m_pitch = m_random.random_float(-10.0f, 10.0f);
|
|
m_start_path_point.pos = start_pos;
|
|
m_start_path_point.rad_xz =
|
|
m_random.random_float(m_radius_xz_min, m_radius_xz_max);
|
|
m_start_path_point.rad_y =
|
|
m_random.random_float(m_radius_y_min, m_radius_y_max);
|
|
m_step = m_random.random_int(m_step_min, m_step_max);
|
|
m_points.reserve(m_step + 1);
|
|
m_points.push_back(m_start_path_point);
|
|
collect_path_points();
|
|
}
|
|
|
|
void CavePath::collect_path_points() {
|
|
|
|
for (int i = 0; i < m_step; i++) {
|
|
|
|
m_pitch = std::clamp(m_pitch, -90.0f, 90.0f);
|
|
|
|
float dx = std::cos(glm::radians(m_pitch)) *
|
|
std::sin(glm::radians(m_yaw)) * m_step_len;
|
|
float dy = std::sin(glm::radians(m_pitch)) * m_step_len;
|
|
float dz = std::cos(glm::radians(m_pitch)) *
|
|
std::cos(glm::radians(m_yaw)) * m_step_len;
|
|
|
|
m_points[i].tangent = glm::normalize(glm::vec3{dx, dy, dz});
|
|
|
|
float t = Math::smootherstep(0, m_step - 1, i);
|
|
|
|
float drad_xz = m_start_path_point.rad_xz * (1.0f - t);
|
|
float drad_y = m_start_path_point.rad_y * (1.0f - t);
|
|
drad_xz = std::max(drad_xz, 4.0f);
|
|
drad_y = std::max(drad_y, 4.0f);
|
|
m_points.emplace_back(m_points[i].pos + glm::vec3{dx, dy, dz}, drad_xz,
|
|
drad_y);
|
|
|
|
m_yaw += m_random.random_float(m_delta_angle_min, m_delta_angle_max);
|
|
m_pitch += m_random.random_float(m_delta_angle_min, m_delta_angle_max);
|
|
}
|
|
auto n = m_points.size();
|
|
if (n >= 2) {
|
|
m_points[n - 1].tangent = m_points[n - 2].tangent;
|
|
}
|
|
}
|
|
|
|
const std::vector<PathPoint>& CavePath::points() const { return m_points; }
|
|
|
|
float& CavePath::radius_xz_min() { return m_radius_xz_min; }
|
|
float& CavePath::radius_xz_max() { return m_radius_xz_max; }
|
|
float& CavePath::radius_y_min() { return m_radius_y_min; }
|
|
float& CavePath::radius_y_max() { return m_radius_y_max; }
|
|
float& CavePath::delta_angle_min() { return m_delta_angle_min; }
|
|
float& CavePath::delta_angle_max() { return m_delta_angle_max; }
|
|
int& CavePath::step_min() { return m_step_min; }
|
|
int& CavePath::step_max() { return m_step_max; }
|
|
int CavePath::step_len() { return m_step_len; }
|
|
} // namespace Cubed
|