Struct KNodeTable 

pub struct KNodeTable<Id, Info> { /* private fields */ }

KNodeTable Implementation This uses a flattened approach whereby buckets are pre-allocated and indexed by their distance from the local Id as a simplification of the allocation based branching approach introduced in the paper.

Implementations

impl<Id, Info> KNodeTable<Id, Info>

where Id: DatabaseId + Clone + 'static, Info: Clone + Debug + 'static,

pub fn new(id: Id, bucket_size: usize, hash_size: usize) -> KNodeTable<Id, Info>

Create a new KNodeTable with the provded bucket and hash sizes

Trait Implementations

impl<Id, Info> NodeTable<Id, Info> for KNodeTable<Id, Info>

where Id: DatabaseId + Clone + 'static, Info: Clone + Debug + 'static,

fn create_or_update(&mut self, node: &Entry<Id, Info>) -> bool

Create or update a node in the NodeTable

fn nearest(&self, id: &Id, range: Range<usize>) -> Vec<Entry<Id, Info>>

Find the nearest nodes to the provided Id in the given range

fn contains(&self, id: &Id) -> Option<Entry<Id, Info>>

Check if the node NodeTable contains a given node by Id This returns the node object if found

fn oldest<'a>(&'a self, index: usize) -> Option<Entry<Id, Info>>

Fetch the oldest node in the specified bucket

fn update_entry<F>(&mut self, id: &Id, f: F) -> bool

where F: Fn(&mut Entry<Id, Info>),

Update an entry by ID

fn remove_entry(&mut self, id: &Id)

Remove an entry by ID

fn bucket_info(&self) -> Vec<BucketInfo>

Fetch information from each bucket

fn buckets(&self) -> usize

Return available number of buckets