Struct idx_binary::Avltriee

pub struct Avltriee<T, I = T, A = VecAvltrieeAllocator<T>>
where
    I: ?Sized,
{ /* private fields */ }

Implementations

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

where A: AvltrieeAllocator<T>, I: ?Sized,

pub fn rows_count(&self) -> u32

Return count of rows.

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

where A: AvltrieeAllocator<T>, I: ?Sized,

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

Generate an iterator.

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

Generate an iterator. Iterates in descending order.

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

where Avltriee<T, I, A>: AsRef<Avltriee<T, I, A>> + AvltrieeOrd<T, I, A>,

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

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

where Avltriee<T, I, A>: AsRef<Avltriee<T, I, A>> + AvltrieeOrd<T, I, A>,

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

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

where Avltriee<T, I, A>: AvltrieeOrd<T, I, A>,

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

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

where Avltriee<T, I, A>: AvltrieeOrd<T, I, A>,

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

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

where Avltriee<T, I, A>: AvltrieeOrd<T, I, A>,

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

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

where Avltriee<T, I, A>: AvltrieeOrd<T, I, A>,

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

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

where Avltriee<T, I, A>: AvltrieeOrd<T, I, A>,

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

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

where Avltriee<T, I, A>: AvltrieeOrd<T, I, A>,

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

where Avltriee<T, I, A>: AvltrieeOrd<T, I, A>,

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

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

where Avltriee<T, I, A>: AvltrieeOrd<T, I, A>,

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

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

where Avltriee<T, I, A>: AvltrieeOrd<T, I, A>,

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

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

where A: AvltrieeAllocator<T>, I: ?Sized,

pub fn search(&self, value: &I) -> Found

where Avltriee<T, I, A>: AvltrieeOrd<T, I, A>,

Finds the edge of a node from the specified value.

pub fn search_edge(&self, o: &impl AvltrieeOrd<T, I, A>, value: &I) -> Found

Finds the edge of a node from the specified value with custom ord.

pub fn search_ge( &self, o: &impl AvltrieeOrd<T, I, A>, value: &I ) -> Option<NonZero<u32>>

Search >= value with custom ord.

pub fn search_le( &self, o: &impl AvltrieeOrd<T, I, A>, value: &I ) -> Option<NonZero<u32>>

Search <= value with custom ord.

pub fn search_gt( &self, o: &impl AvltrieeOrd<T, I, A>, value: &I ) -> Option<NonZero<u32>>

Search > value with custom ord.

pub fn search_lt( &self, o: &impl AvltrieeOrd<T, I, A>, value: &I ) -> Option<NonZero<u32>>

Search < value with custom ord.

pub fn search_range( &self, o: &impl AvltrieeOrd<T, I, A>, start_value: &I, end_value: &I ) -> Option<Range<NonZero<u32>>>

Search with range value with custom ord.

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

where A: AvltrieeAllocator<T>, I: ?Sized,

pub fn delete(&mut self, row: NonZero<u32>)

Delete the specified row.

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

where A: AvltrieeAllocator<T>, I: ?Sized,

pub fn insert(&mut self, value: &I) -> NonZero<u32>

where T: Ord + Clone + Default, Avltriee<T, I, A>: AvltrieeUpdate<T, I, A>,

Creates a new row and assigns a value to it.

pub fn update(&mut self, row: NonZero<u32>, value: &I)

where T: Ord + Clone + Default, Avltriee<T, I, A>: AvltrieeUpdate<T, I, A>,

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<H>(holder: &mut H, row: NonZero<u32>, input: &I)

where H: AvltrieeUpdate<T, I, A> + AvltrieeOrd<T, I, A>, T: Clone + Default,

Updates the value of the specified row via trait AvltrieeUpdate. 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: NonZero<u32>, 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, I, A> Avltriee<T, I, A>

where A: AvltrieeAllocator<T>, I: ?Sized,

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

Creates the Avltriee with [AvltrieeAllocator].

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

Returns the node of the specified row.

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

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

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

Trait Implementations

impl AsMut<Avltriee<DataAddress, [u8], IdxFileAllocator<DataAddress>>> for IdxBinary

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

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

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

where I: ?Sized,

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

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

impl AsRef<Avltriee<DataAddress, [u8], IdxFileAllocator<DataAddress>>> for IdxBinary

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

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

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

where I: ?Sized,

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

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

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

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

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

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

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

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

fn delete_before_update(&mut self, row: NonZero<u32>)