fixedbitset

fixedbitset copied to clipboard

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

2

Hi, Following up on https://github.com/petgraph/fixedbitset/issues/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...

sitegui

Fixes #45

sitegui

This adds an optional (disabled by default) feature, which when enabled adds an implementation of `bitvec`'s `BitSlice` trait. It aims to add some cross-compatibility to the two crates, as well...

hexane360

Implement bit iterator

1

I think a bit iterator that returns true and false for each bit correspondingly would be a nice addition to this library. I was in need of one which is...

Veykril

mneumann

Add zeros iterator

3

This closes #7 and #9. I have written the code such that it 'just works' and is not pathological in terms of speed. As mentioned in #9 once i will...

fuine

Add find_first_unset_bit function

1

Hello, i would like to implement a function which would yield me the offset of the first unset bit. Something like `find_first_unset_bit(&self) -> Option`. I thought about making it more...

fuine

Add iter_ones() and iter_zeros() iterator.

1

Having an iterator over the bits that are set to ```1``` (or ```0```) would be a nice addition. For example, it would speed up [this loop](https://github.com/mneumann/munkres-rs/blob/master/src/coverage.rs#L42-L45) of my Kuhn-Munkres implementation....

mneumann

There are options like `core::arch::is_x86_feature_detected` which can detect which instruction sets are available. Unfortunately the checks cannot be done inside each function call due to the cost of feature detection....

james7132

Efficient creation of all-ones bitset

8

I need to create a bitset of known size with all bits set. Currently I do it with: ```rust fn ones_with_capacity(bits: usize) -> FixedBitSet { let mut everything = FixedBitSet::with_capacity(bits);...

hniksic