// Get node by rank.
// Note that the rank is 1-based integer. Rank 1 means the first node; Rank -1 means the last node;
//
// If remove is true, the returned nodes are removed
// If node is not found at specific rank, nil is returned
//
// Time complexity of this method is : O(log(N))
Get node by rank.
Note that the rank is 1-based integer. Rank 1 means the first node; Rank -1 means the last node.

If remove is true, the returned nodes are removed
If node is not found at specific rank, nil is returned

Time complexity of this method is : O(log(N))
// Get node by rank . // Note that the rank is 1 - based integer . Rank 1 means the first node ; Rank - 1 means the last node ; // // If remove is true the returned nodes are removed // If node is not found at specific rank nil is returned // // Time complexity of this method is : O ( log ( N ))
func (this *SortedSet) GetByRank(rank int, remove bool) *SortedSetNodeKV {
	nodes := this.GetByRankRange(rank, rank, remove)
	if len(nodes) == 1 {
		return nodes[0]
	}
	return nil
}
func ( this * SortedSet ) GetByRank ( rank int , remove bool ) * SortedSetNodeKV { nodes := this . GetByRankRange ( rank , rank , remove ) if len ( nodes ) == 1 { return nodes [ 0 ] } return nil }
Get node by rank.
Get node by rank .