[Fix] Consistent hash ring lookups 1 / Use comparator function

uber-node / ringpop-node

Scalable, fault-tolerant application-layer sharding for Node.js applications

http://uber.github.io/ringpop/

MIT License

1.18k stars 146 forks source link

[Fix] Consistent hash ring lookups 1 / Use comparator function #315

Closed mennopruijssers closed 7 years ago

mennopruijssers commented 7 years ago

This is the first part of the fix for consistent hashring lookups on hash collisions where we abstract the RBTree to not care about the datatypes stored. Comparison is done by a comparator function.

This will help in later stages where the key can contain more data points instead of the hash.