Struct versatile_data::Field
source · pub struct Field { /* private fields */ }
Implementations§
Methods from Deref<Target = IdxBinary<FieldEntity>>§
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 new_row(&mut self, row: u32) -> u32
pub fn insert(&mut self, value: T) -> u32where T: Ord + Clone,
pub fn update(&mut self, row: u32, value: T) -> u32where 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<'a>(&self, row: u32) -> Option<&'a T>
pub unsafe fn value_unchecked<'a>(&self, row: u32) -> &'a T
pub fn root(&self) -> u32
pub fn search_end<F>(&self, cmp: F) -> Foundwhere F: Fn(&T) -> Ordering,
pub unsafe fn has_same(&self, row: u32) -> bool
Trait Implementations§
Auto Trait Implementations§
impl RefUnwindSafe for Field
impl Send for Field
impl Sync for Field
impl Unpin for Field
impl UnwindSafe for Field
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