math_test.cpp 28 KB

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