Struct NodeRef

pub struct NodeRef<N>(/* private fields */);

Reference to a node.

Implementations

impl<N: KeyspaceNode> NodeRef<N>

pub fn new(node: N) -> Self

Creates a new node reference.

pub fn inner(&self) -> &N

Returns the inner node.

Trait Implementations

impl<N> AsRef<N> for NodeRef<N>

fn as_ref(&self) -> &N

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

impl<N> Borrow<N> for NodeRef<N>

fn borrow(&self) -> &N

Immutably borrows from an owned value.

impl<N: KeyspaceNode> Clone for NodeRef<N>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<N: Debug> Debug for NodeRef<N>

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

Formats the value using the given formatter.

impl<N> Default for NodeRef<N>

fn default() -> Self

Returns the “default value” for a type.

impl<N> Deref for NodeRef<N>

type Target = Arc<N>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<N> From<N> for NodeRef<N>

fn from(node: N) -> Self

Converts to this type from the input type.

impl<N: Hash> Hash for NodeRef<N>

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<N: KeyspaceNode> HrwNode for NodeRef<N>

fn capacity(&self) -> usize

Capacity of the node.

impl<T: PartialEq> PartialEq<&T> for NodeRef<T>

fn eq(&self, other: &&T) -> 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 PartialEq<&str> for NodeRef<String>

fn eq(&self, other: &&str) -> 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<T: PartialEq> PartialEq<Arc<T>> for NodeRef<T>

fn eq(&self, other: &Arc<T>) -> 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<T: PartialEq> PartialEq<T> for NodeRef<T>

fn eq(&self, other: &T) -> 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<T: PartialEq> PartialEq<Vec<&T>> for NodeRef<Vec<T>>

fn eq(&self, other: &Vec<&T>) -> 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 PartialEq<Vec<&str>> for NodeRef<Vec<String>>

fn eq(&self, other: &Vec<&str>) -> 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<T: PartialEq> PartialEq for NodeRef<T>

fn eq(&self, other: &Self) -> 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<T: PartialEq> Eq for NodeRef<T>