Add function to step through freight codes - advtrains.git

diff options

author	Gabriel Pérez-Cerezo <gabriel@gpcf.eu>	2020-07-26 23:28:24 +0200
committer	Gabriel Pérez-Cerezo <gabriel@gpcf.eu>	2020-07-26 23:30:07 +0200
commit	45413ee5c031d9d44342a09f4ac8b412a75568be (patch)
tree	3502fafaed7d8e4fca704b09cab3381f694a1453 /advtrains/models/advtrains_dtrack_swrst_60.b3d
parent	c54e0b341a88349e1a4fc7d902fdd9d9e1a6040d (diff)
download	advtrains-45413ee5c031d9d44342a09f4ac8b412a75568be.tar.gz advtrains-45413ee5c031d9d44342a09f4ac8b412a75568be.tar.bz2 advtrains-45413ee5c031d9d44342a09f4ac8b412a75568be.zip

Add function to step through freight codes

Diffstat (limited to 'advtrains/models/advtrains_dtrack_swrst_60.b3d')

0 files changed, 0 insertions, 0 deletions

/* Minetest Copyright (C) 2015-2020 paramat Copyright (C) 2014-2016 kwolekr, Ryan Kwolek <kwolekr@minetest.net> This program is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. */ #include "mg_ore.h" #include "mapgen.h" #include "noise.h" #include "map.h" #include "log.h" #include "util/numeric.h" #include <cmath> #include <algorithm> FlagDesc flagdesc_ore[] = { {"absheight", OREFLAG_ABSHEIGHT}, // Non-functional {"puff_cliffs", OREFLAG_PUFF_CLIFFS}, {"puff_additive_composition", OREFLAG_PUFF_ADDITIVE}, {NULL, 0} }; /////////////////////////////////////////////////////////////////////////////// OreManager::OreManager(IGameDef *gamedef) : ObjDefManager(gamedef, OBJDEF_ORE) { } size_t OreManager::placeAllOres(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax) { size_t nplaced = 0; for (size_t i = 0; i != m_objects.size(); i++) { Ore *ore = (Ore *)m_objects[i]; if (!ore) continue; nplaced += ore->placeOre(mg, blockseed, nmin, nmax); blockseed++; } return nplaced; } void OreManager::clear() { for (ObjDef *object : m_objects) { Ore *ore = (Ore *) object; delete ore; } m_objects.clear(); } OreManager *OreManager::clone() const { auto mgr = new OreManager(); ObjDefManager::cloneTo(mgr); return mgr; } /////////////////////////////////////////////////////////////////////////////// Ore::~Ore() { delete noise; } void Ore::resolveNodeNames() { getIdFromNrBacklog(&c_ore, "", CONTENT_AIR); getIdsFromNrBacklog(&c_wherein); } size_t Ore::placeOre(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax) { if (nmin.Y > y_max || nmax.Y < y_min) return 0; int actual_ymin = MYMAX(nmin.Y, y_min); int actual_ymax = MYMIN(nmax.Y, y_max); if (clust_size >= actual_ymax - actual_ymin + 1) return 0; nmin.Y = actual_ymin; nmax.Y = actual_ymax; generate(mg->vm, mg->seed, blockseed, nmin, nmax, mg->biomemap); return 1; } void Ore::cloneTo(Ore *def) const { ObjDef::cloneTo(def); NodeResolver::cloneTo(def); def->c_ore = c_ore; def->c_wherein = c_wherein; def->clust_scarcity = clust_scarcity; def->clust_num_ores = clust_num_ores; def->clust_size = clust_size; def->y_min = y_min; def->y_max = y_max; def->ore_param2 = ore_param2; def->flags = flags; def->nthresh = nthresh; def->np = np; def->noise = nullptr; // cannot be shared! so created on demand def->biomes = biomes; } /////////////////////////////////////////////////////////////////////////////// ObjDef *OreScatter::clone() const { auto def = new OreScatter(); Ore::cloneTo(def); return def; } void OreScatter::generate(MMVManip *vm, int mapseed, u32 blockseed, v3s16 nmin, v3s16 nmax, biome_t *biomemap) { PcgRandom pr(blockseed); MapNode n_ore(c_ore, 0, ore_param2); u32 sizex = (nmax.X - nmin.X + 1); u32 volume = (nmax.X - nmin.X + 1) * (nmax.Y - nmin.Y + 1) * (nmax.Z - nmin.Z + 1); u32 csize = clust_size; u32 cvolume = csize * csize * csize; u32 nclusters = volume / clust_scarcity; for (u32 i = 0; i != nclusters; i++) { int x0 = pr.range(nmin.X, nmax.X - csize + 1); int y0 = pr.range(nmin.Y, nmax.Y - csize + 1); int z0 = pr.range(nmin.Z, nmax.Z - csize + 1); if ((flags & OREFLAG_USE_NOISE) && (NoisePerlin3D(&np, x0, y0, z0, mapseed) < nthresh)) continue; if (biomemap && !biomes.empty()) { u32 index = sizex * (z0 - nmin.Z) + (x0 - nmin.X); auto it = biomes.find(biomemap[index]); if (it == biomes.end()) continue; } for (u32 z1 = 0; z1 != csize; z1++) for (u32 y1 = 0; y1 != csize; y1++) for (u32 x1 = 0; x1 != csize; x1++) { if (pr.range(1, cvolume) > clust_num_ores) continue; u32 i = vm->m_area.index(x0 + x1, y0 + y1, z0 + z1); if (!CONTAINS(c_wherein, vm->m_data[i].getContent())) continue; vm->m_data[i] = n_ore; } } } /////////////////////////////////////////////////////////////////////////////// ObjDef *OreSheet::clone() const { auto def = new OreSheet(); Ore::cloneTo(def); def->column_height_max = column_height_max; def->column_height_min = column_height_min; def->column_midpoint_factor = column_midpoint_factor; return def; } void OreSheet::generate(MMVManip *vm, int mapseed, u32 blockseed, v3s16 nmin, v3s16 nmax, biome_t *biomemap) { PcgRandom pr(blockseed + 4234); MapNode n_ore(c_ore, 0, ore_param2); u16 max_height = column_height_max; int y_start_min = nmin.Y + max_height; int y_start_max = nmax.Y - max_height; int y_start = y_start_min < y_start_max ? pr.range(y_start_min, y_start_max) : (y_start_min + y_start_max) / 2; if (!noise) { int sx = nmax.X - nmin.X + 1; int sz = nmax.Z - nmin.Z + 1; noise = new Noise(&np, 0, sx, sz); } noise->seed = mapseed + y_start; noise->perlinMap2D(nmin.X, nmin.Z); size_t index = 0; for (int z = nmin.Z; z <= nmax.Z; z++) for (int x = nmin.X; x <= nmax.X; x++, index++) { float noiseval = noise->result[index]; if (noiseval < nthresh) continue; if (biomemap && !biomes.empty()) { auto it = biomes.find(biomemap[index]); if (it == biomes.end()) continue; } u16 height = pr.range(column_height_min, column_height_max); int ymidpoint = y_start + noiseval; int y0 = MYMAX(nmin.Y, ymidpoint - height * (1 - column_midpoint_factor)); int y1 = MYMIN(nmax.Y, y0 + height - 1); for (int y = y0; y <= y1; y++) { u32 i = vm->m_area.index(x, y, z); if (!vm->m_area.contains(i)) continue; if (!CONTAINS(c_wherein, vm->m_data[i].getContent())) continue; vm->m_data[i] = n_ore; } } } /////////////////////////////////////////////////////////////////////////////// OrePuff::~OrePuff() { delete noise_puff_top; delete noise_puff_bottom; } ObjDef *OrePuff::clone() const { auto def = new OrePuff(); Ore::cloneTo(def); def->np_puff_top = np_puff_top; def->np_puff_bottom = np_puff_bottom; def->noise_puff_top = nullptr; // cannot be shared, on-demand def->noise_puff_bottom = nullptr; return def; } void OrePuff::generate(MMVManip *vm, int mapseed, u32 blockseed, v3s16 nmin, v3s16 nmax, biome_t *biomemap) { PcgRandom pr(blockseed + 4234); MapNode n_ore(c_ore, 0, ore_param2); int y_start = pr.range(nmin.Y, nmax.Y); if (!noise) { int sx = nmax.X - nmin.X + 1; int sz = nmax.Z - nmin.Z + 1; noise = new Noise(&np, 0, sx, sz); noise_puff_top = new Noise(&np_puff_top, 0, sx, sz); noise_puff_bottom = new Noise(&np_puff_bottom, 0, sx, sz); } noise->seed = mapseed + y_start; noise->perlinMap2D(nmin.X, nmin.Z); bool noise_generated = false; size_t index = 0; for (int z = nmin.Z; z <= nmax.Z; z++) for (int x = nmin.X; x <= nmax.X; x++, index++) { float noiseval = noise->result[index]; if (noiseval < nthresh) continue; if (biomemap && !biomes.empty()) { auto it = biomes.find(biomemap[index]); if (it == biomes.end()) continue; } if (!noise_generated) { noise_generated = true; noise_puff_top->perlinMap2D(nmin.X, nmin.Z); noise_puff_bottom->perlinMap2D(nmin.X, nmin.Z); } float ntop = noise_puff_top->result[index]; float nbottom = noise_puff_bottom->result[index]; if (!(flags & OREFLAG_PUFF_CLIFFS)) { float ndiff = noiseval - nthresh; if (ndiff < 1.0f) { ntop *= ndiff; nbottom *= ndiff; } } int ymid = y_start; int y0 = ymid - nbottom; int y1 = ymid + ntop; if ((flags & OREFLAG_PUFF_ADDITIVE) && (y0 > y1)) SWAP(int, y0, y1); for (int y = y0; y <= y1; y++) { u32 i = vm->m_area.index(x, y, z); if (!vm->m_area.contains(i)) continue; if (!CONTAINS(c_wherein, vm->m_data[i].getContent())) continue; vm->m_data[i] = n_ore; } } } /////////////////////////////////////////////////////////////////////////////// ObjDef *OreBlob::clone() const { auto def = new OreBlob(); Ore::cloneTo(def); return def; } void OreBlob::generate(MMVManip *vm, int mapseed, u32 blockseed, v3s16 nmin, v3s16 nmax, biome_t *biomemap) { PcgRandom pr(blockseed + 2404); MapNode n_ore(c_ore, 0, ore_param2); u32 sizex = (nmax.X - nmin.X + 1); u32 volume = (nmax.X - nmin.X + 1) * (nmax.Y - nmin.Y + 1) * (nmax.Z - nmin.Z + 1); u32 csize = clust_size; u32 nblobs = volume / clust_scarcity; if (!noise) noise = new Noise(&np, mapseed, csize, csize, csize); for (u32 i = 0; i != nblobs; i++) { int x0 = pr.range(nmin.X, nmax.X - csize + 1); int y0 = pr.range(nmin.Y, nmax.Y - csize + 1); int z0 = pr.range(nmin.Z, nmax.Z - csize + 1); if (biomemap && !biomes.empty()) { u32 bmapidx = sizex * (z0 - nmin.Z) + (x0 - nmin.X); auto it = biomes.find(biomemap[bmapidx]); if (it == biomes.end()) continue; } bool noise_generated = false; noise->seed = blockseed + i; size_t index = 0; for (u32 z1 = 0; z1 != csize; z1++) for (u32 y1 = 0; y1 != csize; y1++) for (u32 x1 = 0; x1 != csize; x1++, index++) { u32 i = vm->m_area.index(x0 + x1, y0 + y1, z0 + z1); if (!CONTAINS(c_wherein, vm->m_data[i].getContent())) continue; // Lazily generate noise only if there's a chance of ore being placed // This simple optimization makes calls 6x faster on average if (!noise_generated) { noise_generated = true; noise->perlinMap3D(x0, y0, z0); } float noiseval = noise->result[index]; float xdist = (s32)x1 - (s32)csize / 2; float ydist = (s32)y1 - (s32)csize / 2; float zdist = (s32)z1 - (s32)csize / 2; noiseval -= std::sqrt(xdist * xdist + ydist * ydist + zdist * zdist) / csize; if (noiseval < nthresh) continue; vm->m_data[i] = n_ore; } } } /////////////////////////////////////////////////////////////////////////////// OreVein::~OreVein() { delete noise2; } ObjDef *OreVein::clone() const { auto def = new OreVein(); Ore::cloneTo(def); def->random_factor = random_factor; def->noise2 = nullptr; // cannot be shared, on-demand def->sizey_prev = sizey_prev; return def; } void OreVein::generate(MMVManip *vm, int mapseed, u32 blockseed, v3s16 nmin, v3s16 nmax, biome_t *biomemap) { PcgRandom pr(blockseed + 520); MapNode n_ore(c_ore, 0, ore_param2); int sizex = nmax.X - nmin.X + 1; int sizey = nmax.Y - nmin.Y + 1; // Because this ore uses 3D noise the perlinmap Y size can be different in // different mapchunks due to ore Y limits. So recreate the noise objects // if Y size has changed. // Because these noise objects are created multiple times for this ore type // it is necessary to 'delete' them here. if (!noise || sizey != sizey_prev) { delete noise; delete noise2; int sizez = nmax.Z - nmin.Z + 1; noise = new Noise(&np, mapseed, sizex, sizey, sizez); noise2 = new Noise(&np, mapseed + 436, sizex, sizey, sizez); sizey_prev = sizey; } bool noise_generated = false; size_t index = 0; for (int z = nmin.Z; z <= nmax.Z; z++) for (int y = nmin.Y; y <= nmax.Y; y++)


context:
space:
mode: