Project Translated Unfinished Unfinished words Unfinished characters Untranslated Checks Suggestions Comments
Boost Unordered Documentation 100% 0 0 0 0 85 0 0

Summary

Language code en
Aliased language codes base, en_en, en_us, eng, enp, source
English name of the language English
Text direction Left to right
Case sensitivity Case-sensitive
Number of speakers 1,728,003,224
Plural: Default plural 53 translations
Number of plurals 2
Plural type One/other
Plurals Singular 1
Plural 0, 2, 3, 4, 5, 6, 7, 8, 9, 10, …
Plural formula n != 1
Plural: Qt Linguist plural 0 translations
Number of plurals 2
Plural type One/other
Plurals Singular 1
Plural 0, 2, 3, 4, 5, 6, 7, 8, 9, 10, …
Plural formula (n != 1)
6 hours ago

String statistics

Strings percent Hosted strings Words percent Hosted words Characters percent Hosted characters
Total 8,445 100,609 1,031,164
Approved 0% 0 0% 0 0% 0
Waiting for review 0% 0 0% 0 0% 0
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. 4 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
4 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>.
4 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.
4 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.
4 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.
4 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>).
4 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>:
4 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.
4 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.
4 days ago
Browse all changes for this language