Trait nakamoto_node::client::peer::Store

pub trait Store {
    fn get(&self, ip: &IpAddr) -> Option<&KnownAddress>;
    fn get_mut(&mut self, ip: &IpAddr) -> Option<&mut KnownAddress>;
    fn insert(&mut self, ip: IpAddr, ka: KnownAddress) -> bool;
    fn remove(&mut self, ip: &IpAddr) -> Option<KnownAddress>;
    fn iter(
        &'a self
    ) -> Box<dyn Iterator<Item = (&'a IpAddr, &'a KnownAddress)> + 'a, Global>;
    fn len(&self) -> usize;
    fn clear(&mut self);
    fn flush(&mut self) -> Result<(), Error>;

    fn is_empty(&self) -> bool { ... }
    fn seed<S>(
        &mut self,
        seeds: impl Iterator<Item = S>,
        source: Source
    ) -> Result<(), Error>
    where
        S: ToSocketAddrs,
    { ... }
}

Peer store.

Used to store peer addresses and metadata.

Required Methods

fn get(&self, ip: &IpAddr) -> Option<&KnownAddress>

Get a known peer address.

fn get_mut(&mut self, ip: &IpAddr) -> Option<&mut KnownAddress>

Get a known peer address mutably.

fn insert(&mut self, ip: IpAddr, ka: KnownAddress) -> bool

Insert a new address into the store. Returns true if the address was inserted, or false if it was already known.

fn remove(&mut self, ip: &IpAddr) -> Option<KnownAddress>

Remove an address from the store.

fn iter(
    &'a self
) -> Box<dyn Iterator<Item = (&'a IpAddr, &'a KnownAddress)> + 'a, Global>

Return an iterator over the known addresses.

fn len(&self) -> usize

Returns the number of addresses.

fn clear(&mut self)

Clears the store of all addresses.

fn flush(&mut self) -> Result<(), Error>

Flush data to permanent storage.

Provided Methods

fn is_empty(&self) -> bool

Returns true if there are no addresses.

fn seed<S>(
    &mut self,
    seeds: impl Iterator<Item = S>,
    source: Source
) -> Result<(), Error>where
    S: ToSocketAddrs,

Seed the peer store with addresses. Fails if none of the seeds could be resolved to addresses.

Implementations on Foreign Types

impl Store for HashMap<IpAddr, KnownAddress, RandomState>

Implementation of Store for [crate::collections::HashMap].

fn get_mut(&mut self, ip: &IpAddr) -> Option<&mut KnownAddress>

fn get(&self, ip: &IpAddr) -> Option<&KnownAddress>

fn remove(&mut self, ip: &IpAddr) -> Option<KnownAddress>

fn insert(&mut self, ip: IpAddr, ka: KnownAddress) -> bool

fn iter(
    &'a self
) -> Box<dyn Iterator<Item = (&'a IpAddr, &'a KnownAddress)> + 'a, Global>

fn clear(&mut self)

fn len(&self) -> usize

fn flush(&mut self) -> Result<(), Error>

impl Store for HashMap<IpAddr, KnownAddress, RandomState>

Implementation of Store for std::collections::HashMap.

fn get_mut(&mut self, ip: &IpAddr) -> Option<&mut KnownAddress>

fn get(&self, ip: &IpAddr) -> Option<&KnownAddress>

fn remove(&mut self, ip: &IpAddr) -> Option<KnownAddress>

fn insert(&mut self, ip: IpAddr, ka: KnownAddress) -> bool

fn iter(
    &'a self
) -> Box<dyn Iterator<Item = (&'a IpAddr, &'a KnownAddress)> + 'a, Global>

fn clear(&mut self)

fn len(&self) -> usize

fn flush(&mut self) -> Result<(), Error>

Implementors

impl Store for Cache