boostorg/unordered
1
0
Fork 1
mirror of https://github.com/boostorg/unordered.git synced 2026-05-19 23:24:44 +02:00
Code Issues Packages Projects Releases Wiki Activity

Some more work on the unordered containers documentation.

Browse Source 
[SVN r2889]
This commit is contained in:
Daniel James
2006-03-19 14:45:05 +00:00
parent 432527dd2a
commit 66f2cc3e8b
5 changed files with 61 additions and 70 deletions
Download Patch File Download Diff File Expand all files Collapse all files
doc/rationale.qbk
+1 -3
View File
@@ -9,7 +9,7 @@ containers in TR1, so the interface was fixed. But there are still some
implementation desicions to make. The priorities for the library are
conformance to the standard and portability.
[section Number of Buckets]
[h2 Number of Buckets]
There are two popular methods for choosing the number of buckets in a hash
table. One is to have a prime number of buckets. This allows .... (TODO)
@@ -28,5 +28,3 @@ Method which don't tend to work as well as taking the modulous of a prime,
have little efficiency advantage and don't work well for (TODO: what are they called?).
[endsect]
[endsect]