Source strings

8,445 Strings 100%
Browse Translate
100,609 Words 100%
1,031,164 Characters 100%
This translation is being used as source strings within this component.

Strings status

Strings Words Characters
8,445 100,609 1,031,164
All strings Browse Translate Zen
8,445 100,609 1,031,164
Read-only strings Browse Translate Zen
8,445 100,609 1,031,164
Translated strings Browse Translate Zen
85 15,410 266,708
Strings with any failing checks Browse Translate Zen
85 15,410 266,708
Failing check: Ellipsis Browse Translate Zen
Component Translated Unfinished Unfinished words Unfinished characters Untranslated Checks Suggestions Comments
Benchmarks 0 0 0 0 0 0 0
Bibliography 0 0 0 0 0 0 0
Glossary Boost Unordered Documentation 0 0 0 0 0 0 0
Buckets 0 0 0 0 0 0 0
Changes 0 0 0 0 0 0 0
Compliance 0 0 0 0 0 0 0
Concurrent 100% 0 0 0 0 5 0 0
Concurrent Flat Map 100% 0 0 0 0 13 0 0
Concurrent Flat Set 100% 0 0 0 0 4 0 0
Concurrent Node Map 100% 0 0 0 0 13 0 0
Concurrent Node Set 100% 0 0 0 0 4 0 0
Copyright 0 0 0 0 0 0 0
Debuggability 0 0 0 0 0 0 0
Hash Equality 0 0 0 0 0 0 0
Hash Quality 100% 0 0 0 0 2 0 0
Hash Traits 0 0 0 0 0 0 0
Header Concurrent Flat Map 0 0 0 0 0 0 0
Header Concurrent Flat Map Fwd 0 0 0 0 0 0 0
Header Concurrent Flat Set 0 0 0 0 0 0 0
Header Concurrent Flat Set Fwd 0 0 0 0 0 0 0
Header Concurrent Node Map 0 0 0 0 0 0 0
Header Concurrent Node Map Fwd 0 0 0 0 0 0 0
Header Concurrent Node Set 0 0 0 0 0 0 0
Header Concurrent Node Set Fwd 0 0 0 0 0 0 0
Header Unordered Flat Map 0 0 0 0 0 0 0
Header Unordered Flat Map Fwd 0 0 0 0 0 0 0
Header Unordered Flat Set 0 0 0 0 0 0 0
Header Unordered Flat Set Fwd 0 0 0 0 0 0 0
Header Unordered Map 0 0 0 0 0 0 0
Header Unordered Map Fwd 0 0 0 0 0 0 0
Header Unordered Map Top 0 0 0 0 0 0 0
Header Unordered Node Map 0 0 0 0 0 0 0
Header Unordered Node Map Fwd 0 0 0 0 0 0 0
Header Unordered Node Set 0 0 0 0 0 0 0
Header Unordered Node Set Fwd 0 0 0 0 0 0 0
Header Unordered Set 0 0 0 0 0 0 0
Header Unordered Set Fwd 0 0 0 0 0 0 0
Header Unordered Set Top 0 0 0 0 0 0 0
Intro 0 0 0 0 0 0 0
Nav 0 0 0 0 0 0 0
Rationale 0 0 0 0 0 0 0
Ref 0 0 0 0 0 0 0
Regular 0 0 0 0 0 0 0
Stats 0 0 0 0 0 0 0
Structures 100% 0 0 0 0 2 0 0
Unordered Flat Map 100% 0 0 0 0 9 0 0
Unordered Flat Set 100% 0 0 0 0 3 0 0
Unordered Map 100% 0 0 0 0 9 0 0
Unordered Multimap 100% 0 0 0 0 3 0 0
Unordered Multiset 100% 0 0 0 0 3 0 0
Unordered Node Map 100% 0 0 0 0 9 0 0
Unordered Node Set 100% 0 0 0 0 3 0 0
Unordered Set 100% 0 0 0 0 3 0 0

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
Language English
Language code en
Text direction Left to right
Case sensitivity Case-sensitive
Number of speakers 1,728,003,224
4 hours ago

String statistics

Strings percent Hosted strings Words percent Hosted words Characters percent Hosted characters
Total 8,445 100,609 1,031,164
Translated 100% 8,445 100% 100,609 100% 1,031,164
Needs editing 0% 0 0% 0 0% 0
Read-only 100% 8,445 100% 100,609 100% 1,031,164
Failing checks 1% 85 15% 15,410 25% 266,708
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

100 k
Hosted words
8,445
Hosted strings
100%
Translated
1
Contributors
and previous 30 days

Trends of last 30 days

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

Resource updated
File “doc/modules/ROOT/pages/structures.adoc” was added. 3 days ago
User avatar user01

String added in the repository
Last updated 2025-10-31 21:43:27 UTC
Last updated 2025-10-31 21:43:27 UTC
3 days ago
User avatar user01

String added in the repository
For more information on implementation rationale, read the <a href="rationale.html#rationale_concurrent_containers">corresponding section</a>.
For more information on implementation rationale, read the <a href="rationale.html#rationale_concurrent_containers">corresponding section</a>.
3 days ago
User avatar user01

String added in the repository
This algorithm has very low contention both at the lookup and actual insertion phases in exchange for the possibility that computations have to be started over if some other thread interferes in the process by performing a succesful insertion beginning at the same group. In practice, the start-over frequency is extremely small, measured in the range of parts per million for some of our benchmarks.
This algorithm has very low contention both at the lookup and actual insertion phases in exchange for the possibility that computations have to be started over if some other thread interferes in the process by performing a succesful insertion beginning at the same group. In practice, the start-over frequency is extremely small, measured in the range of parts per million for some of our benchmarks.
3 days ago
User avatar user01

String added in the repository
When an available slot is located, it is preemptively occupied (its reduced hash value is set) and the insertion counter is atomically incremented: if no other thread has incremented the counter during the whole operation (which is checked by comparing with <code>c0</code>), then we’re good to go and complete the insertion, otherwise we roll back and start over.
When an available slot is located, it is preemptively occupied (its reduced hash value is set) and the insertion counter is atomically incremented: if no other thread has incremented the counter during the whole operation (which is checked by comparing with <code>c0</code>), then we’re good to go and complete the insertion, otherwise we roll back and start over.
3 days ago
User avatar user01

String added in the repository
Lookup is as described above. If lookup finds no equivalent element, search for an available slot for insertion successively locks/unlocks each group in the probing sequence.
Lookup is as described above. If lookup finds no equivalent element, search for an available slot for insertion successively locks/unlocks each group in the probing sequence.
3 days ago
User avatar user01

String added in the repository
The value of the insertion counter for the initial group in the probe sequence is locally recorded (let’s call this value <code>c0</code>).
The value of the insertion counter for the initial group in the probe sequence is locally recorded (let’s call this value <code>c0</code>).
3 days ago
User avatar user01

String added in the repository
Insertion uses the following <em>optimistic algorithm</em>:
Insertion uses the following <em>optimistic algorithm</em>:
3 days ago
User avatar user01

String added in the repository
By using atomic operations to access the group metadata, lookup is (group-level) lock-free up to the point where an actual comparison needs to be done with an element that has been previously SIMD-matched: only then is the group’s spinlock used.
By using atomic operations to access the group metadata, lookup is (group-level) lock-free up to the point where an actual comparison needs to be done with an element that has been previously SIMD-matched: only then is the group’s spinlock used.
3 days ago
User avatar user01

String added in the repository
An atomic <em>insertion counter</em> used for optimistic insertion as described below.
An atomic <em>insertion counter</em> used for optimistic insertion as described below.
3 days ago
Browse all changes for this language