💿🐜 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.

51 lines
1.5 KiB

7 years ago
7 years ago
7 years ago
7 years ago
7 years ago
7 years ago
7 years ago
  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. #include "i18n/string-map.hpp"
  20. #include "utility/hash/fnv1a.hpp"
  21. #include <algorithm>
  22. namespace i18n {
  23. void build_string_map(const string_table& table, std::size_t key_column, std::size_t value_column, string_map& map)
  24. {
  25. map.clear();
  26. const std::size_t max_column = std::max<std::size_t>(key_column, value_column);
  27. for (const auto& row: table)
  28. {
  29. if (row.size() <= max_column)
  30. {
  31. continue;
  32. }
  33. const auto& value_string = row[value_column];
  34. if (value_string.empty())
  35. {
  36. continue;
  37. }
  38. const auto& key_string = row[key_column];
  39. const std::uint32_t key_hash = hash::fnv1a32(key_string.c_str(), key_string.length());
  40. map[key_hash] = row[value_column];
  41. }
  42. }
  43. } // namespace i18n