Ejemplo n.º 1
0
        /// <summary>
        /// 单个节点
        /// </summary>
        /// <param name="node"></param>
        public void AddNode(StoreNode node)
        {
            resetEvent.Reset();
            List <ulong> lst = new List <ulong>();

            for (int i = 0; i < numReps; i++)
            {
                //getKeyForNode方法为这组虚拟结点得到惟一名称
                /** 是一个16字节长度的数组,将16字节的数组每四个字节一组,分别对应一个虚拟结点,这就是为什么上面把虚拟结点四个划分一组的原因*/
                try
                {
                    byte[] digest = MurmurHashFactory.ComputeMurmur(node.ToString() + i);
                    ulong  key    = MurmurHashFactory.Hash(digest);
                    ketamaNodes.Add(key, node);
                }
                catch (RedBlackException ex)
                {
                    if (ex.Error == ReadBlackCode.KeyExists)
                    {
                        foreach (ulong key in lst)
                        {
                            try
                            {
                                ketamaNodes.Remove(key);
                            }
                            catch
                            {
                            }
                        }
                    }
                    i--;
                }
            }
            resetEvent.Set();
        }
Ejemplo n.º 2
0
        /// <summary>
        /// 初始化添加
        /// </summary>
        /// <param name="nodes">真实节点</param>
        /// <param name="nodeCopies">每个真实节点组合的虚拟节点数</param>
        public void AddNode(List <StoreNode> nodes, int nodeCopies = 0)
        {
            resetEvent.Reset();
            shards = nodes;
            if (nodeCopies != 0)
            {
                numReps = nodeCopies;
            }
            ketamaNodes.Clear();
            //对所有节点,生成nCopies个虚拟结点
            List <ulong> lst = new List <ulong>();

            foreach (StoreNode node in nodes)
            {
                //每四个虚拟结点为一组
                lst.Clear();
                for (int i = 0; i < numReps; i++)
                {
                    try
                    {
                        //直接使用MurmurHash
                        byte[] digest = MurmurHashFactory.ComputeMurmur(node.ToString() + i);
                        ulong  key    = MurmurHashFactory.Hash(digest);
                        ketamaNodes.Add(key, node);
                        lst.Add(key);//有冲突时重新产生,理论上是不会的。
                    }
                    catch (RedBlackException ex)
                    {
                        if (ex.Error == ReadBlackCode.KeyExists)
                        {
                            foreach (ulong key in lst)
                            {
                                try
                                {
                                    ketamaNodes.Remove(key);
                                }
                                catch
                                {
                                }
                            }
                        }
                        i--;
                    }
                }
            }
            resetEvent.Set();
        }