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 void getContainerPosWithOffset(s16 p, s16 d, s16 &container, s16 &offset)
90 container = (p >= 0 ? p : p - d + 1) / d;
94 inline void getContainerPosWithOffset(const v2s16 &p, s16 d, v2s16 &container, v2s16 &offset)
96 getContainerPosWithOffset(p.X, d, container.X, offset.X);
97 getContainerPosWithOffset(p.Y, d, container.Y, offset.Y);
100 inline void getContainerPosWithOffset(const v3s16 &p, s16 d, v3s16 &container, v3s16 &offset)
102 getContainerPosWithOffset(p.X, d, container.X, offset.X);
103 getContainerPosWithOffset(p.Y, d, container.Y, offset.Y);
104 getContainerPosWithOffset(p.Z, d, container.Z, offset.Z);
108 inline bool isInArea(v3s16 p, s16 d)
111 p.X >= 0 && p.X < d &&
112 p.Y >= 0 && p.Y < d &&
117 inline bool isInArea(v2s16 p, s16 d)
120 p.X >= 0 && p.X < d &&
125 inline bool isInArea(v3s16 p, v3s16 d)
128 p.X >= 0 && p.X < d.X &&
129 p.Y >= 0 && p.Y < d.Y &&
130 p.Z >= 0 && p.Z < d.Z
134 #define rangelim(d, min, max) ((d) < (min) ? (min) : ((d)>(max)?(max):(d)))
135 #define myfloor(x) ((x) > 0.0 ? (int)(x) : (int)(x) - 1)
137 inline v3s16 arealim(v3s16 p, s16 d)
154 #define ARRLEN(x) (sizeof(x) / sizeof((x)[0]))
155 #define CONTAINS(c, v) (std::find((c).begin(), (c).end(), (v)) != (c).end())
157 // The naive swap performs better than the xor version
158 #define SWAP(t, x, y) do { \
164 inline void sortBoxVerticies(v3s16 &p1, v3s16 &p2) {
166 SWAP(s16, p1.X, p2.X);
168 SWAP(s16, p1.Y, p2.Y);
170 SWAP(s16, p1.Z, p2.Z);
175 See test.cpp for example cases.
176 wraps degrees to the range of -360...360
177 NOTE: Wrapping to 0...360 is not used because pitch needs negative values.
179 inline float wrapDegrees(float f)
181 // Take examples of f=10, f=720.5, f=-0.5, f=-360.5
187 // NOTE: This would be used for wrapping to 0...360
193 // 10, 0.5, -0.5, -0.5
198 /* Wrap to 0...360 */
199 inline float wrapDegrees_0_360(float f)
201 // Take examples of f=10, f=720.5, f=-0.5, f=-360.5
213 // 10, 0.5, -0.5, -0.5
218 /* Wrap to -180...180 */
219 inline float wrapDegrees_180(float f)
222 f = wrapDegrees_0_360(f);
228 Pseudo-random (VC++ rand() sucks)
231 void mysrand(unsigned seed);
232 #define MYRAND_MAX 32767
234 int myrand_range(int min, int max);
237 Miscellaneous functions
240 u64 murmur_hash_64_ua(const void *key, int len, unsigned int seed);
242 bool isBlockInSight(v3s16 blockpos_b, v3f camera_pos, v3f camera_dir,
243 f32 camera_fov, f32 range, f32 *distance_ptr=NULL);
248 #define MYMIN(a,b) ((a)<(b)?(a):(b))
249 #define MYMAX(a,b) ((a)>(b)?(a):(b))
252 Returns nearest 32-bit integer for given floating point number.
253 <cmath> and <math.h> in VC++ don't provide round().
255 inline s32 myround(f32 f)
257 return floor(f + 0.5);
261 Returns integer position of node in given floating point position
263 inline v3s16 floatToInt(v3f p, f32 d)
266 (p.X + (p.X>0 ? d/2 : -d/2))/d,
267 (p.Y + (p.Y>0 ? d/2 : -d/2))/d,
268 (p.Z + (p.Z>0 ? d/2 : -d/2))/d);
273 Returns floating point position of node in given integer position
275 inline v3f intToFloat(v3s16 p, f32 d)
285 // Random helper. Usually d=BS
286 inline core::aabbox3d<f32> getNodeBox(v3s16 p, float d)
288 return core::aabbox3d<f32>(
289 (float)p.X * d - 0.5*d,
290 (float)p.Y * d - 0.5*d,
291 (float)p.Z * d - 0.5*d,
292 (float)p.X * d + 0.5*d,
293 (float)p.Y * d + 0.5*d,
294 (float)p.Z * d + 0.5*d
298 class IntervalLimiter
306 dtime: time from last call to this method
307 wanted_interval: interval wanted
309 true: action should be skipped
310 false: action should be done
312 bool step(float dtime, float wanted_interval)
314 m_accumulator += dtime;
315 if(m_accumulator < wanted_interval)
317 m_accumulator -= wanted_interval;
325 Splits a list into "pages". For example, the list [1,2,3,4,5] split
326 into two pages would be [1,2,3],[4,5]. This function computes the
327 minimum and maximum indices of a single page.
329 length: Length of the list that should be split
330 page: Page number, 1 <= page <= pagecount
331 pagecount: The number of pages, >= 1
332 minindex: Receives the minimum index (inclusive).
333 maxindex: Receives the maximum index (exclusive).
335 Ensures 0 <= minindex <= maxindex <= length.
337 inline void paging(u32 length, u32 page, u32 pagecount, u32 &minindex, u32 &maxindex)
339 if(length < 1 || pagecount < 1 || page < 1 || page > pagecount)
341 // Special cases or invalid parameters
342 minindex = maxindex = 0;
344 else if(pagecount <= length)
346 // Less pages than entries in the list:
347 // Each page contains at least one entry
348 minindex = (length * (page-1) + (pagecount-1)) / pagecount;
349 maxindex = (length * page + (pagecount-1)) / pagecount;
353 // More pages than entries in the list:
354 // Make sure the empty pages are at the end
368 inline float cycle_shift(float value, float by = 0, float max = 1)
370 if (value + by < 0) return max + by + value;
371 if (value + by > max) return value + by - max;
375 inline bool is_power_of_two(u32 n)
377 return n != 0 && (n & (n-1)) == 0;