Struct AccessList 

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

Borrowed EIP-2930 access list.

Implementations

impl<'a> AccessList<'a>

pub const fn address_count(self) -> usize

Returns the number of address entries.

pub const fn storage_key_count(self) -> usize

Returns the total number of storage keys across all entries.

pub const fn entries(self) -> AccessListEntries<'a>

Returns an iterator over access-list entries.

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

Trait Implementations

impl<'a> Clone for AccessList<'a>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Copy for AccessList<'a>

impl<'a> Debug for AccessList<'a>

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

Formats the value using the given formatter.

impl<'a> Eq for AccessList<'a>

impl<'a> PartialEq for AccessList<'a>

fn eq(&self, other: &AccessList<'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 AccessList<'a>