Struct idx_binary::IdxBinary

pub struct IdxBinary<T> { /* private fields */ }

Implementations

impl<T: DataAddressHolder<T>> IdxBinary<T>

pub fn new<P: AsRef<Path>>(path: P) -> Result<Self>

pub fn bytes(&self, row: u32) -> Option<&'static [u8]>

pub fn update(&mut self, row: u32, content: &[u8]) -> Result<u32>where T: Clone,

pub fn cmp(&self, data: &T, content: &[u8]) -> Ordering

Methods from Deref<Target = IdxFile<T>>

pub fn triee(&self) -> &Avltriee<T>

pub fn triee_mut(&mut self) -> &mut Avltriee<T>

pub fn value(&self, row: u32) -> Option<&T>

pub fn new_row(&mut self, row: u32) -> Result<u32, Error>

pub fn insert(&mut self, value: T) -> Result<u32, Error>where T: Ord + Clone,

pub fn update(&mut self, row: u32, value: T) -> Result<u32, Error>where T: Ord + Clone,

pub fn delete(&mut self, row: u32) -> Result<(), Error>

pub fn exists(&self, row: u32) -> bool

Trait Implementations

impl<T: DataAddressHolder<T>> AvltrieeHolder<T, &[u8]> for IdxBinary<T>

fn triee(&self) -> &Avltriee<T>

fn triee_mut(&mut self) -> &mut Avltriee<T>

fn cmp(&self, left: &T, right: &&[u8]) -> Ordering

fn search_end(&self, input: &&[u8]) -> Found

fn value(&mut self, input: &[u8]) -> Result<T>

fn delete(&mut self, row: u32, delete_node: &T) -> Result<()>

impl<T> Deref for IdxBinary<T>

type Target = IdxFile<T>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T> DerefMut for IdxBinary<T>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.