Struct versatile_data::IdxBinary
source · pub struct IdxBinary<T> { /* private fields */ }
Implementations§
source§impl<T> IdxBinary<T>where
T: DataAddressHolder<T>,
impl<T> IdxBinary<T>where T: DataAddressHolder<T>,
pub fn new<P>(path: P, allocation_lot: u32) -> IdxBinary<T>where P: AsRef<Path>,
pub fn bytes(&self, row: NonZeroU32) -> Option<&'static [u8]>
pub async fn update(&mut self, row: NonZeroU32, content: &[u8])where T: Send + Sync + Copy,
pub fn cmp(&self, data: &T, content: &[u8]) -> Ordering
Methods from Deref<Target = IdxFile<T>>§
pub fn value(&self, row: NonZeroU32) -> Option<&T>
pub fn allocate(&mut self, min_capacity: NonZeroU32)
pub fn create_row(&mut self) -> NonZeroU32
pub async fn insert(&mut self, value: T) -> NonZeroU32where T: Send + Sync + Ord + Copy,
pub async fn update_with_allocate(&mut self, row: NonZeroU32, value: T)where T: Send + Sync + Ord + Copy,
pub fn exists(&self, row: NonZeroU32) -> bool
Methods from Deref<Target = Avltriee<T>>§
pub fn update_max_rows(&mut self, rows: u32)
pub fn max_rows(&self) -> u32
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 fn delete(&mut self, target_row: NonZeroU32)
pub async unsafe fn update(&mut self, row: NonZeroU32, value: T)where T: Send + Sync + Ord + Copy,
pub unsafe fn insert_unique(&mut self, row: NonZeroU32, value: T, found: Found)
pub unsafe fn node<'a>(&self, row: NonZeroU32) -> Option<&'a AvltrieeNode<T>>
pub unsafe fn value(&self, row: NonZeroU32) -> Option<&T>
pub unsafe fn value_unchecked(&self, row: NonZeroU32) -> &T
pub fn search_end<F>(&self, cmp: F) -> Foundwhere F: Fn(&T) -> Ordering,
pub unsafe fn is_unique(&self, row: NonZeroU32) -> bool
Trait Implementations§
source§impl<T> AvltrieeHolder<T, &[u8]> for IdxBinary<T>where
T: DataAddressHolder<T> + Send + Sync,
impl<T> AvltrieeHolder<T, &[u8]> for IdxBinary<T>where T: DataAddressHolder<T> + Send + Sync,
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<'life0, 'life1, 'async_trait>( &'life0 mut self, row: NonZeroU32, delete_node: &'life1 T ) -> Pin<Box<dyn Future<Output = ()> + Send + 'async_trait>>where 'life0: 'async_trait, 'life1: 'async_trait, IdxBinary<T>: 'async_trait,
Auto Trait Implementations§
impl<T> RefUnwindSafe for IdxBinary<T>where T: RefUnwindSafe,
impl<T> Send for IdxBinary<T>where T: Send,
impl<T> Sync for IdxBinary<T>where T: Sync,
impl<T> Unpin for IdxBinary<T>
impl<T> UnwindSafe for IdxBinary<T>where T: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more