3 Copyright (C) 2010-2014 kwolekr, Ryan Kwolek <kwolekr@minetest.net>
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU Lesser General Public License as published by
7 the Free Software Foundation; either version 2.1 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU Lesser General Public License for more details.
15 You should have received a copy of the GNU Lesser General Public License along
16 with this program; if not, write to the Free Software Foundation, Inc.,
17 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
23 #include "util/numeric.h"
27 const char *OreManager::ELEMENT_TITLE = "ore";
29 FlagDesc flagdesc_ore[] = {
30 {"absheight", OREFLAG_ABSHEIGHT},
31 {"scatter_noisedensity", OREFLAG_DENSITY},
32 {"claylike_nodeisnt", OREFLAG_NODEISNT},
37 ///////////////////////////////////////////////////////////////////////////////
40 OreManager::OreManager(IGameDef *gamedef) :
41 GenElementManager(gamedef)
46 size_t OreManager::placeAllOres(Mapgen *mg, u32 seed, v3s16 nmin, v3s16 nmax)
50 for (size_t i = 0; i != m_elements.size(); i++) {
51 Ore *ore = (Ore *)m_elements[i];
55 nplaced += ore->placeOre(mg, seed, nmin, nmax);
63 void OreManager::clear()
65 for (size_t i = 0; i < m_elements.size(); i++) {
66 Ore *ore = (Ore *)m_elements[i];
73 ///////////////////////////////////////////////////////////////////////////////
89 void Ore::resolveNodeNames(NodeResolveInfo *nri)
91 m_ndef->getIdFromResolveInfo(nri, "", CONTENT_AIR, c_ore);
92 m_ndef->getIdsFromResolveInfo(nri, c_wherein);
96 size_t Ore::placeOre(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax)
100 in_range |= (nmin.Y <= height_max && nmax.Y >= height_min);
101 if (flags & OREFLAG_ABSHEIGHT)
102 in_range |= (nmin.Y >= -height_max && nmax.Y <= -height_min) << 1;
107 if (in_range & ORE_RANGE_MIRROR) {
108 ymin = MYMAX(nmin.Y, -height_max);
109 ymax = MYMIN(nmax.Y, -height_min);
111 ymin = MYMAX(nmin.Y, height_min);
112 ymax = MYMIN(nmax.Y, height_max);
114 if (clust_size >= ymax - ymin + 1)
119 generate(mg->vm, mg->seed, blockseed, nmin, nmax);
125 ///////////////////////////////////////////////////////////////////////////////
128 void OreScatter::generate(ManualMapVoxelManipulator *vm, int seed,
129 u32 blockseed, v3s16 nmin, v3s16 nmax)
131 PseudoRandom pr(blockseed);
132 MapNode n_ore(c_ore, 0, ore_param2);
134 int volume = (nmax.X - nmin.X + 1) *
135 (nmax.Y - nmin.Y + 1) *
136 (nmax.Z - nmin.Z + 1);
137 int csize = clust_size;
138 int orechance = (csize * csize * csize) / clust_num_ores;
139 int nclusters = volume / clust_scarcity;
141 for (int i = 0; i != nclusters; i++) {
142 int x0 = pr.range(nmin.X, nmax.X - csize + 1);
143 int y0 = pr.range(nmin.Y, nmax.Y - csize + 1);
144 int z0 = pr.range(nmin.Z, nmax.Z - csize + 1);
146 if ((flags & OREFLAG_USE_NOISE) &&
147 (NoisePerlin3D(&np, x0, y0, z0, seed) < nthresh))
150 for (int z1 = 0; z1 != csize; z1++)
151 for (int y1 = 0; y1 != csize; y1++)
152 for (int x1 = 0; x1 != csize; x1++) {
153 if (pr.range(1, orechance) != 1)
156 u32 i = vm->m_area.index(x0 + x1, y0 + y1, z0 + z1);
157 if (!CONTAINS(c_wherein, vm->m_data[i].getContent()))
160 vm->m_data[i] = n_ore;
166 ///////////////////////////////////////////////////////////////////////////////
169 void OreSheet::generate(ManualMapVoxelManipulator *vm, int seed,
170 u32 blockseed, v3s16 nmin, v3s16 nmax)
172 PseudoRandom pr(blockseed + 4234);
173 MapNode n_ore(c_ore, 0, ore_param2);
175 int max_height = clust_size;
176 int y_start = pr.range(nmin.Y, nmax.Y - max_height);
179 int sx = nmax.X - nmin.X + 1;
180 int sz = nmax.Z - nmin.Z + 1;
181 noise = new Noise(&np, seed, sx, sz);
183 noise->seed = seed + y_start;
184 noise->perlinMap2D(nmin.X, nmin.Z);
187 for (int z = nmin.Z; z <= nmax.Z; z++)
188 for (int x = nmin.X; x <= nmax.X; x++) {
189 float noiseval = noise->result[index++];
190 if (noiseval < nthresh)
193 int height = max_height * (1. / pr.range(1, 3));
194 int y0 = y_start + np.scale * noiseval; //pr.range(1, 3) - 1;
195 int y1 = y0 + height;
196 for (int y = y0; y != y1; y++) {
197 u32 i = vm->m_area.index(x, y, z);
198 if (!vm->m_area.contains(i))
200 if (!CONTAINS(c_wherein, vm->m_data[i].getContent()))
203 vm->m_data[i] = n_ore;