// get the element with minimum score, nil if the set is empty
//
// Time complexity of this method is : O(log(N))
get the element with minimum score, nil if the set is empty

Time complexity of this method is : O(log(N))
// get the element with minimum score nil if the set is empty // // Time complexity of this method is : O ( log ( N ))
func (this *SortedSet) PeekMin() *SortedSetNodeKV {
	this.mutex.RLock()
	defer this.mutex.RUnlock()
	return &this.header.level[0].forward.SortedSetNodeKV
}
func ( this * SortedSet ) PeekMin ( ) * SortedSetNodeKV { this . mutex . RLock ( ) defer this . mutex . RUnlock ( ) return & this . header . level [ 0 ] . forward . SortedSetNodeKV }
get the element with minimum score, nil if the set is empty
get the element with minimum score nil if the set is empty