Struct Buckets

pub struct Buckets<T: Bucketable> { /* private fields */ }

This data structure implements the bucket system described in BEP0005 (more or less).

Implementations

impl<T: Bucketable> Buckets<T>

pub fn new(our_id: Id, k: usize) -> Buckets<T>

pub fn add(&mut self, item: T, chump_list: Option<&mut Vec<T>>)

pub fn clear(&mut self)

pub fn contains(&self, id: &Id) -> bool

pub fn count(&self) -> usize

pub fn count_buckets(&self) -> usize

pub fn get_mut(&mut self, id: &Id) -> Option<&mut T>

pub fn get_nearest_nodes(&self, id: &Id, exclude: Option<&Id>) -> Vec<&T>

Get the k nearest nodes/items stored in the buckets

The returned vector is sorted by distance, from nearest to farthest.

pub fn retain<F>(&mut self, f: F)

where F: FnMut(&T) -> bool,

pub fn remove(&mut self, id: &Id) -> Option<T>

pub fn set_id(&mut self, new_id: Id)

pub fn values(&self) -> Vec<&T>

Trait Implementations

impl<T: Clone + Bucketable> Clone for Buckets<T>

fn clone(&self) -> Buckets<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.