为了支持类似哈希表的数据结构和像分组这样的查询操作，由LINQ创建的匿名类型必须提供稳定的哈希码。
In order to support data structures like hash tables and query operations like grouping, anonymous types created by LINQ must provide stable hash codes.
然而，尽管基于哈希表的数据交换很简单并且切实可行，但它只适合应用于最简单的互操作场景中。
However, while exchanging a hash table is easy and supported out of the box, it is only appropriate to use in the most simple of interoperability scenarios.
该算法从改变表的操作顺序及修改孔雀哈希数据结构着手，保证了片外访问的平均次数接近于1。
This algorithm ensured the average times of off-chip access close to 1 through changing the operating sequence and data structure of peacock hash.
该算法从改变表的操作顺序及修改孔雀哈希数据结构着手，保证了片外访问的平均次数接近于1。
This algorithm ensured the average times of off-chip access close to 1 through changing the operating sequence and data structure of peacock hash.
应用推荐