From: Beman Dawes (bdawes_at_[hidden])
Date: 2004-01-02 11:25:17
At 07:06 AM 1/2/2004, Jeremy Maitin-Shepard wrote:
>I have written an implementation of the hash table library proposed by
>Matthew Austern for standardization (and accepted into the TR). I
>believe that it is completely conformant to the proposal.
>The behavior of rehash in the case that an exception is thrown by the
>hash function is not specified in the proposal. In this
>implementation, if an exception is thrown by a hash function during a
>rehash operation, the hash table is cleared. This appears to be better
>behavior than leaving the container in state where it contains an
>arbitrary set of elements.
That seems to me a possible defect in the TR, and I've reported it to the
committee's Library Working Group.
>Thorsten Ottosen expressed interest in having such a library for the
>purpose of supporting hash tables in his pointer container library. It
>may also be useful for the purpose of having a reference implementation
>of the proposal until implementations are widely available.
It sounds like a welcome addition to Boost.
Have you given any thought to documentation and tests? While a lot can be
covered by simply referencing the committee documents, a bit of
introduction would be in order.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk