StringUtilities.cpp 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572
  1. /*
  2. * This source file is part of RmlUi, the HTML/CSS Interface Middleware
  3. *
  4. * For the latest information, see http://github.com/mikke89/RmlUi
  5. *
  6. * Copyright (c) 2008-2010 CodePoint Ltd, Shift Technology Ltd
  7. * Copyright (c) 2019 The RmlUi Team, and contributors
  8. *
  9. * Permission is hereby granted, free of charge, to any person obtaining a copy
  10. * of this software and associated documentation files (the "Software"), to deal
  11. * in the Software without restriction, including without limitation the rights
  12. * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  13. * copies of the Software, and to permit persons to whom the Software is
  14. * furnished to do so, subject to the following conditions:
  15. *
  16. * The above copyright notice and this permission notice shall be included in
  17. * all copies or substantial portions of the Software.
  18. *
  19. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  20. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  21. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  22. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  23. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  24. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  25. * THE SOFTWARE.
  26. *
  27. */
  28. #include "../../Include/RmlUi/Core/StringUtilities.h"
  29. #include "../../Include/RmlUi/Core/Log.h"
  30. #include <algorithm>
  31. #include <stdio.h>
  32. #include <stdarg.h>
  33. #include <string.h>
  34. namespace Rml {
  35. static int FormatString(String& string, size_t max_size, const char* format, va_list argument_list)
  36. {
  37. const int INTERNAL_BUFFER_SIZE = 1024;
  38. static char buffer[INTERNAL_BUFFER_SIZE];
  39. char* buffer_ptr = buffer;
  40. if (max_size + 1 > INTERNAL_BUFFER_SIZE)
  41. buffer_ptr = new char[max_size + 1];
  42. int length = vsnprintf(buffer_ptr, max_size, format, argument_list);
  43. buffer_ptr[length >= 0 ? length : max_size] = '\0';
  44. #ifdef RMLUI_DEBUG
  45. if (length == -1)
  46. {
  47. Log::Message(Log::LT_WARNING, "FormatString: String truncated to %d bytes when processing %s", max_size, format);
  48. }
  49. #endif
  50. string = buffer_ptr;
  51. if (buffer_ptr != buffer)
  52. delete[] buffer_ptr;
  53. return length;
  54. }
  55. int FormatString(String& string, size_t max_size, const char* format, ...)
  56. {
  57. va_list argument_list;
  58. va_start(argument_list, format);
  59. int result = FormatString(string, (int)max_size, format, argument_list);
  60. va_end(argument_list);
  61. return result;
  62. }
  63. String CreateString(size_t max_size, const char* format, ...)
  64. {
  65. String result;
  66. result.reserve(max_size);
  67. va_list argument_list;
  68. va_start(argument_list, format);
  69. FormatString(result, max_size, format, argument_list);
  70. va_end(argument_list);
  71. return result;
  72. }
  73. static inline char CharToLower(char c) {
  74. if (c >= 'A' && c <= 'Z')
  75. c += char('a' - 'A');
  76. return c;
  77. }
  78. String StringUtilities::ToLower(const String& string) {
  79. String str_lower = string;
  80. std::transform(str_lower.begin(), str_lower.end(), str_lower.begin(), &CharToLower);
  81. return str_lower;
  82. }
  83. String StringUtilities::ToUpper(const String& string)
  84. {
  85. String str_upper = string;
  86. std::transform(str_upper.begin(), str_upper.end(), str_upper.begin(), [](char c) {
  87. if (c >= 'a' && c <= 'z')
  88. c -= char('a' - 'A');
  89. return c;
  90. }
  91. );
  92. return str_upper;
  93. }
  94. RMLUICORE_API String StringUtilities::EncodeRml(const String& string)
  95. {
  96. String result;
  97. result.reserve(string.size());
  98. for (char c : string)
  99. {
  100. switch (c)
  101. {
  102. case '<': result += "&lt;"; break;
  103. case '>': result += "&gt;"; break;
  104. case '&': result += "&amp;"; break;
  105. case '"': result += "&quot;"; break;
  106. default: result += c; break;
  107. }
  108. }
  109. return result;
  110. }
  111. String StringUtilities::Replace(String subject, const String& search, const String& replace)
  112. {
  113. size_t pos = 0;
  114. while ((pos = subject.find(search, pos)) != String::npos) {
  115. subject.replace(pos, search.length(), replace);
  116. pos += replace.length();
  117. }
  118. return subject;
  119. }
  120. String StringUtilities::Replace(String subject, char search, char replace)
  121. {
  122. const size_t size = subject.size();
  123. for (size_t i = 0; i < size; i++)
  124. {
  125. if (subject[i] == search)
  126. subject[i] = replace;
  127. }
  128. return subject;
  129. }
  130. // Expands character-delimited list of values in a single string to a whitespace-trimmed list of values.
  131. void StringUtilities::ExpandString(StringList& string_list, const String& string, const char delimiter)
  132. {
  133. char quote = 0;
  134. bool last_char_delimiter = true;
  135. const char* ptr = string.c_str();
  136. const char* start_ptr = nullptr;
  137. const char* end_ptr = ptr;
  138. size_t num_delimiter_values = std::count(string.begin(), string.end(), delimiter);
  139. if (num_delimiter_values == 0)
  140. {
  141. string_list.push_back(StripWhitespace(string));
  142. return;
  143. }
  144. string_list.reserve(string_list.size() + num_delimiter_values + 1);
  145. while (*ptr)
  146. {
  147. // Switch into quote mode if the last char was a delimeter ( excluding whitespace )
  148. // and we're not already in quote mode
  149. if (last_char_delimiter && !quote && (*ptr == '"' || *ptr == '\''))
  150. {
  151. quote = *ptr;
  152. }
  153. // Switch out of quote mode if we encounter a quote that hasn't been escaped
  154. else if (*ptr == quote && *(ptr-1) != '\\')
  155. {
  156. quote = 0;
  157. }
  158. // If we encounter a delimiter while not in quote mode, add the item to the list
  159. else if (*ptr == delimiter && !quote)
  160. {
  161. if (start_ptr)
  162. string_list.emplace_back(start_ptr, end_ptr + 1);
  163. else
  164. string_list.emplace_back();
  165. last_char_delimiter = true;
  166. start_ptr = nullptr;
  167. }
  168. // Otherwise if its not white space or we're in quote mode, advance the pointers
  169. else if (!IsWhitespace(*ptr) || quote)
  170. {
  171. if (!start_ptr)
  172. start_ptr = ptr;
  173. end_ptr = ptr;
  174. last_char_delimiter = false;
  175. }
  176. ptr++;
  177. }
  178. // If there's data pending, add it.
  179. if (start_ptr)
  180. string_list.emplace_back(start_ptr, end_ptr + 1);
  181. }
  182. void StringUtilities::ExpandString(StringList& string_list, const String& string, const char delimiter, char quote_character, char unquote_character, bool ignore_repeated_delimiters)
  183. {
  184. int quote_mode_depth = 0;
  185. const char* ptr = string.c_str();
  186. const char* start_ptr = nullptr;
  187. const char* end_ptr = ptr;
  188. while (*ptr)
  189. {
  190. // Increment the quote depth for each quote character encountered
  191. if (*ptr == quote_character)
  192. {
  193. ++quote_mode_depth;
  194. }
  195. // And decrement it for every unquote character
  196. else if (*ptr == unquote_character)
  197. {
  198. --quote_mode_depth;
  199. }
  200. // If we encounter a delimiter while not in quote mode, add the item to the list
  201. if (*ptr == delimiter && quote_mode_depth == 0)
  202. {
  203. if (start_ptr)
  204. string_list.emplace_back(start_ptr, end_ptr + 1);
  205. else if(!ignore_repeated_delimiters)
  206. string_list.emplace_back();
  207. start_ptr = nullptr;
  208. }
  209. // Otherwise if its not white space or we're in quote mode, advance the pointers
  210. else if (!IsWhitespace(*ptr) || quote_mode_depth > 0)
  211. {
  212. if (!start_ptr)
  213. start_ptr = ptr;
  214. end_ptr = ptr;
  215. }
  216. ptr++;
  217. }
  218. // If there's data pending, add it.
  219. if (start_ptr)
  220. string_list.emplace_back(start_ptr, end_ptr + 1);
  221. }
  222. // Joins a list of string values into a single string separated by a character delimiter.
  223. void StringUtilities::JoinString(String& string, const StringList& string_list, const char delimiter)
  224. {
  225. for (size_t i = 0; i < string_list.size(); i++)
  226. {
  227. string += string_list[i];
  228. if (delimiter != '\0' && i < string_list.size() - 1)
  229. string += delimiter;
  230. }
  231. }
  232. String StringUtilities::StripWhitespace(const String& string)
  233. {
  234. return StripWhitespace(StringView(string));
  235. }
  236. RMLUICORE_API String StringUtilities::StripWhitespace(StringView string)
  237. {
  238. const char* start = string.begin();
  239. const char* end = string.end();
  240. while (start < end && IsWhitespace(*start))
  241. start++;
  242. while (end > start&& IsWhitespace(*(end - 1)))
  243. end--;
  244. if (start < end)
  245. return String(start, end);
  246. return String();
  247. }
  248. void StringUtilities::TrimTrailingDotZeros(String& string)
  249. {
  250. size_t new_size = string.size();
  251. for (size_t i = string.size() - 1; i < string.size(); i--)
  252. {
  253. if (string[i] == '.')
  254. {
  255. new_size = i;
  256. break;
  257. }
  258. else if (string[i] == '0')
  259. new_size = i;
  260. else
  261. break;
  262. }
  263. if (new_size < string.size())
  264. string.resize(new_size);
  265. }
  266. bool StringUtilities::StringCompareCaseInsensitive(const StringView lhs, const StringView rhs)
  267. {
  268. if (lhs.size() != rhs.size())
  269. return false;
  270. const char* left = lhs.begin();
  271. const char* right = rhs.begin();
  272. const char* const left_end = lhs.end();
  273. for (; left != left_end; ++left, ++right)
  274. {
  275. if (CharToLower(*left) != CharToLower(*right))
  276. return false;
  277. }
  278. return true;
  279. }
  280. Character StringUtilities::ToCharacter(const char* p)
  281. {
  282. if ((*p & (1 << 7)) == 0)
  283. return static_cast<Character>(*p);
  284. int num_bytes = 0;
  285. int code = 0;
  286. if ((*p & 0b1110'0000) == 0b1100'0000)
  287. {
  288. num_bytes = 2;
  289. code = (*p & 0b0001'1111);
  290. }
  291. else if ((*p & 0b1111'0000) == 0b1110'0000)
  292. {
  293. num_bytes = 3;
  294. code = (*p & 0b0000'1111);
  295. }
  296. else if ((*p & 0b1111'1000) == 0b1111'0000)
  297. {
  298. num_bytes = 4;
  299. code = (*p & 0b0000'0111);
  300. }
  301. else
  302. {
  303. // Invalid begin byte
  304. return Character::Null;
  305. }
  306. for (int i = 1; i < num_bytes; i++)
  307. {
  308. const char byte = *(p + i);
  309. if ((byte & 0b1100'0000) != 0b1000'0000)
  310. {
  311. // Invalid continuation byte
  312. ++p;
  313. return Character::Null;
  314. }
  315. code = ((code << 6) | (byte & 0b0011'1111));
  316. }
  317. return static_cast<Character>(code);
  318. }
  319. String StringUtilities::ToUTF8(Character character)
  320. {
  321. return ToUTF8(&character, 1);
  322. }
  323. String StringUtilities::ToUTF8(const Character* characters, int num_characters)
  324. {
  325. String result;
  326. result.reserve(num_characters);
  327. bool invalid_character = false;
  328. for (int i = 0; i < num_characters; i++)
  329. {
  330. char32_t c = (char32_t)characters[i];
  331. constexpr int l3 = 0b0000'0111;
  332. constexpr int l4 = 0b0000'1111;
  333. constexpr int l5 = 0b0001'1111;
  334. constexpr int l6 = 0b0011'1111;
  335. constexpr int h1 = 0b1000'0000;
  336. constexpr int h2 = 0b1100'0000;
  337. constexpr int h3 = 0b1110'0000;
  338. constexpr int h4 = 0b1111'0000;
  339. if (c < 0x80)
  340. result += (char)c;
  341. else if (c < 0x800)
  342. result += { char(((c >> 6) & l5) | h2), char((c & l6) | h1) };
  343. else if (c < 0x10000)
  344. result += { char(((c >> 12) & l4) | h3), char(((c >> 6) & l6) | h1), char((c & l6) | h1) };
  345. else if (c <= 0x10FFFF)
  346. result += { char(((c >> 18) & l3) | h4), char(((c >> 12) & l6) | h1), char(((c >> 6) & l6) | h1), char((c & l6) | h1) };
  347. else
  348. invalid_character = true;
  349. }
  350. if (invalid_character)
  351. Log::Message(Log::LT_WARNING, "One or more invalid code points encountered while encoding to UTF-8.");
  352. return result;
  353. }
  354. size_t StringUtilities::LengthUTF8(StringView string_view)
  355. {
  356. const char* const p_end = string_view.end();
  357. // Skip any continuation bytes at the beginning
  358. const char* p = string_view.begin();
  359. size_t num_continuation_bytes = 0;
  360. while (p != p_end)
  361. {
  362. if ((*p & 0b1100'0000) == 0b1000'0000)
  363. ++num_continuation_bytes;
  364. ++p;
  365. }
  366. return string_view.size() - num_continuation_bytes;
  367. }
  368. U16String StringUtilities::ToUTF16(const String& input)
  369. {
  370. U16String result;
  371. if (input.empty())
  372. return result;
  373. Vector<Character> characters;
  374. characters.reserve(input.size());
  375. for (auto it = StringIteratorU8(input); it; ++it)
  376. characters.push_back(*it);
  377. result.reserve(input.size());
  378. bool valid_characters = true;
  379. for (Character character : characters)
  380. {
  381. char32_t c = (char32_t)character;
  382. if (c <= 0xD7FF || (c >= 0xE000 && c <= 0xFFFF))
  383. {
  384. // Single 16-bit code unit.
  385. result += (char16_t)c;
  386. }
  387. else if (c >= 0x10000 && c <= 0x10FFFF)
  388. {
  389. // Encode as two 16-bit code units.
  390. char32_t c_shift = c - 0x10000;
  391. char16_t w1 = (0xD800 | ((c_shift >> 10) & 0x3FF));
  392. char16_t w2 = (0xDC00 | (c_shift & 0x3FF));
  393. result += {w1, w2};
  394. }
  395. else
  396. {
  397. valid_characters = false;
  398. }
  399. }
  400. if (!valid_characters)
  401. Log::Message(Log::LT_WARNING, "Invalid characters encountered while converting UTF-8 string to UTF-16.");
  402. return result;
  403. }
  404. String StringUtilities::ToUTF8(const U16String& input)
  405. {
  406. Vector<Character> characters;
  407. characters.reserve(input.size());
  408. bool valid_input = true;
  409. char16_t w1 = 0;
  410. for (char16_t w : input)
  411. {
  412. if (w <= 0xD7FF || w >= 0xE000)
  413. {
  414. // Single 16-bit code unit.
  415. characters.push_back((Character)(w));
  416. }
  417. else
  418. {
  419. // Two 16-bit code units.
  420. if (!w1 && w < 0xDC00)
  421. {
  422. w1 = w;
  423. }
  424. else if (w1 && w >= 0xDC00)
  425. {
  426. characters.push_back((Character)(((((char32_t)w1 & 0x3FF) << 10) | ((char32_t)(w) & 0x3FF)) + 0x10000u));
  427. w1 = 0;
  428. }
  429. else
  430. {
  431. valid_input = false;
  432. }
  433. }
  434. }
  435. String result;
  436. if (characters.size() > 0)
  437. result = StringUtilities::ToUTF8(characters.data(), (int)characters.size());
  438. if (!valid_input)
  439. Log::Message(Log::LT_WARNING, "Invalid characters encountered while converting UTF-16 string to UTF-8.");
  440. return result;
  441. }
  442. StringView::StringView()
  443. {
  444. const char* empty_string = "";
  445. p_begin = empty_string;
  446. p_end = empty_string;
  447. }
  448. StringView::StringView(const char* p_begin, const char* p_end) : p_begin(p_begin), p_end(p_end)
  449. {
  450. RMLUI_ASSERT(p_end >= p_begin);
  451. }
  452. StringView::StringView(const String& string) : p_begin(string.data()), p_end(string.data() + string.size())
  453. {}
  454. StringView::StringView(const String& string, size_t offset) : p_begin(string.data() + offset), p_end(string.data() + string.size())
  455. {}
  456. StringView::StringView(const String& string, size_t offset, size_t count) : p_begin(string.data() + offset), p_end(string.data() + std::min<size_t>(offset + count, string.size()))
  457. {}
  458. bool StringView::operator==(const StringView& other) const {
  459. return size() == other.size() && strncmp(p_begin, other.p_begin, size()) == 0;
  460. }
  461. StringIteratorU8::StringIteratorU8(const char* p_begin, const char* p, const char* p_end) : view(p_begin, p_end), p(p)
  462. {}
  463. StringIteratorU8::StringIteratorU8(const String& string) : view(string), p(string.data())
  464. {}
  465. StringIteratorU8::StringIteratorU8(const String& string, size_t offset) : view(string), p(string.data() + offset)
  466. {}
  467. StringIteratorU8::StringIteratorU8(const String& string, size_t offset, size_t count) : view(string, 0, offset + count), p(string.data() + offset)
  468. {}
  469. StringIteratorU8& StringIteratorU8::operator++() {
  470. RMLUI_ASSERT(p < view.end());
  471. ++p;
  472. SeekForward();
  473. return *this;
  474. }
  475. StringIteratorU8& StringIteratorU8::operator--() {
  476. RMLUI_ASSERT(p >= view.begin());
  477. --p;
  478. SeekBack();
  479. return *this;
  480. }
  481. inline void StringIteratorU8::SeekBack() {
  482. p = StringUtilities::SeekBackwardUTF8(p, view.begin());
  483. }
  484. inline void StringIteratorU8::SeekForward() {
  485. p = StringUtilities::SeekForwardUTF8(p, view.end());
  486. }
  487. } // namespace Rml