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)又低一些。
Now, my unit test -- which pushes 2, 4, and 6 onto the stack and pops the top two elements off to verify that they are 6 and 4 -- fails.
现在，我的单元测试-向栈上压入2，4，6，然后从栈顶弹出两个元素以检验他们是否为6，4-失败了。
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.
所有的东西都能进行数字型存储，你可以把这些电脑像一堆纸一样叠在一起或者把它们散落的放在桌子上。
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.
如果一个函数正在执行，那么堆栈指针就会指向整个堆栈的顶部，这也是该函数活动记录的顶部。
On top of your Inbox tray, stack another letter tray to put items that are "on hold".
在您的收件箱架上，堆叠另一信函托盘用来放“搁置”的项目。
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).
堆栈的顶部通常在高速缓存中是“热”的，而堆的顶部通常是“冷”的（因为从这部分内存使用之后可能过了很长时间）。
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.
虽然很多客户希望看到一个博主为其他客户服务的写作经验，这能够帮助博主迅速站到一堆博客网站的前面来。
When an exit address is encountered, the current active function has returned and the top element on the stack is discarded.
在碰到退出函数时，当前的活动函数就会返回，并释放栈顶元素。
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).
ESP（堆栈顶部）存储传递给程序的命令行参数数量，默认值是1（表示没有命令行参数）。
These steps are typically handled through continuous communications that stack key messages on top of one another.
这些步骤通常通过持续的交流进行处理，其中一个关键消息堆叠在另一个关键消息之上。
With this arrangement, even if Thread B has modified the top while Thread a tries to pop, you're sure that no elements in the stack are skipped.
这样，即使线程b在线程A试图弹出数据的同时修改了堆栈顶，也可以确保不会跳过堆栈中的元素。
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中最重要的部分是每个堆栈的顶部。
The push method observes the current top node, constructs a new node to be pushed on the stack, and then, if the topmost node has not changed since the initial observation, installs the new node.
push方法观察当前最顶的节点，构建一个新节点放在堆栈上，然后，如果最顶端的节点在初始观察之后没有变化，那么就安装新节点。
Stored digitally and you can place these computers on top of each other, just like a stack of paper.
所有信息都可以实现电子存储，你还可以把这些小计算机摞在一起，就像一叠纸。
By dropping tabs on top of one another in Opera's new beta version, you can create a "stack" -a single unit on the TAB bar that contains a group of open pages.
在Opera新的be ta版中，可以将一标签撂到另外一个标签上，就形成了一个“栈”——标签栏上的一个单独单元，包含一组打开的页面。
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，那么堆栈会被截掉一部分，新的事件被压入缩短的堆栈顶部。
The client implemented its own TCP stack and ran on top of the raw socket kernel API.
客户机实现自己的tcp栈并在原始socket内核api上运行。
The lua_setglobal function then assigns the top value on the stack to a named global variable.
然后，lua_setglobal函数将栈顶的值赋给一个有名称的全局变量。
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 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从栈顶取得一个字符串。
peek() should leave the top item on the stack.
peek()应该保留栈顶的项目。
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 methods listed near the top of the stack trace are prime candidates.
在堆栈跟踪信息顶部列出的方法就是主要的候选者。
应用推荐