Struct PeerId 

pub struct PeerId { /* private fields */ }

Identifier of a peer of the network.

The data is a multihash of the public key of the peer.

Implementations

impl PeerId

pub fn from_public_key(key: PublicKey) -> PeerId

Builds a PeerId from a public key.

pub fn from_bytes(data: Vec<u8>) -> Result<PeerId, Vec<u8>>

Checks whether data is a valid PeerId. If so, returns the PeerId. If not, returns back the data as an error.

pub fn from_multihash( multihash: Multihash<UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B0>, B0>, B0>>, ) -> Result<PeerId, Multihash<UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B0>, B0>, B0>>>

Tries to turn a Multihash into a PeerId.

If the multihash does not use a valid hashing algorithm for peer IDs, or the hash value does not satisfy the constraints for a hashed peer ID, it is returned as an Err.

pub fn random() -> PeerId

Generates a random peer ID from a cryptographically secure PRNG.

This is useful for randomly walking on a DHT, or for testing purposes.

pub fn into_bytes(self) -> Vec<u8>

Returns a raw bytes representation of this PeerId.

NOTE: This byte representation is not necessarily consistent with equality of peer IDs. That is, two peer IDs may be considered equal while having a different byte representation as per into_bytes.

pub fn as_bytes(&self) -> &[u8]

Returns a raw bytes representation of this PeerId.

NOTE: This byte representation is not necessarily consistent with equality of peer IDs. That is, two peer IDs may be considered equal while having a different byte representation as per as_bytes.

pub fn to_base58(&self) -> String

Returns a base-58 encoded string of this PeerId.

pub fn is_public_key(&self, public_key: &PublicKey) -> Option<bool>

Checks whether the public key passed as parameter matches the public key of this PeerId.

Returns None if this PeerIds hash algorithm is not supported when encoding the given public key, otherwise Some boolean as the result of an equality check.

Trait Implementations

impl AsRef<[u8]> for PeerId

NOTE: This byte representation is not necessarily consistent with equality of peer IDs. That is, two peer IDs may be considered equal while having a different byte representation as per AsRef<[u8]>.

fn as_ref(&self) -> &[u8]

Converts this type into a shared reference of the (usually inferred) input type.

impl Borrow<[u8]> for PeerId

fn borrow(&self) -> &[u8]

Immutably borrows from an owned value.

impl Clone for PeerId

fn clone(&self) -> PeerId

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PeerId

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

Formats the value using the given formatter.

impl Display for PeerId

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

Formats the value using the given formatter.

impl From<PublicKey> for PeerId

fn from(key: PublicKey) -> PeerId

Converts to this type from the input type.

impl FromStr for PeerId

type Err = ParseError

The associated error which can be returned from parsing.

fn from_str(s: &str) -> Result<PeerId, <PeerId as FromStr>::Err>

Parses a string s to return a value of this type.

impl Hash for PeerId

fn hash<H>(&self, state: &mut H)

where H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for PeerId

fn cmp(&self, other: &PeerId) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for PeerId

fn eq(&self, other: &PeerId) -> 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 PartialOrd for PeerId

fn partial_cmp(&self, other: &PeerId) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl TryFrom<Multihash<UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B0>, B0>, B0>>> for PeerId

type Error = Multihash<UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B0>, B0>, B0>>

The type returned in the event of a conversion error.

fn try_from( value: Multihash<UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B0>, B0>, B0>>, ) -> Result<PeerId, <PeerId as TryFrom<Multihash<UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B0>, B0>, B0>>>>::Error>

Performs the conversion.

impl TryFrom<Vec<u8>> for PeerId

type Error = Vec<u8>

The type returned in the event of a conversion error.

fn try_from( value: Vec<u8>, ) -> Result<PeerId, <PeerId as TryFrom<Vec<u8>>>::Error>

Performs the conversion.

impl Eq for PeerId