Struct merkle_search_tree::Page

pub struct Page<const N: usize, K> { /* private fields */ }

A group of Node instances at the same location within the tree.

A page within an MST is a probabilistically sized structure, with varying numbers of Node within. A page has a min/max key range defined by the nodes within it, and the page hash acts as a content hash, describing the state of the page and the nodes within it.

Implementations

impl<const N: usize, K> Page<N, K>

pub fn nodes(&self) -> &[Node<N, K>]

Returns the the Node in this page.

pub const fn level(&self) -> u8

Returns the tree level / deterministic / logical hight of this page in the tree.

pub fn hash(&self) -> Option<&PageDigest>

Return the cached hash of this page if any, covering the nodes and the sub-tree rooted at self.

Trait Implementations

impl<const N: usize, K: Clone> Clone for Page<N, K>

fn clone(&self) -> Page<N, K>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<const N: usize, K: Debug> Debug for Page<N, K>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'a, const N: usize, K> From<&'a Page<N, K>> for PageRange<'a, K>

fn from(page: &'a Page<N, K>) -> Self

Converts to this type from the input type.

impl<const N: usize, K: PartialEq> PartialEq<Page<N, K>> for Page<N, K>

fn eq(&self, other: &Page<N, K>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<const N: usize, K: Eq> Eq for Page<N, K>

impl<const N: usize, K> StructuralEq for Page<N, K>

impl<const N: usize, K> StructuralPartialEq for Page<N, K>