Struct everscale_network::adnl::PeersSet

pub struct PeersSet { /* private fields */ }

A set of unique short node ids

Implementations

impl PeersSet

pub fn with_capacity(capacity: u32) -> Self

Constructs new peers set with the specified fixed capacity

pub fn with_peers_and_capacity(peers: &[NodeIdShort], capacity: u32) -> Self

Constructs new peers set with some initial peers

NOTE: Only first capacity peers will be added

pub fn version(&self) -> u64

pub fn contains(&self, peer: &NodeIdShort) -> bool

pub fn get(&self, index: usize) -> Option<NodeIdShort>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn is_full(&self) -> bool

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

pub fn get_random_peers( &self, amount: u32, except: Option<&NodeIdShort> ) -> Vec<NodeIdShort>

pub fn randomly_fill_from( &self, other: &PeersSet, amount: u32, except: Option<&DashSet<NodeIdShort, RandomState>> )

pub fn insert(&self, peer_id: NodeIdShort) -> bool

Adds a value to the set.

If the set did not have this value present, true is returned.

pub fn extend<I>(&self, peers: I)where I: IntoIterator<Item = NodeIdShort>,

pub fn clone_inner(&self) -> Vec<NodeIdShort>

Clones internal node ids storage

Trait Implementations

impl<'a> IntoIterator for &'a PeersSet

type Item = &'a NodeIdShort

The type of the elements being iterated over.

type IntoIter = Iter<'a>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl IntoIterator for PeersSet

type Item = NodeIdShort

The type of the elements being iterated over.

type IntoIter = IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.