Translation status

24 Strings 79%
Browse Translate
469 Words 97%
4,451 Characters 91%

Strings status

Strings Words Characters
24 469 4,451
All strings Browse Translate Zen
24 469 4,451
Translated strings Browse Translate Zen
5 12 381
Strings with any failing checks Browse Translate Zen
5 12 381
Translated strings with any failing checks Browse Translate Zen
5 12 381
Failing check: Unchanged translation Browse Translate Zen

Summary

Project website www.boost.org
Instructions for translators

Please translate the Boost.Unordered documentation. Maintain technical accuracy and follow AsciiDoc formatting conventions.
Project maintainers1 User avatar user01
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:Giggly19890103/unordered.git
Repository branch develop
Last commit in Weblate Added translation using Weblate (Chinese (Simplified Han script)) 9454433
User avatar user01 authored 6 hours ago
Weblate repository https://boost-weblate.cloud/git/boost-unordered-documentation/nav/
File mask doc/modules/ROOT/pages/intro_*.adoc
Monolingual base language file doc/modules/ROOT/pages/intro.adoc
Translation file Download doc/modules/ROOT/pages/intro_zh_Hans.adoc
Last change Nov. 4, 2025, 4:28 p.m.
Last change made by Background commit
Language Chinese (Simplified Han script)
Language code zh_Hans
Text direction Left to right
Case sensitivity Case-insensitive
Number of speakers 1,286,444,445
Number of plurals 1
Plural type None
Plurals
Plural formula 0
8 hours ago

String statistics

Strings percent Hosted strings Words percent Hosted words Characters percent Hosted characters
Total 24 469 4,451
Translated 100% 24 100% 469 100% 4,451
Needs editing 0% 0 0% 0 0% 0
Read-only 0% 0 0% 0 0% 0
Failing checks 20% 5 2% 12 8% 381
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 0 changes
NovDecJanFebMarAprMayJunJulAugSepOct

Quick numbers

469
Hosted words
24
Hosted strings
20%
Translated
1
Contributors
and previous 30 days

Trends of last 30 days

+100%
Hosted words
—
+100%
Hosted strings
—
+20%
Translated
—
+100%
Contributors
—
User avatar weblate:commit

Changes committed
Changes committed 8 hours ago
User avatar user01

Translation changed
Storing an object in an unordered associative container requires both a key equality function and a hash function. The default function objects in the standard containers support a few basic types including integer types, floating point types, pointer types, and the standard strings. Since Boost.Unordered uses <a href="../../../../container_hash/index.html" target="_blank" rel="noopener">boost::hash</a> it also supports some other types, including standard containers. To use any types not supported by these methods you have to extend Boost.Hash to support the type or use your own custom equality predicates and hash functions. See the <a href="hash_equality.html#hash_equality">Equality Predicates and Hash Functions</a>, section for more details.
在无序关联容器中存储对象需要同时具备键相等性函数与哈希函数。标准容器中的默认函数对象支持若干基础类型，包括整数类型、浮点类型、指针类型以及标准字符串类型。由于Boost.Unordered采用<a href="../../../../container_hash/index.html" target="_blank" rel="noopener">boost::hash</a>，它还能支持其他类型（包括标准容器）。若要使用这些方法不支持的任意类型，那就需要扩展 Boost.Hash， 以支持该类型，或使用自定义的相等性谓词与哈希函数。更多详细信息请参阅<a href="hash_equality.html#hash_equality">相等性谓词与哈希函数</a>章节。
9 hours ago
User avatar user01

Translation completed
Translation completed 9 hours ago
User avatar user01

Translation changed
Last updated 2025-10-31 21:32:30 UTC
最后更新于2025年10月31日 21:32:30 UTC
9 hours ago
User avatar user01

