math_test.cpp 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667
  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", "[math]")
  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. REQUIRE(::__isnanf(u.f) == bx::isNan(u.f) );
  18. REQUIRE(::__isfinitef(u.f) == bx::isFinite(u.f) );
  19. REQUIRE(::__isinff(u.f) == bx::isInfinite(u.f) );
  20. #elif BX_COMPILER_MSVC
  21. REQUIRE(!!::isnan(u.f) == bx::isNan(u.f));
  22. REQUIRE(!!::isfinite(u.f) == bx::isFinite(u.f));
  23. REQUIRE(!!::isinf(u.f) == bx::isInfinite(u.f));
  24. #else
  25. REQUIRE(::isnanf(u.f) == bx::isNan(u.f) );
  26. REQUIRE(::finitef(u.f) == bx::isFinite(u.f) );
  27. REQUIRE(::isinff(u.f) == bx::isInfinite(u.f) );
  28. #endif // BX_PLATFORM_OSX
  29. }
  30. }
  31. bool log2_test(float _a)
  32. {
  33. return bx::log2(_a) == bx::log(_a) * (1.0f / bx::log(2.0f) );
  34. }
  35. TEST_CASE("log2", "[math][libm]")
  36. {
  37. log2_test(0.0f);
  38. log2_test(256.0f);
  39. REQUIRE(0.0f == bx::log2(1.0f) );
  40. REQUIRE(1.0f == bx::log2(2.0f) );
  41. REQUIRE(2.0f == bx::log2(4.0f) );
  42. REQUIRE(3.0f == bx::log2(8.0f) );
  43. REQUIRE(4.0f == bx::log2(16.0f) );
  44. REQUIRE(5.0f == bx::log2(32.0f) );
  45. REQUIRE(6.0f == bx::log2(64.0f) );
  46. REQUIRE(7.0f == bx::log2(128.0f) );
  47. REQUIRE(8.0f == bx::log2(256.0f) );
  48. }
  49. TEST_CASE("ceilLog2", "[math]")
  50. {
  51. REQUIRE(0 == bx::ceilLog2(-1) );
  52. REQUIRE(0 == bx::ceilLog2(0) );
  53. REQUIRE(0 == bx::ceilLog2(1) );
  54. REQUIRE(1 == bx::ceilLog2(2) );
  55. REQUIRE(2 == bx::ceilLog2(4) );
  56. REQUIRE(3 == bx::ceilLog2(8) );
  57. REQUIRE(4 == bx::ceilLog2(16) );
  58. REQUIRE(5 == bx::ceilLog2(32) );
  59. REQUIRE(6 == bx::ceilLog2(64) );
  60. REQUIRE(7 == bx::ceilLog2(128) );
  61. REQUIRE(8 == bx::ceilLog2(256) );
  62. {
  63. uint32_t ii = 0;
  64. for (; ii < 8; ++ii)
  65. {
  66. REQUIRE(ii == bx::ceilLog2(uint8_t(1<<ii) ) );
  67. REQUIRE(ii == bx::ceilLog2(uint16_t(1<<ii) ) );
  68. REQUIRE(ii == bx::ceilLog2(uint32_t(1<<ii) ) );
  69. REQUIRE(ii == bx::ceilLog2(uint64_t(1llu<<ii) ) );
  70. }
  71. for (; ii < 16; ++ii)
  72. {
  73. REQUIRE(ii == bx::ceilLog2(uint16_t(1<<ii) ) );
  74. REQUIRE(ii == bx::ceilLog2(uint32_t(1<<ii) ) );
  75. REQUIRE(ii == bx::ceilLog2(uint64_t(1llu<<ii) ) );
  76. }
  77. for (; ii < 32; ++ii)
  78. {
  79. REQUIRE(ii == bx::ceilLog2(uint32_t(1<<ii) ) );
  80. REQUIRE(ii == bx::ceilLog2(uint64_t(1llu<<ii) ) );
  81. }
  82. for (; ii < 64; ++ii)
  83. {
  84. REQUIRE(ii == bx::ceilLog2(uint64_t(1llu<<ii) ) );
  85. }
  86. }
  87. for (uint32_t ii = 1; ii < INT32_MAX; ii += rand()%(1<<13)+1)
  88. {
  89. // DBG("%u: %u %u", ii, bx::uint32_nextpow2(ii), bx::nextPow2(ii) );
  90. REQUIRE(bx::nextPow2(ii) == bx::uint32_nextpow2(ii) );
  91. }
  92. }
  93. TEST_CASE("countTrailingZeros", "[math]")
  94. {
  95. REQUIRE( 0 == bx::countTrailingZeros<uint8_t >(1) );
  96. REQUIRE( 7 == bx::countTrailingZeros<uint8_t >(1<<7) );
  97. REQUIRE( 8 == bx::countTrailingZeros<uint8_t >(0) );
  98. REQUIRE( 1 == bx::countTrailingZeros<uint8_t >(0x3e) );
  99. REQUIRE( 0 == bx::countTrailingZeros<uint16_t>(1) );
  100. REQUIRE(15 == bx::countTrailingZeros<uint16_t>(1<<15) );
  101. REQUIRE(16 == bx::countTrailingZeros<uint16_t>(0) );
  102. REQUIRE( 0 == bx::countTrailingZeros<uint32_t>(1) );
  103. REQUIRE(32 == bx::countTrailingZeros<uint32_t>(0) );
  104. REQUIRE(31 == bx::countTrailingZeros<uint32_t>(1u<<31) );
  105. REQUIRE( 0 == bx::countTrailingZeros<uint64_t>(1) );
  106. REQUIRE(64 == bx::countTrailingZeros<uint64_t>(0) );
  107. }
  108. TEST_CASE("countLeadingZeros", "[math]")
  109. {
  110. REQUIRE( 7 == bx::countLeadingZeros<uint8_t >(1) );
  111. REQUIRE( 8 == bx::countLeadingZeros<uint8_t >(0) );
  112. REQUIRE( 2 == bx::countLeadingZeros<uint8_t >(0x3e) );
  113. REQUIRE(15 == bx::countLeadingZeros<uint16_t>(1) );
  114. REQUIRE(16 == bx::countLeadingZeros<uint16_t>(0) );
  115. REQUIRE(31 == bx::countLeadingZeros<uint32_t>(1) );
  116. REQUIRE(32 == bx::countLeadingZeros<uint32_t>(0) );
  117. REQUIRE(63 == bx::countLeadingZeros<uint64_t>(1) );
  118. REQUIRE(64 == bx::countLeadingZeros<uint64_t>(0) );
  119. }
  120. TEST_CASE("countBits", "[math]")
  121. {
  122. REQUIRE( 0 == bx::countBits(0) );
  123. REQUIRE( 1 == bx::countBits(1) );
  124. REQUIRE( 4 == bx::countBits<uint8_t>(0x55) );
  125. REQUIRE( 8 == bx::countBits<uint16_t>(0x5555) );
  126. REQUIRE(16 == bx::countBits<uint32_t>(0x55555555) );
  127. REQUIRE(32 == bx::countBits<uint64_t>(0x5555555555555555) );
  128. REQUIRE( 8 == bx::countBits(UINT8_MAX) );
  129. REQUIRE(16 == bx::countBits(UINT16_MAX) );
  130. REQUIRE(32 == bx::countBits(UINT32_MAX) );
  131. REQUIRE(64 == bx::countBits(UINT64_MAX) );
  132. }
  133. TEST_CASE("findFirstSet", "[math]")
  134. {
  135. REQUIRE( 1 == bx::findFirstSet<uint8_t >(1) );
  136. REQUIRE( 8 == bx::findFirstSet<uint8_t >(1<<7) );
  137. REQUIRE( 0 == bx::findFirstSet<uint8_t >(0) );
  138. REQUIRE( 2 == bx::findFirstSet<uint8_t >(0x3e) );
  139. REQUIRE( 1 == bx::findFirstSet<uint16_t>(1) );
  140. REQUIRE(16 == bx::findFirstSet<uint16_t>(1<<15) );
  141. REQUIRE( 0 == bx::findFirstSet<uint16_t>(0) );
  142. REQUIRE( 1 == bx::findFirstSet<uint32_t>(1) );
  143. REQUIRE( 0 == bx::findFirstSet<uint32_t>(0) );
  144. REQUIRE(32 == bx::findFirstSet<uint32_t>(1u<<31) );
  145. REQUIRE( 1 == bx::findFirstSet<uint64_t>(1) );
  146. REQUIRE( 0 == bx::findFirstSet<uint64_t>(0) );
  147. }
  148. BX_PRAGMA_DIAGNOSTIC_PUSH();
  149. BX_PRAGMA_DIAGNOSTIC_IGNORED_MSVC(4723) // potential divide by 0
  150. TEST_CASE("rsqrt", "[math][libm]")
  151. {
  152. bx::WriterI* writer = bx::getNullOut();
  153. bx::Error err;
  154. // rsqrtRef
  155. REQUIRE(bx::isInfinite(bx::rsqrtRef(0.0f)));
  156. for (float xx = bx::kNearZero; xx < 100.0f; xx += 0.1f)
  157. {
  158. bx::write(writer, &err, "rsqrtRef(%f) == %f (expected: %f)\n", xx, bx::rsqrtRef(xx), 1.0f / ::sqrtf(xx));
  159. REQUIRE(err.isOk());
  160. REQUIRE(bx::isEqual(bx::rsqrtRef(xx), 1.0f / ::sqrtf(xx), 0.00001f));
  161. }
  162. // rsqrtSimd
  163. REQUIRE(bx::isInfinite(bx::rsqrtSimd(0.0f)));
  164. for (float xx = bx::kNearZero; xx < 100.0f; xx += 0.1f)
  165. {
  166. bx::write(writer, &err, "rsqrtSimd(%f) == %f (expected: %f)\n", xx, bx::rsqrtSimd(xx), 1.0f / ::sqrtf(xx));
  167. REQUIRE(err.isOk());
  168. REQUIRE(bx::isEqual(bx::rsqrtSimd(xx), 1.0f / ::sqrtf(xx), 0.00001f));
  169. }
  170. // rsqrt
  171. REQUIRE(bx::isInfinite(1.0f / ::sqrtf(0.0f)));
  172. REQUIRE(bx::isInfinite(bx::rsqrt(0.0f)));
  173. for (float xx = bx::kNearZero; xx < 100.0f; xx += 0.1f)
  174. {
  175. bx::write(writer, &err, "rsqrt(%f) == %f (expected: %f)\n", xx, bx::rsqrt(xx), 1.0f / ::sqrtf(xx));
  176. REQUIRE(err.isOk());
  177. REQUIRE(bx::isEqual(bx::rsqrt(xx), 1.0f / ::sqrtf(xx), 0.00001f));
  178. }
  179. }
  180. TEST_CASE("sqrt", "[math][libm]")
  181. {
  182. bx::WriterI* writer = bx::getNullOut();
  183. bx::Error err;
  184. // sqrtRef
  185. REQUIRE(bx::isNan(bx::sqrtRef(-1.0f)));
  186. REQUIRE(bx::isEqual(bx::sqrtRef(0.0f), ::sqrtf(0.0f), 0.0f));
  187. REQUIRE(bx::isEqual(bx::sqrtRef(1.0f), ::sqrtf(1.0f), 0.0f));
  188. for (float xx = 0.0f; xx < 1000000.0f; xx += 1000.f)
  189. {
  190. bx::write(writer, &err, "sqrtRef(%f) == %f (expected: %f)\n", xx, bx::sqrtRef(xx), ::sqrtf(xx));
  191. REQUIRE(err.isOk());
  192. REQUIRE(bx::isEqual(bx::sqrtRef(xx), ::sqrtf(xx), 0.00001f));
  193. }
  194. // sqrtSimd
  195. REQUIRE(bx::isNan(bx::sqrtSimd(-1.0f)));
  196. REQUIRE(bx::isEqual(bx::sqrtSimd(0.0f), ::sqrtf(0.0f), 0.0f));
  197. REQUIRE(bx::isEqual(bx::sqrtSimd(1.0f), ::sqrtf(1.0f), 0.0f));
  198. for (float xx = 0.0f; xx < 1000000.0f; xx += 1000.f)
  199. {
  200. bx::write(writer, &err, "sqrtSimd(%f) == %f (expected: %f)\n", xx, bx::sqrtSimd(xx), ::sqrtf(xx));
  201. REQUIRE(err.isOk());
  202. REQUIRE(bx::isEqual(bx::sqrtSimd(xx), ::sqrtf(xx), 0.00001f));
  203. }
  204. for (float xx = 0.0f; xx < 100.0f; xx += 0.1f)
  205. {
  206. bx::write(writer, &err, "sqrt(%f) == %f (expected: %f)\n", xx, bx::sqrt(xx), ::sqrtf(xx));
  207. REQUIRE(err.isOk());
  208. REQUIRE(bx::isEqual(bx::sqrt(xx), ::sqrtf(xx), 0.00001f));
  209. }
  210. // sqrt
  211. REQUIRE(bx::isNan(::sqrtf(-1.0f)));
  212. REQUIRE(bx::isNan(bx::sqrt(-1.0f)));
  213. REQUIRE(bx::isEqual(bx::sqrt(0.0f), ::sqrtf(0.0f), 0.0f));
  214. REQUIRE(bx::isEqual(bx::sqrt(1.0f), ::sqrtf(1.0f), 0.0f));
  215. for (float xx = 0.0f; xx < 1000000.0f; xx += 1000.f)
  216. {
  217. bx::write(writer, &err, "sqrt(%f) == %f (expected: %f)\n", xx, bx::sqrt(xx), ::sqrtf(xx));
  218. REQUIRE(err.isOk());
  219. REQUIRE(bx::isEqual(bx::sqrt(xx), ::sqrtf(xx), 0.00001f));
  220. }
  221. for (float xx = 0.0f; xx < 100.0f; xx += 0.1f)
  222. {
  223. bx::write(writer, &err, "sqrt(%f) == %f (expected: %f)\n", xx, bx::sqrt(xx), ::sqrtf(xx));
  224. REQUIRE(err.isOk());
  225. REQUIRE(bx::isEqual(bx::sqrt(xx), ::sqrtf(xx), 0.00001f));
  226. }
  227. }
  228. BX_PRAGMA_DIAGNOSTIC_POP();
  229. TEST_CASE("abs", "[math][libm]")
  230. {
  231. REQUIRE(1389.0f == bx::abs(-1389.0f) );
  232. REQUIRE(1389.0f == bx::abs( 1389.0f) );
  233. REQUIRE( 0.0f == bx::abs(-0.0f) );
  234. REQUIRE( 0.0f == bx::abs( 0.0f) );
  235. }
  236. TEST_CASE("mod", "[math][libm]")
  237. {
  238. REQUIRE(389.0f == bx::mod(1389.0f, 1000.0f) );
  239. }
  240. TEST_CASE("floor", "[math][libm]")
  241. {
  242. REQUIRE( 13.0f == bx::floor( 13.89f) );
  243. REQUIRE(-14.0f == bx::floor(-13.89f) );
  244. }
  245. TEST_CASE("ceil", "[math][libm]")
  246. {
  247. REQUIRE( 14.0f == bx::ceil( 13.89f) );
  248. REQUIRE(-13.0f == bx::ceil( -13.89f) );
  249. }
  250. TEST_CASE("trunc", "[math][libm]")
  251. {
  252. REQUIRE( 13.0f == bx::trunc( 13.89f) );
  253. REQUIRE(-13.0f == bx::trunc(-13.89f) );
  254. }
  255. TEST_CASE("fract", "[math][libm]")
  256. {
  257. REQUIRE(bx::isEqual( 0.89f, bx::fract( 13.89f), 0.000001f) );
  258. REQUIRE(bx::isEqual(-0.89f, bx::fract(-13.89f), 0.000001f) );
  259. }
  260. TEST_CASE("ldexp", "[math][libm]")
  261. {
  262. bx::WriterI* writer = bx::getNullOut();
  263. bx::Error err;
  264. for (int32_t yy = -10; yy < 10; ++yy)
  265. {
  266. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  267. {
  268. bx::write(writer, &err, "ldexp(%f, %d) == %f (expected: %f)\n", xx, yy, bx::ldexp(xx, yy), ::ldexpf(xx, yy) );
  269. REQUIRE(bx::isEqual(bx::ldexp(xx, yy), ::ldexpf(xx, yy), 0.00001f) );
  270. }
  271. }
  272. }
  273. TEST_CASE("exp", "[math][libm]")
  274. {
  275. bx::WriterI* writer = bx::getNullOut();
  276. bx::Error err;
  277. for (float xx = -80.0f; xx < 80.0f; xx += 0.1f)
  278. {
  279. bx::write(writer, &err, "exp(%f) == %f (expected: %f)\n", xx, bx::exp(xx), ::expf(xx) );
  280. REQUIRE(err.isOk() );
  281. REQUIRE(bx::isEqual(bx::exp(xx), ::expf(xx), 0.00001f) );
  282. }
  283. }
  284. TEST_CASE("pow", "[math][libm]")
  285. {
  286. bx::WriterI* writer = bx::getNullOut();
  287. bx::Error err;
  288. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  289. {
  290. bx::write(writer, &err, "pow(1.389f, %f) == %f (expected: %f)\n", xx, bx::pow(1.389f, xx), ::powf(1.389f, xx) );
  291. REQUIRE(err.isOk() );
  292. REQUIRE(bx::isEqual(bx::pow(1.389f, xx), ::powf(1.389f, xx), 0.00001f) );
  293. }
  294. }
  295. TEST_CASE("asin", "[math][libm]")
  296. {
  297. bx::WriterI* writer = bx::getNullOut();
  298. bx::Error err;
  299. for (float xx = -1.0f; xx < 1.0f; xx += 0.001f)
  300. {
  301. bx::write(writer, &err, "asin(%f) == %f (expected: %f)\n", xx, bx::asin(xx), ::asinf(xx) );
  302. REQUIRE(err.isOk() );
  303. REQUIRE(bx::isEqual(bx::asin(xx), ::asinf(xx), 0.0001f) );
  304. }
  305. }
  306. TEST_CASE("sin", "[math][libm]")
  307. {
  308. bx::WriterI* writer = bx::getNullOut();
  309. bx::Error err;
  310. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  311. {
  312. bx::write(writer, &err, "sin(%f) == %f (expected: %f)\n", xx, bx::sin(xx), ::sinf(xx) );
  313. REQUIRE(err.isOk() );
  314. REQUIRE(bx::isEqual(bx::sin(xx), ::sinf(xx), 0.00001f) );
  315. }
  316. for (float xx = -bx::kPi2; xx < bx::kPi2; xx += 0.0001f)
  317. {
  318. bx::write(writer, &err, "sin(%f) == %f (expected: %f)\n", xx, bx::sin(xx), ::sinf(xx) );
  319. REQUIRE(err.isOk() );
  320. REQUIRE(bx::isEqual(bx::sin(xx), ::sinf(xx), 0.00001f) );
  321. }
  322. }
  323. TEST_CASE("sinh", "[math][libm]")
  324. {
  325. bx::WriterI* writer = bx::getNullOut();
  326. bx::Error err;
  327. for (float xx = -1.0f; xx < 1.0f; xx += 0.1f)
  328. {
  329. bx::write(writer, &err, "sinh(%f) == %f (expected: %f)\n", xx, bx::sinh(xx), ::sinhf(xx) );
  330. REQUIRE(err.isOk() );
  331. REQUIRE(bx::isEqual(bx::sinh(xx), ::sinhf(xx), 0.00001f) );
  332. }
  333. }
  334. TEST_CASE("acos", "[math][libm]")
  335. {
  336. bx::WriterI* writer = bx::getNullOut();
  337. bx::Error err;
  338. for (float xx = -1.0f; xx < 1.0f; xx += 0.001f)
  339. {
  340. bx::write(writer, &err, "acos(%f) == %f (expected: %f\n)", xx, bx::acos(xx), ::acosf(xx) );
  341. REQUIRE(err.isOk() );
  342. REQUIRE(bx::isEqual(bx::acos(xx), ::acosf(xx), 0.0001f) );
  343. }
  344. }
  345. TEST_CASE("cos", "[math][libm]")
  346. {
  347. bx::WriterI* writer = bx::getNullOut();
  348. bx::Error err;
  349. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  350. {
  351. bx::write(writer, &err, "cos(%f) == %f (expected: %f)\n", xx, bx::cos(xx), ::cosf(xx) );
  352. REQUIRE(err.isOk() );
  353. REQUIRE(bx::isEqual(bx::cos(xx), ::cosf(xx), 0.00001f) );
  354. }
  355. for (float xx = -bx::kPi2; xx < bx::kPi2; xx += 0.0001f)
  356. {
  357. bx::write(writer, &err, "cos(%f) == %f (expected: %f)\n", xx, bx::cos(xx), ::cosf(xx) );
  358. REQUIRE(err.isOk() );
  359. REQUIRE(bx::isEqual(bx::cos(xx), ::cosf(xx), 0.00001f) );
  360. }
  361. }
  362. TEST_CASE("tan", "[math][libm]")
  363. {
  364. bx::WriterI* writer = bx::getNullOut();
  365. bx::Error err;
  366. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  367. {
  368. bx::write(writer, &err, "tan(%f) == %f (expected: %f)\n", xx, bx::tan(xx), ::tanf(xx) );
  369. REQUIRE(err.isOk() );
  370. REQUIRE(bx::isEqual(bx::tan(xx), ::tanf(xx), 0.001f) );
  371. }
  372. }
  373. TEST_CASE("tanh", "[math][libm]")
  374. {
  375. bx::WriterI* writer = bx::getNullOut();
  376. bx::Error err;
  377. for (float xx = -1.0f; xx < 1.0f; xx += 0.1f)
  378. {
  379. bx::write(writer, &err, "tanh(%f) == %f (expected: %f\n", xx, bx::tanh(xx), ::tanhf(xx) );
  380. REQUIRE(err.isOk() );
  381. REQUIRE(bx::isEqual(bx::tanh(xx), ::tanhf(xx), 0.00001f) );
  382. }
  383. }
  384. TEST_CASE("atan", "[math][libm]")
  385. {
  386. bx::WriterI* writer = bx::getNullOut();
  387. bx::Error err;
  388. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  389. {
  390. bx::write(writer, &err, "atan(%f) == %f (expected: %f)\n", xx, bx::atan(xx), ::atanf(xx) );
  391. REQUIRE(err.isOk() );
  392. REQUIRE(bx::isEqual(bx::atan(xx), ::atanf(xx), 0.00001f) );
  393. }
  394. }
  395. TEST_CASE("atan2", "[math][libm]")
  396. {
  397. bx::WriterI* writer = bx::getNullOut();
  398. bx::Error err;
  399. REQUIRE(bx::isEqual(bx::atan2(0.0f, 0.0f), ::atan2f(0.0f, 0.0f), 0.00001f) );
  400. REQUIRE(bx::isEqual(bx::atan2(0.0f, 1.0f), ::atan2f(0.0f, 1.0f), 0.00001f) );
  401. REQUIRE(bx::isEqual(bx::atan2(0.0f, -1.0f), ::atan2f(0.0f, -1.0f), 0.00001f) );
  402. for (float yy = -100.0f; yy < 100.0f; yy += 0.1f)
  403. {
  404. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  405. {
  406. bx::write(writer, &err, "atan2(%f, %f) == %f (expected: %f)\n", yy, xx, bx::atan2(yy, xx), ::atan2f(yy, xx) );
  407. REQUIRE(err.isOk() );
  408. REQUIRE(bx::isEqual(bx::atan2(yy, xx), ::atan2f(yy, xx), 0.00001f) );
  409. }
  410. }
  411. }
  412. TEST_CASE("sign", "[math][libm]")
  413. {
  414. STATIC_REQUIRE(-1 == bx::sign(-0.1389f) );
  415. STATIC_REQUIRE( 0 == bx::sign( 0.0000f) );
  416. STATIC_REQUIRE( 1 == bx::sign( 0.1389f) );
  417. REQUIRE(-1 == bx::sign(-bx::kFloatInfinity) );
  418. REQUIRE( 1 == bx::sign( bx::kFloatInfinity) );
  419. }
  420. TEST_CASE("signbit", "[math][libm]")
  421. {
  422. STATIC_REQUIRE( bx::signbit(-0.1389f) );
  423. STATIC_REQUIRE(!bx::signbit( 0.0000f) );
  424. STATIC_REQUIRE(!bx::signbit( 0.1389f) );
  425. REQUIRE( bx::signbit(-bx::kFloatInfinity) );
  426. REQUIRE(!bx::signbit( bx::kFloatInfinity) );
  427. }
  428. TEST_CASE("copysign", "[math][libm]")
  429. {
  430. STATIC_REQUIRE( 0.1389f == bx::copysign(-0.1389f, +1389) );
  431. STATIC_REQUIRE(-0.0000f == bx::copysign( 0.0000f, -1389) );
  432. STATIC_REQUIRE(-0.1389f == bx::copysign( 0.1389f, -1389) );
  433. REQUIRE(-bx::kFloatInfinity == bx::copysign(bx::kFloatInfinity, -1389) );
  434. }
  435. TEST_CASE("bitsToFloat, floatToBits, bitsToDouble, doubleToBits", "[math]")
  436. {
  437. REQUIRE(UINT32_C(0x12345678) == bx::floatToBits( bx::bitsToFloat( UINT32_C(0x12345678) ) ) );
  438. REQUIRE(UINT64_C(0x123456789abcdef0) == bx::doubleToBits(bx::bitsToDouble(UINT32_C(0x123456789abcdef0) ) ) );
  439. }
  440. TEST_CASE("lerp", "[math]")
  441. {
  442. REQUIRE(1389.0f == bx::lerp(1389.0f, 1453.0f, 0.0f) );
  443. REQUIRE(1453.0f == bx::lerp(1389.0f, 1453.0f, 1.0f) );
  444. REQUIRE( 0.5f == bx::lerp( 0.0f, 1.0f, 0.5f) );
  445. REQUIRE( 0.0f == bx::lerp( 0.0f, 0.0f, 0.5f) );
  446. }
  447. void mtxCheck(const float* _a, const float* _b)
  448. {
  449. if (!bx::isEqual(_a, _b, 16, 0.01f) )
  450. {
  451. DBG("\n"
  452. "A:\n"
  453. "%10.4f %10.4f %10.4f %10.4f\n"
  454. "%10.4f %10.4f %10.4f %10.4f\n"
  455. "%10.4f %10.4f %10.4f %10.4f\n"
  456. "%10.4f %10.4f %10.4f %10.4f\n"
  457. "B:\n"
  458. "%10.4f %10.4f %10.4f %10.4f\n"
  459. "%10.4f %10.4f %10.4f %10.4f\n"
  460. "%10.4f %10.4f %10.4f %10.4f\n"
  461. "%10.4f %10.4f %10.4f %10.4f\n"
  462. , _a[ 0], _a[ 1], _a[ 2], _a[ 3]
  463. , _a[ 4], _a[ 5], _a[ 6], _a[ 7]
  464. , _a[ 8], _a[ 9], _a[10], _a[11]
  465. , _a[12], _a[13], _a[14], _a[15]
  466. , _b[ 0], _b[ 1], _b[ 2], _b[ 3]
  467. , _b[ 4], _b[ 5], _b[ 6], _b[ 7]
  468. , _b[ 8], _b[ 9], _b[10], _b[11]
  469. , _b[12], _b[13], _b[14], _b[15]
  470. );
  471. REQUIRE(false);
  472. }
  473. }
  474. TEST_CASE("vec3", "[math][vec3]")
  475. {
  476. bx::Vec3 normalized = bx::normalize({0.0f, 1.0f, 0.0f});
  477. REQUIRE(bx::isEqual(normalized, {0.0f, 1.0f, 0.0f}, 0.0f) );
  478. float length = bx::length(normalized);
  479. REQUIRE(bx::isEqual(length, 1.0f, 0.0f) );
  480. }
  481. TEST_CASE("quaternion", "[math][quaternion]")
  482. {
  483. float mtxQ[16];
  484. float mtx[16];
  485. bx::Quaternion quat = bx::InitIdentity;
  486. bx::Quaternion q2 = bx::InitNone;
  487. bx::Vec3 axis = bx::InitNone;
  488. bx::Vec3 euler = bx::InitNone;
  489. float angle;
  490. bx::mtxFromQuaternion(mtxQ, quat);
  491. bx::mtxIdentity(mtx);
  492. mtxCheck(mtxQ, mtx);
  493. float ax = bx::kPi/27.0f;
  494. float ay = bx::kPi/13.0f;
  495. float az = bx::kPi/7.0f;
  496. { // x
  497. quat = bx::rotateX(ax);
  498. bx::mtxFromQuaternion(mtxQ, quat);
  499. bx::mtxRotateX(mtx, ax);
  500. mtxCheck(mtxQ, mtx);
  501. bx::toAxisAngle(axis, angle, quat);
  502. REQUIRE(bx::isEqual(axis, bx::Vec3{1.0f, 0.0f, 0.0f}, 0.01f) );
  503. REQUIRE(bx::isEqual(angle, ax, 0.01f) );
  504. euler = bx::toEuler(quat);
  505. REQUIRE(bx::isEqual(euler.x, ax, 0.001f) );
  506. q2 = bx::fromEuler(euler);
  507. REQUIRE(bx::isEqual(quat, q2, 0.001f) );
  508. }
  509. { // y
  510. quat = bx::rotateY(ay);
  511. bx::mtxFromQuaternion(mtxQ, quat);
  512. bx::mtxRotateY(mtx, ay);
  513. mtxCheck(mtxQ, mtx);
  514. bx::toAxisAngle(axis, angle, quat);
  515. REQUIRE(bx::isEqual(axis, bx::Vec3{0.0f, 1.0f, 0.0f}, 0.01f) );
  516. REQUIRE(bx::isEqual(angle, ay, 0.01f) );
  517. euler = bx::toEuler(quat);
  518. REQUIRE(bx::isEqual(euler.y, ay, 0.001f) );
  519. q2 = bx::fromEuler(euler);
  520. REQUIRE(bx::isEqual(quat, q2, 0.001f) );
  521. }
  522. { // z
  523. quat = bx::rotateZ(az);
  524. bx::mtxFromQuaternion(mtxQ, quat);
  525. bx::mtxRotateZ(mtx, az);
  526. mtxCheck(mtxQ, mtx);
  527. bx::toAxisAngle(axis, angle, quat);
  528. REQUIRE(bx::isEqual(axis, bx::Vec3{0.0f, 0.0f, 1.0f}, 0.01f) );
  529. REQUIRE(bx::isEqual(angle, az, 0.01f) );
  530. euler = bx::toEuler(quat);
  531. REQUIRE(bx::isEqual(euler.z, az, 0.001f) );
  532. q2 = bx::fromEuler(euler);
  533. REQUIRE(bx::isEqual(quat, q2, 0.001f) );
  534. }
  535. }
  536. TEST_CASE("limits", "[math]")
  537. {
  538. STATIC_REQUIRE(bx::LimitsT<int8_t>::min == INT8_MIN);
  539. STATIC_REQUIRE(bx::LimitsT<int8_t>::max == INT8_MAX);
  540. STATIC_REQUIRE(bx::LimitsT<signed char>::min == CHAR_MIN);
  541. STATIC_REQUIRE(bx::LimitsT<signed char>::max == CHAR_MAX);
  542. STATIC_REQUIRE(bx::LimitsT<unsigned char>::min == 0);
  543. STATIC_REQUIRE(bx::LimitsT<unsigned char>::max == UCHAR_MAX);
  544. STATIC_REQUIRE(bx::LimitsT<int16_t>::min == INT16_MIN);
  545. STATIC_REQUIRE(bx::LimitsT<int16_t>::max == INT16_MAX);
  546. STATIC_REQUIRE(bx::LimitsT<uint16_t>::min == 0);
  547. STATIC_REQUIRE(bx::LimitsT<uint16_t>::max == UINT16_MAX);
  548. STATIC_REQUIRE(bx::LimitsT<int32_t>::min == INT32_MIN);
  549. STATIC_REQUIRE(bx::LimitsT<int32_t>::max == INT32_MAX);
  550. STATIC_REQUIRE(bx::LimitsT<uint32_t>::min == 0);
  551. STATIC_REQUIRE(bx::LimitsT<uint32_t>::max == UINT32_MAX);
  552. STATIC_REQUIRE(bx::LimitsT<int64_t>::min == INT64_MIN);
  553. STATIC_REQUIRE(bx::LimitsT<int64_t>::max == INT64_MAX);
  554. STATIC_REQUIRE(bx::LimitsT<uint64_t>::min == 0);
  555. STATIC_REQUIRE(bx::LimitsT<uint64_t>::max == UINT64_MAX);
  556. STATIC_REQUIRE(bx::LimitsT<float>::min == std::numeric_limits<float>::lowest() );
  557. STATIC_REQUIRE(bx::LimitsT<float>::max == std::numeric_limits<float>::max() );
  558. STATIC_REQUIRE(bx::LimitsT<double>::min == std::numeric_limits<double>::lowest() );
  559. STATIC_REQUIRE(bx::LimitsT<double>::max == std::numeric_limits<double>::max() );
  560. }