heap allocation 中文意思是什麼
heap allocation
解釋
堆分派- heap : n 1 （一）堆，堆積。2 〈口語〉許多，大量。3 〈美俚〉（破舊）汽車；煉焦堆。vt 1 把…堆成一堆，堆積...
- allocation : n. 1. （原料等的）分配，配給。2. 配給物，配給量。3. 定位置，部署。4. 【會】（經費、收入等的）分配法。
-
Argument specifies the total heap allocation in virtual memory
參數指定虛擬內存中總的堆分配。 -
Debug versions of heap allocation functions
堆分配函數的「 debug 」版本 -
Structures use stack allocation ; classes use heap allocation
結構使用堆棧分配，類使用堆分配。 -
Fourthly, a method of dealing dynamic heap allocation is put forward. the design and the important data structures are also given in detail
第四部分，提出了基於slab的管理內存動態堆的演算法，包括設計和重要的數據結構作了詳盡的描述。 -
Provides links to memory management and the debug heap, types of blocks on the debug heap, using the debug heap, heap state reporting functions, and tracking heap allocation requests
提供指向某些主題的鏈接，這些主題包括內存管理和調試堆，調試堆上的塊類型，如何使用調試堆，堆狀態報告函數，以及跟蹤堆分配請求等。 -
Discusses the special debug versions of the heap allocation functions, including : how the crt maps calls, the benefits of calling them explicitly, how to avoid conversion, tracking the separate types of allocations in client blocks, and the results of not defining debug
討論堆分配函數的特殊「 debug 」版本，包括： crt如何映射調用、顯式調用它們的好處、如何避免轉換、跟蹤客戶端塊中單獨的分配類型和不調用_ debug的結果。 -
After giving all - sided analysis and evaluation on kinds of memory allocation pattern, it designs rtps _ cached _ allocator, a pooled memory allocator which can decrease the overhead resulted from the general dynamic heap allocation, in order to improve the dynamic performance of a system and meet the de mand of qos predictability. a memory pool management framework, mpmf, is also shown
在全面分析總結各種內存分配模式及其優缺點與適用環境的基礎上，針對實時響應系統對動態性能和qos可預測性的需求，設計實現了一個能夠有效減少內存分配開銷的池式分配器rtpsmachemllocator ，提出了一個內存池管理框架mpmf 。 -
An allocation hook function logs heap operations to a text file, and the report hook function logs selected reports to the same text file
分配掛鉤函數將堆操作記錄到文本文件中，報告掛鉤函數將選定的報告記錄到同一文本文件中。 -
Allocating memory from the managed heap is faster than unmanaged memory allocation
從託管堆中分配內存要比非託管內存分配速度快。 -
For every partition used by a table heap or clustered table, index, or indexed view, there is one row overflow data allocation unit
對于表（堆或聚集表） 、索引或索引視圖使用的每個分區，都有一個row _ overflow _ data分配單元。 -
This not only improves locality of reference of the user program and eliminates heap fragmentation, but also greatly reduces the cost of object allocation - object allocation becomes a simple pointer addition on the top - of - heap pointer
這不僅改進了用戶程序的引用區域性並消除了堆碎片，而且極大地減少了對象分配的成本對象分配變成了在堆頂部的指針上增加指針。 -
Each partition of a heap or index contains at least an in row data allocation unit
堆或索引的每個分區至少包含一個in _ row _ data分配單元。 -
For a heap, one row is returned for the in row data allocation unit of each partition
對于堆，針對每個分區的in _ row _ data分配單元，返回與其對應的一行。
分享友人