translation_po.cpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307
  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. #include "core/io/file_access.h"
  32. #ifdef DEBUG_TRANSLATION_PO
  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(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. }
  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. List<Variant> context_l;
  76. p_messages.get_key_list(&context_l);
  77. for (const Variant &ctx : context_l) {
  78. const Dictionary &id_str_map = p_messages[ctx];
  79. HashMap<StringName, Vector<StringName>> temp_map;
  80. List<Variant> id_l;
  81. id_str_map.get_key_list(&id_l);
  82. for (List<Variant>::Element *E2 = id_l.front(); E2; E2 = E2->next()) {
  83. StringName id = E2->get();
  84. temp_map[id] = id_str_map[id];
  85. }
  86. translation_map[ctx] = temp_map;
  87. }
  88. }
  89. Vector<String> TranslationPO::get_translated_message_list() const {
  90. Vector<String> msgs;
  91. for (const KeyValue<StringName, HashMap<StringName, Vector<StringName>>> &E : translation_map) {
  92. if (E.key != StringName()) {
  93. continue;
  94. }
  95. for (const KeyValue<StringName, Vector<StringName>> &E2 : E.value) {
  96. for (const StringName &E3 : E2.value) {
  97. msgs.push_back(E3);
  98. }
  99. }
  100. }
  101. return msgs;
  102. }
  103. Vector<String> TranslationPO::_get_message_list() const {
  104. // Return all keys in translation_map.
  105. List<StringName> msgs;
  106. get_message_list(&msgs);
  107. Vector<String> v;
  108. for (const StringName &E : msgs) {
  109. v.push_back(E);
  110. }
  111. return v;
  112. }
  113. int TranslationPO::_get_plural_index(int p_n) const {
  114. // Get a number between [0;number of plural forms).
  115. input_val.clear();
  116. input_val.push_back(p_n);
  117. Variant result;
  118. for (int i = 0; i < equi_tests.size(); i++) {
  119. Error err = expr->parse(equi_tests[i], input_name);
  120. ERR_FAIL_COND_V_MSG(err != OK, 0, "Cannot parse expression. Error: " + expr->get_error_text());
  121. result = expr->execute(input_val);
  122. ERR_FAIL_COND_V_MSG(expr->has_execute_failed(), 0, "Cannot evaluate expression.");
  123. // Last expression. Variant result will either map to a bool or an integer, in both cases returning it will give the correct plural index.
  124. if (i + 1 == equi_tests.size()) {
  125. return result;
  126. }
  127. if (bool(result)) {
  128. return i;
  129. }
  130. }
  131. ERR_FAIL_V_MSG(0, "Unexpected. Function should have returned. Please report this bug.");
  132. }
  133. void TranslationPO::_cache_plural_tests(const String &p_plural_rule) {
  134. // Some examples of p_plural_rule passed in can have the form:
  135. // "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)
  136. // "n >= 2" (French) // When evaluating the last, especially careful with this one.
  137. // "n != 1" (English)
  138. int first_ques_mark = p_plural_rule.find("?");
  139. if (first_ques_mark == -1) {
  140. equi_tests.push_back(p_plural_rule.strip_edges());
  141. return;
  142. }
  143. String equi_test = p_plural_rule.substr(0, first_ques_mark).strip_edges();
  144. equi_tests.push_back(equi_test);
  145. String after_colon = p_plural_rule.substr(p_plural_rule.find(":") + 1, p_plural_rule.length());
  146. _cache_plural_tests(after_colon);
  147. }
  148. void TranslationPO::set_plural_rule(const String &p_plural_rule) {
  149. // Set plural_forms and plural_rule.
  150. // p_plural_rule passed in has the form "Plural-Forms: nplurals=2; plural=(n >= 2);".
  151. int first_semi_col = p_plural_rule.find(";");
  152. plural_forms = p_plural_rule.substr(p_plural_rule.find("=") + 1, first_semi_col - (p_plural_rule.find("=") + 1)).to_int();
  153. int expression_start = p_plural_rule.find("=", first_semi_col) + 1;
  154. int second_semi_col = p_plural_rule.rfind(";");
  155. plural_rule = p_plural_rule.substr(expression_start, second_semi_col - expression_start);
  156. // Setup the cache to make evaluating plural rule faster later on.
  157. plural_rule = plural_rule.replacen("(", "");
  158. plural_rule = plural_rule.replacen(")", "");
  159. _cache_plural_tests(plural_rule);
  160. expr.instantiate();
  161. input_name.push_back("n");
  162. }
  163. void TranslationPO::add_message(const StringName &p_src_text, const StringName &p_xlated_text, const StringName &p_context) {
  164. HashMap<StringName, Vector<StringName>> &map_id_str = translation_map[p_context];
  165. if (map_id_str.has(p_src_text)) {
  166. 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.");
  167. map_id_str[p_src_text].set(0, p_xlated_text);
  168. } else {
  169. map_id_str[p_src_text].push_back(p_xlated_text);
  170. }
  171. }
  172. void TranslationPO::add_plural_message(const StringName &p_src_text, const Vector<String> &p_plural_xlated_texts, const StringName &p_context) {
  173. 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() + "\"");
  174. HashMap<StringName, Vector<StringName>> &map_id_str = translation_map[p_context];
  175. if (map_id_str.has(p_src_text)) {
  176. 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.");
  177. map_id_str[p_src_text].clear();
  178. }
  179. for (int i = 0; i < p_plural_xlated_texts.size(); i++) {
  180. map_id_str[p_src_text].push_back(p_plural_xlated_texts[i]);
  181. }
  182. }
  183. int TranslationPO::get_plural_forms() const {
  184. return plural_forms;
  185. }
  186. String TranslationPO::get_plural_rule() const {
  187. return plural_rule;
  188. }
  189. StringName TranslationPO::get_message(const StringName &p_src_text, const StringName &p_context) const {
  190. if (!translation_map.has(p_context) || !translation_map[p_context].has(p_src_text)) {
  191. return StringName();
  192. }
  193. 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.");
  194. return translation_map[p_context][p_src_text][0];
  195. }
  196. StringName TranslationPO::get_plural_message(const StringName &p_src_text, const StringName &p_plural_text, int p_n, const StringName &p_context) const {
  197. 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.");
  198. // If the query is the same as last time, return the cached result.
  199. if (p_n == last_plural_n && p_context == last_plural_context && p_src_text == last_plural_key) {
  200. return translation_map[p_context][p_src_text][last_plural_mapped_index];
  201. }
  202. if (!translation_map.has(p_context) || !translation_map[p_context].has(p_src_text)) {
  203. return StringName();
  204. }
  205. 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.");
  206. int plural_index = _get_plural_index(p_n);
  207. 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.");
  208. // Cache result so that if the next entry is the same, we can return directly.
  209. // _get_plural_index(p_n) can get very costly, especially when evaluating long plural-rule (Arabic)
  210. last_plural_key = p_src_text;
  211. last_plural_context = p_context;
  212. last_plural_n = p_n;
  213. last_plural_mapped_index = plural_index;
  214. return translation_map[p_context][p_src_text][plural_index];
  215. }
  216. void TranslationPO::erase_message(const StringName &p_src_text, const StringName &p_context) {
  217. if (!translation_map.has(p_context)) {
  218. return;
  219. }
  220. translation_map[p_context].erase(p_src_text);
  221. }
  222. void TranslationPO::get_message_list(List<StringName> *r_messages) const {
  223. // OptimizedTranslation uses this function to get the list of msgid.
  224. // Return all the keys of translation_map under "" context.
  225. for (const KeyValue<StringName, HashMap<StringName, Vector<StringName>>> &E : translation_map) {
  226. if (E.key != StringName()) {
  227. continue;
  228. }
  229. for (const KeyValue<StringName, Vector<StringName>> &E2 : E.value) {
  230. r_messages->push_back(E2.key);
  231. }
  232. }
  233. }
  234. int TranslationPO::get_message_count() const {
  235. int count = 0;
  236. for (const KeyValue<StringName, HashMap<StringName, Vector<StringName>>> &E : translation_map) {
  237. count += E.value.size();
  238. }
  239. return count;
  240. }
  241. void TranslationPO::_bind_methods() {
  242. ClassDB::bind_method(D_METHOD("get_plural_forms"), &TranslationPO::get_plural_forms);
  243. ClassDB::bind_method(D_METHOD("get_plural_rule"), &TranslationPO::get_plural_rule);
  244. }