Struct versatile_data::IdxFile

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

Implementations

impl<T> IdxFile<T>

where T: 'static,

pub fn new<P>(path: P, allocation_lot: u32) -> IdxFile<T>

where P: AsRef<Path>,

Opens the file and creates the IdxFile.

Arguments

• path - Path of file to save data
• allocation_lot - Extends the specified size when the file size becomes insufficient due to data addition. If you expect to add a lot of data, specifying a larger size will improve performance.

Methods from Deref<Target = Avltriee<T, IdxFileAllocator<T>>>

pub fn rows_count(&self) -> u32

Return count of rows.

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

Generate an iterator.

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

Generate an iterator. Iterates in descending order.

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

where F: Fn(&T) -> Ordering,

Generates an iterator of nodes with the same value as the specified value.

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

where F: Fn(&T) -> Ordering,

Generates an iterator with values ​​starting from the specified value.

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

where F: Fn(&T) -> Ordering,

Generates an iterator with values ​​starting from the specified value. Iterates in descending order.

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

where F: Fn(&T) -> Ordering,

Generates an iterator of nodes with values ​​greater than the specified value.

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

where F: Fn(&T) -> Ordering,

Generates an iterator of nodes with values ​​greater than the specified value. Iterates in descending order.

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

where F: Fn(&T) -> Ordering,

Generates an iterator of nodes with values ​​less than or equal to the specified value.

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

where F: Fn(&T) -> Ordering,

Generates an iterator of nodes with values ​​less than or equal to the specified value. Iterates in descending order.

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

where F: Fn(&T) -> Ordering,

Generates an iterator of nodes with values ​​less than the specified value.

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

where F: Fn(&T) -> Ordering,

Generates an iterator of nodes with values ​​less than the specified value. Iterates in descending order.

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

where S: Fn(&T) -> Ordering, E: Fn(&T) -> Ordering,

Generates an iterator of nodes with the specified range of values.

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

where S: Fn(&T) -> Ordering, E: Fn(&T) -> Ordering,

Generates an iterator of nodes with the specified range of values. Iterates in descending order.

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

Delete the specified row.

pub async fn insert(&mut self, value: T) -> NonZeroU32

where T: Ord + Clone + Default,

Creates a new row and assigns a value to it.

pub async fn update(&mut self, row: NonZeroU32, value: T)

where T: Ord + Clone + Default,

Updates the value in the specified row. If you specify a row that does not exist, space will be automatically allocated. If you specify a row that is too large, memory may be allocated unnecessarily.

pub unsafe fn insert_unique_unchecked( &mut self, row: NonZeroU32, value: T, found: Found )

where T: Clone + Default,

Insert a unique value. If you specify a row that does not exist, space will be automatically allocated. If you specify a row that is too large, memory may be allocated unnecessarily.

Safety

value ​​must be unique.

pub fn get(&self, row: NonZeroU32) -> Option<&AvltrieeNode<T>>

Returns the node of the specified row.

pub unsafe fn get_unchecked(&self, row: NonZeroU32) -> &AvltrieeNode<T>

pub fn search<F>(&self, cmp: F) -> Found

where F: Fn(&T) -> Ordering,

Finds the edge of a node from the specified value.

pub fn is_unique(&self, row: NonZeroU32) -> Option<(bool, &AvltrieeNode<T>)>

Checks whether the specified row is a node with a unique value.

Trait Implementations

impl<T> Deref for IdxFile<T>

type Target = Avltriee<T, IdxFileAllocator<T>>

The resulting type after dereferencing.

fn deref(&self) -> &<IdxFile<T> as Deref>::Target

Dereferences the value.

impl<T> DerefMut for IdxFile<T>

fn deref_mut(&mut self) -> &mut <IdxFile<T> as Deref>::Target

Mutably dereferences the value.