# bitsetium

[![crates](https://img.shields.io/crates/v/bitsetium.svg?style=for-the-badge&label=bitsetium)](https://crates.io/crates/bitsetium)
[![docs](https://img.shields.io/badge/docs.rs-bitsetium-66c2a5?style=for-the-badge&labelColor=555555&logoColor=white)](https://docs.rs/bitsetium)
[![actions](https://img.shields.io/github/workflow/status/zakarumych/bitsetium/badge/master?style=for-the-badge)](https://github.com/zakarumych/bitsetium/actions?query=workflow%3ARust)
[![MIT/Apache](https://img.shields.io/badge/license-MIT%2FApache-blue.svg?style=for-the-badge)](COPYING)
![loc](https://img.shields.io/tokei/lines/github/zakarumych/bitsetium?style=for-the-badge)

This crate provides most useful operations on bitsets.
Provides lazy wrappers for bitset operations.
Supports large sparse bitsets with fast search for bits using hierarchical layers.

This is WIP crate. Use at own risk. Issues are welcomed.

## License

Licensed under either of

* Apache License, Version 2.0, ([license/APACHE](license/APACHE) or http://www.apache.org/licenses/LICENSE-2.0)
* MIT license ([license/MIT](license/MIT) or http://opensource.org/licenses/MIT)

at your option.

## Contributions

Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.