tiennm99/zfoo
1
0
Fork 0
mirror of https://github.com/tiennm99/zfoo.git synced 2026-05-26 23:58:45 +00:00
Code Issues Packages Projects Releases Wiki Activity

perf[consistent]: use ArrayList insteadof LinkedList

Browse Source
This commit is contained in:
godotg
2023-03-26 12:26:31 +08:00
parent 626e96f0f3
commit d681ffc356
1 changed files with 2 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files
util/src/main/java/com/zfoo/util/math/ConsistentHash.java
+2 -5
View File
@@ -15,10 +15,7 @@ package com.zfoo.util.math;
import com.zfoo.protocol.model.Pair;
import java.util.LinkedList;
import java.util.List;
import java.util.Objects;
import java.util.TreeMap;
import java.util.*;
/**
* 带虚拟节点的一致性Hash算法，参考：http://www.zsythink.net/archives/1182
@@ -30,7 +27,7 @@ import java.util.TreeMap;
public class ConsistentHash<K, V> {
// 真实结点列表,考虑到服务器上线、下线的场景，即添加、删除的场景会比较频繁，这里使用LinkedList会更好
private List<Pair<K, V>> realNodes = new LinkedList<>();
private List<Pair<K, V>> realNodes = new ArrayList<>();
// 虚拟节点，key表示虚拟节点的hash值，value表示虚拟节点的名称
private TreeMap<Integer, Pair<K, V>> virtualNodeTreeMap = new TreeMap<>();