The virtual stack -- like a real stack -- is a last in-first out (LIFO) data structure that temporarily stores function arguments and function results.
虚拟堆栈与实际堆栈类似，是一种后进先出（LIFO）的数据结构，可以用来临时存储函数参数和函数结果。
Stacks are used for storing data accessed in Last in, First Out (LIFO) order.
堆栈用于按照后进先出(LIFO)的顺序存储数据。
It removes the last element in the List, last-in first-out (LIFO) style.
它删除了List中的最后一个元素，使用后进先出(last - in first - out,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.
堆栈是一个后进先出(LIFO)队列，它保存了子例程的返回地址、数据项、指针等等。
The stack is a last-in-first-out (LIFO) queue that holds subroutine return addresses, items of data, Pointers, and so on.
堆栈是一个后进先出(LIFO)队列，它保存了子例程的返回地址、数据项、指针等等。
应用推荐