Struct TreeKey 

pub struct TreeKey {
    pub stem: Stem,
    pub subindex: SubIndex,
}

A complete 32-byte tree key (stem + subindex).

Fields

stem: Stem

The 31-byte stem identifying the subtree.

subindex: SubIndex

The subindex within the subtree (0-255).

Implementations

impl TreeKey

pub const fn new(stem: Stem, subindex: SubIndex) -> Self

Create a new tree key from stem and subindex.

pub fn from_bytes(bytes: B256) -> Self

Create a tree key from a 32-byte array.

pub fn to_bytes(&self) -> B256

Convert to a 32-byte array.

Trait Implementations

impl Clone for TreeKey

fn clone(&self) -> TreeKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TreeKey

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

Formats the value using the given formatter.

impl Default for TreeKey

fn default() -> TreeKey

Returns the “default value” for a type.

impl From<FixedBytes<32>> for TreeKey

fn from(bytes: B256) -> Self

Converts to this type from the input type.

impl From<TreeKey> for B256

fn from(key: TreeKey) -> Self

Converts to this type from the input type.

impl Hash for TreeKey

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for TreeKey

fn eq(&self, other: &TreeKey) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl Copy for TreeKey

impl Eq for TreeKey

impl StructuralPartialEq for TreeKey