feedc0de/boost_unordered
1
0
Fork 0
forked from boostorg/unordered
Code Pull Requests Activity

Fill in more of the unordered container documentation.

Browse Source 
[SVN r3042]
This commit is contained in:
Daniel James
2006-07-01 22:33:29 +00:00
parent e9e503be3f
commit f6222b10e2
4 changed files with 168 additions and 62 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
doc/intro.qbk
View File

@@ -20,9 +20,8 @@ on average. The worst case complexity is linear, but that occurs rarely and
with some care, can be avoided.
Also, the existing containers require a 'less than' comparison object
to order their elements. For some data types this is impracticle.
It might be slow to calculate, or even impossible. On the other hand, in a hash
table, then elements aren't ordered - but you need an equality function
to order their elements. For some data types this is impossible to implement
or isn't practicle. For a hash table you need an equality function
and a hash function for the key.
So the __tr1__ introduced the unordered associative containers, which are