translation_po.cpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309
  1. /*************************************************************************/
  2. /* translation_po.cpp */
  3. /*************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* https://godotengine.org */
  7. /*************************************************************************/
  8. /* Copyright (c) 2007-2021 Juan Linietsky, Ariel Manzur. */
  9. /* Copyright (c) 2014-2021 Godot Engine contributors (cf. AUTHORS.md). */
  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. #include "core/io/file_access.h"
  32. #ifdef DEBUG_TRANSLATION_PO
  33. void TranslationPO::print_translation_map() {
  34. Error err;
  35. 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(this->get_plural_forms()));
  41. file->store_line("Plural rule : " + this->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. file->close();
  60. }
  61. #endif
  62. Dictionary TranslationPO::_get_messages() const {
  63. // Return translation_map as a Dictionary.
  64. Dictionary d;
  65. List<StringName> context_l;
  66. translation_map.get_key_list(&context_l);
  67. for (const StringName &ctx : context_l) {
  68. const HashMap<StringName, Vector<StringName>> &id_str_map = translation_map[ctx];
  69. Dictionary d2;
  70. List<StringName> id_l;
  71. id_str_map.get_key_list(&id_l);
  72. // Save list of id and strs associated with a context in a temporary dictionary.
  73. for (List<StringName>::Element *E2 = id_l.front(); E2; E2 = E2->next()) {
  74. StringName id = E2->get();
  75. d2[id] = id_str_map[id];
  76. }
  77. d[ctx] = d2;
  78. }
  79. return d;
  80. }
  81. void TranslationPO::_set_messages(const Dictionary &p_messages) {
  82. // Construct translation_map from a Dictionary.
  83. List<Variant> context_l;
  84. p_messages.get_key_list(&context_l);
  85. for (const Variant &ctx : context_l) {
  86. const Dictionary &id_str_map = p_messages[ctx];
  87. HashMap<StringName, Vector<StringName>> temp_map;
  88. List<Variant> id_l;
  89. id_str_map.get_key_list(&id_l);
  90. for (List<Variant>::Element *E2 = id_l.front(); E2; E2 = E2->next()) {
  91. StringName id = E2->get();
  92. temp_map[id] = id_str_map[id];
  93. }
  94. translation_map[ctx] = temp_map;
  95. }
  96. }
  97. Vector<String> TranslationPO::_get_message_list() const {
  98. // Return all keys in translation_map.
  99. List<StringName> msgs;
  100. get_message_list(&msgs);
  101. Vector<String> v;
  102. for (const StringName &E : msgs) {
  103. v.push_back(E);
  104. }
  105. return v;
  106. }
  107. int TranslationPO::_get_plural_index(int p_n) const {
  108. // Get a number between [0;number of plural forms).
  109. input_val.clear();
  110. input_val.push_back(p_n);
  111. Variant result;
  112. for (int i = 0; i < equi_tests.size(); i++) {
  113. Error err = expr->parse(equi_tests[i], input_name);
  114. ERR_FAIL_COND_V_MSG(err != OK, 0, "Cannot parse expression. Error: " + expr->get_error_text());
  115. result = expr->execute(input_val);
  116. ERR_FAIL_COND_V_MSG(expr->has_execute_failed(), 0, "Cannot evaluate expression.");
  117. // Last expression. Variant result will either map to a bool or an integer, in both cases returning it will give the correct plural index.
  118. if (i + 1 == equi_tests.size()) {
  119. return result;
  120. }
  121. if (bool(result)) {
  122. return i;
  123. }
  124. }
  125. ERR_FAIL_V_MSG(0, "Unexpected. Function should have returned. Please report this bug.");
  126. }
  127. void TranslationPO::_cache_plural_tests(const String &p_plural_rule) {
  128. // Some examples of p_plural_rule passed in can have the form:
  129. // "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)
  130. // "n >= 2" (French) // When evaluating the last, especially careful with this one.
  131. // "n != 1" (English)
  132. int first_ques_mark = p_plural_rule.find("?");
  133. if (first_ques_mark == -1) {
  134. equi_tests.push_back(p_plural_rule.strip_edges());
  135. return;
  136. }
  137. String equi_test = p_plural_rule.substr(0, first_ques_mark).strip_edges();
  138. equi_tests.push_back(equi_test);
  139. String after_colon = p_plural_rule.substr(p_plural_rule.find(":") + 1, p_plural_rule.length());
  140. _cache_plural_tests(after_colon);
  141. }
  142. void TranslationPO::set_plural_rule(const String &p_plural_rule) {
  143. // Set plural_forms and plural_rule.
  144. // p_plural_rule passed in has the form "Plural-Forms: nplurals=2; plural=(n >= 2);".
  145. int first_semi_col = p_plural_rule.find(";");
  146. plural_forms = p_plural_rule.substr(p_plural_rule.find("=") + 1, first_semi_col - (p_plural_rule.find("=") + 1)).to_int();
  147. int expression_start = p_plural_rule.find("=", first_semi_col) + 1;
  148. int second_semi_col = p_plural_rule.rfind(";");
  149. plural_rule = p_plural_rule.substr(expression_start, second_semi_col - expression_start);
  150. // Setup the cache to make evaluating plural rule faster later on.
  151. plural_rule = plural_rule.replacen("(", "");
  152. plural_rule = plural_rule.replacen(")", "");
  153. _cache_plural_tests(plural_rule);
  154. expr.instantiate();
  155. input_name.push_back("n");
  156. }
  157. void TranslationPO::add_message(const StringName &p_src_text, const StringName &p_xlated_text, const StringName &p_context) {
  158. HashMap<StringName, Vector<StringName>> &map_id_str = translation_map[p_context];
  159. if (map_id_str.has(p_src_text)) {
  160. WARN_PRINT("Double translations for \"" + String(p_src_text) + "\" under the same context \"" + String(p_context) + "\" for locale \"" + get_locale() + "\".\nThere should only be one unique translation for a given string under the same context.");
  161. map_id_str[p_src_text].set(0, p_xlated_text);
  162. } else {
  163. map_id_str[p_src_text].push_back(p_xlated_text);
  164. }
  165. }
  166. void TranslationPO::add_plural_message(const StringName &p_src_text, const Vector<String> &p_plural_xlated_texts, const StringName &p_context) {
  167. ERR_FAIL_COND_MSG(p_plural_xlated_texts.size() != plural_forms, "Trying to add plural texts that don't match the required number of plural forms for locale \"" + get_locale() + "\"");
  168. HashMap<StringName, Vector<StringName>> &map_id_str = translation_map[p_context];
  169. if (map_id_str.has(p_src_text)) {
  170. WARN_PRINT("Double translations for \"" + p_src_text + "\" under the same context \"" + p_context + "\" for locale " + get_locale() + ".\nThere should only be one unique translation for a given string under the same context.");
  171. map_id_str[p_src_text].clear();
  172. }
  173. for (int i = 0; i < p_plural_xlated_texts.size(); i++) {
  174. map_id_str[p_src_text].push_back(p_plural_xlated_texts[i]);
  175. }
  176. }
  177. int TranslationPO::get_plural_forms() const {
  178. return plural_forms;
  179. }
  180. String TranslationPO::get_plural_rule() const {
  181. return plural_rule;
  182. }
  183. StringName TranslationPO::get_message(const StringName &p_src_text, const StringName &p_context) const {
  184. if (!translation_map.has(p_context) || !translation_map[p_context].has(p_src_text)) {
  185. return StringName();
  186. }
  187. ERR_FAIL_COND_V_MSG(translation_map[p_context][p_src_text].is_empty(), StringName(), "Source text \"" + String(p_src_text) + "\" is registered but doesn't have a translation. Please report this bug.");
  188. return translation_map[p_context][p_src_text][0];
  189. }
  190. StringName TranslationPO::get_plural_message(const StringName &p_src_text, const StringName &p_plural_text, int p_n, const StringName &p_context) const {
  191. 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.");
  192. // If the query is the same as last time, return the cached result.
  193. if (p_n == last_plural_n && p_context == last_plural_context && p_src_text == last_plural_key) {
  194. return translation_map[p_context][p_src_text][last_plural_mapped_index];
  195. }
  196. if (!translation_map.has(p_context) || !translation_map[p_context].has(p_src_text)) {
  197. return StringName();
  198. }
  199. ERR_FAIL_COND_V_MSG(translation_map[p_context][p_src_text].is_empty(), StringName(), "Source text \"" + String(p_src_text) + "\" is registered but doesn't have a translation. Please report this bug.");
  200. if (translation_map[p_context][p_src_text].size() == 1) {
  201. WARN_PRINT("Source string \"" + String(p_src_text) + "\" doesn't have plural translations. Use singular translation API for such as tr(), TTR() to translate \"" + String(p_src_text) + "\"");
  202. return translation_map[p_context][p_src_text][0];
  203. }
  204. int plural_index = _get_plural_index(p_n);
  205. 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.");
  206. // Cache result so that if the next entry is the same, we can return directly.
  207. // _get_plural_index(p_n) can get very costly, especially when evaluating long plural-rule (Arabic)
  208. last_plural_key = p_src_text;
  209. last_plural_context = p_context;
  210. last_plural_n = p_n;
  211. last_plural_mapped_index = plural_index;
  212. return translation_map[p_context][p_src_text][plural_index];
  213. }
  214. void TranslationPO::erase_message(const StringName &p_src_text, const StringName &p_context) {
  215. if (!translation_map.has(p_context)) {
  216. return;
  217. }
  218. translation_map[p_context].erase(p_src_text);
  219. }
  220. void TranslationPO::get_message_list(List<StringName> *r_messages) const {
  221. // OptimizedTranslation uses this function to get the list of msgid.
  222. // Return all the keys of translation_map under "" context.
  223. List<StringName> context_l;
  224. translation_map.get_key_list(&context_l);
  225. for (const StringName &E : context_l) {
  226. if (String(E) != "") {
  227. continue;
  228. }
  229. List<StringName> msgid_l;
  230. translation_map[E].get_key_list(&msgid_l);
  231. for (List<StringName>::Element *E2 = msgid_l.front(); E2; E2 = E2->next()) {
  232. r_messages->push_back(E2->get());
  233. }
  234. }
  235. }
  236. int TranslationPO::get_message_count() const {
  237. List<StringName> context_l;
  238. translation_map.get_key_list(&context_l);
  239. int count = 0;
  240. for (const StringName &E : context_l) {
  241. count += translation_map[E].size();
  242. }
  243. return count;
  244. }
  245. void TranslationPO::_bind_methods() {
  246. ClassDB::bind_method(D_METHOD("get_plural_forms"), &TranslationPO::get_plural_forms);
  247. ClassDB::bind_method(D_METHOD("get_plural_rule"), &TranslationPO::get_plural_rule);
  248. }