math_test.cpp 28 KB

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