string_test.cpp 23 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758
  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/filepath.h>
  7. #include <bx/string.h>
  8. #include <bx/handlealloc.h>
  9. #include <bx/sort.h>
  10. #include <string>
  11. #include <tinystl/string.h>
  12. bx::AllocatorI* g_allocator;
  13. TEST_CASE("StringLiteral", "[string]")
  14. {
  15. constexpr bx::StringLiteral tmp[] = { "1389", "abvgd", "mac", "pod" };
  16. REQUIRE(bx::isSorted(tmp, BX_COUNTOF(tmp) ) );
  17. STATIC_REQUIRE(4 == tmp[0].getLength() );
  18. REQUIRE(4 == bx::strLen(tmp[0]) );
  19. REQUIRE(0 == bx::strCmp("1389", tmp[0]) );
  20. STATIC_REQUIRE(5 == tmp[1].getLength() );
  21. REQUIRE(5 == bx::strLen(tmp[1]) );
  22. REQUIRE(0 == bx::strCmp("abvgd", tmp[1]) );
  23. STATIC_REQUIRE(3 == tmp[2].getLength() );
  24. REQUIRE(3 == bx::strLen(tmp[2]) );
  25. REQUIRE(0 == bx::strCmp("mac", tmp[2]) );
  26. STATIC_REQUIRE(3 == tmp[3].getLength() );
  27. REQUIRE(3 == bx::strLen(tmp[3]) );
  28. REQUIRE(0 == bx::strCmp("pod", tmp[3]) );
  29. constexpr bx::StringLiteral copy(tmp[0]);
  30. STATIC_REQUIRE(4 == copy.getLength() );
  31. REQUIRE(4 == bx::strLen(copy) );
  32. REQUIRE(0 == bx::strCmp("1389", copy) );
  33. constexpr bx::StringView sv(tmp[1]);
  34. REQUIRE(5 == sv.getLength() );
  35. REQUIRE(5 == bx::strLen(sv) );
  36. REQUIRE("abvgd" == sv);
  37. }
  38. TEST_CASE("stringPrintfTy", "[string]")
  39. {
  40. std::string test;
  41. bx::stringPrintf(test, "printf into std::string.");
  42. REQUIRE(0 == bx::strCmp(bx::StringView(test.data(), int32_t(test.length() ) ), "printf into std::string.") );
  43. }
  44. TEST_CASE("prettify", "[string]")
  45. {
  46. char tmp[1024];
  47. prettify(tmp, BX_COUNTOF(tmp), 4000, bx::Units::Kilo);
  48. REQUIRE(0 == bx::strCmp(tmp, "4.00 kB") );
  49. prettify(tmp, BX_COUNTOF(tmp), 4096, bx::Units::Kibi);
  50. REQUIRE(0 == bx::strCmp(tmp, "4.00 KiB") );
  51. }
  52. TEST_CASE("chars", "[string]")
  53. {
  54. for (char ch = 'A'; ch <= 'Z'; ++ch)
  55. {
  56. REQUIRE(!bx::isLower(ch) );
  57. REQUIRE(!bx::isNumeric(ch) );
  58. REQUIRE(bx::isUpper(ch) );
  59. REQUIRE(bx::isAlpha(ch) );
  60. REQUIRE(bx::isAlphaNum(ch) );
  61. REQUIRE(bx::isLower(bx::toLower(ch) ) );
  62. }
  63. }
  64. TEST_CASE("strLen", "[string]")
  65. {
  66. const char* test = "test";
  67. REQUIRE(0 == bx::strLen(test, 0) );
  68. REQUIRE(2 == bx::strLen(test, 2) );
  69. REQUIRE(4 == bx::strLen(test, INT32_MAX) );
  70. }
  71. TEST_CASE("strCopy", "[string]")
  72. {
  73. char dst[128];
  74. size_t num;
  75. num = bx::strCopy(dst, 1, "blah");
  76. REQUIRE(num == 0);
  77. num = bx::strCopy(dst, 3, "blah", 3);
  78. REQUIRE(0 == bx::strCmp(dst, "bl") );
  79. REQUIRE(num == 2);
  80. num = bx::strCopy(dst, sizeof(dst), "blah", 3);
  81. REQUIRE(0 == bx::strCmp(dst, "bla") );
  82. REQUIRE(num == 3);
  83. num = bx::strCopy(dst, sizeof(dst), "blah");
  84. REQUIRE(0 == bx::strCmp(dst, "bl", 2) );
  85. REQUIRE(0 == bx::strCmp(dst, "blah") );
  86. REQUIRE(num == 4);
  87. }
  88. TEST_CASE("strCat", "[string]")
  89. {
  90. char dst[128] = { '\0' };
  91. REQUIRE(0 == bx::strCat(dst, 1, "cat") );
  92. REQUIRE(4 == bx::strCopy(dst, 5, "copy") );
  93. REQUIRE(3 == bx::strCat(dst, 8, "cat") );
  94. REQUIRE(0 == bx::strCmp(dst, "copycat") );
  95. REQUIRE(0 == bx::strCmp(dst, "copy", 4) );
  96. REQUIRE(1 == bx::strCat(dst, BX_COUNTOF(dst), "------", 1) );
  97. REQUIRE(3 == bx::strCat(dst, BX_COUNTOF(dst), "cat") );
  98. REQUIRE(0 == bx::strCmp(dst, "copycat-cat") );
  99. }
  100. TEST_CASE("strCmp", "[string]")
  101. {
  102. REQUIRE(0 < bx::strCmp("abvgd", "abv") );
  103. REQUIRE(0 < bx::strCmp("abvgd", "") );
  104. REQUIRE(0 > bx::strCmp("", "abvgd") );
  105. REQUIRE(0 != bx::strCmp(".tar.gz", ".") );
  106. REQUIRE(0 != bx::strCmp("meh", "meh/") );
  107. }
  108. TEST_CASE("strCmpI", "[string]")
  109. {
  110. REQUIRE(0 == bx::strCmpI("test", "test") );
  111. REQUIRE(0 == bx::strCmpI("test", "testestes", 4) );
  112. REQUIRE(0 == bx::strCmpI("testestes", "test", 4) );
  113. REQUIRE(0 != bx::strCmpI("preprocess", "platform") );
  114. const char* abvgd = "abvgd";
  115. const char* abvgx = "abvgx";
  116. const char* empty = "";
  117. REQUIRE(0 == bx::strCmpI(abvgd, abvgd) );
  118. REQUIRE(0 == bx::strCmpI(abvgd, abvgx, 4) );
  119. REQUIRE(0 == bx::strCmpI(empty, empty) );
  120. REQUIRE(0 > bx::strCmpI(abvgd, abvgx) );
  121. REQUIRE(0 > bx::strCmpI(empty, abvgd) );
  122. REQUIRE(0 < bx::strCmpI(abvgx, abvgd) );
  123. REQUIRE(0 < bx::strCmpI(abvgd, empty) );
  124. }
  125. TEST_CASE("strCmpV", "[string]")
  126. {
  127. REQUIRE(0 == bx::strCmpV("test", "test") );
  128. REQUIRE(0 == bx::strCmpV("test", "testestes", 4) );
  129. REQUIRE(0 == bx::strCmpV("testestes", "test", 4) );
  130. REQUIRE(0 != bx::strCmpV("preprocess", "platform") );
  131. const char* abvgd = "abvgd";
  132. const char* abvgx = "abvgx";
  133. const char* empty = "";
  134. REQUIRE(0 == bx::strCmpV(abvgd, abvgd) );
  135. REQUIRE(0 == bx::strCmpV(abvgd, abvgx, 4) );
  136. REQUIRE(0 == bx::strCmpV(empty, empty) );
  137. REQUIRE(0 > bx::strCmpV(abvgd, abvgx) );
  138. REQUIRE(0 > bx::strCmpV(empty, abvgd) );
  139. REQUIRE(0 < bx::strCmpV(abvgx, abvgd) );
  140. REQUIRE(0 < bx::strCmpV(abvgd, empty) );
  141. }
  142. static int32_t strCmpV(const void* _lhs, const void* _rhs)
  143. {
  144. const char* lhs = *(const char**)_lhs;
  145. const char* rhs = *(const char**)_rhs;
  146. int32_t result = bx::strCmpV(lhs, rhs);
  147. return result;
  148. }
  149. TEST_CASE("strCmpV sort", "[string][sort]")
  150. {
  151. const char* test[] =
  152. {
  153. "test_1.txt",
  154. "test_10.txt",
  155. "test_100.txt",
  156. "test_15.txt",
  157. "test_11.txt",
  158. "test_23.txt",
  159. "test_3.txt",
  160. };
  161. const char* expected[] =
  162. {
  163. "test_1.txt",
  164. "test_3.txt",
  165. "test_10.txt",
  166. "test_11.txt",
  167. "test_15.txt",
  168. "test_23.txt",
  169. "test_100.txt",
  170. };
  171. static_assert(BX_COUNTOF(test) == BX_COUNTOF(expected) );
  172. bx::quickSort(test, BX_COUNTOF(test), sizeof(const char*), strCmpV);
  173. for (uint32_t ii = 0; ii < BX_COUNTOF(test); ++ii)
  174. {
  175. REQUIRE(0 == bx::strCmp(test[ii], expected[ii]) );
  176. }
  177. }
  178. TEST_CASE("overlap", "[string]")
  179. {
  180. const char* test = "The Quick Brown Fox Jumps Over The Lazy Dog.";
  181. const bx::StringView quick = bx::strFind(test, "Quick");
  182. REQUIRE(bx::overlap(quick, test) );
  183. const bx::StringView empty;
  184. REQUIRE(!bx::overlap(quick, empty) );
  185. REQUIRE(!bx::overlap(test, empty) );
  186. }
  187. TEST_CASE("strRFind", "[string]")
  188. {
  189. const char* test = "test";
  190. REQUIRE(bx::strRFind(bx::StringView(test, 0), 's').isEmpty() );
  191. REQUIRE(bx::strRFind(bx::StringView(test, 1), 's').isEmpty() );
  192. REQUIRE(&test[2] == bx::strRFind(test, 's').getPtr() );
  193. REQUIRE(&test[3] == bx::strRFind(test, 't').getPtr() );
  194. }
  195. TEST_CASE("strFindI", "[string]")
  196. {
  197. const char* test = "The Quick Brown Fox Jumps Over The Lazy Dog.";
  198. REQUIRE(bx::strFindI(bx::StringView(test, 8), "quick").isEmpty() );
  199. REQUIRE(bx::strFindI(test, "quick1").isEmpty() );
  200. REQUIRE(&test[4] == bx::strFindI(bx::StringView(test, 9), "quick").getPtr() );
  201. REQUIRE(&test[4] == bx::strFindI(test, "quick").getPtr() );
  202. }
  203. TEST_CASE("strFind", "[string]")
  204. {
  205. {
  206. const char* test = "test";
  207. REQUIRE(bx::strFind(bx::StringView(test, 0), 's').isEmpty() );
  208. REQUIRE(bx::strFind(bx::StringView(test, 2), 's').isEmpty() );
  209. REQUIRE(&test[2] == bx::strFind(test, 's').getPtr() );
  210. }
  211. {
  212. const char* test = "The Quick Brown Fox Jumps Over The Lazy Dog.";
  213. REQUIRE(bx::strFind(bx::StringView(test, 8), "quick").isEmpty() );
  214. REQUIRE(bx::strFind(test, "quick1").isEmpty() );
  215. REQUIRE(bx::strFind(bx::StringView(test, 9), "quick").isEmpty() );
  216. REQUIRE(bx::strFind(test, "quick").isEmpty() );
  217. REQUIRE(bx::strFind(bx::StringView(test, 8), "Quick").isEmpty() );
  218. REQUIRE(bx::strFind(test, "Quick1").isEmpty() );
  219. REQUIRE(&test[4] == bx::strFind(bx::StringView(test, 9), "Quick").getPtr() );
  220. REQUIRE(&test[4] == bx::strFind(test, "Quick").getPtr() );
  221. REQUIRE(bx::strFind("vgd", 'a').isEmpty() );
  222. }
  223. {
  224. bx::StringView test = bx::strFind("a", "a");
  225. REQUIRE(test.getLength() == 1);
  226. REQUIRE(*test.getPtr() == 'a');
  227. }
  228. {
  229. bx::StringView test = bx::strFind("a", bx::StringView("a ", 1) );
  230. REQUIRE(test.getLength() == 1);
  231. REQUIRE(*test.getPtr() == 'a');
  232. }
  233. }
  234. TEST_CASE("strSkip", "[string]")
  235. {
  236. const bx::StringView t0(" test X");
  237. const bx::StringView t1 = bx::strLTrimSpace(t0);
  238. REQUIRE(0 == bx::strCmp(t1, "test", 4) );
  239. const bx::StringView t2 = bx::strLTrimNonSpace(t1);
  240. REQUIRE(0 == bx::strCmp(t2, " X", 2) );
  241. const bx::StringView t3("test");
  242. const bx::StringView t4 = bx::strLTrimNonSpace(t3);
  243. REQUIRE(t4.getTerm() == t4.getPtr() );
  244. }
  245. template<typename Ty>
  246. static bool testToStringS(Ty _value, const char* _expected, char _separator = '\0')
  247. {
  248. char tmp[1024];
  249. int32_t num = bx::toString(tmp, BX_COUNTOF(tmp), _value, 10, _separator);
  250. int32_t len = (int32_t)bx::strLen(_expected);
  251. if (0 == bx::strCmp(tmp, _expected)
  252. && num == len)
  253. {
  254. return true;
  255. }
  256. printf("result '%s' (%d), expected '%s' (%d)\n", tmp, num, _expected, len);
  257. return false;
  258. }
  259. TEST_CASE("toString intXX_t/uintXX_t", "[string]")
  260. {
  261. REQUIRE(testToStringS(0, "0") );
  262. REQUIRE(testToStringS(-256, "-256") );
  263. REQUIRE(testToStringS(INT32_MIN, "-2147483648") );
  264. REQUIRE(testToStringS(INT32_MAX, "2147483647") );
  265. REQUIRE(testToStringS(UINT32_MAX, "4294967295") );
  266. REQUIRE(testToStringS(INT64_MIN, "-9223372036854775808") );
  267. REQUIRE(testToStringS(INT64_MAX, "9223372036854775807") );
  268. REQUIRE(testToStringS(UINT64_MAX, "18446744073709551615") );
  269. REQUIRE(testToStringS(0, "0", ',') );
  270. REQUIRE(testToStringS(-256, "-256", ',') );
  271. REQUIRE(testToStringS(INT32_MAX, "2,147,483,647", ',') );
  272. REQUIRE(testToStringS(UINT32_MAX, "4,294,967,295", ',') );
  273. REQUIRE(testToStringS(INT64_MAX, "9,223,372,036,854,775,807", ',') );
  274. REQUIRE(testToStringS(UINT64_MAX, "18,446,744,073,709,551,615", ',') );
  275. }
  276. template<typename Ty>
  277. static bool testToString(Ty _value, const char* _expected)
  278. {
  279. char tmp[1024];
  280. int32_t num = bx::toString(tmp, BX_COUNTOF(tmp), _value);
  281. int32_t len = (int32_t)bx::strLen(_expected);
  282. if (0 == bx::strCmp(tmp, _expected)
  283. && num == len)
  284. {
  285. return true;
  286. }
  287. printf("result '%s' (%d), expected '%s' (%d)\n", tmp, num, _expected, len);
  288. return false;
  289. }
  290. TEST_CASE("toString double", "[string]")
  291. {
  292. REQUIRE(testToString(0.0, "0.0") );
  293. REQUIRE(testToString(-0.0, "-0.0") );
  294. REQUIRE(testToString(1.0, "1.0") );
  295. REQUIRE(testToString(-1.0, "-1.0") );
  296. REQUIRE(testToString(1.2345, "1.2345") );
  297. REQUIRE(testToString(1.2345678, "1.2345678") );
  298. REQUIRE(testToString(0.123456789012, "0.123456789012") );
  299. REQUIRE(testToString(1234567.8, "1234567.8") );
  300. REQUIRE(testToString(-79.39773355813419, "-79.39773355813419") );
  301. REQUIRE(testToString(0.000001, "0.000001") );
  302. REQUIRE(testToString(0.0000001, "1e-7") );
  303. REQUIRE(testToString(1e30, "1e30") );
  304. REQUIRE(testToString(1.234567890123456e30, "1.234567890123456e30") );
  305. REQUIRE(testToString(-5e-324, "-5e-324") );
  306. REQUIRE(testToString(2.225073858507201e-308, "2.225073858507201e-308") );
  307. REQUIRE(testToString(2.2250738585072014e-308, "2.2250738585072014e-308") );
  308. REQUIRE(testToString(1.7976931348623157e308, "1.7976931348623157e308") );
  309. REQUIRE(testToString(0.00000123123123, "0.00000123123123") );
  310. REQUIRE(testToString(0.000000123123123, "1.23123123e-7") );
  311. REQUIRE(testToString(123123.123, "123123.123") );
  312. REQUIRE(testToString(1231231.23, "1231231.23") );
  313. REQUIRE(testToString(0.000000000123123, "1.23123e-10") );
  314. REQUIRE(testToString(0.0000000001, "1e-10") );
  315. REQUIRE(testToString(-270.000000, "-270.0") );
  316. REQUIRE(testToString(2.225073858507201e-308, "2.225073858507201e-308") );
  317. REQUIRE(testToString(-79.39773355813419, "-79.39773355813419") );
  318. REQUIRE(testToString(-1.234567e-9, "-1.234567e-9") );
  319. }
  320. template<typename Ty>
  321. static bool testFromString(Ty _value, const char* _input)
  322. {
  323. char tmp[1024];
  324. bx::toString(tmp, BX_COUNTOF(tmp), _value);
  325. Ty lhs;
  326. bx::fromString(&lhs, tmp);
  327. Ty rhs;
  328. bx::fromString(&rhs, _input);
  329. if (lhs == rhs)
  330. {
  331. return true;
  332. }
  333. printf("result '%f', input '%s'\n", _value, _input);
  334. return false;
  335. }
  336. TEST_CASE("fromString float", "[string]")
  337. {
  338. REQUIRE(testFromString<float>(std::numeric_limits<float>::min(), "1.175494351e-38") );
  339. REQUIRE(testFromString<float>(std::numeric_limits<float>::lowest(), "-3.402823466e+38") );
  340. REQUIRE(testFromString<float>(std::numeric_limits<float>::max(), "3.402823466e+38") );
  341. }
  342. TEST_CASE("fromString double", "[string]")
  343. {
  344. REQUIRE(testFromString<double>(0.0, "0.0") );
  345. REQUIRE(testFromString<double>(-0.0, "-0.0") );
  346. REQUIRE(testFromString<double>(1.0, "1.0") );
  347. REQUIRE(testFromString<double>(-1.0, "-1.0") );
  348. REQUIRE(testFromString<double>(1.2345, "1.2345") );
  349. REQUIRE(testFromString<double>(1.2345678, "1.2345678") );
  350. REQUIRE(testFromString<double>(0.123456789012, "0.123456789012") );
  351. REQUIRE(testFromString<double>(123456.789, "123456.789") );
  352. REQUIRE(testFromString<double>(1234567.8, "1234567.8") );
  353. REQUIRE(testFromString<double>(-79.39773355813419, "-79.39773355813419") );
  354. REQUIRE(testFromString<double>(0.000001, "0.000001") );
  355. REQUIRE(testFromString<double>(0.0000001, "1e-7") );
  356. REQUIRE(testFromString<double>(1e30, "1e30") );
  357. REQUIRE(testFromString<double>(1.234567890123456e30, "1.234567890123456e30") );
  358. REQUIRE(testFromString<double>(-5e-324, "-5e-324") );
  359. REQUIRE(testFromString<double>(2.225073858507201e-308, "2.225073858507201e-308") );
  360. REQUIRE(testFromString<double>(2.2250738585072014e-308, "2.2250738585072014e-308") );
  361. REQUIRE(testFromString<double>(1.7976931348623157e308, "1.7976931348623157e308") );
  362. REQUIRE(testFromString<double>(0.00000123123123, "0.00000123123123") );
  363. REQUIRE(testFromString<double>(0.000000123123123, "1.23123123e-7") );
  364. REQUIRE(testFromString<double>(123123.123, "123123.123") );
  365. REQUIRE(testFromString<double>(1231231.23, "1231231.23") );
  366. REQUIRE(testFromString<double>(0.000000000123123, "1.23123e-10") );
  367. REQUIRE(testFromString<double>(0.0000000001, "1e-10") );
  368. REQUIRE(testFromString<double>(-270.000000, "-270.0") );
  369. REQUIRE(testFromString<double>(2.2250738585072011e-308, "2.2250738585072011e-308") ); // https://web.archive.org/web/20181112222123/https://www.exploringbinary.com/php-hangs-on-numeric-value-2-2250738585072011e-308/
  370. REQUIRE(testFromString<double>(2.2250738585072009e-308, "2.2250738585072009e-308") ); // Max subnormal double
  371. REQUIRE(testFromString<double>(4.9406564584124654e-324, "4.9406564584124654e-324") ); // Min denormal
  372. REQUIRE(testFromString<double>(1.7976931348623157e+308, "1.7976931348623157e+308") ); // Max double
  373. // warning: magnitude of floating-point constant too small for type 'double'; minimum is 4.9406564584124654E-324
  374. // REQUIRE(testFromString<double>(1e-10000, "0.0") ); // Must underflow
  375. // integer literal is too large to be represented in any integer type
  376. // REQUIRE(testFromString<double>(18446744073709551616, "18446744073709551616.0") ); // 2^64 (max of uint64_t + 1, force to use double)
  377. // REQUIRE(testFromString<double>(-9223372036854775809, "-9223372036854775809.0") ); // -2^63 - 1(min of int64_t + 1, force to use double)
  378. REQUIRE(testFromString<double>(0.9868011474609375, "0.9868011474609375") ); // https://github.com/miloyip/rapidjson/issues/120
  379. REQUIRE(testFromString<double>(123e34, "123e34") );
  380. REQUIRE(testFromString<double>(45913141877270640000.0, "45913141877270640000.0") );
  381. REQUIRE(testFromString<double>(std::numeric_limits<double>::min(), "2.2250738585072014e-308") );
  382. REQUIRE(testFromString<double>(std::numeric_limits<double>::lowest(), "-1.7976931348623158e+308") );
  383. REQUIRE(testFromString<double>(std::numeric_limits<double>::max(), "1.7976931348623158e+308") );
  384. }
  385. static bool testFromString(int32_t _value, const char* _input)
  386. {
  387. char tmp[1024];
  388. bx::toString(tmp, BX_COUNTOF(tmp), _value);
  389. double lhs;
  390. bx::fromString(&lhs, tmp);
  391. double rhs;
  392. bx::fromString(&rhs, _input);
  393. if (lhs == rhs)
  394. {
  395. return true;
  396. }
  397. printf("result '%d', input '%s'\n", _value, _input);
  398. return false;
  399. }
  400. TEST_CASE("fromString int32_t", "[string]")
  401. {
  402. REQUIRE(testFromString(1389, "1389") );
  403. REQUIRE(testFromString(1389, " 1389") );
  404. REQUIRE(testFromString(1389, "+1389") );
  405. REQUIRE(testFromString(-1389, "-1389") );
  406. REQUIRE(testFromString(-1389, " -1389") );
  407. REQUIRE(testFromString(555333, "555333") );
  408. REQUIRE(testFromString(-21, "-021") );
  409. }
  410. TEST_CASE("StringView", "[string]")
  411. {
  412. bx::StringView sv("test");
  413. REQUIRE(4 == sv.getLength() );
  414. bx::DefaultAllocator crt;
  415. g_allocator = &crt;
  416. typedef bx::StringT<&g_allocator> String;
  417. String st(sv);
  418. REQUIRE(4 == st.getLength() );
  419. st.append("test");
  420. REQUIRE(8 == st.getLength() );
  421. st.append(bx::StringView("test", 2) );
  422. REQUIRE(10 == st.getLength() );
  423. REQUIRE(0 == bx::strCmp(st.getCPtr(), "testtestte") );
  424. st.clear();
  425. REQUIRE(0 == st.getLength() );
  426. REQUIRE(4 == sv.getLength() );
  427. st.append("test");
  428. REQUIRE(4 == st.getLength() );
  429. sv.clear();
  430. REQUIRE(0 == sv.getLength() );
  431. }
  432. TEST_CASE("Trim", "[string]")
  433. {
  434. REQUIRE(bx::strLTrim("a", "a").isEmpty() );
  435. REQUIRE(0 == bx::strCmp(bx::strLTrim("aba", "a"), "ba") );
  436. REQUIRE(bx::strRTrim("a", "a").isEmpty() );
  437. REQUIRE(0 == bx::strCmp(bx::strRTrim("aba", "a"), "ab") );
  438. REQUIRE(bx::strTrim("a", "a").isEmpty() );
  439. REQUIRE(0 == bx::strCmp(bx::strTrim("aba", "a"), "b") );
  440. REQUIRE(0 == bx::strCmp(bx::strLTrim("abvgd", "ab"), "vgd") );
  441. REQUIRE(0 == bx::strCmp(bx::strLTrim("abvgd", "vagbd"), "") );
  442. REQUIRE(0 == bx::strCmp(bx::strTrimPrefix("abvgd", "vagbd"), "abvgd") );
  443. REQUIRE(0 == bx::strCmp(bx::strLTrim("abvgd", "vgd"), "abvgd") );
  444. REQUIRE(0 == bx::strCmp(bx::strLTrim("/555333/podmac/", "/"), "555333/podmac/") );
  445. REQUIRE(0 == bx::strCmp(bx::strRTrim("abvgd", "vagbd"), "") );
  446. REQUIRE(0 == bx::strCmp(bx::strTrimSuffix("abvgd", "vagbd"), "abvgd") );
  447. REQUIRE(0 == bx::strCmp(bx::strRTrim("abvgd", "abv"), "abvgd") );
  448. REQUIRE(0 == bx::strCmp(bx::strRTrim("/555333/podmac/", "/"), "/555333/podmac") );
  449. REQUIRE(0 == bx::strCmp(bx::strTrim("abvgd", "da"), "bvg") );
  450. REQUIRE(0 == bx::strCmp(bx::strTrim("<1389>", "<>"), "1389") );
  451. REQUIRE(0 == bx::strCmp(bx::strTrim("/555333/podmac/", "/"), "555333/podmac") );
  452. REQUIRE(0 == bx::strCmp(bx::strTrim("abvgd", ""), "abvgd") );
  453. REQUIRE(0 == bx::strCmp(bx::strTrim(" \t a b\tv g d \t ", " \t"), "a b\tv g d") );
  454. bx::FilePath uri("/555333/podmac/");
  455. REQUIRE(0 == bx::strCmp(bx::strTrim(uri.getPath(), "/"), "555333/podmac") );
  456. }
  457. TEST_CASE("TrimSpace", "[string]")
  458. {
  459. REQUIRE(bx::strLTrimSpace("").isEmpty() );
  460. REQUIRE(bx::strRTrimSpace("").isEmpty() );
  461. REQUIRE(bx::strTrimSpace( "").isEmpty() );
  462. REQUIRE(bx::strLTrimSpace("\n").isEmpty() );
  463. REQUIRE(bx::strRTrimSpace("\n").isEmpty() );
  464. REQUIRE(bx::strTrimSpace( "\n").isEmpty() );
  465. const bx::StringView t0("1389");
  466. const bx::StringView t1(" 1389");
  467. const bx::StringView t2("1389 ");
  468. const bx::StringView t3(" 1389 ");
  469. REQUIRE(0 == bx::strCmp(bx::strLTrimSpace(t0), t0) );
  470. REQUIRE(0 == bx::strCmp(bx::strLTrimSpace(t1), t0) );
  471. REQUIRE(0 == bx::strCmp(bx::strLTrimSpace(t2), t2) );
  472. REQUIRE(0 == bx::strCmp(bx::strLTrimSpace(t3), "1389 ") );
  473. REQUIRE(0 == bx::strCmp(bx::strRTrimSpace(t0), t0) );
  474. REQUIRE(0 == bx::strCmp(bx::strRTrimSpace(t1), t1) );
  475. REQUIRE(0 == bx::strCmp(bx::strRTrimSpace(t2), t0) );
  476. REQUIRE(0 == bx::strCmp(bx::strRTrimSpace(t3), " 1389") );
  477. REQUIRE(0 == bx::strCmp(bx::strTrimSpace(t0), t0) );
  478. REQUIRE(0 == bx::strCmp(bx::strTrimSpace(t1), t0) );
  479. REQUIRE(0 == bx::strCmp(bx::strTrimSpace(t2), t0) );
  480. REQUIRE(0 == bx::strCmp(bx::strTrimSpace(t3), t0) );
  481. }
  482. TEST_CASE("strWord", "[string]")
  483. {
  484. REQUIRE(bx::strWord(" abvgd-1389.0").isEmpty() );
  485. REQUIRE(0 == bx::strCmp(bx::strWord("abvgd-1389.0"), "abvgd") );
  486. }
  487. TEST_CASE("strFindBlock", "[string]")
  488. {
  489. const bx::StringView test0("{ { {} {} abvgd; {} } }");
  490. const bx::StringView test1(test0, 1, INT32_MAX);
  491. bx::StringView result = bx::strFindBlock(test1, '{', '}');
  492. REQUIRE(19 == result.getLength() );
  493. }
  494. TEST_CASE("prefix", "[string]")
  495. {
  496. REQUIRE( bx::hasPrefix("abvgd-1389.0", "abv") );
  497. REQUIRE(!bx::hasPrefix("abvgd-1389.0", "bvg") );
  498. REQUIRE( bx::hasPrefix("abvgd-1389.0", "") );
  499. REQUIRE(0 == bx::strCmp(bx::strTrimPrefix("abvgd-1389.0", "abv"), "gd-1389.0") );
  500. REQUIRE(0 == bx::strCmp(bx::strTrimPrefix("abvgd-1389.0", "xyz"), "abvgd-1389.0") );
  501. }
  502. TEST_CASE("suffix", "[string]")
  503. {
  504. REQUIRE( bx::hasSuffix("abvgd-1389.0", "389.0") );
  505. REQUIRE(!bx::hasSuffix("abvgd-1389.0", "1389") );
  506. REQUIRE( bx::hasSuffix("abvgd-1389.0", "") );
  507. REQUIRE(0 == bx::strCmp(bx::strTrimSuffix("abvgd-1389.0", "389.0"), "abvgd-1") );
  508. REQUIRE(0 == bx::strCmp(bx::strTrimSuffix("abvgd-1389.0", "xyz"), "abvgd-1389.0") );
  509. }
  510. TEST_CASE("0terminated", "[string]")
  511. {
  512. const bx::StringView t0("1389");
  513. REQUIRE(t0.is0Terminated() );
  514. const bx::StringView t1(strTrimPrefix(t0, "13") );
  515. REQUIRE(!t1.is0Terminated() );
  516. const bx::StringView t2(strTrimSuffix(t0, "89") );
  517. REQUIRE(!t2.is0Terminated() );
  518. bx::DefaultAllocator crt;
  519. g_allocator = &crt;
  520. typedef bx::StringT<&g_allocator> String;
  521. String st;
  522. st = strTrimPrefix(t0, "13");
  523. REQUIRE(2 == st.getLength() );
  524. st = strTrimSuffix(t0, "89");
  525. REQUIRE(2 == st.getLength() );
  526. }
  527. TEST_CASE("FixedStringT", "[string]")
  528. {
  529. bx::FixedString64 fs64("1389");
  530. bx::FixedString256 fs256(fs64);
  531. REQUIRE(0 == strCmp(fs64, fs256) );
  532. REQUIRE(0 == strCmp(fs64, "1389") );
  533. REQUIRE(0 == strCmp(fs256, "1389") );
  534. fs64.append("9831");
  535. REQUIRE(8 == fs64.getLength() );
  536. REQUIRE(0 != strCmp(fs64, fs256) );
  537. REQUIRE(0 == strCmp(fs64, "13899831") );
  538. }
  539. TEST(tinystl_string_constructor)
  540. {
  541. using tinystl::string;
  542. {
  543. string s;
  544. CHECK( s.size() == 0 );
  545. }
  546. {
  547. string s("hello");
  548. CHECK( s.size() == 5 );
  549. CHECK( 0 == strcmp(s.c_str(), "hello") );
  550. }
  551. {
  552. string s("hello world", 5);
  553. CHECK( s.size() == 5 );
  554. CHECK( 0 == strcmp(s.c_str(), "hello") );
  555. }
  556. {
  557. const string other("hello");
  558. string s = other;
  559. CHECK( s.size() == 5 );
  560. CHECK( 0 == strcmp(s.c_str(), "hello") );
  561. }
  562. {
  563. string other("hello");
  564. string s = std::move(other);
  565. CHECK( s.size() == 5 );
  566. CHECK( 0 == strcmp(s.c_str(), "hello") );
  567. CHECK( other.size() == 0 );
  568. }
  569. }
  570. TEST(tinystl_string_assign)
  571. {
  572. using tinystl::string;
  573. {
  574. const string other("hello");
  575. string s("new");
  576. s = other;
  577. CHECK( s.size() == 5 );
  578. CHECK( 0 == strcmp(s.c_str(), "hello") );
  579. }
  580. {
  581. string other("hello");
  582. string s("new");
  583. s = std::move(other);
  584. CHECK( s.size() == 5 );
  585. CHECK( 0 == strcmp(s.c_str(), "hello") );
  586. CHECK( other.size() == 0 );
  587. }
  588. {
  589. const string other("hello longer string here");
  590. string s("short");
  591. s = other;
  592. CHECK( s.size() == 24 );
  593. CHECK( 0 == strcmp(s.c_str(), "hello longer string here") );
  594. }
  595. {
  596. string other("hello longer string here");
  597. string s("short");
  598. s = std::move(other);
  599. CHECK( s.size() == 24 );
  600. CHECK( 0 == strcmp(s.c_str(), "hello longer string here") );
  601. CHECK( other.size() == 0 );
  602. }
  603. {
  604. const string other("short");
  605. string s("hello longer string here");
  606. s = other;
  607. CHECK( s.size() == 5 );
  608. CHECK( 0 == strcmp(s.c_str(), "short") );
  609. }
  610. {
  611. string other("short");
  612. string s("hello longer string here");
  613. s = std::move(other);
  614. CHECK( s.size() == 5 );
  615. CHECK( 0 == strcmp(s.c_str(), "short") );
  616. CHECK( other.size() == 0 );
  617. }
  618. }