math_test.cpp 13 KB

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