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)
145 See test.cpp for example cases.
146 wraps degrees to the range of -360...360
147 NOTE: Wrapping to 0...360 is not used because pitch needs negative values.
149 inline float wrapDegrees(float f)
151 // Take examples of f=10, f=720.5, f=-0.5, f=-360.5
157 // NOTE: This would be used for wrapping to 0...360
163 // 10, 0.5, -0.5, -0.5
168 /* Wrap to 0...360 */
169 inline float wrapDegrees_0_360(float f)
171 // Take examples of f=10, f=720.5, f=-0.5, f=-360.5
183 // 10, 0.5, -0.5, -0.5
188 /* Wrap to -180...180 */
189 inline float wrapDegrees_180(float f)
192 f = wrapDegrees_0_360(f);
198 Pseudo-random (VC++ rand() sucks)
201 void mysrand(unsigned seed);
202 #define MYRAND_MAX 32767
204 int myrand_range(int min, int max);
207 Miscellaneous functions
210 bool isBlockInSight(v3s16 blockpos_b, v3f camera_pos, v3f camera_dir,
211 f32 camera_fov, f32 range, f32 *distance_ptr=NULL);
216 #define MYMIN(a,b) ((a)<(b)?(a):(b))
217 #define MYMAX(a,b) ((a)>(b)?(a):(b))
220 Returns nearest 32-bit integer for given floating point number.
221 <cmath> and <math.h> in VC++ don't provide round().
223 inline s32 myround(f32 f)
225 return floor(f + 0.5);
229 Returns integer position of node in given floating point position
231 inline v3s16 floatToInt(v3f p, f32 d)
234 (p.X + (p.X>0 ? d/2 : -d/2))/d,
235 (p.Y + (p.Y>0 ? d/2 : -d/2))/d,
236 (p.Z + (p.Z>0 ? d/2 : -d/2))/d);
241 Returns floating point position of node in given integer position
243 inline v3f intToFloat(v3s16 p, f32 d)
253 // Random helper. Usually d=BS
254 inline core::aabbox3d<f32> getNodeBox(v3s16 p, float d)
256 return core::aabbox3d<f32>(
257 (float)p.X * d - 0.5*d,
258 (float)p.Y * d - 0.5*d,
259 (float)p.Z * d - 0.5*d,
260 (float)p.X * d + 0.5*d,
261 (float)p.Y * d + 0.5*d,
262 (float)p.Z * d + 0.5*d
266 class IntervalLimiter
274 dtime: time from last call to this method
275 wanted_interval: interval wanted
277 true: action should be skipped
278 false: action should be done
280 bool step(float dtime, float wanted_interval)
282 m_accumulator += dtime;
283 if(m_accumulator < wanted_interval)
285 m_accumulator -= wanted_interval;
293 Splits a list into "pages". For example, the list [1,2,3,4,5] split
294 into two pages would be [1,2,3],[4,5]. This function computes the
295 minimum and maximum indices of a single page.
297 length: Length of the list that should be split
298 page: Page number, 1 <= page <= pagecount
299 pagecount: The number of pages, >= 1
300 minindex: Receives the minimum index (inclusive).
301 maxindex: Receives the maximum index (exclusive).
303 Ensures 0 <= minindex <= maxindex <= length.
305 inline void paging(u32 length, u32 page, u32 pagecount, u32 &minindex, u32 &maxindex)
307 if(length < 1 || pagecount < 1 || page < 1 || page > pagecount)
309 // Special cases or invalid parameters
310 minindex = maxindex = 0;
312 else if(pagecount <= length)
314 // Less pages than entries in the list:
315 // Each page contains at least one entry
316 minindex = (length * (page-1) + (pagecount-1)) / pagecount;
317 maxindex = (length * page + (pagecount-1)) / pagecount;
321 // More pages than entries in the list:
322 // Make sure the empty pages are at the end