Struct xor_distance_exercise::bits::Bits

pub struct Bits { /* private fields */ }

Bits representation.

Implementations

impl Bits

pub fn new<T: PrimInt>() -> Self

Create a new representation of Bits.

Examples

extern crate xor_distance_exercise;
use xor_distance_exercise::bits::Bits;

Bits::new::<u64>;

pub fn bit_size<T: PrimInt>() -> usize

Return bit size of the type being represent in bits.

Examples

extern crate xor_distance_exercise;

use xor_distance_exercise::bits::Bits;

assert_eq!(8, Bits::bit_size::<u8>());
assert_eq!(32, Bits::bit_size::<u32>());
assert_eq!(64, Bits::bit_size::<u64>());
assert_eq!(64, Bits::bit_size::<i64>());

pub fn get_bit(&self, index: usize) -> Option<bool>

Get bit value for the index.

Panics

Panics if index is out of range.

pub fn set_bit(&mut self, index: usize, val: bool)

Set new bit value for the index.

Panics

Panics if index is out of range.

pub fn set_bit_within_constrains(
    &mut self,
    index: usize,
    val: bool
) -> Result<(), &'static str>

Set new bit value complying with constrains, already decided bit value can not be changed.

Returns Ok(()) in case constrains were not violated, Err(&str) otherwise.

Panics

Panics if index is out of range.

pub fn is_bit_decided(&self, index: usize) -> bool

Is bit decided already?

Panics

Panics if index is out of range.

pub fn form_zero_padded_number<T: PrimInt>(&self) -> Result<T, &str>

Form and return a number based on bits representation, pad/fill undecided bits by zeros.