Struct AccessListStorageKeys 

pub struct AccessListStorageKeys<'a> { /* private fields */ }

Borrowed storage-key list for one access-list address.

Implementations

impl<'a> AccessListStorageKeys<'a>

pub const fn len(self) -> usize

Returns the number of storage keys in this entry.

pub const fn is_empty(self) -> bool

Returns true when this entry has no storage keys.

pub const fn keys(self) -> AccessListStorageKeyItems<'a>

Returns an iterator over storage keys.

The parent access-list decoder validates every storage key before returning this borrowed model. Iterating re-parses the same bounded RLP bytes so callers can use zero-copy access without storing decoded keys.

Trait Implementations

impl<'a> Clone for AccessListStorageKeys<'a>

fn clone(&self) -> AccessListStorageKeys<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Copy for AccessListStorageKeys<'a>

impl<'a> Debug for AccessListStorageKeys<'a>

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

Formats the value using the given formatter.

impl<'a> Eq for AccessListStorageKeys<'a>

impl<'a> PartialEq for AccessListStorageKeys<'a>

fn eq(&self, other: &AccessListStorageKeys<'a>) -> 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<'a> StructuralPartialEq for AccessListStorageKeys<'a>