Method distributePartitions

pkg/consistent/consistent.go:224–257

distributePartitions evenly distributes partitions among members while respecting the load factor. It ensures that partitions are assigned to members based on consistent hashing and load constraints.

()

// distributePartitions evenly distributes partitions among members while respecting the load factor.
// It ensures that partitions are assigned to members based on consistent hashing and load constraints.
func (c *Consistent) distributePartitions() {
	// Initialize maps to track the load for each member and partition assignments.
	memberLoads := make(map[string]float64)
	partitionAssignments := make(map[int]*Member)

	// Create a buffer for converting partition IDs into byte slices for hashing.
	partitionKeyBuffer := make([]byte, 8)

	// Iterate over all partition IDs to distribute them among members.
	for partitionID := uint64(0); partitionID < c.partitionCount; partitionID++ {
		// Convert the partition ID into a byte slice for hashing.
		binary.LittleEndian.PutUint64(partitionKeyBuffer, partitionID)

		// Generate a hash key for the partition using the configured hasher.
		hashKey := c.hasher(partitionKeyBuffer)

		// Find the index of the member in the sorted set where the hash key should be placed.
		index := sort.Search(len(c.sortedSet), func(i int) bool {
			return c.sortedSet[i] >= hashKey
		})

		// If the index is beyond the end of the sorted set, wrap around to the beginning.
		if index >= len(c.sortedSet) {
			index = 0
		}

		// Assign the partition to a member, ensuring the load factor is respected.
		c.assignPartitionWithLoad(int(partitionID), index, partitionAssignments, memberLoads)
	}

	// Update the Consistent instance with the new partition assignments and member loads.
	c.partitions = partitionAssignments
	c.loads = memberLoads
}

// addMemberToRing adds a member to the consistent hash ring and updates the sorted set of hashes.
func (c *Consistent) addMemberToRing(member Member) {