Struct versatile_data::Field

pub struct Field { /* private fields */ }

Implementations

impl Field

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

pub fn num(&self, row: u32) -> Option<f64>

Methods from Deref<Target = IdxBinary<FieldEntity>>

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

pub fn update(&mut self, row: u32, content: &[u8]) -> Result<u32, Error>where 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) -> 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

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 update(&mut self, row: u32, value: T) -> Result<(), Error>where T: Ord + Clone,

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

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

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

impl Deref for Field

type Target = IdxBinary<FieldEntity>

The resulting type after dereferencing.

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

Dereferences the value.

impl DerefMut for Field

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

Mutably dereferences the value.