A simple bitset container for Rust
Please read the API documentation here
__
__ https://docs.rs/fixedbitset/
|buildstatus| |crates|_
.. |buildstatus| image:: https://github.com/petgraph/fixedbitset/workflows/Continuous%20integration/badge.svg?branch=master .. _buildstatus: https://github.com/petgraph/fixedbitset/actions
.. |crates| image:: http://meritbadge.herokuapp.com/fixedbitset .. _crates: https://crates.io/crates/fixedbitset
0.3.2
ones
using trailing_zeroes
by @vks0.3.1
with_capacity_and_blocks
0.3.0
with_capacity_and_blocks
by @luizirberdifference_with
by @sunshowersBinary
and Display
traits by @Dolphindalttoggle_range
by @wirelyre0.2.0
symmetric_difference
, union_with
, intersection_with
by @jrraymondis_subset
, is_superset
, is_disjoint
by @nwn.toggle(i)
method by @ShiroUsagi-san0.1.9
&
and union: |
operator implementations by @jrraymond0.1.8
#[inline]
on the ones iteratorinsert_range, set_range
0.1.7
.insert_range
, .set_range
by @kennytm0.1.6
.ones()
by @mneumann.count_ones()
where it would erronously have an
out-of-bounds panic for even block endpoints0.1.5
.count_ones(range)
.0.1.4
.copy_bit(from, to)
so that it is in line
with the documentation. The from
bit does not need to be in bounds..grow()
to use Vec::resize
internally.0.1.3
.put()
to enable a bit and return previous value0.1.2
.copy_bit()
(by fuine)0.1.1
0.1.0
.grow()
Dual-licensed to be compatible with the Rust project.
Licensed under the Apache License, Version 2.0 http://www.apache.org/licenses/LICENSE-2.0 or the MIT license http://opensource.org/licenses/MIT, at your option. This file may not be copied, modified, or distributed except according to those terms.