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) -> Self

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

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

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

Methods from Deref<Target = IdxFile<T>>

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

pub fn allocate(&mut self, row: NonZeroU32)

pub fn create_row(&mut self) -> u32

pub fn insert(&mut self, value: T) -> u32where T: Ord + Clone,

pub fn update(&mut self, row: u32, value: T)where T: Ord + Clone,

pub fn delete(&mut self, row: u32)

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

Methods from Deref<Target = Avltriee<T>>

pub fn iter(&self) -> AvltrieeIter<'_, T>

pub fn desc_iter(&self) -> AvltrieeIter<'_, T>

pub fn iter_by<F, 'a>(&'a self, cmp: F) -> AvltrieeIter<'a, T> where F: Fn(&T) -> Ordering,

pub fn iter_from<F, 'a>(&'a self, search: F) -> AvltrieeIter<'a, T> where F: Fn(&T) -> Ordering,

pub fn desc_iter_from<F, 'a>(&'a self, search: F) -> AvltrieeIter<'a, T> where F: Fn(&T) -> Ordering,

pub fn iter_over<F, 'a>(&'a self, search: F) -> AvltrieeIter<'a, T> where F: Fn(&T) -> Ordering,

pub fn desc_iter_over<F, 'a>(&'a self, search: F) -> AvltrieeIter<'a, T> where F: Fn(&T) -> Ordering,

pub fn iter_to<F, 'a>(&'a self, search_from: F) -> AvltrieeIter<'a, T> where F: Fn(&T) -> Ordering,

pub fn desc_iter_to<F, 'a>(&'a self, search_from: F) -> AvltrieeIter<'a, T> where F: Fn(&T) -> Ordering,

pub fn iter_under<F, 'a>(&'a self, search_from: F) -> AvltrieeIter<'a, T> where F: Fn(&T) -> Ordering,

pub fn desc_iter_under<F, 'a>(&'a self, search_from: F) -> AvltrieeIter<'a, T> where F: Fn(&T) -> Ordering,

pub fn iter_range<S, E, 'a>(&'a self, start: S, end: E) -> AvltrieeIter<'a, T> where S: Fn(&T) -> Ordering, E: Fn(&T) -> Ordering,

pub fn desc_iter_range<S, E, 'a>( &'a self, start: S, end: E ) -> AvltrieeIter<'a, T> where S: Fn(&T) -> Ordering, E: Fn(&T) -> Ordering,

pub unsafe fn delete(&mut self, target_row: u32)

pub unsafe fn update(&mut self, row: u32, value: T)where T: Ord + Clone,

pub unsafe fn insert_unique(&mut self, row: u32, value: T, found: Found)

pub unsafe fn node<'a>(&self, row: u32) -> Option<&'a AvltrieeNode<T>>

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

pub unsafe fn value_unchecked(&self, row: u32) -> &T

pub fn root(&self) -> u32

pub fn search_end<F>(&self, cmp: F) -> Foundwhere F: Fn(&T) -> Ordering,

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

Trait Implementations

impl<T> AsMut<Avltriee<T>> for IdxBinary<T>

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

Converts this type into a mutable reference of the (usually inferred) input type.

impl<T> AsRef<Avltriee<T>> for IdxBinary<T>

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

Converts this type into a shared reference of the (usually inferred) input type.

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

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

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

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

fn delete_before_update(&mut self, row: u32, delete_node: &T)

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.