In this case, there is only one suspect and the fact that this data structure can account for 84 percent of the total heap size of the primary dump identifies this as a very likely suspect.
在本例中，仅有一个可疑点，此数据结构占主要转储全部堆大小84%，从这一点可以看出该数据结构非常可疑。
After selecting a data structure in the Suspects TAB, you can visit the Browse TAB to see the chain of object references holding the leak container in the heap, as shown in Figure 4.
在Suspects选项卡中选择数据结构后，您可以访问Browse选项卡，查看保留堆中泄漏容器的对象引用链，如图4所示。
Growth - lists the growth observed in the size of this data structure/region in the heap in between the primary and baseline heap dump.
Growth-列出了此数据结构/区域在堆中的主要堆转储和基准堆转储之间的增长大小。
The information frame on the right of the data Structures view (Figure 8) shows either information for the whole heap or for the selected data structure.
Data Structures视图右侧的信息框(如图8所示)显示了整个堆的信息或者选定数据结构的信息。
There are two tabs, Overview and Health Report, showing information for the whole heap dump (Figure 13) or for a data structure selected from Big, Growing, Shrinking, or Steady (Figure 14).
共有两个选项卡：overview和HealthReport，显示了整个堆转储(如图13所示)的信息或为Big、Growing、Shrinking或Steady(如图14所示)选定的数据结构的信息。
While it might be possible to identify the memory leaking data structure by analyzing the heap dumps, identifying the memory leaking code which is in a infinite loop is not straightforward.
虽然通过分析堆转储能够标识内存泄漏数据结构，但是标识无限循环中的内存泄漏代码并不简单。
Fibonacci heap is a heap of time with good flat data structure. I am using C language to implement Fibonacci heap.
说明：斐波那契堆是一种具有较好平摊时间的堆数据结构。我使用C语言来实现斐波那契堆。
The structure of the row locator depends on whether the data pages are stored in a heap or a clustered table.
行定位器的结构取决于数据页是存储在堆中还是聚集表中。
The structure of the row locator depends on whether the data pages are stored in a heap or a clustered table.
行定位器的结构取决于数据页是存储在堆中还是聚集表中。
应用推荐