rendezvous

package module

v0.1.0 Latest Latest Go to latest Published: Nov 22, 2021 License: MIT Imports: 3 Imported by: 2

Details

rendezvous is a Go implementation of rendezvous hashing (also known as highest random weight hashing).

This implementation is not currently Go-routine safe at all.

Package rendezvous implements rendezvous hashing (a.k.a. highest random weight hashing). See http://en.wikipedia.org/wiki/Rendezvous_hashing for more information.

This section is empty.

This section is empty.

This section is empty.

type Hash struct {
	// contains filtered or unexported fields
}

func New(nodes ...string) *Hash

New creates a new Hash with the given keys (optional).

func (h *Hash) Add(nodes ...string)

Add takes any number of nodes and adds them to this Hash.

func (h *Hash) Contains(node string) bool

Contains takes a node and returns true or false whether the node is registered in this hash or not.

func (h *Hash) Get(key string) string

Get returns the node with the highest score for the given key. If this Hash has no nodes, an empty string is returned.

func (h *Hash) GetN(n int, key string) []string

GetN returns n nodes for the given key, ordered by descending score.

func (h *Hash) List() []string

List returns the list of nodes registered in this Hash.

func (h *Hash) Remove(nodes ...string)

Remove takes any number of nodes and removes them from this Hash.