Struct confitul::Node

pub struct Node {
    pub key: CKey,
    /* private fields */
}

Node is an element of a ring.

In a typical setup, a host has several nodes which act as “virtual” entry points. Each node is responsible for keys which are lower, or equal, to its key value, and points to its “next” node.

Fields

key: CKey

Implementations

impl Node

pub fn new_rand() -> Node

Examples found in repository

src/cluster.rs (line 36)

    pub fn resize(&mut self, size: usize) {
        while self.nodes.len() > size {
            let to_remove = self.nodes.iter().next().unwrap().0.clone();
            self.nodes.remove(&to_remove);
        }
        while self.nodes.len() < size {
            let node = Node::new_rand();
            match self.nodes.insert(node.key, node) {
                // Really, there should be no dupes here, we're talking
                // about *hopefully* random generation of 256 bit keys.
                // Having dupes is unlikely, should it happen, let's call it.
                Some(_) => panic!("duplicate node key"),
                None => {}
            }
        }
    }

pub fn new_test(v: f64) -> Node

pub fn range(&self) -> Range

Trait Implementations

impl Debug for Node

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

Formats the value using the given formatter.

impl Display for Node

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

Formats the value using the given formatter.

impl PartialEq<Node> for Node

fn eq(&self, other: &Node) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for Node

impl StructuralEq for Node

impl StructuralPartialEq for Node