在针对历史堆栈的测试应用程序中，只存储随机数作为事件。
In the testing application for the history stack, we only stored random Numbers as events.
目录堆栈使您可以将一个或多个目录存储到某个临时区域中，然后再次调回它们。
The directory stack enables you to store one or more directories into a temporary area, and then bring them back again.
记住当程序进行函数调用（特别是针对递归函数）时，它必须在堆栈上存储返回地址和本地变量。
Remember that when a program makes a function call (especially for recursive ones), it has to store its return address and local variables on the stack.
在内部，所有方法内部声明的变量，包括参数，都一起存储在堆栈框架中。
Internally, all the variables declared within a method, including the parameters, are stored together in a stack frame.
因此，当进程退出时，系统将释放进程数据和堆栈的工作存储分页。
Thus, the system releases the working storage pages for the data of a process and stack when the process exits.
由于未调用任何函数，也未使用任何本地存储，所以您根本无需堆栈框架，并可通过链接寄存器退出。
Since you did not call any functions or use any local storage, you did not need a stack frame at all, so you can now just exit through the link register.
所以该指令会将链接寄存器(存有返回地址)存储到调用函数堆栈框架的恰当位置。
So this instruction stores the link register (which holds the return address) into the proper location in the calling function's stack frame.
我们将建立一个堆栈来管理应用程序的历史事件记录，也就是说存储一个列表，在表的最后添加元素。
We'll build a stack to manage the history of events in our application, meaning that we'll be storing a list, to which we will tack on elements to the end.
ESP（堆栈顶部）存储传递给程序的命令行参数数量，默认值是1（表示没有命令行参数）。
ESP or the top of the stack stores the number of command line arguments supplied to a program, which is 1 by default (for no command line arguments).
堆栈用于按照后进先出(LIFO)的顺序存储数据。
Stacks are used for storing data accessed in Last in, First Out (LIFO) order.
请注意在SPE上编写深度递归函数有些问题，原因是在SPE上没有任何堆栈溢出保护，而且本地存储也很小。
Just note that writing deeply recursive functions on the SPE is problematic because there is no stack overflow protection on the SPE, and the local store is small to begin with.
虚拟堆栈与实际堆栈类似，是一种后进先出（LIFO）的数据结构，可以用来临时存储函数参数和函数结果。
The virtual stack -- like a real stack -- is a last in-first out (LIFO) data structure that temporarily stores function arguments and function results.
请记住链接寄存器存储在调用函数的堆栈框架内，而非函数自身的堆栈框架。
Remember that the link register is stored in the calling function's stack frame, not the function's own stack frame.
我们来看看历史堆栈中需要存储的数据或属性。
Let's jump right in and talk about the sort of data, or properties, we need to store in our history stack.
因为y是在输出操作数部分中指定的，所以 %edx中更新的值存储在-8(%ebp)，堆栈上 y 的位置中。
Since y is specified in the output operand section, the updated value in %edx is stored in -8(%ebp), the location of y on stack.
Medium：此跟踪级别捕捉低级跟踪涉及的所有信息，再加上表名、数据库名和存储过程堆栈。
Medium: This tracing level captures all of the information included in low-level tracing, plus table names, the database name, and stored procedure stacks.
PowerPCABI实际上会将函数参数使用的存储空间放入调用函数的堆栈空间中。
The PowerPC ABI actually puts the storage space for the function parameters in the calling function's stack space.
典型的承载堆栈包括Web服务器、服务器端脚本功能和数据存储。
A typical hosted stack includes a Web server, server-side scripting capability, and data storage.
打开应用程序并单击链接，就会看到存储在浏览器cookie中的历史堆栈和指针。
If you open the application and click around, you'll see our history stack and pointer stored in the browser's cookies.
而不是放置到堆栈中，变量通过use关键字指定，并存储到静态存储中。
Instead of being placed on a stack, the variables specified with the use keyword are stored in static storage.
mbackchain和 -mno-backchain：这些选项控制调用方帧的地址是否作为 “backchain”指针存储到被调用方的堆栈帧。
mbackchain and -mno-backchain: These options control whether the address of the caller's frame is stored as so-called "backchain" pointer into the callee's stack frame.
堆栈的顶存储在result 中，使用CAS把top位置更新为 top->next并返回适当的数据。
The top of the stack is stored in result, and you use CAS to update the top location with top-<next and return the appropriate data.
Dirpersist跨shell调用存储并恢复目录堆栈，因此可以保留重要的状态，让您能够回到原来离开的位置继续工作。
Dirpersist saves and restores your directory stack across shell invocations, thus preserving important state so that you can resume work where you left off.
接下来，当前堆栈框架指针会被存储为指向下一个堆栈框架的后向指针，虽然尚未建立堆栈框架(这是通过负的偏移量实现的)。
Next, the current stack frame pointer is stored as the back pointer for the next stack frame, even though you haven't established the stack frame yet (this is done through negative offsets).
软件堆栈对象包含信息的多个属性元素，如虚拟机模板在文件存储库中的存储位置等。
The software stack object contains several property elements for information such as where the virtual machine template is stored in the file repository.
操作设备按照长度和厚度进行排序和堆积木材，移动堆栈到存储区或干燥窑，并将木材填入刨床。
Operate equipment to sort and stack lumber by length and thickness, move stacks to storage areas or drying kilns, and feed lumber through planers.
如何存储在堆栈指针寄存器值记忆（8085）?。
How to Store value in Stack Pointer Register to Memory (8085)?
main的堆栈最小，为32字节，而factorial的堆栈则为48字节，原因是factorial需要存储本地变量。
Main's stack will be the minimum of 32 bytes, while factorial's will be 48, because factorial has a local variable to store.
堆栈突然挡住去路，我们必须使用线程，或将状态明确存储在对象中，或者构建显式的可切换堆栈等等。
Suddenly the stack is in the way, we must use threads, or explicitly store state in objects, or build explicit, switchable stacks, and so on.
我怎样才能适应这种重复使用存储的撤销堆栈模式从一个普通的向量类型化的模型？
How can I adapt this reused-storage undo stack pattern from a generic vector to a typed model?
应用推荐