是SortedDictionary一个红黑树？ [英] Is SortedDictionary a red-black tree?

问题描述

我看到了有关上网本，但没有正式文件在几个引号？谁能告诉我在哪儿能得到这方面的信息？

I saw several quotes about this on the Internet but no official documentation? Can anyone tell me where I can get information about this?

推荐答案

这是不应该被记录在案，因为它是一个实施细节

This isn’t supposed to be documented since it’s an implementation detail.

例如，有一个以上的实施 SortedDictionary 的：有微软，并有单声道实施

For instance, there is more than one implementation of SortedDictionary: there’s Microsoft’s and there’s the Mono implementation.

和Mono的实施呢，其实，用红黑树在其目前的版本（2.10.9）。因此，通过使用不当前的.NET版本（你可以发现，通过反编译的code，比如反射的程序Ildasm.exe 或内置的IL观察者在 MonoDevelop的的）。

And the Mono implementation does, in fact, use a red-black tree in its current version (2.10.9). So does the current .NET version (you can find that out by decompiling the code, for instance by using Reflector, ildasm.exe or the built-in IL viewer in MonoDevelop).

不过，这是的也许的打算在未来改变，因为<一href="http://google-opensource.blogspot.co.uk/2013/01/c-containers-that-save-memory-and-time.html">there实际上是更有效的实现（如乙树）。

However, this is probably going to change in the future since there are actually more efficient implementations (as B trees).

因此​​，再次：这些信息是没有用的，这是一个实现细节，它的是的要改变以高概率

So, again: this information isn’t useful, it’s an implementation detail, and it is going to change with high probability.

这篇关于是SortedDictionary一个红黑树？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！