I am looking for a way that is as efficient as the Keys property (of type KeyCollection) of a generic dictionary.
Basically I\'ve got a KeyedCollection<string, CustomNode开发者_StackOverflow社区>, and I want to be able to sort the collection by the key (or preferably with a custom comparer).
I want to use a KeyedCollection to store a class against a string key value.I have the following code:
Updated:This question contains an error which makes the benchmark meaningless.I will attempt a better benchmark comparing F# and Erlang\'s basic concurrency functionality and inquire about the results