Patrik Nordwall e3bd02b82c Optimized ConsistentHash with array and binarySearch, see #944 ... * Benchmarked with https://gist.github.com/3720666 * Instead of using TreeMap and rangeImpl this uses an sorted array of hash values of the nodes, and uses binarySearch in java.util.Arrays to find next node clockwise * Benchmarked with https://gist.github.com/3720666 * Benchmark results show improvement from 500 kmsg/s to 700 kmsg/s, round-robin handles 1300 kmsg/s		2012-09-14 11:06:55 +02:00
..
src/main	Optimized ConsistentHash with array and binarySearch, see #944	2012-09-14 11:06:55 +02:00