Trace buffer doesn't save top of stack or contents of memory referenced by registers.
跟踪缓冲区并不保存栈顶或由寄存器所指向的内存的内容。
If our iterations are two weeks in length, we pull two weeks worth of work from the top of the priority stack.
如果我们的迭代长达两周，那么我们从优先级堆栈顶部取出值两个星期的工作。
This simple design, possible because the data obeys strict LIFO order, means that no complex data structure is needed to track stack contents - a simple pointer to the top of the stack will do.
这种简单的设计，很有可能是考虑到数据操作都符合后进先出（LIFO ）规则，这意味着访问栈的内容并不需要复杂的数据结构，一个简单的栈顶指针就能搞定一切。
The list of directories ACTS like a stack — you push a directory onto the top of the stack, and pop a directory off the top again to get it back.
该目录列表的行为就像一个堆栈——您将一个目录压入堆栈顶部，并从顶部弹出一个目录以取回它。
As we click around in the application, new events will be pushed onto the top of the stack, and the pointer will identify the last element added.
当我们在应用程序中单击的时候，新的事件将被压入堆栈顶部，指针指向最后添加的元素。
The address at the top of the stack represents the function that was last called (that is, the active function).
栈顶的地址就代表最后一次被调用的函数（也就是当前的活动函数）。
So, 0 (1) refers to the conceptual top of the stack, 4 (1) refers to four bytes down from the top (conceptually), 24 (1) is even lower conceptually, and 100 (1) is lower still.
因此，0(1)引用的是概念上的栈顶，4(1)引用的是栈顶之下4个字节的位置(概念上的)，24(1)从概念上来说位置更低，而100(1)又低一些。
If a function is executing, then the stack pointer is pointing to the top of the whole stack, which is also the top of that function's activation record.
如果一个函数正在执行，那么堆栈指针就会指向整个堆栈的顶部，这也是该函数活动记录的顶部。
The top of the stack is almost always "hot" in the cache, whereas the top of the heap is almost always "cold" (because it has likely been a long time since that memory was used).
堆栈的顶部通常在高速缓存中是“热”的，而堆的顶部通常是“冷”的（因为从这部分内存使用之后可能过了很长时间）。
On top of your Inbox tray, stack another letter tray to put items that are "on hold".
在您的收件箱架上，堆叠另一信函托盘用来放“搁置”的项目。
While many clients want to see that a blogger already has experience writing for another client, being able to show off a personal blog can help an applicant move to the top of the stack.
虽然很多客户希望看到一个博主为其他客户服务的写作经验，这能够帮助博主迅速站到一堆博客网站的前面来。
Line 20 accesses the top of the stack (the top of the stack has an index of -1) as a Lua string, prints the message, and then removes the value from the stack.
第20行访问栈顶(栈顶的索引为- 1)作为lua字符串，打印消息，然后从堆栈中删除该值。
But what's most important in this picture is at the top of each stack.
但是，图1中最重要的部分是每个堆栈的顶部。
So, the code loops back, points to the proper top pointer (which was changed because of Thread b), invokes CAS, and is done with pushing 20 into the stack.
因此，代码回到循环的开头，指向正确的top指针(线程b修改后的)，调用CAS，把20压入堆栈后结束。
Notice that if we click back a few times, then click Add, the stack is truncated, and the new event is pushed onto the top of the shortened stack.
还要注意的是，如果单击几次后退然后再单击add，那么堆栈会被截掉一部分，新的事件被压入缩短的堆栈顶部。
Stored digitally and you can place these computers on top of each other, just like a stack of paper.
所有信息都可以实现电子存储，你还可以把这些小计算机摞在一起，就像一叠纸。
Scope also supports nesting, meaning that internally it maintains a stack of instances of type t and exposes the instance at the top of the stack through the Current property.
Scope也支持嵌套，即在内部，它保留类型t的实例堆栈，并通过Current属性将实例暴露在堆栈顶部。
The client implemented its own TCP stack and ran on top of the raw socket kernel API.
客户机实现自己的tcp栈并在原始socket内核api上运行。
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.
堆栈的顶存储在result 中，使用CAS把top位置更新为 top->next并返回适当的数据。
The static Current property uses the Stack.Peek method to return the T instance at the top of the stack if one exists, returning null if the Stack is empty.
静态Current属性使用Stack.Peek方法返回位于堆栈顶端的T实例（如果存在），如果Stack 为空则返回空。
The instruction PULL or PARSE PULL take a string off the top of the stack.
指令PULL或者PARSE PULL从栈顶取得一个字符串。
Everything can be stored digitally and you can place these computers on top of each other just like a stack of paper, or throw them around the desk.
所有的东西都能进行数字型存储，你可以把这些电脑像一堆纸一样叠在一起或者把它们散落的放在桌子上。
The methods listed near the top of the stack trace are prime candidates.
在堆栈跟踪信息顶部列出的方法就是主要的候选者。
A new participant is added to the top of the stack if it is not already on the way - in this case, the stack is cut off to that one.
如果还没有开始一个新的参与者，则它将被放入堆栈的顶部—在本例中，对新参与者关闭了堆栈。
Fault analyzer starts its matching process by reading from the top of the stack downward until it comes across a function name that doesn't match between two stacks.
在匹配过程中，故障分析器从堆栈的顶部开始向下读取，直到遇到在两个堆栈之间不匹配的函数名。
Moreover, the trend is to stack chips on top of one another, to improve communications between them.
另外，如今的趋势是把芯片堆叠到一起，提高芯片之间的通讯效率。
The top level of the JMS application stack is the JMS application itself.
JMS应用程序堆栈的顶级是JMS应用程序本身。
After a function call, ESP represents the top of the stack.
在调用函数之后，ESP代表堆栈的顶部。
At the top is the user space layer, or application layer, which defines the users of the network stack.
最上面是用户空间层，或称为应用层，其中定义了网络栈的用户。
We simply move the new values for the parameters on top of the old ones and do a jump to the point in the function right after local variables are saved on the stack.
我们只需要将参数的新值移到旧值之上，然后在本地变量保存到栈上之后立即进行一个到函数中位置的跳转。
应用推荐