Struct Node

pub struct Node<I, A> { /* private fields */ }

Node is consist of id and address, which can be used as a identifier in a distributed system.

Implementations

impl<I, A> Node<I, A>

pub const fn new(id: I, address: A) -> Self

Create a new node with id and address.

pub const fn id(&self) -> &I

Returns the id of the node.

pub const fn address(&self) -> &A

Returns the address of the node.

pub fn set_address(&mut self, address: A) -> &mut Self

Set the address of the node.

pub fn set_id(&mut self, id: I) -> &mut Self

Set the id of the node.

pub fn with_address(self, address: A) -> Self

Set the address of the node. (Builder pattern)

pub fn with_id(self, id: I) -> Self

Set the id of the node. (Builder pattern)

pub fn into_components(self) -> (I, A)

Consumes the node and returns the id and address of the node.

pub fn map_address<U>(self, f: impl FnOnce(A) -> U) -> Node<I, U>

Maps an Node<I, A> to Node<I, U> by applying a function to the current node.

Example

use nodecraft::Node;

let node = Node::new("test", 100u64);
let node = node.map_address(|address| address.to_string());
assert_eq!(node.address(), "100");

pub fn map_id<U>(self, f: impl FnOnce(I) -> U) -> Node<U, A>

Maps an Node<I, A> to Node<U, A> by applying a function to the current node.

Example

use nodecraft::Node;

let node = Node::new(1u64, 100u64);
let node = node.map_id(|id| id.to_string());
assert_eq!(node.id(), "1");

pub fn map<U, V>(self, f: impl FnOnce(I, A) -> (U, V)) -> Node<U, V>

Maps an Node<I, A> to Node<U, V> by applying a function to the current node.

Example

use nodecraft::Node;

let node = Node::new(1u64, 100u64);

let node = node.map(|id, address| (id.to_string(), address.to_string()));

assert_eq!(node.id(), "1");
assert_eq!(node.address(), "100");

Trait Implementations

impl<'a, I: Arbitrary<'a>, A: Arbitrary<'a>> Arbitrary<'a> for Node<I, A>

fn arbitrary(u: &mut Unstructured<'a>) -> Result<Self>

Generate an arbitrary value of Self from the given unstructured data.

fn arbitrary_take_rest(u: Unstructured<'a>) -> Result<Self, Error>

Generate an arbitrary value of Self from the entirety of the given unstructured data.

fn size_hint(depth: usize) -> (usize, Option<usize>)

Get a size hint for how many bytes out of an Unstructured this type needs to construct itself.

fn try_size_hint( depth: usize, ) -> Result<(usize, Option<usize>), MaxRecursionReached>

Get a size hint for how many bytes out of an Unstructured this type needs to construct itself.

impl<I: Arbitrary, A: Arbitrary> Arbitrary for Node<I, A>

fn arbitrary(g: &mut Gen) -> Self

Return an arbitrary value.

fn shrink(&self) -> Box<dyn Iterator<Item = Self>>

Return an iterator of values that are smaller than itself.

impl<I, A> Archive for Node<I, A>

where I: Archive, A: Archive,

type Archived = ArchivedNode<I, A>

The archived representation of this type.

type Resolver = NodeResolver<I, A>

The resolver for this type. It must contain all the additional information from serializing needed to make the archived type from the normal type.

fn resolve(&self, resolver: Self::Resolver, out: Place<Self::Archived>)

Creates the archived version of this value at the given position and writes it to the given output.

const COPY_OPTIMIZATION: CopyOptimization<Self> = _

An optimization flag that allows the bytes of this type to be copied directly to a writer instead of calling serialize.

impl<I: CheapClone, A: CheapClone> CheapClone for Node<I, A>

fn cheap_clone(&self) -> Self

Returns a copy of the value.

impl<I: Clone, A: Clone> Clone for Node<I, A>

fn clone(&self) -> Node<I, A>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<I: Debug, A: Debug> Debug for Node<I, A>

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

Formats the value using the given formatter.

impl<'de, I, A> Deserialize<'de> for Node<I, A>

where I: Deserialize<'de>, A: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<__D: Fallible + ?Sized, I, A> Deserialize<Node<I, A>, __D> for Archived<Node<I, A>>

where I: Archive, <I as Archive>::Archived: Deserialize<I, __D>, A: Archive, <A as Archive>::Archived: Deserialize<A, __D>,

fn deserialize( &self, deserializer: &mut __D, ) -> Result<Node<I, A>, <__D as Fallible>::Error>

Deserializes using the given deserializer

impl<I: Display, A: Display> Display for Node<I, A>

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

Formats the value using the given formatter.

impl<I, A> From<(I, A)> for Node<I, A>

fn from((id, address): (I, A)) -> Self

Converts to this type from the input type.

impl<I: Hash, A: Hash> Hash for Node<I, A>

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

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<I: Ord, A: Ord> Ord for Node<I, A>

fn cmp(&self, other: &Node<I, A>) -> 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<I, A> PartialEq<ArchivedNode<I, A>> for Node<I, A>

where I: Archive, A: Archive, <I as Archive>::Archived: PartialEq<I>, <A as Archive>::Archived: PartialEq<A>,

fn eq(&self, other: &ArchivedNode<I, 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<I, A> PartialEq<Node<I, A>> for ArchivedNode<I, A>

where I: Archive, A: Archive, <I as Archive>::Archived: PartialEq<I>, <A as Archive>::Archived: PartialEq<A>,

fn eq(&self, other: &Node<I, 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<I: PartialEq, A: PartialEq> PartialEq for Node<I, A>

fn eq(&self, other: &Node<I, 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<I: PartialOrd, A: PartialOrd> PartialOrd for Node<I, A>

fn partial_cmp(&self, other: &Node<I, A>) -> 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<__S: Fallible + ?Sized, I, A> Serialize<__S> for Node<I, A>

where I: Serialize<__S>, A: Serialize<__S>,

fn serialize( &self, serializer: &mut __S, ) -> Result<<Self as Archive>::Resolver, <__S as Fallible>::Error>

Writes the dependencies for the object and returns a resolver that can create the archived type.

impl<I, A> Serialize for Node<I, A>

where I: Serialize, A: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<I: Copy, A: Copy> Copy for Node<I, A>

impl<I: Eq, A: Eq> Eq for Node<I, A>

impl<I, A> StructuralPartialEq for Node<I, A>