Re: [boost] [dynamic_bitset] Comparison operators without assertions

Subject: Re: [boost] [dynamic_bitset] Comparison operators without assertions
From: degski (degski_at_[hidden])
Date: 2017-05-11 04:24:05

On 11 May 2017 at 04:15, Edward Diener via Boost <boost_at_[hidden]>
wrote:

> On 5/10/2017 8:28 PM, Peter Bartlett via Boost wrote:
> Or do you mean to suggest that your second choice would compare the last
> min(N,M) bits from left to right to determine ordering rather than the
> current right to left ?
>

Seems to me that comparing bitsets of different sizes makes little 'sense',
but, having said that, having an order (any) in bitsets of different size
is the right thing to have, as it allows for putting those bitsets in
std::(multi_)map/std::(multi_)set. The choice of Left/Right or Right/Left
should I think be guided by what is the cheapest way to compare them, as
the 'most significant (to the user) bits' might be on the left, on the
right, in the middle or even on both ends. I would go for memcmp().

degski
-- 
"*Ihre sogenannte Religion wirkt bloß wie ein Opiat reizend, betäubend,
Schmerzen aus Schwäche stillend.*" - Novalis 1798