boostorg/unordered
1
0
Fork 1
mirror of https://github.com/boostorg/unordered.git synced 2025-07-30 11:27:15 +02:00
Code Issues Packages Projects Releases Wiki Activity

Some more typos

Browse Source
This commit is contained in:
Daniel James
2017-04-12 08:25:14 +01:00
parent 7e940e6e45
commit 51cd1cd2af
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
doc/rationale.qbk
View File

@ -13,7 +13,7 @@ containers in the draft standard, so the interface was fixed. But there are
still some implementation decisions to make. The priorities are still some implementation decisions to make. The priorities are
conformance to the standard and portability. conformance to the standard and portability.
The [@http://en.wikipedia.org/wiki/Hash_table wikipedia article on hash tables] The [@http://en.wikipedia.org/wiki/Hash_table Wikipedia article on hash tables]
has a good summary of the implementation issues for hash tables in general. has a good summary of the implementation issues for hash tables in general.
[h2 Data Structure] [h2 Data Structure]
@ -100,7 +100,7 @@ knowledge of the number of bits in the hash value, so it isn't portable enough
to use as a default. It can applicable in certain cases so the containers to use as a default. It can applicable in certain cases so the containers
have a policy based implementation that can use this alternative technique. have a policy based implementation that can use this alternative technique.
Currently this is only done on 64 bit architecures, where prime number Currently this is only done on 64 bit architectures, where prime number
modulus can be expensive. Although this varies depending on the architecture, modulus can be expensive. Although this varies depending on the architecture,
so I probably should revisit it. so I probably should revisit it.