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"
30 // Calculate the borders of a "d-radius" cube
31 void getFacePositions(std::list<v3s16> &list, u16 d);
33 class IndentationRaiser
36 IndentationRaiser(u16 *indentation)
38 m_indentation = indentation;
49 inline s16 getContainerPos(s16 p, s16 d)
51 return (p>=0 ? p : p-d+1) / d;
54 inline v2s16 getContainerPos(v2s16 p, s16 d)
57 getContainerPos(p.X, d),
58 getContainerPos(p.Y, d)
62 inline v3s16 getContainerPos(v3s16 p, s16 d)
65 getContainerPos(p.X, d),
66 getContainerPos(p.Y, d),
67 getContainerPos(p.Z, d)
71 inline v2s16 getContainerPos(v2s16 p, v2s16 d)
74 getContainerPos(p.X, d.X),
75 getContainerPos(p.Y, d.Y)
79 inline v3s16 getContainerPos(v3s16 p, v3s16 d)
82 getContainerPos(p.X, d.X),
83 getContainerPos(p.Y, d.Y),
84 getContainerPos(p.Z, d.Z)
88 inline bool isInArea(v3s16 p, s16 d)
91 p.X >= 0 && p.X < d &&
92 p.Y >= 0 && p.Y < d &&
97 inline bool isInArea(v2s16 p, s16 d)
100 p.X >= 0 && p.X < d &&
105 inline bool isInArea(v3s16 p, v3s16 d)
108 p.X >= 0 && p.X < d.X &&
109 p.Y >= 0 && p.Y < d.Y &&
110 p.Z >= 0 && p.Z < d.Z
114 inline s16 rangelim(s16 i, s16 max)
123 #define rangelim(d, min, max) ((d) < (min) ? (min) : ((d)>(max)?(max):(d)))
124 #define myfloor(x) ((x) > 0.0 ? (int)(x) : (int)(x) - 1)
126 inline v3s16 arealim(v3s16 p, s16 d)
143 #define ARRLEN(x) (sizeof(x) / sizeof((x)[0]))
144 #define CONTAINS(c, v) (std::find((c).begin(), (c).end(), (v)) != (c).end())
146 // The naive swap performs better than the xor version
147 #define SWAP(t, x, y) do { \
153 inline void sortBoxVerticies(v3s16 &p1, v3s16 &p2) {
155 SWAP(s16, p1.X, p2.X);
157 SWAP(s16, p1.Y, p2.Y);
159 SWAP(s16, p1.Z, p2.Z);
164 See test.cpp for example cases.
165 wraps degrees to the range of -360...360
166 NOTE: Wrapping to 0...360 is not used because pitch needs negative values.
168 inline float wrapDegrees(float f)
170 // Take examples of f=10, f=720.5, f=-0.5, f=-360.5
176 // NOTE: This would be used for wrapping to 0...360
182 // 10, 0.5, -0.5, -0.5
187 /* Wrap to 0...360 */
188 inline float wrapDegrees_0_360(float f)
190 // Take examples of f=10, f=720.5, f=-0.5, f=-360.5
202 // 10, 0.5, -0.5, -0.5
207 /* Wrap to -180...180 */
208 inline float wrapDegrees_180(float f)
211 f = wrapDegrees_0_360(f);
217 Pseudo-random (VC++ rand() sucks)
220 void mysrand(unsigned seed);
221 #define MYRAND_MAX 32767
223 int myrand_range(int min, int max);
226 Miscellaneous functions
229 u64 murmur_hash_64_ua(const void *key, int len, unsigned int seed);
231 bool isBlockInSight(v3s16 blockpos_b, v3f camera_pos, v3f camera_dir,
232 f32 camera_fov, f32 range, f32 *distance_ptr=NULL);
237 #define MYMIN(a,b) ((a)<(b)?(a):(b))
238 #define MYMAX(a,b) ((a)>(b)?(a):(b))
241 Returns nearest 32-bit integer for given floating point number.
242 <cmath> and <math.h> in VC++ don't provide round().
244 inline s32 myround(f32 f)
246 return floor(f + 0.5);
250 Returns integer position of node in given floating point position
252 inline v3s16 floatToInt(v3f p, f32 d)
255 (p.X + (p.X>0 ? d/2 : -d/2))/d,
256 (p.Y + (p.Y>0 ? d/2 : -d/2))/d,
257 (p.Z + (p.Z>0 ? d/2 : -d/2))/d);
262 Returns floating point position of node in given integer position
264 inline v3f intToFloat(v3s16 p, f32 d)
274 // Random helper. Usually d=BS
275 inline core::aabbox3d<f32> getNodeBox(v3s16 p, float d)
277 return core::aabbox3d<f32>(
278 (float)p.X * d - 0.5*d,
279 (float)p.Y * d - 0.5*d,
280 (float)p.Z * d - 0.5*d,
281 (float)p.X * d + 0.5*d,
282 (float)p.Y * d + 0.5*d,
283 (float)p.Z * d + 0.5*d
287 class IntervalLimiter
295 dtime: time from last call to this method
296 wanted_interval: interval wanted
298 true: action should be skipped
299 false: action should be done
301 bool step(float dtime, float wanted_interval)
303 m_accumulator += dtime;
304 if(m_accumulator < wanted_interval)
306 m_accumulator -= wanted_interval;
314 Splits a list into "pages". For example, the list [1,2,3,4,5] split
315 into two pages would be [1,2,3],[4,5]. This function computes the
316 minimum and maximum indices of a single page.
318 length: Length of the list that should be split
319 page: Page number, 1 <= page <= pagecount
320 pagecount: The number of pages, >= 1
321 minindex: Receives the minimum index (inclusive).
322 maxindex: Receives the maximum index (exclusive).
324 Ensures 0 <= minindex <= maxindex <= length.
326 inline void paging(u32 length, u32 page, u32 pagecount, u32 &minindex, u32 &maxindex)
328 if(length < 1 || pagecount < 1 || page < 1 || page > pagecount)
330 // Special cases or invalid parameters
331 minindex = maxindex = 0;
333 else if(pagecount <= length)
335 // Less pages than entries in the list:
336 // Each page contains at least one entry
337 minindex = (length * (page-1) + (pagecount-1)) / pagecount;
338 maxindex = (length * page + (pagecount-1)) / pagecount;
342 // More pages than entries in the list:
343 // Make sure the empty pages are at the end
357 inline float cycle_shift(float value, float by = 0, float max = 1)
359 if (value + by < 0) return max + by + value;
360 if (value + by > max) return value + by - max;
364 inline bool is_power_of_two(u32 n)
366 return n != 0 && (n & (n-1)) == 0;