initial import
This commit is contained in:
182
core/hash/consistenthash_test.go
Normal file
182
core/hash/consistenthash_test.go
Normal file
@@ -0,0 +1,182 @@
|
||||
package hash
|
||||
|
||||
import (
|
||||
"fmt"
|
||||
"strconv"
|
||||
"testing"
|
||||
|
||||
"github.com/stretchr/testify/assert"
|
||||
|
||||
"zero/core/mathx"
|
||||
)
|
||||
|
||||
const (
|
||||
keySize = 20
|
||||
requestSize = 1000
|
||||
)
|
||||
|
||||
func BenchmarkConsistentHashGet(b *testing.B) {
|
||||
ch := NewConsistentHash()
|
||||
for i := 0; i < keySize; i++ {
|
||||
ch.Add("localhost:" + strconv.Itoa(i))
|
||||
}
|
||||
|
||||
for i := 0; i < b.N; i++ {
|
||||
ch.Get(i)
|
||||
}
|
||||
}
|
||||
|
||||
func TestConsistentHash(t *testing.T) {
|
||||
ch := NewCustomConsistentHash(0, nil)
|
||||
val, ok := ch.Get("any")
|
||||
assert.False(t, ok)
|
||||
assert.Nil(t, val)
|
||||
|
||||
for i := 0; i < keySize; i++ {
|
||||
ch.AddWithReplicas("localhost:"+strconv.Itoa(i), minReplicas<<1)
|
||||
}
|
||||
|
||||
keys := make(map[string]int)
|
||||
for i := 0; i < requestSize; i++ {
|
||||
key, ok := ch.Get(requestSize + i)
|
||||
assert.True(t, ok)
|
||||
keys[key.(string)]++
|
||||
}
|
||||
|
||||
mi := make(map[interface{}]int, len(keys))
|
||||
for k, v := range keys {
|
||||
mi[k] = v
|
||||
}
|
||||
entropy := mathx.CalcEntropy(mi, requestSize)
|
||||
assert.True(t, entropy > .95)
|
||||
}
|
||||
|
||||
func TestConsistentHashIncrementalTransfer(t *testing.T) {
|
||||
prefix := "anything"
|
||||
create := func() *ConsistentHash {
|
||||
ch := NewConsistentHash()
|
||||
for i := 0; i < keySize; i++ {
|
||||
ch.Add(prefix + strconv.Itoa(i))
|
||||
}
|
||||
return ch
|
||||
}
|
||||
|
||||
originCh := create()
|
||||
keys := make(map[int]string, requestSize)
|
||||
for i := 0; i < requestSize; i++ {
|
||||
key, ok := originCh.Get(requestSize + i)
|
||||
assert.True(t, ok)
|
||||
assert.NotNil(t, key)
|
||||
keys[i] = key.(string)
|
||||
}
|
||||
|
||||
node := fmt.Sprintf("%s%d", prefix, keySize)
|
||||
for i := 0; i < 10; i++ {
|
||||
laterCh := create()
|
||||
laterCh.AddWithWeight(node, 10*(i+1))
|
||||
|
||||
for i := 0; i < requestSize; i++ {
|
||||
key, ok := laterCh.Get(requestSize + i)
|
||||
assert.True(t, ok)
|
||||
assert.NotNil(t, key)
|
||||
value := key.(string)
|
||||
assert.True(t, value == keys[i] || value == node)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
func TestConsistentHashTransferOnFailure(t *testing.T) {
|
||||
index := 41
|
||||
keys, newKeys := getKeysBeforeAndAfterFailure(t, "localhost:", index)
|
||||
var transferred int
|
||||
for k, v := range newKeys {
|
||||
if v != keys[k] {
|
||||
transferred++
|
||||
}
|
||||
}
|
||||
|
||||
ratio := float32(transferred) / float32(requestSize)
|
||||
assert.True(t, ratio < 2.5/float32(keySize), fmt.Sprintf("%d: %f", index, ratio))
|
||||
}
|
||||
|
||||
func TestConsistentHashLeastTransferOnFailure(t *testing.T) {
|
||||
prefix := "localhost:"
|
||||
index := 41
|
||||
keys, newKeys := getKeysBeforeAndAfterFailure(t, prefix, index)
|
||||
for k, v := range keys {
|
||||
newV := newKeys[k]
|
||||
if v != prefix+strconv.Itoa(index) {
|
||||
assert.Equal(t, v, newV)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
func TestConsistentHash_Remove(t *testing.T) {
|
||||
ch := NewConsistentHash()
|
||||
ch.Add("first")
|
||||
ch.Add("second")
|
||||
ch.Remove("first")
|
||||
for i := 0; i < 100; i++ {
|
||||
val, ok := ch.Get(i)
|
||||
assert.True(t, ok)
|
||||
assert.Equal(t, "second", val)
|
||||
}
|
||||
}
|
||||
|
||||
func TestConsistentHash_RemoveInterface(t *testing.T) {
|
||||
const key = "any"
|
||||
ch := NewConsistentHash()
|
||||
node1 := newMockNode(key, 1)
|
||||
node2 := newMockNode(key, 2)
|
||||
ch.AddWithWeight(node1, 80)
|
||||
ch.AddWithWeight(node2, 50)
|
||||
assert.Equal(t, 1, len(ch.nodes))
|
||||
node, ok := ch.Get(1)
|
||||
assert.True(t, ok)
|
||||
assert.Equal(t, key, node.(*MockNode).Addr)
|
||||
assert.Equal(t, 2, node.(*MockNode).Id)
|
||||
}
|
||||
|
||||
func getKeysBeforeAndAfterFailure(t *testing.T, prefix string, index int) (map[int]string, map[int]string) {
|
||||
ch := NewConsistentHash()
|
||||
for i := 0; i < keySize; i++ {
|
||||
ch.Add(prefix + strconv.Itoa(i))
|
||||
}
|
||||
|
||||
keys := make(map[int]string, requestSize)
|
||||
for i := 0; i < requestSize; i++ {
|
||||
key, ok := ch.Get(requestSize + i)
|
||||
assert.True(t, ok)
|
||||
assert.NotNil(t, key)
|
||||
keys[i] = key.(string)
|
||||
}
|
||||
|
||||
remove := fmt.Sprintf("%s%d", prefix, index)
|
||||
ch.Remove(remove)
|
||||
newKeys := make(map[int]string, requestSize)
|
||||
for i := 0; i < requestSize; i++ {
|
||||
key, ok := ch.Get(requestSize + i)
|
||||
assert.True(t, ok)
|
||||
assert.NotNil(t, key)
|
||||
assert.NotEqual(t, remove, key)
|
||||
newKeys[i] = key.(string)
|
||||
}
|
||||
|
||||
return keys, newKeys
|
||||
}
|
||||
|
||||
type MockNode struct {
|
||||
Addr string
|
||||
Id int
|
||||
}
|
||||
|
||||
func newMockNode(addr string, id int) *MockNode {
|
||||
return &MockNode{
|
||||
Addr: addr,
|
||||
Id: id,
|
||||
}
|
||||
}
|
||||
|
||||
func (n *MockNode) String() string {
|
||||
return n.Addr
|
||||
}
|
||||
Reference in New Issue
Block a user