Translation changed
Storing an object in an unordered associative container requires both a key equality function and a hash function. The default function objects in the standard containers support a few basic types including integer types, floating point types, pointer types, and the standard strings. Since Boost.Unordered uses <a href="../../../../container_hash/index.html" target="_blank" rel="noopener">boost::hash</a> it also supports some other types, including standard containers. To use any types not supported by these methods you have to extend Boost.Hash to support the type or use your own custom equality predicates and hash functions. See the <a href="hash_equality.html#hash_equality">Equality Predicates and Hash Functions</a>, section for more details.
在无序关联容器中存储对象需要同时具备键值相等性函数和与哈希函数。标准容器中的默认函数对象支持若干基础类型（，包括整数类型、浮点类型、指针类型以及标准字符串）类型。由于Boost.Unordered使采用<a href="../../../../container_hash/index.html" target="_blank" rel="noopener">boost::hash</a>，它还能支持其他类型（包括标准容器）。若需要使用这些方法不受支持的任意类型，必须那就需要扩展 Boost.Hash或 以支持该类型，或使用自定义的相等性谓词与哈希函数。详见更多详细信息请参阅<a href="hash_equality.html#hash_equality">相等谓词与哈希函数</a>章节。
9 hours ago
User avatar user01

Translation changed
namespace boost {
template &lt;
class Key,
class Hash = boost::hash&lt;Key&gt;,
class Pred = std::equal_to&lt;Key&gt;,
class Alloc = std::allocator&lt;Key&gt; &gt;
class unordered_set;
// same for unordered_multiset, unordered_flat_set, unordered_node_set,
// concurrent_flat_set and concurrent_node_set

template &lt;
class Key, class Mapped,
class Hash = boost::hash&lt;Key&gt;,
class Pred = std::equal_to&lt;Key&gt;,
class Alloc = std::allocator&lt;std::pair&lt;Key const, Mapped&gt; &gt; &gt;
class unordered_map;
// same for unordered_multimap, unordered_flat_map, unordered_node_map,
// concurrent_flat_map and concurrent_node_map
}
namespace boost {
template &lt;
class Key,
class Hash = boost::hash&lt;Key&gt;,
class Pred = std::equal_to&lt;Key&gt;,
class Alloc = std::allocator&lt;Key&gt; &gt;
class unordered_set;
// unordered_multiset, unordered_flat_set, unordered_node_set,
// concurrent_flat_set 和 concurrent_node_set 同理

template &lt;
class Key, class Mapped,
class Hash = boost::hash&lt;Key&gt;,
class Pred = std::equal_to&lt;Key&gt;,
class Alloc = std::allocator&lt;std::pair&lt;Key const, Mapped&gt; &gt; &gt;
class unordered_map;
// unordered_multimap, unordered_flat_map, unordered_node_map,
// concurrent_flat_map 和 concurrent_node_map 同理
}
9 hours ago
User avatar user01

Translation changed
All sets and maps in Boost.Unordered are instantiatied similarly as <code>std::unordered_set</code> and <code>std::unordered_map</code>, respectively:
Boost.Unordered中的所有集合与映射的实例化方式分别类似于均分别参照 <code>std::unordered_set</code>和 和 <code>std::unordered_map</code> 的方式进行实例化：
9 hours ago
User avatar user01

Translation changed
Finally, <strong>concurrent containers</strong> are designed and implemented to be used in high-performance multithreaded scenarios. Their interface is radically different from that of regular C++ containers. Flat and node-based variants are provided.
最后，<strong>并发容器</strong>专为高性能多线程场景设计与实现，其接口与常规C++容器截然不同。存在根本性差异。该系列同时提供扁平与基于节点两种变体。
9 hours ago
User avatar user01

Translation changed
<strong>Closed-addressing containers</strong> are fully compliant with the C++ specification for unordered associative containers and feature one of the fastest implementations in the market within the technical constraints imposed by the required standard interface.
<strong>闭寻址式容器</strong>完全符合C++无序关联容器规范，并在标准接口的技术约束范围内提供了业界领先的运行性能。
9 hours ago
User avatar user01

Translation changed
<strong>Open-addressing containers</strong> rely on much faster data structures and algorithms (more than 2 times faster in typical scenarios) while slightly diverging from the standard interface to accommodate the implementation. There are two variants: <strong>flat</strong> (the fastest) and <strong>node-based</strong>, which provide pointer stability under rehashing at the expense of being slower.
<strong>开放寻址式容器</strong>采用了更高效的数据结构与算法（典型场景下性能提升2倍以上），同时为了适配实现方案而对标准接口做了细微调整。该类容器包含两种变体：<strong>扁平式</strong>（最快）与<strong>基于节点式</strong>，后者在重新哈希时能保持指针稳定性，但性能会有所下降。
9 hours ago
Browse all translation changes