StringUtilities.cpp 13 KB

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