math_test.cpp 28 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941
  1. /*
  2. * Copyright 2010-2025 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. #if defined(__FAST_MATH__) && __FAST_MATH__
  14. SKIP("This unit test fails with fast math is enabled.");
  15. #endif // !defined(__FAST_MATH__) || !__FAST_MATH__
  16. for (uint64_t ii = 0; ii < UINT32_MAX; ii += rand()%(1<<13)+1)
  17. {
  18. union { uint32_t ui; float f; } u = { uint32_t(ii) };
  19. BX_UNUSED(u);
  20. #if BX_PLATFORM_OSX || BX_PLATFORM_IOS
  21. REQUIRE(::__isnanf(u.f) == bx::isNan(u.f) );
  22. REQUIRE(::__isfinitef(u.f) == bx::isFinite(u.f) );
  23. REQUIRE(::__isinff(u.f) == bx::isInfinite(u.f) );
  24. #elif BX_COMPILER_MSVC
  25. REQUIRE(!!::isnan(u.f) == bx::isNan(u.f) );
  26. REQUIRE(!!::isfinite(u.f) == bx::isFinite(u.f) );
  27. REQUIRE(!!::isinf(u.f) == bx::isInfinite(u.f) );
  28. #elif !BX_CRT_MINGW
  29. REQUIRE(::isnanf(u.f) == bx::isNan(u.f) );
  30. REQUIRE(::finitef(u.f) == bx::isFinite(u.f) );
  31. REQUIRE(::isinff(u.f) == bx::isInfinite(u.f) );
  32. #endif // BX_*
  33. }
  34. }
  35. TEST_CASE("log", "[math][libm]")
  36. {
  37. STATIC_REQUIRE(bx::isEqual( 0.0f, bx::log( 1.0f), 0.0000001f) );
  38. STATIC_REQUIRE(bx::isEqual( 1.0f, bx::log(bx::kE), 0.0000001f) );
  39. STATIC_REQUIRE(bx::isEqual(bx::kLogNat2, bx::log( 2.0f), 0.0000001f) );
  40. }
  41. static void testLog2(float _a)
  42. {
  43. REQUIRE(bx::log2(_a) == bx::log(_a) * (1.0f / bx::log(2.0f) ) );
  44. }
  45. TEST_CASE("log2", "[math][libm]")
  46. {
  47. testLog2(0.0f);
  48. testLog2(256.0f);
  49. STATIC_REQUIRE(bx::isEqual(0.0f, bx::log2( 1.0f), 0.0000001f) );
  50. STATIC_REQUIRE(bx::isEqual(1.0f, bx::log2( 2.0f), 0.0000001f) );
  51. STATIC_REQUIRE(bx::isEqual(2.0f, bx::log2( 4.0f), 0.0000001f) );
  52. STATIC_REQUIRE(bx::isEqual(3.0f, bx::log2( 8.0f), 0.0000001f) );
  53. STATIC_REQUIRE(bx::isEqual(4.0f, bx::log2( 16.0f), 0.0000001f) );
  54. STATIC_REQUIRE(bx::isEqual(5.0f, bx::log2( 32.0f), 0.0000001f) );
  55. STATIC_REQUIRE(bx::isEqual(6.0f, bx::log2( 64.0f), 0.0000001f) );
  56. STATIC_REQUIRE(bx::isEqual(7.0f, bx::log2(128.0f), 0.0000001f) );
  57. STATIC_REQUIRE(bx::isEqual(8.0f, bx::log2(256.0f), 0.0000001f) );
  58. }
  59. TEST_CASE("ceilLog2", "[math]")
  60. {
  61. STATIC_REQUIRE(0 == bx::ceilLog2(-1) );
  62. STATIC_REQUIRE(0 == bx::ceilLog2(0) );
  63. STATIC_REQUIRE(0 == bx::ceilLog2(1) );
  64. STATIC_REQUIRE(1 == bx::ceilLog2(2) );
  65. STATIC_REQUIRE(2 == bx::ceilLog2(4) );
  66. STATIC_REQUIRE(3 == bx::ceilLog2(8) );
  67. STATIC_REQUIRE(4 == bx::ceilLog2(16) );
  68. STATIC_REQUIRE(5 == bx::ceilLog2(32) );
  69. STATIC_REQUIRE(6 == bx::ceilLog2(64) );
  70. STATIC_REQUIRE(7 == bx::ceilLog2(128) );
  71. STATIC_REQUIRE(8 == bx::ceilLog2(256) );
  72. {
  73. uint32_t ii = 0;
  74. for (; ii < 8; ++ii)
  75. {
  76. REQUIRE(ii == bx::ceilLog2(uint8_t(1<<ii) ) );
  77. REQUIRE(ii == bx::ceilLog2(uint16_t(1<<ii) ) );
  78. REQUIRE(ii == bx::ceilLog2(uint32_t(1<<ii) ) );
  79. REQUIRE(ii == bx::ceilLog2(uint64_t(1ull<<ii) ) );
  80. }
  81. for (; ii < 16; ++ii)
  82. {
  83. REQUIRE(ii == bx::ceilLog2(uint16_t(1<<ii) ) );
  84. REQUIRE(ii == bx::ceilLog2(uint32_t(1<<ii) ) );
  85. REQUIRE(ii == bx::ceilLog2(uint64_t(1ull<<ii) ) );
  86. }
  87. for (; ii < 32; ++ii)
  88. {
  89. REQUIRE(ii == bx::ceilLog2(uint32_t(1<<ii) ) );
  90. REQUIRE(ii == bx::ceilLog2(uint64_t(1ull<<ii) ) );
  91. }
  92. for (; ii < 64; ++ii)
  93. {
  94. REQUIRE(ii == bx::ceilLog2(uint64_t(1ull<<ii) ) );
  95. }
  96. }
  97. for (uint32_t ii = 1; ii < INT32_MAX; ii += rand()%(1<<13)+1)
  98. {
  99. REQUIRE(bx::nextPow2(ii) == bx::uint32_nextpow2(ii) );
  100. }
  101. }
  102. TEST_CASE("floorLog2", "[math]")
  103. {
  104. STATIC_REQUIRE(0 == bx::floorLog2(-1) );
  105. STATIC_REQUIRE(0 == bx::floorLog2(0) );
  106. STATIC_REQUIRE(0 == bx::floorLog2(1) );
  107. STATIC_REQUIRE(1 == bx::floorLog2(2) );
  108. STATIC_REQUIRE(2 == bx::floorLog2(4) );
  109. STATIC_REQUIRE(3 == bx::floorLog2(8) );
  110. STATIC_REQUIRE(4 == bx::floorLog2(16) );
  111. STATIC_REQUIRE(5 == bx::floorLog2(32) );
  112. STATIC_REQUIRE(6 == bx::floorLog2(64) );
  113. STATIC_REQUIRE(7 == bx::floorLog2(128) );
  114. STATIC_REQUIRE(8 == bx::floorLog2(256) );
  115. {
  116. uint32_t ii = 0;
  117. for (; ii < 8; ++ii)
  118. {
  119. REQUIRE(ii == bx::floorLog2(uint8_t(1<<ii) ) );
  120. REQUIRE(ii == bx::floorLog2(uint16_t(1<<ii) ) );
  121. REQUIRE(ii == bx::floorLog2(uint32_t(1<<ii) ) );
  122. REQUIRE(ii == bx::floorLog2(uint64_t(1ull<<ii) ) );
  123. }
  124. for (; ii < 16; ++ii)
  125. {
  126. REQUIRE(ii == bx::floorLog2(uint16_t(1<<ii) ) );
  127. REQUIRE(ii == bx::floorLog2(uint32_t(1<<ii) ) );
  128. REQUIRE(ii == bx::floorLog2(uint64_t(1ull<<ii) ) );
  129. }
  130. for (; ii < 32; ++ii)
  131. {
  132. REQUIRE(ii == bx::floorLog2(uint32_t(1<<ii) ) );
  133. REQUIRE(ii == bx::floorLog2(uint64_t(1ull<<ii) ) );
  134. }
  135. for (; ii < 64; ++ii)
  136. {
  137. REQUIRE(ii == bx::floorLog2(uint64_t(1ull<<ii) ) );
  138. }
  139. }
  140. }
  141. TEST_CASE("ceilLog2 & floorLog2", "[math]")
  142. {
  143. {
  144. uint32_t prev = 0;
  145. uint32_t next = 0;
  146. for (uint32_t ii = 0; ii < (1<<18); ++ii)
  147. {
  148. if (bx::isPowerOf2(ii) )
  149. {
  150. REQUIRE(bx::ceilLog2(ii) == bx::floorLog2(ii) );
  151. prev = next;
  152. ++next;
  153. }
  154. else
  155. {
  156. REQUIRE(prev == bx::floorLog2(ii) );
  157. REQUIRE(next == bx::ceilLog2(ii) );
  158. }
  159. }
  160. }
  161. }
  162. TEST_CASE("countTrailingZeros", "[math]")
  163. {
  164. STATIC_REQUIRE( 0 == bx::countTrailingZeros<uint8_t >(1) );
  165. STATIC_REQUIRE( 7 == bx::countTrailingZeros<uint8_t >(1<<7) );
  166. STATIC_REQUIRE( 8 == bx::countTrailingZeros<uint8_t >(0) );
  167. STATIC_REQUIRE( 1 == bx::countTrailingZeros<uint8_t >(0x3e) );
  168. STATIC_REQUIRE( 0 == bx::countTrailingZeros<uint16_t>(1) );
  169. STATIC_REQUIRE(15 == bx::countTrailingZeros<uint16_t>(1<<15) );
  170. STATIC_REQUIRE(16 == bx::countTrailingZeros<uint16_t>(0) );
  171. STATIC_REQUIRE( 0 == bx::countTrailingZeros<uint32_t>(1) );
  172. STATIC_REQUIRE(32 == bx::countTrailingZeros<uint32_t>(0) );
  173. STATIC_REQUIRE(31 == bx::countTrailingZeros<uint32_t>(1u<<31) );
  174. STATIC_REQUIRE( 0 == bx::countTrailingZeros<uint64_t>(1) );
  175. STATIC_REQUIRE(64 == bx::countTrailingZeros<uint64_t>(0) );
  176. }
  177. TEST_CASE("countLeadingZeros", "[math]")
  178. {
  179. STATIC_REQUIRE( 7 == bx::countLeadingZeros<uint8_t >(1) );
  180. STATIC_REQUIRE( 8 == bx::countLeadingZeros<uint8_t >(0) );
  181. STATIC_REQUIRE( 2 == bx::countLeadingZeros<uint8_t >(0x3e) );
  182. STATIC_REQUIRE(15 == bx::countLeadingZeros<uint16_t>(1) );
  183. STATIC_REQUIRE(16 == bx::countLeadingZeros<uint16_t>(0) );
  184. STATIC_REQUIRE(31 == bx::countLeadingZeros<uint32_t>(1) );
  185. STATIC_REQUIRE(32 == bx::countLeadingZeros<uint32_t>(0) );
  186. STATIC_REQUIRE(63 == bx::countLeadingZeros<uint64_t>(1) );
  187. STATIC_REQUIRE(64 == bx::countLeadingZeros<uint64_t>(0) );
  188. }
  189. TEST_CASE("countBits", "[math]")
  190. {
  191. STATIC_REQUIRE( 0 == bx::countBits(0) );
  192. STATIC_REQUIRE( 1 == bx::countBits(1) );
  193. STATIC_REQUIRE( 4 == bx::countBits<uint8_t>(0x55) );
  194. STATIC_REQUIRE( 8 == bx::countBits<uint16_t>(0x5555) );
  195. STATIC_REQUIRE(16 == bx::countBits<uint32_t>(0x55555555) );
  196. STATIC_REQUIRE(32 == bx::countBits<uint64_t>(0x5555555555555555ull) );
  197. STATIC_REQUIRE( 8 == bx::countBits(UINT8_MAX) );
  198. STATIC_REQUIRE(16 == bx::countBits(UINT16_MAX) );
  199. STATIC_REQUIRE(32 == bx::countBits(UINT32_MAX) );
  200. STATIC_REQUIRE(64 == bx::countBits(UINT64_MAX) );
  201. }
  202. template<typename Ty>
  203. static void testFindFirstSet()
  204. {
  205. for (uint8_t ii = 0, num = sizeof(Ty)*8; ii < num; ++ii)
  206. {
  207. {
  208. const Ty val = Ty(1) << ii;
  209. const uint8_t result = bx::findFirstSet<Ty>(val);
  210. REQUIRE(result == ii + 1);
  211. }
  212. {
  213. const Ty val = ( (Ty(1) << ii) ) | (Ty(1) << (num - 1) );
  214. const uint8_t result = bx::findFirstSet<Ty>(val);
  215. REQUIRE(result == ii + 1);
  216. }
  217. }
  218. }
  219. TEST_CASE("findFirstSet", "[math]")
  220. {
  221. STATIC_REQUIRE( 1 == bx::findFirstSet<uint8_t >(1) );
  222. STATIC_REQUIRE( 8 == bx::findFirstSet<uint8_t >(1<<7) );
  223. STATIC_REQUIRE( 0 == bx::findFirstSet<uint8_t >(0) );
  224. STATIC_REQUIRE( 2 == bx::findFirstSet<uint8_t >(0x3e) );
  225. STATIC_REQUIRE( 1 == bx::findFirstSet<uint16_t>(1) );
  226. STATIC_REQUIRE(16 == bx::findFirstSet<uint16_t>(1<<15) );
  227. STATIC_REQUIRE( 0 == bx::findFirstSet<uint16_t>(0) );
  228. STATIC_REQUIRE( 1 == bx::findFirstSet<uint32_t>(1) );
  229. STATIC_REQUIRE( 0 == bx::findFirstSet<uint32_t>(0) );
  230. STATIC_REQUIRE(32 == bx::findFirstSet<uint32_t>(1u<<31) );
  231. STATIC_REQUIRE( 1 == bx::findFirstSet<uint64_t>(1) );
  232. STATIC_REQUIRE( 0 == bx::findFirstSet<uint64_t>(0) );
  233. STATIC_REQUIRE(64 == bx::findFirstSet<uint64_t>(0x8000000000000000ull) );
  234. STATIC_REQUIRE( 1 == bx::findFirstSet<uint64_t>(0x8000000000000001ull) );
  235. testFindFirstSet<uint8_t>();
  236. testFindFirstSet<uint16_t>();
  237. testFindFirstSet<uint32_t>();
  238. testFindFirstSet<uint64_t>();
  239. }
  240. template<typename Ty>
  241. static void testFindLastSet()
  242. {
  243. for (uint8_t ii = 0, num = sizeof(Ty)*8; ii < num; ++ii)
  244. {
  245. {
  246. const Ty val = Ty(1) << ii;
  247. const uint8_t result = bx::findLastSet<Ty>(val);
  248. REQUIRE(result == ii + 1);
  249. }
  250. {
  251. const Ty val = (Ty(1) << ii) - 1;
  252. const uint8_t result = bx::findLastSet<Ty>(val);
  253. REQUIRE(result == ii);
  254. }
  255. }
  256. }
  257. TEST_CASE("findLastSet", "[math]")
  258. {
  259. STATIC_REQUIRE( 1 == bx::findLastSet<uint8_t >(1) );
  260. STATIC_REQUIRE( 8 == bx::findLastSet<uint8_t >(1<<7) );
  261. STATIC_REQUIRE( 0 == bx::findLastSet<uint8_t >(0) );
  262. STATIC_REQUIRE( 6 == bx::findLastSet<uint8_t >(0x3e) );
  263. STATIC_REQUIRE( 1 == bx::findLastSet<uint16_t>(1) );
  264. STATIC_REQUIRE(16 == bx::findLastSet<uint16_t>(1<<15) );
  265. STATIC_REQUIRE( 0 == bx::findLastSet<uint16_t>(0) );
  266. STATIC_REQUIRE( 1 == bx::findLastSet<uint32_t>(1) );
  267. STATIC_REQUIRE( 0 == bx::findLastSet<uint32_t>(0) );
  268. STATIC_REQUIRE(32 == bx::findLastSet<uint32_t>(1u<<31) );
  269. STATIC_REQUIRE( 1 == bx::findLastSet<uint64_t>(1) );
  270. STATIC_REQUIRE( 0 == bx::findLastSet<uint64_t>(0) );
  271. STATIC_REQUIRE( 1 == bx::findLastSet<uint64_t>(1ull) );
  272. STATIC_REQUIRE(64 == bx::findLastSet<uint64_t>(0x8000000000000000ull) );
  273. STATIC_REQUIRE(64 == bx::findLastSet<uint64_t>(0x8000000000000001ull) );
  274. testFindLastSet<uint8_t>();
  275. testFindLastSet<uint16_t>();
  276. testFindLastSet<uint32_t>();
  277. testFindLastSet<uint64_t>();
  278. }
  279. BX_PRAGMA_DIAGNOSTIC_PUSH();
  280. BX_PRAGMA_DIAGNOSTIC_IGNORED_MSVC(4723) // potential divide by 0
  281. TEST_CASE("rcp", "[math][libm]")
  282. {
  283. STATIC_REQUIRE(1.0f == bx::rcp(1.0f) );
  284. STATIC_REQUIRE(2.0f == bx::rcp(0.5f) );
  285. }
  286. TEST_CASE("rcpSafe", "[math][libm]")
  287. {
  288. STATIC_REQUIRE(1.0f == bx::rcpSafe(1.0f) );
  289. STATIC_REQUIRE(2.0f == bx::rcpSafe(0.5f) );
  290. STATIC_REQUIRE(bx::isFinite(bx::rcpSafe( 0.0f) ) );
  291. STATIC_REQUIRE(bx::isFinite(bx::rcpSafe(-0.0f) ) );
  292. }
  293. TEST_CASE("rsqrt", "[math][libm]")
  294. {
  295. bx::WriterI* writer = bx::getNullOut();
  296. bx::Error err;
  297. // rsqrtRef
  298. STATIC_REQUIRE(bx::isInfinite(bx::rsqrtRef(0.0f) ) );
  299. for (float xx = bx::kNearZero; xx < 100.0f; xx += 0.1f)
  300. {
  301. bx::write(writer, &err, "rsqrtRef(%f) == %f (expected: %f)\n", xx, bx::rsqrtRef(xx), 1.0f / ::sqrtf(xx) );
  302. REQUIRE(err.isOk() );
  303. REQUIRE(bx::isEqual(bx::rsqrtRef(xx), 1.0f / ::sqrtf(xx), 0.00001f) );
  304. }
  305. // rsqrtSimd
  306. #if !defined(__FAST_MATH__) || !__FAST_MATH__
  307. REQUIRE(bx::isInfinite(bx::rsqrtSimd(0.0f) ) );
  308. #endif // !defined(__FAST_MATH__) || !__FAST_MATH__
  309. for (float xx = bx::kNearZero; xx < 100.0f; xx += 0.1f)
  310. {
  311. bx::write(writer, &err, "rsqrtSimd(%f) == %f (expected: %f)\n", xx, bx::rsqrtSimd(xx), 1.0f / ::sqrtf(xx) );
  312. REQUIRE(err.isOk() );
  313. REQUIRE(bx::isEqual(bx::rsqrtSimd(xx), 1.0f / ::sqrtf(xx), 0.00001f) );
  314. }
  315. // rsqrt
  316. #if !defined(__FAST_MATH__) || !__FAST_MATH__
  317. REQUIRE(bx::isInfinite(1.0f / ::sqrtf(0.0f) ) );
  318. REQUIRE(bx::isInfinite(bx::rsqrt(0.0f) ) );
  319. #endif // !defined(__FAST_MATH__) || !__FAST_MATH__
  320. for (float xx = bx::kNearZero; xx < 100.0f; xx += 0.1f)
  321. {
  322. bx::write(writer, &err, "rsqrt(%f) == %f (expected: %f)\n", xx, bx::rsqrt(xx), 1.0f / ::sqrtf(xx) );
  323. REQUIRE(err.isOk() );
  324. REQUIRE(bx::isEqual(bx::rsqrt(xx), 1.0f / ::sqrtf(xx), 0.00001f) );
  325. }
  326. }
  327. TEST_CASE("sqrt", "[math][libm]")
  328. {
  329. bx::WriterI* writer = bx::getNullOut();
  330. bx::Error err;
  331. // sqrtRef
  332. STATIC_REQUIRE(bx::isNan(bx::sqrtRef(-1.0f) ) );
  333. REQUIRE(bx::isEqual(bx::sqrtRef(0.0f), ::sqrtf(0.0f), 0.0f) );
  334. REQUIRE(bx::isEqual(bx::sqrtRef(1.0f), ::sqrtf(1.0f), 0.0f) );
  335. for (float xx = 0.0f; xx < 1000000.0f; xx += 1000.f)
  336. {
  337. bx::write(writer, &err, "sqrtRef(%f) == %f (expected: %f)\n", xx, bx::sqrtRef(xx), ::sqrtf(xx) );
  338. REQUIRE(err.isOk() );
  339. REQUIRE(bx::isEqual(bx::sqrtRef(xx), ::sqrtf(xx), 0.00001f) );
  340. }
  341. // sqrtSimd
  342. REQUIRE(bx::isNan(bx::sqrtSimd(-1.0f) ) );
  343. REQUIRE(bx::isEqual(bx::sqrtSimd(0.0f), ::sqrtf(0.0f), 0.00001f) );
  344. REQUIRE(bx::isEqual(bx::sqrtSimd(1.0f), ::sqrtf(1.0f), 0.00001f) );
  345. for (float xx = 0.0f; xx < 1000000.0f; xx += 1000.f)
  346. {
  347. bx::write(writer, &err, "sqrtSimd(%f) == %f (expected: %f)\n", xx, bx::sqrtSimd(xx), ::sqrtf(xx) );
  348. REQUIRE(err.isOk() );
  349. REQUIRE(bx::isEqual(bx::sqrtSimd(xx), ::sqrtf(xx), 0.00001f) );
  350. }
  351. for (float xx = 0.0f; xx < 100.0f; xx += 0.1f)
  352. {
  353. bx::write(writer, &err, "sqrt(%f) == %f (expected: %f)\n", xx, bx::sqrt(xx), ::sqrtf(xx) );
  354. REQUIRE(err.isOk() );
  355. REQUIRE(bx::isEqual(bx::sqrt(xx), ::sqrtf(xx), 0.00001f) );
  356. }
  357. // sqrt
  358. REQUIRE(bx::isNan(::sqrtf(-1.0f) ) );
  359. REQUIRE(bx::isNan(bx::sqrt(-1.0f) ) );
  360. REQUIRE(bx::isEqual(bx::sqrt(0.0f), ::sqrtf(0.0f), 0.00001f) );
  361. REQUIRE(bx::isEqual(bx::sqrt(1.0f), ::sqrtf(1.0f), 0.00001f) );
  362. for (float xx = 0.0f; xx < 1000000.0f; xx += 1000.f)
  363. {
  364. bx::write(writer, &err, "sqrt(%f) == %f (expected: %f)\n", xx, bx::sqrt(xx), ::sqrtf(xx) );
  365. REQUIRE(err.isOk() );
  366. REQUIRE(bx::isEqual(bx::sqrt(xx), ::sqrtf(xx), 0.00001f) );
  367. }
  368. for (float xx = 0.0f; xx < 100.0f; xx += 0.1f)
  369. {
  370. bx::write(writer, &err, "sqrt(%f) == %f (expected: %f)\n", xx, bx::sqrt(xx), ::sqrtf(xx) );
  371. REQUIRE(err.isOk() );
  372. REQUIRE(bx::isEqual(bx::sqrt(xx), ::sqrtf(xx), 0.00001f) );
  373. }
  374. }
  375. BX_PRAGMA_DIAGNOSTIC_POP();
  376. TEST_CASE("abs", "[math][libm]")
  377. {
  378. STATIC_REQUIRE(1389.0f == bx::abs(-1389.0f) );
  379. STATIC_REQUIRE(1389.0f == bx::abs( 1389.0f) );
  380. STATIC_REQUIRE( 0.0f == bx::abs(-0.0f) );
  381. STATIC_REQUIRE( 0.0f == bx::abs( 0.0f) );
  382. }
  383. TEST_CASE("mod", "[math][libm]")
  384. {
  385. STATIC_REQUIRE(389.0f == bx::mod(1389.0f, 1000.0f) );
  386. STATIC_REQUIRE( 89.0f == bx::mod(1389.0f, 100.0f) );
  387. STATIC_REQUIRE( 9.0f == bx::mod(1389.0f, 10.0f) );
  388. STATIC_REQUIRE( 4.0f == bx::mod(1389.0f, 5.0f) );
  389. STATIC_REQUIRE( 1.0f == bx::mod(1389.0f, 2.0f) );
  390. }
  391. typedef float (*MathFloatFn)(float);
  392. template<MathFloatFn BxT, MathFloatFn CrtT>
  393. static void testMathFunc1Float(float _value)
  394. {
  395. REQUIRE(CrtT(_value) == BxT(_value) );
  396. }
  397. TEST_CASE("floor", "[math][libm]")
  398. {
  399. STATIC_REQUIRE( 13.0f == bx::floor( 13.89f) );
  400. STATIC_REQUIRE(-14.0f == bx::floor(-13.89f) );
  401. testMathFunc1Float<bx::floor, ::floorf>( 13.89f);
  402. testMathFunc1Float<bx::floor, ::floorf>(-13.89f);
  403. }
  404. TEST_CASE("ceil", "[math][libm]")
  405. {
  406. STATIC_REQUIRE( 14.0f == bx::ceil( 13.89f) );
  407. STATIC_REQUIRE(-13.0f == bx::ceil( -13.89f) );
  408. testMathFunc1Float<bx::ceil, ::ceilf>( 13.89f);
  409. testMathFunc1Float<bx::ceil, ::ceilf>(-13.89f);
  410. }
  411. TEST_CASE("round", "[math][libm]")
  412. {
  413. STATIC_REQUIRE( 14.0f == bx::round( 13.89f) );
  414. STATIC_REQUIRE(-14.0f == bx::round( -13.89f) );
  415. testMathFunc1Float<bx::round, ::roundf>( 13.89f);
  416. testMathFunc1Float<bx::round, ::roundf>(-13.89f);
  417. }
  418. TEST_CASE("trunc", "[math][libm]")
  419. {
  420. STATIC_REQUIRE( 13.0f == bx::trunc( 13.89f) );
  421. STATIC_REQUIRE(-13.0f == bx::trunc(-13.89f) );
  422. testMathFunc1Float<bx::trunc, ::truncf>( 13.89f);
  423. testMathFunc1Float<bx::trunc, ::truncf>(-13.89f);
  424. }
  425. TEST_CASE("fract", "[math][libm]")
  426. {
  427. STATIC_REQUIRE(bx::isEqual( 0.89f, bx::fract( 13.89f), 0.000001f) );
  428. STATIC_REQUIRE(bx::isEqual(-0.89f, bx::fract(-13.89f), 0.000001f) );
  429. }
  430. TEST_CASE("ldexp", "[math][libm]")
  431. {
  432. STATIC_REQUIRE( 1389.0f == bx::ldexp(86.8125, 4) );
  433. STATIC_REQUIRE(0.437500f == bx::ldexp(7.0f, -4) );
  434. STATIC_REQUIRE(bx::isEqual(-0.0f, bx::ldexp(-0.0f, 10), 0.000000001f) );
  435. STATIC_REQUIRE(0x1p127f == bx::ldexp(1.0f, 127) );
  436. STATIC_REQUIRE(0x1p-126f == bx::ldexp(1.0f, -126) );
  437. STATIC_REQUIRE(0x1p24f == bx::ldexp(1.0f, 24) );
  438. bx::WriterI* writer = bx::getNullOut();
  439. bx::Error err;
  440. for (int32_t yy = -10; yy < 10; ++yy)
  441. {
  442. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  443. {
  444. bx::write(writer, &err, "ldexp(%f, %d) == %f (expected: %f)\n", xx, yy, bx::ldexp(xx, yy), ::ldexpf(xx, yy) );
  445. REQUIRE(bx::isEqual(bx::ldexp(xx, yy), ::ldexpf(xx, yy), 0.00001f) );
  446. }
  447. }
  448. }
  449. TEST_CASE("exp", "[math][libm]")
  450. {
  451. STATIC_REQUIRE( 1.0f == bx::exp(-0.0f) );
  452. STATIC_REQUIRE( 0.0f == bx::exp(-bx::kFloatInfinity) );
  453. STATIC_REQUIRE( 0.0f == bx::exp(bx::log(bx::kFloatSmallest) ) );
  454. bx::WriterI* writer = bx::getNullOut();
  455. bx::Error err;
  456. for (float xx = -80.0f; xx < 80.0f; xx += 0.1f)
  457. {
  458. bx::write(writer, &err, "exp(%f) == %f (expected: %f)\n", xx, bx::exp(xx), ::expf(xx) );
  459. REQUIRE(err.isOk() );
  460. REQUIRE(bx::isEqual(bx::exp(xx), ::expf(xx), 0.00001f) );
  461. }
  462. }
  463. TEST_CASE("pow", "[math][libm]")
  464. {
  465. STATIC_REQUIRE(1.0f == bx::pow(0.0f, 0.0f) );
  466. STATIC_REQUIRE(1.0f == bx::pow(1.0f, 0.0f) );
  467. STATIC_REQUIRE(1.0f == bx::pow(3.0f, 0.0f) );
  468. STATIC_REQUIRE(1.0f == bx::pow(8.0f, 0.0f) );
  469. STATIC_REQUIRE(1.0f == bx::pow(9.0f, 0.0f) );
  470. STATIC_REQUIRE(0.0f == bx::pow(0.0f, 2.0f) );
  471. STATIC_REQUIRE( 4.0f == bx::pow( 2.0f, 2.0f) );
  472. STATIC_REQUIRE( -4.0f == bx::pow(-2.0f, 2.0f) );
  473. STATIC_REQUIRE( 0.25f == bx::pow( 2.0f, -2.0f) );
  474. STATIC_REQUIRE( -0.25f == bx::pow(-2.0f, -2.0f) );
  475. STATIC_REQUIRE( 8.0f == bx::pow( 2.0f, 3.0f) );
  476. STATIC_REQUIRE( -8.0f == bx::pow(-2.0f, 3.0f) );
  477. STATIC_REQUIRE( 0.125f == bx::pow( 2.0f, -3.0f) );
  478. STATIC_REQUIRE(-0.125f == bx::pow(-2.0f, -3.0f) );
  479. bx::WriterI* writer = bx::getNullOut();
  480. bx::Error err;
  481. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  482. {
  483. bx::write(writer, &err, "pow(1.389f, %f) == %f (expected: %f)\n", xx, bx::pow(1.389f, xx), ::powf(1.389f, xx) );
  484. REQUIRE(err.isOk() );
  485. REQUIRE(bx::isEqual(bx::pow(1.389f, xx), ::powf(1.389f, xx), 0.00001f) );
  486. }
  487. }
  488. TEST_CASE("asin", "[math][libm]")
  489. {
  490. STATIC_REQUIRE(bx::isEqual( 0.0f, bx::asin(0.0f), 0.0001f) );
  491. STATIC_REQUIRE(bx::isEqual(bx::kPiHalf, bx::asin(1.0f), 0.0001f) );
  492. bx::WriterI* writer = bx::getNullOut();
  493. bx::Error err;
  494. for (float xx = -1.0f; xx < 1.0f; xx += 0.001f)
  495. {
  496. bx::write(writer, &err, "asin(%f) == %f (expected: %f)\n", xx, bx::asin(xx), ::asinf(xx) );
  497. REQUIRE(err.isOk() );
  498. REQUIRE(bx::isEqual(bx::asin(xx), ::asinf(xx), 0.0001f) );
  499. }
  500. }
  501. TEST_CASE("sin", "[math][libm]")
  502. {
  503. STATIC_REQUIRE(bx::isEqual( 0.0f, bx::sin(0.0f ), 0.0000001f) );
  504. STATIC_REQUIRE(bx::isEqual( 1.0f, bx::sin(bx::kPiHalf ), 0.0000001f) );
  505. STATIC_REQUIRE(bx::isEqual( 0.0f, bx::sin(bx::kPi ), 0.0000001f) );
  506. STATIC_REQUIRE(bx::isEqual(-1.0f, bx::sin(bx::kPiHalf*3.0f), 0.0000001f) );
  507. bx::WriterI* writer = bx::getNullOut();
  508. bx::Error err;
  509. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  510. {
  511. bx::write(writer, &err, "sin(%f) == %f (expected: %f)\n", xx, bx::sin(xx), ::sinf(xx) );
  512. REQUIRE(err.isOk() );
  513. REQUIRE(bx::isEqual(bx::sin(xx), ::sinf(xx), 0.00001f) );
  514. }
  515. for (float xx = -bx::kPi2; xx < bx::kPi2; xx += 0.0001f)
  516. {
  517. bx::write(writer, &err, "sin(%f) == %f (expected: %f)\n", xx, bx::sin(xx), ::sinf(xx) );
  518. REQUIRE(err.isOk() );
  519. REQUIRE(bx::isEqual(bx::sin(xx), ::sinf(xx), 0.00001f) );
  520. }
  521. }
  522. TEST_CASE("sinCos", "[math][libm]")
  523. {
  524. bx::WriterI* writer = bx::getNullOut();
  525. bx::Error err;
  526. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  527. {
  528. float ss, cc;
  529. bx::sinCosApprox(ss, cc, xx);
  530. bx::write(writer, &err, "sinCos(%f) == sin %f (expected: %f)\n", xx, ss, ::sinf(xx) );
  531. bx::write(writer, &err, "sinCos(%f) == cos %f (expected: %f)\n", xx, cc, ::cosf(xx) );
  532. REQUIRE(err.isOk() );
  533. REQUIRE(bx::isEqual(ss, ::sinf(xx), 0.001f) );
  534. REQUIRE(bx::isEqual(cc, ::cosf(xx), 0.00001f) );
  535. }
  536. for (float xx = -bx::kPi2; xx < bx::kPi2; xx += 0.0001f)
  537. {
  538. float ss, cc;
  539. bx::sinCosApprox(ss, cc, xx);
  540. bx::write(writer, &err, "sinCos(%f) == sin %f (expected: %f)\n", xx, ss, ::sinf(xx) );
  541. bx::write(writer, &err, "sinCos(%f) == cos %f (expected: %f)\n", xx, cc, ::cosf(xx) );
  542. REQUIRE(err.isOk() );
  543. REQUIRE(bx::isEqual(ss, ::sinf(xx), 0.001f) );
  544. REQUIRE(bx::isEqual(cc, ::cosf(xx), 0.00001f) );
  545. }
  546. }
  547. TEST_CASE("sinh", "[math][libm]")
  548. {
  549. bx::WriterI* writer = bx::getNullOut();
  550. bx::Error err;
  551. for (float xx = -1.0f; xx < 1.0f; xx += 0.1f)
  552. {
  553. bx::write(writer, &err, "sinh(%f) == %f (expected: %f)\n", xx, bx::sinh(xx), ::sinhf(xx) );
  554. REQUIRE(err.isOk() );
  555. REQUIRE(bx::isEqual(bx::sinh(xx), ::sinhf(xx), 0.00001f) );
  556. }
  557. }
  558. TEST_CASE("acos", "[math][libm]")
  559. {
  560. STATIC_REQUIRE(bx::isEqual(bx::kPiHalf, bx::acos(0.0f), 0.0001f) );
  561. STATIC_REQUIRE(bx::isEqual( 0.0f, bx::acos(1.0f), 0.0001f) );
  562. bx::WriterI* writer = bx::getNullOut();
  563. bx::Error err;
  564. for (float xx = -1.0f; xx < 1.0f; xx += 0.001f)
  565. {
  566. bx::write(writer, &err, "acos(%f) == %f (expected: %f\n)", xx, bx::acos(xx), ::acosf(xx) );
  567. REQUIRE(err.isOk() );
  568. REQUIRE(bx::isEqual(bx::acos(xx), ::acosf(xx), 0.0001f) );
  569. }
  570. }
  571. TEST_CASE("cos", "[math][libm]")
  572. {
  573. STATIC_REQUIRE(bx::isEqual( 1.0f, bx::cos(0.0f ), 0.0000001f) );
  574. STATIC_REQUIRE(bx::isEqual( 0.0f, bx::cos(bx::kPiHalf ), 0.0000001f) );
  575. STATIC_REQUIRE(bx::isEqual(-1.0f, bx::cos(bx::kPi ), 0.0000001f) );
  576. STATIC_REQUIRE(bx::isEqual( 0.0f, bx::cos(bx::kPiHalf*3.0f), 0.0000001f) );
  577. bx::WriterI* writer = bx::getNullOut();
  578. bx::Error err;
  579. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  580. {
  581. bx::write(writer, &err, "cos(%f) == %f (expected: %f)\n", xx, bx::cos(xx), ::cosf(xx) );
  582. REQUIRE(err.isOk() );
  583. REQUIRE(bx::isEqual(bx::cos(xx), ::cosf(xx), 0.00001f) );
  584. }
  585. for (float xx = -bx::kPi2; xx < bx::kPi2; xx += 0.0001f)
  586. {
  587. bx::write(writer, &err, "cos(%f) == %f (expected: %f)\n", xx, bx::cos(xx), ::cosf(xx) );
  588. REQUIRE(err.isOk() );
  589. REQUIRE(bx::isEqual(bx::cos(xx), ::cosf(xx), 0.00001f) );
  590. }
  591. }
  592. TEST_CASE("tan", "[math][libm]")
  593. {
  594. bx::WriterI* writer = bx::getNullOut();
  595. bx::Error err;
  596. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  597. {
  598. bx::write(writer, &err, "tan(%f) == %f (expected: %f)\n", xx, bx::tan(xx), ::tanf(xx) );
  599. REQUIRE(err.isOk() );
  600. REQUIRE(bx::isEqual(bx::tan(xx), ::tanf(xx), 0.001f) );
  601. }
  602. }
  603. TEST_CASE("tanh", "[math][libm]")
  604. {
  605. bx::WriterI* writer = bx::getNullOut();
  606. bx::Error err;
  607. for (float xx = -1.0f; xx < 1.0f; xx += 0.1f)
  608. {
  609. bx::write(writer, &err, "tanh(%f) == %f (expected: %f\n", xx, bx::tanh(xx), ::tanhf(xx) );
  610. REQUIRE(err.isOk() );
  611. REQUIRE(bx::isEqual(bx::tanh(xx), ::tanhf(xx), 0.00001f) );
  612. }
  613. }
  614. TEST_CASE("atan", "[math][libm]")
  615. {
  616. bx::WriterI* writer = bx::getNullOut();
  617. bx::Error err;
  618. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  619. {
  620. bx::write(writer, &err, "atan(%f) == %f (expected: %f)\n", xx, bx::atan(xx), ::atanf(xx) );
  621. REQUIRE(err.isOk() );
  622. REQUIRE(bx::isEqual(bx::atan(xx), ::atanf(xx), 0.00001f) );
  623. }
  624. }
  625. TEST_CASE("atan2", "[math][libm]")
  626. {
  627. bx::WriterI* writer = bx::getNullOut();
  628. bx::Error err;
  629. REQUIRE(bx::isEqual(bx::atan2(0.0f, 0.0f), ::atan2f(0.0f, 0.0f), 0.00001f) );
  630. REQUIRE(bx::isEqual(bx::atan2(0.0f, 1.0f), ::atan2f(0.0f, 1.0f), 0.00001f) );
  631. REQUIRE(bx::isEqual(bx::atan2(0.0f, -1.0f), ::atan2f(0.0f, -1.0f), 0.00001f) );
  632. for (float yy = -100.0f; yy < 100.0f; yy += 0.1f)
  633. {
  634. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  635. {
  636. bx::write(writer, &err, "atan2(%f, %f) == %f (expected: %f)\n", yy, xx, bx::atan2(yy, xx), ::atan2f(yy, xx) );
  637. REQUIRE(err.isOk() );
  638. REQUIRE(bx::isEqual(bx::atan2(yy, xx), ::atan2f(yy, xx), 0.00001f) );
  639. }
  640. }
  641. }
  642. TEST_CASE("sign", "[math][libm]")
  643. {
  644. STATIC_REQUIRE(-1 == bx::sign(-0.1389f) );
  645. STATIC_REQUIRE( 0 == bx::sign( 0.0000f) );
  646. STATIC_REQUIRE( 1 == bx::sign( 0.1389f) );
  647. STATIC_REQUIRE(-1 == bx::sign(-bx::kFloatInfinity) );
  648. STATIC_REQUIRE( 1 == bx::sign( bx::kFloatInfinity) );
  649. }
  650. TEST_CASE("signBit", "[math][libm]")
  651. {
  652. STATIC_REQUIRE( bx::signBit(-0.1389f) );
  653. STATIC_REQUIRE(!bx::signBit( 0.0000f) );
  654. STATIC_REQUIRE(!bx::signBit( 0.1389f) );
  655. STATIC_REQUIRE( bx::signBit(-bx::kFloatInfinity) );
  656. STATIC_REQUIRE(!bx::signBit( bx::kFloatInfinity) );
  657. }
  658. TEST_CASE("copySign", "[math][libm]")
  659. {
  660. STATIC_REQUIRE( 0.1389f == bx::copySign(-0.1389f, +1389) );
  661. STATIC_REQUIRE(-0.0000f == bx::copySign( 0.0000f, -1389) );
  662. STATIC_REQUIRE(-0.1389f == bx::copySign( 0.1389f, -1389) );
  663. STATIC_REQUIRE(-bx::kFloatInfinity == bx::copySign(bx::kFloatInfinity, -1389) );
  664. }
  665. TEST_CASE("bitsToFloat, floatToBits, bitsToDouble, doubleToBits", "[math]")
  666. {
  667. STATIC_REQUIRE(0x12345678u == bx::floatToBits( bx::bitsToFloat (0x12345678u) ) );
  668. STATIC_REQUIRE(0x123456789abcdef0ull == bx::doubleToBits(bx::bitsToDouble(0x123456789abcdef0ull) ) );
  669. }
  670. TEST_CASE("lerp", "[math]")
  671. {
  672. STATIC_REQUIRE(1389.0f == bx::lerp(1389.0f, 1453.0f, 0.0f) );
  673. STATIC_REQUIRE(1453.0f == bx::lerp(1389.0f, 1453.0f, 1.0f) );
  674. STATIC_REQUIRE( 0.5f == bx::lerp( 0.0f, 1.0f, 0.5f) );
  675. STATIC_REQUIRE( 0.0f == bx::lerp( 0.0f, 0.0f, 0.5f) );
  676. }
  677. void mtxCheck(const float* _a, const float* _b)
  678. {
  679. if (!bx::isEqual(_a, _b, 16, 0.01f) )
  680. {
  681. DBG("\n"
  682. "A:\n"
  683. "%10.4f %10.4f %10.4f %10.4f\n"
  684. "%10.4f %10.4f %10.4f %10.4f\n"
  685. "%10.4f %10.4f %10.4f %10.4f\n"
  686. "%10.4f %10.4f %10.4f %10.4f\n"
  687. "B:\n"
  688. "%10.4f %10.4f %10.4f %10.4f\n"
  689. "%10.4f %10.4f %10.4f %10.4f\n"
  690. "%10.4f %10.4f %10.4f %10.4f\n"
  691. "%10.4f %10.4f %10.4f %10.4f\n"
  692. , _a[ 0], _a[ 1], _a[ 2], _a[ 3]
  693. , _a[ 4], _a[ 5], _a[ 6], _a[ 7]
  694. , _a[ 8], _a[ 9], _a[10], _a[11]
  695. , _a[12], _a[13], _a[14], _a[15]
  696. , _b[ 0], _b[ 1], _b[ 2], _b[ 3]
  697. , _b[ 4], _b[ 5], _b[ 6], _b[ 7]
  698. , _b[ 8], _b[ 9], _b[10], _b[11]
  699. , _b[12], _b[13], _b[14], _b[15]
  700. );
  701. REQUIRE(false);
  702. }
  703. }
  704. TEST_CASE("vec3", "[math][vec3]")
  705. {
  706. REQUIRE(bx::isEqual({0.0f, 0.0f, 0.0f}, bx::normalize({0.0f, 0.0f, 0.0f}), 0.0f) );
  707. bx::Vec3 normalized = bx::normalize({0.0f, 1.0f, 0.0f});
  708. REQUIRE(bx::isEqual(normalized, {0.0f, 1.0f, 0.0f}, 0.00001f) );
  709. float length = bx::length(normalized);
  710. REQUIRE(bx::isEqual(length, 1.0f, 0.00001f) );
  711. }
  712. TEST_CASE("quaternion", "[math][quaternion]")
  713. {
  714. float mtxQ[16];
  715. float mtx[16];
  716. bx::Quaternion quat = bx::InitIdentity;
  717. bx::Quaternion q2 = bx::InitNone;
  718. bx::Vec3 axis = bx::InitNone;
  719. bx::Vec3 euler = bx::InitNone;
  720. float angle;
  721. bx::mtxFromQuaternion(mtxQ, quat);
  722. bx::mtxIdentity(mtx);
  723. mtxCheck(mtxQ, mtx);
  724. float ax = bx::kPi/27.0f;
  725. float ay = bx::kPi/13.0f;
  726. float az = bx::kPi/7.0f;
  727. { // x
  728. quat = bx::rotateX(ax);
  729. bx::mtxFromQuaternion(mtxQ, quat);
  730. bx::mtxRotateX(mtx, ax);
  731. mtxCheck(mtxQ, mtx);
  732. bx::toAxisAngle(axis, angle, quat);
  733. REQUIRE(bx::isEqual(axis, bx::Vec3{1.0f, 0.0f, 0.0f}, 0.01f) );
  734. REQUIRE(bx::isEqual(angle, ax, 0.01f) );
  735. euler = bx::toEuler(quat);
  736. REQUIRE(bx::isEqual(euler.x, ax, 0.001f) );
  737. q2 = bx::fromEuler(euler);
  738. REQUIRE(bx::isEqual(quat, q2, 0.001f) );
  739. }
  740. { // y
  741. quat = bx::rotateY(ay);
  742. bx::mtxFromQuaternion(mtxQ, quat);
  743. bx::mtxRotateY(mtx, ay);
  744. mtxCheck(mtxQ, mtx);
  745. bx::toAxisAngle(axis, angle, quat);
  746. REQUIRE(bx::isEqual(axis, bx::Vec3{0.0f, 1.0f, 0.0f}, 0.01f) );
  747. REQUIRE(bx::isEqual(angle, ay, 0.01f) );
  748. euler = bx::toEuler(quat);
  749. REQUIRE(bx::isEqual(euler.y, ay, 0.001f) );
  750. q2 = bx::fromEuler(euler);
  751. REQUIRE(bx::isEqual(quat, q2, 0.001f) );
  752. }
  753. { // z
  754. quat = bx::rotateZ(az);
  755. bx::mtxFromQuaternion(mtxQ, quat);
  756. bx::mtxRotateZ(mtx, az);
  757. mtxCheck(mtxQ, mtx);
  758. bx::toAxisAngle(axis, angle, quat);
  759. REQUIRE(bx::isEqual(axis, bx::Vec3{0.0f, 0.0f, 1.0f}, 0.01f) );
  760. REQUIRE(bx::isEqual(angle, az, 0.01f) );
  761. euler = bx::toEuler(quat);
  762. REQUIRE(bx::isEqual(euler.z, az, 0.001f) );
  763. q2 = bx::fromEuler(euler);
  764. REQUIRE(bx::isEqual(quat, q2, 0.001f) );
  765. }
  766. }
  767. TEST_CASE("limits", "[math]")
  768. {
  769. STATIC_REQUIRE(bx::LimitsT<int8_t>::min == INT8_MIN);
  770. STATIC_REQUIRE(bx::LimitsT<int8_t>::max == INT8_MAX);
  771. STATIC_REQUIRE(bx::LimitsT<signed char>::min == CHAR_MIN);
  772. STATIC_REQUIRE(bx::LimitsT<signed char>::max == CHAR_MAX);
  773. STATIC_REQUIRE(bx::LimitsT<unsigned char>::min == 0);
  774. STATIC_REQUIRE(bx::LimitsT<unsigned char>::max == UCHAR_MAX);
  775. STATIC_REQUIRE(bx::LimitsT<int16_t>::min == INT16_MIN);
  776. STATIC_REQUIRE(bx::LimitsT<int16_t>::max == INT16_MAX);
  777. STATIC_REQUIRE(bx::LimitsT<uint16_t>::min == 0);
  778. STATIC_REQUIRE(bx::LimitsT<uint16_t>::max == UINT16_MAX);
  779. STATIC_REQUIRE(bx::LimitsT<int32_t>::min == INT32_MIN);
  780. STATIC_REQUIRE(bx::LimitsT<int32_t>::max == INT32_MAX);
  781. STATIC_REQUIRE(bx::LimitsT<uint32_t>::min == 0);
  782. STATIC_REQUIRE(bx::LimitsT<uint32_t>::max == UINT32_MAX);
  783. STATIC_REQUIRE(bx::LimitsT<int64_t>::min == INT64_MIN);
  784. STATIC_REQUIRE(bx::LimitsT<int64_t>::max == INT64_MAX);
  785. STATIC_REQUIRE(bx::LimitsT<uint64_t>::min == 0);
  786. STATIC_REQUIRE(bx::LimitsT<uint64_t>::max == UINT64_MAX);
  787. STATIC_REQUIRE(bx::LimitsT<float>::min == std::numeric_limits<float>::lowest() );
  788. STATIC_REQUIRE(bx::LimitsT<float>::max == std::numeric_limits<float>::max() );
  789. STATIC_REQUIRE(bx::LimitsT<double>::min == std::numeric_limits<double>::lowest() );
  790. STATIC_REQUIRE(bx::LimitsT<double>::max == std::numeric_limits<double>::max() );
  791. STATIC_REQUIRE(bx::kFloatSmallest == std::numeric_limits<float>::min() );
  792. STATIC_REQUIRE(bx::kDoubleSmallest == std::numeric_limits<double>::min() );
  793. }