Struct idx_binary::Avltriee

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

Implementations§

§

impl<T> 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,

§

impl<T> Avltriee<T>

pub unsafe fn update(&mut self, row: u32, value: T) -> Result<(), Error>where T: Ord + Clone,

pub unsafe fn update_holder<H, I>( holder: &mut H, row: u32, input: I ) -> Result<(), Error>where T: Clone, H: AvltrieeHolder<T, I>,

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

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

§

impl<T> Avltriee<T>

pub fn new(node_list: *mut AvltrieeNode<T>) -> Avltriee<T>

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<T> AvltrieeHolder<T, T> for Avltriee<T>where T: Ord,

§

fn triee(&self) -> &Avltriee<T>

§

fn triee_mut(&mut self) -> &mut Avltriee<T>

§

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

§

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

§

fn value(&mut self, input: T) -> Result<T, Error>

§

fn delete_before_update(&mut self, row: u32, _: &T) -> Result<(), Error>

Auto Trait Implementations§

§

impl<T> RefUnwindSafe for Avltriee<T>where T: RefUnwindSafe,

§

impl<T> Send for Avltriee<T>where T: Send,

§

impl<T> Sync for Avltriee<T>where T: Sync,

§

impl<T> Unpin for Avltriee<T>

§

impl<T> UnwindSafe for Avltriee<T>where T: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.