Method PopMax

sorted_set.go:506–512

PopMax returns and remove the element with maximum 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) PopMax() *SkipListNode {
	x := sl.tail
	if x != nil {
		sl.Remove(x.hash)
	}
	return x
}

// Put puts an element into the sorted set with specific key / value / score.
//