| Category: Rust / Data structures |
| Watchers: 11 |
| Star: 105 |
| Fork: 31 |
| Last update: Dec 7, 2023 |
Provides hierarchical bit sets, which allow very fast iteration on sparse data structures.
Just add this to your Cargo.toml:
[dependencies]
hibitset = "0.6"
This library is licensed under the Apache License 2.0, see the LICENSE file for more information.
Improves parallel iterators splitting behaviour and refactors it.
The improvement: Before 1000000011111111 was split to 10000000 and to 11111111 After 10001111 is split to 10000000111 and to 11111
This change is 
Should propably add benchmarks for it.
slide-rs/specs#120
Resolves #24
This change is
This crate has been stable for a pretty long time. I think it's time to make it 1.0
Extremely useful for external expansion on the bitsets.
e.g. I was creating a singular bit filter, which could easily benefit from not constructing an entire BitSet.
Required for WIP fix for https://github.com/slide-rs/specs/issues/593
I have several projects which uses collections of BitSet objects intensely, and I need to store them in hashsets or hashmaps (or store structures containing BitSet objects in hashsets or hashmaps). At this time this is not possible. I plan to clone the repo and implement it. If it is convincing I will probably make a pull request.
This crashes...
use hibitset::AtomicBitSet;
fn main() {
let bitset = AtomicBitSet::new();
println!("bitset = {:?}", bitset);
}
The proposed fix implements Debug for AtomicBlock so that the error doesn't happen - please check the output to make sure it is what you want it to be for internal debugging.
It also implements AtomicBitSet Debug manually to be the output of iter() - which I felt was more helpful to users of the library.
Here is the PR for the serde feature. I added a simple example using bincode in the README. There is no test, I could do that easily but it would mean adding another dev dependency, not sure if you wanted that in the codebase.
The version has not been changed, that should be done if you decide this to put it in a release.
Is there a way to serialize hibitset to bytes? I could implement Serde and use bincode, but wanted to know if there is an existing way to do this.
I tested adding optional serde to the source code and it works fine, if you like I can fork and submit a pull request.
I think, like any container, BitSetLike, or at least BitSet, should have a len method.
Code:
use hibitset::*;
fn main() {
let mut a = BitSet::new();
let mut b = BitSet::new();
assert!( a.is_empty() && b.is_empty(), "This shouldn't happen!");
a.add(0);
b.add(10);
assert!( !a.is_empty() && !b.is_empty(), "This also shouldn't happen!");
assert!( (a&b).is_empty(), "This definetely shouldn't happen!");
}
Output:
thread 'main' panicked at 'This definetely shouldn't happen!', src\main.rs:10:5
note: Run with `RUST_BACKTRACE=1` environment variable to display a backtrace.
error: process didn't exit successfully: `target\debug\rust-test.exe` (exit code: 101)
See changelog: https://github.com/amethyst/hibitset/blob/master/CHANGELOG.md#064-2023-07-16
Or list of PRs:
Full Changelog: https://github.com/amethyst/hibitset/compare/0.6.3...0.6.4
