如何C＃3.0的锯齿阵列的性能优化与矩形阵列工作？ [英] How does C# 3.0 jagged array performance optimization vs. rectangular arrays work?

问题描述

在A preSS书画报C＃2008，页。 343注意事项：

In the Apress book "Illustrated C# 2008", pg. 343 notes:

一维数组已在CIL，让他们的具体说明
  性能进行优化。矩形阵列没有这些
  指示...正因为如此，它有时可以更有效地使用
  交错数组......

"One-dimensional arrays have specific instructions in the CIL that allow them to be optimized for performance. Rectangular arrays do not have these instructions...Because of this, it can sometimes be more efficient to use jagged arrays..."

有谁知道这些性能优化是如何实现的？

Does anyone know how these performance optimizations are implemented?

推荐答案

这篇文章。结果
请注意，这是写有关CLR的1.0版本;我不知道，因为有多少已经改变了。

Read this article.
Note that it's written about version 1.0 of the CLR; I don't know how much has changed since.

这篇关于如何C＃3.0的锯齿阵列的性能优化与矩形阵列工作？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！