75970023b7
Under the current system, it would have failed to be random if two calls were made during the same msec. It will now throw in the previous rand() in the new seed, which should prevent duplicates (although the next seed in the same msec will be predictable, it's not like we need to be cryptographically secure here)
58 lines
982 B
C++
58 lines
982 B
C++
/*
|
|
* mathutil.cpp
|
|
* BoE
|
|
*
|
|
* Created by Celtic Minstrel on 16/04/09.
|
|
*
|
|
*/
|
|
|
|
#include <cstdlib>
|
|
#include "mathutil.h"
|
|
|
|
//minmax, move_to_zero and ex_abs (return absolute value) are templates in the header file
|
|
|
|
short get_ran (short times,short min,short max){
|
|
long int store;
|
|
short i, to_ret = 0;
|
|
|
|
if(max < min) max = min;
|
|
|
|
for (i = 1; i < times + 1; i++) {
|
|
srand(GetTickCount() + rand());
|
|
store = rand();
|
|
to_ret += min + (store % (max - min + 1));//min + (((store + 32767) * (max - min + 1)) / 65536);
|
|
}
|
|
return to_ret;
|
|
}
|
|
|
|
short s_pow(short x,short y){
|
|
return (short) pow((double) x, (double) y);
|
|
}
|
|
|
|
short s_sqrt(short val)
|
|
{
|
|
return (short) sqrt((double)(val));
|
|
}
|
|
|
|
short max(short a,short b){
|
|
if (a > b)
|
|
return a;
|
|
else return b;
|
|
}
|
|
|
|
short min(short a,short b){
|
|
if (a < b)
|
|
return a;
|
|
else return b;
|
|
}
|
|
|
|
short gcd(short a, short b){ // Grabbed from Wikipedia and translated to C code
|
|
short t;
|
|
while(b != 0){
|
|
t = b;
|
|
b = a % b;
|
|
a = t;
|
|
}
|
|
return a;
|
|
}
|