1997-09-16 23:25:59 +04:00
|
|
|
/*
|
2018-03-09 18:05:13 +03:00
|
|
|
** $Id: lmathlib.c,v 1.121 2018/03/09 14:56:25 roberto Exp roberto $
|
1999-12-27 20:33:22 +03:00
|
|
|
** Standard mathematical library
|
1997-09-16 23:25:59 +04:00
|
|
|
** See Copyright Notice in lua.h
|
|
|
|
*/
|
|
|
|
|
2014-11-02 22:19:04 +03:00
|
|
|
#define lmathlib_c
|
|
|
|
#define LUA_LIB
|
|
|
|
|
|
|
|
#include "lprefix.h"
|
|
|
|
|
1997-09-16 23:25:59 +04:00
|
|
|
|
2018-03-05 17:07:48 +03:00
|
|
|
#include <limits.h>
|
1997-09-16 23:25:59 +04:00
|
|
|
#include <stdlib.h>
|
|
|
|
#include <math.h>
|
|
|
|
|
|
|
|
#include "lua.h"
|
2000-06-12 17:52:05 +04:00
|
|
|
|
|
|
|
#include "lauxlib.h"
|
1997-09-16 23:25:59 +04:00
|
|
|
#include "lualib.h"
|
|
|
|
|
|
|
|
|
2012-05-18 21:47:53 +04:00
|
|
|
#undef PI
|
2014-04-09 21:29:46 +04:00
|
|
|
#define PI (l_mathop(3.141592653589793238462643383279502884))
|
2012-05-18 21:47:53 +04:00
|
|
|
|
|
|
|
|
2000-08-28 21:57:04 +04:00
|
|
|
static int math_abs (lua_State *L) {
|
2014-03-31 23:00:52 +04:00
|
|
|
if (lua_isinteger(L, 1)) {
|
|
|
|
lua_Integer n = lua_tointeger(L, 1);
|
2015-10-02 18:39:23 +03:00
|
|
|
if (n < 0) n = (lua_Integer)(0u - (lua_Unsigned)n);
|
2014-03-31 23:00:52 +04:00
|
|
|
lua_pushinteger(L, n);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
lua_pushnumber(L, l_mathop(fabs)(luaL_checknumber(L, 1)));
|
2000-08-28 21:57:04 +04:00
|
|
|
return 1;
|
1997-09-16 23:25:59 +04:00
|
|
|
}
|
|
|
|
|
2000-08-28 21:57:04 +04:00
|
|
|
static int math_sin (lua_State *L) {
|
2013-01-29 20:00:40 +04:00
|
|
|
lua_pushnumber(L, l_mathop(sin)(luaL_checknumber(L, 1)));
|
2000-08-28 21:57:04 +04:00
|
|
|
return 1;
|
1997-09-16 23:25:59 +04:00
|
|
|
}
|
|
|
|
|
2000-08-28 21:57:04 +04:00
|
|
|
static int math_cos (lua_State *L) {
|
2013-01-29 20:00:40 +04:00
|
|
|
lua_pushnumber(L, l_mathop(cos)(luaL_checknumber(L, 1)));
|
2000-08-28 21:57:04 +04:00
|
|
|
return 1;
|
1997-09-16 23:25:59 +04:00
|
|
|
}
|
|
|
|
|
2000-08-28 21:57:04 +04:00
|
|
|
static int math_tan (lua_State *L) {
|
2013-01-29 20:00:40 +04:00
|
|
|
lua_pushnumber(L, l_mathop(tan)(luaL_checknumber(L, 1)));
|
2000-08-28 21:57:04 +04:00
|
|
|
return 1;
|
1997-09-16 23:25:59 +04:00
|
|
|
}
|
|
|
|
|
2000-08-28 21:57:04 +04:00
|
|
|
static int math_asin (lua_State *L) {
|
2013-01-29 20:00:40 +04:00
|
|
|
lua_pushnumber(L, l_mathop(asin)(luaL_checknumber(L, 1)));
|
2000-08-28 21:57:04 +04:00
|
|
|
return 1;
|
1997-09-16 23:25:59 +04:00
|
|
|
}
|
|
|
|
|
2000-08-28 21:57:04 +04:00
|
|
|
static int math_acos (lua_State *L) {
|
2013-01-29 20:00:40 +04:00
|
|
|
lua_pushnumber(L, l_mathop(acos)(luaL_checknumber(L, 1)));
|
2000-08-28 21:57:04 +04:00
|
|
|
return 1;
|
1997-09-16 23:25:59 +04:00
|
|
|
}
|
|
|
|
|
2000-08-28 21:57:04 +04:00
|
|
|
static int math_atan (lua_State *L) {
|
2014-05-14 20:59:27 +04:00
|
|
|
lua_Number y = luaL_checknumber(L, 1);
|
|
|
|
lua_Number x = luaL_optnumber(L, 2, 1);
|
|
|
|
lua_pushnumber(L, l_mathop(atan2)(y, x));
|
2000-08-28 21:57:04 +04:00
|
|
|
return 1;
|
1997-09-16 23:25:59 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-07-17 16:30:53 +04:00
|
|
|
static int math_toint (lua_State *L) {
|
2014-06-18 16:35:53 +04:00
|
|
|
int valid;
|
|
|
|
lua_Integer n = lua_tointegerx(L, 1, &valid);
|
|
|
|
if (valid)
|
2014-07-17 16:30:53 +04:00
|
|
|
lua_pushinteger(L, n);
|
2014-06-18 16:35:53 +04:00
|
|
|
else {
|
2014-07-17 16:30:53 +04:00
|
|
|
luaL_checkany(L, 1);
|
|
|
|
lua_pushnil(L); /* value is not convertible to integer */
|
2014-06-18 16:35:53 +04:00
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-06-03 03:09:28 +04:00
|
|
|
static void pushnumint (lua_State *L, lua_Number d) {
|
|
|
|
lua_Integer n;
|
2014-10-24 15:42:06 +04:00
|
|
|
if (lua_numbertointeger(d, &n)) /* does 'd' fit in an integer? */
|
2014-06-03 03:09:28 +04:00
|
|
|
lua_pushinteger(L, n); /* result is integer */
|
|
|
|
else
|
|
|
|
lua_pushnumber(L, d); /* result is float */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-07-17 16:30:53 +04:00
|
|
|
static int math_floor (lua_State *L) {
|
|
|
|
if (lua_isinteger(L, 1))
|
|
|
|
lua_settop(L, 1); /* integer is its own floor */
|
|
|
|
else {
|
|
|
|
lua_Number d = l_mathop(floor)(luaL_checknumber(L, 1));
|
|
|
|
pushnumint(L, d);
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-05-26 21:13:52 +04:00
|
|
|
static int math_ceil (lua_State *L) {
|
|
|
|
if (lua_isinteger(L, 1))
|
|
|
|
lua_settop(L, 1); /* integer is its own ceil */
|
2013-07-03 21:23:19 +04:00
|
|
|
else {
|
2014-05-26 21:13:52 +04:00
|
|
|
lua_Number d = l_mathop(ceil)(luaL_checknumber(L, 1));
|
2014-06-03 03:09:28 +04:00
|
|
|
pushnumint(L, d);
|
2013-07-03 21:23:19 +04:00
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2014-05-26 21:13:52 +04:00
|
|
|
|
2005-06-14 01:20:14 +04:00
|
|
|
static int math_fmod (lua_State *L) {
|
2014-05-02 20:36:51 +04:00
|
|
|
if (lua_isinteger(L, 1) && lua_isinteger(L, 2)) {
|
|
|
|
lua_Integer d = lua_tointeger(L, 2);
|
|
|
|
if ((lua_Unsigned)d + 1u <= 1u) { /* special cases: -1 or 0 */
|
|
|
|
luaL_argcheck(L, d != 0, 2, "zero");
|
|
|
|
lua_pushinteger(L, 0); /* avoid overflow with 0x80000... / -1 */
|
|
|
|
}
|
|
|
|
else
|
|
|
|
lua_pushinteger(L, lua_tointeger(L, 1) % d);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
lua_pushnumber(L, l_mathop(fmod)(luaL_checknumber(L, 1),
|
|
|
|
luaL_checknumber(L, 2)));
|
2000-08-28 21:57:04 +04:00
|
|
|
return 1;
|
1997-09-16 23:25:59 +04:00
|
|
|
}
|
|
|
|
|
2014-05-26 21:13:52 +04:00
|
|
|
|
2013-06-25 18:02:18 +04:00
|
|
|
/*
|
|
|
|
** next function does not use 'modf', avoiding problems with 'double*'
|
|
|
|
** (which is not compatible with 'float*') when lua_Number is not
|
|
|
|
** 'double'.
|
|
|
|
*/
|
2005-03-04 21:57:03 +03:00
|
|
|
static int math_modf (lua_State *L) {
|
2014-06-03 03:09:28 +04:00
|
|
|
if (lua_isinteger(L ,1)) {
|
|
|
|
lua_settop(L, 1); /* number is its own integer part */
|
2014-06-30 23:48:08 +04:00
|
|
|
lua_pushnumber(L, 0); /* no fractional part */
|
2014-06-03 03:09:28 +04:00
|
|
|
}
|
|
|
|
else {
|
|
|
|
lua_Number n = luaL_checknumber(L, 1);
|
|
|
|
/* integer part (rounds toward zero) */
|
|
|
|
lua_Number ip = (n < 0) ? l_mathop(ceil)(n) : l_mathop(floor)(n);
|
|
|
|
pushnumint(L, ip);
|
2014-06-30 23:48:08 +04:00
|
|
|
/* fractional part (test needed for inf/-inf) */
|
2014-10-08 23:57:31 +04:00
|
|
|
lua_pushnumber(L, (n == ip) ? l_mathop(0.0) : (n - ip));
|
2014-06-03 03:09:28 +04:00
|
|
|
}
|
2005-03-04 21:57:03 +03:00
|
|
|
return 2;
|
|
|
|
}
|
|
|
|
|
2013-06-25 18:02:18 +04:00
|
|
|
|
2000-08-28 21:57:04 +04:00
|
|
|
static int math_sqrt (lua_State *L) {
|
2013-01-29 20:00:40 +04:00
|
|
|
lua_pushnumber(L, l_mathop(sqrt)(luaL_checknumber(L, 1)));
|
2000-08-28 21:57:04 +04:00
|
|
|
return 1;
|
1997-09-16 23:25:59 +04:00
|
|
|
}
|
|
|
|
|
2014-07-28 21:35:47 +04:00
|
|
|
|
|
|
|
static int math_ult (lua_State *L) {
|
|
|
|
lua_Integer a = luaL_checkinteger(L, 1);
|
|
|
|
lua_Integer b = luaL_checkinteger(L, 2);
|
|
|
|
lua_pushboolean(L, (lua_Unsigned)a < (lua_Unsigned)b);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2000-08-28 21:57:04 +04:00
|
|
|
static int math_log (lua_State *L) {
|
2009-02-18 16:06:05 +03:00
|
|
|
lua_Number x = luaL_checknumber(L, 1);
|
|
|
|
lua_Number res;
|
|
|
|
if (lua_isnoneornil(L, 2))
|
2013-01-29 20:00:40 +04:00
|
|
|
res = l_mathop(log)(x);
|
2009-02-18 16:06:05 +03:00
|
|
|
else {
|
|
|
|
lua_Number base = luaL_checknumber(L, 2);
|
2015-03-12 17:04:04 +03:00
|
|
|
#if !defined(LUA_USE_C89)
|
2016-12-20 21:37:00 +03:00
|
|
|
if (base == l_mathop(2.0))
|
|
|
|
res = l_mathop(log2)(x); else
|
2015-03-12 17:04:04 +03:00
|
|
|
#endif
|
2016-12-20 21:37:00 +03:00
|
|
|
if (base == l_mathop(10.0))
|
|
|
|
res = l_mathop(log10)(x);
|
|
|
|
else
|
|
|
|
res = l_mathop(log)(x)/l_mathop(log)(base);
|
2009-02-18 16:06:05 +03:00
|
|
|
}
|
2006-08-07 23:01:56 +04:00
|
|
|
lua_pushnumber(L, res);
|
2000-08-28 21:57:04 +04:00
|
|
|
return 1;
|
1997-09-16 23:25:59 +04:00
|
|
|
}
|
|
|
|
|
2000-08-28 21:57:04 +04:00
|
|
|
static int math_exp (lua_State *L) {
|
2013-01-29 20:00:40 +04:00
|
|
|
lua_pushnumber(L, l_mathop(exp)(luaL_checknumber(L, 1)));
|
2000-08-28 21:57:04 +04:00
|
|
|
return 1;
|
1997-09-16 23:25:59 +04:00
|
|
|
}
|
|
|
|
|
2000-08-28 21:57:04 +04:00
|
|
|
static int math_deg (lua_State *L) {
|
2014-10-08 23:57:31 +04:00
|
|
|
lua_pushnumber(L, luaL_checknumber(L, 1) * (l_mathop(180.0) / PI));
|
2000-08-28 21:57:04 +04:00
|
|
|
return 1;
|
1997-09-16 23:25:59 +04:00
|
|
|
}
|
|
|
|
|
2000-08-28 21:57:04 +04:00
|
|
|
static int math_rad (lua_State *L) {
|
2014-10-08 23:57:31 +04:00
|
|
|
lua_pushnumber(L, luaL_checknumber(L, 1) * (PI / l_mathop(180.0)));
|
2000-08-28 21:57:04 +04:00
|
|
|
return 1;
|
1997-09-16 23:25:59 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-08-28 21:57:04 +04:00
|
|
|
static int math_min (lua_State *L) {
|
|
|
|
int n = lua_gettop(L); /* number of arguments */
|
2014-05-14 20:59:27 +04:00
|
|
|
int imin = 1; /* index of current minimum value */
|
2000-08-28 21:57:04 +04:00
|
|
|
int i;
|
2014-03-31 23:00:52 +04:00
|
|
|
luaL_argcheck(L, n >= 1, 1, "value expected");
|
|
|
|
for (i = 2; i <= n; i++) {
|
2014-05-14 20:59:27 +04:00
|
|
|
if (lua_compare(L, i, imin, LUA_OPLT))
|
|
|
|
imin = i;
|
1997-09-16 23:25:59 +04:00
|
|
|
}
|
2014-05-14 20:59:27 +04:00
|
|
|
lua_pushvalue(L, imin);
|
2000-08-28 21:57:04 +04:00
|
|
|
return 1;
|
1997-09-16 23:25:59 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-08-28 21:57:04 +04:00
|
|
|
static int math_max (lua_State *L) {
|
|
|
|
int n = lua_gettop(L); /* number of arguments */
|
2014-05-14 20:59:27 +04:00
|
|
|
int imax = 1; /* index of current maximum value */
|
2000-08-28 21:57:04 +04:00
|
|
|
int i;
|
2014-03-31 23:00:52 +04:00
|
|
|
luaL_argcheck(L, n >= 1, 1, "value expected");
|
|
|
|
for (i = 2; i <= n; i++) {
|
|
|
|
if (lua_compare(L, imax, i, LUA_OPLT))
|
|
|
|
imax = i;
|
1997-09-16 23:25:59 +04:00
|
|
|
}
|
2014-03-31 23:00:52 +04:00
|
|
|
lua_pushvalue(L, imax);
|
2000-08-28 21:57:04 +04:00
|
|
|
return 1;
|
1997-09-16 23:25:59 +04:00
|
|
|
}
|
|
|
|
|
2018-03-05 17:07:48 +03:00
|
|
|
|
|
|
|
static int math_type (lua_State *L) {
|
|
|
|
if (lua_type(L, 1) == LUA_TNUMBER) {
|
|
|
|
if (lua_isinteger(L, 1))
|
|
|
|
lua_pushliteral(L, "integer");
|
|
|
|
else
|
|
|
|
lua_pushliteral(L, "float");
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
luaL_checkany(L, 1);
|
|
|
|
lua_pushnil(L);
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
** {==================================================================
|
|
|
|
** Pseudo-Random Number Generator based on 'xorshift128+'.
|
|
|
|
** ===================================================================
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
#define twotomin53 (1.0 / 9007199254740992.0) /* 2^-53 */
|
|
|
|
|
|
|
|
|
|
|
|
#if defined(LLONG_MAX) && !defined(LUA_DEBUG) /* { */
|
|
|
|
|
|
|
|
/*
|
|
|
|
** Assume long long.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* a 64-bit value */
|
|
|
|
typedef unsigned long long I;
|
|
|
|
|
|
|
|
static I xorshift128plus (I *state) {
|
|
|
|
I x = state[0];
|
|
|
|
I y = state[1];
|
|
|
|
state[0] = y;
|
|
|
|
x ^= x << 23;
|
2018-03-09 18:05:13 +03:00
|
|
|
state[1] = (x ^ (x >> 18)) ^ (y ^ (y >> 5));
|
2018-03-05 17:07:48 +03:00
|
|
|
return state[1] + y;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2018-03-09 17:56:25 +03:00
|
|
|
#define mask53 (~(~0LLU << 53))
|
2018-03-05 17:07:48 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
** Convert 53 bits from a random integer into a double in the
|
|
|
|
** interval [0,1).
|
|
|
|
*/
|
|
|
|
static double I2d (I x) {
|
|
|
|
return (x & mask53) * twotomin53;
|
|
|
|
}
|
|
|
|
|
2018-03-09 17:56:25 +03:00
|
|
|
/* convert an 'I' to a lua_Unsigned */
|
|
|
|
#define I2UInt(x) ((lua_Unsigned)(x))
|
2018-03-05 17:07:48 +03:00
|
|
|
|
|
|
|
/* convert a lua_Integer to an 'I' */
|
|
|
|
#define Int2I(x) ((I)(x))
|
|
|
|
|
|
|
|
#else /* }{ */
|
|
|
|
|
|
|
|
/*
|
|
|
|
** No long long; Use two 32-bit integers to represent a 64-bit quantity.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#if LUAI_BITSINT >= 32
|
|
|
|
typedef unsigned int lu_int32;
|
|
|
|
#else
|
|
|
|
typedef unsigned long lu_int32;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* a 64-bit value */
|
|
|
|
typedef struct I {
|
|
|
|
lu_int32 x1, x2;
|
|
|
|
} I;
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
** basic operations on 'I' values
|
|
|
|
*/
|
|
|
|
|
|
|
|
static I pack (int x1, int x2) {
|
|
|
|
I result;
|
|
|
|
result.x1 = x1;
|
|
|
|
result.x2 = x2;
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2018-03-09 18:05:13 +03:00
|
|
|
/* i ^ (i << n) */
|
|
|
|
static I Ixorshl (I i, int n) {
|
|
|
|
return pack(i.x1 ^ ((i.x1 << n) | (i.x2 >> (32 - n))), i.x2 ^ (i.x2 << n));
|
2018-03-05 17:07:48 +03:00
|
|
|
}
|
|
|
|
|
2018-03-09 18:05:13 +03:00
|
|
|
/* i ^ (i >> n) */
|
|
|
|
static I Ixorshr (I i, int n) {
|
|
|
|
return pack(i.x1 ^ (i.x1 >> n), i.x2 ^ ((i.x2 >> n) | (i.x1 << (32 - n))));
|
2018-03-05 17:07:48 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
static I Ixor (I i1, I i2) {
|
|
|
|
return pack(i1.x1 ^ i2.x1, i1.x2 ^ i2.x2);
|
|
|
|
}
|
|
|
|
|
|
|
|
static I Iadd (I i1, I i2) {
|
|
|
|
I result = pack(i1.x1 + i2.x1, i1.x2 + i2.x2);
|
|
|
|
if (result.x2 < i1.x2) /* carry? */
|
|
|
|
result.x1++;
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
** implementation of 'xorshift128+' algorithm on 'I' values
|
|
|
|
*/
|
|
|
|
static I xorshift128plus (I *state) {
|
|
|
|
I x = state[0];
|
|
|
|
I y = state[1];
|
|
|
|
state[0] = y;
|
2018-03-09 18:05:13 +03:00
|
|
|
x = Ixorshl(x, 23); /* x ^= x << 23; */
|
|
|
|
/* state[1] = (x ^ (x >> 18)) ^ (y ^ (y >> 5)); */
|
|
|
|
state[1] = Ixor(Ixorshr(x, 18), Ixorshr(y, 5));
|
2018-03-05 17:07:48 +03:00
|
|
|
return Iadd(state[1], y); /* return state[1] + y; */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
** Converts an 'I' into a double, getting its lower half plus 21
|
|
|
|
** (53 - 32) bits from its higher half and joining them into a double.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define mask32 0xffffffff
|
2018-03-09 17:56:25 +03:00
|
|
|
#define mask21 (~(~0U << 21))
|
2018-03-05 17:07:48 +03:00
|
|
|
|
|
|
|
#define twoto32 4294967296.0 /* 2^32 */
|
|
|
|
|
|
|
|
static double I2d (I x) {
|
|
|
|
return ((x.x1 & mask21) * twoto32 + (x.x2 & mask32)) * twotomin53;
|
|
|
|
}
|
|
|
|
|
2018-03-09 17:56:25 +03:00
|
|
|
static lua_Unsigned I2UInt (I x) {
|
|
|
|
return ((lua_Unsigned)x.x1 << 31 << 1) | x.x2;
|
2018-03-05 17:07:48 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
static I Int2I (lua_Integer n) {
|
2018-03-09 17:56:25 +03:00
|
|
|
return pack(n, n >> 31 >> 1);
|
2018-03-05 17:07:48 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
#endif /* } */
|
|
|
|
|
|
|
|
|
2014-04-17 20:09:40 +04:00
|
|
|
/*
|
2018-03-05 17:07:48 +03:00
|
|
|
** A state uses two 'I' values.
|
2014-04-17 20:09:40 +04:00
|
|
|
*/
|
2018-03-05 17:07:48 +03:00
|
|
|
typedef struct {
|
|
|
|
I s[2];
|
|
|
|
} RanState;
|
|
|
|
|
|
|
|
|
2018-03-09 17:56:25 +03:00
|
|
|
/*
|
|
|
|
** Project the random integer 'ran' into the interval [0, n].
|
|
|
|
** Because 'ran' has 2^B possible values, the projection can only
|
|
|
|
** be uniform when the size of the interval [0, n] is a power of 2
|
|
|
|
** (exact division). With the fairest possible projection (e.g.,
|
|
|
|
** '(ran % (n + 1))'), the maximum bias is 1 in 2^B/n.
|
|
|
|
** For a "small" 'n', this bias is acceptable. (Here, we accept
|
|
|
|
** a maximum bias of 0.0001%.) For a larger 'n', we first
|
|
|
|
** compute 'lim', the smallest (2^b - 1) not smaller than 'n',
|
|
|
|
** to get a uniform projection into [0,lim]. If the result is
|
|
|
|
** inside [0, n], we are done. Otherwise, we try we another
|
|
|
|
** 'ran' until we have a result inside the interval.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define MAXBIAS 1000000
|
|
|
|
|
|
|
|
static lua_Unsigned project (lua_Unsigned ran, lua_Unsigned n,
|
|
|
|
RanState *state) {
|
|
|
|
if (n < LUA_MAXUNSIGNED / MAXBIAS)
|
|
|
|
return ran % (n + 1);
|
|
|
|
else {
|
|
|
|
/* compute the smallest (2^b - 1) not smaller than 'n' */
|
|
|
|
lua_Unsigned lim = n;
|
|
|
|
lim |= (lim >> 1);
|
|
|
|
lim |= (lim >> 2);
|
|
|
|
lim |= (lim >> 4);
|
|
|
|
lim |= (lim >> 8);
|
|
|
|
lim |= (lim >> 16);
|
|
|
|
#if (LUA_MAXINTEGER >> 30 >> 2) > 0
|
|
|
|
lim |= (lim >> 32); /* integer type has more than 32 bits */
|
|
|
|
#endif
|
|
|
|
lua_assert((lim & (lim + 1)) == 0 /* 'lim + 1' is a power of 2 */
|
|
|
|
&& lim >= n /* not smaller than 'n' */
|
|
|
|
&& (lim >> 1) < n); /* it is the smallest one */
|
|
|
|
while ((ran & lim) > n)
|
|
|
|
ran = I2UInt(xorshift128plus(state->s));
|
|
|
|
return ran & lim;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-08-28 21:57:04 +04:00
|
|
|
static int math_random (lua_State *L) {
|
2013-06-13 23:32:52 +04:00
|
|
|
lua_Integer low, up;
|
2018-03-09 17:56:25 +03:00
|
|
|
lua_Unsigned p;
|
2018-03-05 17:07:48 +03:00
|
|
|
RanState *state = (RanState *)lua_touserdata(L, lua_upvalueindex(1));
|
|
|
|
I rv = xorshift128plus(state->s); /* next pseudo-random value */
|
2000-08-28 21:57:04 +04:00
|
|
|
switch (lua_gettop(L)) { /* check number of arguments */
|
|
|
|
case 0: { /* no arguments */
|
2018-03-05 17:07:48 +03:00
|
|
|
lua_pushnumber(L, (lua_Number)I2d(rv)); /* float between 0 and 1 */
|
2013-06-13 23:32:52 +04:00
|
|
|
return 1;
|
1999-08-18 18:40:51 +04:00
|
|
|
}
|
2000-08-28 21:57:04 +04:00
|
|
|
case 1: { /* only upper limit */
|
2013-06-13 23:32:52 +04:00
|
|
|
low = 1;
|
|
|
|
up = luaL_checkinteger(L, 1);
|
2018-03-05 17:07:48 +03:00
|
|
|
if (up == 0) { /* single 0 as argument? */
|
2018-03-09 17:56:25 +03:00
|
|
|
lua_pushinteger(L, I2UInt(rv)); /* full random integer */
|
2018-03-05 17:07:48 +03:00
|
|
|
return 1;
|
|
|
|
}
|
2000-08-28 21:57:04 +04:00
|
|
|
break;
|
1998-12-30 20:22:17 +03:00
|
|
|
}
|
2000-08-28 21:57:04 +04:00
|
|
|
case 2: { /* lower and upper limits */
|
2013-06-13 23:32:52 +04:00
|
|
|
low = luaL_checkinteger(L, 1);
|
|
|
|
up = luaL_checkinteger(L, 2);
|
2000-08-28 21:57:04 +04:00
|
|
|
break;
|
|
|
|
}
|
2002-06-18 19:16:18 +04:00
|
|
|
default: return luaL_error(L, "wrong number of arguments");
|
1998-12-30 20:22:17 +03:00
|
|
|
}
|
2013-06-13 23:32:52 +04:00
|
|
|
/* random integer in the interval [low, up] */
|
2016-12-22 16:08:50 +03:00
|
|
|
luaL_argcheck(L, low <= up, 1, "interval is empty");
|
2018-03-09 17:56:25 +03:00
|
|
|
/* project random integer into the interval [0, up - low] */
|
|
|
|
p = project(I2UInt(rv), (lua_Unsigned)up - (lua_Unsigned)low, state);
|
|
|
|
lua_pushinteger(L, p + (lua_Unsigned)low);
|
2000-08-28 21:57:04 +04:00
|
|
|
return 1;
|
1997-09-16 23:25:59 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2018-03-05 17:07:48 +03:00
|
|
|
static void setseed (I *state, lua_Integer n) {
|
|
|
|
int i;
|
|
|
|
state[0] = Int2I(n);
|
|
|
|
state[1] = Int2I(~n);
|
|
|
|
for (i = 0; i < 16; i++)
|
|
|
|
xorshift128plus(state); /* discard initial values */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-08-28 21:57:04 +04:00
|
|
|
static int math_randomseed (lua_State *L) {
|
2018-03-05 17:07:48 +03:00
|
|
|
RanState *state = (RanState *)lua_touserdata(L, lua_upvalueindex(1));
|
|
|
|
lua_Integer n = luaL_checkinteger(L, 1);
|
|
|
|
setseed(state->s, n);
|
2000-08-28 21:57:04 +04:00
|
|
|
return 0;
|
1997-09-16 23:25:59 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2018-03-05 17:07:48 +03:00
|
|
|
static const luaL_Reg randfuncs[] = {
|
|
|
|
{"random", math_random},
|
|
|
|
{"randomseed", math_randomseed},
|
|
|
|
{NULL, NULL}
|
|
|
|
};
|
|
|
|
|
|
|
|
static void setrandfunc (lua_State *L) {
|
|
|
|
RanState *state = (RanState *)lua_newuserdatauv(L, sizeof(RanState), 0);
|
|
|
|
setseed(state->s, 0);
|
|
|
|
luaL_setfuncs(L, randfuncs, 1);
|
2013-07-22 20:05:53 +04:00
|
|
|
}
|
|
|
|
|
2018-03-05 17:07:48 +03:00
|
|
|
/* }================================================================== */
|
|
|
|
|
2013-07-22 20:05:53 +04:00
|
|
|
|
2014-05-14 20:59:27 +04:00
|
|
|
/*
|
|
|
|
** {==================================================================
|
|
|
|
** Deprecated functions (for compatibility only)
|
|
|
|
** ===================================================================
|
|
|
|
*/
|
|
|
|
#if defined(LUA_COMPAT_MATHLIB)
|
|
|
|
|
|
|
|
static int math_cosh (lua_State *L) {
|
|
|
|
lua_pushnumber(L, l_mathop(cosh)(luaL_checknumber(L, 1)));
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int math_sinh (lua_State *L) {
|
|
|
|
lua_pushnumber(L, l_mathop(sinh)(luaL_checknumber(L, 1)));
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int math_tanh (lua_State *L) {
|
|
|
|
lua_pushnumber(L, l_mathop(tanh)(luaL_checknumber(L, 1)));
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int math_pow (lua_State *L) {
|
|
|
|
lua_Number x = luaL_checknumber(L, 1);
|
|
|
|
lua_Number y = luaL_checknumber(L, 2);
|
|
|
|
lua_pushnumber(L, l_mathop(pow)(x, y));
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int math_frexp (lua_State *L) {
|
|
|
|
int e;
|
|
|
|
lua_pushnumber(L, l_mathop(frexp)(luaL_checknumber(L, 1), &e));
|
|
|
|
lua_pushinteger(L, e);
|
|
|
|
return 2;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int math_ldexp (lua_State *L) {
|
|
|
|
lua_Number x = luaL_checknumber(L, 1);
|
2014-10-01 15:54:56 +04:00
|
|
|
int ep = (int)luaL_checkinteger(L, 2);
|
2014-05-14 20:59:27 +04:00
|
|
|
lua_pushnumber(L, l_mathop(ldexp)(x, ep));
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int math_log10 (lua_State *L) {
|
|
|
|
lua_pushnumber(L, l_mathop(log10)(luaL_checknumber(L, 1)));
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|
|
|
|
/* }================================================================== */
|
|
|
|
|
|
|
|
|
|
|
|
|
2005-08-26 21:36:32 +04:00
|
|
|
static const luaL_Reg mathlib[] = {
|
2002-03-20 15:54:08 +03:00
|
|
|
{"abs", math_abs},
|
|
|
|
{"acos", math_acos},
|
2005-07-12 03:58:35 +04:00
|
|
|
{"asin", math_asin},
|
|
|
|
{"atan", math_atan},
|
2002-03-20 15:54:08 +03:00
|
|
|
{"ceil", math_ceil},
|
2005-07-12 03:58:35 +04:00
|
|
|
{"cos", math_cos},
|
|
|
|
{"deg", math_deg},
|
|
|
|
{"exp", math_exp},
|
2014-07-17 16:30:53 +04:00
|
|
|
{"tointeger", math_toint},
|
2002-03-20 15:54:08 +03:00
|
|
|
{"floor", math_floor},
|
2005-06-14 01:20:14 +04:00
|
|
|
{"fmod", math_fmod},
|
2014-07-28 21:35:47 +04:00
|
|
|
{"ult", math_ult},
|
2005-07-12 03:58:35 +04:00
|
|
|
{"log", math_log},
|
|
|
|
{"max", math_max},
|
|
|
|
{"min", math_min},
|
|
|
|
{"modf", math_modf},
|
2002-03-20 15:54:08 +03:00
|
|
|
{"rad", math_rad},
|
2005-07-12 03:58:35 +04:00
|
|
|
{"sin", math_sin},
|
|
|
|
{"sqrt", math_sqrt},
|
|
|
|
{"tan", math_tan},
|
2013-07-22 20:05:53 +04:00
|
|
|
{"type", math_type},
|
2014-05-14 20:59:27 +04:00
|
|
|
#if defined(LUA_COMPAT_MATHLIB)
|
|
|
|
{"atan2", math_atan},
|
|
|
|
{"cosh", math_cosh},
|
|
|
|
{"sinh", math_sinh},
|
|
|
|
{"tanh", math_tanh},
|
|
|
|
{"pow", math_pow},
|
|
|
|
{"frexp", math_frexp},
|
|
|
|
{"ldexp", math_ldexp},
|
|
|
|
{"log10", math_log10},
|
|
|
|
#endif
|
2014-07-16 17:56:14 +04:00
|
|
|
/* placeholders */
|
2018-03-05 17:07:48 +03:00
|
|
|
{"random", NULL},
|
|
|
|
{"randomseed", NULL},
|
2014-07-16 17:56:14 +04:00
|
|
|
{"pi", NULL},
|
|
|
|
{"huge", NULL},
|
|
|
|
{"maxinteger", NULL},
|
|
|
|
{"mininteger", NULL},
|
2002-03-20 15:54:08 +03:00
|
|
|
{NULL, NULL}
|
1997-09-16 23:25:59 +04:00
|
|
|
};
|
|
|
|
|
2002-03-20 15:54:08 +03:00
|
|
|
|
1997-09-16 23:25:59 +04:00
|
|
|
/*
|
|
|
|
** Open math library
|
|
|
|
*/
|
2009-11-24 15:05:44 +03:00
|
|
|
LUAMOD_API int luaopen_math (lua_State *L) {
|
2010-07-02 15:38:13 +04:00
|
|
|
luaL_newlib(L, mathlib);
|
2000-10-26 16:47:05 +04:00
|
|
|
lua_pushnumber(L, PI);
|
2003-10-10 16:57:55 +04:00
|
|
|
lua_setfield(L, -2, "pi");
|
2014-10-08 23:57:31 +04:00
|
|
|
lua_pushnumber(L, (lua_Number)HUGE_VAL);
|
2005-03-04 21:57:03 +03:00
|
|
|
lua_setfield(L, -2, "huge");
|
2014-04-03 18:18:19 +04:00
|
|
|
lua_pushinteger(L, LUA_MAXINTEGER);
|
2014-04-09 21:29:46 +04:00
|
|
|
lua_setfield(L, -2, "maxinteger");
|
2014-04-03 18:18:19 +04:00
|
|
|
lua_pushinteger(L, LUA_MININTEGER);
|
2014-04-09 21:29:46 +04:00
|
|
|
lua_setfield(L, -2, "mininteger");
|
2018-03-05 17:07:48 +03:00
|
|
|
setrandfunc(L);
|
2002-12-20 13:26:33 +03:00
|
|
|
return 1;
|
1997-09-16 23:25:59 +04:00
|
|
|
}
|
|
|
|
|