Struct near_fixed_bit_tree::BitTree

pub struct BitTree { /* private fields */ }

Implementations

impl BitTree

pub fn new(max_bits: u32, key_prefix: Vec<u8>, bit_width: u8) -> Self

pub fn get(&self, key: &[u8]) -> Option<u8>

pub fn set(&mut self, key: &[u8], val: u8)

pub fn del(&mut self, key: &[u8])

pub fn check(&self, key: &[u8]) -> bool

pub fn get_and_set(&mut self, key: &[u8], val: u8) -> Option<u8>

pub fn check_and_set(&mut self, key: &[u8], val: u8) -> bool

Trait Implementations

impl BorshDeserialize for BitTreewhere
    TreeMap: BorshDeserialize,

fn deserialize(buf: &mut &[u8]) -> Result<Self, Error>

Deserializes this instance from a given slice of bytes. Updates the buffer to point at the remaining bytes.

fn try_from_slice(v: &[u8]) -> Result<Self, Error>

Deserialize this instance from a slice of bytes.

impl BorshSerialize for BitTreewhere
    TreeMap: BorshSerialize,

fn serialize<W: Write>(&self, writer: &mut W) -> Result<(), Error>

fn try_to_vec(&self) -> Result<Vec<u8, Global>, Error>

Serialize this instance into a vector of bytes.