Method PopMin

sorted_set.go:488–494

PopMin returns and remove the element with minimal score, nil if the set is empty. Time complexity of this method is : O(log(N)).

()

//
// Time complexity of this method is : O(log(N)).
func (sl *SkipList) PopMin() *SkipListNode {
	x := sl.header.level[0].forward
	if x != nil {
		sl.Remove(x.hash)
	}
	return x
}

// PeekMax returns the element with maximum score, nil if the set is empty.
//