TrueCloudLab/hrw
21
0
Fork 7
Code Issues 2 Pull requests Releases 2 Activity

Remove nspcc mentions #11

Merged
fyrchik merged 1 commit from fyrchik/hrw:remove-nspcc into master 2023-08-30 08:29:20 +00:00
Conversation 0 Commits 1 Files changed 2 +1 -6
2 changed files with 1 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files
Showing only changes of commit 1b7ec474c9 - Show all commits

2
LICENSE
View file

@ -1,6 +1,6 @@
MIT License MIT License
Copyright (c) 2019 NSPCC Copyright (c) 2023 TrueCloudLab
Permission is hereby granted, free of charge, to any person obtaining a copy Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal of this software and associated documentation files (the "Software"), to deal

5
README.md
View file

@ -1,10 +1,5 @@
# Golang HRW implementation # Golang HRW implementation
[![Build Status](https://travis-ci.org/TrueCloudLab/hrw.svg?branch=master)](https://travis-ci.org/TrueCloudLab/hrw)
[![codecov](https://codecov.io/gh/TrueCloudLab/hrw/badge.svg)](https://codecov.io/gh/TrueCloudLab/hrw)
[![Report](https://goreportcard.com/badge/github.com/TrueCloudLab/hrw)](https://goreportcard.com/report/github.com/TrueCloudLab/hrw)
[![GitHub release](https://img.shields.io/github/v/release/TrueCloudLab/hrw.svg)](https://git.frostfs.info/TrueCloudLab/hrw)
[Rendezvous or highest random weight](https://en.wikipedia.org/wiki/Rendezvous_hashing) (HRW) hashing is an algorithm that allows clients to achieve distributed agreement on a set of k options out of a possible set of n options. A typical application is when clients need to agree on which sites (or proxies) objects are assigned to. When k is 1, it subsumes the goals of consistent hashing, using an entirely different method. [Rendezvous or highest random weight](https://en.wikipedia.org/wiki/Rendezvous_hashing) (HRW) hashing is an algorithm that allows clients to achieve distributed agreement on a set of k options out of a possible set of n options. A typical application is when clients need to agree on which sites (or proxies) objects are assigned to. When k is 1, it subsumes the goals of consistent hashing, using an entirely different method.
## Install ## Install