堆栈用于按照后进先出(LIFO)的顺序存储数据。
Stacks are used for storing data accessed in Last in, First Out (LIFO) order.
指的是当前先进先出法存货的账面价值与后进先出法的账面价值之差。
Thee difference between the reported LIFO inventory carrying amount and the inventory amount that would have been reported if the FIFO method had been used.
本地队列将按后进先出顺序(LIFO)访问，以便保留缓存位置并减少争用。
The local queues are accessed on last-in, first-out order (LIFO) in order to preserve cache locality and reduce contention.
堆栈是一个后进先出(LIFO)队列，它保存了子例程的返回地址、数据项、指针等等。
The stack is a last-in-first-out (LIFO) queue that holds subroutine return addresses, items of data, Pointers, and so on.
后进先出法与先进先出法相比，前者将导致报告的毛利相对较大，后者将导致报告的毛利最小。
The LIFO method will cause the reporting of relatively large gross profit as compared with FIFO, which will hold reported gross profit to minimum.
实行物价变动会计模式，采取存货流动计价，依照后进先出法与采用依经济寿命计算的加速折旧法。
Accounting mode for price changing use with stock floating price, and use with accelerating depreciation method in respect of last-in first-out method and economic life.
后进先出准备是一个公司存货的当期重置成本与会计账簿中按后进先出法显示的存货成本之间的差异。
The difference between the current replacement cost of a company's inventory and the LIFO cost shown in the accounting records.
虚拟堆栈与实际堆栈类似，是一种后进先出（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.
通常所用的四种存货计价方法是：（1）个别辨认法（2）平均成本法（3）先进先出法（4）后进先出法。
The four inventory valuation methods to be used usually are known as (1) specific identification (2) average cost (3) first-in, first-out (4) last-in, first-out.
它删除了List中的最后一个元素，使用后进先出(last - in first - out,LIFO)的方式。
It removes the last element in the List, last-in first-out (LIFO) style.
一个包含后进先出队列的内存区域，用来存储参数、自动变量、返回地址和其他一些必须在函数调用中进行维护的信息。
An area of memory that contains a last-in-first-out queue of storage for parameters, automatic variables, return addresses, and other information that must be maintained across function calls.
但是，很多“后进先出”公司的存在，加上很多其他公司也可能加入“后进先出”这一行列，会使未来报告的库存周转率提高。
Still, the existence of a lot of LIFO companies, plus the likelihood that some others will join the crowd, ensures some further increase it the reported turnover of inventory.
这个简单的设计，可能是因为数据遵循严格的后进先出顺序，这意味着没有复杂的数据结构需要跟踪堆栈的内容-一个简单的指针的堆栈的顶部就可以了。
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 ）规则，这意味着访问栈的内容并不需要复杂的数据结构，一个简单的栈顶指针就能搞定一切。
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 ）规则，这意味着访问栈的内容并不需要复杂的数据结构，一个简单的栈顶指针就能搞定一切。
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.
应用推荐