func (ch *ConsistentHash) assignmentUnsafe(item string) (bucket string) {
	index := ch.search(item)
	if index >= len(ch.hashring) {
		index = 0
	}
	bucket = ch.hashring[index].Bucket
	return
}
// assignmentUnsafe searches for the item's matching bucket based
// on a binary search, and if the index returned is outside the
// ring length, the first index (0) is returned to simulate wrapping around.
assignmentUnsafe searches for the item's matching bucket based
on a binary search, and if the index returned is outside the
ring length, the first index (0) is returned to simulate wrapping around.
// assignmentUnsafe searches for the item ' s matching bucket based // on a binary search and if the index returned is outside the // ring length the first index ( 0 ) is returned to simulate wrapping around .
func (ch *ConsistentHash) assignmentUnsafe(item string) (bucket string) {
	index := ch.search(item)
	if index >= len(ch.hashring) {
		index = 0
	}
	bucket = ch.hashring[index].Bucket
	return
}
func ( ch * ConsistentHash ) assignmentUnsafe ( item string ) ( bucket string ) { index := ch . search ( item ) if index >= len ( ch . hashring ) { index = 0 } bucket = ch . hashring [ index ] . Bucket return }
assignmentUnsafe searches for the item's matching bucket based
on a binary search, and if the index returned is outside the
ring length, the first index (0) is returned to simulate wrapping around.
assignmentUnsafe searches for the item ' s matching bucket based on a binary search and if the index returned is outside the ring length the first index ( 0 ) is returned to simulate wrapping around .