#![cfg_attr(all(test, feature = "nightly"), feature(test))]
#[cfg(all(test, feature = "nightly"))]
extern crate rand;
#[cfg(all(test, feature = "nightly"))]
extern crate test;
pub use generic_array;
pub use typenum;
use bit_vec::BitBlock;
use generic_array::GenericArray;
use std::cmp;
use std::cmp::Ordering;
use std::fmt;
use std::hash;
use std::iter::FromIterator;
use std::slice;
use std::{u8, usize};
use typenum::{NonZero, Quot, Sub1, Sum, Unsigned, U16, U32, U64, U8};
type MutBlocks<'a, B> = slice::IterMut<'a, B>;
pub type StorageLen<NBits, B> = Quot<Sub1<Sum<NBits, BitsInOut<B>>>, BitsInOut<B>>;
pub type BlocksNum<NBits, B> = <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<
typenum::B1,
>>::Output as Div<<B as BitsIn>::Output>>::Output;
use std::ops::*;
pub trait BitsIn {
type Output;
}
pub type BitsInOut<A> = <A as BitsIn>::Output;
macro_rules! bitsin_prim {
($(($prim: ty, $bits: ty)),*) => ($(
impl BitsIn for $prim { type Output = $bits; }
)*)
}
bitsin_prim!((u8, U8), (u16, U16), (u32, U32), (u64, U64));
#[cfg(target_pointer_width = "32")]
bitsin_prim!((usize, U32));
#[cfg(target_pointer_width = "64")]
bitsin_prim!((usize, U64));
fn reverse_bits(byte: u8) -> u8 {
let mut result = 0;
for i in 0..u8::bits() {
result |= ((byte >> i) & 1) << (u8::bits() - 1 - i);
}
result
}
static TRUE: bool = true;
static FALSE: bool = false;
pub struct BitArray<B: BitsIn, NBits: Unsigned + NonZero>
where
NBits: Add<<B as BitsIn>::Output>,
<NBits as Add<<B as BitsIn>::Output>>::Output: Sub<typenum::B1>,
<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output:
Div<<B as BitsIn>::Output>,
BlocksNum<NBits, B>: generic_array::ArrayLength<B>,
{
storage: GenericArray<
B,
StorageLen<NBits, B>,
>,
}
impl<B: BitsIn + BitBlock + Default, NBits: Unsigned + NonZero> Index<usize> for BitArray<B, NBits>
where
NBits: Add<<B as BitsIn>::Output>,
<NBits as Add<<B as BitsIn>::Output>>::Output: Sub<typenum::B1>,
<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output:
Div<<B as BitsIn>::Output>,
<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output as Div<
<B as BitsIn>::Output,
>>::Output: generic_array::ArrayLength<B>,
{
type Output = bool;
#[inline]
fn index(&self, i: usize) -> &bool {
if self.get(i).expect("index out of bounds") {
&TRUE
} else {
&FALSE
}
}
}
fn mask_for_bits<B: BitBlock>(bits: usize) -> B {
(!B::zero()) >> ((B::bits() - bits % B::bits()) % B::bits())
}
impl<B: BitsIn + BitBlock + Default, NBits: Unsigned + NonZero> BitArray<B, NBits>
where
NBits: Add<<B as BitsIn>::Output>,
<NBits as Add<<B as BitsIn>::Output>>::Output: Sub<typenum::B1>,
<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output:
Div<<B as BitsIn>::Output>,
<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output as Div<
<B as BitsIn>::Output,
>>::Output: generic_array::ArrayLength<B>,
{
pub fn new() -> Self {
Default::default()
}
pub fn from_elem(bit: bool) -> Self {
let mut bit_array = BitArray::new();
if bit {
bit_array.set_all();
}
bit_array.fix_last_block();
bit_array
}
pub fn from_bytes(bytes: &[u8]) -> Self {
let total_bits = bytes
.len()
.checked_mul(u8::bits())
.expect("capacity overflow");
let mut bit_array = BitArray::new();
let total_array_bits = bit_array.storage.len() * B::bits();
assert!(
total_bits <= total_array_bits,
"bit_array with {:?} bits cannot handle byte array of {:?} bits",
total_array_bits,
total_bits
);
let complete_words = bytes.len() / B::bytes();
let extra_bytes = bytes.len() % B::bytes();
for i in 0..complete_words {
let mut accumulator = B::zero();
for idx in 0..B::bytes() {
accumulator = accumulator
| (B::from_byte(reverse_bits(bytes[i * B::bytes() + idx])) << (idx * 8))
}
*bit_array.storage.get_mut(i).unwrap() = accumulator;
}
if extra_bytes > 0 {
let mut last_word = B::zero();
for (i, &byte) in bytes[complete_words * B::bytes()..].iter().enumerate() {
last_word = last_word | (B::from_byte(reverse_bits(byte)) << (i * 8));
}
*bit_array.storage.last_mut().unwrap() = last_word;
}
bit_array
}
pub fn from_fn<F>(mut f: F) -> Self
where
F: FnMut(usize) -> bool,
{
let mut bit_array = BitArray::from_elem(false);
for i in 0..NBits::to_usize() {
bit_array.set(i, f(i));
}
bit_array
}
#[inline]
fn process<F>(&mut self, other: &BitArray<B, NBits>, mut op: F) -> bool
where
F: FnMut(B, B) -> B,
{
assert_eq!(self.storage.len(), other.storage.len());
let mut changed_bits = B::zero();
for (a, b) in self.blocks_mut().zip(other.blocks()) {
let w = op(*a, b);
changed_bits = changed_bits | (*a ^ w);
*a = w;
}
changed_bits != B::zero()
}
fn blocks_mut(&mut self) -> MutBlocks<B> {
self.storage.iter_mut()
}
pub fn blocks(&self) -> Blocks<B> {
Blocks {
iter: self.storage.iter(),
}
}
pub fn storage(&self) -> &[B] {
&self.storage
}
pub unsafe fn storage_mut(&mut self) -> &mut [B] {
&mut self.storage
}
fn fix_last_block(&mut self) {
let extra_bits = Self::len() % B::bits();
if extra_bits > 0 {
let mask = (B::one() << extra_bits) - B::one();
let block = &mut self.storage[Self::block_len() - 1];
*block = *block & mask;
}
}
#[inline]
pub fn get(&self, i: usize) -> Option<bool> {
if i >= NBits::to_usize() {
return None;
}
let w = i / B::bits();
let b = i % B::bits();
self.storage
.get(w)
.map(|&block| (block & (B::one() << b)) != B::zero())
}
#[inline]
pub fn set(&mut self, i: usize, x: bool) {
assert!(
i < NBits::to_usize(),
"index out of bounds: {:?} >= {:?}",
i,
NBits::to_usize()
);
let w = i / B::bits();
let b = i % B::bits();
let flag = B::one() << b;
let val = if x {
self.storage[w] | flag
} else {
self.storage[w] & !flag
};
self.storage[w] = val;
}
#[inline]
pub fn set_all(&mut self) {
for w in self.storage.deref_mut() {
*w = !B::zero();
}
self.fix_last_block();
}
#[inline]
pub fn negate(&mut self) {
for w in self.storage.deref_mut() {
*w = !*w;
}
self.fix_last_block();
}
#[inline]
pub fn union(&mut self, other: &Self) -> bool {
self.process(other, |w1, w2| (w1 | w2))
}
#[inline]
pub fn intersect(&mut self, other: &Self) -> bool {
self.process(other, |w1, w2| (w1 & w2))
}
#[inline]
pub fn difference(&mut self, other: &Self) -> bool {
self.process(other, |w1, w2| (w1 & !w2))
}
#[inline]
pub fn symmetric_difference(&mut self, other: &Self) -> bool {
self.process(other, |w1, w2| (w1 ^ w2))
}
pub fn count_ones(&self) -> usize {
self.blocks().map(|elem| elem.count_ones()).sum()
}
pub fn all(&self) -> bool {
let mut last_word = !B::zero();
self.blocks().all(|elem| {
let tmp = last_word;
last_word = elem;
tmp == !B::zero()
}) && (last_word == mask_for_bits(NBits::to_usize()))
}
#[inline]
pub fn iter(&self) -> Iter<B, NBits> {
Iter {
bit_array: self,
range: 0..NBits::to_usize(),
}
}
pub fn none(&self) -> bool {
self.blocks().all(|w| w == B::zero())
}
#[inline]
pub fn any(&self) -> bool {
!self.none()
}
pub fn to_bytes(&self) -> Vec<u8> {
fn bit<B: BitBlock + BitsIn + Default, NBits: Unsigned + NonZero>(
bit_array: &BitArray<B, NBits>,
byte: usize,
bit: usize,
) -> u8
where
NBits: Add<<B as BitsIn>::Output>,
<NBits as Add<<B as BitsIn>::Output>>::Output: Sub<typenum::B1>,
<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output:
Div<<B as BitsIn>::Output>,
<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output as Div<
<B as BitsIn>::Output,
>>::Output: generic_array::ArrayLength<B>,
{
let offset = byte * 8 + bit;
if offset >= NBits::to_usize() {
0
} else {
(bit_array.get(offset).unwrap() as u8) << (7 - bit)
}
}
let len = NBits::to_usize() / 8 + if NBits::to_usize() % 8 == 0 { 0 } else { 1 };
(0..len)
.map(|i| {
bit(self, i, 0)
| bit(self, i, 1)
| bit(self, i, 2)
| bit(self, i, 3)
| bit(self, i, 4)
| bit(self, i, 5)
| bit(self, i, 6)
| bit(self, i, 7)
})
.collect()
}
pub fn eq_vec(&self, v: &[bool]) -> bool {
self.iter().zip(v.iter().cloned()).all(|(b1, b2)| b1 == b2)
}
#[inline]
pub fn len() -> usize {
NBits::to_usize()
}
#[inline]
pub fn block_len() -> usize {
BlocksNum::<NBits, B>::to_usize()
}
#[inline]
pub fn is_empty() -> bool {
Self::len() == 0
}
#[inline]
pub fn clear(&mut self) {
for w in self.storage.deref_mut() {
*w = B::zero();
}
}
}
impl<B: BitsIn + BitBlock + Default, NBits: Unsigned + NonZero> Default for BitArray<B, NBits>
where
NBits: Add<<B as BitsIn>::Output>,
<NBits as Add<<B as BitsIn>::Output>>::Output: Sub<typenum::B1>,
<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output:
Div<<B as BitsIn>::Output>,
<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output as Div<
<B as BitsIn>::Output,
>>::Output: generic_array::ArrayLength<B>,
{
fn default() -> Self {
BitArray {
storage: GenericArray::default(),
}
}
}
impl<B: BitsIn + BitBlock + Default, NBits: Unsigned + NonZero> FromIterator<bool>
for BitArray<B, NBits>
where
NBits: Add<<B as BitsIn>::Output>,
<NBits as Add<<B as BitsIn>::Output>>::Output: Sub<typenum::B1>,
<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output:
Div<<B as BitsIn>::Output>,
<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output as Div<
<B as BitsIn>::Output,
>>::Output: generic_array::ArrayLength<B>,
{
fn from_iter<I: IntoIterator<Item = bool>>(iter: I) -> Self {
let mut ret: Self = Default::default();
for (i, val) in iter.into_iter().enumerate() {
ret.set(i, val);
}
ret
}
}
impl<B: BitsIn + BitBlock + Default, NBits: Unsigned + NonZero> Clone for BitArray<B, NBits>
where
NBits: Add<<B as BitsIn>::Output>,
<NBits as Add<<B as BitsIn>::Output>>::Output: Sub<typenum::B1>,
<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output:
Div<<B as BitsIn>::Output>,
<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output as Div<
<B as BitsIn>::Output,
>>::Output: generic_array::ArrayLength<B>,
{
#[inline]
fn clone(&self) -> Self {
BitArray {
storage: self.storage.clone(),
}
}
#[inline]
fn clone_from(&mut self, source: &Self) {
self.storage.clone_from(&source.storage);
}
}
impl<B: BitsIn + BitBlock + Default, NBits: Unsigned + NonZero> PartialOrd for BitArray<B, NBits>
where
NBits: Add<<B as BitsIn>::Output>,
<NBits as Add<<B as BitsIn>::Output>>::Output: Sub<typenum::B1>,
<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output:
Div<<B as BitsIn>::Output>,
<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output as Div<
<B as BitsIn>::Output,
>>::Output: generic_array::ArrayLength<B>,
{
#[inline]
fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
Some(self.cmp(other))
}
}
impl<B: BitsIn + BitBlock + Default, NBits: Unsigned + NonZero> Ord for BitArray<B, NBits>
where
NBits: Add<<B as BitsIn>::Output>,
<NBits as Add<<B as BitsIn>::Output>>::Output: Sub<typenum::B1>,
<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output:
Div<<B as BitsIn>::Output>,
<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output as Div<
<B as BitsIn>::Output,
>>::Output: generic_array::ArrayLength<B>,
{
#[inline]
fn cmp(&self, other: &Self) -> Ordering {
let mut a = self.iter();
let mut b = other.iter();
loop {
match (a.next(), b.next()) {
(Some(x), Some(y)) => match x.cmp(&y) {
Ordering::Equal => {}
otherwise => return otherwise,
},
(None, None) => return Ordering::Equal,
(None, _) => return Ordering::Less,
(_, None) => return Ordering::Greater,
}
}
}
}
impl<B: BitsIn + BitBlock + Default, NBits: Unsigned + NonZero> fmt::Debug for BitArray<B, NBits>
where
NBits: Add<<B as BitsIn>::Output>,
<NBits as Add<<B as BitsIn>::Output>>::Output: Sub<typenum::B1>,
<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output:
Div<<B as BitsIn>::Output>,
<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output as Div<
<B as BitsIn>::Output,
>>::Output: generic_array::ArrayLength<B>,
{
fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {
for bit in self {
write!(fmt, "{}", if bit { 1 } else { 0 })?;
}
Ok(())
}
}
impl<B: BitsIn + BitBlock + Default, NBits: Unsigned + NonZero> hash::Hash for BitArray<B, NBits>
where
NBits: Add<<B as BitsIn>::Output>,
<NBits as Add<<B as BitsIn>::Output>>::Output: Sub<typenum::B1>,
<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output:
Div<<B as BitsIn>::Output>,
<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output as Div<
<B as BitsIn>::Output,
>>::Output: generic_array::ArrayLength<B>,
{
fn hash<H: hash::Hasher>(&self, state: &mut H) {
for elem in self.blocks() {
elem.hash(state);
}
}
}
impl<B: BitsIn + BitBlock + Default, NBits: Unsigned + NonZero> cmp::PartialEq
for BitArray<B, NBits>
where
NBits: Add<<B as BitsIn>::Output>,
<NBits as Add<<B as BitsIn>::Output>>::Output: Sub<typenum::B1>,
<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output:
Div<<B as BitsIn>::Output>,
<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output as Div<
<B as BitsIn>::Output,
>>::Output: generic_array::ArrayLength<B>,
{
#[inline]
fn eq(&self, other: &Self) -> bool {
self.blocks().zip(other.blocks()).all(|(w1, w2)| w1 == w2)
}
}
impl<B: BitsIn + BitBlock + Default, NBits: Unsigned + NonZero> cmp::Eq for BitArray<B, NBits>
where
NBits: Add<<B as BitsIn>::Output>,
<NBits as Add<<B as BitsIn>::Output>>::Output: Sub<typenum::B1>,
<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output:
Div<<B as BitsIn>::Output>,
<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output as Div<
<B as BitsIn>::Output,
>>::Output: generic_array::ArrayLength<B>,
{
}
#[derive(Clone)]
pub struct Iter<'a, B: 'a + BitsIn + BitBlock + Default, NBits: 'a + Unsigned + NonZero>
where
NBits: Add<<B as BitsIn>::Output>,
<NBits as Add<<B as BitsIn>::Output>>::Output: Sub<typenum::B1>,
<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output:
Div<<B as BitsIn>::Output>,
<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output as Div<
<B as BitsIn>::Output,
>>::Output: generic_array::ArrayLength<B>,
{
bit_array: &'a BitArray<B, NBits>,
range: Range<usize>,
}
impl<'a, B: BitsIn + BitBlock + Default, NBits: Unsigned + NonZero> Iterator for Iter<'a, B, NBits>
where
NBits: Add<<B as BitsIn>::Output>,
<NBits as Add<<B as BitsIn>::Output>>::Output: Sub<typenum::B1>,
<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output:
Div<<B as BitsIn>::Output>,
<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output as Div<
<B as BitsIn>::Output,
>>::Output: generic_array::ArrayLength<B>,
{
type Item = bool;
#[inline]
fn next(&mut self) -> Option<bool> {
self.range.next().map(|i| self.bit_array.get(i).unwrap())
}
fn size_hint(&self) -> (usize, Option<usize>) {
self.range.size_hint()
}
}
impl<'a, B: BitsIn + BitBlock + Default, NBits: Unsigned + NonZero> DoubleEndedIterator
for Iter<'a, B, NBits>
where
NBits: Add<<B as BitsIn>::Output>,
<NBits as Add<<B as BitsIn>::Output>>::Output: Sub<typenum::B1>,
<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output:
Div<<B as BitsIn>::Output>,
<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output as Div<
<B as BitsIn>::Output,
>>::Output: generic_array::ArrayLength<B>,
{
#[inline]
fn next_back(&mut self) -> Option<bool> {
self.range
.next_back()
.map(|i| self.bit_array.get(i).unwrap())
}
}
impl<'a, B: BitsIn + BitBlock + Default, NBits: Unsigned + NonZero> ExactSizeIterator
for Iter<'a, B, NBits>
where
NBits: Add<<B as BitsIn>::Output>,
<NBits as Add<<B as BitsIn>::Output>>::Output: Sub<typenum::B1>,
<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output:
Div<<B as BitsIn>::Output>,
<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output as Div<
<B as BitsIn>::Output,
>>::Output: generic_array::ArrayLength<B>,
{
}
impl<'a, B: BitsIn + BitBlock + Default, NBits: Unsigned + NonZero> IntoIterator
for &'a BitArray<B, NBits>
where
NBits: Add<<B as BitsIn>::Output>,
<NBits as Add<<B as BitsIn>::Output>>::Output: Sub<typenum::B1>,
<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output:
Div<<B as BitsIn>::Output>,
<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output as Div<
<B as BitsIn>::Output,
>>::Output: generic_array::ArrayLength<B>,
{
type Item = bool;
type IntoIter = Iter<'a, B, NBits>;
fn into_iter(self) -> Iter<'a, B, NBits> {
self.iter()
}
}
pub struct IntoIter<B: BitsIn, NBits: Unsigned + NonZero>
where
NBits: Add<<B as BitsIn>::Output>,
<NBits as Add<<B as BitsIn>::Output>>::Output: Sub<typenum::B1>,
<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output:
Div<<B as BitsIn>::Output>,
<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output as Div<
<B as BitsIn>::Output,
>>::Output: generic_array::ArrayLength<B>,
{
bit_array: BitArray<B, NBits>,
range: Range<usize>,
}
impl<B: BitBlock + BitsIn + Default, NBits: Unsigned + NonZero> Iterator for IntoIter<B, NBits>
where
NBits: Add<<B as BitsIn>::Output>,
<NBits as Add<<B as BitsIn>::Output>>::Output: Sub<typenum::B1>,
<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output:
Div<<B as BitsIn>::Output>,
<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output as Div<
<B as BitsIn>::Output,
>>::Output: generic_array::ArrayLength<B>,
{
type Item = bool;
#[inline]
fn next(&mut self) -> Option<bool> {
self.range.next().map(|i| self.bit_array.get(i).unwrap())
}
}
impl<B: BitBlock + BitsIn + Default, NBits: Unsigned + NonZero> DoubleEndedIterator
for IntoIter<B, NBits>
where
NBits: Add<<B as BitsIn>::Output>,
<NBits as Add<<B as BitsIn>::Output>>::Output: Sub<typenum::B1>,
<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output:
Div<<B as BitsIn>::Output>,
<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output as Div<
<B as BitsIn>::Output,
>>::Output: generic_array::ArrayLength<B>,
{
#[inline]
fn next_back(&mut self) -> Option<bool> {
self.range
.next_back()
.map(|i| self.bit_array.get(i).unwrap())
}
}
impl<B: BitBlock + BitsIn + Default, NBits: Unsigned + NonZero> ExactSizeIterator
for IntoIter<B, NBits>
where
NBits: Add<<B as BitsIn>::Output>,
<NBits as Add<<B as BitsIn>::Output>>::Output: Sub<typenum::B1>,
<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output:
Div<<B as BitsIn>::Output>,
<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output as Div<
<B as BitsIn>::Output,
>>::Output: generic_array::ArrayLength<B>,
{
}
impl<B: BitsIn + BitBlock + Default, NBits: Unsigned + NonZero> IntoIterator for BitArray<B, NBits>
where
NBits: Add<<B as BitsIn>::Output>,
<NBits as Add<<B as BitsIn>::Output>>::Output: Sub<typenum::B1>,
<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output:
Div<<B as BitsIn>::Output>,
<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<typenum::B1>>::Output as Div<
<B as BitsIn>::Output,
>>::Output: generic_array::ArrayLength<B>,
{
type Item = bool;
type IntoIter = IntoIter<B, NBits>;
fn into_iter(self) -> IntoIter<B, NBits> {
IntoIter {
bit_array: self,
range: 0..NBits::to_usize(),
}
}
}
#[derive(Clone)]
pub struct Blocks<'a, B: 'a> {
iter: slice::Iter<'a, B>,
}
impl<'a, B: BitBlock> Iterator for Blocks<'a, B> {
type Item = B;
#[inline]
fn next(&mut self) -> Option<B> {
self.iter.next().cloned()
}
fn size_hint(&self) -> (usize, Option<usize>) {
self.iter.size_hint()
}
}
impl<'a, B: BitBlock> DoubleEndedIterator for Blocks<'a, B> {
#[inline]
fn next_back(&mut self) -> Option<B> {
self.iter.next_back().cloned()
}
}
impl<'a, B: BitBlock> ExactSizeIterator for Blocks<'a, B> {}
#[cfg(test)]
mod tests {
use super::{BitArray, Iter};
use typenum::*;
#[test]
fn test_to_str() {
let eightbits = BitArray::<u32, U8>::from_elem(false);
assert_eq!(format!("{:?}", eightbits), "00000000")
}
#[test]
fn test_1_element() {
let mut act = BitArray::<u32, U1>::from_elem(false);
assert!(act.eq_vec(&[false]));
assert!(act.none() && !act.all());
act = BitArray::<u32, U1>::from_elem(true);
assert!(act.eq_vec(&[true]));
assert!(!act.none() && act.all());
}
#[test]
fn test_2_elements() {
let mut b = BitArray::<u32, U2>::from_elem(false);
b.set(0, true);
b.set(1, false);
assert_eq!(format!("{:?}", b), "10");
assert!(!b.none() && !b.all());
}
#[test]
fn test_10_elements() {
let mut act;
act = BitArray::<u32, U10>::from_elem(false);
assert!(
(act.eq_vec(&[false, false, false, false, false, false, false, false, false, false]))
);
assert!(act.none() && !act.all());
act = BitArray::<u32, U10>::from_elem(true);
assert!((act.eq_vec(&[true, true, true, true, true, true, true, true, true, true])));
assert!(!act.none() && act.all());
act = BitArray::<u32, U10>::from_elem(false);
act.set(0, true);
act.set(1, true);
act.set(2, true);
act.set(3, true);
act.set(4, true);
assert!((act.eq_vec(&[true, true, true, true, true, false, false, false, false, false])));
assert!(!act.none() && !act.all());
act = BitArray::<u32, U10>::from_elem(false);
act.set(5, true);
act.set(6, true);
act.set(7, true);
act.set(8, true);
act.set(9, true);
assert!((act.eq_vec(&[false, false, false, false, false, true, true, true, true, true])));
assert!(!act.none() && !act.all());
act = BitArray::<u32, U10>::from_elem(false);
act.set(0, true);
act.set(3, true);
act.set(6, true);
act.set(9, true);
assert!((act.eq_vec(&[true, false, false, true, false, false, true, false, false, true])));
assert!(!act.none() && !act.all());
}
#[test]
fn test_31_elements() {
let mut act;
act = BitArray::<u32, U31>::from_elem(false);
assert!(act.eq_vec(&[
false, false, false, false, false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false
]));
assert!(act.none() && !act.all());
act = BitArray::<u32, U31>::from_elem(true);
assert!(act.eq_vec(&[
true, true, true, true, true, true, true, true, true, true, true, true, true, true,
true, true, true, true, true, true, true, true, true, true, true, true, true, true,
true, true, true
]));
assert!(!act.none() && act.all());
act = BitArray::<u32, U31>::from_elem(false);
act.set(0, true);
act.set(1, true);
act.set(2, true);
act.set(3, true);
act.set(4, true);
act.set(5, true);
act.set(6, true);
act.set(7, true);
assert!(act.eq_vec(&[
true, true, true, true, true, true, true, true, false, false, false, false, false,
false, false, false, false, false, false, false, false, false, false, false, false,
false, false, false, false, false, false
]));
assert!(!act.none() && !act.all());
act = BitArray::<u32, U31>::from_elem(false);
act.set(16, true);
act.set(17, true);
act.set(18, true);
act.set(19, true);
act.set(20, true);
act.set(21, true);
act.set(22, true);
act.set(23, true);
assert!(act.eq_vec(&[
false, false, false, false, false, false, false, false, false, false, false, false,
false, false, false, false, true, true, true, true, true, true, true, true, false,
false, false, false, false, false, false
]));
assert!(!act.none() && !act.all());
act = BitArray::<u32, U31>::from_elem(false);
act.set(24, true);
act.set(25, true);
act.set(26, true);
act.set(27, true);
act.set(28, true);
act.set(29, true);
act.set(30, true);
assert!(act.eq_vec(&[
false, false, false, false, false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false, false, false, false, false,
true, true, true, true, true, true, true
]));
assert!(!act.none() && !act.all());
act = BitArray::<u32, U31>::from_elem(false);
act.set(3, true);
act.set(17, true);
act.set(30, true);
assert!(act.eq_vec(&[
false, false, false, true, false, false, false, false, false, false, false, false,
false, false, false, false, false, true, false, false, false, false, false, false,
false, false, false, false, false, false, true
]));
assert!(!act.none() && !act.all());
}
#[test]
fn test_32_elements() {
let mut act;
act = BitArray::<u32, U32>::from_elem(false);
assert!(act.eq_vec(&[
false, false, false, false, false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false
]));
assert!(act.none() && !act.all());
act = BitArray::<u32, U32>::from_elem(true);
assert!(act.eq_vec(&[
true, true, true, true, true, true, true, true, true, true, true, true, true, true,
true, true, true, true, true, true, true, true, true, true, true, true, true, true,
true, true, true, true
]));
assert!(!act.none() && act.all());
act = BitArray::<u32, U32>::from_elem(false);
act.set(0, true);
act.set(1, true);
act.set(2, true);
act.set(3, true);
act.set(4, true);
act.set(5, true);
act.set(6, true);
act.set(7, true);
assert!(act.eq_vec(&[
true, true, true, true, true, true, true, true, false, false, false, false, false,
false, false, false, false, false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false
]));
assert!(!act.none() && !act.all());
act = BitArray::<u32, U32>::from_elem(false);
act.set(16, true);
act.set(17, true);
act.set(18, true);
act.set(19, true);
act.set(20, true);
act.set(21, true);
act.set(22, true);
act.set(23, true);
assert!(act.eq_vec(&[
false, false, false, false, false, false, false, false, false, false, false, false,
false, false, false, false, true, true, true, true, true, true, true, true, false,
false, false, false, false, false, false, false
]));
assert!(!act.none() && !act.all());
act = BitArray::<u32, U32>::from_elem(false);
act.set(24, true);
act.set(25, true);
act.set(26, true);
act.set(27, true);
act.set(28, true);
act.set(29, true);
act.set(30, true);
act.set(31, true);
assert!(act.eq_vec(&[
false, false, false, false, false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false, false, false, false, false,
true, true, true, true, true, true, true, true
]));
assert!(!act.none() && !act.all());
act = BitArray::<u32, U32>::from_elem(false);
act.set(3, true);
act.set(17, true);
act.set(30, true);
act.set(31, true);
assert!(act.eq_vec(&[
false, false, false, true, false, false, false, false, false, false, false, false,
false, false, false, false, false, true, false, false, false, false, false, false,
false, false, false, false, false, false, true, true
]));
assert!(!act.none() && !act.all());
}
#[test]
fn test_33_elements() {
let mut act;
act = BitArray::<u32, U33>::from_elem(false);
assert!(act.eq_vec(&[
false, false, false, false, false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false, false
]));
assert!(act.none() && !act.all());
act = BitArray::<u32, U33>::from_elem(true);
assert!(act.eq_vec(&[
true, true, true, true, true, true, true, true, true, true, true, true, true, true,
true, true, true, true, true, true, true, true, true, true, true, true, true, true,
true, true, true, true, true
]));
assert!(!act.none() && act.all());
act = BitArray::<u32, U33>::from_elem(false);
act.set(0, true);
act.set(1, true);
act.set(2, true);
act.set(3, true);
act.set(4, true);
act.set(5, true);
act.set(6, true);
act.set(7, true);
assert!(act.eq_vec(&[
true, true, true, true, true, true, true, true, false, false, false, false, false,
false, false, false, false, false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false
]));
assert!(!act.none() && !act.all());
act = BitArray::<u32, U33>::from_elem(false);
act.set(16, true);
act.set(17, true);
act.set(18, true);
act.set(19, true);
act.set(20, true);
act.set(21, true);
act.set(22, true);
act.set(23, true);
assert!(act.eq_vec(&[
false, false, false, false, false, false, false, false, false, false, false, false,
false, false, false, false, true, true, true, true, true, true, true, true, false,
false, false, false, false, false, false, false, false
]));
assert!(!act.none() && !act.all());
act = BitArray::<u32, U33>::from_elem(false);
act.set(24, true);
act.set(25, true);
act.set(26, true);
act.set(27, true);
act.set(28, true);
act.set(29, true);
act.set(30, true);
act.set(31, true);
assert!(act.eq_vec(&[
false, false, false, false, false, false, false, false, false, false, false, false,
false, false, false, false, false, false, false, false, false, false, false, false,
true, true, true, true, true, true, true, true, false
]));
assert!(!act.none() && !act.all());
act = BitArray::<u32, U33>::from_elem(false);
act.set(3, true);
act.set(17, true);
act.set(30, true);
act.set(31, true);
act.set(32, true);
assert!(act.eq_vec(&[
false, false, false, true, false, false, false, false, false, false, false, false,
false, false, false, false, false, true, false, false, false, false, false, false,
false, false, false, false, false, false, true, true, true
]));
assert!(!act.none() && !act.all());
}
#[test]
fn test_equal_sneaky_small() {
let mut a = BitArray::<u32, U1>::from_elem(false);
a.set(0, true);
let mut b = BitArray::<u32, U1>::from_elem(true);
b.set(0, true);
assert_eq!(a, b);
}
#[test]
fn test_equal_sneaky_big() {
let mut a = BitArray::<u32, U100>::from_elem(false);
for i in 0..100 {
a.set(i, true);
}
let mut b = BitArray::<u32, U100>::from_elem(true);
for i in 0..100 {
b.set(i, true);
}
assert_eq!(a, b);
}
#[test]
fn test_from_bytes() {
let bit_array = BitArray::<u32, U24>::from_bytes(&[0b1011_0110, 0b0000_0000, 0b1111_1111]);
let str = concat!("10110110", "00000000", "11111111");
assert_eq!(format!("{:?}", bit_array), str);
}
#[test]
fn test_to_bytes() {
let mut bv = BitArray::<u32, U3>::from_elem(true);
bv.set(1, false);
assert_eq!(bv.to_bytes(), [0b1010_0000]);
let mut bv = BitArray::<u32, U9>::from_elem(false);
bv.set(2, true);
bv.set(8, true);
assert_eq!(bv.to_bytes(), [0b0010_0000, 0b1000_0000]);
}
#[test]
fn test_from_bools() {
let bools = vec![true, false, true, true];
let bit_array: BitArray<u32, U4> = bools.iter().cloned().collect();
assert_eq!(format!("{:?}", bit_array), "1011");
}
#[test]
fn test_to_bools() {
let bools = vec![false, false, true, false, false, true, true, false];
assert_eq!(
BitArray::<u32, U8>::from_bytes(&[0b0010_0110])
.iter()
.collect::<Vec<bool>>(),
bools
);
}
#[test]
fn test_bit_array_iterator() {
let bools = vec![true, false, true, true];
let bit_array: BitArray<u32, U4> = bools.iter().cloned().collect();
assert_eq!(bit_array.iter().collect::<Vec<bool>>(), bools);
let long: Vec<_> = (0..10000).map(|i| i % 2 == 0).collect();
let bit_array: BitArray<u32, U10000> = long.iter().cloned().collect();
assert_eq!(bit_array.iter().collect::<Vec<bool>>(), long)
}
#[test]
fn test_small_difference() {
let mut b1 = BitArray::<u32, U3>::from_elem(false);
let mut b2 = BitArray::<u32, U3>::from_elem(false);
b1.set(0, true);
b1.set(1, true);
b2.set(1, true);
b2.set(2, true);
assert!(b1.difference(&b2));
assert!(b1[0]);
assert!(!b1[1]);
assert!(!b1[2]);
}
#[test]
fn test_big_difference() {
let mut b1 = BitArray::<u32, U100>::from_elem(false);
let mut b2 = BitArray::<u32, U100>::from_elem(false);
b1.set(0, true);
b1.set(40, true);
b2.set(40, true);
b2.set(80, true);
assert!(b1.difference(&b2));
assert!(b1[0]);
assert!(!b1[40]);
assert!(!b1[80]);
}
#[test]
fn test_small_clear() {
let mut b = BitArray::<u32, U14>::from_elem(true);
assert!(!b.none() && b.all());
b.clear();
assert!(b.none() && !b.all());
}
#[test]
fn test_big_clear() {
let mut b = BitArray::<u32, U140>::from_elem(true);
assert!(!b.none() && b.all());
b.clear();
assert!(b.none() && !b.all());
}
#[test]
fn test_bit_array_lt() {
let mut a = BitArray::<u32, U5>::from_elem(false);
let mut b = BitArray::<u32, U5>::from_elem(false);
assert!(!(a < b) && !(b < a));
b.set(2, true);
assert!(a < b);
a.set(3, true);
assert!(a < b);
a.set(2, true);
assert!(!(a < b) && b < a);
b.set(0, true);
assert!(a < b);
}
#[test]
fn test_ord() {
let mut a = BitArray::<u32, U5>::from_elem(false);
let mut b = BitArray::<u32, U5>::from_elem(false);
assert_eq!(a, b);
a.set(1, true);
assert!(a > b && a >= b);
assert!(b < a && b <= a);
b.set(1, true);
b.set(2, true);
assert!(b > a && b >= a);
assert!(a < b && a <= b);
}
#[test]
fn test_small_bit_array_tests() {
let v = BitArray::<u32, U8>::from_bytes(&[0]);
assert!(!v.all());
assert!(!v.any());
assert!(v.none());
let v = BitArray::<u32, U8>::from_bytes(&[0b0001_0100]);
assert!(!v.all());
assert!(v.any());
assert!(!v.none());
let v = BitArray::<u32, U8>::from_bytes(&[0xFF]);
assert!(v.all());
assert!(v.any());
assert!(!v.none());
}
#[test]
fn test_big_bit_array_tests() {
let v = BitArray::<u32, U88>::from_bytes(&[
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
]);
assert!(!v.all());
assert!(!v.any());
assert!(v.none());
let v = BitArray::<u32, U88>::from_bytes(&[
0,
0,
0b0001_0100,
0,
0,
0,
0,
0b0011_0100,
0,
0,
0,
]);
assert!(!v.all());
assert!(v.any());
assert!(!v.none());
let v = BitArray::<u32, U88>::from_bytes(&[
0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
]);
assert!(v.all());
assert!(v.any());
assert!(!v.none());
}
#[test]
fn test_into_iter() {
let bools = vec![true, false, true, true];
let bit_array: BitArray<u32, U4> = bools.iter().cloned().collect();
let mut iter = bit_array.into_iter();
assert_eq!(Some(true), iter.next());
assert_eq!(Some(false), iter.next());
assert_eq!(Some(true), iter.next());
assert_eq!(Some(true), iter.next());
assert_eq!(None, iter.next());
assert_eq!(None, iter.next());
let bit_array: BitArray<u32, U4> = bools.iter().cloned().collect();
let mut iter = bit_array.into_iter();
assert_eq!(Some(true), iter.next_back());
assert_eq!(Some(true), iter.next_back());
assert_eq!(Some(false), iter.next_back());
assert_eq!(Some(true), iter.next_back());
assert_eq!(None, iter.next_back());
assert_eq!(None, iter.next_back());
let bit_array: BitArray<u32, U4> = bools.iter().cloned().collect();
let mut iter = bit_array.into_iter();
assert_eq!(Some(true), iter.next_back());
assert_eq!(Some(true), iter.next());
assert_eq!(Some(false), iter.next());
assert_eq!(Some(true), iter.next_back());
assert_eq!(None, iter.next());
assert_eq!(None, iter.next_back());
}
#[test]
fn iter() {
let b: BitArray<u32, U10> = BitArray::new();
let _a: Iter<u32, U10> = b.iter();
}
}
#[cfg(all(test, feature = "nightly"))]
mod bench;