func (ch *ConsistentHash) insertUnsafe(bucket string) {
	for x := 0; x < ch.ReplicasOrDefault(); x++ {
		ch.hashring = InsertionSort(ch.hashring, HashedBucket{
			Bucket:   bucket,
			Replica:  x,
			Hashcode: ch.hashcode(ch.bucketHashKey(bucket, x)),
		})
	}
}
// insert inserts a hashring bucket.
//
// insert uses an insertion sort such that the
// resulting ring will remain sorted after insert.
//
// it will also insert `ReplicasOrDefault` copies of the bucket
// to help distribute items across buckets more evenly.
insert inserts a hashring bucket.

insert uses an insertion sort such that the
resulting ring will remain sorted after insert.

it will also insert `ReplicasOrDefault` copies of the bucket
to help distribute items across buckets more evenly.
// insert inserts a hashring bucket . // // insert uses an insertion sort such that the // resulting ring will remain sorted after insert . // // it will also insert ` ReplicasOrDefault ` copies of the bucket // to help distribute items across buckets more evenly .
func (ch *ConsistentHash) insertUnsafe(bucket string) {
	for x := 0; x < ch.ReplicasOrDefault(); x++ {
		ch.hashring = InsertionSort(ch.hashring, HashedBucket{
			Bucket:   bucket,
			Replica:  x,
			Hashcode: ch.hashcode(ch.bucketHashKey(bucket, x)),
		})
	}
}
func ( ch * ConsistentHash ) insertUnsafe ( bucket string ) { for x := 0 ; x < ch . ReplicasOrDefault ( ) ; x ++ { ch . hashring = InsertionSort ( ch . hashring , HashedBucket { Bucket : bucket , Replica : x , Hashcode : ch . hashcode ( ch . bucketHashKey ( bucket , x ) ) , } ) } }
insert inserts a hashring bucket.
insert inserts a hashring bucket .