Struct reth_dns_discovery::tree::TreeRootEntry

pub struct TreeRootEntry {
    pub enr_root: String,
    pub link_root: String,
    pub sequence_number: u64,
    pub signature: Bytes,
}

Represents an enr-root hash of subtrees containing nodes and links.

Fields

enr_root: String

The enr-root hash.

link_root: String

The root hash of the links.

sequence_number: u64

The sequence number associated with the entry.

signature: Bytes

The signature of the entry.

Implementations

impl TreeRootEntry

pub fn sign<K: EnrKey>(&mut self, key: &K) -> Result<(), EnrError>

Signs the content with the given key

pub fn verify<K: EnrKey>(&self, pubkey: &K::PublicKey) -> bool

Verify the signature of the record.

Trait Implementations

impl Clone for TreeRootEntry

fn clone(&self) -> TreeRootEntry

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for TreeRootEntry

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

Formats the value using the given formatter.

impl Display for TreeRootEntry

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

Formats the value using the given formatter.

impl FromStr for TreeRootEntry

type Err = ParseDnsEntryError

The associated error which can be returned from parsing.

fn from_str(s: &str) -> Result<Self, Self::Err>

Parses a string s to return a value of this type.

impl PartialEq for TreeRootEntry

fn eq(&self, other: &TreeRootEntry) -> 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 Eq for TreeRootEntry

impl StructuralPartialEq for TreeRootEntry

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 88 bytes