From: David Abrahams (dave_at_[hidden])
Date: 2005-06-24 19:07:35
Darren Cook <darren_at_[hidden]> writes:
>>>>The hardest part is checking for equality. My proposal is
>>>>to follow a hash-based approach, which is effective both in
>>>>terms of complexity and space (one word per tracked object.),
>> Admittedly, hash-based checking is not 100% safe, ...
> I think this is unacceptable. If I have two objects A and B, and they do
> happen to hash to the same value, then B won't get saved.
Only if they have the same address, in which case you've done
something wrong anyway and you want an assertion.
> However good the hash code is does not matter: this would stop me
> using the serialization library in anything mission critical.
I think one of us is misunderstanding the proposal.
-- Dave Abrahams Boost Consulting www.boost-consulting.com
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk