Language Translated Unfinished Unfinished words Unfinished characters Untranslated Checks Suggestions Comments
English 100% 3
Chinese (Simplified Han script) 100% 101
Please sign in to see the alerts.

Summary

Project website www.boost.org
Instructions for translators

Please translate the Boost.Unordered documentation. Maintain technical accuracy and follow exact formatting conventions.
Translation process
  • Translations can be made directly.
  • Translation suggestions can be made.
  • Any authenticated user can contribute.
  • The translation uses monolingual files.
  • The translation base language can not be edited.
Source code repository git@github.com:CppDigest/unordered.git
Repository branch local-zh_Hans
Last remote commit Add create-tag workflow 0502087
Boost-Translation-CI-Bot authored 04/23/2026
Last commit in Weblate Translated using Weblate (Chinese (Simplified Han script)) 9c34645
User avatar admin authored 04/23/2026
Weblate repository https://boost-weblate.cloud/git/boost-unordered-documentation-zh_Hans/doc-modules-root-nav-adoc/
File mask doc/modules/ROOT/pages/reference/unordered_flat_set_*.adoc
Monolingual base language file doc/modules/ROOT/pages/reference/unordered_flat_set.adoc
04/25/2026

String statistics

Strings percent Hosted strings Words percent Hosted words Characters percent Hosted characters
Total 688 8,654 85,014
Source 344 4,327 42,507
Translated 100% 688 100% 8,654 100% 85,014
Needs editing 0% 0 0% 0 0% 0
Read-only 50% 344 50% 4,327 50% 42,507
Failing checks 15% 104 14% 1,249 17% 15,199
Strings with suggestions 0% 0 0% 0 0% 0
Untranslated strings 0% 0 0% 0 0% 0
Last 12 months Previous

Activity in last 12 months

0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 1,041 changes
MayJunJulAugSepOctNovDecJanFebMarApr

Quick numbers

8,654
Hosted words
688
Hosted strings
100%
Translated
1
Contributors
0
Components
2
Languages
2
Translations
0
Screenshots
and previous 30 days

Trends of last 30 days

+100%
Hosted words
—
+100%
Hosted strings
—
+100%
Translated
—
+100%
Contributors
—
User avatar None

Alert triggered
Repository has changes. 04/24/2026
User avatar admin

Changes committed
Changes committed 04/23/2026
User avatar admin

Translation completed
Translation completed 04/23/2026
User avatar admin

