Struct Rendezvous 

pub struct Rendezvous<N, S = RandomState> { /* private fields */ }

Implementations

impl<N> Rendezvous<N, RandomState>

where N: Hash + Eq,

pub fn new() -> Self

Default: uses RandomState (SipHash-like) for decent DoS-resistance.

pub fn from_nodes(nodes: impl IntoIterator<Item = N>) -> Self

impl<N, S> Rendezvous<N, S>

where N: Hash + Eq + Ord + PartialOrd, S: BuildHasher + Clone,

pub fn from_nodes_and_hasher( nodes: impl IntoIterator<Item = N>, build: S, ) -> Self

Construct with a custom hasher builder (e.g., ahash::RandomState).

pub fn add_node(&mut self, node: N) -> bool

pub fn remove_node(&mut self, node: &N) -> bool

pub fn pick_top<K: Hash>(&self, key: &K) -> Option<&N>

Pick the single best node (O(N) max scan).

pub fn pick_top_k<K: Hash>(&self, key: &K, k: usize) -> Vec<&N>

Pick the top-k nodes with partial selection (O(N) + O(k log k))

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

Trait Implementations

impl<N: Clone, S: Clone> Clone for Rendezvous<N, S>

fn clone(&self) -> Rendezvous<N, S>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<N: Debug, S: Debug> Debug for Rendezvous<N, S>

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

Formats the value using the given formatter.

impl<N> Default for Rendezvous<N, RandomState>

where N: Hash + Eq,

fn default() -> Self

Returns the “default value” for a type.