StringUtilities.cpp 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568
  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. #include <sstream>
  35. namespace Rml {
  36. static int FormatString(String& string, size_t max_size, const char* format, va_list argument_list)
  37. {
  38. const int INTERNAL_BUFFER_SIZE = 1024;
  39. static char buffer[INTERNAL_BUFFER_SIZE];
  40. char* buffer_ptr = buffer;
  41. if (max_size + 1 > INTERNAL_BUFFER_SIZE)
  42. buffer_ptr = new char[max_size + 1];
  43. int length = vsnprintf(buffer_ptr, max_size, format, argument_list);
  44. buffer_ptr[length >= 0 ? length : max_size] = '\0';
  45. #ifdef RMLUI_DEBUG
  46. if (length == -1)
  47. {
  48. Log::Message(Log::LT_WARNING, "FormatString: String truncated to %zu bytes when processing %s", max_size, format);
  49. }
  50. #endif
  51. string = buffer_ptr;
  52. if (buffer_ptr != buffer)
  53. delete[] buffer_ptr;
  54. return length;
  55. }
  56. int FormatString(String& string, size_t max_size, const char* format, ...)
  57. {
  58. va_list argument_list;
  59. va_start(argument_list, format);
  60. int result = FormatString(string, (int)max_size, format, argument_list);
  61. va_end(argument_list);
  62. return result;
  63. }
  64. String CreateString(size_t max_size, const char* format, ...)
  65. {
  66. String result;
  67. result.reserve(max_size);
  68. va_list argument_list;
  69. va_start(argument_list, format);
  70. FormatString(result, max_size, format, argument_list);
  71. va_end(argument_list);
  72. return result;
  73. }
  74. static inline char CharToLower(char c) {
  75. if (c >= 'A' && c <= 'Z')
  76. c += char('a' - 'A');
  77. return c;
  78. }
  79. String StringUtilities::ToLower(String string) {
  80. std::transform(string.begin(), string.end(), string.begin(), &CharToLower);
  81. return string;
  82. }
  83. String StringUtilities::ToUpper(String string)
  84. {
  85. std::transform(string.begin(), string.end(), string.begin(), [](char c) {
  86. if (c >= 'a' && c <= 'z')
  87. c -= char('a' - 'A');
  88. return c;
  89. }
  90. );
  91. return string;
  92. }
  93. RMLUICORE_API String StringUtilities::EncodeRml(const String& string)
  94. {
  95. String result;
  96. result.reserve(string.size());
  97. for (char c : string)
  98. {
  99. switch (c)
  100. {
  101. case '<': result += "&lt;"; break;
  102. case '>': result += "&gt;"; break;
  103. case '&': result += "&amp;"; break;
  104. case '"': result += "&quot;"; break;
  105. default: result += c; break;
  106. }
  107. }
  108. return result;
  109. }
  110. String StringUtilities::DecodeRml(const String& s)
  111. {
  112. String result;
  113. result.reserve(s.size());
  114. for (size_t i = 0; i < s.size();)
  115. {
  116. if (s[i] == '&')
  117. {
  118. if (s[i+1] == 'l' && s[i+2] == 't' && s[i+3] == ';')
  119. {
  120. result += "<";
  121. i += 4;
  122. continue;
  123. }
  124. else if (s[i+1] == 'g' && s[i+2] == 't' && s[i+3] == ';')
  125. {
  126. result += ">";
  127. i += 4;
  128. continue;
  129. }
  130. else if (s[i+1] == 'a' && s[i+2] == 'm' && s[i+3] == 'p' && s[i+4] == ';')
  131. {
  132. result += "&";
  133. i += 5;
  134. continue;
  135. }
  136. else if (s[i+1] == 'q' && s[i+2] == 'u' && s[i+3] == 'o' && s[i+4] == 't' && s[i+5] == ';')
  137. {
  138. result += "\"";
  139. i += 6;
  140. continue;
  141. }
  142. else if (s[i+1] == '#')
  143. {
  144. size_t start = i + 2;
  145. if (s[i+2] == 'x')
  146. {
  147. start++;
  148. size_t j = 0;
  149. for(; j < 8; j++)
  150. {
  151. auto const& c = s[start + j];
  152. if (!((c >= '0' && c <= '9') || (c >= 'a' && c <= 'f') || (c >= 'A' && c <= 'F')))
  153. break;
  154. }
  155. if (j > 0 && s[start + j] == ';')
  156. {
  157. String tmp = s.substr(start, j);
  158. std::istringstream iss(tmp);
  159. uint32_t code_point;
  160. if (iss >> std::hex >> code_point)
  161. {
  162. result += ToUTF8(static_cast<Character>(code_point));
  163. i = start + j + 1;
  164. continue;
  165. }
  166. }
  167. }
  168. else
  169. {
  170. size_t j = 0;
  171. for(; j < 8; j++)
  172. {
  173. auto const& c = s[start + j];
  174. if (!(c >= '0' && c <= '9'))
  175. break;
  176. }
  177. if (j > 0 && s[start + j] == ';')
  178. {
  179. String tmp = s.substr(start, j);
  180. std::istringstream iss(tmp);
  181. uint32_t code_point;
  182. if (iss >> code_point)
  183. {
  184. result += ToUTF8(static_cast<Character>(code_point));
  185. i = start + j + 1;
  186. continue;
  187. }
  188. }
  189. }
  190. }
  191. }
  192. result += s[i];
  193. i += 1;
  194. }
  195. return result;
  196. }
  197. String StringUtilities::Replace(String subject, const String& search, const String& replace)
  198. {
  199. size_t pos = 0;
  200. while ((pos = subject.find(search, pos)) != String::npos) {
  201. subject.replace(pos, search.length(), replace);
  202. pos += replace.length();
  203. }
  204. return subject;
  205. }
  206. String StringUtilities::Replace(String subject, char search, char replace)
  207. {
  208. const size_t size = subject.size();
  209. for (size_t i = 0; i < size; i++)
  210. {
  211. if (subject[i] == search)
  212. subject[i] = replace;
  213. }
  214. return subject;
  215. }
  216. // Expands character-delimited list of values in a single string to a whitespace-trimmed list of values.
  217. void StringUtilities::ExpandString(StringList& string_list, const String& string, const char delimiter)
  218. {
  219. char quote = 0;
  220. bool last_char_delimiter = true;
  221. const char* ptr = string.c_str();
  222. const char* start_ptr = nullptr;
  223. const char* end_ptr = ptr;
  224. size_t num_delimiter_values = std::count(string.begin(), string.end(), delimiter);
  225. if (num_delimiter_values == 0)
  226. {
  227. string_list.push_back(StripWhitespace(string));
  228. return;
  229. }
  230. string_list.reserve(string_list.size() + num_delimiter_values + 1);
  231. while (*ptr)
  232. {
  233. // Switch into quote mode if the last char was a delimeter ( excluding whitespace )
  234. // and we're not already in quote mode
  235. if (last_char_delimiter && !quote && (*ptr == '"' || *ptr == '\''))
  236. {
  237. quote = *ptr;
  238. }
  239. // Switch out of quote mode if we encounter a quote that hasn't been escaped
  240. else if (*ptr == quote && *(ptr-1) != '\\')
  241. {
  242. quote = 0;
  243. }
  244. // If we encounter a delimiter while not in quote mode, add the item to the list
  245. else if (*ptr == delimiter && !quote)
  246. {
  247. if (start_ptr)
  248. string_list.emplace_back(start_ptr, end_ptr + 1);
  249. else
  250. string_list.emplace_back();
  251. last_char_delimiter = true;
  252. start_ptr = nullptr;
  253. }
  254. // Otherwise if its not white space or we're in quote mode, advance the pointers
  255. else if (!IsWhitespace(*ptr) || quote)
  256. {
  257. if (!start_ptr)
  258. start_ptr = ptr;
  259. end_ptr = ptr;
  260. last_char_delimiter = false;
  261. }
  262. ptr++;
  263. }
  264. // If there's data pending, add it.
  265. if (start_ptr)
  266. string_list.emplace_back(start_ptr, end_ptr + 1);
  267. }
  268. void StringUtilities::ExpandString(StringList& string_list, const String& string, const char delimiter, char quote_character, char unquote_character, bool ignore_repeated_delimiters)
  269. {
  270. int quote_mode_depth = 0;
  271. const char* ptr = string.c_str();
  272. const char* start_ptr = nullptr;
  273. const char* end_ptr = ptr;
  274. while (*ptr)
  275. {
  276. // Increment the quote depth for each quote character encountered
  277. if (*ptr == quote_character)
  278. {
  279. ++quote_mode_depth;
  280. }
  281. // And decrement it for every unquote character
  282. else if (*ptr == unquote_character)
  283. {
  284. --quote_mode_depth;
  285. }
  286. // If we encounter a delimiter while not in quote mode, add the item to the list
  287. if (*ptr == delimiter && quote_mode_depth == 0)
  288. {
  289. if (start_ptr)
  290. string_list.emplace_back(start_ptr, end_ptr + 1);
  291. else if(!ignore_repeated_delimiters)
  292. string_list.emplace_back();
  293. start_ptr = nullptr;
  294. }
  295. // Otherwise if its not white space or we're in quote mode, advance the pointers
  296. else if (!IsWhitespace(*ptr) || quote_mode_depth > 0)
  297. {
  298. if (!start_ptr)
  299. start_ptr = ptr;
  300. end_ptr = ptr;
  301. }
  302. ptr++;
  303. }
  304. // If there's data pending, add it.
  305. if (start_ptr)
  306. string_list.emplace_back(start_ptr, end_ptr + 1);
  307. }
  308. // Joins a list of string values into a single string separated by a character delimiter.
  309. void StringUtilities::JoinString(String& string, const StringList& string_list, const char delimiter)
  310. {
  311. for (size_t i = 0; i < string_list.size(); i++)
  312. {
  313. string += string_list[i];
  314. if (delimiter != '\0' && i < string_list.size() - 1)
  315. string += delimiter;
  316. }
  317. }
  318. String StringUtilities::StripWhitespace(const String& string)
  319. {
  320. return StripWhitespace(StringView(string));
  321. }
  322. RMLUICORE_API String StringUtilities::StripWhitespace(StringView string)
  323. {
  324. const char* start = string.begin();
  325. const char* end = string.end();
  326. while (start < end && IsWhitespace(*start))
  327. start++;
  328. while (end > start&& IsWhitespace(*(end - 1)))
  329. end--;
  330. if (start < end)
  331. return String(start, end);
  332. return String();
  333. }
  334. void StringUtilities::TrimTrailingDotZeros(String& string)
  335. {
  336. size_t new_size = string.size();
  337. for (size_t i = string.size() - 1; i < string.size(); i--)
  338. {
  339. if (string[i] == '.')
  340. {
  341. new_size = i;
  342. break;
  343. }
  344. else if (string[i] == '0')
  345. new_size = i;
  346. else
  347. break;
  348. }
  349. if (new_size < string.size())
  350. string.resize(new_size);
  351. }
  352. bool StringUtilities::StringCompareCaseInsensitive(const StringView lhs, const StringView rhs)
  353. {
  354. if (lhs.size() != rhs.size())
  355. return false;
  356. const char* left = lhs.begin();
  357. const char* right = rhs.begin();
  358. const char* const left_end = lhs.end();
  359. for (; left != left_end; ++left, ++right)
  360. {
  361. if (CharToLower(*left) != CharToLower(*right))
  362. return false;
  363. }
  364. return true;
  365. }
  366. Character StringUtilities::ToCharacter(const char* p)
  367. {
  368. if ((*p & (1 << 7)) == 0)
  369. return static_cast<Character>(*p);
  370. int num_bytes = 0;
  371. int code = 0;
  372. if ((*p & 0b1110'0000) == 0b1100'0000)
  373. {
  374. num_bytes = 2;
  375. code = (*p & 0b0001'1111);
  376. }
  377. else if ((*p & 0b1111'0000) == 0b1110'0000)
  378. {
  379. num_bytes = 3;
  380. code = (*p & 0b0000'1111);
  381. }
  382. else if ((*p & 0b1111'1000) == 0b1111'0000)
  383. {
  384. num_bytes = 4;
  385. code = (*p & 0b0000'0111);
  386. }
  387. else
  388. {
  389. // Invalid begin byte
  390. return Character::Null;
  391. }
  392. for (int i = 1; i < num_bytes; i++)
  393. {
  394. const char byte = *(p + i);
  395. if ((byte & 0b1100'0000) != 0b1000'0000)
  396. {
  397. // Invalid continuation byte
  398. return Character::Null;
  399. }
  400. code = ((code << 6) | (byte & 0b0011'1111));
  401. }
  402. return static_cast<Character>(code);
  403. }
  404. String StringUtilities::ToUTF8(Character character)
  405. {
  406. return ToUTF8(&character, 1);
  407. }
  408. String StringUtilities::ToUTF8(const Character* characters, int num_characters)
  409. {
  410. String result;
  411. result.reserve(num_characters);
  412. bool invalid_character = false;
  413. for (int i = 0; i < num_characters; i++)
  414. {
  415. char32_t c = (char32_t)characters[i];
  416. constexpr int l3 = 0b0000'0111;
  417. constexpr int l4 = 0b0000'1111;
  418. constexpr int l5 = 0b0001'1111;
  419. constexpr int l6 = 0b0011'1111;
  420. constexpr int h1 = 0b1000'0000;
  421. constexpr int h2 = 0b1100'0000;
  422. constexpr int h3 = 0b1110'0000;
  423. constexpr int h4 = 0b1111'0000;
  424. if (c < 0x80)
  425. result += (char)c;
  426. else if (c < 0x800)
  427. result += { char(((c >> 6) & l5) | h2), char((c & l6) | h1) };
  428. else if (c < 0x10000)
  429. result += { char(((c >> 12) & l4) | h3), char(((c >> 6) & l6) | h1), char((c & l6) | h1) };
  430. else if (c <= 0x10FFFF)
  431. result += { char(((c >> 18) & l3) | h4), char(((c >> 12) & l6) | h1), char(((c >> 6) & l6) | h1), char((c & l6) | h1) };
  432. else
  433. invalid_character = true;
  434. }
  435. if (invalid_character)
  436. Log::Message(Log::LT_WARNING, "One or more invalid code points encountered while encoding to UTF-8.");
  437. return result;
  438. }
  439. size_t StringUtilities::LengthUTF8(StringView string_view)
  440. {
  441. const char* const p_end = string_view.end();
  442. // Skip any continuation bytes at the beginning
  443. const char* p = string_view.begin();
  444. size_t num_continuation_bytes = 0;
  445. while (p != p_end)
  446. {
  447. if ((*p & 0b1100'0000) == 0b1000'0000)
  448. ++num_continuation_bytes;
  449. ++p;
  450. }
  451. return string_view.size() - num_continuation_bytes;
  452. }
  453. StringView::StringView()
  454. {
  455. const char* empty_string = "";
  456. p_begin = empty_string;
  457. p_end = empty_string;
  458. }
  459. StringView::StringView(const char* p_begin, const char* p_end) : p_begin(p_begin), p_end(p_end)
  460. {
  461. RMLUI_ASSERT(p_end >= p_begin);
  462. }
  463. StringView::StringView(const String& string) : p_begin(string.data()), p_end(string.data() + string.size())
  464. {}
  465. StringView::StringView(const String& string, size_t offset) : p_begin(string.data() + offset), p_end(string.data() + string.size())
  466. {}
  467. 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()))
  468. {}
  469. bool StringView::operator==(const StringView& other) const {
  470. return size() == other.size() && strncmp(p_begin, other.p_begin, size()) == 0;
  471. }
  472. StringIteratorU8::StringIteratorU8(const char* p_begin, const char* p, const char* p_end) : view(p_begin, p_end), p(p)
  473. {}
  474. StringIteratorU8::StringIteratorU8(const String& string) : view(string), p(string.data())
  475. {}
  476. StringIteratorU8::StringIteratorU8(const String& string, size_t offset) : view(string), p(string.data() + offset)
  477. {}
  478. StringIteratorU8::StringIteratorU8(const String& string, size_t offset, size_t count) : view(string, 0, offset + count), p(string.data() + offset)
  479. {}
  480. StringIteratorU8& StringIteratorU8::operator++() {
  481. RMLUI_ASSERT(p < view.end());
  482. ++p;
  483. SeekForward();
  484. return *this;
  485. }
  486. StringIteratorU8& StringIteratorU8::operator--() {
  487. RMLUI_ASSERT(p >= view.begin());
  488. --p;
  489. SeekBack();
  490. return *this;
  491. }
  492. inline void StringIteratorU8::SeekBack() {
  493. p = StringUtilities::SeekBackwardUTF8(p, view.begin());
  494. }
  495. inline void StringIteratorU8::SeekForward() {
  496. p = StringUtilities::SeekForwardUTF8(p, view.end());
  497. }
  498. } // namespace Rml