math_test.cpp 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390
  1. /*
  2. * Copyright 2010-2023 Branimir Karadzic. All rights reserved.
  3. * License: https://github.com/bkaradzic/bx/blob/master/LICENSE
  4. */
  5. #include "test.h"
  6. #include <bx/math.h>
  7. #include <bx/file.h>
  8. #include <math.h>
  9. #include <stdint.h> // intXX_t
  10. #include <limits.h> // UCHAR_*
  11. TEST_CASE("isFinite, isInfinite, isNan", "")
  12. {
  13. for (uint64_t ii = 0; ii < UINT32_MAX; ii += rand()%(1<<13)+1)
  14. {
  15. union { uint32_t ui; float f; } u = { uint32_t(ii) };
  16. #if BX_PLATFORM_OSX
  17. BX_UNUSED(u);
  18. #else
  19. REQUIRE(::isnanf(u.f) == bx::isNan(u.f) );
  20. REQUIRE(::finitef(u.f) == bx::isFinite(u.f) );
  21. REQUIRE(::isinff(u.f) == bx::isInfinite(u.f) );
  22. #endif // BX_PLATFORM_OSX
  23. }
  24. }
  25. bool log2_test(float _a)
  26. {
  27. return bx::log2(_a) == bx::log(_a) * (1.0f / bx::log(2.0f) );
  28. }
  29. TEST_CASE("log2", "")
  30. {
  31. log2_test(0.0f);
  32. log2_test(256.0f);
  33. REQUIRE(0.0f == bx::log2(1.0f) );
  34. REQUIRE(0 == bx::log2(1) );
  35. REQUIRE(1.0f == bx::log2(2.0f) );
  36. REQUIRE(1 == bx::log2(2) );
  37. REQUIRE(2.0f == bx::log2(4.0f) );
  38. REQUIRE(2 == bx::log2(4) );
  39. REQUIRE(3.0f == bx::log2(8.0f) );
  40. REQUIRE(3 == bx::log2(8) );
  41. REQUIRE(4.0f == bx::log2(16.0f) );
  42. REQUIRE(4 == bx::log2(16) );
  43. REQUIRE(5.0f == bx::log2(32.0f) );
  44. REQUIRE(5 == bx::log2(32) );
  45. REQUIRE(6.0f == bx::log2(64.0f) );
  46. REQUIRE(6 == bx::log2(64) );
  47. REQUIRE(7.0f == bx::log2(128.0f) );
  48. REQUIRE(7 == bx::log2(128) );
  49. REQUIRE(8.0f == bx::log2(256.0f) );
  50. REQUIRE(8 == bx::log2(256) );
  51. }
  52. TEST_CASE("libm", "")
  53. {
  54. bx::WriterI* writer = bx::getNullOut();
  55. bx::Error err;
  56. REQUIRE(1389.0f == bx::abs(-1389.0f) );
  57. REQUIRE(1389.0f == bx::abs( 1389.0f) );
  58. REQUIRE( 0.0f == bx::abs(-0.0f) );
  59. REQUIRE( 0.0f == bx::abs( 0.0f) );
  60. REQUIRE(389.0f == bx::mod(1389.0f, 1000.0f) );
  61. REQUIRE( 13.0f == bx::floor( 13.89f) );
  62. REQUIRE(-14.0f == bx::floor(-13.89f) );
  63. REQUIRE( 14.0f == bx::ceil( 13.89f) );
  64. REQUIRE(-13.0f == bx::ceil( -13.89f) );
  65. REQUIRE( 13.0f == bx::trunc( 13.89f) );
  66. REQUIRE(-13.0f == bx::trunc(-13.89f) );
  67. REQUIRE(bx::isEqual( 0.89f, bx::fract( 13.89f), 0.000001f) );
  68. REQUIRE(bx::isEqual(-0.89f, bx::fract(-13.89f), 0.000001f) );
  69. for (int32_t yy = -10; yy < 10; ++yy)
  70. {
  71. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  72. {
  73. bx::write(writer, &err, "ldexp(%f, %d) == %f (expected: %f)\n", xx, yy, bx::ldexp(xx, yy), ::ldexpf(xx, yy) );
  74. REQUIRE(bx::isEqual(bx::ldexp(xx, yy), ::ldexpf(xx, yy), 0.00001f) );
  75. }
  76. }
  77. for (float xx = -80.0f; xx < 80.0f; xx += 0.1f)
  78. {
  79. bx::write(writer, &err, "exp(%f) == %f (expected: %f)\n", xx, bx::exp(xx), ::expf(xx) );
  80. REQUIRE(err.isOk() );
  81. REQUIRE(bx::isEqual(bx::exp(xx), ::expf(xx), 0.00001f) );
  82. }
  83. for (float xx = 0.0f; xx < 100.0f; xx += 0.1f)
  84. {
  85. bx::write(writer, &err, "rsqrt(%f) == %f (expected: %f)\n", xx, bx::rsqrt(xx), 1.0f/::sqrtf(xx) );
  86. REQUIRE(err.isOk() );
  87. REQUIRE(bx::isEqual(bx::rsqrt(xx), 1.0f/::sqrtf(xx), 0.00001f) );
  88. }
  89. REQUIRE(bx::isNan(bx::sqrt(-1.0f) ) );
  90. REQUIRE(bx::isEqual(bx::sqrt(0.0f), 0.0f, 0.0f) );
  91. REQUIRE(bx::isEqual(bx::sqrt(1.0f), 1.0f, 0.0f) );
  92. for (float xx = 0.0f; xx < 1000000.0f; xx += 1000.f)
  93. {
  94. bx::write(writer, &err, "sqrt(%f) == %f (expected: %f)\n", xx, bx::sqrt(xx), ::sqrtf(xx) );
  95. REQUIRE(err.isOk() );
  96. REQUIRE(bx::isEqual(bx::sqrt(xx), ::sqrtf(xx), 0.00001f) );
  97. }
  98. for (float xx = 0.0f; xx < 100.0f; xx += 0.1f)
  99. {
  100. bx::write(writer, &err, "sqrt(%f) == %f (expected: %f)\n", xx, bx::sqrt(xx), ::sqrtf(xx) );
  101. REQUIRE(err.isOk() );
  102. REQUIRE(bx::isEqual(bx::sqrt(xx), ::sqrtf(xx), 0.00001f) );
  103. }
  104. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  105. {
  106. bx::write(writer, &err, "pow(1.389f, %f) == %f (expected: %f)\n", xx, bx::pow(1.389f, xx), ::powf(1.389f, xx) );
  107. REQUIRE(err.isOk() );
  108. REQUIRE(bx::isEqual(bx::pow(1.389f, xx), ::powf(1.389f, xx), 0.00001f) );
  109. }
  110. for (float xx = -1.0f; xx < 1.0f; xx += 0.001f)
  111. {
  112. bx::write(writer, &err, "asin(%f) == %f (expected: %f)\n", xx, bx::asin(xx), ::asinf(xx) );
  113. REQUIRE(err.isOk() );
  114. REQUIRE(bx::isEqual(bx::asin(xx), ::asinf(xx), 0.0001f) );
  115. }
  116. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  117. {
  118. bx::write(writer, &err, "sin(%f) == %f (expected: %f)\n", xx, bx::sin(xx), ::sinf(xx) );
  119. REQUIRE(err.isOk() );
  120. REQUIRE(bx::isEqual(bx::sin(xx), ::sinf(xx), 0.00001f) );
  121. }
  122. for (float xx = -bx::kPi2; xx < bx::kPi2; xx += 0.0001f)
  123. {
  124. bx::write(writer, &err, "sin(%f) == %f (expected: %f)\n", xx, bx::sin(xx), ::sinf(xx) );
  125. REQUIRE(err.isOk() );
  126. REQUIRE(bx::isEqual(bx::sin(xx), ::sinf(xx), 0.00001f) );
  127. }
  128. for (float xx = -1.0f; xx < 1.0f; xx += 0.1f)
  129. {
  130. bx::write(writer, &err, "sinh(%f) == %f (expected: %f)\n", xx, bx::sinh(xx), ::sinhf(xx) );
  131. REQUIRE(err.isOk() );
  132. REQUIRE(bx::isEqual(bx::sinh(xx), ::sinhf(xx), 0.00001f) );
  133. }
  134. for (float xx = -1.0f; xx < 1.0f; xx += 0.001f)
  135. {
  136. bx::write(writer, &err, "acos(%f) == %f (expected: %f\n)", xx, bx::acos(xx), ::acosf(xx) );
  137. REQUIRE(err.isOk() );
  138. REQUIRE(bx::isEqual(bx::acos(xx), ::acosf(xx), 0.0001f) );
  139. }
  140. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  141. {
  142. bx::write(writer, &err, "cos(%f) == %f (expected: %f)\n", xx, bx::cos(xx), ::cosf(xx) );
  143. REQUIRE(err.isOk() );
  144. REQUIRE(bx::isEqual(bx::cos(xx), ::cosf(xx), 0.00001f) );
  145. }
  146. for (float xx = -bx::kPi2; xx < bx::kPi2; xx += 0.0001f)
  147. {
  148. bx::write(writer, &err, "cos(%f) == %f (expected: %f)\n", xx, bx::cos(xx), ::cosf(xx) );
  149. REQUIRE(err.isOk() );
  150. REQUIRE(bx::isEqual(bx::cos(xx), ::cosf(xx), 0.00001f) );
  151. }
  152. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  153. {
  154. bx::write(writer, &err, "tan(%f) == %f (expected: %f)\n", xx, bx::tan(xx), ::tanf(xx) );
  155. REQUIRE(err.isOk() );
  156. REQUIRE(bx::isEqual(bx::tan(xx), ::tanf(xx), 0.001f) );
  157. }
  158. for (float xx = -1.0f; xx < 1.0f; xx += 0.1f)
  159. {
  160. bx::write(writer, &err, "tanh(%f) == %f (expected: %f\n", xx, bx::tanh(xx), ::tanhf(xx) );
  161. REQUIRE(err.isOk() );
  162. REQUIRE(bx::isEqual(bx::tanh(xx), ::tanhf(xx), 0.00001f) );
  163. }
  164. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  165. {
  166. bx::write(writer, &err, "atan(%f) == %f (expected: %f)\n", xx, bx::atan(xx), ::atanf(xx) );
  167. REQUIRE(err.isOk() );
  168. REQUIRE(bx::isEqual(bx::atan(xx), ::atanf(xx), 0.00001f) );
  169. }
  170. }
  171. TEST_CASE("atan2", "")
  172. {
  173. bx::WriterI* writer = bx::getNullOut();
  174. bx::Error err;
  175. REQUIRE(bx::isEqual(bx::atan2(0.0f, 0.0f), ::atan2f(0.0f, 0.0f), 0.00001f) );
  176. REQUIRE(bx::isEqual(bx::atan2(0.0f, 1.0f), ::atan2f(0.0f, 1.0f), 0.00001f) );
  177. REQUIRE(bx::isEqual(bx::atan2(0.0f, -1.0f), ::atan2f(0.0f, -1.0f), 0.00001f) );
  178. for (float yy = -100.0f; yy < 100.0f; yy += 0.1f)
  179. {
  180. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  181. {
  182. bx::write(writer, &err, "atan2(%f, %f) == %f (expected: %f)\n", yy, xx, bx::atan2(yy, xx), ::atan2f(yy, xx) );
  183. REQUIRE(err.isOk() );
  184. REQUIRE(bx::isEqual(bx::atan2(yy, xx), ::atan2f(yy, xx), 0.00001f) );
  185. }
  186. }
  187. }
  188. TEST_CASE("sign", "")
  189. {
  190. REQUIRE(-1 == bx::sign(-0.1389f) );
  191. REQUIRE( 0 == bx::sign( 0.0000f) );
  192. REQUIRE( 1 == bx::sign( 0.1389f) );
  193. }
  194. TEST_CASE("ToBits", "")
  195. {
  196. REQUIRE(UINT32_C(0x12345678) == bx::floatToBits( bx::bitsToFloat( UINT32_C(0x12345678) ) ) );
  197. REQUIRE(UINT64_C(0x123456789abcdef0) == bx::doubleToBits(bx::bitsToDouble(UINT32_C(0x123456789abcdef0) ) ) );
  198. }
  199. TEST_CASE("lerp", "")
  200. {
  201. REQUIRE(1389.0f == bx::lerp(1389.0f, 1453.0f, 0.0f) );
  202. REQUIRE(1453.0f == bx::lerp(1389.0f, 1453.0f, 1.0f) );
  203. REQUIRE(0.5f == bx::lerp(0.0f, 1.0f, 0.5f) );
  204. }
  205. void mtxCheck(const float* _a, const float* _b)
  206. {
  207. if (!bx::isEqual(_a, _b, 16, 0.01f) )
  208. {
  209. DBG("\n"
  210. "A:\n"
  211. "%10.4f %10.4f %10.4f %10.4f\n"
  212. "%10.4f %10.4f %10.4f %10.4f\n"
  213. "%10.4f %10.4f %10.4f %10.4f\n"
  214. "%10.4f %10.4f %10.4f %10.4f\n"
  215. "B:\n"
  216. "%10.4f %10.4f %10.4f %10.4f\n"
  217. "%10.4f %10.4f %10.4f %10.4f\n"
  218. "%10.4f %10.4f %10.4f %10.4f\n"
  219. "%10.4f %10.4f %10.4f %10.4f\n"
  220. , _a[ 0], _a[ 1], _a[ 2], _a[ 3]
  221. , _a[ 4], _a[ 5], _a[ 6], _a[ 7]
  222. , _a[ 8], _a[ 9], _a[10], _a[11]
  223. , _a[12], _a[13], _a[14], _a[15]
  224. , _b[ 0], _b[ 1], _b[ 2], _b[ 3]
  225. , _b[ 4], _b[ 5], _b[ 6], _b[ 7]
  226. , _b[ 8], _b[ 9], _b[10], _b[11]
  227. , _b[12], _b[13], _b[14], _b[15]
  228. );
  229. REQUIRE(false);
  230. }
  231. }
  232. TEST_CASE("vec3", "")
  233. {
  234. bx::Vec3 normalized = bx::normalize({0.0f, 1.0f, 0.0f});
  235. REQUIRE(bx::isEqual(normalized, {0.0f, 1.0f, 0.0f}, 0.0f) );
  236. float length = bx::length(normalized);
  237. REQUIRE(bx::isEqual(length, 1.0f, 0.0f) );
  238. }
  239. TEST_CASE("quaternion", "")
  240. {
  241. float mtxQ[16];
  242. float mtx[16];
  243. bx::Quaternion quat = bx::init::Identity;
  244. bx::Quaternion q2 = bx::init::None;
  245. bx::Vec3 axis = bx::init::None;
  246. bx::Vec3 euler = bx::init::None;
  247. float angle;
  248. bx::mtxFromQuaternion(mtxQ, quat);
  249. bx::mtxIdentity(mtx);
  250. mtxCheck(mtxQ, mtx);
  251. float ax = bx::kPi/27.0f;
  252. float ay = bx::kPi/13.0f;
  253. float az = bx::kPi/7.0f;
  254. { // x
  255. quat = bx::rotateX(ax);
  256. bx::mtxFromQuaternion(mtxQ, quat);
  257. bx::mtxRotateX(mtx, ax);
  258. mtxCheck(mtxQ, mtx);
  259. bx::toAxisAngle(axis, angle, quat);
  260. REQUIRE(bx::isEqual(axis, bx::Vec3{1.0f, 0.0f, 0.0f}, 0.01f) );
  261. REQUIRE(bx::isEqual(angle, ax, 0.01f) );
  262. euler = bx::toEuler(quat);
  263. REQUIRE(bx::isEqual(euler.x, ax, 0.001f) );
  264. q2 = bx::fromEuler(euler);
  265. REQUIRE(bx::isEqual(quat, q2, 0.001f) );
  266. }
  267. { // y
  268. quat = bx::rotateY(ay);
  269. bx::mtxFromQuaternion(mtxQ, quat);
  270. bx::mtxRotateY(mtx, ay);
  271. mtxCheck(mtxQ, mtx);
  272. bx::toAxisAngle(axis, angle, quat);
  273. REQUIRE(bx::isEqual(axis, bx::Vec3{0.0f, 1.0f, 0.0f}, 0.01f) );
  274. REQUIRE(bx::isEqual(angle, ay, 0.01f) );
  275. euler = bx::toEuler(quat);
  276. REQUIRE(bx::isEqual(euler.y, ay, 0.001f) );
  277. q2 = bx::fromEuler(euler);
  278. REQUIRE(bx::isEqual(quat, q2, 0.001f) );
  279. }
  280. { // z
  281. quat = bx::rotateZ(az);
  282. bx::mtxFromQuaternion(mtxQ, quat);
  283. bx::mtxRotateZ(mtx, az);
  284. mtxCheck(mtxQ, mtx);
  285. bx::toAxisAngle(axis, angle, quat);
  286. REQUIRE(bx::isEqual(axis, bx::Vec3{0.0f, 0.0f, 1.0f}, 0.01f) );
  287. REQUIRE(bx::isEqual(angle, az, 0.01f) );
  288. euler = bx::toEuler(quat);
  289. REQUIRE(bx::isEqual(euler.z, az, 0.001f) );
  290. q2 = bx::fromEuler(euler);
  291. REQUIRE(bx::isEqual(quat, q2, 0.001f) );
  292. }
  293. }
  294. TEST_CASE("limits", "")
  295. {
  296. STATIC_REQUIRE(bx::LimitsT<int8_t>::min == INT8_MIN);
  297. STATIC_REQUIRE(bx::LimitsT<int8_t>::max == INT8_MAX);
  298. STATIC_REQUIRE(bx::LimitsT<signed char>::min == CHAR_MIN);
  299. STATIC_REQUIRE(bx::LimitsT<signed char>::max == CHAR_MAX);
  300. STATIC_REQUIRE(bx::LimitsT<unsigned char>::min == 0);
  301. STATIC_REQUIRE(bx::LimitsT<unsigned char>::max == UCHAR_MAX);
  302. STATIC_REQUIRE(bx::LimitsT<int16_t>::min == INT16_MIN);
  303. STATIC_REQUIRE(bx::LimitsT<int16_t>::max == INT16_MAX);
  304. STATIC_REQUIRE(bx::LimitsT<uint16_t>::min == 0);
  305. STATIC_REQUIRE(bx::LimitsT<uint16_t>::max == UINT16_MAX);
  306. STATIC_REQUIRE(bx::LimitsT<int32_t>::min == INT32_MIN);
  307. STATIC_REQUIRE(bx::LimitsT<int32_t>::max == INT32_MAX);
  308. STATIC_REQUIRE(bx::LimitsT<uint32_t>::min == 0);
  309. STATIC_REQUIRE(bx::LimitsT<uint32_t>::max == UINT32_MAX);
  310. STATIC_REQUIRE(bx::LimitsT<int64_t>::min == INT64_MIN);
  311. STATIC_REQUIRE(bx::LimitsT<int64_t>::max == INT64_MAX);
  312. STATIC_REQUIRE(bx::LimitsT<uint64_t>::min == 0);
  313. STATIC_REQUIRE(bx::LimitsT<uint64_t>::max == UINT64_MAX);
  314. STATIC_REQUIRE(bx::LimitsT<float>::min == std::numeric_limits<float>::lowest() );
  315. STATIC_REQUIRE(bx::LimitsT<float>::max == std::numeric_limits<float>::max() );
  316. STATIC_REQUIRE(bx::LimitsT<double>::min == std::numeric_limits<double>::lowest() );
  317. STATIC_REQUIRE(bx::LimitsT<double>::max == std::numeric_limits<double>::max() );
  318. }