大多数调用栈错误与这两种模式之一有关。
Most call stack errors are related to one of these two recursion patterns.
这就是说通道参数可以在多层模板调用栈中累积。
This means that tunnel parameters can accumulate from several levels of the template-invocation stack.
要使操作成功完成，调用栈中的每个类必须有必需的许可权。
Each class in the calling stack must have the required permissions for the operations to complete successfully.
您可以选择调用栈中的条目，这样可以显示变量被调用时的值。
Entries on the call stack can be selected, causing variables at the time of invocation to be displayed.
调用栈将异常传递给catch块，异常正是通过这种方式被返回给用户的。
The call stack passes the exception to the catch block, and that is how it gets returned to the user.
通道参数实际上更像是全局区，只不过在模板调用栈中可以改变它的值。
Tunnel parameters are actually more like a global pool, except you can change a value as you go further in your stack of template invocations.
每当实际代码碰到任何类型的错误，它就抛出一个异常，然后该异常就进入调用栈。
Whenever the actual code encounters any type of error, it throws an exception, which then goes to the call stack.
不用在相同的方法中使用编程事务，而是将更新操作移动到调用栈的另一个公共方法中。
Rather than using programmatic transactions within the same method, you can move the update operations to another public method within the call stack.
通过此技巧，您可以有效地在调用栈的较低层次开始事务，从而减少花费在数据库中的时间。
With this technique, you are effectively starting the transaction at a lower level in the call stack, thereby reducing the amount of time you are in the database.
这对调试器来说是难以置信地有用-它意味着调用栈完全可靠，即使你没有正被调试的所有模块的符号。
This was unbelievably useful for debuggers - it meant that call stacks were quite reliable, even if you didn't have symbols for all the modules being debugged.
如果不使用引用，就需要将整个数组或hash 表复制到该函数的调用栈中，然后在函数中再次对其进行复制。
Without a reference, you copy the entire array or hash onto the function call stack, and then copy it again in the function.
您是否了解应如何有效利用Rubinius清晰可见的内部结构，例如可以在运行时刻访问并修改字节码、查看调用栈？
Do you have ideas what you could do with Rubinius' transparency and accessible internals, i.e. accessing and modifying bytecode at runtime, inspecting the call stack etc.?
始终在调用栈的最高层(api层)启动事务有时会效率低下，特别是对于具有高用户吞吐量和高数据库并发性需求的应用程序。
Always starting transactions at the highest level in the call stack (the API layer) can be inefficient, particularly in cases of high-user-throughput and high-database-concurrency needs.
名为Cylon的调试器提供了人们所能想到的所有特性：传统的断点、基于异常的断点、调用栈、监视器以及变量的查看和操作。
The debugger - called Cylon - provides all the features one could expect: conditional breakpoints, breakpoints on exceptions, call stack, watches, the exploration and manipulation of variables.
Quantify 使我们能够了解到在调用栈中对于每一个部分的执行的最大和最小的时间，被派生的时间消耗和其他有用的信息。
Quantify enabled us to understand the maximum and minimum times for execution at each step in the call stack, the time consumed by descendents, and other useful pieces of information.
调用栈的检查在遇到PrivilegedAction实例时停止，有效地将执行指定操作所必需的许可权授予所有的后继类调用。
The check of the calling stack stops when it encounters a PrivilegedAction instance, effectively granting all subsequent class calls the required permission to perform the specified operation.
但是，即使是不可取消的任务也应该尝试保留中断状态，以防在不可取消的任务结束之后，调用栈上更高层的代码需要对中断进行处理。
However, even noncancelable tasks should attempt to preserve the interrupted status in case code higher up on the call stack wants to act on the interruption after the noncancelable task completes.
对于“Lock [AQS@135]”，它在一个程序位置出现竞争，显示了竞争的次数，时间和竞争时刻的线程调用栈。
For “Lock [AQS@135]”, it contends in one place, showing contention count, contention time, and full stack back trace of the contention.
Job Watcher与Collection Services收集的数据大致相同，但收集的信息更详细，比如调用栈和sql语句。
Job Watcher collects much of the same data that Collection Services does but also collects more detailed information, such as call stacks and SQL statements.
尽管如此，我们只有一个主线程加一个调用栈，所以为避免在读取那个文件时又去处理另一个请求，回调函数需要等待调用栈变空。
However, we only have one main thread and one call-stack, so in case there is another request being served when the said file is read, its callback will need to wait for the stack to become empty.
Debug视图(不要与Debug透视图混淆)展示了调用栈(call stack)，Variables视图展示了程序变量的当前状态，而Console视图则展示了程序。
The Debug view (not to be confused with the Debug perspective) shows the call stack, the variables view shows the current state of the program's variables, and the Console view shows the program.
有一点要注意：数组的第一个元素（而不是最后一个元素）是这个调用跟踪的栈顶。
One thing to note: the first element of the arrray is the top of the call trace, not the last.
通过这种方式，如果一个设计调用一个主机栈，您可以替换一个协调的虚拟机系统。
In this way, if a design calls for a hosting stack, you can substitute a compatible virtual system.
这一优化将递归调用转换成本地回路，这样可以防止栈溢出。
This optimization transforms recursive calls into local loops, in order to prevent stack overflows.
另外还要注意跟踪程序使用了一个栈来保存基准，所以您可以(小心地)嵌套调用。
Also note that the tracer USES a stack to maintain baselines, so it is possible to nest calls (carefully).
当函数返回到进行调用的函数时，后者一定不能依赖于仍在栈中的参数列表。
The calling function must not depend on the parameter list still being on the stack when your function returns to it.
方法调用一直沿着栈传递调用，可能传递到最终目标，或到下一个截取程序。
The method call passes the invocation up the stack, either to the final target or possibly to the next interceptor.
正如Linda所说，行为很简单：如果有人对null值调用push，那么栈应该抛出一个异常。
As Linda stated, the behavior is simple: If someone calls push with a null value, the stack should throw an exception.
正如Linda所说，行为很简单：如果有人对null值调用push，那么栈应该抛出一个异常。
As Linda stated, the behavior is simple: If someone calls push with a null value, the stack should throw an exception.
应用推荐