Re: [hash2] Difference from paper: HashAlgorithm interface vs. function object

From: Julien Blanc (julien.blanc_at_[hidden])
Date: 2024-12-12 06:58:15

Le mercredi 11 décembre 2024 à 19:31 +0200, Peter Dimov via Boost a
écrit :
> You've already stated that you don't think copy construction should
> be required. But copy construction is required by the current
> implementation of hash_append_unordered_range.

The way you phrase it make it sounds like it could be implemented
without requiring copy construction. Is that poor understanding from my
side? Or would it incurs some other penalty (e.g. performance) if that
requirement held and hash_append_unordered_range was implemented
without requiring copy construction? In the latter case I think it
would be worth explaining in the documentation.

Regards,

Julien