Pop the stack and draw a green rectangle to remove the previous translation and scaling.
从堆栈中取出坐标，绘制一个绿色矩形，以便删除之前的转换和缩放。
The reason for this is that during execution, a thread can pop any number of references from its stack — references that could have been stored elsewhere during execution.
这样做的原因在于，执行期间线程可以从其栈中弹出任意数量的引用——执行过程中可能存储在其他位置的引用。
It doesn't make sense to have a stack that pushes but doesn't pop, so you test the methods together as part of the contract the stack exposes to its client.
拥有可以推动但不能弹出的堆栈没有任何意义，因此，您可以将这些方法作为堆栈暴露给其客户机的契约的一部分进行测试。
If the character is an operator, pop two operands, perform the appropriate operation, and then push the result onto the stack.
如果字符是个操作符，弹出两个操作数，执行恰当操作，然后把结果压入堆栈。
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 you navigate through the application you build a stack of activities that you can then pop out of by using the back button on the phone.
当您在应用程序中导航时，就创建了一个活动堆栈，使用手机上的后退按钮就就可从该堆栈中出来。
The plug-in is composed of three functions, a handful of shell options, and an alias for popd that persists the directory stack with each pop operation.
这个插件包含三个函数、几个shell选项和popd的别名（为每个弹出操作保留目录堆栈）。
If you pop the first item of a list, you have a queue; whereas, if you pop the last item of a list, you have a stack, as shown in Listing 8.
如果弹出list的第一项，则是一个队列；反之，如果弹出list的最后一项，则是一个堆栈，如清单8所示。
In this case, ensuring that pop throws an exception if push hasn't been called (or logically, if the stack is empty) means that the stack has a state.
在这种情况下，如果push没有被调用(或者从逻辑上讲，栈为空)的情况下确保pop抛出一个异常，则意味着栈有一个状态。
If you called pop again, then foo should be returned and the stack should be empty (assuming there wasn't anything in it before you added the two objects).
如果再次调用pop，那么应该返回foo，然后栈为空(假设在添加这两个对象之前栈中没有对象)。
Although the directory stack system supports multiple directories, it frequently gets used for only one or two while you temporarily pop somewhere else.
尽管目录堆栈系统支持多个目录，但通常是在您临时弹出到其他目录时将它用于一个或两个目录。
Those variables pop off the stack when their containing function is complete.
当其所包含的函数完成后，这些变量将从堆栈中弹出。
Unfortunately, there are problems with the pop implementation of the stack-both of the obvious and the non-obvious variety.
不幸的是，这种堆栈弹出实现有问题—包括明显的问题和不太明显的问题。
At the end of the postfix expression, pop a result from the stack.
到后缀表达式末尾，从堆栈中弹出结果。
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试图弹出数据的同时修改了堆栈顶，也可以确保不会跳过堆栈中的元素。
If you push the Numbers 2, 4, and 6 onto a stack and then pop the stack twice, you will get 6 and 4, in that order.
如果你向堆栈压入数据2,4,6，然后弹出栈两次，你将按照顺序得到6与4。
Now I can code the behavior for the pop method, which ensures that if the stack is logically empty, an exception will be thrown.
现在我可以为pop方法编写行为，即确保当栈在逻辑上为空时，抛出一个异常。
When each of the other elements are parsed, you pop the Employee object off the stack, call the relevant set function, and push the object back on to the stack.
每当其他元素被解析时，您将这个Employee对象弹出Stack，调用相关的set函数，然后将该对象推回Stack。
In the pop method, after the top pointer is decremented, elements still maintains a reference to the object being popped off the stack.
在pop方法中，在顶部指针递减之后，elements仍然会保留对将弹出堆栈的对象的引用。
When the employee close element is parsed, you pop the completed object from the stack, and add it to a List object.
当employeeclose元素被解析时，您将完成的对象弹出Stack，并将其添加到一个List对象。
Arrays respond to push and pop, where push adds an item (at its last spot) and pop removes one (like a stack, from the last position).
Arrays支持push和pop操作，其中push增加项目(在其最后一个位置)而pop移除项目(就像堆栈，从最后一个开始)。
When it is an operator, pop two Numbers from the stack, do the calculation, and push back the result.
当它是一个操作符时，从栈中弹出两个数进行运算，并且将运算结果压入栈中。
Stack is automatically allocated and released by C++ complier. It has more efficiency using specific push/pop instructions.
栈由编译器自动分配释放，有专门的入栈出栈指令，具有较高的效率。
Stack is automatically allocated and released by C++ complier. It has more efficiency using specific push/pop instructions.
栈由编译器自动分配释放，有专门的入栈出栈指令，具有较高的效率。
应用推荐