Struct maglev_rs::Maglev

pub struct Maglev { /* fields omitted */ }

! # Maglev ! An implementation of the maglev consistent hashing algorithm

Implementations

impl Maglev

pub fn new(backends: &Vec<String>, table_size: u64) -> Result<Maglev, &str>

Creates a new hash table of table_size with given backends. The backend size should be a prime, else returns an error

pub fn get_backend(&self, idx: usize) -> Option<String>

Get backend for a given index

pub fn put_backend(&mut self, backend: &String) -> Result<(), &str>

Add a backend to the list. Regenerates the hashing table

pub fn remove_backend(&mut self, backend: &String) -> Result<(), &str>

Remove a backend to the list. Regenerates the hashing table

Trait Implementations

impl Debug for Maglev

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

Formats the value using the given formatter.

impl PartialEq<Maglev> for Maglev

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

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

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

This method tests for !=.

impl StructuralPartialEq for Maglev