Translation added
// construct/copy/destroy
xref:#unordered_flat_set_default_constructor[unordered_flat_set]();
explicit xref:#unordered_flat_set_bucket_count_constructor[unordered_flat_set](size_type n,
const hasher& hf = hasher(),
const key_equal& eql = key_equal(),
const allocator_type& a = allocator_type());
template<class InputIterator>
xref:#unordered_flat_set_iterator_range_constructor[unordered_flat_set](InputIterator f, InputIterator l,
size_type n = _implementation-defined_,
const hasher& hf = hasher(),
const key_equal& eql = key_equal(),
const allocator_type& a = allocator_type());
xref:#unordered_flat_set_copy_constructor[unordered_flat_set](const unordered_flat_set& other);
xref:#unordered_flat_set_move_constructor[unordered_flat_set](unordered_flat_set&& other);
template<class InputIterator>
xref:#unordered_flat_set_iterator_range_constructor_with_allocator[unordered_flat_set](InputIterator f, InputIterator l, const allocator_type& a);
explicit xref:#unordered_flat_set_allocator_constructor[unordered_flat_set](const Allocator& a);
xref:#unordered_flat_set_copy_constructor_with_allocator[unordered_flat_set](const unordered_flat_set& other, const Allocator& a);
xref:#unordered_flat_set_move_constructor_from_concurrent_flat_set[unordered_flat_set](concurrent_flat_set<Key, Hash, Pred, Allocator>&& other);
xref:#unordered_flat_set_initializer_list_constructor[unordered_flat_set](std::initializer_list<value_type> il,
size_type n = _implementation-defined_
const hasher& hf = hasher(),
const key_equal& eql = key_equal(),
const allocator_type& a = allocator_type());
xref:#unordered_flat_set_bucket_count_constructor_with_allocator[unordered_flat_set](size_type n, const allocator_type& a);
xref:#unordered_flat_set_bucket_count_constructor_with_hasher_and_allocator[unordered_flat_set](size_type n, const hasher& hf, const allocator_type& a);
template<class InputIterator>
xref:#unordered_flat_set_iterator_range_constructor_with_bucket_count_and_allocator[unordered_flat_set](InputIterator f, InputIterator l, size_type n, const allocator_type& a);
template<class InputIterator>
xref:#unordered_flat_set_iterator_range_constructor_with_bucket_count_and_hasher[unordered_flat_set](InputIterator f, InputIterator l, size_type n, const hasher& hf,
const allocator_type& a);
xref:#unordered_flat_set_initializer_list_constructor_with_allocator[unordered_flat_set](std::initializer_list<value_type> il, const allocator_type& a);
xref:#unordered_flat_set_initializer_list_constructor_with_bucket_count_and_allocator[unordered_flat_set](std::initializer_list<value_type> il, size_type n,
const allocator_type& a);
xref:#unordered_flat_set_initializer_list_constructor_with_bucket_count_and_hasher_and_allocator[unordered_flat_set](std::initializer_list<value_type> il, size_type n, const hasher& hf,
const allocator_type& a);
xref:#unordered_flat_set_destructor[~unordered_flat_set]();
unordered_flat_set& xref:#unordered_flat_set_copy_assignment[operator++=++](const unordered_flat_set& other);
unordered_flat_set& xref:#unordered_flat_set_move_assignment[operator++=++](unordered_flat_set&& other) ++noexcept(
(boost::allocator_traits<Allocator>::is_always_equal::value ||
boost::allocator_traits<Allocator>::propagate_on_container_move_assignment::value) &&
std::is_same<pointer, value_type*>::value);++
unordered_flat_set& xref:#unordered_flat_set_initializer_list_assignment[operator++=++](std::initializer_list<value_type>);
allocator_type xref:#unordered_flat_set_get_allocator[get_allocator]() const noexcept;
// 构造/复制/销毁
xref:#unordered_flat_set_default_constructor[unordered_flat_set]();
explicit xref:#unordered_flat_set_bucket_count_constructor[unordered_flat_set](size_type n,
const hasher& hf = hasher(),
const key_equal& eql = key_equal(),
const allocator_type& a = allocator_type());
template<class InputIterator>
xref:#unordered_flat_set_iterator_range_constructor[unordered_flat_set](InputIterator f, InputIterator l,
size_type n = _implementation-defined_,
const hasher& hf = hasher(),
const key_equal& eql = key_equal(),
const allocator_type& a = allocator_type());
xref:#unordered_flat_set_copy_constructor[unordered_flat_set](const unordered_flat_set& other);
xref:#unordered_flat_set_move_constructor[unordered_flat_set](unordered_flat_set&& other);
template<class InputIterator>
xref:#unordered_flat_set_iterator_range_constructor_with_allocator[unordered_flat_set](InputIterator f, InputIterator l, const allocator_type& a);
explicit xref:#unordered_flat_set_allocator_constructor[unordered_flat_set](const Allocator& a);
xref:#unordered_flat_set_copy_constructor_with_allocator[unordered_flat_set](const unordered_flat_set& other, const Allocator& a);
xref:#unordered_flat_set_move_constructor_from_concurrent_flat_set[unordered_flat_set](concurrent_flat_set<Key, Hash, Pred, Allocator>&& other);
xref:#unordered_flat_set_initializer_list_constructor[unordered_flat_set](std::initializer_list<value_type> il,
size_type n = _implementation-defined_
const hasher& hf = hasher(),
const key_equal& eql = key_equal(),
const allocator_type& a = allocator_type());
xref:#unordered_flat_set_bucket_count_constructor_with_allocator[unordered_flat_set](size_type n, const allocator_type& a);
xref:#unordered_flat_set_bucket_count_constructor_with_hasher_and_allocator[unordered_flat_set](size_type n, const hasher& hf, const allocator_type& a);
template<class InputIterator>
xref:#unordered_flat_set_iterator_range_constructor_with_bucket_count_and_allocator[unordered_flat_set](InputIterator f, InputIterator l, size_type n, const allocator_type& a);
template<class InputIterator>
xref:#unordered_flat_set_iterator_range_constructor_with_bucket_count_and_hasher[unordered_flat_set](InputIterator f, InputIterator l, size_type n, const hasher& hf,
const allocator_type& a);
xref:#unordered_flat_set_initializer_list_constructor_with_allocator[unordered_flat_set](std::initializer_list<value_type> il, const allocator_type& a);
xref:#unordered_flat_set_initializer_list_constructor_with_bucket_count_and_allocator[unordered_flat_set](std::initializer_list<value_type> il, size_type n,
const allocator_type& a);
xref:#unordered_flat_set_initializer_list_constructor_with_bucket_count_and_hasher_and_allocator[unordered_flat_set](std::initializer_list<value_type> il, size_type n, const hasher& hf,
const allocator_type& a);
xref:#unordered_flat_set_destructor[~unordered_flat_set]();
unordered_flat_set& xref:#unordered_flat_set_copy_assignment[operator++=++](const unordered_flat_set& other);
unordered_flat_set& xref:#unordered_flat_set_move_assignment[operator++=++](unordered_flat_set&& other) ++noexcept(
(boost::allocator_traits<Allocator>::is_always_equal::value ||
boost::allocator_traits<Allocator>::propagate_on_container_move_assignment::value) &&
std::is_same<pointer, value_type*>::value);++
unordered_flat_set& xref:#unordered_flat_set_initializer_list_assignment[operator++=++](std::initializer_list<value_type>);
allocator_type xref:#unordered_flat_set_get_allocator[get_allocator]() const noexcept;
04/23/2026
User avatar admin

