Method GetTwoNeighbors

consistent/consistent.go:272–301

GetTwoNeighbors returns the two closest distinct nodes to the name input in the circle.

(name string)

// GetTwoNeighbors returns the two closest distinct nodes to the name input in the circle.
func (c *Consistent) GetTwoNeighbors(name string) (proto.Node, proto.Node, error) {
	c.RLock()
	defer c.RUnlock()
	c.cacheLock.RLock()
	defer c.cacheLock.RUnlock()

	if len(c.circle) == 0 {
		return proto.Node{}, proto.Node{}, ErrEmptyCircle
	}
	key := hashKey(name)
	i := c.search(key)
	a := *c.circle[c.sortedHashes[i]]

	if len(c.sortedHashes)/c.NumberOfReplicas == 1 {
		return a, proto.Node{}, nil
	}

	start := i
	var b proto.Node
	for i = start + 1; i != start; i++ {
		if i >= len(c.sortedHashes) {
			i = 0
		}
		b = *c.circle[c.sortedHashes[i]]
		if b.ID != a.ID {
			break
		}
	}
	return a, b, nil
}

// GetNeighborsEx returns the N closest distinct nodes to the name input in the circle.
func (c *Consistent) GetNeighborsEx(name string, n int, roles proto.ServerRoles) ([]proto.Node, error) {