[API Proposal]: Add TryGetSuccesor() and TryGetPrecessor() for SortedSet.

Background and motivation

Because SortedSet is implemented as a binary tree, custom methods to search for a predecessor/successor would be much more performant than searching the whole set until a value greater than the one searched for is found.

TryWeakSuccessor and WeakPredecessor would also be nice.

At the moment I use TreeSet from C5 Library because SortedSet does not offer efficient methods to search for a successor.

API Proposal

namespace System.Collections.Generic;

    public partial class SortedSet<T> : ISet<T>, ICollection<T>, ICollection, IReadOnlyCollection<T>, IReadOnlySet<T>, ISerializable, IDeserializationCallback
    {
            public bool TryGetSuccesor(T equalValue, out T? actualValue);
}
}

API Usage

// Fancy the value
var c = new SortedSet<int>();
c.Add(1);
c.Add(3);

if(c.TryGetSuccesor(2, out int b )){
   System.Console.WriteLine($"Found Successor of 2:{b}"); //Found Successor of 2: 3
}

if(c.TryGetPrecessor(2, out int b )){
   System.Console.WriteLine($"Found Precessor of 2:{b}"); //Found Precessor of 2: 1
}

Alternative Designs

No response

Risks