Struct smtree::index::TreeIndex [−][src]
pub struct TreeIndex { /* fields omitted */ }
Expand description
The index of a tree node includes the height (the root with height 0), and the path from the root to the node.
The path is a bit array, and each bit indicates which direction the child node goes.
The i-th bit being 0 indicates that the node at height i+1 in the path is the left child of the node at height i, and 1 indicates the right child.
Implementations
impl TreeIndex
[src]
impl TreeIndex
[src]pub fn new(height: usize, pos: [u8; 32]) -> TreeIndex
[src]
pub fn new(height: usize, pos: [u8; 32]) -> TreeIndex
[src]The constructor.
Panics if the input height exceeds MAX_HEIGHT,
pub fn from_u32(height: usize, pos: u32) -> TreeIndex
[src]
pub fn from_u32(height: usize, pos: u32) -> TreeIndex
[src]Construct TreeIndex from a u32 leaf position.
Panics if:
height
exceeds MAX_HEIGHT.pos
is not a valid leaf position in the tree of the specifiedheight
.
pub fn from_u64(height: usize, pos: u64) -> TreeIndex
[src]
pub fn from_u64(height: usize, pos: u64) -> TreeIndex
[src]Construct TreeIndex from a u64 leaf position.
Panics if:
height
exceeds MAX_HEIGHT.pos
is not a valid leaf position in the tree of the specifiedheight
.
pub fn zero(height: usize) -> TreeIndex
[src]
pub fn zero(height: usize) -> TreeIndex
[src]Returns a tree index of the left-most node (all bits in the path being 0) at the given height.
Panics if the input height exceeds MAX_HEIGHT.
pub fn get_height(&self) -> usize
[src]
pub fn get_height(&self) -> usize
[src]Returns the height of a tree index.
pub fn set_height(&mut self, height: usize)
[src]
pub fn set_height(&mut self, height: usize)
[src]Set the height of a tree index.
Panics if the input height exceeds MAX_HEIGHT.
pub fn get_bit(&self, i: usize) -> u8
[src]
pub fn get_bit(&self, i: usize) -> u8
[src]Get the i-th bit in the path.
Panics if queried bit index is out of the range [0, height-1]
.
pub fn get_last_bit(self) -> u8
[src]
pub fn get_last_bit(self) -> u8
[src]Returns the last bit in the path of the tree index.
Panics if the tree index has height 0 thus the bit doesn’t exist.
pub fn get_prefix(&self, height: usize) -> TreeIndex
[src]
pub fn get_prefix(&self, height: usize) -> TreeIndex
[src]Returns a tree index with the input height and the path being a prefix of the self path.
Panics if the input height exceeds the height of the index.
pub fn get_lch_index(&self) -> TreeIndex
[src]
pub fn get_lch_index(&self) -> TreeIndex
[src]Returns the tree index of the left child of a node.
Panics if the height of the child node exceeds MAX_HEIGHT.
pub fn get_rch_index(&self) -> TreeIndex
[src]
pub fn get_rch_index(&self) -> TreeIndex
[src]Returns the tree index of the right child of a node.
Panics if the height of the child node exceeds MAX_HEIGHT.
pub fn get_child_index_by_dir(&self, dir: ChildDir) -> TreeIndex
[src]
pub fn get_child_index_by_dir(&self, dir: ChildDir) -> TreeIndex
[src]Returns the tree index of the child in the input direction of a node.
Panics if the height of the child node exceeds MAX_HEIGHT.
pub fn get_sibling_index(&self) -> TreeIndex
[src]
pub fn get_sibling_index(&self) -> TreeIndex
[src]Returns the tree index of the sibling of a node.
Panics if the queried node is the root, which means that the sibling doesn’t exist.
pub fn get_parent_index(&self) -> TreeIndex
[src]
pub fn get_parent_index(&self) -> TreeIndex
[src]Returns the tree index of the parent of a node.
Panics if the queried node is the root, which means that the parent doesn’t exist.
pub fn get_left_index(&self) -> Option<TreeIndex>
[src]
pub fn get_left_index(&self) -> Option<TreeIndex>
[src]Returns the index on the left of self.
pub fn get_right_index(&self) -> Option<TreeIndex>
[src]
pub fn get_right_index(&self) -> Option<TreeIndex>
[src]Returns the index on the right of self.
pub fn serialize(list: &[TreeIndex]) -> Vec<u8>
[src]
pub fn serialize(list: &[TreeIndex]) -> Vec<u8>
[src]Encode a list of tree indexes in the format: height || path || ... || path
.
If the input list is empty, return empty vector.
pub fn deserialize_as_a_unit(
bytes: &[u8],
num: usize,
begin: &mut usize
) -> Result<Vec<TreeIndex>, DecodingError>
[src]
pub fn deserialize_as_a_unit(
bytes: &[u8],
num: usize,
begin: &mut usize
) -> Result<Vec<TreeIndex>, DecodingError>
[src]Decode input bytes (height || path || ... || path
) as a list of tree indexes.
Note that bytes
is the input bytes,
num
is the target number of tree indexes,
begin
is the beginning position of bytes
.
If the decoded height exceeds MAX_HEIGHT, return DecodingError::ExceedMaxHeight.
If the bytes are not enough for decoding, return DecodingError::BytesNotEnough.
Trait Implementations
impl Ord for TreeIndex
[src]
impl Ord for TreeIndex
[src]If two indexes have the same height, the right-side one is greater.
If two indexes have different heights, the one with smaller height is greater, i.o.w., the higher the node in the SMT, the greater its index is.
impl PartialOrd<TreeIndex> for TreeIndex
[src]
impl PartialOrd<TreeIndex> for TreeIndex
[src]If two indexes have the same height, the right-side one is greater.
If two indexes have different heights, the one with smaller height is greater, i.o.w., the higher the node in the SMT, the greater its index is.
fn partial_cmp(&self, other: &Self) -> Option<Ordering>
[src]
fn partial_cmp(&self, other: &Self) -> Option<Ordering>
[src]This method returns an ordering between self
and other
values if one exists. Read more
#[must_use]fn lt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn lt(&self, other: &Rhs) -> bool
1.0.0[src]This method tests less than (for self
and other
) and is used by the <
operator. Read more
#[must_use]fn le(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn le(&self, other: &Rhs) -> bool
1.0.0[src]This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
impl Copy for TreeIndex
[src]
impl Eq for TreeIndex
[src]
impl StructuralEq for TreeIndex
[src]
impl StructuralPartialEq for TreeIndex
[src]
Auto Trait Implementations
impl RefUnwindSafe for TreeIndex
impl Send for TreeIndex
impl Sync for TreeIndex
impl Unpin for TreeIndex
impl UnwindSafe for TreeIndex
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Same<T> for T
impl<T> Same<T> for T
type Output = T
type Output = T
Should always be Self
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
[src]type Owned = T
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn to_owned(&self) -> T
[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)
[src]
pub fn clone_into(&self, target: &mut T)
[src]🔬 This is a nightly-only experimental API. (toowned_clone_into
)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,