Much of this work involves copying objects from one address to another within the heap.
这工作主要是将对象从一个地址复制到堆中的另一个地址。
采用堆转储。
The JVM does the core of its work in the heap.
JVM在堆中执行其工作的核心部分。
The JVM allocates the heap during initialization.
JVM在初始化的过程中分配堆。
There are 1331 objects of class CHAR on the heap.
在堆中有CHAR类的1331个对象。
OUTOFMEMORY error with free space in the heap.
在heap内仍有空闲内存时出现OUT OFMEMORY错误。
Figure 14 shows the heap usage for this application.
图14显示该应用程序的堆使用情况。
Figure 1 shows the layout of an object on the heap.
图1显示了对象在堆上的布局。
As objects are created, they are placed on the heap.
在创建对象时,对象被放在堆上。
The size of the heap at any time is heaplimit - heapbase.
任何时候堆的大小都是heaplimit-heapbase。
All other objects are placed in the other section of the heap.
所有其他对象均被放在heap的其他部分。
In Figure 1, the arrows represent references between objects in the heap.
在图1中,箭头表示堆中对象间的引用。
When the users are finished with the memory, they return it to the heap.
当用户使用完内存后,就将内存返回给堆。
Assume an object graph exists in the heap as described in Figure 7 by section I.
假定图7第i段所描述的堆中存在一个对象图。
Figure 1 represents the struct mystruct and its members in the heap segment.
图1表示堆分段中的struct mystruct及其成员。
While the heap is expanding, analyzing free memory trends is very problematic.
当扩展堆时,分析可用内存趋势会非常困难。
Any memory profiler can produce snapshots of the heap broken down by object class.
所有内存分析器都可以生成按照对象类进行分解的堆快照。
C + + offers programmers a choice of allocating objects on the heap or on the stack.
C+ +向程序员提供了在堆或堆栈中分配对象的选择。
This is the heap somewhere else in memory, but they are, in fact, in distinct locations.
这是内存中的堆,但实际上,它们在不同的地方。
The heaplimit pointer can go up, when the heap can expand, or down, as the heap shrinks.
heaplimit指针可以随着堆的扩展上升,随着堆的收缩下降。
Pinned objects usually cannot be moved because they are referenced from outside the heap.
通常不能移动固定对象,因为它们是从堆外部被引用的。
The greater the heap consumption in between the dumps, the better the analysis result.
这两个转储之间的堆耗用越大,分析结果就越好。
Heap tuning involves two parameters: the initial size of the heap and its maximum size.
堆调优涉及两个参数:堆的初始大小和最大大小。
If the count becomes zero, the object is destroyed and the memory is returned to the heap.
如果计数为零,该对象就会被销毁,其占用的内存也会返回给堆。
But it does have the ability to serialize not only the stack but also objects on the heap.
但它不仅可以序列化栈,还可以序列化堆中的对象。
Unfortunately, sometimes the number that the OS reports is much larger than the heap size.
不幸的是,有时操作系统所报告的数目会远远大于堆大小。
These options provide detailed information on the different generations of objects on the heap.
这些选项提供关于堆上对象的不同代的详细信息。
The first view you will see is a bar chart showing the most costly data structures in the heap.
您看到的第一个视图就是显示堆中成本最高的数据结构的柱形图。
This tends to leave holes in the heap requiring more time to efficiently manage the free memory.
这样会在堆中留下一些洞,需要花一些时间才能有效地管理空闲内存。
The memory manager allocates memory to threads in chunks to minimize contention on the heap lock.
内存管理器以块的形式将内存分配给线程,以最小化堆锁定争用。
应用推荐