Struct idx_binary::Avltriee

pub struct Avltriee<T, A = DefaultAvltrieeAllocator<T>> { /* private fields */ }

Implementations

impl<T, A> Avltriee<T, A>

where A: AvltrieeAllocator<T>,

pub fn rows_count(&self) -> u32

Return count of rows.

impl<T, A> Avltriee<T, A>

where A: AvltrieeAllocator<T>,

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.

impl<T, A> Avltriee<T, A>

where A: AvltrieeAllocator<T>,

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

Delete the specified row.

impl<T, A> Avltriee<T, A>

where A: AvltrieeAllocator<T>,

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

where T: Ord + Clone + Default,

Creates a new row and assigns a value to it.

pub 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 fn update_with_holder<I>( holder: &mut impl AvltrieeHolder<T, I, A>, row: NonZeroU32, input: I )

where T: Clone + Default,

Updates the value of the specified row via trait AvltrieeHolder. 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.

impl<T> Avltriee<T>

where T: Default,

pub fn new() -> Avltriee<T>

Creates the Avltriee with Default allocator.

impl<T, A> Avltriee<T, A>

where A: AvltrieeAllocator<T>,

pub fn with_allocator(allocator: A) -> Avltriee<T, A>

Creates the Avltriee with [AvltrieeAllocator].

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 AsMut<Avltriee<DataAddress, IdxFileAllocator<DataAddress>>> for IdxBinary

fn as_mut( &mut self ) -> &mut Avltriee<DataAddress, IdxFileAllocator<DataAddress>>

Converts this type into a mutable reference of the (usually inferred) input type.

impl<T, A> AsMut<Avltriee<T, A>> for Avltriee<T, A>

fn as_mut(&mut self) -> &mut Avltriee<T, A>

Converts this type into a mutable reference of the (usually inferred) input type.

impl AsRef<Avltriee<DataAddress, IdxFileAllocator<DataAddress>>> for IdxBinary

fn as_ref(&self) -> &Avltriee<DataAddress, IdxFileAllocator<DataAddress>>

Converts this type into a shared reference of the (usually inferred) input type.

impl<T, A> AsRef<Avltriee<T, A>> for Avltriee<T, A>

fn as_ref(&self) -> &Avltriee<T, A>

Converts this type into a shared reference of the (usually inferred) input type.

impl<T, A> AvltrieeHolder<T, T, A> for Avltriee<T, A>

where T: Ord, A: AvltrieeAllocator<T>,

fn cmp(&self, left: &T, right: &T) -> Ordering

fn search(&self, input: &T) -> Found

fn convert_value(&mut self, input: T) -> T

fn delete_before_update(&mut self, row: NonZeroU32)