Struct DeniedHashes 

pub struct DeniedHashes(/* private fields */);

Operator-denied blob hashes — the local denylist from ADR 011 §Local Denylist ([content] denied_hashes). A hash here is refused at the delivery path immediately, whether or not the node holds it.

This is the “future blocklist” PinnedHashes warns about, and it is a distinct nominal type for exactly that reason: the two are both HashSet<Hash> and mean opposite things, so a mix-up would silently pin the content an operator was ordered to remove. There is deliberately no conversion between them.

Held as Arc<HashSet<Hash>> so the reload path can swap the active set without cloning.

Implementations

impl DeniedHashes

pub fn new(set: HashSet<Hash>) -> DeniedHashes

Build a DeniedHashes from a freshly parsed set.

pub fn empty() -> DeniedHashes

The empty denylist.

pub fn len(&self) -> usize

Number of denied hashes.

pub fn is_empty(&self) -> bool

Is the denylist empty?

pub fn contains(&self, hash: &Hash) -> bool

Is hash denied?

pub fn iter(&self) -> Iter<'_, Hash>

Iterate over the denied hashes.

Trait Implementations

impl Clone for DeniedHashes

fn clone(&self) -> DeniedHashes

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DeniedHashes

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

Formats the value using the given formatter.

impl Default for DeniedHashes

fn default() -> DeniedHashes

Returns the “default value” for a type.

impl<'a> IntoIterator for &'a DeniedHashes

type Item = &'a Hash

The type of the elements being iterated over.

type IntoIter = Iter<'a, Hash>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <&'a DeniedHashes as IntoIterator>::IntoIter

Creates an iterator from a value.