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, allocation_lot: u32) -> Self

Opens the file and creates the IdxBinary.

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.

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

Returns the value of the specified row. Returns None if the row does not exist.

pub async fn update(&mut self, row: NonZeroU32, content: &[u8])

where T: Clone,

Updates the byte string of the specified row. If row does not exist, it will be expanded automatically..

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

Compare the stored data and the byte sequence.

Methods from Deref<Target = IdxFile<T>>

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

Gets the value of the specified row. Returns None if a non-existent row is specified.

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

Expand data storage space.

Arguments

• min_capacity - Specify the number of rows to expand. If allocation_lot is a larger value, it may be expanded by allocation_lot.

pub fn create_row(&mut self) -> NonZeroU32

Add capacity for new row.

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

where T: Ord + Clone,

Creates a new row and assigns a value to it..

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

where T: Ord + Clone,

Updates the value of the specified row. If capacity is insufficient, it will be expanded automatically.

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

Check if row exists.

Methods from Deref<Target = Avltriee<T>>

pub fn capacity(&self) -> u32

Returns capacity.

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

Generate an iterator.

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

Generate an iterator. Iterates in descending order.

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

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>

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>

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>

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>

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>

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>

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>

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>

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>

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>

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 unsafe fn update(&mut self, row: NonZeroU32, value: T)

where T: Ord + Clone,

Updates the value in the specified row.

Safety

Specifies a row within the allocated memory range.

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

Insert a unique value.

Safety

Specifies a row within the allocated memory range.Values ​​must be unique. There is no error checking if you try to insert a non-unique value. There will be multiple duplicate soot values ​​in the node list.

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

Returns the node of the specified row.

Safety

Specifies a row within the allocated memory range.

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

Returns the value of the specified row.

Safety

Specifies a row within the allocated memory range.

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

Returns the value of the specified row. Does not check for the existence of row.

Safety

Specifies a row within the allocated memory range.

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

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

Finds the end of a node from the specified value. Returns Ordering::Equal for exact match.

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

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

Safety

Specifies a row within the allocated memory range.

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<'life0, 'life1, 'async_trait>( &'life0 mut self, row: NonZeroU32, delete_node: &'life1 T ) -> Pin<Box<dyn Future<Output = ()> + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

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.