Translation added
This overload only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs and neither `iterator` nor `const_iterator` are implicitly convertible from `K`. The library assumes that `Hash` is callable with both `K` and `Key` and that `Pred` is transparent. This enables heterogeneous lookup which avoids the cost of instantiating an instance of the `Key` type.
仅当 `Hash::is++_++transparent` 与 `Pred::is++_++transparent` 均为有效的成员类型别名，且 `iterator` 和 `const++_++iterator` 均不能从 `K` 类型隐式转换时，该重载才会参与重载决议。标准库假定 `Hash` 可同时被 `K` 和 `Key` 类型调用，且 `Pred` 为透明谓词。该机制支持异构查找，从而避免实例化 `Key` 类型的开销。
04/23/2026
User avatar admin

Translation added
// set operations
iterator xref:#unordered_flat_set_find[find](const key_type& k);
const_iterator xref:#unordered_flat_set_find[find](const key_type& k) const;
template<class K>
iterator xref:#unordered_flat_set_find[find](const K& k);
template<class K>
const_iterator xref:#unordered_flat_set_find[find](const K& k) const;
size_type xref:#unordered_flat_set_count[count](const key_type& k) const;
template<class K>
size_type xref:#unordered_flat_set_count[count](const K& k) const;
bool xref:#unordered_flat_set_contains[contains](const key_type& k) const;
template<class K>
bool xref:#unordered_flat_set_contains[contains](const K& k) const;
std::pair<iterator, iterator> xref:#unordered_flat_set_equal_range[equal_range](const key_type& k);
std::pair<const_iterator, const_iterator> xref:#unordered_flat_set_equal_range[equal_range](const key_type& k) const;
template<class K>
std::pair<iterator, iterator> xref:#unordered_flat_set_equal_range[equal_range](const K& k);
template<class K>
std::pair<const_iterator, const_iterator> xref:#unordered_flat_set_equal_range[equal_range](const K& k) const;
// 集合操作
iterator xref:#unordered_flat_set_find[find](const key_type& k);
const_iterator xref:#unordered_flat_set_find[find](const key_type& k) const;
template<class K>
iterator xref:#unordered_flat_set_find[find](const K& k);
template<class K>
const_iterator xref:#unordered_flat_set_find[find](const K& k) const;
size_type xref:#unordered_flat_set_count[count](const key_type& k) const;
template<class K>
size_type xref:#unordered_flat_set_count[count](const K& k) const;
bool xref:#unordered_flat_set_contains[contains](const key_type& k) const;
template<class K>
bool xref:#unordered_flat_set_contains[contains](const K& k) const;
std::pair<iterator, iterator> xref:#unordered_flat_set_equal_range[equal_range](const key_type& k);
std::pair<const_iterator, const_iterator> xref:#unordered_flat_set_equal_range[equal_range](const key_type& k) const;
template<class K>
std::pair<iterator, iterator> xref:#unordered_flat_set_equal_range[equal_range](const K& k);
template<class K>
std::pair<const_iterator, const_iterator> xref:#unordered_flat_set_equal_range[equal_range](const K& k) const;
04/23/2026
User avatar admin

Translation added
```c++ template<class K> std::pair<iterator, bool> insert(const_iterator hint, K&& k); ```
```c++ template<class K> std::pair<iterator, bool> insert(const_iterator hint, K&& k); ```
04/23/2026
User avatar admin

Translation added
The assignment operator. Destroys previously existing elements, copy-assigns the hash function and predicate from `other`, copy-assigns the allocator from `other` if `Alloc::propagate_on_container_copy_assignment` exists and `Alloc::propagate_on_container_copy_assignment::value` is `true`, and finally inserts copies of the elements of `other`.
赋值操作符。该操作会销毁容器中原有的元素，并从 `other` 复制赋值哈希函数与键相等性谓词。若 `Alloc::propagate++_++on++_++container++_++copy++_++assignment` 存在，且 `Alloc::propagate++_++on++_++container++_++copy++_++assignment::value` 为 `true` ，则从 `other` 复制赋值分配器，最后插入 `other` 中所有元素的副本。
04/23/2026
User avatar admin

Translation added
```c++ template<class... Args> std::pair<iterator, bool> emplace(Args&&... args); ```
```c++ template<class... Args> std::pair<iterator, bool> emplace(Args&&... args); ```
04/23/2026
User avatar admin

Translation added
```c++ explicit unordered_flat_set(Allocator const& a); ```
```c++ explicit unordered_flat_set(Allocator const& a); ```
04/23/2026
Browse all component changes