Struct monotree::bits::Bits

pub struct Bits<'a> {
    pub path: &'a [u8],
    pub range: Range<BitsLen>,
}

BitVec implementation based on bytes slice.

Fields

path: &'a [u8]

range: Range<BitsLen>

Implementations

impl<'a> Bits<'a>

pub fn new(bytes: &'a [u8]) -> Self

pub fn from_bytes(bytes: &'a [u8]) -> Self

Construct Bits instance by deserializing bytes slice.

pub fn to_bytes(&self) -> Result<Vec<u8>>

Serialize Bits into bytes.

pub fn first(&self) -> bool

Get the very first bit.

pub fn len(&self) -> BitsLen

pub fn is_empty(&self) -> bool

pub fn shift(&self, n: BitsLen, tail: bool) -> Self

Get the resulting Bits when shifted with the given size.

pub fn len_common_bits(a: &Self, b: &Self) -> BitsLen

Get length of the longest common prefix bits for the given two Bits.

Trait Implementations

impl<'a> Clone for Bits<'a>

fn clone(&self) -> Bits<'a>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'a> Debug for Bits<'a>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'a> PartialEq<Bits<'a>> for Bits<'a>

fn eq(&self, other: &Bits<'a>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'a> StructuralPartialEq for Bits<'a>