Struct BinarySet 

pub struct BinarySet { /* private fields */ }

Implementations

impl BinarySet

pub fn new<P: AsRef<Path>>(path: P, allocation_lot: u32) -> Self

Opens the file and creates the BinarySet. /// # 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<&[u8]>

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

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

Search for a sequence of bytes.

pub fn row_or_insert(&mut self, content: &[u8]) -> NonZeroU32

Finds a sequence of bytes, inserts it if it doesn’t exist, and returns a row.

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

pub fn rows_count(&self) -> u32

Return count of rows.

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>: 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>: 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.

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

where T: Clone, Avltriee<T, I, A>: AvltrieeUpdate<T, I, A>,

Creates a new row and assigns a value to it.

pub unsafe fn insert_unique_unchecked( &mut self, row: NonZero<u32>, value: T, found: Found, )

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: 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 AsRef<Avltriee<DataAddress, [u8], IdxFileAllocator<DataAddress>>> for BinarySet

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

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

impl AvltrieeOrd<DataAddress, [u8], IdxFileAllocator<DataAddress>> for BinarySet

fn cmp(&self, left: &DataAddress, right: &[u8]) -> Ordering

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

where Self: Sized,

Finds the edge of a node from the specified value.

impl Deref for BinarySet

type Target = IdxFile<DataAddress, [u8]>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.