DSC推送模式 - 复制DSC资源的最佳方式(DSC Push mode - best way to copy DSC resources)

 内存堆绝对不是堆数据结构。 也就是说，它不是优先级队列。 我想你可以使用优先级队列堆来构建内存堆，但有更好的方法可以做到这一点。 
 
 堆栈是......好......通常，堆栈是分配给进程的固定内存块。 处理器本身将该内存块视为纯栈。 也就是说，处理器的堆栈指针指向堆栈的顶部，推送和弹出指令按预期工作，向堆栈添加内容和从堆栈中删除内容。 就这样，它是LIFO。 
 
 然而，处理器可以用堆栈做各种事情：推送和弹出不同大小的东西，直接进入它（即查看第三个项目而不弹出前两个），等等。所以尽管处理器堆栈确实有​​推送和弹出说明，它还具有更多的扩展功能。 我不会称之为纯粹的LIFO数据结构。 

The memory heap is decidedly not a heap data structure. That is, it's not a priority queue. I suppose you could use a priority queue heap to build a memory heap, but there are much better ways to do it.
 
The stack is ... well ... Typically, the stack is a fixed block of memory allocated to the process. The processor itself treats that block of memory like a pure stack. That is, the processor's stack pointer points to the top of stack, and the push and pop instructions work as expected, adding things to and removing things from the stack. In that way, it's LIFO.
 
However, the processor can do all manner of things with the stack: push and pop different sized things, address directly into it (i.e. view the third item without popping the first two), etc. So although the processor stack does have push and pop instructions, it also has much more extended functionality. I wouldn't call it a pure LIFO data structure.