💿🐜 Antkeeper source code https://antkeeper.com
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

46 lines
1.5 KiB

  1. /*
  2. * Copyright (C) 2023 Christopher J. Howard
  3. *
  4. * This file is part of Antkeeper source code.
  5. *
  6. * Antkeeper source code is free software: you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License as published by
  8. * the Free Software Foundation, either version 3 of the License, or
  9. * (at your option) any later version.
  10. *
  11. * Antkeeper source code is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. * GNU General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public License
  17. * along with Antkeeper source code. If not, see <http://www.gnu.org/licenses/>.
  18. */
  19. #ifndef ANTKEEPER_I18N_STRING_MAP_HPP
  20. #define ANTKEEPER_I18N_STRING_MAP_HPP
  21. #include "i18n/string-table.hpp"
  22. #include <string>
  23. #include <unordered_map>
  24. namespace i18n {
  25. /**
  26. * Maps 32-bit keys to strings.
  27. */
  28. typedef std::unordered_map<std::uint32_t, std::string> string_map;
  29. /**
  30. * Builds a string map from a string table. Keys are generated with the 32-bit FNV-1a hash function.
  31. *
  32. * @param[in] table String table from which the string map will be built.
  33. * @param[in] key_column Column containing key strings.
  34. * @param[in] value_column Column containing value strings.
  35. * @param[out] String map to build.
  36. */
  37. void build_string_map(const string_table& table, std::size_t key_column, std::size_t value_column, string_map& map);
  38. } // namespace i18n
  39. #endif // ANTKEEPER_I18N_STRING_MAP_HPP