Boost Unordered Documentation/Structures

Source strings

58	Strings	100%	Browse Translate
1,263	Words	100%
9,418	Characters	100%

This translation is being used as source strings within this component.

Strings status

Strings Words Characters
58 1,263 9,418	All strings	Browse Translate Zen
58 1,263 9,418	Read-only strings	Browse Translate Zen
2 62 382	Strings with any failing checks	Browse Translate Zen
2 62 382	Failing check: Ellipsis	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	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` user01 authored 6 hours ago
Weblate repository	`https://boost-weblate.cloud/git/boost-unordered-documentation/nav/`
File mask	`doc/modules/ROOT/pages/structures_*.adoc`
Monolingual base language file	`doc/modules/ROOT/pages/structures.adoc`
Translation file	Download `doc/modules/ROOT/pages/structures.adoc`
Last change	Nov. 1, 2025, 12:01 a.m.
Last change made by	None
Language	English
Language code	en
Text direction	Left to right
Case sensitivity	Case-sensitive
Number of speakers	1,728,003,224
Number of plurals	2
Plural type	One/other
Plurals	Singular	1
Plurals	Plural	0, 2, 3, 4, 5, 6, 7, 8, 9, 10, …
Plural formula	`n != 1`

4 days ago

String statistics

	Strings percent	Hosted strings	Words percent	Hosted words	Characters percent	Hosted characters
Total		58		1,263		9,418
Translated	100%	58	100%	1,263	100%	9,418
Needs editing	0%	0	0%	0	0%	0
Read-only	100%	58	100%	1,263	100%	9,418
Failing checks	3%	2	4%	62	4%	382
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


Nov	Dec	Jan	Feb	Mar	Apr	May	Jun	Jul	Aug	Sep	Oct

Quick numbers

1,263

Hosted words

Hosted strings

100%

Translated

Contributors

and previous 30 days

Trends of last 30 days

+100%

Hosted words

—

+100%

Hosted strings

—

+100%

Translated

—

+100%

Contributors

—

user01 Resource updated Boost Unordered Documentation Structures English	File “`doc/modules/ROOT/pages/structures.adoc`” was added. 4 days ago
user01 String added in the repository Boost Unordered Documentation Structures English	English Last updated 2025-10-31 21:43:27 UTC English 36 characters editedCurrent translationState: Read-only Last updated 2025-10-31 21:43:27 UTC 4 days ago
user01 String added in the repository Boost Unordered Documentation Structures English	English For more information on implementation rationale, read the <a href="rationale.html#rationale_concurrent_containers">corresponding section</a>. English 142 characters editedCurrent translationState: Read-only For more information on implementation rationale, read the <a href="rationale.html#rationale_concurrent_containers">corresponding section</a>. 4 days ago
user01 String added in the repository Boost Unordered Documentation Structures English	English 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. English 400 characters editedCurrent translationState: Read-only 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
user01 String added in the repository Boost Unordered Documentation Structures English	English 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. English 364 characters editedCurrent translationState: Read-only 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
user01 String added in the repository Boost Unordered Documentation Structures English	English 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. English 174 characters editedCurrent translationState: Read-only 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
user01 String added in the repository Boost Unordered Documentation Structures English	English 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>). English 139 characters editedCurrent translationState: Read-only 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
user01 String added in the repository Boost Unordered Documentation Structures English	English Insertion uses the following <em>optimistic algorithm</em>: English 59 characters editedCurrent translationState: Read-only Insertion uses the following <em>optimistic algorithm</em>: 4 days ago
user01 String added in the repository Boost Unordered Documentation Structures English	English 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. English 245 characters editedCurrent translationState: Read-only 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
user01 String added in the repository Boost Unordered Documentation Structures English	English An atomic <em>insertion counter</em> used for optimistic insertion as described below. English 86 characters editedCurrent translationState: Read-only An atomic <em>insertion counter</em> used for optimistic insertion as described below. 4 days ago

Browse all translation changes

Quick downloads

58	File in original format as translated in the repository	AsciiDoc file
58	All strings, converted files enriched with comments; suitable for offline translation	Android String Resource	CSV	JSON	JSON nested structure file	gettext PO	iOS strings	TBX	TMX	XLIFF 1.1 with gettext extensions	XLIFF 1.1	XLSX

Search

Advanced query builder

Query examples

Review strings changed by other users	`changed:>="1 month ago" AND NOT changed_by:anonymous`	Add
Translated strings	`state:>=translated`	Add
Strings with comments	`has:comment`	Add
Strings with any failing checks	`has:check`	Add
Strings with suggestions from others	`has:suggestion AND NOT suggestion_author:anonymous`	Add
Approved strings with suggestions	`state:approved AND has:suggestion`	Add
All untranslated strings added the past month	`added:>="1 month ago" AND state:<=needs-editing`	Add
Strings changed in the past two weeks	`changed:>="2 weeks ago"`	Add

Shortcut	Action
`?`	Open available keyboard shortcuts.
`Alt` + `Home`	Navigate to the first translation in the current search.
`Alt` + `End`	Navigate to the last translation in the current search.
`Alt` + `PageUp` or `Ctrl` + `↑` or `Alt` + `↑` or `Cmd` + `↑` or	Navigate to the previous translation in the current search.
`Alt` + `PageDown` or `Ctrl` + `↓` or `Alt` + `↓` or `Cmd` + `↓` or	Navigate to the next translation in the current search.
`Ctrl` + `Enter` or `Cmd` + `Enter`	Submit current form; this works the same as pressing Save and continue while editing translation.
`Ctrl` + `Shift` + `Enter` or `Cmd` + `Shift` +`Enter`	Unmark translation as Needing edit and submit it.
`Alt` + `Enter` or `Option` + `Enter`	Submit the string as a suggestion; this works the same as pressing Suggest while editing translation.
`Ctrl` + `E` or `Cmd` + `E`	Focus on translation editor.
`Ctrl` + `U` or `Cmd` + `U`	Focus on comment editor.
`Ctrl` + `M` or `Cmd` + `M`	Shows Automatic suggestions tab.
`Ctrl` + `1` to `Ctrl` + `9` or `Cmd` + `1` to `Cmd` + `9`	Copies placeable of a given number from source string.
`Ctrl` + `M` followed by `1` to `9` or `Cmd` + `M` followed by `1` to `9`	Copy the machine translation of a given number to current translation.
`Ctrl` + `I` followed by `1` to `9` or `Cmd` + `I` followed by `1` to `9`	Ignore one item in the list of failing checks.
`Ctrl` + `J` or `Cmd` + `J`	Shows the Nearby strings tab.
`Ctrl` + `S` or `Cmd` + `S`	Focus on search field.
`Ctrl` + `O` or `Cmd` + `O`	Copy the source string.
`Ctrl` + `Y` or `Cmd` + `Y`	Toggle the Needs editing checkbox.
`→`	Browse the next translation string.
`←`	Browse the previous translation string.

Source strings

Strings status

Summary

String statistics

Activity in last 12 months

Quick numbers

Trends of last 30 days

Quick downloads

Customize download

Search