Finding the closest value in a SortedDictionary

Question

I have a SortedDictionary

 SortedDictionary<int, CPUOptimizationObject> myDict;

Now I want to find the first value above X. I can do something like this

foreach (var iKey in MyDict.Keys)
{
   if (iKey >= thresholdKey)
   {
       foundKey = iKey;
       break;
   }
}

but this is not very good performance.
Any better suggestion?
(is there a method for collections like binary search SortedDictionary?)

Answer 1

Although theoretically, searching for the smallest element that is greater than a given value is an operation that can be effectively performed on a binary search tree (which is implemented SortedDictionaryas), it SortedDictionarydoes not reveal the means for performing such a search in this data type.

, , . .NET; ( ).

Answer 2

, . , , .

var keys = new List<int>(myDict.Keys);
int index = keys.BinarySearch(thresholdKey);

Answer 3

temp n .toList() Sorteddictionary , n

  n.Find(item =>item >20)

, ,

Answer 4

, , foreach, :

var foo = myDict.FirstOrDefault(i => i.Key > thresholdKey);