3 Copyright (C) 2010-2013 celeron55, Perttu Ahola <celeron55@gmail.com>
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.
20 #ifndef UTIL_NUMERIC_HEADER
21 #define UTIL_NUMERIC_HEADER
23 #include "../irrlichttypes.h"
24 #include "../irr_v2d.h"
25 #include "../irr_v3d.h"
26 #include "../irr_aabb3d.h"
29 // Calculate the borders of a "d-radius" cube
30 void getFacePositions(std::list<v3s16> &list, u16 d);
32 class IndentationRaiser
35 IndentationRaiser(u16 *indentation)
37 m_indentation = indentation;
48 inline s16 getContainerPos(s16 p, s16 d)
50 return (p>=0 ? p : p-d+1) / d;
53 inline v2s16 getContainerPos(v2s16 p, s16 d)
56 getContainerPos(p.X, d),
57 getContainerPos(p.Y, d)
61 inline v3s16 getContainerPos(v3s16 p, s16 d)
64 getContainerPos(p.X, d),
65 getContainerPos(p.Y, d),
66 getContainerPos(p.Z, d)
70 inline v2s16 getContainerPos(v2s16 p, v2s16 d)
73 getContainerPos(p.X, d.X),
74 getContainerPos(p.Y, d.Y)
78 inline v3s16 getContainerPos(v3s16 p, v3s16 d)
81 getContainerPos(p.X, d.X),
82 getContainerPos(p.Y, d.Y),
83 getContainerPos(p.Z, d.Z)
87 inline bool isInArea(v3s16 p, s16 d)
90 p.X >= 0 && p.X < d &&
91 p.Y >= 0 && p.Y < d &&
96 inline bool isInArea(v2s16 p, s16 d)
99 p.X >= 0 && p.X < d &&
104 inline bool isInArea(v3s16 p, v3s16 d)
107 p.X >= 0 && p.X < d.X &&
108 p.Y >= 0 && p.Y < d.Y &&
109 p.Z >= 0 && p.Z < d.Z
113 inline s16 rangelim(s16 i, s16 max)
122 #define rangelim(d, min, max) ((d) < (min) ? (min) : ((d)>(max)?(max):(d)))
123 #define myfloor(x) ((x) > 0.0 ? (int)(x) : (int)(x) - 1)
125 inline v3s16 arealim(v3s16 p, s16 d)
142 // The naive swap performs better than the xor version
143 #define SWAP(t, x, y) do { \
149 inline void sortBoxVerticies(v3s16 &p1, v3s16 &p2) {
151 SWAP(s16, p1.X, p2.X);
153 SWAP(s16, p1.Y, p2.Y);
155 SWAP(s16, p1.Z, p2.Z);
160 See test.cpp for example cases.
161 wraps degrees to the range of -360...360
162 NOTE: Wrapping to 0...360 is not used because pitch needs negative values.
164 inline float wrapDegrees(float f)
166 // Take examples of f=10, f=720.5, f=-0.5, f=-360.5
172 // NOTE: This would be used for wrapping to 0...360
178 // 10, 0.5, -0.5, -0.5
183 /* Wrap to 0...360 */
184 inline float wrapDegrees_0_360(float f)
186 // Take examples of f=10, f=720.5, f=-0.5, f=-360.5
198 // 10, 0.5, -0.5, -0.5
203 /* Wrap to -180...180 */
204 inline float wrapDegrees_180(float f)
207 f = wrapDegrees_0_360(f);
213 Pseudo-random (VC++ rand() sucks)
216 void mysrand(unsigned seed);
217 #define MYRAND_MAX 32767
219 int myrand_range(int min, int max);
222 Miscellaneous functions
225 u64 murmur_hash_64_ua(const void *key, int len, unsigned int seed);
227 bool isBlockInSight(v3s16 blockpos_b, v3f camera_pos, v3f camera_dir,
228 f32 camera_fov, f32 range, f32 *distance_ptr=NULL);
233 #define MYMIN(a,b) ((a)<(b)?(a):(b))
234 #define MYMAX(a,b) ((a)>(b)?(a):(b))
237 Returns nearest 32-bit integer for given floating point number.
238 <cmath> and <math.h> in VC++ don't provide round().
240 inline s32 myround(f32 f)
242 return floor(f + 0.5);
246 Returns integer position of node in given floating point position
248 inline v3s16 floatToInt(v3f p, f32 d)
251 (p.X + (p.X>0 ? d/2 : -d/2))/d,
252 (p.Y + (p.Y>0 ? d/2 : -d/2))/d,
253 (p.Z + (p.Z>0 ? d/2 : -d/2))/d);
258 Returns floating point position of node in given integer position
260 inline v3f intToFloat(v3s16 p, f32 d)
270 // Random helper. Usually d=BS
271 inline core::aabbox3d<f32> getNodeBox(v3s16 p, float d)
273 return core::aabbox3d<f32>(
274 (float)p.X * d - 0.5*d,
275 (float)p.Y * d - 0.5*d,
276 (float)p.Z * d - 0.5*d,
277 (float)p.X * d + 0.5*d,
278 (float)p.Y * d + 0.5*d,
279 (float)p.Z * d + 0.5*d
283 class IntervalLimiter
291 dtime: time from last call to this method
292 wanted_interval: interval wanted
294 true: action should be skipped
295 false: action should be done
297 bool step(float dtime, float wanted_interval)
299 m_accumulator += dtime;
300 if(m_accumulator < wanted_interval)
302 m_accumulator -= wanted_interval;
310 Splits a list into "pages". For example, the list [1,2,3,4,5] split
311 into two pages would be [1,2,3],[4,5]. This function computes the
312 minimum and maximum indices of a single page.
314 length: Length of the list that should be split
315 page: Page number, 1 <= page <= pagecount
316 pagecount: The number of pages, >= 1
317 minindex: Receives the minimum index (inclusive).
318 maxindex: Receives the maximum index (exclusive).
320 Ensures 0 <= minindex <= maxindex <= length.
322 inline void paging(u32 length, u32 page, u32 pagecount, u32 &minindex, u32 &maxindex)
324 if(length < 1 || pagecount < 1 || page < 1 || page > pagecount)
326 // Special cases or invalid parameters
327 minindex = maxindex = 0;
329 else if(pagecount <= length)
331 // Less pages than entries in the list:
332 // Each page contains at least one entry
333 minindex = (length * (page-1) + (pagecount-1)) / pagecount;
334 maxindex = (length * page + (pagecount-1)) / pagecount;
338 // More pages than entries in the list:
339 // Make sure the empty pages are at the end
353 inline float cycle_shift(float value, float by = 0, float max = 1)
355 if (value + by < 0) return max + by + value;
356 if (value + by > max) return value + by - max;