2
0

translation_po.cpp 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346
  1. /**************************************************************************/
  2. /* translation_po.cpp */
  3. /**************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* https://godotengine.org */
  7. /**************************************************************************/
  8. /* Copyright (c) 2014-present Godot Engine contributors (see AUTHORS.md). */
  9. /* Copyright (c) 2007-2014 Juan Linietsky, Ariel Manzur. */
  10. /* */
  11. /* Permission is hereby granted, free of charge, to any person obtaining */
  12. /* a copy of this software and associated documentation files (the */
  13. /* "Software"), to deal in the Software without restriction, including */
  14. /* without limitation the rights to use, copy, modify, merge, publish, */
  15. /* distribute, sublicense, and/or sell copies of the Software, and to */
  16. /* permit persons to whom the Software is furnished to do so, subject to */
  17. /* the following conditions: */
  18. /* */
  19. /* The above copyright notice and this permission notice shall be */
  20. /* included in all copies or substantial portions of the Software. */
  21. /* */
  22. /* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
  23. /* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
  24. /* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. */
  25. /* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
  26. /* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
  27. /* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
  28. /* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
  29. /**************************************************************************/
  30. #include "translation_po.h"
  31. #ifdef DEBUG_TRANSLATION_PO
  32. #include "core/io/file_access.h"
  33. void TranslationPO::print_translation_map() {
  34. Error err;
  35. Ref<FileAccess> file = FileAccess::open("translation_map_print_test.txt", FileAccess::WRITE, &err);
  36. if (err != OK) {
  37. ERR_PRINT("Failed to open translation_map_print_test.txt");
  38. return;
  39. }
  40. file->store_line("NPlural : " + String::num_int64(get_plural_forms()));
  41. file->store_line("Plural rule : " + get_plural_rule());
  42. file->store_line("");
  43. List<StringName> context_l;
  44. translation_map.get_key_list(&context_l);
  45. for (const StringName &ctx : context_l) {
  46. file->store_line(" ===== Context: " + String::utf8(String(ctx).utf8()) + " ===== ");
  47. const HashMap<StringName, Vector<StringName>> &inner_map = translation_map[ctx];
  48. List<StringName> id_l;
  49. inner_map.get_key_list(&id_l);
  50. for (List<StringName>::Element *E2 = id_l.front(); E2; E2 = E2->next()) {
  51. StringName id = E2->get();
  52. file->store_line("msgid: " + String::utf8(String(id).utf8()));
  53. for (int i = 0; i < inner_map[id].size(); i++) {
  54. file->store_line("msgstr[" + String::num_int64(i) + "]: " + String::utf8(String(inner_map[id][i]).utf8()));
  55. }
  56. file->store_line("");
  57. }
  58. }
  59. }
  60. #endif
  61. Dictionary TranslationPO::_get_messages() const {
  62. // Return translation_map as a Dictionary.
  63. Dictionary d;
  64. for (const KeyValue<StringName, HashMap<StringName, Vector<StringName>>> &E : translation_map) {
  65. Dictionary d2;
  66. for (const KeyValue<StringName, Vector<StringName>> &E2 : E.value) {
  67. d2[E2.key] = E2.value;
  68. }
  69. d[E.key] = d2;
  70. }
  71. return d;
  72. }
  73. void TranslationPO::_set_messages(const Dictionary &p_messages) {
  74. // Construct translation_map from a Dictionary.
  75. for (const KeyValue<Variant, Variant> &kv : p_messages) {
  76. const Dictionary &id_str_map = kv.value;
  77. HashMap<StringName, Vector<StringName>> temp_map;
  78. for (const KeyValue<Variant, Variant> &kv_id : id_str_map) {
  79. StringName id = kv_id.key;
  80. temp_map[id] = kv_id.value;
  81. }
  82. translation_map[kv.key] = temp_map;
  83. }
  84. }
  85. Vector<String> TranslationPO::get_translated_message_list() const {
  86. Vector<String> msgs;
  87. for (const KeyValue<StringName, HashMap<StringName, Vector<StringName>>> &E : translation_map) {
  88. if (E.key != StringName()) {
  89. continue;
  90. }
  91. for (const KeyValue<StringName, Vector<StringName>> &E2 : E.value) {
  92. for (const StringName &E3 : E2.value) {
  93. msgs.push_back(E3);
  94. }
  95. }
  96. }
  97. return msgs;
  98. }
  99. Vector<String> TranslationPO::_get_message_list() const {
  100. // Return all keys in translation_map.
  101. List<StringName> msgs;
  102. get_message_list(&msgs);
  103. Vector<String> v;
  104. for (const StringName &E : msgs) {
  105. v.push_back(E);
  106. }
  107. return v;
  108. }
  109. int TranslationPO::_get_plural_index(int p_n) const {
  110. // Get a number between [0;number of plural forms).
  111. input_val.clear();
  112. input_val.push_back(p_n);
  113. return _eq_test(equi_tests, 0);
  114. }
  115. int TranslationPO::_eq_test(const Ref<EQNode> &p_node, const Variant &p_result) const {
  116. if (p_node.is_valid()) {
  117. Error err = expr->parse(p_node->regex, input_name);
  118. ERR_FAIL_COND_V_MSG(err != OK, 0, vformat("Cannot parse expression \"%s\". Error: %s", p_node->regex, expr->get_error_text()));
  119. Variant result = expr->execute(input_val);
  120. ERR_FAIL_COND_V_MSG(expr->has_execute_failed(), 0, vformat("Cannot evaluate expression \"%s\".", p_node->regex));
  121. if (bool(result)) {
  122. return _eq_test(p_node->left, result);
  123. } else {
  124. return _eq_test(p_node->right, result);
  125. }
  126. } else {
  127. return p_result;
  128. }
  129. }
  130. int TranslationPO::_find_unquoted(const String &p_src, char32_t p_chr) const {
  131. const int len = p_src.length();
  132. if (len == 0) {
  133. return -1;
  134. }
  135. const char32_t *src = p_src.get_data();
  136. bool in_quote = false;
  137. for (int i = 0; i < len; i++) {
  138. if (in_quote) {
  139. if (src[i] == ')') {
  140. in_quote = false;
  141. }
  142. } else {
  143. if (src[i] == '(') {
  144. in_quote = true;
  145. } else if (src[i] == p_chr) {
  146. return i;
  147. }
  148. }
  149. }
  150. return -1;
  151. }
  152. void TranslationPO::_cache_plural_tests(const String &p_plural_rule, Ref<EQNode> &p_node) {
  153. // Some examples of p_plural_rule passed in can have the form:
  154. // "n==0 ? 0 : n==1 ? 1 : n==2 ? 2 : n%100>=3 && n%100<=10 ? 3 : n%100>=11 && n%100<=99 ? 4 : 5" (Arabic)
  155. // "n >= 2" (French) // When evaluating the last, especially careful with this one.
  156. // "n != 1" (English)
  157. String rule = p_plural_rule;
  158. if (rule.begins_with("(") && rule.ends_with(")")) {
  159. int bcount = 0;
  160. for (int i = 1; i < rule.length() - 1 && bcount >= 0; i++) {
  161. if (rule[i] == '(') {
  162. bcount++;
  163. } else if (rule[i] == ')') {
  164. bcount--;
  165. }
  166. }
  167. if (bcount == 0) {
  168. rule = rule.substr(1, rule.length() - 2);
  169. }
  170. }
  171. int first_ques_mark = _find_unquoted(rule, '?');
  172. int first_colon = _find_unquoted(rule, ':');
  173. if (first_ques_mark == -1) {
  174. p_node->regex = rule.strip_edges();
  175. return;
  176. }
  177. p_node->regex = rule.substr(0, first_ques_mark).strip_edges();
  178. p_node->left.instantiate();
  179. _cache_plural_tests(rule.substr(first_ques_mark + 1, first_colon - first_ques_mark - 1).strip_edges(), p_node->left);
  180. p_node->right.instantiate();
  181. _cache_plural_tests(rule.substr(first_colon + 1).strip_edges(), p_node->right);
  182. }
  183. void TranslationPO::set_plural_rule(const String &p_plural_rule) {
  184. // Set plural_forms and plural_rule.
  185. // p_plural_rule passed in has the form "Plural-Forms: nplurals=2; plural=(n >= 2);".
  186. int first_semi_col = p_plural_rule.find_char(';');
  187. plural_forms = p_plural_rule.substr(p_plural_rule.find_char('=') + 1, first_semi_col - (p_plural_rule.find_char('=') + 1)).to_int();
  188. int expression_start = p_plural_rule.find_char('=', first_semi_col) + 1;
  189. int second_semi_col = p_plural_rule.rfind_char(';');
  190. plural_rule = p_plural_rule.substr(expression_start, second_semi_col - expression_start).strip_edges();
  191. // Setup the cache to make evaluating plural rule faster later on.
  192. equi_tests.instantiate();
  193. _cache_plural_tests(plural_rule, equi_tests);
  194. expr.instantiate();
  195. input_name.push_back("n");
  196. }
  197. void TranslationPO::add_message(const StringName &p_src_text, const StringName &p_xlated_text, const StringName &p_context) {
  198. HashMap<StringName, Vector<StringName>> &map_id_str = translation_map[p_context];
  199. if (map_id_str.has(p_src_text)) {
  200. WARN_PRINT(vformat("Double translations for \"%s\" under the same context \"%s\" for locale \"%s\".\nThere should only be one unique translation for a given string under the same context.", String(p_src_text), String(p_context), get_locale()));
  201. map_id_str[p_src_text].set(0, p_xlated_text);
  202. } else {
  203. map_id_str[p_src_text].push_back(p_xlated_text);
  204. }
  205. }
  206. void TranslationPO::add_plural_message(const StringName &p_src_text, const Vector<String> &p_plural_xlated_texts, const StringName &p_context) {
  207. ERR_FAIL_COND_MSG(p_plural_xlated_texts.size() != plural_forms, vformat("Trying to add plural texts that don't match the required number of plural forms for locale \"%s\".", get_locale()));
  208. HashMap<StringName, Vector<StringName>> &map_id_str = translation_map[p_context];
  209. if (map_id_str.has(p_src_text)) {
  210. WARN_PRINT(vformat("Double translations for \"%s\" under the same context \"%s\" for locale %s.\nThere should only be one unique translation for a given string under the same context.", p_src_text, p_context, get_locale()));
  211. map_id_str[p_src_text].clear();
  212. }
  213. for (int i = 0; i < p_plural_xlated_texts.size(); i++) {
  214. map_id_str[p_src_text].push_back(p_plural_xlated_texts[i]);
  215. }
  216. }
  217. int TranslationPO::get_plural_forms() const {
  218. return plural_forms;
  219. }
  220. String TranslationPO::get_plural_rule() const {
  221. return plural_rule;
  222. }
  223. StringName TranslationPO::get_message(const StringName &p_src_text, const StringName &p_context) const {
  224. if (!translation_map.has(p_context) || !translation_map[p_context].has(p_src_text)) {
  225. return StringName();
  226. }
  227. ERR_FAIL_COND_V_MSG(translation_map[p_context][p_src_text].is_empty(), StringName(), vformat("Source text \"%s\" is registered but doesn't have a translation. Please report this bug.", String(p_src_text)));
  228. return translation_map[p_context][p_src_text][0];
  229. }
  230. StringName TranslationPO::get_plural_message(const StringName &p_src_text, const StringName &p_plural_text, int p_n, const StringName &p_context) const {
  231. ERR_FAIL_COND_V_MSG(p_n < 0, StringName(), "N passed into translation to get a plural message should not be negative. For negative numbers, use singular translation please. Search \"gettext PO Plural Forms\" online for the documentation on translating negative numbers.");
  232. // If the query is the same as last time, return the cached result.
  233. if (p_n == last_plural_n && p_context == last_plural_context && p_src_text == last_plural_key) {
  234. return translation_map[p_context][p_src_text][last_plural_mapped_index];
  235. }
  236. if (!translation_map.has(p_context) || !translation_map[p_context].has(p_src_text)) {
  237. return StringName();
  238. }
  239. ERR_FAIL_COND_V_MSG(translation_map[p_context][p_src_text].is_empty(), StringName(), vformat("Source text \"%s\" is registered but doesn't have a translation. Please report this bug.", String(p_src_text)));
  240. int plural_index = _get_plural_index(p_n);
  241. ERR_FAIL_COND_V_MSG(plural_index < 0 || translation_map[p_context][p_src_text].size() < plural_index + 1, StringName(), "Plural index returned or number of plural translations is not valid. Please report this bug.");
  242. // Cache result so that if the next entry is the same, we can return directly.
  243. // _get_plural_index(p_n) can get very costly, especially when evaluating long plural-rule (Arabic)
  244. last_plural_key = p_src_text;
  245. last_plural_context = p_context;
  246. last_plural_n = p_n;
  247. last_plural_mapped_index = plural_index;
  248. return translation_map[p_context][p_src_text][plural_index];
  249. }
  250. void TranslationPO::erase_message(const StringName &p_src_text, const StringName &p_context) {
  251. if (!translation_map.has(p_context)) {
  252. return;
  253. }
  254. translation_map[p_context].erase(p_src_text);
  255. }
  256. void TranslationPO::get_message_list(List<StringName> *r_messages) const {
  257. // OptimizedTranslation uses this function to get the list of msgid.
  258. // Return all the keys of translation_map under "" context.
  259. for (const KeyValue<StringName, HashMap<StringName, Vector<StringName>>> &E : translation_map) {
  260. if (E.key != StringName()) {
  261. continue;
  262. }
  263. for (const KeyValue<StringName, Vector<StringName>> &E2 : E.value) {
  264. r_messages->push_back(E2.key);
  265. }
  266. }
  267. }
  268. int TranslationPO::get_message_count() const {
  269. int count = 0;
  270. for (const KeyValue<StringName, HashMap<StringName, Vector<StringName>>> &E : translation_map) {
  271. count += E.value.size();
  272. }
  273. return count;
  274. }
  275. void TranslationPO::_bind_methods() {
  276. ClassDB::bind_method(D_METHOD("get_plural_forms"), &TranslationPO::get_plural_forms);
  277. ClassDB::bind_method(D_METHOD("get_plural_rule"), &TranslationPO::get_plural_rule);
  278. }