|
Boost : |
From: Michael Goldshteyn (mgoldshteyn_at_[hidden])
Date: 2008-08-13 19:47:38
"Daniel James" <daniel_james_at_[hidden]> wrote in message
news:<31f5f6790808130005s4b9df349xe34d161df2ba4bc3_at_[hidden]>...
> On 13/08/2008, Hansi <hansipet_at_[hidden]> wrote:
>
> > the link under "New Libraries" "Unordered" doesn't work.
>
> Thanks for reporting this. A lot of the 1.36 documentation is
> currently missing. We're working on it. Until it's fixed, you can find
> the unordered documentation at
> http://www.calamity.org.uk/1.36/doc/html/unordered.html (I will change
> this to a redirect once the 1.36 documentation is fine).
Speaking of Boost.Unordered, what is the reallocation strategy once a hash
table gets full, if that even makes sense (i.e., I suppose it depends on the
mechanism for collision resolution)? Is chaining used or some sort of open
addressing, in which case the hash table does need to be resized?
Thanks,
Michael Goldshteyn
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk