Implement custom behavior for PartialEq, Eq, PartialOrd, Ord and Hash

[sitegui]

Hi,

Following up on #44, here is my take on implementing PartialEq, Eq, PartialOrd, Ord and Hash. This PR goes beyond the scope of the issue, so all those related traits would be in sync.

This is a behavior change that, in practice, makes FixedBitSet behave like a BTreeSet<usize>, whose elements are the items returned by FixedBitSet::ones(). The change can be breaking for some pieces of code that depended on the old behavior, even if it was undocumented and arguably surprising.

For example, using FixedBitSet in map will behave differently:

let mut map = HashMap::new();
map.insert(FixedBitSet::with_capacity(0), 17);
map.insert(FixedBitSet::with_capacity(10), 17);
dbg!(map.len()); // before = 2, now = 1

Fix #44

Please tell me what you think,
Best regards,

[bluss]

While conceptually this algorithm for comparison might be good, I'm afraid that it is slow. Comparison should be based on comparing the blocks, I would guess.

[sitegui]

It makes sense!

I've rewrote the code to extract the trimmed slice of blocks instead of using the iterator of ones.

[jrraymond]

This results in a somewhat awkward condition that FixedBitSets with different sizes would compare equal:

    /// Return the length of the `FixedBitSet` in bits.
    #[inline]
    pub fn len(&self) -> usize { self.length }

We could also update the len function to be the number of set bits, instead of just the number of bits.

[aguinet]

Any chance this behavior will make it to main? I am indeed making HashSet<FixedBitSet>, and I have very nasty inconsistencies/bugs because the way Hash/PartialEq behave today, based on length!